Computer Engineering Commons^™

Assembly And Analysis Of Extended Human Genomic Contig Regions, Eric C. Rouchka, David J. States

All Computer Science and Engineering Research

The Human Genome Project (HGP) has led to the deposit of human genomic sequence in the form of sequenced clones into various databases such as the DNA Data Bank of Japan (DDBJ) (Tateno and Gojobori, 1997), the European Molecular Biology Laboratory (EMBL) Nucleotide Sequence Database (Stoesser, et. al., 1999), and GenBank (Benson, et. al., 1998). Many of these sequenced clones occur in regions where sequencing has taken place either within the same sequencing center or other centers throughout the world. The assembly of extended segments of genomic sequence by looking at overlapping end segments is desired and is currently availabel …

Anmac: A Novel Architectural Framework For Network Management And Control Using Active Networks, Samphel Norden

All Computer Science and Engineering Research

In this paper, we propose a new framework called Active Network Management and Control (ANMAC) for the management and control of high speed networks. The software architecture in ANMAC allows routers to execute dynamically loadable kernel plug-in modules which perform diagnostic functions for network management. ANMAC uses mobile probe packets to perform efficient resource reservation (using our novel reservation scheme), facilitate feedback-based congestion control, and to provide "distributed debugging" of complex anomalous network behavior. ANMAC also provides security measures against IP spoofing, and other security attacks. The network manager has the flexibility to install custom scripts in routers for tracking …

Optimal Flow Aggregation, Subhash Suri, Tuomas Sandholm, Priyank Warkhede

All Computer Science and Engineering Research

Current IP routers are stateless: they forward individual packets based on the destination address contained in the packet header, but maintain no information about the application or flow to which a packet belongs. This stateless service model works well for best effort datagram delivery, but is grossly inadequate for applications that require quality of service guarantees, such as audio, video, or IP telephony. Maintaining state for each flow is expensive because the number of concurrent flows at a router can be in the hundreds of thousands. Thus, stateful solutions such as Intserv (integrated services) have not been adopted for their …

Emediator: A Next Generation Electronic Commerce Server, Tuomas Sandholm

All Computer Science and Engineering Research

This paper presents eMediator, a next generation electronic commerce server that demonstrates some ways in which AI, algorithmic support, and game theoretic incentive engineering can jointly improve the efficiency of ecommerce. First, its configurable auction house includes a variety of generalized combinatorial auctions, price setting mechanism, novel bid types, mobile agents, and user support for choosing an auction type. Second, its leveled commitment contract optimizer determines the optimal contract price and decommitting penalties for a variety of leveled commitment contracting protocols, taking into account that rational agents will decommit insincerely in taking into account that rational agents will decommit insincerely …

A Fine-Grained Model For Code Mobility, Cecilia Mascolo, Gian Pietro Picco, Gruia-Catalin Roman

All Computer Science and Engineering Research

In this paper, we take the extreme view that every line of code is potentially mobile, i.e., may be duplicated and/or moved from one program context to another on the same host or across the network. Our motivation is to gain a better understanding of the range of constructs and issues facing the designer of a mobile code system, in a setting that is abstract and unconstrained by compilation and performance considerations traditionally associated with programming language design. Incidental to our study is an evaluatoin of the expressive power of Mobile UNITY, a notation and proof logic for mobile computing.

Pattern Matching Techniques And Their Applications To Computational Molecular Biology - A Review, Eric C. Rouchka

All Computer Science and Engineering Research

Pattern matching techniques have been useful in solving many problems associated with computer science, including data compression (Chrochemore and Lecroq, 1996), data encryption (RSA Laboratories, 1993), and computer vision (Grimson and Huttenlocher, 1990). In recent years, developments in molecular biology have led to large scale sequencing of genomic DNA. Since this data is being produced in such rapid fasion, tools to analyze DNA segments are desired. The goal here is to discuss various techniques and tools for solving various pattern matching questions in computational biology, including optimal sequence alignment, multiple sequence alignment, and buidling models to describe sequence families using …

A Rapid Development Of Dependable Applications In Ad Hoc Mobility, Amy L. Murphy

All Computer Science and Engineering Research

Advances in wireless communication and network computing technologies make possible new kinds of applications involving transient interactions among physical components that move across a wide range of spaces, from the confines of a room to the airspace across an ocean, and require no fixed networking infrastructure to communicate with one another. Such components may come together to form ad hoc networks for the purpose of exchanging information or in order to engage in cooperative task-oriented behaviors. Ad hoc networks are assembled, reshaped and taken apart as components move in and out of communication range; all interactions are transient; computations become …

Terabit Burst Switching Progress Report (12/98-6-99), Jonathan S. Turner

All Computer Science and Engineering Research

This report summarizes progress on Washington University's Terabit Burst Switching Project, supported by DARPA and Rome Air Force Laboratory. This project seeks to demonstrate the feasibility of Burst Switching, a new data communication service which can more effectively exploit the large bandwidths becoming available in WDM transmission systems, than conventional communication technologies like ATM and IP-based packet switching. Burst switching systems dynamically assign data bursts to channels in optical data links, using routing information carried in parallel control channels. The project will lead to the construction of a demonstration switch with throughput exceeding 200 Gb/s and scalable to over 10 …

Commbench - A Telecommunications Benchmark For Network Processors, Tilman Wolf, Mark Franklin

All Computer Science and Engineering Research

This paper presents a benchmark, CommBench, for use in evaluating and designing telecommunications network processors. The benchmark applications focus on small, computationally intense program kernels typical of the network processor environment. The benchmark is composed of eight programs, four of them oriented towards packet header processing and four oriented towards data stream procesing. The benchmark is defined and various characteristics of the benchmark are presented. These include instruction frequencies, computational complexity, and cache performance. These measured characteristics are compared to the SPEC benchmark which has traditionally been used in evaluating workstation processors. Three examples are presented indicating how CommBench can …

Enterprise Business Objects : Design And Implementation Of A Business Object Framework, Kai-Uwe Schafer

Theses

Software components representing business entities like customer or purchase order introduce a new way of Online Transaction Processing to business applications. Collaborating business objects allow to complete whole business processes as a single distributed transaction, instead of dividing it into queued steps, which sometimes even require user intervention. This IS due to the fact that business objects contain both business data and logic and that they incorporate multiple databases from different vendors and different geographic locations in a single transaction.

Business objects cannot be used as stand-alone components, but require a framework of services that manage persistence, concurrent transactions, and …

Search For Charged Higgs Bosons In E+E- Collisions At √S = 181-184 Gev, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

(Ω, Ξ)-Logic: On The Algebraic Extension Of Coalgebraic Specifications, Rolf Hennicker, Alexander Kurz

Engineering Faculty Articles and Research

We present an extension of standard coalgebraic specification techniques for statebased systems which allows us to integrate constants and n-ary operations in a smooth way and, moreover, leads to a simplification of the coalgebraic structure of the models of a specification. The framework of (Ω,Ξ)-logic can be considered as the result of a translation of concepts of observational logic (cf. [9]) into the coalgebraic world. As a particular outcome we obtain the notion of an (Ω, Ξ)- structure and a sound and complete proof system for (first-order) observational properties of specifications.

Developing Database Applications By Using Software Components, Nusret Conk

College of Graduate Studies: Theses & Dissertations (1964–2006)

Today, the software application development process is more assembly work than a "build from scratch" approach. By placing pre-existing software components together, it is possible to create a complete application. Such components provide interfaces so that programs use them for their intended purposes. The objective of this thesis is to illustrate how software components work together to make a complete application. To illustrate the ideas and the components, this project presents a three-tiered web database application. This application, as a whole, is made up of the client side web browser, a database and the actual application programs which are Java …

An Algorithm For Optimal Winner Determination In Combinatorial Auctions, Tuomas Sandholm

All Computer Science and Engineering Research

Combinatorial auctions, i.e. auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auctions in multi-item auctions where the agents' valuations of the items are not additive. However, determining the winners so as to maximize revenue is NP-complete. First, existing approaches for tackling this problem are reviewed: exhaustive enumeration, dynamic programming, approximation algorithms, and restricting the alloable combinations. Then we present our search algorithm for optimal winner determination. Experiments are shown on several bid distributions. The algorithm allows combinatorial auctions to scale up to significantly larger numbers of items and bids than …

Auctions Without Common Knowledge, Sviatoslav B. Brainov, Tuomas W. Sandholm

All Computer Science and Engineering Research

This paper proves that the revenue equivalence theorem ceases to hold for auctions without common knowledge about the agents' prior beliefs. That is, different auction forms yield different expected revenue. To prove this, an auction game is converted to a Bayesian decision problem with an infinite hierarchy of beliefs. A general solution for such Bayesian decision problems is proposed. The solution is a generalization of the standard Bayesian solution and coincides with it for finite belief trees and for trees representing common knowledge. It is shown how the solution generalizes the frequently used technique of backward induction for infinite belief …

Design Issues For High Performance Active Routers, Tilman Wolf, Jonathan Turner

All Computer Science and Engineering Research

Active networking is a general approach to incorporating general-purpose computational capabilities within the communications infrastructure of data networks. This paper proposes a design of a scalable, high performance active router. This is used as a vehicle for studying the key design issues that must be resolved to allow active networking to become a mainstream technology.

Algorithms For Optimizing Leveled Commitment Contracts, Thomas Sandholm, Sandeep Sikka, Samphel Norden

All Computer Science and Engineering Research

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts - i.e. contracts where each party can decommit by paying a predetermined penalty - were recently shown to improve Pareto efficiency even if agents rationally decommit in Nash equilibrium using inflated thresholds on how good their outside offers must be before they decommit. This paper operationalizes the four leveled commitment contracting protocols by presenting algorithms for using them. Algorithms are presented for computing the Nash equilibrium decomitting thresholds and decommitting probabilities given the contract price and the penalties. Existence and uniqueness of the equilibrium …

Tracking Mobile Units For Dependable Message Delivery, Amy L. Murphy, Gruia-Catalin Roman, George Varghese

All Computer Science and Engineering Research

As computing components get smaller and people become accustomed to having computational power at their disposal at any time, mobile computing is developing as an important research area. One of the fundamental problems in mobility is maintaining connectivity through message passing as the user moves through the network. An approach to this is to have a single home node constantly track the current location of the mobile unit and forward messages to this location. One problem with this approach is that during the update to the home agent after movement, messages are often dropped, especially in the case of frequent …

Floor Control Protocol For Alx Video Conference Application, Ruibiao Qiu

All Computer Science and Engineering Research

With wide deployment of high-speed networks such as vBNS today, video-conference applications over WANs have become increasingly feasible. MMX has proven to be a good desktop video-conference devide for local ATM networks. Now, ALX has been designed to extend MMX's video conferencing capability to IP-over-ATM WANs such as vBNS. In this report, we discuss a floor control protocol for ALX video-conference applications. We first show how an "ideal" protocol should behave to meet our requirements. Then we compare three protocols based on distributed algorithms, and a protocol based on a centralized algorithm. Based on the comparison and performance analysis, we …

Software Engineering For Mobility: A Roadmap, Gruia-Catalin Roman, Gian Pietro Picco, Amy L. Murphy

All Computer Science and Engineering Research

The term distributed computing conjures the image of a fixed network structure whose nodes support the execution of processes that communicate with each other via messages traveling along links. Peer-to-peer communication is feasible but client-server relationships dominate. More recently, servers have been augmented with brokerage capabilities to facilitate discovery of available services. Stability is the ideal mode of operation; changes are relatively slow; even in the case of failure, nodes and links are expected eventually to come back up. By contrast, mobility represents a total meltdown of all the stability assumptions (explicit or implicit) associated with distributed computing. The network …

Bargaining With Deadlines, Tuomas Sandholm, Nir Vulkan

All Computer Science and Engineering Research

This paper analyzes automated distributive negotiation where agents have firm deadlines that are private information. The agents are allowed to make and accept offers in any order in continuous time. We show that the only sequential equilibrum outcome is the one where the agents wait until the first deadline, at which point that agent concedes everything to the other. This holds for pure and mixed strategies. So, interestingly, rational agents can never agree to a nontrivial split because offers signal enough weakness of bargaining power (early deadline) so that the recipient should never accept. Similarly, the offerer knows that it …

On The Global Stabilization Of Nonlinear Systems Via Switching Manifolds, Stephen P. Banks, Meti̇n U. Salamci, M. Kemal Özgören

Turkish Journal of Electrical Engineering and Computer Sciences

The global stabilization of nonlinear systems is investigated by using switching surfaces. The nonlinear system is forced to a lower order switching manifold, which is designed to be stable by construction. Thus, the stability of the reduced-order system is guaranteed and parameter selection for the switching surface is avoided. The method is extended to a class of uncertain nonlinear systems and exemplified with some fictitious dynamic models.

A Simple Formula Obtained Using Tabu Search Algorithm For The Radiation Efficiency Of A Resonant Rectangular Microstrip Antenna, Dervi̇ş Karaboğa, Keri̇m Güney

Turkish Journal of Electrical Engineering and Computer Sciences

A new simple formula for the radiation efficiency of a resonant rectangular microstrip patch antenna is presented. The formula is obtained by using a tabu search algorithm, which is a quite new optimization technique based on the principles of intelligent problem solving. The formula is valid for substrates with relative permittivities between 1 and 12.8 and for the complete range of thicknesses normally used. The results obtained by using this new simple formula are in conformity with those reported elsewhere. The formula can also be used in the calculation of the radiation efficiency of dipoles.

Exclusive Disjunctions In Indefinite And Maybe Information In Relational Databases, Taflan İ. Gündem

Turkish Journal of Electrical Engineering and Computer Sciences

Incorporating indefinite information into databases has been studied extensively. In this paper, we propose a structure called an E-table to represent maybe information and inclusive and exclusive disjunctions. We define the type of redundancies in E-tables and show how to eliminate them. Also we present an extended relational algebra to operate on E-tables. In this paper we expand the concepts and operations defined by Lin and Sunderraman [1] in order to accommodate exclusive disjunctions in relational databases.

Smart Objects, Dumb Archives: A User-Centric, Layered Digital Library Framework, Kurt Maly, Michael L. Nelson, Mohammad Zubair

Computer Science Faculty Publications

Discusses digital libraries, interoperability, and interfaces to access them, and proposes one universal protocol for communication for simple archives based on the hypertext transfer protocol (http). Describes the creation of a special class of digital objects called buckets, archives based on a NASA collection, and a set of digital library services. (Author/LRW)

Compute As Fast As The Engineers Can Think! Utrafast Computing Team Final Report, Robert T. Biedron, P. Mehrotra, Michael L. Nelson, M. L. Preston, J. J. Rehder, J. L. Rogersm, D. H. Rudy, J. Sobieski, O. O. Storaasli

Computer Science Faculty Publications

This report documents findings and recommendations by the Ultrafast Computing Team (UCT). In the period 10-12/98, UCT reviewed design case scenarios for a supersonic transport and a reusable launch vehicle to derive computing requirements necessary for support of a design process with efficiency so radically improved that human thought rather than the computer paces the process. Assessment of the present computing capability against the above requirements indicated a need for further improvement in computing speed by several orders of magnitude to reduce time to solution from tens of hours to seconds in major applications. Evaluation of the trends in computer …

A Digital Library For The National Advisory Committee For Aeronautics, Michael L. Nelson

Computer Science Faculty Publications

We describe the digital library (DL) for the National Advisory Committee for Aeronautics (NACA), the NACA Technical Report Server (NACATRS). The predecessor organization for the National Aeronautics and Space Administration (NASA), NACA existed from 1915 until 1958. The primary manifestation of NACA's research was the NACA report series. We describe the process of converting this collection of reports to digital format and making it available on the World Wide Web (WWW) and is a node in the NASA Technical Report Server (NTRS). We describe the current state of the project, the resulting DL technology developed from the project, and the …

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

Searches For The Neutral Higgs Bosons Of The Mssm In E+E- Collisions At Centre-Of-Mass Energies Of 181-184 Gev, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

The data collected by ALEPH at LEP at centre-of-mass energies ranging from 181 to 184 GeV, corresponding to an integrated luminosity of 57 pb−1, are analysed to search for pair-produced neutral Higgs bosons h and A, in the bb̄bb̄ and τ+τ−bb̄ final states. Two events are found in the data with 2.5 expected from standard model processes. When combined with the lower energy data collected by ALEPH and with earlier reported searches for associated hZ production, these analyses are interpreted in the context of the minimal supersymmetric extension of the standard model (MSSM). For standard choices of MSSM parameter sets, …

Variability Analysis Of Discrete Cosine Transform Coefficient (Dctc) Features For Speech Processing, Bingjun Dai

Electrical & Computer Engineering Theses & Dissertations

In this research, the variability of Discrete Cosine Transform Coefficient (DCTC) features was investigated. Additionally, a new pitch-synchronous processing method was explored to increase the stability of features and to reduce window effects when compared to the regular method. The noise sources that lead to feature variability were analyzed, and different smoothing methods were tested. It was found that longer frames, frequency warping, time smoothing of the log spectrum, and DCS level time smoothing, all help reduce DCTC variability and increase classification performance. The pitch­ synchronous method was implemented with Matlab. Important processing methods, including pitch period estimation, time­ domain …