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

Computer Engineering Commons™

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

1999

Discipline
Institution
Keyword
Publication
Publication Type

Articles 121 - 132 of 132

Full-Text Articles in Computer Engineering

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

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 …

Go to article

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

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 …

Go to article

Floor Control Protocol For Alx Video Conference Application, Ruibiao Qiu Jan 1999

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 …

Go to article

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

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 …

Go to article

Bargaining With Deadlines, Tuomas Sandholm, Nir Vulkan Jan 1999

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 …

Go to article

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

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.

Go to article

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 Jan 1999

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.

Go to article

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

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.

Go to article

Reduction Of Quantum Noise In Transmittance Estimation Using Photonecorrelated Beams, Majeed M. Hayat, Adel Joobeur, Bahaa E.A. Saleh Jan 1999

Reduction Of Quantum Noise In Transmittance Estimation Using Photonecorrelated Beams, Majeed M. Hayat, Adel Joobeur, Bahaa E.A. Saleh

Electrical and Computer Engineering Faculty Research and Publications

The accuracy of optical measurements at low light levels is limited by the quantum noise of the source and by the random nature of the interaction with the measured object. The source noise may be reduced by use of nonclassical photon-number squeezed light. This paper considers the use of two photon-correlated beams (generated, for example, by spontaneous parametric downconversion) to measure the optical transmittance of an object. The photons of each beam obey a random Poisson process, but are synchronized in time. One beam is used to probe the object while the other is used as a reference providing information …

Go to article

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

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)

Go to article

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 Jan 1999

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 …

Go to article

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

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 …

Go to article

First Prev