Physical Sciences and Mathematics Commons^™

Bidirectional Lao* Algorithm (A Faster Approach To Solve Goal-Directed Mdps), Venkata Deepti Kiran Bhuma

University of Kentucky Master's Theses

Uncertainty is a feature of many AI applications. While there are polynomial-time algorithms for planning in stochastic systems, planning is still slow, in part because most algorithms plan for all eventualities. Algorithms such as LAO* are able to find good or optimal policies more quickly when the starting state of the system is known.

In this thesis we present an extension to LAO*, called BLAO*. BLAO* is an extension of the LAO* algorithm to a bidirectional search. We show that BLAO* finds optimal or ^_E-optimal solutions for goal-directed MDPs without necessarily evaluating the entire state space. BLAO* …

Making Svg A Web Service In A Message-Based Mvc Architecture, Xiaohong Qiu, Shrideep Pallickara, Ahmet Uyar

Electrical Engineering and Computer Science - All Scholarship

We reformulate Scalable Vector Graphics browser in a Web Service architecture separating the rendering from the W3C DOM processing of events. We describe this in a message-based Model-View-Controller (M-MVC) architecture and implement it with a powerful publish-subscribe messaging infrastructure. A Web Services oriented architecture with services loosely coupled by the exchange of messages is becoming an increasingly important feature in the deployment of Internet applications. The broad applicability of this approach includes enterprise software, e-Learning, e-Science and e-Business. Our work provides a general framework for integrating Desktop and Web Service applications. We summarize the performance results from detailed tests of …

A Book Management System Elibrary, Shanpeng Song

Theses Digitization Project

"eLibrary" is a book management software application that runs on Microsoft Windows platforms. The software incorporates a Windows Explorer like interface and XML/XSL to display book details. The purpose of this project is to build a full-featured, commerical-quality software package to help people manage their books (either printed or electronic). The goal is for eLibrary to be a complete solution for people who wish to build their own personal electronic library catalog.

Preface, Thomas Hildebrandt, Alexander Kurz

Engineering Faculty Articles and Research

No abstract provided.

Cs/Mth 317/517: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

Continuation of CS/MTH/316/516. Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of sources of errors in numerical methods. Special topics and applications presented as schedule permits. 4 credit hours. Prerequisites: CS 316, MTH 233, 253, or 355. Programming course prerequisites: EGR 153 or CEG 220 or CS 241.

Cs 302-01: Client Server Databases, Karen Meyer

Computer Science & Engineering Syllabi

No abstract provided.

Creating A Video Device Application, Kevin Septor

Honors Theses

A video device, such as a webcam, has the capability to be used in many ways, including recording video and behaving like a security camera. A TV tuner card can also record video, and in addition be used for watching television. However, the video hardware and device driver the operating system uses to access it are only capable of delivering raw frames of video. A user space application is necessary for exploiting the capabilities of such a device beyond reading sequential frames of video. This research explores the desiderata in a powerful video device application, and introduces a program that …

Design And Evaluation Of Processes For Fuel Fabrication, Georg F. Mauer

Fuels Campaign (TRP)

The goal of this research project is to provide technical support to process designers working on the development of the fuel cycles for transmutation applications. Detailed process models are developed to better define the impact of fuel choice on the transmuter fuel cycle, including relative process losses, waste generation, and plant capital cost. These process models provide insight regarding required plant size and number of plants needed to mesh with the fuel recycling line. They also determine requirements for automation.

Manufacturing models for large-scale production in a hot cell environment are also developed. Combined, these two models allow the assessment …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 3, January 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

In this paper we construct a setting in which the question of when a logic supports a classical modal expansion can be made precise. Given a fully selfextensional logic S, we find sufficient conditions under which the Vietoris endofunctor V on S-referential algebras can be defined and we propose to define the modal expansions of S as the logic that arises from the V-coalgebras. As an example, we also show how the Vietoris endofunctor on referential algebras extends the Vietoris endofunctor on Stone spaces. From another point of view, we examine when a category of ‘spaces’ (X,A), ie sets X …

Algebraic Semantics For Coalgebraic Logics, Clemens Kupke, Alexander Kurz, Dirk Pattinson

Engineering Faculty Articles and Research

With coalgebras usually being defined in terms of an endofunctor T on sets, this paper shows that modal logics for T-coalgebras can be naturally described as functors L on boolean algebras. Building on this idea, we study soundness, completeness and expressiveness of coalgebraic logics from the perspective of duality theory. That is, given a logic L for coalgebras of an endofunctor T, we construct an endofunctor L such that L-algebras provide a sound and complete (algebraic) semantics of the logic. We show that if L is dual to T, then soundness and completeness of the algebraic semantics immediately yield the …

Using Web Services To Integrate Heterogeneous Simulations In A Grid Environment, J. Mark Pullen, Ryan Brunton, Don Brutzman, David Drake, Michael Hieb, Katherine L. Morse, Andreas Tolk

Computational Modeling & Simulation Engineering Faculty Publications

The distributed information technologies collectively known as Web services recently have demonstrated powerful capabilities for scalable interoperation of heterogeneous software across a wide variety of networked platforms. This approach supports a rapid integration cycle and shows promise for ultimately supporting automatic composability of services using discovery via registries. This paper presents a rationale for extending Web services to distributed simulation environments, including the High Level Architecture (HLA), together with a description and examples of the integration methodology used to develop significant prototype implementations. A logical next step is combining the power of Grid computing with Web services to facilitate rapid …

Mining Classification Rules By Using Genetic Algorithms With Non-Random Initial Population And Uniform Operator, Korkut Koray Gündoğan, Bi̇lal Alataş, Ali̇ Karci

Turkish Journal of Electrical Engineering and Computer Sciences

Classification is a supervised learning method that induces a classification model from a database and is one of the most commonly applied data mining task. The frequently employed techniques are decision tree or neural network-based classification algorithms. This work presents an efficient genetic algorithm (GA) for classification rule mining technique that discovers comprehensible IF-THEN rules using a generalized uniform population method and a uniform operator inspired from the uniform population method. Initial population is generated by methodically eliminating the randomness by generalized uniform population method. In the subsequence generations, genetic diversity is ensured and premature convergence is prevented by the …

A Platform For Software Engineering Course Projects, Bi̇rol Aygün

Turkish Journal of Electrical Engineering and Computer Sciences

The importance of projects in software engineering courses is well known. Both synthetic and real-life projects have various advantages and disadvantages. Our aim was to create a framework where students can develop projects which reflect some of the complexities of real-life, involving many concurrent, interacting, asynchronous processes, each in a different stage of development, with wide temporal differences among them - some occurring within millisconds of each other and others executing sporadically over much longer periods. In this project, which was carried out in different arrangements in several software engineering courses in three universities, the students developed both the sub- …

Optimum And Suboptimum Blind Channel And Symbol Estimation For Siso Channels, T. Engi̇n Tuncer

Turkish Journal of Electrical Engineering and Computer Sciences

We present three methods for blind channel and symbol identification from a single or multi-block observation. These methods are deterministic approaches suitable for the identification of quickly changing wireless channels. The first method uses the finite alphabet property and it has good performance even for noisy observations. It requires only a single data frame, which is a unique feature of the method. This method can also be used to identify the channel order. For multi-block observations, we present the maximal ratio combining cross relation (MRCCR) method. It is an optimum approach in terms of instantaneous SNR and is based on …

A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.

Neural Analysis Of Top Shielded Multilayered Coplanar Waveguides, Mustafa Türkmen, Celal Yildiz, Şeref Sağiroğlu

Turkish Journal of Electrical Engineering and Computer Sciences

Artificial neural networks (ANNs) have been promising tools for many applications. In recent years, a computer-aided design approach based on (ANNs) has been introduced to microwave modelling, simulation and optimization. In this work, the characteristic parameters of top shielded multilayered coplanar waveguides (CPWs) have been determined with the use of ANN models. These neural models were trained with Levenberg-Marquardt, resilient propagation, Bayesian regulation, quasi-Newton, and backpropagation learning algorithms. Better performance and learning speed with a simpler structure were achieved from these models. The results have shown that the estimated characteristic parameters are in very good agreement with the computed results …

An Implicit Surface Modeling Technique Based On A Modular Neural Network Architecture, Manuel Carcenac

Turkish Journal of Electrical Engineering and Computer Sciences

Independently from artificial intelligence applications, an artificial neural network can be viewed as a powerful tool for function reconstruction. Previous papers used this property to model an implicit surface out of some control points by reconstructing its underlying scalar field. Such an approach requests the neural network to memorize the control points, which has turned problematic for complex surfaces. In our paper, we show that this problem can be efficiently tackled by adapting the architecture of the neural network to the features compounding the surface: by learning first these features independently and then blending them gradually together, our modular architecture …

Real-Time Classification Algorithm For Recognition Of Machine Operating Modes By Use Of Self-Organizing Maps, Gancho Vachkov, Yuhiko Kiyota, Koji Komatsu, Satoshi Fujii

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper a new algorithm for classification and real-time recognition of different a-priorily assumed operating modes for construction machines is proposed. This algorithm utilizes the effectiveness of the Self-Organizing Maps (SOM) for creating the so called Separation Models, that are able to distinguish each operating mode separately. After training, these models are used in a real-time procedure, which calculates at each sampling time the minimal Euclidean distances from the current data point to a certain node of each SOM. Then the separation model (represented by a respective SOM) that has the least minimal distance to this data point defines …

A Simple And Global Optimization Algorithm For Engineering Problems: Differential Evolution Algorithm, Dervi̇ş Karaboğa, Selçuk Ökdem

Turkish Journal of Electrical Engineering and Computer Sciences

Differential Evolution (DE) algorithm is a new heuristic approach mainly having three advantages; finding the true global minimum regardless of the initial parameter values, fast convergence, and using few control parameters. DE algorithm is a population based algorithm like genetic algorithms using similar operators; crossover, mutation and selection. In this work, we have compared the performance of DE algorithm to that of some other well known versions of genetic algorithms: PGA, Grefensstette, Eshelman. In simulation studies, De Jong's test functions have been used. From the simulation results, it was observed that the convergence speed of DE is significantly better than …

The 7 C'S For Creating Living Software: A Research Perspective For Quality-Oriented Software Engineering, Mehmet Akşi̇t

Turkish Journal of Electrical Engineering and Computer Sciences

This article proposes the 7 C's for realizing quality-oriented software engineering practices. All the desired qualities of this approach are expressed in short by the term living software. The 7 C's are: Concern-oriented processes, Canonical models, Composable models, Certifiable models, Constructible models, Closure property of models and Controllable models. Each C is explained by the help of a set of definitions, a short overview of the background work and the problems that software engineers may experience in realizing the corresponding C. Further, throughout the article, a software development example is presented for illustrating the realization of the 7 C's. Finally, …

An Information System For Streamlining Software Development Process, Serkan Nalbant

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper an information system to be employed by software development organizations is proposed, which automates software development process. The proposed system aims to lower cost, improve schedule performance and enhance quality of the software projects by the means of automation and unifying of operational information. The characteristics of the proposed system are described. Furthermore, its use is illustrated via the explanation of an exemplary software system called PACE that serves as an information system for planning, controlling, measuring and improving software development process and projects. The relationship of PACE with Software Capability Maturity Model (CMM) is also provided.

A Pattern Based Approach To Web Design Formalization, Ahmet Sikici, Yasemi̇n Topaloğlu

Turkish Journal of Electrical Engineering and Computer Sciences

World Wide Web is a global information network that affects many fields of our lives. The distributed, interlinked, visual and heterogeneous structure of the web makes it an irregular development environment. In this paper we propose a pattern based approach for increasing the effectiveness of development for the Web environment. This approach is based on the representation of the core meaning of each design as a set of patterns and requires the formulation of abstract solutions in a mathematical precision. This way not only reusable design experience will be codified unambiguously, but a smooth transition between the design and implementation …

An Agile Information Systems Development Method In Use, Mehmet Nafi̇z Aydin, Frank Harmsen, Kees Van Slooten, Robert Stegwee

Turkish Journal of Electrical Engineering and Computer Sciences

Recently, agile information systems development methods, agile methods in short, have got considerable attention from practitioners. One of the reasons seems that agile methods, to some degree, can be adaptable to different project situations. However, little empirical research has been conducted on this subject. The major goal of this research is to identify which aspects of agile methods are perceived as most critical and difficult to realize and how such aspects are adapted in practice. To reach this goal we studied the working practices concerning the adaptation of an agile method in the IT department of one of the leading …

A Robustness Analysis Of Game-Theoretic Cdma Power Control, Xingzhe Fan, Murat Arcak, John T. Wen

Turkish Journal of Electrical Engineering and Computer Sciences

This paper studies robustness of a gradient-type CDMA uplink power control algorithm with respect to disturbances and time-delays. This problem is of practical importance because unmodeled secondary interference effects from neighboring cells play the role of disturbances, and propagation delays are ubiquitous in wireless data networks. We first show L_p-stability, for p \in [1,\infity], with respect to additive disturbances. We pursue L_{\infity}-stability within the input-to-state stability (ISS) framework of Sontag [7], which makes explicit the vanishing effect of the initial conditions. Next, using the ISS property and a loop transformation, we prove that global asymptotic stability is preserved for sufficiently …

Global Stability Analysis Of An End-To-End Congestion Control Scheme For General Topology Networks With Delay, Tansu Alpcan, Tamer Başar

Turkish Journal of Electrical Engineering and Computer Sciences

We analyze the stability properties of an end-to-end congestion control scheme under fixed heterogeneous delays, and for general network topologies. The scheme analyzed is based on the congestion control game of [1], with the starting point being the unique Nash equilibrium of that game. We prove global stability of this solution (and hence of the congestion control algorithm) under a mild symmetricity condition. We further demonstrate the stability of the algorithm numerically for various delays, user numbers, and topologies

Flow Controller Design And Performance Analysis For Self-Similar Network Traffic, Peng Yan

Turkish Journal of Electrical Engineering and Computer Sciences

Recent studies of high-resolution traffic measurement discovered the self-similarity in both LAN and WAN traffic. In this paper, we introduce a two-degree of freedom rate based flow controller, which includes a robust H^{\infity} control block and an LMMSE based capacity predictor. The former part can guarantee the robust stability against time-varying time delay uncertainties and the latter improves the transient response by predicting the self-similar cross-traffic. Implementation issues are discussed and performance analysis is provided to validate our design. We also investigate the prediction and control in larger time scale which is more applicable for the real network environment

Resource Harvesting Within The Oai-Pmh Framework, Herbert Van De Sompel, Michael L. Nelson, Carl Lagoze, Simeon Warner

Computer Science Faculty Publications

Motivated by preservation and resource discovery, we examine how digital resources, and not just metadata about resources, can be harvested using the Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH). We review and critique existing techniques for identifying and gathering digital resources using metadata harvested through the OAI-PMH. We introduce an alternative solution that builds on the introduction of complex object formats that provide a more accurate way to describe digital resources. We argue that the use of complex object formats as OAI-PMH metadata formats results in a reliable and attractive approach for incremental harvesting of resources using the OAI-PMH.

Metadata And Buckets In The Smart Object, Dumb Archive (Soda) Model, Michael L. Nelson, Kurt Maly, Delwin R. Croom Jr., Steven W. Robbins

Computer Science Faculty Publications

We present the Smart Object, Dumb Archive (SODA) model for digital libraries (DLs), and discuss the role of metadata in SODA. The premise of the SODA model is to "push down" many of the functionalities generally associated with archives into the data objects themselves. Thus the data objects become "smarter", and the archives "dumber". In the SODA model, archives become primarily set managers, and the objects themselves negotiate and handle presentation, enforce terms and conditions, and perform data content management. Buckets are our implementation of smart objects, and da is our reference implementation for dumb archives. We also present our …

Pperfgrid: A Grid Services-Based Tool For The Exchange Of Heterogeneous Parallel Performance Data, John Jared Hoffman

Dissertations and Theses

This thesis details the approach taken in developing PPerfGrid. Section 2 discusses other research related to this project. Section 3 provides general background on the technologies utilized in PPerfGrid, focusing on the components that make up the Grid services architecture. Section 4 provides a description of the architecture of PPerfGrid. Section 5 details the implementation of PPerfGrid. Section 6 presents tests designed to measure the overhead and scalability of the PPerfGrid application. Section 7 suggests future work, and Section 8 concludes the thesis.