Physical Sciences and Mathematics Commons^™

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.

A Rate-Based End-To-End Multicast Congestion Control Protocol, Sherlia Shi, Marcel Waldvogel

All Computer Science and Engineering Research

Current reliable multicast protocols do not have scalable congestion control mechanisms and this deficiency leads to concerns that multicast deployment may endanger stability of the network. In this paper, we present a sender-based approach for multicast congestion control targeted towards reliable bulk data transfer. We assume that there are a few bottleneck links in a large scale multicast group at any time period and these bottlenecks persist long enough to be identified and adapted to. Our work focus on dynamically identifying the worst congested path in the multicast tree and obtaining TCP-friendly throughput on this selected path. We device novel …

Codeweave: Exploring Fine-Grained Mobility Of Code, Cecilia Mascolo, Gian Pietro Picco, Gruia-Catalin Roman

All Computer Science and Engineering Research

This paper explores the range of constructs and issues facing the designer of mobile code systems which allow for the unit of mobility to be finer-grained than that of execution. Mobile UNITY, a notation and proof logic for mobile computing, provides for this research a clean abstract setting, i.e., unconstrained by compilation and performance considerations traditionally associated with programming language design. Within the context of Mobile UNITY, we take the extreme view that every line of code and every variable declaration is potentially mobile, i.e., it may be duplicated and/or moved from one program contxt to another on the same …

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.

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 …

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.

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 …

Parallel Fpga Programming Over Backplane Chassis, John Lockwood, Tom Mclaughlin, Tom Chaney, Yuhua Chen, Fred Rosenberger, Alex Chandra, Jon Turner

All Computer Science and Engineering Research

For systems with a large number of FPGAs, where a design is instantiated across multiple FPGAs in a chassis, an efficient mechanism of programming the FPGA devices is needed. The mechanism described herein allows multiple FPGAs to be programmed across a backplane. Only a single configuration PROM is required to store the configuration for the multiple instances of the design. When the system boots, all FPGAs are programmed in parallel. This design is applicable to any system which contains a multiple board system which has instances of identical FPGA implementations distributed across the boards. Signal integrity of signals is considered.

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 …

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 …

Characterization Of Poly-Si Thin Films Deposited By Magnetron Sputtering Onto Ni Prelayers, Elena A. Guliants, Wayne A. Anderson

Electrical and Computer Engineering Faculty Publications

A method of producing a polycrystalline silicon thin film on a foreign substrate without subsequent annealing has been developed. Thermally evaporated 5–100 nm thick Nifilms served as prelayers for magnetron sputtered Si thin films. A continuous film was obtained as a result of metal induced growth of polysilicon during low temperature (below 600 °C) deposition. The film uniformity is promising for large area device applications. The influence of the Ni prelayer thickness on the grain size of thus obtained films was investigated. Atomic force microscopy and cross-sectional scanning electron microscopy studies revealed features in the 150–600 nm size range while …

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

BITs and PCs Newsletter

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

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.

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 …

A Pseudo Spot Price Algorithm Applied To The Pumped-Storage Hydraulic Unit Scheduling Problem, Sali̇h Fadil, Celal Yaşar

Turkish Journal of Electrical Engineering and Computer Sciences

A lossy electric power system that contains thermal units and a pumped-storage hydraulic unit is considered in this paper. The total cost of thermal units in an operation cycle is minimized under some possible electric and hydraulic constraints of the units. The operation cycle is divided into time intervals where the system loads are assumed to remain constant. The proposed solution technique has two main parts. In the first part, the active thermal generations and active generation or pumping power of the pumped-storage unit in all time intervals are determined by using units' active generation incremental costs and pseudo spot …

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 …

Information And Average Information Rates Of A Graphical Access Structure On Six Vertices, Mustafa Atici

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper we study the optimal information and average information rates of secret sharing schemes which are all connected graphs on six vertices. There are $102$ connected graphs on six vertices that are not complete multipartite graphs. Of these $102$ graphs, we determined the optimal information rate of $71$ graphs, and the optimal average information rate of $88$ graphs.

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 …

Radiation From An Impedance Loaded Parallel-Plate Waveguide, Fi̇li̇z Bi̇rbi̇r, Ali̇nur Büyükaksoy

Turkish Journal of Electrical Engineering and Computer Sciences

A hybrid method consisting of employing the mode matching method in conjunction with the Fourier transform technique is used to analyze the radiation of the dominant TEM-wave from an impedance loaded parallel-plate waveguide. The hybrid method that we adopt here reduces the related boundary value problem to a scalar modified Wiener-Hopf equation of the second kind. The solution involves infinitely many unknown constants satisfying an infinite system of linear algebraic equations susceptible to a numerical treatment. Some computational results illustrating the effects of various parameters on the radiation phenomenon are also presented.

A Fuzzy Identification Method For Nonlinear Systems, İbrahi̇m Eksi̇n, Osman Kaan Erol

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, two mathematical ways of building a fuzzy model of both linear and nonlinear systems are presented and compared. In order to determine a model for a nonlinear system, the phase plane is divided into sub-regions and a linear model is assigned for each of these regions. This linear model is represented either in state-space or ARX model form. To determine the pre-selected parameters of the linear system model under study, least-square identification method is used. Then these linear models are arranged in a fuzzy manner to characterize the overall system behavior. The results show that this method …

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 …

Knowledge-Based Navigation For Autonomous Road Vehicles, Murat Eki̇nci̇, Franches W.J.Gibbs, Barry T. Thomas

Turkish Journal of Electrical Engineering and Computer Sciences

This paper presents a computer vision system for an autonomous road vehicle (ARV) that is capable of negotiating complex road networks including road junctions in real time. The ultimate aim of the system is to enable the vehicle to drive automatically along a given complex road network whose geometric description is known. This computer vision system includes three main techniques which are necessary for an ARV: a) road following, b) road junction detection, c) manoeuvring at the road junction. The road following algorithm presents a method of executing a number of algorithms using different methods concurrently, fusing their outputs together …

Decentralised H_{\Infty} Load Frequency Controller Design Based On Ssvs, Hasan Çi̇men

Turkish Journal of Electrical Engineering and Computer Sciences

The decentralised load-frequency controller design problem concerned is translated into an equivalent problem of decentralised controller design for a multi-area multi-input multi-output (MIMO) control system. It is shown that subject to a condition based on the structured singular values (SSVs), each local area load-frequency controller can be designed independently. The stability condition for the overall system can be stated as to achieve a sufficient interaction margin. It is demonstrated by computer simulation that within this general framework, local H$_{\infty}$ controllers can be designed to achieve satisfactory performances for a sample two-area power system.

Comparison Of Simulation Algorithms For The Hopfield Neural Network: An Application Of Economic Dispatch, Tankut Yalçinöz, Hali̇s Altun

Turkish Journal of Electrical Engineering and Computer Sciences

This paper is mainly concerned with an investigation of the suitability of Hopfield neural network structures in solving the power economic dispatch problem. For Hopfield neural network applications to this problem three important questions have been answered: what the size of the power system is; how efficient the computational method; and how to handle constraints. A new mapping process is formulated and a computational method for obtaining the weights and biases is described. A few simulation algorithms used to solve the dynamic equation of the Hopfield neural network are discussed. The results are compared with those of a classical technique, …

Nonlinear Self-Organization In Photorefractive Materials, Partha P. Banerjee, Nickolai Kukhtarev, John O. Dimmock

Electrical and Computer Engineering Faculty Publications

This chapter discusses self-organization and its effects in optics. One of the most exciting and potentially useful areas of current research in optics involves the understanding and exploitation of self-organization in nonlinear optical systems. This self-organization may sometimes lead to the evolution of complex spatial patterns that can be regarded as the nonlinear eigenmodes of the system. Generation of these patterns is characteristically marked by the presence of intensity thresholds. In a nonlinear system with complicated temporal dynamics, it turns out that one cannot retain purity in spatial dimensionality. It is therefore equally important to investigate the dynamics of the …

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 …

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 …

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 …

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 …

On Maintaining Group Membership Data In Ad Hoc Networks, Gruia-Catalin Roman, Qingfeng Huang, Ali Hazemi

All Computer Science and Engineering Research

The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Essential to constructing a consistent view is the ability to know what hosts are within proximity of each other, i.e., form a group in support of the particular application. In this paper we propose an algorithm that allows hosts within communication range to maintain a consistent view of the group membership despite movement and frequent disconnections. The novel features of this algorithm are its reliance on location information and a conservative notion of logical connectivity that creates …