Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

1999

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 1 - 30 of 105

Full-Text Articles in Computer Engineering

Design And Implementation Of A Web Based Shop Floor Control System To Maintain Schedule Feasibility In A Dynamic Job Shop Environment, Anil Bommakanti Dec 1999

Design And Implementation Of A Web Based Shop Floor Control System To Maintain Schedule Feasibility In A Dynamic Job Shop Environment, Anil Bommakanti

FIU Electronic Theses and Dissertations

The effective control of production activities in dynamic job shop with predetermined resource allocation for all the jobs entering the system is a unique manufacturing environment, which exists in the manufacturing industry. In this thesis a framework for an Internet based real time shop floor control system for such a dynamic job shop environment is introduced. The system aims to maintain the schedule feasibility of all the jobs entering the manufacturing system under any circumstance. The system is capable of deciding how often the manufacturing activities should be monitored to check for control decisions that need to be taken on ...


Aerospace Applications Of Soft Computing And Interval Computations (With An Emphasis On Multi-Spectral Satellite Imaging), Scott A. Starks, Vladik Kreinovich Dec 1999

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.


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

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.


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

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.


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

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.


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

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 ...


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

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 Nov 1999

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 ...


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 Nov 1999

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 Nov 1999

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.


Integrating The Unified Modeling Language With An Architecture Description Language, Cécile Péraire, Robert Riemenschneider, Victoria Stavridou Oct 1999

Integrating The Unified Modeling Language With An Architecture Description Language, Cécile Péraire, Robert Riemenschneider, Victoria Stavridou

Cécile Péraire

No abstract provided.


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 Oct 1999

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 Oct 1999

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.


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

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 Oct 1999

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 ...


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 Oct 1999

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 Oct 1999

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 ...


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

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 ...


Engineering News, Cedarville College Sep 1999

Engineering News, Cedarville College

Engineering News

No abstract provided.


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

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 ...


Testing Object-Oriented Software, Didier Buchs, Cécile Péraire Aug 1999

Testing Object-Oriented Software, Didier Buchs, Cécile Péraire

Cécile Péraire

No abstract provided.


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

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 Aug 1999

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.


Neural Network Approach To Speech Pathology, Antonio P. Salvatore, Nicole A. Thorne, Charlotte M. Gross Aug 1999

Neural Network Approach To Speech Pathology, Antonio P. Salvatore, Nicole A. Thorne, Charlotte M. Gross

Departmental Technical Reports (CS)

A speech problem can be caused by different reasons, from psychological to organic. The existing diagnostic of speech pathologies relies on skilled doctors who can often diagnose by simply listening to the patient. We show that neural networks can simulate this ability and thus provide an automated (preliminary) diagnosis.


Fuzzy Logic In Non-Destructive Testing Of Aerospace Structures, Murali Krishna, Vladik Kreinovich, Roberto Osegueda Aug 1999

Fuzzy Logic In Non-Destructive Testing Of Aerospace Structures, Murali Krishna, Vladik Kreinovich, Roberto Osegueda

Departmental Technical Reports (CS)

In nondestructive testing, to locate the faults, we send an ultrasonic signal and measure the resulting vibration at different points. To describe and combine the uncertainty corresponding to different measurements and fuzzy estimates, we used fuzzy logic. As a result, we get reasonably simple computational models which lead to as good fault detection as the known more complicated models.


Kolmogorov Complexity-Based Ideas For Locating Text In Web Images, Martin Schmidt, Vladik Kreinovich, Luc Longpre Aug 1999

Kolmogorov Complexity-Based Ideas For Locating Text In Web Images, Martin Schmidt, Vladik Kreinovich, Luc Longpre

Departmental Technical Reports (CS)

The gaining popularity of the World Wide Web increases security risks. Search tools monitor plain text in web pages, but search for text in graphical images is still difficult. For this search, we use the fact that the compressed images with text have different size than images without text.


Theoretical Explanation For The Empirical Probability Of Detection (Pod) Curve: A Neural Network-Motivated Approach, Yohans Mendoza, Roberto Osegueda Aug 1999

Theoretical Explanation For The Empirical Probability Of Detection (Pod) Curve: A Neural Network-Motivated Approach, Yohans Mendoza, Roberto Osegueda

Departmental Technical Reports (CS)

For non-destructive testing of aerospace structures, it is extremely important to know how the probability of detecting a fault depends on its size. Recently, an empirical formula has been found which described this dependence. In this paper, we provide the theoretical justification for this formula by using methods motivated by the neural network approach.


Formal Testing Of Object-Oriented Software: From The Method To The Tool, Cécile Péraire Jul 1999

Formal Testing Of Object-Oriented Software: From The Method To The Tool, Cécile Péraire

Cécile Péraire

No abstract provided.


Runtime Assurance Based On Formal Specifications, Insup Lee, Sampath Kannan, Moonjoo Kim, Oleg Sokolsky, Mahesh Viswanathan Jul 1999

Runtime Assurance Based On Formal Specifications, Insup Lee, Sampath Kannan, Moonjoo Kim, Oleg Sokolsky, Mahesh Viswanathan

Departmental Papers (CIS)

We describe the Monitoring and Checking (MaC) framework which assures the correctness of the current execution at run-time. Monitoring is performed based on a formal specification of system requirements. MaC bridges the gap between formal specification and verification, which ensures the correctness of a design rather than an implementation, and testing, which partially validates an implementation. An important aspect of the framework is a clear separation between implementation-dependent description of monitored objects and high-level requirements specification. Another salient feature is automatic instrumentation of executable code. The paper presents an overview of the framework and two languages to specify monitoring scripts ...


Examination Of Beam Propagation In Misaligned Holographic Gratings And Comparison With The Acousto-Optic Transfer Function Model For Profiled Beams, Monish Ranjan Chatterjee, David D. Reagan Jul 1999

Examination Of Beam Propagation In Misaligned Holographic Gratings And Comparison With The Acousto-Optic Transfer Function Model For Profiled Beams, Monish Ranjan Chatterjee, David D. Reagan

Electrical and Computer Engineering Faculty Publications

A transfer function formalism developed earlier for the propagation of profiled optical beams through acousto-optic Bragg cells is revisited and applied to a thick holographic grating. The results based on the holographic coupled wave model and the acousto-optic multiple scattering model are shown to be compatible, and equivalent parameters such as the Q and grating strength are defined for the two systems. Results for a Gaussian spatial profile are numerically computed and compared. For the holographic grating, a profiled beam may be interpreted as an angular misalignment or Bragg-angle mismatch problem. The case of Bragg-wavelength mismatch is also investigated for ...