Computer Engineering Commons^™

Selecting Metal Alloy Electric Contact Materials For Mems Switches, Ronald A. Coutu Jr., Paul E. Kladitis, Kevin D. Leedy, Robert L. Crane

Electrical and Computer Engineering Faculty Research and Publications

This paper presents a method for selecting metal alloys as the electric contact materials for microelectromechanical systems (MEMS) metal contact switches. This procedure consists of reviewing macro-switch lessons learned, utilizing equilibrium binary alloy phase diagrams, obtaining thin film material properties and, based on a suitable model, predicting contact resistance performance. After determining a candidate alloy material, MEMS switches were designed, fabricated and tested to validate the alloy selection methodology. Minimum average contact resistance values of 1.17 and 1.87 Ω were measured for micro-switches with gold (Au) and gold–platinum (Au–(6.3%)Pt) alloy electric contacts, respectively. In addition, 'hot-switched' life cycle test results …

Geon: Geophysical Data Add The 3rd Dimension In Geospatial Studies, R. Aldouri, George R. Keller, Ann Q. Gates, J. Rasillo, Leonardo Salayandia, Vladik Kreinovich, John M. Seeley, P. Taylor, S. Holloway

Departmental Technical Reports (CS)

A major trend in GIS is the addition of subsurface information to provide a 3-D perspective on data. Geophysical data provide information about subsurface structures and conditions, but require considerable analysis. The 4-D emphasis with the GEON projects has required the development of many sophisticated tools to allow users to utilize geophysical datasets that will be available on the GEON grid. Our group has created tools that will allow users to search new gravity and magnetic databases of the entire U.S. These tools will extract specific records from an Oracle database, and display the points over a map, grid and …

Computing Higher Central Moments For Interval Data, Vladik Kreinovich, Luc Longpre, Scott Ferson, Lev Ginzburg

Departmental Technical Reports (CS)

Higher central moments are very useful in statistical analysis: the third moment M3 characterizes asymmetry of the corresponding probability distribution, the fourth moment M4 describes the size of the distribution's tails, etc. When we know the exact values x1,...,xn, we can use the known formulas for computing the corresponding sample central moments. In many practical situations, however, we only know intervals [x1],...,[xn] of possible values of xi; in such situations, we want to know the range of possible values of Mm. In this paper, we propose algorithms that compute such ranges.

Variations On Particle Swarm Optimization And Their Experimental Evaluation On Maximum Satisfiability, Susan A Abdelshahid

Archived Theses and Dissertations

No abstract provided.

Time Series Classification Using Gaussian Mixture Models Of Reconstructed Phase Spaces, Richard J. Povinelli, Michael T. Johnson, Andrew C. Lindgren, Jinjin Ye

Electrical and Computer Engineering Faculty Research and Publications

A new signal classification approach is presented that is based upon modeling the dynamics of a system as they are captured in a reconstructed phase space. The modeling is done using full covariance Gaussian mixture models of time domain signatures, in contrast with current and previous work in signal classification that is typically focused on either linear systems analysis using frequency content or simple nonlinear machine learning models such as artificial neural networks. The proposed approach has strong theoretical foundations based on dynamical systems and topological theorems, resulting in a signal reconstruction, which is asymptotically guaranteed to be a complete …

Mobile Agent Based Distributed Network Management : Modeling, Methodologies And Applications, Jian Ye

Dissertations

The explosive growth of the Internet and the continued dramatic increase for all wireless services are fueling the demand for increased capacity, data rates, support of multimedia services, and support for different Quality of Services (QoS) requirements for different classes of services. Furthermore future communication networks will be strongly characterized by heterogeneity. In order to meet the objectives of instant adaptability to the users' requirements and of interoperability and seamless operation within the heterogeneous networking environments, flexibility in terms of network and resource management will be a key design issue. The new emerging technology of mobile agent (MA) has arisen …

Design And Evaluation Of Processes For Fuel Fabrication: Quarterly Progress Report #11, Georg F. Mauer

Fuels Campaign (TRP)

The eleventh quarter of the project covered the following:

• Mr. Richard Silva successfully defended his thesis in April 2004 and graduated from the MEG Master’s program.

• Further refinements on Concepts and Methods for Vision-Based Hot Cell Supervision and control, focusing on rule-based object recognition (Ph.D. Graduate Jae-Kyu Lee). Ms. Caroline Wiejak, an exchange student from the ESIEE in Marne-la-Vallee, France is continuing with the image analysis effort. To date, she has transferred Jae-Kyu’s code to Matlab, and is presently expanding its application to more complex 3D shapes.

• Graduate student Jamil Renno refined and detailed his simulations of …

A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-Liang Fok, Sangeeta Bhattacharya

All Computer Science and Engineering Research

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically gather information from their surrounding areas through a wireless sensor network. A key advantage of MobiQuery lies in its capability to meet stringent spatiotemporal performance constraints crucial to many applications. These constraints include query latency, data freshness and fidelity, and changing query areas due to user mobility. A novel just-in-time prefetching algorithm enables MobiQuery to main-tain robust spatiotemporal guarantees even when nodes op-erate under extremely low duty cycles. Furthermore, it sig-nificantly reduces the storage cost and network contention caused by continuous queries from mobile users. We …

Composing Systemic Aspects Into Component-Oriented Doc Middleware, Nanbor Wang

All Computer Science and Engineering Research

The advent and maturation of component-based middleware frameworks have sim-plified the development of large-scale distributed applications by separating system devel-opment and configuration concerns into different aspects that can be specified and com-posed at various stages of the application development lifecycle. Conventional component middleware technologies, such as J2EE [73] and .NET [34], were designed to meet the quality of service (QoS) requirements of enterprise applications, which focus largely on scalability and reliability. Therefore, conventional component middleware specifications and implementations are not well suited for distributed real-time and embedded (DRE) ap-plications with more stringent QoS requirements, such as low latency/jitter, timeliness, and …

On-Line Algorithms For Computing Mean And Variance Of Interval Data, And Their Use In Intelligent Systems, Berlin Wu, Hung T. Nguyen, Vladik Kreinovich

Departmental Technical Reports (CS)

No abstract provided.

Application Of Kolmogorov Complexity To Advanced Problems In Mechanics, Vladik Kreinovich, Isaak A. Kunin

Departmental Technical Reports (CS)

In the 1960s, A.N. Kolmogorov described the main reason why a mathematical correct solution to a system of differential equations may be not physically possible: Traditional mathematical analysis tacitly assumes that all numbers, no matter how large or how small, are physically possible. From the engineering viewpoint, however, a number like 10^{10^10} is not possible, because it exceeds the number of particles in the Universe. In this paper, we extend Kolmogorov's ideas from discrete objects to continuous objects known with given accuracy epsilon, and show how this extension can clarify the analysis of dynamical systems.

Using Fft-Based Data Processing Techniques To Characterize Asphaltic Concrete Mixtures, Scott A. Starks, Vladik Kreinovich, Roberto Araiza, Soheil Nazarian, J. Adidhela

Departmental Technical Reports (CS)

A natural way to test the quality of a pavement is to send signals with different frequencies through the pavement and compare the results with the signals passing through an ideal pavement. For this comparison, we must determine how, for the corresponding mixture, the elasticity E depends on the frequency f in the range from 0.1 to 10^5 Hz. It is very expensive to perform measurements in high frequency area (above 20 Hz). To avoid these measurements, we can use the fact that for most of these mixtures, when we change a temperature, the new dependence changes simply by scaling. …

Using 1-D Radar Observations To Detect A Space Explosion Core Among The Explosion Fragments: Sequential And Distributed Algorithms, P. Debroux, J. Boehm, Vladik Kreinovich, Gang Xiang, J. Beck, K. Tupelly, R. Kandathi, Luc Longpre, K. Villaverde

Departmental Technical Reports (CS)

A radar observes the result of a space explosion. Due to radar's low horizontal resolution, we get a 1-D signal s(t) representing different 2-D slices. Based on these slices, we must distinguish between the body at the core of the explosion and the slowly out-moving fragments. We propose new algorithms for processing this 1-D data. Since these algorithms are time-consuming, we also exploit the possibility of parallelizing these algorithms.

Geometry Of Protein Structures. I. Why Hyperbolic Surfaces Are A Good Approximation For Beta-Sheets, Boguslaw Stec, Vladik Kreinovich

Departmental Technical Reports (CS)

Protein structure is invariably connected to protein function. To analyze the structural changes of proteins, we should have a good description of basic geometry of proteins' secondary structure. A beta-sheet is one of important elements of protein secondary structure that is formed by several fragments of the protein that form a surface-like feature. The actual shapes of the beta-sheets can be very complicated, so we would like to approximate them by simpler geometrical shapes from an approximating family. Which family should we choose? Traditionally, hyperbolic (second order) surfaces have been used as a reasonable approximation to the shape of beta-sheets. …

Fuzzy And Probabilistic Models Of Association Information In Sensor Networks, Leon Reznik, Vladik Kreinovich

Departmental Technical Reports (CS)

The paper considers the problem of improving accuracy and reliability of measurement information acquired by sensor networks. It offers the way of integrating sensor measurement results with association information available or a priori derived at aggregation nodes. The models applied for describing both sensor sensor results and association information are reviewed with consideration given to both neuro-fuzzy and probabilistic models and methods. The information sources, typically available in sensor systems, are classified according to the model (fuzzy or probabilistic), which seems more feasible to be applied. The integration problem is formulated as an optimization problem.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 7, May 2004, 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.

Fusion And Perspective Correction Of Multiple Networked Video Sensors, Christopher E. Neely, John W. Lookwood

All Computer Science and Engineering Research

A network of adaptive processing elements has been developed that transforms and fuses video captured from multiple sensors. Unlike systems that rely on end-systems to process data, this system distributes the computation throughout the network in order to reduce overall network bandwidth. The network architecture is scalable because it uses a hierarchy of processing engines to perform signal processing. Nodes within the network can be dynamically reprogrammed in order to compose video from multiple sources, digitally transform camera perspectives, and adapt the video format to meet the needs of specific applications. A prototype has been developed using reconfigurable hardware that …

A Fleet Tracking System Using G.P.S. And Radios, John Mulholland, Matthew Warner, Matthew Waldron, Eric Widdison

Undergraduate Honors Capstone Projects

Doc Warner's Alaska Fishing LLC is a growing business operating out of Excursion Inlet, Alaska. Based in Bountiful, Utah, this company has experienced large amounts of growth in the past few years, and as a result has needed to make quick adaptations to accommodate larger groups of people fishing with them. Doc Warner's offers a unique experience in that they do not charter boats, but rather allow their guests to captain the boats. The number of vessels that might be fishing at any time has increased from four to more than twenty in the last three years. This large increase …

Run-Time Modification Of The Class Hierachy In A Live Java Development Environment, Joel R. Brandt

All Computer Science and Engineering Research

Class hierarchy design is central to object-oriented software development. How-ever, it is sometimes difficult for developers to anticipate all the implications of a design until implementation is underway. To support experimentation with different designs, we extend prior work on live development environments to allow run-time modification of the class hierarchy. The result is a more fluid object-oriented development process, in which immediate feedback from the executing program can be used to guide hierarchy design. This thesis presents a framework and developer support for run-time modification of class inheritance relations in JPie, a live visual programming environment for Java. Most notably, …

Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan

Research Collection School Of Computing and Information Systems

This paper introduces the Adaptive Resonance Theory under Constraint (ART-C 2A) learning paradigm based on ART 2A, which is capable of generating a user-defined number of recognition nodes through online estimation of an appropriate vigilance threshold. Empirical experiments compare the cluster validity and the learning efficiency of ART-C 2A with those of ART 2A, as well as three closely related clustering methods, namely online K-Means, batch K-Means, and SOM, in a quantitative manner. Besides retaining the online cluster creation capability of ART 2A, ART-C 2A gives the alternative clustering solution, which allows a direct control on the number of output …

Application Of Bi-State Magnetic Material To Automotive Offset-Coupled Ipm Starter/Alternator Machine, Ayman M. El-Refaie, Russell Manzke, Thomas M. Jahns

Electrical and Computer Engineering Faculty Research and Publications

This paper investigates a new approach to designing high-speed interior permanent-magnet (IPM) synchronous machines using a bi-state soft magnetic material. The bi-state material can have its normally high magnetic permeability permanently reduced in localized regions to that of air by means of heat treatment. This new work significantly expands a previous investigation by considering offset-coupled IPM machines that make it possible to significantly increase the rotor speed while retaining all of the other specifications of the 6-kW starter/alternator application. Lumped-parameter models, Monte Carlo optimization, and both electromagnetic and structural finite-element analysis are used to develop new offset-coupled IPM machine designs …

Automatic Determination Of Factors For Real-Time Garbage Collection, Tobias Mann, Ron K. Cytron

All Computer Science and Engineering Research

Several approaches to hard, real-time garbage collection have been recently proposed. All of these approaches require knowing certain statistical properties about a program's execution, such as the maximum extent of live storage, the rate of storage allocation, and the number of non-null object references. While these new approaches offer the possibility of guaranteed, reasonably bounded behavior for garbage collection, the determination of the required information may not be straight forward for the application programmer. In this paper we present evidence suggesting that the necessary factors can vary widely over the program's execution, indicating that an automatic, phased approach may be …

Towards A General Methodology For Designing Sub-Noise Measurement Procedures, Roberto Osegueda, George R. Keller, Scott A. Starks, R. Araiza, Dm. Bizyaev, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, the measurement result z depends not only on the measured value x, but also on the parameters s describing the experiment's setting and on the values of some auxiliary quantities y; the dependence z=f(x,s,y) of z on x, s, and y is usually known. In the ideal case when we know the exact value of the auxiliary parameter y, we can solve the above equation and find the desired value x. In many real-life situations, we only know y with some uncertainty, and this uncertainty leads to additional uncertainty in x.

If we are trying to …

Interval-Valued And Fuzzy-Valued Random Variables: From Computing Sample Variances To Computing Sample Covariances, Jan B. Beck, Vladik Kreinovich, Berlin Wu

Departmental Technical Reports (CS)

Due to measurement uncertainty, often, instead of the actual values xi of the measured quantities, we only know the intervals [xi]=[Xi-Di,Xi+Di], where Xi is the measured value and Di is the upper bound on the measurement error (provided, e.g., by the manufacturer of the measuring instrument). In such situations, instead of the exact value of the sample statistics such as covariance C(x,y), we can only have an interval [C](x,y) of possible values of this statistic. It is known that in general, computing such an interval [C](x,y) for C(x,y) is an NP-hard problem. In this paper, we describe an algorithm that …

Modelling Measurement Processes As Timed Information Processes In Simplex Domains, Gracaliz P. Dimuro, Antonio C. Da Rocha Costa, Vladik Kreinovich

Departmental Technical Reports (CS)

This paper presents a domain-theoretic model for measurements and measuring instruments, by making explicit in simplex-domain structures two important aspects of measurement processes: the notion of standard representation relation, established between the (physical) values that are being measured and the meanings of the readings (semantic values) of the measuring instruments used to measure them, and the time time underlying every measurement process, in a way that it is possible to trace the hostory of every measuring process. We also present the modelling of measurements performed by combined measuring instruments synchrfonized in time. Finally, the domain-theoretic modelling of a sample measuring …

Group-Theoretic Approach As A General Framework For Sensors, Neural Networks, Fuzzy Control, And Genetic Boolean Networks, Hung T. Nguyen, Vladik Kreinovich, Chitta Baral, Valery D. Mazin

Departmental Technical Reports (CS)

When describing a system of interacting genes, a useful approximation is provided by a Boolean network model, in which each gene is either switched on or off - i.e., its state is described by a Boolean variable.

Recent papers by I. Shmulevich et al. show that although in principle, arbitrarily complex Boolean functions are possible, in reality, the corresponding Boolean networks can be well described by Boolean functions from one of the so-called Post classes - classes that are closed under composition. These classes were originally described by E. Post.

It is known that the Boolean model is only an …

Probabilities, Intervals, What Next? Extension Of Interval Computations To Situations With Partial Information About Probabilities, Vladik Kreinovich, Gennady N. Solopchenko, Scott Ferson, Lev Ginzburg, Richard Alo

Departmental Technical Reports (CS)

In many real-life situations, we are interested in the value of a physical quantity y that is difficult or impossible to measure directly. To estimate y, we find some easier-to-measure quantities x1,...,xn which are related to y by a known relation y=f(x1,...,xn). Measurements are never 100% accurate; hence, the measured values Xi are different from xi, and the resulting estimate Y=f(X1,...,Xn) is different from the desired value y=f(x1,...,x_n). How different?

Traditional engineering to error estimation in data processing assumes that we know the probabilities of different measurement error Dxi=Xi-xi.

In many practical situations, we only know the upper bound Di …

Fast Quantum Algorithms For Handling Probabilistic And Interval Uncertainty, Vladik Kreinovich, Luc Longpre

Departmental Technical Reports (CS)

No abstract provided.

2004 (Spring) Ensi Informer Magazine, Morehead State University. Engineering Sciences Department

ENSI Informer Magazine Archive

The ENSI Informer Magazine published in the spring of 2004.

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

BITs and PCs Newsletter

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