Computer Engineering Commons^™

The Challenge Of Hyper-Spectral Satellite Imaging And Integer-Valued Fuzzy Sets, Maria Beltran, Vladik Kreinovich, Scott A. Starks

Departmental Technical Reports (CS)

Satellite images already produce huge amounts of data, which makes their processing a serious computational challenge. This problem will become even more complicated with the launch of multi-spectral Earth-imaging satellites that will increase the amount of information by at least two orders of magnitude. With such a huge amount of information, it is necessary to come up with data processing methods that are as fast as possible. In particular, we show that for fuzzy processing techniques, this leads to the necessity to use integer-valued fuzzy sets.

Sensor Placement For Aerospace Non-Destructive Evaluation (Nde): Optimization Under Fuzzy Uncertainty, Roberto A. Osegueda, Carlos M. Ferregut, Mary J. George, Jose M. Gutierrez, Vladik Kreinovich

Departmental Technical Reports (CS)

No abstract provided.

Which Algorithms Are Feasible? Maxent Approach, Daniel E. Cooke, Vladik Kreinovich, Luc Longpre

Departmental Technical Reports (CS)

It is well known that not all algorithms are feasible; whether an algorithm is feasible or not depends on how many computational steps this algorithm requires. The problem with the existing definitions of feasibility is that they are rather ad hoc. Our goal is to use the maximum entropy (MaxEnt) approach and get more motivated definitions.

If an algorithm is feasible, then, intuitively, we would expect the following to be true:

If we have a flow of problems with finite average length L, then we expect the average time T to be finite as well.

Thus, we can say …

We Must Choose The Simplest Physical Theory: Levin-Li-Vitanyi Theorem And Its Potential Physical Applications, Dirk Fox, Martin Schmidt, Misha Kosheleva, Vladik Kreinovich, Luc Longpre, Jeff Kuhn

Departmental Technical Reports (CS)

If several physical theories are consistent with the same experimental data, which theory should we choose? Physicists often choose the simplest theory; this principle (explicitly formulated by Occam) is one of the basic principles of physical reasoning. However, until recently, this principle was mainly a heuristic because it uses the informal notion of simplicity.

With the explicit notion of simplicity coming from the Algorithmic Information theory, it is possible not only to formalize this principle in a way that is consistent with its traditional usage in physics, but also to prove this principle, or, to be more precise, deduce it …

Environmentally-Oriented Processing Of Multi-Spectral Satellite Images: New Challenges For Bayesian Methods, Scott A. Starks, Vladik Kreinovich

Departmental Technical Reports (CS)

Remotely sensed images from new generation satellites present an opportunity for scientists to investigate problems in environmental and earth science which have been previously intractable. The magnitude of data that will arise from these hyperspectral instruments create the need for innovative techniques to accomplish data reduction. This paper presents an algorithm which shows promise as a tool for reducing the dimensionality of data resulting from remote sensing. The optimality criteria for the algorithm is the Bayes Risk in the reduced dimension space.

Maximum Entropy Approach To Optimal Sensor Placement For Aerospace Non-Destructive Testing, Roberto A. Osegueda, Carlos M. Ferregut, Mary J. George, Jose M. Gutierrez, Vladik Kreinovich

Departmental Technical Reports (CS)

The ideal design of an airplane should include built-in sensors that are pre-blended in the perfect aerodynamic shape. Each built-in sensor is expensive to blend in and requires continuous maintenance and data processing, so we would like to use as few sensors as possible. The ideal formulation of the corresponding optimization problem is, e.g., to minimize the average detection error for fault locations. However, there are two obstacles to this ideal formulation:

--First, this ideal formulation requires that we know the probabilities of different fault locations and the probabilities of different aircraft exploitation regimes. In reality, especially for a …

A Measurement Of The Qcd Colour Factors And A Limit On The Light Gluino, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Using data collected from 1992 to 1995 with the ALEPH detector at LEP, a measurement of the colour factor ratios CA/CF and TF /CF and the strong coupling constant αs = CFαs(MZ)/(2π) has been performed by fitting theoretical predictions simultaneously to the measured differential two-jet rate and angular distributions in four-jet events. The result is found to be in excellent agreement with QCD, {fx4-1} Fixing CA/CF and TF/CF to the QCD values permits a determination of αs(MZ) and ηf, the number of active flavours. With this measurement the existence of a gluino with mass below 6.3 GeV/c2 is excluded at …

Soft Computing Explains Heuristic Numerical Methods In Data Processing And In Logic Programming, Hung T. Nguyen, Vladik Kreinovich, Bernadette Bouchon-Meuiner

Departmental Technical Reports (CS)

We show that fuzzy logic and other soft computing approaches explain and justify heuristic numerical methods used in data processing and in logic programming, in particular, M-methods in robust statistics, regularization techniques, metric fixed point theorems, etc.

How To Make World Wide Web Sites Faster And Easier To Use, Misha Kosheleva

Departmental Technical Reports (CS)

Working Notes of the AAAI Symposium on Frontiers in Soft Computing and Decision Systems, Boston, MA, November 8-10, 1997.

We propose a new idea of organizing Web sites so that the Web will be easier and faster to use.

Non-Equilibrium Thermodynamics Explains Semiotic Shapes: Applications To Astronomy And To Non-Destructive Testing Of Aerospace Systems, Roberto A. Osegueda, Carlos M. Ferregut, Mary J. George, Jose M. Gutierrez, Vladik Kreinovich

Departmental Technical Reports (CS)

Proceedings of the International Conference on Intelligent Systems and Semiotics (ISAS'97), National Institute of Standards and Technology Publ., Gaithersburg, MD, 1997, pp. 378-382.

Celestial bodies such as galaxies, stellar clusters, planetary systems, etc., have different geometric shapes (e.g., galaxies can be spiral or circular, etc.). Usually, complicated physical theories are used to explain these shapes; for example, several dozen different theories explain why many galaxies are of spiral shape. Some rare shapes are still difficult to explain.

It turns out that to explain these "astroshapes", we do not need to know the details of physical equations: practically all the shapes …

Towards Computers Of Generation Omega - Non-Equilibrium Thermodynamics, Granularity, And Acausal Processes: A Brief Survey, Misha Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Proceedings of the International Conference on Intelligent Systems and Semiotics (ISAS'97), National Institute of Standards and Technology Publ., Gaithersburg, MD, 1997, pp. 383-388.

Nowadays, we are using mainly computer of fourth generation, and we are designing fifth-generation computers. It is reasonable to ask: what is the perspective? What will the computers of generation omega look like?

--As the speed of data processing increases, we face a natural limitation of causality, according to which the speed of all processes is limited by the speed of light.

--Lately, a new area of acausal (causality violating) processes has entered mainstream physics.

This …

Multi-Resolution Data Processing: It Is Necessary, It Is Possible, It Is Fundamental, Scott A. Starks, Vladik Kreinovich, Alex Meystel

Departmental Technical Reports (CS)

Experience shows that many data processing problems are difficult to solve, and some of these problems have even been proven to be computationally intractable. Human experts successfully solve many such problems by using a hierarchical, multi-resolution approach. These multi-resolution methods are, in several cases, provably optimal. However, due to the computational intractability of the problem itself, the multi-resolution approach can only work if the systems that we are analyzing are themselves hierarchical. We show that, first, due to (inevitable) measurement inaccuracies, an arbitrary input data is consistent with the hierarchical model, and second, that in many cases, the actual physical …

Gallium Desorption Behavior At Algaas/Gaas Heterointerfaces During High-Temperature Molecular Beam Epitaxy, K. Mahalingam, D. L. Dorsey, K. R. Evans, Rama Venkat

Electrical & Computer Engineering Faculty Research

A Monte Carlo simulation study is performed to investigate the Ga desorption behavior during AlGaAs-on-GaAs heterointerface formation by molecular beam epitaxy. The transients in the Ga desorption rate upon opening the Al shutter are shown to be associated with the concurrent reduction in the V/III flux ratio. Monte Carlo simulations employing a constant V/III flux ratio yield a “steplike” variation in the Ga desorption rate with the resulting interfaces closer in abruptness to the ideal AlGaAs-on-GaAs interface. Further details on the stoichiometry of the interface and its relationship with predicted Ga desorption profiles is presented.

Singular And Plural Non-Deterministic Parameters, Sigurd Meldal, M. A. Walicki

Faculty Publications

The article defines algebraic semantics of singular (call-time-choice) and plural (run-time-choice) nondeterministic parameter passing and presents a specification language in which operations with both kinds of parameters can be defined simultaneously. Sound and complete calculi for both semantics are introduced. We study the relations between the two semantics and point out that axioms for operations with plural arguments may be considered as axiom schemata for operations with singular arguments.

An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson arrivals to apply to wormhole routing. These ideas can also be applied to other networks.

Trends. Supercomputer Sales And Nuclear Proliferation: The Surrealist Top Ten, Ibpp Editor

International Bulletin of Political Psychology

The author discusses supercomputers in conjunction with nuclear weapons.

Dynamic Load Distribution In Mist, K. Al-Saqabi, R. M. Prouty, Dylan Mcnamee, Steve Otto, Jonathan Walpole

Computer Science Faculty Publications and Presentations

This paper presents an algorithm for scheduling parallel applications in large-scale, multiuser, heterogeneous distributed systems. The approach is primarily targeted at systems that harvest idle cycles in general-purpose workstation networks, but is also applicable to clustered computer systems and massively parallel processors. The algorithm handles unequal processor capacities, multiple architecture types and dynamic variations in the number of processes and available processors. Scheduling decisions are driven by the desire to minimize turnaround time while maintaining fairness among competing applications. For efficiency, the virtual processors (VPs) of each application are gang scheduled on some subset of the available physical processors.

Specification And Verification Of Generic Cell Rate Algorithms In Pvs, Huseyin Ozgungor

Electrical & Computer Engineering Theses & Dissertations

Formal verification methods have been considered as a powerful complementary approach to define standards and to prove correctness of the systems. In this work, formal specification of Generic Cell Rate Algorithms are defined and proved. The specification process enables standardization for constructing Generic Cell Rate Algorithms. Standardization is an important process in the Asynchronous Transfer Mode (ATM) networks. By employing formal methods, the necessary standards could be constructed to allow different algorithms to be employed which still meet system requirements. Those system requirements are quantified in the Quality of Service (QOS).

Congestion management is a vital concept for networks in …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 6, June 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

Wright State University College of Engineering and Computer Science

High Performance Distributed Storage Architectures, Ahmed M Amer

Archived Theses and Dissertations

No abstract provided.

A Toolkit For Specializing Production Operating System Code, Crispin Cowan, Dylan Mcnamee, Andrew P. Black, Calton Pu, Jonathan Walpole, Charles Krasic, Perry Wagle, Qian Zhang

Computer Science Faculty Publications and Presentations

Specialization has been recognized as a powerful technique for optimizing operating systems. However, specialization has not been broadly applied beyond the research community because the current techniques, based on manual specialization, are time-consuming and error-prone. This paper describes a specialization toolkit that should help broaden the applicability of specializing operating systems by assisting in the automatic generation of specialized code, and {\em guarding} the specialized code to ensure the specialized system continues to be correct. We demonstrate the effectiveness of the toolkit by describing experiences we have had applying it in real, production environments. We report on our experiences with …

An Ontology Tool For Distributed Information Environments, Kuhanandha Mahalingam, Michael N. Huhns

Faculty Publications

This paper describes how ontologies can be used for query formulation and semantic reconciliation in large distributed information environments. It presents a tool, written in Java, that can be used to create and browse ontologies, and construct ontology-based queries. The tool incorporates several abstraction mechanisms that enable users to manage large ontologies, which are typical of large information environments. The tool is being applied to an information system for healthcare administrators, which spans hospitals, clinics, and governmental health departments.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 5, May 1997, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Predictable File Access Latency For Multimedia, Dan Revel, Crispin Cowan, Dylan Mcnamee, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Multimedia applications are sensitive to I/O latency and jitter when accessing data in secondary storage. Transparent adaptive prefetching (TAP) uses software feedback to provide multimedia applications with file system quality of service (QoS) guarantees. We are investigating how QoS requirements can be communicated and how they can be met by adaptive resource management. A preliminary test of adaptive prefetching is presented.

Single Row Routing: Theoretical And Experimental Performance Evaluation, And New Heuristic Development, David A. Hysom

Computer Science Theses & Dissertations

The Single Row Routing Problem (SRRP) is an abstraction arising from real-world multilayer routing concerns. While NP-Complete, development of efficient SRRP routing heuristics are of vital concern to VLSI design. Previously, researchers have introduced various heuristics for SRRP; however, a comprehensive examination of SRRP behavior has been lacking.

We are particularly concerned with the street-congestion minimization constraint, which is agreed to be the constraint of greatest interest to industry. Several theorems stating lower bounds on street congestion are known. We show that these bounds are not tight in general, and argue they may be in error by at least 50% …

Soft Computing: Frontiers? A Case Study Of Hyper-Spectral Satellite Imaging, Scott A. Starks, Vladik Kreinovich

Departmental Technical Reports (CS)

Soft computing methods such as fuzzy control, neural networks, etc., often require lots of computations even for small amounts of data. It is, therefore, sometimes believed that for larger amounts of data, the required amount of computations will be so large that we will reach the frontiers of soft computing.

In this paper, we show, on the example of hyper-spectral satellite imaging, that this belief is often too pessimistic. We should not be afraid to use (or at least to try to use) soft computing methods even for large amounts of data.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 4, April 1997, 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.

Mlpq: A Linear Constraint Database System With Aggregate Operators, Yiming Li

School of Computing: Dissertations, Theses, and Student Research

In this project report, I will discuss a Multiple Linear Programming Query (MLPQ) system and the theoretical background of this system.The MPLQ system is developed to solve some realistic problems involving both linear programming (UP) techniques and linear constraint databases (LCDBs) theory. The MLPQ system is aimed at providing a mechanism of bridging these two important areas. system basically consists of three parts which are a linear constraint database, an LP solver, and an interface between the LCDB and the LP solver. The LCDB of the MLPQ system contains multiple linear programming problems. The LP solver used in the MPLQ …

An Adaptive Scheme For Admission Control In Atm Networks, Saragur M. Srinidhi, William H. Thesling, Vijaya K. Konangi

Electrical and Computer Engineering Faculty Publications

This paper presents a real time front-end admission control scheme for ATM networks. A call management scheme which uses the burstiness associated with traffic sources in a heterogeneous ATM environment to effect dynamic assignment of bandwidth is presented. In the proposed scheme, call acceptance is based on an on-line evaluation of the upper bound on cell loss probability which is derived from the estimated distribution of the number of calls arriving. Using this scheme, the negotiated quality of service will be assured when there is no estimation error. The control mechanism is effective when the number of …

A Framework For An Automated Compilation System For Reconfigurable Architectures, George R. Roelke Iv

Theses and Dissertations

The advent of the Field Programmable Gate Array has allowed the implementation of runtime reconfigurable computer systems. These systems are capable of configuring their hardware to provide custom hardware support for software applications. Since these architectures can be reconfigured during operation, they are able to provide hardware support for a variety of applications, without removal from the system. The Air Force is currently investigating reconfigurable architectures for avionics and signal processing applications. This thesis investigates the problem of automating the application development process for reconfigurable architectures. The lack of automated development support is a major limiting factor in the use …