Computer Engineering Commons^™

Bandwidth Management And Quality Of Service, Adalbert Engel

Theses: Doctorates and Masters

With the advent of bandwidth-hungry video and audio applications, demand for bandwidth is expected to exceed supply. Users will require more bandwidth and, as always, there are likely to be more users. As the Internet user base becomes more diverse, there is an increasing perception that Internet Service Providers (ISPs) should be able to differentiate between users, so that the specific needs of different types of users can be met. Differentiated services is seen as a possible solution to the bandwidth problem. Currently, however, the technology used on the Internet differentiates neither between users, nor between applications. The thesis focuses …

Supervised Adaptive Resonance Theory And Rules, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Supervised Adaptive Resonance Theory is a family of neural networks that performs incremental supervised learning of recognition categories (pattern classes) and multidimensional maps of both binary and analog patterns. This chapter highlights that the supervised ART architecture is compatible with IF-THEN rule-based symbolic representation. Specifi­cally, the knowledge learned by a supervised ART system can be readily translated into rules for interpretation. Similarly, a priori domain knowl­edge in the form of IF-THEN rules can be converted into a supervised ART architecture. Not only does initializing networks with prior knowl­edge improve predictive accuracy and learning efficiency, the inserted symbolic knowledge can also …

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.

Intervals (Pairs Of Fuzzy Values), Triples, Etc.: Can We Thus Get An Arbitrary Ordering?, Vladik Kreinovich, Masao Mukaidono

Departmental Technical Reports (CS)

Traditional fuzzy logic uses real numbers as truth values. This description is not always adequate, so in interval-valued fuzzy logic, we use pairs (t-,t+) of real numbers, t-<=t+, to describe a truth value. To make this description even more adequate, instead of using real numbers to described each value t- and t+, we can use intervals, and thus get fuzzy values which can be described by 4 real numbers each. We can iterate this procedure again and again. The question is: can we get an arbitrary partially ordered set in this manner? An arbitrary lattice? In this paper, we show that although we cannot thus generate arbitrary lattices, we can actually generate an arbitrary partially ordered set in this manner. In this sense, the "intervalization" operation is indeed universal.

Aerospace Applications Of Soft Computing And Interval Computations (With An Emphasis On Multi-Spectral Satellite Imaging), 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 multi-spectralsatellite imaging.

Work In Progress: Automating Proportion/Period Scheduling, David Steere, Jonathan Walpole, Calton Pu

Computer Science Faculty Publications and Presentations

The recent effort to define middleware capable of supporting real-time applications creates the opportunity to raise the level of abstraction presented to the programmer. We propose that proportion/period is a better abstraction for specifying resource needs and allocation than priorities. We are currently investigating techniques to address some issues that are restricting use of proportion/period scheduling to research real-time prototypes. In particular, we are investigating techniques to automate the task of selecting proportion and period, and that allow proportion/period to incorporate job importance under overload conditions.

Network Security Versus Network Connectivity: A Framework For Addressing The Issues Facing The Air Force Medical Community, Franklin E. Cunningham Jr.

Theses and Dissertations

The Air Force has instituted Barrier Reef to protect its networks. The Air Force medical community operates network connections that are incompatible with Barrier Reef. To overcome this problem, OASD(HA) directed the Tri-Service Management Program Office (TIMPO) to develop an architecture that protects all military health systems and allows them to link with all three services and outside partners. This research studied the underlying networking issues and formed a framework based on data from network experts from the Air Force's medical centers and their base network organizations. The findings were compared TIMPO and a composite framework was developed that more …

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

For Interval Computations, If Absolute-Accuracy Optimization Is Np-Hard, Then So Is Relative-Accuracy Optimization, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the basic problems of interval computations is to compute a range of a given function f(x1,...,xn) over a given box (i.e., to compute the maximum and the minimum of the function on the box). For many classes of functions (e.g., for quadratic functions) this problem is NP-hard; it is even NP-hard if instead of computing the minimum and maximum exactly, we want to compute them with a given (absolute) accuracy. In practical situations, it is more realistic to ask for a relative accuracy; are the corresponding problems still NP-hard? We show that under some reasonable conditions, NP-hardness of …

Geombinatoric Aspects Of Processing Large Images And Large Spatial Databases, Jan Beck, Vladik Kreinovich, Brian Penn

Departmental Technical Reports (CS)

Computer processing can drastically improve the quality of an image and the reliability and accuracy of a spatial database. A large image (database) does not easily fit into the computer memory, so we process it by downloading pieces of the image. Each downloading takes a lot of time, so, to speed up the entire processing, we must use as few pieces as possible.

Many algorithms for processing images and spatial databases consist of comparing the value at a certain spatial location with values at nearby locations. For such algorithms, we must select (possibly overlapping) sub-images in such a way that …

An Optimal Fft-Based Algorithm For Mosaicking Images, With Applications To Satellite Imaging And Web Search, Stephen Gibson, Olga Kosheleva, Luc Longpre, Brian Penn, Scott A. Starks

Departmental Technical Reports (CS)

Digital data storage is becoming ever more abundant and cheap. This, along with other technological advances, has brought about an age of mass storage of information, much of it in the form of images. In order to be able to process these stockpiles of image data, new and faster computer algorithms are needed.

One area of interest is that of image mosaicking, i.e., comparing two overlapping images and finding the proper scaling, angle of rotation, and translation needed to fit one with the other. Early methods for mosaicking images included visual inspection or exhaustive, pixel by pixel, search for the …

Towards Mathematical Foundations Of Information Retrieval: Dependence Of Website's Relevance On The Number Of Occurrences Of A Queried Word, Laszlo Koczy, Vladik Kreinovich, Yohanz Mendoza, Hung T. Nguyen, Harry Schulte

Departmental Technical Reports (CS)

In response to a query, web search tools often return many websites which are not really relevant. One reason for this is that the queried word may have several meanings different to the one which the user has in mind. To eliminate these undesirable meanings, it is reasonable to look for occurrences not only of the queried word itself, but also for other words related to this particular meaning, and then select only the websites for which, based on this information, we are confident about their relevance. For this strategy to work, we must be able to estimate the degree …

Investigation Of Image Feature Extraction By A Genetic Algorithm, Steven P. Brumby, James P. Theiler, Simon J. Perkins, Neal R. Harvey, John J. Szymanski, Jeffrey J. Bloch, Melanie Mitchell

Computer Science Faculty Publications and Presentations

We describe the implementation and performance of a genetic algorithm which generates image feature extraction algorithms for remote sensing applications. We describe our basis set of primitive image operators and present our chromosomal representation of a complete algorithm. Our initial application has been geospatial feature extraction using publicly available multi-spectral aerial-photography data sets. We present the preliminary results of our analysis of the efficiency of the classic genetic operations of crossover and mutation for our application, and discuss our choice of evolutionary control parameters. We exhibit some of our evolved algorithms, and discuss possible avenues for future progress.

Candidate Sets For Complex Interval Arithmetic, Juergen Wolff Von Gundenberg, Vladik Kreinovich

Departmental Technical Reports (CS)

Uncertainty of measuring complex-valued physical quantities can be described by complex sets. These sets can have complicated shapes, so we would like to find a good approximating family of sets. Which approximating family is the best? We reduce the corresponding optimization problem to a geometric one: namely, we prove that, under some reasonable conditions, an optimal family must be shift-, rotation- and scale-invariant. We then use this geometric reduction to conclude that the best approximating low-dimensional families consist of sets with linear or circular boundaries. This result is consistent with the fact that such sets have indeed been successful in …

A Geometric Approach To Classification Of Trash In Ginned Cotton, Murali Siddaiah, Michael A. Lieberman, Nadipuram R. Prasad, Vladik Kreinovich

Departmental Technical Reports (CS)

This paper discusses the use of geometric approach to classify different types of trash (non-lint, non-fiber material) in ginned cotton. Pieces of trash can have complicated shapes, so we would like to find a good approximating family of sets. Which approximating family is the best? We reduce the corresponding optimization problem to a geometric one: namely, we show that, under some reasonable conditions, an optimal family must be shift-, rotation- and scale-invariant. We then use this geometric reduction to conclude that the best approximating low-dimensional families consist of sets with linear or circular boundaries.

This result is in good agreement …

Interval Methods In Non-Destructive Testing Of Material Structures, Keith Worden, Roberto A. Osegueda, Carlos M. Ferregut, Soheil Nazarian, Debra L. George, Mary J. George, Vladik Kreinovich, Olga Kosheleva, Sergio Cabrera

Departmental Technical Reports (CS)

In many practical situations, e.g., in aerospace applications and in mammography, it is important to test the structural integrity of material structures. We show that interval methods can help.

From Fuzzy Values To Intuitionistic Fuzzy Values To Intuitionistic Fuzzy Intervals Etc.: Can We Get An Arbitrary Ordering?, Vladik Kreinovich, Masao Mukaidono, Krassimir Atanassov

Departmental Technical Reports (CS)

Traditional fuzzy logic uses real numbers as truth values. This description is not always adequate, so in intuitionistic fuzzy logic, we use pairs of real numbers to describe a truth value. Such pairs can be described either as pairs (t,f) for which t+f<=1, or, alternatively, as pairs (t,1-f) for which t<=1-f. To make this description even more adequate, instead of using real numbers to described each value t and f, we can use intervals, and thus get interval-valued intuitionistic fuzzy values which can be described by 4 real numbers each. We can iterate this procedure again and again. The question is: can we get an arbitrary partially ordered set in this manner? An arbitrary lattice? In this paper, we show that although we cannot thus generate arbitrary lattices, we can actually generate an arbitrary partially ordered set in this manner. In this sense, the "intervalization" operation which underlies the notion of an intuitionistic fuzzy set, is indeed universal.

From Interval Methods Of Representing Uncertainty To A General Description Of Uncertainty, Vladik Kreinovich, Scott Ferson, Lev Ginzburg, Harry Schulte, Matthew R. Barry, Hung T. Nguyen

Departmental Technical Reports (CS)

Measurements do not result in an exact value of the measured quantity; even after the most accurate measurement, there is still some uncertainty about the actual value of the measured quantity. Traditionally, in science and engineering, this uncertainty is characterized by a probability distribution; however, often, we do not know this probability distribution exactly. So, to get a more adequate description of this uncertainty, we must consider classes of possible probability distributions. A natural question is: Are all possible classes needed for this description? In this paper, we show that even for simple situations, we indeed need arbitrary closed convex …

On Combining Statistical And Fuzzy Techniques: Detection Of Business Cycles From Uncertain Data, Hung T. Nguyen, Berlin Wu, Vladik Kreinovich

Departmental Technical Reports (CS)

Detecting the beginning and the end of the business cycle is an important and difficult economic problem. One of the reasons why this problem is difficult is that for each year, we have only expert estimates (subjective probabilities) indicating to what extent the economy was in growth or recession. In our previous papers, we used fuzzy techniques to process this uncertain information; namely, we used the operation min(a,b) to combine the subjective probabilities (expert estimates) of two events into a probability that both events happen. This function corresponds to the most optimistic estimate of the joint probability. In this paper, …

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

The Internet Name Game And The Nonprofit Solution, Roger A. Lohmann

Faculty & Staff Scholarship

This paper is a case study of the campaign to create a new internet names authority to handle the assignment of internet domain names. Almost everyone knows by now that the Internet was originally a defense research project, which morphed into a research network for scientists and then into a tool of higher education and eventually into the commercial and general household utility we know today. In terms familiar to nonprofit research community what began in the state sector, expanded into the third sector and then into the market and household sectors and the consumer economy. There is a second …

Theory Of Photon Coincidence Statistics In Photon-Correlated Beams, Majeed M. Hayat, Sergio N. Torres, Leno M. Pedrotti

Electrical and Computer Engineering Faculty Research and Publications

The statistics of photon coincidence counting in photon-correlated beams is thoroughly investigated considering the effect of the finite coincidence resolving time. The correlated beams are assumed to be generated using parametric downconversion, and the photon streams in the correlated beams are modeled by two partially correlated Poisson point processes. An exact expression for the mean rate of coincidence registration is developed using techniques from renewal theory. It is shown that the use of the traditional approximate rate, in certain situations, leads to the overestimation of the actual rate. The error between the exact and approximate coincidence rates increases as the …

System And Method For Improving Data Acquisistion Capability In Spectroscopic Rotatable Element, Rotating Element, Modulation Element, And Other Ellipsometer And Polarimeter And The Like Systems, Steven E. Green, Craig M. Heringer, Blaine D. Johs, John A. Woollam, Stephen P. Ducharme

Department of Electrical and Computer Engineering: Faculty Publications

Disclosed is a System and method for controlling polarization State determining parameters of a polarized beam of light in an ellipSometer or polarimeter and the like System, (e.g. a modulation element ellipsometer System), So that they are in ranges wherein the Sensitivity, (of a Sample system characterizing PSI and DELTA value monitoring detector used to measure changes in Said polarization State resulting from interaction with a “composite Sample System,” comprised of a Sample System per Se.. and a beam polarization State determining variable retarder, to noise and measurement errors etc. therein), is reduced. The present invention allows determining Sample System …

Implementation And Performance Of Error Correction Codes For High-Speed Computer Networks, Jochen Spengler

Dissertations and Theses

During the transmission of data there is always a possibility that errors occur and some pieces are modified. If the receiver detects an error it either sends a request for retransmission or, like in networks using Ethernet, it does not send an acknowledgment for the erroneous frame. In this case the sender waits a certain time and retransmits the frame. With the development of faster computer networking hardware and the need for more real-time applications, these errors have become a major concern. Long retransmission latencies and the need for large memories for buffering drive the development of more reliable network …

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

Qos Scalability For Streamed Media Delivery, Charles Krasic, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Applications with real-rate progress requirements, such as mediastreaming systems, are difficult to deploy in shared heterogenous environments such as the Internet. On the Internet, mediastreaming systems must be capable of trading off resource requirements against the quality of the media streams they deliver, in order to match wide-ranging dynamic variations in bandwidth between servers and clients. Since quality requirements tend to be user- and task-specific, mechanisms for capturing quality of service requirements and mapping them to appropriate resource-level adaptation policies are required. In this paper, we describe a general approach for automatically mapping user-level quality of service specifications onto resource …

Fine-Grain Period Adaptation In Soft Real-Time Environments, David Steere, Joshua Gruenberg, Dylan Mcnamee, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Reservation-based scheduling delivers a proportion of the CPU to jobs over a period of time. In this paper we argue that automatically determining and assigning this period is both possible and useful in general purpose soft real-time environments such as personal computers and information appliances. The goal of period adaptation is to select the period over which a job is guaranteed to receive its portion of the CPU dynamically and automatically. The choice of period represents a trade-off between the amount of jitter observed by the job and the overall efficiency of the system. Secondary effects of period include quantization …

Internet, World Wide Web, And Creativity, Keng Siau

Research Collection School Of Computing and Information Systems

The growth of the Internet has been the most astonishing technological and social phenomenon of the last decade of this century. In 1990 only a few academics had heard of it; now, more than 50 million people use it. By the turn of the century, that figure could be 100–200 million. So far, the network's only constant has been that the number of new users has doubled almost every 12–18 months. Most organizations have or will soon have Internet access. The popularity of Internet provides a tremendous opportunity for individuals and organizations to explore its features and services for electronic …

Mutual Interference Investigation Of Cebus And X-10 Powerline Signaling, Sajid Pallithotungal

Theses

Powerline control signaling using CEBus has great potential towards inexpensive home automation. CEBus transmits at 10 kBps using spread spectrum in the 100-400 kHz band while X-l0 sends 60 Bps using bursts of 120 kHz carrier on the power line. However, these two signals may destructively interfere when present simultaneously. X-10 is narrow band and interferes with the CEBus spread spectrum signal. This thesis looks into the mutual interference patterns of Power Line CEBus communication in the presence of X-l0 module signaling and visa versa. The investigation encompasses a series of tests and measurements on a Power Line CEBus-X10 test …

Chu Spaces - A New Approach To Describing Uncertainty In Systems, Vladik Kreinovich, Guoqing Liu, Hung T. Nguyen

Departmental Technical Reports (CS)

This paper proposes the use of a specific type of categories for modeling and fusing information in complex systems in which uncertainty of various types need to be taken into account.