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

Computer Sciences Commons™

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

1999

Discipline
Institution
Keyword
Publication
Publication Type

Articles 331 - 360 of 427

Full-Text Articles in Computer Sciences

Revenue Equivalence Of Leveled Commitment Contracts, Tuomas Sandholm, Yunhong Zhou Jan 1999

Revenue Equivalence Of Leveled Commitment Contracts, Tuomas Sandholm, Yunhong Zhou

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 expected social welfare even if agents decommit insincerely in Nash equilibrium. Such contracts differ based on whether agents have to declare their decommitting decisions sequentially or simultaneously, and whether or not agents have to pay the penalties if both decommit. For a given contract, these protocols lead to different decommitting thresholds and probabilities. However, this paper shows that, surprisingly, each protocol leads to the same …

Go to article

The Design And Performance Of A Pluggable Protocols Framework For Object Request Broker Middleware, Fred Kuhns, Carlos O'Ryan, Douglas C. Schmidt, Jeff Parsons Jan 1999

The Design And Performance Of A Pluggable Protocols Framework For Object Request Broker Middleware, Fred Kuhns, Carlos O'Ryan, Douglas C. Schmidt, Jeff Parsons

All Computer Science and Engineering Research

To be an effective platform for performance-sensitive real-time and embedded applications, off-the-shelf OO middleware like CORBA, DCOM, and Java RMI must preserve communication-layer quality of service (QoS) properties to applications end-to-end. However, conventional OO middleware interoperability protocols, such as CORBA's GIOP/IIOP or DCOM's MS-RPC, are not well suited for applications that cannot tolerate the message footprint size, latency, and jitter associated with general-purpose messaging and transport protocols. It is essential, therefore, to develop standard plugable protocols frameworks that allow custom messaging and transport protocols to be configured flexibly and used transparently by applications. This paper provides three contributions to research …

Go to article

Constructing Speculative Demand Functions In Equilibrium Markets, Tuomas Sandholm, Fredrik Ygge Jan 1999

Constructing Speculative Demand Functions In Equilibrium Markets, Tuomas Sandholm, Fredrik Ygge

All Computer Science and Engineering Research

In computational markets utilizing algorithms that establish a general equilibrium, competitive behavior is usually assumed: each agent makes its demand (supply) decisions so as to maximize its utility (profit) assuming that it has no impact on market prices. However, there is a potential gain from strategic behavior via speculating about others because an agent does affect the market prices, which affect the supply/demand decisions of others, which again affect the market prices that the agent faces. Determining the optimal strategy when the speculator has perfect knowledge about the other agents is a well known problem which has been studied in …

Go to article

Reliable Communication For Highly Mobile Agents, Amy L. Murphy, Gian Pietro Picco Jan 1999

Reliable Communication For Highly Mobile Agents, Amy L. Murphy, Gian Pietro Picco

All Computer Science and Engineering Research

The provision of a reliable communication infrastructure for mobile agents is still an open research issue. The challenge to reliability we address in this work does not come from the possibility of faults, but rather from the mere presence of mobility, which slightly complicates the problem of ensuring the delivery of information even in a fault-free network. For instance, the asynchronous nature of message passing and agent migration may cause situations where messages forever chase a mobile agent that moves frequently from one host to another. Current solutions rely on conventional technologies that either do not provide a solution for …

Go to article

A Proposal For A High-Performance Active Hardware Architecture, Tilman Wolf Jan 1999

A Proposal For A High-Performance Active Hardware Architecture, Tilman Wolf

All Computer Science and Engineering Research

Current research in Active Networking is focused on developing software architectures and defining funtionality of Execution Environments. While active network systems show superior functionality compared to traditional networks, they only operate at substantially lower link speeds. To increase the acceptance of Active Network in environments where link speeds of several Gb/s are common, we propose a hardware architecture that performs high-speed packet handling while providing the same flexibility as a common software system. The design exploits the independence between data streams for parallel processing. To measure the impact of different design decisions on the performance of the system, we also …

Go to article

Multiway Range Trees: Scalable Ip Lookup With Fast Updates, Subhash Suri, George Varghese, Piryank Ramesh Warkhede Jan 1999

Multiway Range Trees: Scalable Ip Lookup With Fast Updates, Subhash Suri, George Varghese, Piryank Ramesh Warkhede

All Computer Science and Engineering Research

Internet routers forward packets based on the destination address of a packet. A packet's address is matched against the destination prefixes stored in the router's forwarding table, and the packet is sent to the output interface determined by the longest matching prefix. While some existing schemes work well for IPv4 addresses, we believe that none of the current schemes scales well to IPv6, especially when fast updates are required. As the Internet evolves into a global communication medium, requiring multiple addresses per user, the switch to longer addresses (e.g. IPv6) seems inevitable despite temporary measures such as network addres translation …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

Emediator: A Next Generation Electronic Commerce Server, Tuomas Sandholm Jan 1999

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 …

Go to article

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

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.

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

Mpijava: An Object-Oriented Java Interface To Mpi, Mark Baker, Bryan Carpenter, Geoffrey C. Fox, Sung Hoon Ko Jan 1999

Mpijava: An Object-Oriented Java Interface To Mpi, Mark Baker, Bryan Carpenter, Geoffrey C. Fox, Sung Hoon Ko

Northeast Parallel Architecture Center

A basic prerequisite for parallel programming is a good communication API. The recent interest in using Java for scientific and engineering application has led to several international efforts to produce a message passing interface to support parallel computation. In this paper we describe and then discuss the syntax, functionality and performance of one such interface, mpiJava, an object-oriented Java interface to MPI. We first discuss the design of the mpiJava API and the issues associated with its development. We then move on to briefly outline the steps necessary to 'port' mpiJava onto a range of operating systems, including Windows NT, …

Go to article

Building Distributed Systems For The Pragmatic Object Web, Geoffrey C. Fox, Wojtek Furmanski, Tomasz Haupt Jan 1999

Building Distributed Systems For The Pragmatic Object Web, Geoffrey C. Fox, Wojtek Furmanski, Tomasz Haupt

Northeast Parallel Architecture Center

We review the growing power and capability of commodity computing and communication technologies largely driven by commercial distributed information systems. These systems are built from CORBA, Microsoft's COM, JavaBeans, and rapidly advancing Web approaches. One can abstract these to a three-tier model with largely independent clients connected to a distributed network of servers. The latter host various services including object and relational databases and of course parallel and sequential computing. High performance can be obtained by combining concurrency at the middle server tier with optimized parallel back end services. The resultant system combines the needed performance for large-scale HPCC applications …

Go to article

Mpijava 1.2: Api Specification, Bryan Carpenter, Geoffrey C. Fox, Sung-Hoon Ko, Sang Lim Jan 1999

Mpijava 1.2: Api Specification, Bryan Carpenter, Geoffrey C. Fox, Sung-Hoon Ko, Sang Lim

Northeast Parallel Architecture Center

This document defines the API of mpiJava, a Java language binding for MPI 1.1. The document is not a standalone specification of the behaviour of MPI--it is meant to be read in conjunction with the MPI standard document [2]. Subsections are laid out in the same way as in the standard document, to allow cross-referencing. Where the mpiJava binding makes no significant change to a particular section of the standard document, we will just note here that there are no special issues for the Java binding. This does not mean that the corresponding section of the standard is irrelevant to …

Go to article

Using Webhla To Integrate Hpc Fms Modules With Web/Commodity Based Distributed Object Technologies Of Corba, Java, Com And Xml, Geoffrey C. Fox, Wojtek Furmanski, Ganesh Krishnamurthy, Hasan T. Ozdemir, Zeynep Odcikin-Ozdemir, Tom A. Pulikal, Krishnan Rangarajan, Ankur Sood Jan 1999

Using Webhla To Integrate Hpc Fms Modules With Web/Commodity Based Distributed Object Technologies Of Corba, Java, Com And Xml, Geoffrey C. Fox, Wojtek Furmanski, Ganesh Krishnamurthy, Hasan T. Ozdemir, Zeynep Odcikin-Ozdemir, Tom A. Pulikal, Krishnan Rangarajan, Ankur Sood

Northeast Parallel Architecture Center

HLA standards for interoperability between various DoD Modeling and Simulation paradigms are being enforced in parallel with the rapid onset of new Object Web / Commodity standards for distributed objects and componentware, emergent at the crossroads of CORBA, COM, Java, and XML technologies. WebHLA explores synergies between and integrates both trends by offering Object Web based implementation of the HLA framework. Our goal is to deliver a uniform platform that facilitates conversion of legacy codes to and development of new codes in compliance with HLA, HPC and Object Web standards. We outline here the overall design of WebHLA, we summarize …

Go to article

Internetics: Technologies, Applications And Academic Field, Or, Parallel Computing And Computational Science Do Not Quite Work, Geoffrey C. Fox Jan 1999

Internetics: Technologies, Applications And Academic Field, Or, Parallel Computing And Computational Science Do Not Quite Work, Geoffrey C. Fox

Northeast Parallel Architecture Center

Ten years ago, we were all sure that parallel computing technology and the interdisciplinary academic field of computational science would be center pieces of both academic and economic growth. We show that this insight was, in principle, correct but was an incomplete vision for large-scale computation implies both increased computer power and increasing numbers of users and applications. Parallel computing undoubtedly works on essentially all problems, but we were unable to produce deployable software systems. Further, few industries could achieve adequate return to justify investment in parallel computers, except in a few areas such as databases. Computational science is the …

Go to article

A Hierarchical Analysis Approach For High Performance Computing And Communication Applications, Salim Hariri, Pramod Varshney, Luying Zhou, Vinod V. Menon, Shihab Ghaya Jan 1999

A Hierarchical Analysis Approach For High Performance Computing And Communication Applications, Salim Hariri, Pramod Varshney, Luying Zhou, Vinod V. Menon, Shihab Ghaya

Electrical Engineering and Computer Science - All Scholarship

The proliferation of high performance computers and high-speed networks has made parallel and distributed computing feasible and cost-effective on High Performance Computing and Communication Systems (HPCC). However, the design, analysis and development of parallel and distributed applications on such computing systems are still very challenging tasks. Therefore, there is a great need for an integrated multilevel analysis methodology to assist in designing and analyzing the performance of both existing and proposed systems. Currently, there are no comprehensive analysis methods that address such diverse needs. This paper presents a three-level hierarchical modeling approach for analyzing the end-to-end performance of an application …

Go to article

Infoharness: Managing Distributed, Heterogeneous Information, Kshitij Shah, Amit P. Sheth Jan 1999

Infoharness: Managing Distributed, Heterogeneous Information, Kshitij Shah, Amit P. Sheth

Kno.e.sis Publications

Today, important information is scattered in so many places, formats, and media, that getting the right information at the right time and place is an extremely difficult task. Developing a single software product, for example, includes the creation of documents ranging from the requirements specification and project schedules to marketing presentations, multimedia tutorials, and more. Each document may be created by a different person using a different tool, and each may be stored in a different place. InfoHarness is an information integration system, platform, and tool set that addresses these problems, managing huge amounts of heterogeneous information in a distributed …

Go to article

Processes Driving The Networked Economy, Amit P. Sheth, Will Van Der Aalst, I. Budak Arpinar Jan 1999

Processes Driving The Networked Economy, Amit P. Sheth, Will Van Der Aalst, I. Budak Arpinar

Kno.e.sis Publications

The authors propose that an organic workflow-process technology will power the evolution of information system architectures. The authors outline three likely stages of architectural evolution in the context of a networked economy and discuss critical gaps in the current technology with respect to their envisioned future.

Go to article

Object Oriented Enterprise Modeling And Distributed Cognition At A New University: Csu Monterey Bay, Armando A. Arias Jr., Beryl L. Bellman Jan 1999

Object Oriented Enterprise Modeling And Distributed Cognition At A New University: Csu Monterey Bay, Armando A. Arias Jr., Beryl L. Bellman

SSGS Faculty Publications and Presentations

No abstract provided.

Go to article

Using Omissive Faults To Obtain Local Convergence In Partially Connected Networks, M. H. Azadmanesh, A. W. Krings Jan 1999

Using Omissive Faults To Obtain Local Convergence In Partially Connected Networks, M. H. Azadmanesh, A. W. Krings

Computer Science Faculty Publications

Approximate Agreement is an important issue in faulttolerant distributed computing where non-faulty processes exchange and vote upon their local values, to arrive at values which are within the range of the initial values of the nonfaulty processes and within a predefined tolerance of each other. Results to date in Approximate Agreement, however, are not capable of exploiting omission faults. Omission faults are presumed not to occur or a predefined default value is substituted for those values not received, or they are globally discarded before the voting algorithm executes. As a result, hybrid fault models can not differentiate between omissive and …

Go to article

The Nature And Structure Of Impediments To Edi Adoption And Integration: A Survey Of Small- And Medium-Sized Enterprises, Deepak Khazanchi Jan 1999

The Nature And Structure Of Impediments To Edi Adoption And Integration: A Survey Of Small- And Medium-Sized Enterprises, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

Electronic data interchange (EDI) is a key enabling component of business-to-business electronic commerce. As firms adopt and integrate advanced information technologies such as EDI, it is important to understand the nature of challenges faced by them. This becomes especially important given the fact that nearly 99.7% of all businesses in the US can be classified as small- to medium-sized enterprises (SMEs). As costs and risks associated with implementing new information technologies decrease, these firms will surely need to focus their attention on managing impediments associated with new technology implementation and learn from the failures or successes of their peer. Consequently, …

Go to article

Distributed Artificial Intelligence In A Virtual Reality Setting: A Case Study, Rebecca Lohr Jan 1999

Distributed Artificial Intelligence In A Virtual Reality Setting: A Case Study, Rebecca Lohr

Presidential Scholars Theses (1990 – 2006)

Artificial intelligence, or Al, is a fascinating area of research. Al refers to the attempt to create a computer program, known as an intelligent agent, which can "think" and operate in a complex, changing environment. Many problems have been discovered in attempting to develop these intelligent agents, including the simulation of learning, planning, and natural language understanding. While researching these issues, a new branch of Al research has developed. Researchers discovered that there are other problems associated with how intelligent agents work together to solve problems. This field of research has become known as distributed artificial intelligence, or DAI.

Go to article

Integrating Multimedia Techniques Into Cs Pedagogy, Sandra Honda, Richard Jou, Ahmad Nasri, Anne-Louise Radimsky, Bon K. Sy Jan 1999

Integrating Multimedia Techniques Into Cs Pedagogy, Sandra Honda, Richard Jou, Ahmad Nasri, Anne-Louise Radimsky, Bon K. Sy

School of Computer Science & Engineering Faculty Publications

Through its grants, the National Science Foundation sponsors workshops that inform faculty of current topics in Computer Science. Such a workshop, entitled, "Developing Multimedia-based Interactive Laboratory Modules for Computer Science", was given July 27 -August 6, 1998, at Illinois State University in Normal, Illinois. Each participant was expected to design and implement a small part of a laboratory module. This paper describes what some of the faculty members who participated in the workshop have done with the knowledge obtained from the workshop.

Go to article

Locked And Unlocked Polygonal Chains In 3d, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried Toussaint, Sue Whitesides Jan 1999

Locked And Unlocked Polygonal Chains In 3d, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark Overmars, Steve Robbins, Ileana Streinu, Godfried Toussaint, Sue Whitesides

Computer Science: Faculty Publications

In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of segments in such a manner that both the length of each link and the simplicity of the chain are maintained throughout the movement. The analogous concept for closed chains is convexification: reconfiguration to a planar convex polygon. Chains that cannot be straightened or convexified are called locked. While there are open chains in 3D that are locked, we show that if an open chain has a …

Go to article

Codes, Correlations And Power Control In Ofdm, James A. Davis, Jonathan Jedwab, Kenneth G. Paterson Jan 1999

Codes, Correlations And Power Control In Ofdm, James A. Davis, Jonathan Jedwab, Kenneth G. Paterson

Department of Math & Statistics Faculty Publications

Practical communications engineering is continually producing problems of interest to the coding theory community. A recent example is the power-control problem in Orthogonal Frequency Division Multiplexing (OFDM). We report recent work which gives a mathematical framework for generating solutions to this notorious problem that are suited to low-cost wireless applications. The key result is a connection between Golay complementary sequences and Reed-Muller codes. The former are almost ideal for OFDM transmissions because they have a very low peak-to-mean envelope power ratio (PMEPR), while the latter have efficient encoding and decoding algorithms and good error correction capability. This result is then …

Go to article

First Prev Next Last