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

Digital Commons Network™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 16621 - 16650 of 17517

Full-Text Articles in Entire DC Network

Recognition And Verification Of Design Patterns, Michael P. Plezbert, Ron K. Cytron Jan 2000

Recognition And Verification Of Design Patterns, Michael P. Plezbert, Ron K. Cytron

All Computer Science and Engineering Research

In this paper we consider the automatic discovery of design (programming) patterns. While patterns have surfaced as an effective mechanism for authoring and understanding compelx software, popular languages lack facilities for direct specification of patterns or verification of pattern usage in program specifications. Static analysis for patterns is provably undecidable; we focus on discovery and verification of patterns by analyzing dynamic sequences of method calls on object. We show a proof-of-concept of our approach by presenting the results of analyzing a Java program for Iterator patterns.


Lime: A Middleware For Physical And Logical Mobility, Gian Pietro Picco, Amy L. Murphy, Gruia-Catalin Roman Jan 2000

Lime: A Middleware For Physical And Logical Mobility, Gian Pietro Picco, Amy L. Murphy, Gruia-Catalin Roman

All Computer Science and Engineering Research

LIME is a middleware supporting the development of applications that exhibit physical mobility of hosts, logical mobility of agents, or both. LIME adopts a coordination perspective inspired by work on the Linda model. The context for computation, represented in Linda by a globally accessible, persistent tuple space, is represented in LIME by transient sharing of the tuple spaces carried by each individual mobile unit. Linda tuple spaces are also extended with a notion of location and with the ability to react to a given state. The hypothesis underlying our work is that the resulting model provides a minimalist set of …


Almi: An Application Level Multicast Infrastructure, Dimitrios Pendarakis, Sherlia Shi, Dinesh Verma, Marcel Waldvogel Jan 2000

Almi: An Application Level Multicast Infrastructure, Dimitrios Pendarakis, Sherlia Shi, Dinesh Verma, Marcel Waldvogel

All Computer Science and Engineering Research

The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems such as reliability, flow and congestion control, security and access control. Motivated by these problems, we have designed and implemented ALMI, an application level group communication middleware, which does not rely on network infrastructure support and thus, allows accelerated deployment and simplified configuration at the cost of a relatively small increase in traffic load. ALMI is tailored toward support of multicast groups of relatively small …


Design Tradeoffs For Embedded Network Processors, Tilman Wolf, Mark Franklin, Edward W. Spitznagel Jan 2000

Design Tradeoffs For Embedded Network Processors, Tilman Wolf, Mark Franklin, Edward W. Spitznagel

All Computer Science and Engineering Research

Demands for flexible processing has moved general-purpose processing into the data path of networks. With the development of System-On-a-Chip technology, it is possible to put several processors with memory and I/O components on a single ASIC. We present a model of such a system with a simple performance metric and show how the number of processors and cache sizes can be optimized for a given workload. Based on a telecommunications benchmark we show the results of such an optimization and discuss how specialied hardware and appropriate scheduling can further improve system performance.


Synthesizer, A Pattern Language For Designing Digital Modular Synthesis Software, Thomas V. Judkins, Christopher D. Gill Jan 2000

Synthesizer, A Pattern Language For Designing Digital Modular Synthesis Software, Thomas V. Judkins, Christopher D. Gill

All Computer Science and Engineering Research

Synthesizer is a pattern language for designing digital synthesizers using modular synthesis in software to generate sound. Software developed according to this pattern language emulates the abilities of an analog synthesizer. Modular synthesis is one of the oldest sound synthesis techniques. It was used in the earliest analog synthesizers, like the Moog [1] and ARP [2]. These machines introduced the oscillator-filter-amplifier paradigm, where sound generated by an oscillator is passed through a series of filters and amplifers before being sent to a speaker. These first machines had physical modules through which electrical signals were passed. These modules can be emulated …


Profile-Based Routing: A New Framework For Mpls Traffic Engineering, Subhash Suri, Marcel Waldvogel, Priyank Ramesh Warkhede Jan 2000

Profile-Based Routing: A New Framework For Mpls Traffic Engineering, Subhash Suri, Marcel Waldvogel, Priyank Ramesh Warkhede

All Computer Science and Engineering Research

We present a new algorithm and framework for dynamic routing of bandwidth guaranteed flows. The problem is motivated by the need to dynamically set up bandwidth guaranteed paths in carrier and ISP networks. Traditional routing algorithms such as minimum hop routing or widest path routing do not take advantage of any knowledge about the traffic distribution or ingress-egress pairs, and therefore can often lead to severe network underutilization. Our work is inspired by the recently proposed "minimum interference routing" algorithm (MIRA) of Kodialam and Lakshman, but it improves on their approach in several ways. Our main idea is to use …


Hello, World: A Simple Application For The Field Programmable Port Extender (Fpx), John Lockwood, David Lim Jan 2000

Hello, World: A Simple Application For The Field Programmable Port Extender (Fpx), John Lockwood, David Lim

All Computer Science and Engineering Research

The FPX provides simple and fast mechanisms to process cells or packets. By performing all computations in FPGA hardware, cells and packets can be processing at the full line speed of the card [currently 2.4 Gbits/sec]. A sample application, called 'Hello World' has been developed that illustrates how easily an application can be implemented on the FPX. This application uses the FPGA hardware to search for a string on a particular flow and selectively replace contents of the payload. The resulting circuit operates at 119 MHz on a Xilinx XCV 1000E-FG680-7, and occupies less than 1% of the available gates …


The Design And Performance Of Meta-Programming Mechanisms For Object Request Broker Middleware, Nanbor Wang, Kirthika Parameswaran, Douglass Schmidt Jan 2000

The Design And Performance Of Meta-Programming Mechanisms For Object Request Broker Middleware, Nanbor Wang, Kirthika Parameswaran, Douglass Schmidt

All Computer Science and Engineering Research

Distributed object computing (DOC) middleware shields developers from many tedious and error-prone aspects of programming distribued applications. Without proper support from the middleware, however, it can be hard to evolve distributed applications after they are deployed. Therefore, DOC middleware should support meta-programming mechanisms, such as smart proxies and interceptors, that improve the adaptability of distributed applications by allowing their behavior to be modified without drastically changing existing software. This paper presents three contributions to the study of metaprogramming mechanisms for DOC middleware. First, it illustrates, compares, and contrasts several meta-programming mechanisms from an application developer's perspective. Second, it outlines the …


Security In Distributed Systems - A Framework For Different Application Types, Ingo Stengel Jan 2000

Security In Distributed Systems - A Framework For Different Application Types, Ingo Stengel

Theses

Security is a factor which decides upon the applicability of distributed applications. Therefore this thesis deals with security in distributed systems. The complexity of the existing distributed technologies makes it necessary to reduce the number of distributed technologies considered in this thesis, i.e. concentrating on: Java, Mobile Agents and CORBA, where only Java-based mobile agents will be considered.

After a short review of basic security principles including firewalls, existing security problems in the above mentioned distributed technologies are analysed. Additional generic problems in distributed systems are outlined.

Solutions are referring to two different areas: those regarding security problems with firewalls …


Distance Spectra For Trellis Coded Modulation Schemes On Channels With Intersymbol Interference, Sabi̇re Haciömeroğlu, Melek D. Yücel Jan 2000

Distance Spectra For Trellis Coded Modulation Schemes On Channels With Intersymbol Interference, Sabi̇re Haciömeroğlu, Melek D. Yücel

Turkish Journal of Electrical Engineering and Computer Sciences

The effect of intersymbol interference on distance spectra for trellis coded 8-PSK, 16-QAM and 32-AMPM modulation schemes is evaluated using the methods proposed by Schlegel. Distance spectra of 16-state 8-PSK scheme are computed for different intersymbol interference channels. It is seen that on channels with intersymbol interference the spectral lines are spread into a nearly continuous spectrum and the minimum Euclidean distance between codewords decreases severely. Hence, although the main contribution at large signal to noise ratios comes from the minimum Euclidean distance ( d_{free} ) , higher spectral components also become very important at moderate values of the signal …


Control Chart Pattern Recognition Using Artificial Neural Networks, Şeref Sağiroğlu, Erkan Beşdok, Mehmet Erler Jan 2000

Control Chart Pattern Recognition Using Artificial Neural Networks, Şeref Sağiroğlu, Erkan Beşdok, Mehmet Erler

Turkish Journal of Electrical Engineering and Computer Sciences

Precise and fast control chart pattern (CCP) recognition is important for monitoring process environments to achieve appropriate control and to produce high quality products. CCPs can exhibit six types of pattern: normal, cyclic, increasing trend, decreasing trend, upward shift and downward shift. Except for normal patterns, all other patterns indicate that the process being monitored is not functioning correctly and requires adjustment. This paper describes a new type of neural network for speeding up the training process and to compare three training algorithms in terms of speed, performance and parameter complexity for CCP recognition. The networks are multilayered perceptrons trained …


Multicast Services For Multimedia Collaborative Applications, Emad Eldin Mohamed Mohamed Jan 2000

Multicast Services For Multimedia Collaborative Applications, Emad Eldin Mohamed Mohamed

Computer Science Theses & Dissertations

This work aims at providing multicast services for multimedia collaborative applications over large inter-networks such as the Internet. Multimedia collaborative applications are typically of small group size, slow group membership dynamics, and awareness of participants' identities and locations. Moreover, they usually consist of several components such as audio, video, shared whiteboard, and single user application sharing engines that collectively help make the collaboration session successful. Each of these components has its demands from the communication layer that may differ from one component to another. This dissertation identifies the overall characteristics of multimedia collaborative applications and their individual components. It also …


Supervised Adaptive Resonance Theory And Rules, Ah-Hwee Tan Jan 2000

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 …


B. A Java Dialectic, Douglas Lyon, Frances Grodzinsky Jan 2000

B. A Java Dialectic, Douglas Lyon, Frances Grodzinsky

School of Computer Science & Engineering Faculty Publications

Many books often gush over Java. People want to know, before they learn a language, what the drawbacks are for a language. They want to know what the strenghs are. After all, a computer language is just a tool. We shape our tools, and there after, our tools shape us! This chapter contains a dialog between three Java instructors. The participants are, Professors Good, Bad and Ugly. Professor Good is a strong proponent of Java. Professor Bad is a strong opponent of Java. Professor Ugly has been leaning toward the asthetic analysis of the language, particularly with an eye toward …


An Efficient Algorithm To Determine The Periodic Steady-State Solutions Of Nonlinear Systems Using Extended Spectral Analysis, Gülay Tohumoğlu Jan 2000

An Efficient Algorithm To Determine The Periodic Steady-State Solutions Of Nonlinear Systems Using Extended Spectral Analysis, Gülay Tohumoğlu

Turkish Journal of Electrical Engineering and Computer Sciences

A new method for the solution of nonlinear periodic systems was developed. It avoids the time domain calculations of the whole network equations. In the proposed method, by forming the augmented network as linear and nonlinear subnetworks these subnetworks are formulated in complex frequency and time domain respectively. Using spectral analysis the steady-state periodic solution of the whole nonlinear network is reached by an iterative approach. The method can be applied efficiently to weak and strong nonlinear circuits equally well. When we divide the network into a large linear subnetwork and a small nonlinear subnetwork, this method can be applied …


Multi-Sensor 3d Image Fusion And Interactive Search, W. D. Ross, A. M. Waxman, W. W. Streilein, M. Aguilar, J. Verly, F. Liu, M. I. Braun, P. Harmon, S. Rak Jan 2000

Multi-Sensor 3d Image Fusion And Interactive Search, W. D. Ross, A. M. Waxman, W. W. Streilein, M. Aguilar, J. Verly, F. Liu, M. I. Braun, P. Harmon, S. Rak

Research, Publications & Creative Work

We describe a system under development for the 3D fusion of multi-sensor surface surveillance imagery, including electro-optical (EO), IR, SAR, multispectral and hyperspectral sources. Our approach is founded on biologically-inspired image processing algorithms. We have developed an image processing architecture enabling the unified interactive visualization of fused multi-sensor site data which utilizes a color image fusion algorithm based on retinal and cortical processing of color. We have also developed interactive Web-based tools for training neural network search agents that are capable of automatically scanning site data for the fused multi-sensor signatures of targets and/or surface features of interest. Each search …


Coordination And Mobility, Gruia-Catalin Roman, Amy L. Murphy, Gian Pietro Picco Jan 2000

Coordination And Mobility, Gruia-Catalin Roman, Amy L. Murphy, Gian Pietro Picco

All Computer Science and Engineering Research

Mobility entails the study of systems in which components change location, in a voluntary or involuntary manner, and move across a space that may be defined to be either logical or physical. Coordination is concerned with what happens when two or more components come in contact with each other. In this paper we put forth a working definition of coordinatoin, we construct argumetns that demonstrate that coordination is central to understanding mobility, we explore the intellectual richness of the notion of coordination, and we consider the practical implications of coordination-centered system design strategies. We develop these ideas in two steps. …


Configuring Sessions In Programmable Networks, Sumi Choi, Jonathan Turner, Tilman Wolf Jan 2000

Configuring Sessions In Programmable Networks, Sumi Choi, Jonathan Turner, Tilman Wolf

All Computer Science and Engineering Research

The provision of advanced computational services within networks is rapidly becoming both feasible and economical. We present a general approach to the problem of configuring application sessions that require intermediate processing by showing how the session configuration problem can be transformed to a conventional shortest path problem. We show, through a series of examples, that the method can be applied to a wide variety of different situations.


Scene-Based Nonuniformity Correction With Video Sequences And Registration, Russell C. Hardie, Majeed M. Hayat, Earnest Armstrong, Brian Yasuda Jan 2000

Scene-Based Nonuniformity Correction With Video Sequences And Registration, Russell C. Hardie, Majeed M. Hayat, Earnest Armstrong, Brian Yasuda

Electrical and Computer Engineering Faculty Research and Publications

We describe a new, to our knowledge, scene-based nonuniformity correction algorithm for array detectors. The algorithm relies on the ability to register a sequence of observed frames in the presence of the fixed-pattern noise caused by pixel-to-pixel nonuniformity. In low-to-moderate levels of nonuniformity, sufficiently accurate registration may be possible with standard scene-based registration techniques. If the registration is accurate, and motion exists between the frames, then groups of independent detectors can be identified that observe the same irradiance (or true scene value). These detector outputs are averaged to generate estimates of the true scene values. With these scene estimates, and …


Stochastic Stability Of The Continuous-Time Extended Kalman Filter, K. Reif, S. Gunther, Edwin E. Yaz, R. Unbehauen Jan 2000

Stochastic Stability Of The Continuous-Time Extended Kalman Filter, K. Reif, S. Gunther, Edwin E. Yaz, R. Unbehauen

Electrical and Computer Engineering Faculty Research and Publications

he error behaviour of the extended Kalman filter is analysed. It is proved that the estimation error remains bounded if the system satisfies a detectability condition and both the initial estimation error and the disturbing noise terms are small enough. Moreover, some selected cases with both bounded and unbounded estimation error are demonstrated by numerical simulations.


The Ups Prototype: An Experimental End-User Service Across E-Print Archives, Herbert Van De Sompel, Thomas Krichel, Michael L. Nelson, Patrick Hochstenbach, Victor Lyapunov, Kurt Maly, Mohammad Zubair, Mohamed Kholief, Xiaoming Liu, Heath O'Connell Jan 2000

The Ups Prototype: An Experimental End-User Service Across E-Print Archives, Herbert Van De Sompel, Thomas Krichel, Michael L. Nelson, Patrick Hochstenbach, Victor Lyapunov, Kurt Maly, Mohammad Zubair, Mohamed Kholief, Xiaoming Liu, Heath O'Connell

Computer Science Faculty Publications

A meeting was held in Santa Fe, New Mexico, October 21-22, 1999, to generate discussion and consensus about interoperability of publicly available scholarly information archives. The invitees represented several well known e-print and report archive initiatives, as well as organizations with interests in digital libraries and the transformation of scholarly communication. The central goal of the meeting was to agree on recommendations that would make the creation of end-user services -- such as scientific search engines and linking systems -- for data originating from distributed and dissimilar archives easier. The Universal Preprint Service (UPS) Prototype was developed in preparation for …


Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson Jan 2000

Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson

Engineering Faculty Articles and Research

We consider categories of coalgebras as (co)-fibred over a base category of parameters and analyse categorical constructions in the total category of deterministic and non-deterministic coalgebras.


Analogue-To-Digital Conversion And Image Enhancement Using Neuron-Mos Technology, Joseph W. Austin-Crowe Jan 2000

Analogue-To-Digital Conversion And Image Enhancement Using Neuron-Mos Technology, Joseph W. Austin-Crowe

Theses: Doctorates and Masters

This thesis describes the development of two novel circuits that use a newly developed technology, that of neuron-MOS, for the purposes of analogue-to-digital conversion and image enhancement. Neuron-MOS has the potential to reduce both the complexity and number of transistors required for analogue and digital circuits. A reduced area, low transistor-count- analogue-to-digital converter that is suitable for inclusion in a massively parallel array of identical image processing elements is developed. Supporting the function of the array some fundamental image enhancement operations, such as edge enhancement, are examined exploiting the unique features of neuron-MOS technology.


Intelligent Approaches To Vlsi Routing, Maolin Tang Jan 2000

Intelligent Approaches To Vlsi Routing, Maolin Tang

Theses: Doctorates and Masters

Very Large Scale Integrated-circuit (VLSI) routing involves many large-size and complex problems and most of them have been shown to be NP-hard or NP-complete. As a result, conventional approaches, which have been successfully used to handle relatively small-size routing problems, are not suitable to be used in tackling large-size routing problems because they lead to 'combinatorial explosion' in search space. Hence, there is a need for exploring more efficient routing approaches to be incorporated into today's VLSI routing system. This thesis strives to use intelligent approaches, including symbolic intelligence and computational intelligence, to solve three VLSI routing problems: Three-Dimensional (3-D) …


Development Of Self-Adaptive Back Propagation And Derivative Free Training Algorithms In Artificial Neural Networks, Shamsuddin Ahmed Jan 2000

Development Of Self-Adaptive Back Propagation And Derivative Free Training Algorithms In Artificial Neural Networks, Shamsuddin Ahmed

Theses: Doctorates and Masters

Three new iterative, dynamically self-adaptive, derivative-free and training parameter free artificial neural network (ANN) training algorithms are developed. They are defined as self-adaptive back propagation, multi-directional and restart ANN training algorithms. The descent direction in self-adaptive back propagation training is determined implicitly by a central difference approximation scheme, which chooses its step size according to the convergence behavior of the error function. This approach trains an ANN when the gradient information of the corresponding error function is not readily available. The self- adaptive variable learning rates per epoch are determined dynamically using a constrained interpolation search. As a result, appropriate …


Bandwidth Management And Quality Of Service, Adalbert Engel Jan 2000

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 …


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.


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.


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.


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

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 …