Computer Engineering Commons^™

The Determination Of Failure Occurring In The Stator Coil Winding Due To The Over-Voltage Using Matlab Software, Ali Reza Alavizadeh

Morehead State Theses and Dissertations

A thesis presented to the faculty of the College of Science & Technology at Morehead State University in partial fulfillment of the requirements for the degree of Master of Science in Vocational Education & Technology by Ali Reza Alavizadeh on December 1, 2000.

Itanium's New Basic Operation Of Fused Multiply-Add: Theoretical Explanation And Theoretical Challenge, Vladik Kreinovich

Departmental Technical Reports (CS)

A new Intel's 64-bit chip Itanium has a new instruction set which includes a fused multiply-add instruction x1+x2*x3. In this short article, we explain the empirical reasons behind the choice of this instruction, give possible theoretical explanation for this choice, and mention a related theoretical challenge.

An Atm System Model And Wireless Channel Simulation, Karen Dunne

Masters

Congestion in the low frequency regions of the electromagnetic spectrum and demand for support of high bandwidth applications has prompted widespread investigations into networking technologies and communications media. Traditional networking technologies such as Ethernet that are not capable of adequately supporting high bandwidth applications (e.g. videoconferencing) are being replaced by high speed, high bandwidth technologies such as Asynchronous Transfer Mode (ATM). In the communications media market, wireless systems are becoming ubiquitous due to their ease of installation and maintenance costs. In this research, the networking technology of interest is ATM. ATM used a cell switching architecture that allows seamless support …

Strassen's Algorithm Made (Somewhat) More Natural: A Pedagogical Remark, Ann Q. Gates, Vladik Kreinovich

Departmental Technical Reports (CS)

Strassen's 1969 algorithm for fast matrix multiplication is based on the possibility to multiply two 2 x 2 matrices A and B by using 7 multiplications instead of the usual 8. The corresponding formulas are an important part of any algorithms course, but, unfortunately, even in the best textbook expositions. they look very ad hoc. In this paper, we show that the use of natural symmetries can make these formulas more natural.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 3, November 2000, 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.

Hop Integrity In Computer Networks, Mohamed G. Gouda, E.N. Elnozahy, Chin-Tser Huang, Tommy M. Mcguire

Faculty Publications

A computer network is said to provide hop integrity iff when any router p in the network receives a message m supposedly from an adjacent router q, then p can check that m was indeed sent by q, was not modified after it was sent, and was not a replay of an old message sent from q to p. We describe three protocols that can be added to the routers in a computer network so that the network can provide hop integrity. These three protocols are a secret exchange protocol, a weak integrity protocol, and a strong integrity protocol. All …

Geombinatorics Of "Smart Dust", Edward Vidal, Luc Longpre, Vladik Kreinovich, Huang Haitao

Departmental Technical Reports (CS)

Smart Dust is a collection of small sensor-equipped leaves which send their information to two or more receivers. When a receiver gets a signal from a sensor, it can determine the direction from which this signal came. By combining the directions from two different receivers, we can determine the 3-D locations of all the leaves, and thus, transform their sensor readings into a 3-D picture of the corresponding parameters (temperature, moisture, etc.). The more leaves we send, the more information we gather. However, since the direction can only be measured with a certain accuracy, when we send too many leaves, …

Aerospace Applications Of Soft Computing And Interval Computations (With An Emphasis On Simulation And Modeling), Scott A. Starks, Vladik Kreinovich

Departmental Technical Reports (CS)

This paper presents a brief overview of our research in applications of soft computing and interval computations to aerospace problems, with a special emphasis on simulation and modeling.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 2, October 2000, 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.

Studies Related To The Design And Implementation Of A Magnetic Suspension And Balance System, Syed Adeel Akhtar Jafri

Electrical & Computer Engineering Theses & Dissertations

This thesis presents studies related to the magnetic suspension and balance system (MSBS) of the Princeton/ONR High Reynolds Number Testing Facility (HRTF). The main motivation for developing the MSBS is to provide interference free aero/hydrodynamic testing of submersible models, which will lead to more accurate measurements. From the controls point of view, the main specification of the MSBS is to robustly control the position of a submersible model in five degrees of freedom (DOF), including three translational as well as pitching and yawing positions. The MSBS should not only regulate the submersible model's position but should also allow for small …

Optimal Elimination Of Inconsistency In Expert Knowledge: Formulation Of The Problem, Fast Algorithms, Timothy J. Ross, Berlin Wu, Vladik Kreinovich

Departmental Technical Reports (CS)

Expert knowledge is sometimes inconsistent. In this paper, we describe the problem of eliminating this inconsistency as an optimization problem, and present fast algorithms for solving this problem.

On Approximation Of Fuzzy Sets By Crisp Sets: From Continuous Control-Oriented Defuzzification To Discrete Decision Making, Hung T. Nguyen, Witold Pedrycz, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we show that the necessity to make crisp decisions in uncertain (fuzzy) situations leads to the necessity to "approximate" fuzzy sets by crisp sets. We show that seemingly natural approximation ideas - such as using alpha-cut for a given alpha - often do not work, and we describe new approximations which not only work, but which are optimal in some reasonable sense

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 1, September 2000, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Fuzzy Logic And Its Applications In Medicine, Nguyen Hoang Phuong, Vladik Kreinovich

Departmental Technical Reports (CS)

Fuzzy set theory and fuzzy logic are a highly suitable and applicable basis for developing knowledge-based systems in medicine for tasks such as the interpretation of sets of medical findings, syndrome differentiation in Eastern medicine, diagnosis of diseases in Western medicine, mixed diagnosis of Integrated western and Eastern medicine, the optimal selection of medical treatments integrating western and eastern medicine, and for real-time monitoring of patient data etc. This was verified by trials with the following systems which were developed by our group in Vietnam: a fuzzy Expert System for Syndromes Differentiation in Oriental Traditional Medicine, an Expert System for …

On The Optimal Choice Of Quality Metric In Image Compression A Soft Computing Approach, Hung T. Nguyen, Olga Kosheleva, Vladik Kreinovich, Liya Ding

Departmental Technical Reports (CS)

In a lossy compression, the reconstructed image I' differs from the original image I. In different situations, different compressions lead to different quality reconstruction, so it is important to select, in each situation, the best compression method. It's natural to select the compression method for which the average value of some quality metric d(I,I') is the smallest. Which quality metric should we choose? We show that under reasonable symmetry conditions, L^p metrics d(I,I')=integral of |I(x)-I'(x)|^p are the best, and how to compute the optimal value of p from the expected relative size of the informative part of the image.

Computational Complexity Of Planning And Approximate Planning In Presence Of Incompleteness, Chitta Baral, Vladik Kreinovich, Raul Trejo

Departmental Technical Reports (CS)

In the last several years, there have been several studies about the computational complexity of classical planning assuming that the planner has complete knowledge about the initial situation. Recently, there has been proposal to use "sensing" actions to plan in presence of incompleteness. In this paper we study the complexity of planning in such cases. In our study we use the action description language A proposed in 1991 by Gelfond and Lifschitz, and its extensions.

It is known that if we consider only plans of feasible (polynomial) length, planning - with complete information about the initial situation - in A …

Why 95% And Two Sigma? A Theoretical Justification For An Empirical Measurement Practice, Hung T. Nguyen, Vladik Kreinovich, Chin-Wang Tao

Departmental Technical Reports (CS)

The probability p(k) that the value of a random variable is far away from the mean (e.g. further than k standard deviations away) is so small that this possibility can be often safely ignored. It is desirable to select k for which the dependence of the probability p(k) on the distribution is the smallest possible. Empirically, this dependence is the smallest for k between 1.5 and 2.5. In this paper, we give a theoretical explanation for this empirical result.

On Representation And Approximation Of Operations In Boolean Algebras, I. R. Goodman, Vladik Kreinovich

Departmental Technical Reports (CS)

Several universal approximation and universal representation results are known for non-Boolean multi-valued logics such as fuzzy logics. In this paper, we show that similar results can be proven for multi-valued Boolean logics as well.

Extracting Fuzzy Sparse Rule Base By Cartesian Representation And Clustering, Yeung Yam, Vladik Kreinovich, Hung T. Nguyen

Departmental Technical Reports (CS)

Sparse rule base and interpolation have been proposed as possible solution to alleviate the geometric complexity problem of large fuzzy set. However, no formal method to extract sparse rule base is yet available. This paper combines the recently introduced Cartesian representation of membership functions and a mountain method-based clustering technique for extraction. A case study is included to demonstrate the effectiveness of the approach.

A Flowchart Structure For Modification Of A Modsim Process Model, Murali K. Adatrao

Electrical & Computer Engineering Theses & Dissertations

There are many software processes and software development models that support the development of a software model prior to implementation. However, more often than not, these practices are not followed resulting in a lack of documentation of the intended functionality of the software. As a result, software often becomes a black box for later developers. Even a simple bug fix can turn into an exhaustive task for the developers, as they must attempt to infer the intended system behavior. New designers cannot make any changes to the software or extend the software behavior, as the underlying model within the software …

Asymptotically Optimal Algorithms For Weather Applications Of Smart Dust, Edward Vidal, Luc Longpre, Vladik Kreinovich, Huang Haitao, Yeung Yam

Departmental Technical Reports (CS)

No abstract provided.

On The Optimal Choice Of Quality Metric In Image Compression, Olga Kosheleva, Vladik Kreinovich, Yeung Yam

Departmental Technical Reports (CS)

No abstract provided.

Towards Reliable Sub-Division Of Geological Areas: Interval Approach, David D. Coblentz, Vladik Kreinovich, Brian S. Penn, Scott A. Starks

Departmental Technical Reports (CS)

An appropriate subdivision of a geophysical area into segments enables us to extrapolate the results obtained in some locations within the segment (where extensive research was done) to other locations within the same segment, and thus, get a good understanding of the locations which weren't thoroughly analyzed.

Often, different evidence and different experts' intuition support different subdivisions schemes. For example, in our area - Rio Grande rift zone - there is some geochemical evidence that this zone is divided into three segments, but, in the viewpoint of many researchers, this evidence is not yet sufficiently convincing.

We show that if …

Some Practical Applications Of Soft Computing And Data Mining, Hung T. Nguyen, Nadipuram R. Prasad, Vladik Kreinovich, Habib Gassoumi

Departmental Technical Reports (CS)

Traditional data mining techniques mainly deal with a search for patterns in traditional databases, where data consists of numbers and words. In many application areas, however, data is more complicated: real-life data is often obtained as an image from a camera rather than a few measurements. Furthermore, this image can also change dynamically. In this paper, we present several examples of how soft computing is related to mining such data.

A New Universal Approximation Result For Fuzzy Systems, Which Reflects Cnf-Dnf Duality, Irina Perfilieva, Vladik Kreinovich

Departmental Technical Reports (CS)

There are two main fuzzy system methodologies for translating expert rules into a logical formula: In Mamdani's methodology, we get a DNF formula (disjunction of conjunctions), and in a methodology which uses logical implications, we get, in effect, a CNF formula (conjunction of disjunctions). For both methodologies, universal approximation results have been proven which produce, for each approximated function f(x), two different approximating relations RDNF(x,y) and RCNF(x,y). Since in fuzzy logic, there is a known relation FCNF(x)<=FDNF(x) between CNF and DNF forms of a propositional formula F, it is reasonable to expect that we would be able to prove the existence of approximations for which a similar relation RCNF(x,y)<=RDNF(x,y) holds. Such existence is proved in our paper.

Aspects Of Information Flow, Andrew P. Black, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Along with our colleagues at the Oregon Graduate Institute and Georgia Institute of Technology, we have recently been experimenting with real-rate systems, that is, systems that are required to move data from one place to another at defined rates, such as 30 items per second. Audio conferencing or streaming video systems are typical: they are required to deliver video or audio frames from a source (a server or file system) in one place to a sink (a display or a sound generator) in another; the frames must arrive periodically, with constrained latency and jitter. We have successfully built such systems …

Application Of Control Theory To Modeling And Analysis Of Computer Systems, Molly H. Shor, Kang Li, Jonathan Walpole, David Steere, Calton Pu

Computer Science Faculty Publications and Presentations

Experimentally, we show that Transmission Control Protocol (TCP)’s congestion control algorithm results in dynamic behavior similar to a stable limit cycle (attractor) when data from TCP flow into a fixed-size buffer and data is removed from the buffer at a fixed service rate. This setup represents how TCP buffers packets for transmission onto the network, with the network represented by a fixed-size buffer with a fixed service rate. The closed trajectory may vary slightly from period to period due to the discrete nature of computer systems. The size of the closed trajectory is a function of the network’s buffer size …

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

BITs and PCs Newsletter

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

A New Hierarchical Negotiation Scheme On Top Of Interrap-Like Multi-Agent Architecture, Nehal Abd Elaziz Hammouda

Archived Theses and Dissertations

No abstract provided.

Image Compression Of Facial Photographs Based On Btc/Tsvq Local Processing, Suhair Hafez Najib Amer

Archived Theses and Dissertations

No abstract provided.