Digital Commons Network^™

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 …

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 …

A Service-Based Architecture For Learning Management Systems Which Supports Personalisation And Collaboration, Markus Schmid

Theses

This work develops a service-based architecture for an extensible and customisable learning management system (LMS) runtime environment. The architecture mainly defines interfaces for the interaction of functional system components represented by loosely coupled distributed services. Services that represent functional components of the distributed LMS are called e-leaming services. In addition, underlying infrastructure services provide supportive functionality such as service-lookup within an institution. Users access the system using an LMS portal component that acts as a front-end for the LMS services.

While existing e-leaming environments provide a relatively good coverage of most of the functional requirements defined in this work, they …

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.

Multi-Modulation Schemes To Increase The Rate Of Space-Time Block Codes In Rayleigh Fading Channels, Le Chung Tran, Tadeusz A. Wysocki, Jennifer Seberry, Alfred Mertins

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

he paper examines multi-modulation schemes (MMSs) to increase the rate of our two new Complex Orthogonal Designs (CODS) proposed for eight transmit antennas, namely C₁ and C₂, corresponding to the Amicable Orthogonal Designs (AODs) (~l,l,Z,Z:l,l,Z~) and (8:1,1,1,~1,1,1,4), respectively. In addition, the optimal inter-symbol power allocation in the proposed codes in single modulation as well BS in MMSs in flat Rayleigh fading channels is considered. It turns out that, in some modulation schemes, equal power transmission pure each symbol time slot is not only optimal from the technical point of view, but also optimal in terms of achieving …

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.

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* …

Spatiotemporal Databases: Models For Attracting Students To Research, Ágnes Bércesné Novák, Peter Revesz, Zsolt Tuza

School of Computing: Conference and Workshop Papers

In higher education professors often make much effort to introduce their students to research. Unfortunately, the present standard database systems curriculum is composed of well-settled subjects that do not lead to research. The challenge is to bring the research frontier closer to students at beginner level. In this paper we describe how it can be done in the area of spatiotemporal databases. We propose a new database systems curriculum and illustrate its benefits by mentioning several highly succsesful student projects in some recent experimental introductory database systems courses that followed the new curriculum.

Resource Configuration And Network Design In Extensible Networks, Sumi Y. Choi

All Computer Science and Engineering Research

The goal of packet-switched networks has conventionally been delivering data to users. This concept is changing rapidly as current technologies make it possible to build network processing engines that apply intermediary services to data traffic. This trend introduces an extensive range of ways to develop and operate applications by allowing processing services customized for applications' needs at intermediate network users, as it can relieve individuals from the need to acquire, install, and maintain software in end systems to perform required functions. As such network services become more widely used, it will become increasingly important for service providers to have effective …

Efficient Customizable Middleware, Ravi Pratap Maddimsetty

All Computer Science and Engineering Research

The rather large feature set of current Distributed Object Computing (DOC) middleware can be a liability for certain applications which have a need for only a certain subset of these features but have to suffer performance degradation and code bloat due to all the present features. To address this concern, a unique approach to building fully customizable middleware was undertaken in FACET, a CORBA event channel written using AspectJ. FACET consists of a small, essential core that represents the basic structure and functionality of an event channel into which additional features are woven using aspects so that the resulting event …

An Iterative Beam Search Algorithm For Degenerate Primer Selection, Richard Souvenir

All Computer Science and Engineering Research

Single Nucleotide Polymorphism (SNP) Genotyping is an important molecular genetics process in the early stages of producing results that will be useful in the medical field. Due to inherent complexities in DNA manipulation and analysis, many different methods have been proposed for a standard assay. One of the proposed techniques for performing SNP Genotyping requires amplifying regions of DNA surrounding a large number of SNP loci. In order to automate a portion of this particular method, it is necessary to select a set of primers for the experiment. Selecting these primers can be formulated as the Multiple Degenerate Primer Design …

The Selection Of Materials For Roller Chains From The Perspective Of Manufacturing Process, Rahmat Saptono

Makara Journal of Technology

The selection of materials for an engineering component is not only requested by its design function and shape, but also the sequence through which it is manufactured. The manufacturing operation of roller chains involves drawing and trimming processes aimed at producing semi-finished chain drives component with a well-standardized dimension. In addition to final combination of properties required by design constraints, the ability of materials to be formed into a desired shape and geometry without failure is also critical. The objective of materials selection should therefore involve additional attributes that are not typically accommodated by the standard procedure of materials selection. …

Application Of Tabu Search Algorithm In Job Shop Scheduling, Betrianis Betrianis, Putu Teguh Aryawan

Makara Journal of Technology

Application of Tabu Search Algorithm in Job Shop Scheduling. Tabu Search is one of local search methods which is used to solve the combinatorial optimization problem. This method aimed is to make the searching process of the best solution in a complex combinatorial optimization problem(np hard), ex : job shop scheduling problem, became more effective, in a less computational time but with no guarantee to optimum solution.In this paper, tabu search is used to solve the job shop scheduling problem consists of 3 (three) cases, which is ordering package of September, October and November with objective of minimizing makespan (Cmax). …

Identification Of The First Limiting Amino Acid In Cooked Polished White Rice Fed To Weanling Holtzman Rats, Mellova Masrizal, J. B. Lamb

Makara Journal of Technology

Forty-eight male weanling rats (91 g) were utilized to study the nutritional adequacy of cooked polished white rice. Rats were individually housed, and allowed ad libitum access to one of six treatment diets. Treatment diets were 1) polished white rice plus 10% casein and 0.18% methionine, CAS, 2) polished white rice, WHR, 3) polished white rice plus 0.45% lysine, LYS, 4) polished white rice plus0.40% methionine, MET, 5) polished white rice plus 0.30% threonine, THR, 6) polished white rice plus 0.45% lysine, 0.40% methionine, and 0.40% threonine, COM. Rice was cooked prior diet formulation using a 3 to 1 ratio …

Constraint Datalog In Trust Management, Scot Anderson

School of Computing: Dissertations, Theses, and Student Research

Constraint Datalog holds an increasing role in Trust Management. We discuss several Trust Management systems and give a description of the environment and requirements for Trust Management. Constraint Datalog using addition constraints and approximation theory provides an expressive semantic with which to describe security policies for credentials, delegations and authorizations. Approximation theory allows halting in Constraint Datalog over addition constraints. We use the decision problem of Diophantine equations to show that Constraint Datalog over addition constraints is complete. Combining these two concepts provides an approximately complete, safe language. The problem of constant additions to closed languages provides reasons for using …

Using Dynamic Optimization For Control Of Real Rate Cpu Resource Management Applications, Varin Vahia, Ashvin Goel, David Steere, Jonathan Walpole, Molly H. Shor

Computer Science Faculty Publications and Presentations

In this paper we design a proportional-period optimal controller for allocating CPU to real rate multimedia applications on a general-purpose computer system. We model this computer system problem in to state space form. We design a controller based on dynamic optimization LQR tracking techniques to minimize short term and long term time deviation from the current time stamp and also CPU usage. Preliminary results on an experimental set up are encouraging.

A Fit-Gap Analysis Of E-Business Curricula Vs. Industry Need, S. Davis, Keng Siau, K. Dhenuvakonda

Research Collection School Of Computing and Information Systems

The alignment of e-business academic programs with the e-business market is examined using a fit-gap analysis. Two high-end business schools, ranked independently by US News and Business Week, were chosen as sample. A total of 391 different e-commerce courses were identified, which were classified into 24 categories. Out of these, there are two broad and distinct tracks in e-business curricula, with one track paving the way for an e-business career with a prevailing focus on the business aspect and the other track leading to a career focusing on technology and Web-based systems development. Industry demand for e-business professionals and the …

Creating A Virtual Store Image, P. Katerattanakul, Keng Siau

Research Collection School Of Computing and Information Systems

A study was conducted to describe some of the factors that needed to be considered for a virtual store. It was revealed that the growth of e-commerce and online businesses has made it essential to understand the critical attributes of image for a virtual store. Store image was described as the way in which the store was defined by customers and several studies. The study compiled 77 designs and features into a list used to construct a survey. Four hundred and twenty-seven potential customers were requested to rate the significance of each item on the list. The information gathered identified …

Hardware-Based Dynamic Storage Management For High-Performance And Real-Time Systems, Victor H. Lai

All Computer Science and Engineering Research

Most modern application programs depend on dynamic storage management to handle allocation and deallocation of memory. Unfortunately conventional software-based storage managers are relatively low performance due to the latency associated with accessing DRAM memory. Consequently, developers of programs with very specialized memory requirements, such a real-time systems, often choose to manage memory manually at the application-code level. This practice can greatly increase performance but it can also significantly complicate the development process. In this thesis we present the design, VHDL implementation and performance evaluation of hardware-based storage manager called the Optimized Hardware Estranged Buddy System (OHEBS). The OHEBS implements four …

Infrastructure For Performance Tuning Mpi Applications, Kathryn Marie Mohror

Dissertations and Theses

Clusters of workstations are becoming increasingly popular as a low-budget alternative for supercomputing power. In these systems, message-passing is often used to allow the separate nodes to act as a single computing machine. Programmers of such systems face a daunting challenge in understanding the performance bottlenecks of their applications. This is largely due to the vast amount of performance data that is collected, and the time and expertise necessary to use traditional parallel performance tools to analyze that data.

The goal of this project is to increase the level of performance tool support for message-passing application programmers on clusters of …

Minimality Of Solution Update In Conflict Resolution: An Application Of Revision Programming To Von Neumann-Morgenstern Approach, Inna Pivkina, Vladik Kreinovich

Departmental Technical Reports (CS)

In a 1944 book that started game theory (and mathematical approach to conflict resolution), von Neumann and Morgenstern proposed the notion of a solution. When the situation changes, the old solution is often no longer a solution, so it needs to be updated. In practical applications, it is usually desirable to keep the solution change "minimal" in some reasonable sense. We show that for a seemingly straightforward formalization of this minimality, checking whether a change is minimal is NP-hard. We also show that by representing the notion of a solution as a collection of revision rules, we can produce a …

Turning An Articulated Truck On A Spreadsheet, Jim Mcgovern

Articles

This paper describes how a standard office spreadsheet application was used to set up an engineering model for the simulation and analysis of the turning of articulated trucks

Vector Dissipativity Theory For Discrete-Time Large-Scale Nonlinear Dynamical Systems, Wassim M. Haddad, Qing Hui, Vijaysekhar Chellaboina, Sergey Nersesov

Department of Electrical and Computer Engineering: Faculty Publications

In analyzing large-scale systems, it is often desirable to treat the overall system as a collection of interconnected subsystems. Solution properties of the large-scale system are then deduced from the solution properties of the individual subsystems and the nature of the system interconnections. In this paper, we develop an analysis framework for discrete-time large-scale dynamical systems based on vector dissipativity notions. Specifically, using vector storage functions and vector supply rates, dissipativity properties of the discrete-time composite large-scale system are shown to be determined from the dissipativity properties of the subsystems and their interconnections. In particular, extended Kalman-Yakubovich-Popov conditions, in terms …

Storage Coalescing, Delvin C. Defoe

All Computer Science and Engineering Research

Typically, when a program executes, it creates objects dynamically and requests storage for its objects from the underlying storage allocator. The patterns of such requests can potentially lead to internal fragmentation as well as external fragmentation. Internal fragmentation occurs when the storage allocator allocates a contiguous block of storage to a program, but the program uses only a fraction of that block to satisfy a request. The unused portion of that block is wasted since the allocator cannot use it to satisfy a subsequent allocation request. External fragmentation, on the other hand, concerns chunks of memory that reside between allocated …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 2, October 2003, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Sensitivity Analysis Of Neural Control, Chin-Wang Tao, Hung T. Nguyen, J. T. Yao, Vladik Kreinovich

Departmental Technical Reports (CS)

We provide explicit formulas that describe how sensitive the resulting signal of a neural network is to the measurement errors with which we measure the inputs.

Real-Time Algorithms For Statistical Analysis Of Interval Data, Berlin Wu, Hung T. Nguyen, Vladik Kreinovich

Departmental Technical Reports (CS)

When we have only interval ranges [xi] of sample values x1,...,xn, what is the interval [V] of possible values for the variance V of these values? There are quadratic time algorithms for computing the exact lower bound V- on the variance of interval data, and for computing V+ under reasonable easily verifiable conditions. The problem is that in real life, we often make additional measurements. In traditional statistics, if we have a new measurement result, we can modify the value of variance in constant time. In contrast, previously known algorithms for processing interval data required that, once a new data …

Novel Approaches To Numerical Software With Result Verification, Laurent Granvilliers, Vladik Kreinovich, Norbert Mueller

Departmental Technical Reports (CS)

Traditional design of numerical software with result verification is based on the assumption that we know the algorithm f(x_1,...,xn) that transforms input x1,...,xn into the output y=f(x1,...,xn), and we know the intervals of possible values of the inputs. Many real-life problems go beyond this paradigm. In some cases, we do not have an algorithm f, we only know some relation (constraints) between xi and y. In other cases, in addition to knowing the intervals [xi], we may know some relations between xi; we may have some information about the probabilities of different values of xi, and we may know the …

Examination Of Focused Beam Propagation Through A Finite Non-Reciprocal Planar Chiral Slab Using Complex Fresnel Coefficients And Dual Transforms, Monish Ranjan Chatterjee, Sumit Nema, Partha P. Banerjee

Electrical and Computer Engineering Faculty Publications

Recently, uniform plane wave propagation across a nonchiral-chiral interface was examined via the development of appropriate Fresnel coefficients. In this extension, propagation of focused uniform and profiled beams through a finite, planar nonreciprocal chiral slab is investigated using complex Fresnel coefficients via angular plane wave decomposition and dual transforms.

Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura

Computer Science & Engineering Syllabi

Low-cost parallel computers such as PC clusters are becoming available, and many previously unsolvable problems can be solved using such computers. However, designing algorithms that perform well on parallel computers is often challenging. The focus of this course is on learning how to design algorithms for parallel computers and how to evaluate them.