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

Engineering Commons

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

Series

PDF

Computer Engineering

2002

Institution
Keyword
Publication

Articles 1 - 30 of 98

Full-Text Articles in Engineering

Remote Experimental Station For Engineering Education, Muralidhar Doddapuneni Dec 2002

Remote Experimental Station For Engineering Education, Muralidhar Doddapuneni

FIU Electronic Theses and Dissertations

This thesis provides a distance-learning laboratory for students of electrical and computer engineering department where the instructor can conduct experiments on a computer and send the results to the students at remote computers. The output of the experiment conducted by the instructor is sampled using a successive approximation Analog to Digital (A/D) converter. A microcontroller collects samples using high speed queued serial peripheral interface clock and transmits data to IBM-compatible personal computer over a serial port interface, where the samples are processed using Fast Fourier Transforms and graphed. The client/server application developed transfers the acquired samples over Transmission Control Protocol/Internet …


Why Benchmarking Is An (Asymptotically) Optimal Approach To Numerical Methods: A Geombinatoric Proof, Vladik Kreinovich, Scott A. Starks Dec 2002

Why Benchmarking Is An (Asymptotically) Optimal Approach To Numerical Methods: A Geombinatoric Proof, Vladik Kreinovich, Scott A. Starks

Departmental Technical Reports (CS)

In numerical mathematics, one of the most frequently used ways of gauging the quality of different numerical methods is benchmarking. Specifically, once we have methods that work well on some (but not all) problems from a given problem class, we find the problem that is the toughest for the existing methods. This problem becomes a benchmark for gauging how well different methods solve problems that previous methods could not. Once we have a method that works well in solving this benchmark problem, we repeat the process again -- by selecting, as a new benchmark, a problem that is the toughest …


Motion Retrieval By Temporal Slices Analysis, Chong-Wah Ngo, Chong-Wah Ngo, Hong-Jiang Zhang Dec 2002

Motion Retrieval By Temporal Slices Analysis, Chong-Wah Ngo, Chong-Wah Ngo, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

In this papel; we investigate video shots retrieval based on the analysis of temporal slice images. Temporal slices are a set of2D images extracted along the time dimension of image sequences. They encode rich set of motion clues for shot similarity measure. Because motion is depicted as texture orientation in temporal slices, we utilize various texture features such as tensor histogram, Gabor feature, and the statistical feature of co-occurrence matrix extracted directly from slices for motion description and retrieval. In this way, motion retrieval can be treated in a similar way as texture retrieval problem. Experimental results indicate that the …


On Clustering And Retrieval Of Video Shots Through Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang Dec 2002

On Clustering And Retrieval Of Video Shots Through Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang

Research Collection School Of Computing and Information Systems

Based on the analysis of temporal slices, we propose novel approaches for clustering and retrieval of video shots. Temporal slices are a set of two-dimensional (2-D) images extracted along the time dimension of an image volume. They encode rich set of visual patterns for similarity measure. In this paper, we first demonstrate that tensor histogram features extracted from temporal slices are suitable for motion retrieval. Subsequently, we integrate both tensor and color histograms for constructing a two-level hierarchical clustering structure. Each cluster in the top level contains shots with similar color while each cluster in bottom level consists of shots …


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

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

Fuels Campaign (TRP)

The fifth quarter of the project covered the following:

· Literature Search: The process of evaluating the pertinent literature continued.

· Mr. Richard Silva continued the development of a simulation model with a Waelischmiller hot cell robot. Rich will continue to develop detailed 3-D process simulation models as his M.Sc. thesis project.

· Dr. Mauer presented a paper at the ANS Winter annual meeting in Washington, D.C. titled: “Design and Evaluation of Processes for Transmuter Fuel Fabrication.”

· Concepts and Methods for Vision-Based Hot Cell Supervision and control (Ph.D. Student Jae-Kyu Lee )

· Dr. Mauer presented a paper at …


Simulation And Analysis Of Network Traffic For Efficient And Reliable Information Transfer, Neelima Boppana Nov 2002

Simulation And Analysis Of Network Traffic For Efficient And Reliable Information Transfer, Neelima Boppana

FIU Electronic Theses and Dissertations

With the growing commercial importance of the Internet and the development of new real-time, connection-oriented services like IP-telephony and electronic commerce resilience is becoming a key issue in the design of TP-based networks. Two emerging technologies, which can accomplish the task of efficient information transfer, are Multiprotocol Label Switching (MPLS) and Differentiated Services. A main benefit of MPLS is the ability to introduce traffic-engineering concepts due to its connection-oriented characteristic. With MPLS it is possible to assign different paths for packets through the network. Differentiated services divides traffic into different classes and treat them differently, especially when there is a …


Intelligent Techologies, Vladik Kreinovich, Hung T. Nguyen, Nadipuram S. Prasad, Pratit Santiprabhob Nov 2002

Intelligent Techologies, Vladik Kreinovich, Hung T. Nguyen, Nadipuram S. Prasad, Pratit Santiprabhob

Departmental Technical Reports (CS)

No abstract provided.


Designing Interdisciplinary Approaches To Problem Solving Into Computer Languages, Daniel E. Cooke, Vladik Kreinovich, Joseph E. Urban Nov 2002

Designing Interdisciplinary Approaches To Problem Solving Into Computer Languages, Daniel E. Cooke, Vladik Kreinovich, Joseph E. Urban

Departmental Technical Reports (CS)

Many interdisciplinary design efforts require the involvement of computer scientists because of the complexity of the problem solving tools available for the projects. This paper demonstrates how appropriate language design can place high level languages in the hands of scientists and engineers, thus providing a more automated approach to problem solving that may reduce the amount of computer scientist involvement. The language SequenceL serves as an example of this approach.


Universal Approximation Theorem For Uninorm-Based Fuzzy Systems Modeling, Ronald R. Yager, Vladik Kreinovich Oct 2002

Universal Approximation Theorem For Uninorm-Based Fuzzy Systems Modeling, Ronald R. Yager, Vladik Kreinovich

Departmental Technical Reports (CS)

Most existing universal approximation results for fuzzy systems are based on the assumption that we use t-conorms and t-conorms to represent "and" and "or". Yager has proposed to use, within the fuzzy system modeling paradigm, more general operations based on uninorms. In this paper, we show that the universal approximation property holds for an arbitrary choice of a uninorm.


Absolute Bounds On The Mean Of Sum, Product, Max, And Min: A Probabilistic Extension Of Interval Arithmetic, Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Jorge Lopez Oct 2002

Absolute Bounds On The Mean Of Sum, Product, Max, And Min: A Probabilistic Extension Of Interval Arithmetic, Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Jorge Lopez

Departmental Technical Reports (CS)

We extend the main formulas of interval arithmetic for different arithmetic operations x1*x2 to the case when, for each input xi, in addition to the interval [xi]=[xi-,xi+] of possible values, we also know its mean Ei (or an interval [Ei] of possible values of the mean), and we want to find the corresponding bounds for x1*x2 and its mean.


An Idl/Envi Implementation Of The Fft Based Algorithm For Automatic Image Registration, Hongjie Xie, Nigel Hicks, George R. Keller, Haitao Huang, Vladik Kreinovich Oct 2002

An Idl/Envi Implementation Of The Fft Based Algorithm For Automatic Image Registration, Hongjie Xie, Nigel Hicks, George R. Keller, Haitao Huang, Vladik Kreinovich

Departmental Technical Reports (CS)

Georeferencing images is a laborious process so schemes for automating this process have been under investigation for some time. Among the most promising automatic registration algorithms aare those based on Fast Fourier Transform (FFT). The displacement between the two given images can be computed by computing the ratio F1*conj(F2)/|F1*F2|, and then applying the inverse Fourier transform. The result is an impulse-like function, which is approximately zero everywhere except at the displacement that is necessary to optimally register the images. Coverting from rectangular coordinates to log-polar coordinates, shifts representing rotation and scaling can be also determined to complete the georectification process. …


Research On Advanced Soft Computing And Its Applications (Introduction To The Special Issue), Vilem Novak, Irina Perfilieva, Hung T. Nguyen, Vladik Kreinovich Oct 2002

Research On Advanced Soft Computing And Its Applications (Introduction To The Special Issue), Vilem Novak, Irina Perfilieva, Hung T. Nguyen, Vladik Kreinovich

Departmental Technical Reports (CS)

The main objective for the research presented in this special issue is to advance theoretical basis in soft computing, for the purpose of improving applications.

Why is this theoretical research needed? Because soft computing in general (and intelligent control and decision making in particular) are, in many aspects, still an art. To make this methodology easier to apply, we must use the experience of successful applications of fuzzy control, decision making or classification and extract formal rules that would capture this experience. To be able to do that efficiently, we must understand why some versions of soft computing methodology turned …


Towards More Realistic (E.G., Non-Associative) And- And Or-Operations In Fuzzy Logic, Vladik Kreinovich Oct 2002

Towards More Realistic (E.G., Non-Associative) And- And Or-Operations In Fuzzy Logic, Vladik Kreinovich

Departmental Technical Reports (CS)

No abstract provided.


2002 (Fall) Ensi Informer Magazine, Morehead State University. Engineering Sciences Department Oct 2002

2002 (Fall) Ensi Informer Magazine, Morehead State University. Engineering Sciences Department

ENSI Informer Magazine Archive

The ENSI Informer Magazine published in the fall of 2002.


An Intelligent System For Monitoring The Microgravity Environment Quality On-Board The International Space Station, Paul P. Lin, Kenol Jules Oct 2002

An Intelligent System For Monitoring The Microgravity Environment Quality On-Board The International Space Station, Paul P. Lin, Kenol Jules

Mechanical Engineering Faculty Publications

An intelligent system for monitoring the microgravity environment quality on-board the International Space Station is presented. The monitoring system uses a new approach combining Kohonen's self-organizing feature map, learning vector quantization, and a back propagation neural network to recognize and classify the known and unknown patterns. Finally, fuzzy logic is used to assess the level of confidence associated with each vibrating source activation detected by the system.


Training Radial Basis Neural Networks With The Extended Kalman Filter, Daniel J. Simon Oct 2002

Training Radial Basis Neural Networks With The Extended Kalman Filter, Daniel J. Simon

Electrical and Computer Engineering Faculty Publications

Radial basis function (RBF) neural networks provide attractive possibilities for solving signal processing and pattern classification problems. Several algorithms have been proposed for choosing the RBF prototypes and training the network. The selection of the RBF prototypes and the network weights can be viewed as a system identification problem. As such, this paper proposes the use of the extended Kalman filter for the learning procedure. After the user chooses how many prototypes to include in the network, the Kalman filter simultaneously solves for the prototype vectors and the weight matrix. A decoupled extended Kalman filter is then proposed in order …


A Lessons Learned Repository For Computer Forensics, Warren Harrison, George Heuston, Mark Morrissey, David Aucsmith, Sarah Mocas, Steve Russelle Oct 2002

A Lessons Learned Repository For Computer Forensics, Warren Harrison, George Heuston, Mark Morrissey, David Aucsmith, Sarah Mocas, Steve Russelle

Computer Science Faculty Publications and Presentations

The Law Enforcement community possesses a large, but informal, community memory with respect to digital forensics. Large, because the experiences of every forensics technician and investigator contribute to the whole. Informal because there is seldom an explicit mechanism for disseminating this wisdom except “over the water cooler”. As a consequence, the same problems and mistakes continue to resurface and the same solutions are re-invented. In order to better exploit this informal collection of wisdom, the key points of each experience can be placed into a Repository for later dissemination. We describe a web-based Lessons Learned Repository (LLR) that facilitates contribution …


Shared-Data Or Message Passing Computing Models – A Human Factor In Technical Choices, Angela Sodan, Luiz Fernando Capretz Sep 2002

Shared-Data Or Message Passing Computing Models – A Human Factor In Technical Choices, Angela Sodan, Luiz Fernando Capretz

Electrical and Computer Engineering Publications

No abstract provided.


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

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

Fuels Campaign (TRP)

The fourth quarter of the project covered the following:

• Literature Search: The process of evaluating the pertinent literature continued. Results are summarized.

• Mr. Richard Silva developed a simulation model with a Waelischmiller hot cell robot. Rich will continue to develop detailed 3-D process simulation models as his M.Sc. thesis project.

• Dr. Mauer visited CEA Cadarache and CEA Marcoule in France, the institute for transuranics in Karlsruhe, and the Framatome manufacturing plant in Lingen, Germany.

• Concepts and Methods for Vision-Based Hot Cell Supervision and control (Ph.D. Student Jae-Kyu Lee )


Design And Evaluation Of Processes For Fuel Fabrication: Year 1 Final Report, Georg F. Mauer Aug 2002

Design And Evaluation Of Processes For Fuel Fabrication: Year 1 Final Report, Georg F. Mauer

Fuels Campaign (TRP)

The project objective is the design and evaluation of manufacturing processes for transmuter fuel fabrication. The large-scale deployment of remote fabrication and refabrication processes will be required for all transmutation scenarios. Current program emphasis is on a five-year effort to determine the feasibility of transmutation as a technology to limit the need for repository storage of spent commercial fuel. The evaluation of the fabrication processes will create a decision support data base to document design, operations, and costs. Fabrication processes required for different fuel types differ in terms of equipment types, throughput, and cost. The year 1 project was focused …


Design And Evaluation Of Processes For Fuel Fabrication: Year 1 Final Report, Georg F. Mauer Aug 2002

Design And Evaluation Of Processes For Fuel Fabrication: Year 1 Final Report, Georg F. Mauer

Fuels Campaign (TRP)

The project objective is the design and evaluation of manufacturing processes for transmuter fuel fabrication. The large-scale deployment of remote fabrication and refabrication processes will be required for all transmutation scenarios. Current program emphasis is on a five-year effort to determine the feasibility of transmutation as a technology to limit the need for repository storage of spent commercial fuel. The evaluation of the fabrication processes will create a decision support data base to document design, operations, and costs. Fabrication processes required for different fuel types differ in terms of equipment types, throughput, and cost. The year 1 project was focused …


Design Of A Fast And Resource-Efficient Fault Management System In Optical Networks To Suit Real-Time Multimedia Applications, Tirthankar Ghosh Aug 2002

Design Of A Fast And Resource-Efficient Fault Management System In Optical Networks To Suit Real-Time Multimedia Applications, Tirthankar Ghosh

FIU Electronic Theses and Dissertations

Today's telecommunications networks are relying more and more on optical fibers as their physical medium. Currently the Wavelength Division Multiplexing technology enables hundreds of wavelengths to be multiplexed on a single fiber. Using this technology capacity can be dramatically increased, even to the order of Terabits per second. While WDM technology has given a satisfactory answer to the ever-increasing demand for capacity, there is still a problem which needs to be handled efficiently: survivability.

Our proposed fault restoration system optimized between restoration cost and speed. We extended the concept of Forward Equivalence Class (FEC) in Multi Protocol Label switching (MPLS) …


Fault/Configuration Management For Wireless Ad-Hoc Network, Abhay Doshi Aug 2002

Fault/Configuration Management For Wireless Ad-Hoc Network, Abhay Doshi

FIU Electronic Theses and Dissertations

An ad hoc network is maintained by the combined efforts of all the mobile nodes themselves, who often operate under severe constraints, such as limited battery power, variable link quality, and limited storage capacity. As a result, there is a growing need for enhanced fault and configuration management solutions to help in tracking problems as well as solving them.

Viable network architecture for a wireless ad-hoc environment, which takes advantages of both hierarchical and distributed architectures, has been investigated. A complete design solution is proposed which makes ad-hoc environments less susceptible to faults. Results shows that by applying the proposed …


Interval Computations Related To Privacy In Statistical Databases, Luc Longpre, Vladik Kreinovich Aug 2002

Interval Computations Related To Privacy In Statistical Databases, Luc Longpre, Vladik Kreinovich

Departmental Technical Reports (CS)

We show that the need to maintain privacy in statistical databases naturally leads to interval computations, and provide feasible algorithms for the corresponding interval computation problems.


From [0,1]-Based Logic To Interval Logic (From Known Description Of All Possible [0,1]-Based Logical Operations To A Description Of All Possible Interval-Based Logical Operations), Hung T. Nguyen, Vladik Kreinovich Aug 2002

From [0,1]-Based Logic To Interval Logic (From Known Description Of All Possible [0,1]-Based Logical Operations To A Description Of All Possible Interval-Based Logical Operations), Hung T. Nguyen, Vladik Kreinovich

Departmental Technical Reports (CS)

Since early 1960s, we have a complete description of all possible [0,1]-based logical operations, namely of "and"-operations (t-norms) and of "or"-operations (t-conorms). In some real-life situations, intervals provide a more adequate way of describing uncertainty, so we need to describe interval-based logical operations. Usually, researchers followed a pragmatic path and simply derived these operations from the [0,1]-based ones. From the foundational viewpoint, it is desirable not to a priori restrict ourselves to such derivative operations but, instead, to get a description of all interval-based operations which satisfy reasonable properties.

Such description is presented in this paper. It turns out that …


An Introductory Digital Design Course Using A Low–Cost Autonomous Robot, Tyson S. Hall, Kimberly E. Newman, James O. Hamblen Aug 2002

An Introductory Digital Design Course Using A Low–Cost Autonomous Robot, Tyson S. Hall, Kimberly E. Newman, James O. Hamblen

Faculty Works

This paper describes a new digital design laboratory developed for undergraduate students in this electrical and computer engineering curriculum. A top-down rapid prototyping approach with commercial computer-aided design tools and field-programmable logic devices (FPLDs) is used for laboratory projects. Students begin with traditional transistor–transistor logic-based projects containing a few gates and progress to designing a simple 16-bit computer, using very high-speed integrated circuits hardware description language (VHDL) synthesis tools and an FPLD. To help motivate students, the simple computer design is programmed to control a small autonomous robot with two servo drive motors and several sensors. The laboratory concludes with …


Organizing And Personalizing Intelligence Gathering From The Web, Hwee-Leng Ong, Ah-Hwee Tan, Jamie Ng, Pan Hong, Qiu-Xiang Li Aug 2002

Organizing And Personalizing Intelligence Gathering From The Web, Hwee-Leng Ong, Ah-Hwee Tan, Jamie Ng, Pan Hong, Qiu-Xiang Li

Research Collection School Of Computing and Information Systems

In this paper, we describe how an integrated web‐based application, code‐named FOCI (Flexible Organizer for Competitive Intelligence), can help the knowledge worker in the gathering, organizing, tracking and dissemination of competitive intelligence (CI). It combines the use of a novel user‐configurable clustering, trend analysis and visualization techniques to manage information gathered from the web. FOCI allows its users to define and personalize the organization of the information clusters according to their needs and preferences into portfolios. These personalized portfolios created are saved and can be subsequently tracked and shared with other users. The paper runs through an example to show …


Kolmogorov Complexity And Chaotic Phenomena, Vladik Kreinovich, Isaak A. Kunin Jun 2002

Kolmogorov Complexity And Chaotic Phenomena, Vladik Kreinovich, Isaak A. Kunin

Departmental Technical Reports (CS)

Born about three decades ago, Kolmogorov Complexity Theory (KC) led to important discoveries that, in particular, give a new understanding of the fundamental problem: interrelations between classical continuum mathematics and reality (physics, biology, engineering sciences, ...).

Specifically, in addition to the equations, physicists use the following additional difficult-to-formalize property: that the initial conditions and the value of the parameters must not be abnormal. We will describe a natural formalization of this property, and show that this formalization in good accordance with theoretical physics. At present, this formalization has been mainly applied to the foundations of physics. However, potentially, more practical …


Implementation Of Large Neural Networks Using Decomposition, Henry Selvaraj, H. Niewiadomski, P. Buciak, M. Pleban, Piotr Sapiecha, Tadeusz Luba, Venkatesan Muthukumar Jun 2002

Implementation Of Large Neural Networks Using Decomposition, Henry Selvaraj, H. Niewiadomski, P. Buciak, M. Pleban, Piotr Sapiecha, Tadeusz Luba, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

The article presents methods of dealing with huge data in the domain of neural networks. The decomposition of neural networks is introduced and its efficiency is proved by the authors’ experiments. The examinations of the effectiveness of argument reduction in the above filed, are presented. Authors indicate, that decomposition is capable of reducing the size and the complexity of the learned data, and thus it makes the learning process faster or, while dealing with large data, possible. According to the authors experiments, in some cases, argument reduction, makes the learning process harder.


A Simplistic Plasma Dust Removal Model Employing Radiation Pressure, Robert A. Schill Jr. Jun 2002

A Simplistic Plasma Dust Removal Model Employing Radiation Pressure, Robert A. Schill Jr.

Electrical & Computer Engineering Faculty Research

A simple heuristic model is developed to examine the feasibility of using radiation pressure as a means to transport plasma dust out of the path of the forthcoming electron or photon beam. A slow electromagnetic surface wave coupled to a planar target or substrate exerts the required pressure in the removal process. The model is examined using data and parameters from single-shot radiography experiments. Optimal source requirements are identified for a typical radiography experiment. Source energies and powers are a minimum over an optimum band of frequencies where both conduction and plasma oscillation effects are mutually significant. Above the band …