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

Computer Engineering Commons™

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

Physical Sciences and Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 12991 - 13020 of 13560

Full-Text Articles in Computer Engineering

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

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 …

Go to article

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

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 …

Go to article

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

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.

Go to article

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

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

(Ω, Ξ)-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.

Go to article

Developing Database Applications By Using Software Components, Nusret Conk Jan 1999

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 …

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

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

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.

Go to article

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 Dec 1998

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.

Go to article

Self-Enhancement Of Dynamic Gratings In Photogalvanic Crystals, Nickolai Kukhtarev, Sergei F. Lyuksyutov, Preben Buchhave, Tatiana Kukhtareva, K. Sayano, Partha P. Banerjee Nov 1998

Self-Enhancement Of Dynamic Gratings In Photogalvanic Crystals, Nickolai Kukhtarev, Sergei F. Lyuksyutov, Preben Buchhave, Tatiana Kukhtareva, K. Sayano, Partha P. Banerjee

Electrical and Computer Engineering Faculty Publications

We have developed a compact closed-form solution of the band transport model for high-contrast gratings in photogalvanic crystals. Our solution predicts the effect of the photoconductivity and the electric field grating enhancement due to the photogalvanic effect. We predict a pronounced dependence of the steady-state photogalvanic current on the contrast of the interference pattern and an increase of holographic storage time due to the enhancement of the photoconductivity grating contrast. In the high contrast limit and a large photogalvanic effect the refractive index grating will be shifted from the position of the intensity modulation pattern, contrary to the usually adopted …

Go to article

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 Nov 1998

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, …

Go to article

Robust Course-Boundary Extraction Algorithms For Autonomous Vehicles, Chris Roman, Charles Reinholtz Nov 1998

Robust Course-Boundary Extraction Algorithms For Autonomous Vehicles, Chris Roman, Charles Reinholtz

Graduate School of Oceanography Faculty Publications

Practical autonomous robotic vehicles require dependable methods for accurately identifying course or roadway boundaries. The authors have developed a method to reliably extract the boundary line using simple dynamic thresholding, noise filtering, and blob removal. This article describes their efforts to apply this procedure in developing an autonomous vehicle.

Go to article

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

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 …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 14, Number 8, October 1998, College Of Engineering And Computer Science, Wright State University Oct 1998

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

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 14, Number 7, September 1998, College Of Engineering And Computer Science, Wright State University Sep 1998

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

Go to article

A Feedback-Driven Proportion Allocator For Real-Rate Scheduling, David Steere, Ashvin Goel, Joshua Gruenberg, Dylan Mcnamee, Calton Pu, Jonathan Walpole Sep 1998

A Feedback-Driven Proportion Allocator For Real-Rate Scheduling, David Steere, Ashvin Goel, Joshua Gruenberg, Dylan Mcnamee, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

In this paper we propose changing the decades-old practice of allocating CPU to threads based on priority to a scheme based on proportion and period. Our scheme allocates to each thread a percentage of CPU cycles over a period of time, and uses a feedback-based adaptive scheduler to assign automatically both proportion and period. Applications with known requirements, such as isochronous software devices, can bypass the adaptive scheduler by specifying their desired proportion and/or period. As a result, our scheme provides reservations to applications that need them, and the benefits of proportion and period to those that do not. Adaptive …

Go to article

Synthetic Files: Enabling Low-Latency File I/O For Qos-Adaptive Applications, Dylan Mcnamee, Dan Revel, Calton Pu, David Steere, Jonathan Walpole Aug 1998

Synthetic Files: Enabling Low-Latency File I/O For Qos-Adaptive Applications, Dylan Mcnamee, Dan Revel, Calton Pu, David Steere, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Files are a tried and true operating system abstraction. They present a simple byte-stream model of I/O that has proven intuitive for application programmers and efficient for operating system builders. However, current file systems do not provide good support for adaptive continuous media (CM) applications - an increasingly important class of applications that exhibit complex access patterns and are particularly sensitive to variations in I/O performance. To address these problems we propose synthetic files. Synthetic files are specialized views of underlying regular files, and convert complex file access patterns into simple sequential synthetic file access patterns. Synthetic file construction can …

Go to article

Architectural Optimization Of Digital Libraries, Aileen O. Biser Aug 1998

Architectural Optimization Of Digital Libraries, Aileen O. Biser

Computer Science Theses & Dissertations

This work investigates performance and scaling issues relevant to large scale distributed digital libraries. Presently, performance and scaling studies focus on specific implementations of production or prototype digital libraries. Although useful information is gained to aid these designers and other researchers with insights to performance and scaling issues, the broader issues relevant to very large scale distributed libraries are not addressed. Specifically, no current studies look at the extreme or worst case possibilities in digital library implementations. A survey of digital library research issues is presented. Scaling and performance issues are mentioned frequently in the digital library literature but are …

Go to article

Scalar Quark Searches In E+E- Collisions At √S = 181 - 184 Gev, Barate, R.; Et Al., M. Thulasidas Aug 1998

Scalar Quark Searches In E+E- Collisions At √S = 181 - 184 Gev, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

Searches for scalar top, scalar bottom and degenerate scalar quarks have been performed with data collected with the ALEPH detector at LEP. The data sample consists of 57 pb−1 taken at s = 181–184 GeV. No evidence for scalar top, scalar bottom or degenerate scalar quarks was found in the channels t̃→cχ, t̃→bℓν̃, b̃→bχ, and q̃→qχ. From the channel t̃→cχ a limit of 74 GeV/c2has been set on the scalar top quark mass, independent of the mixing angle. This limit assumes a mass difference between the t̃ and the χ in the range 10–40 GeV/c2. From the channel t̃→bℓν̃ the …

Go to article

Quality Of Service Semantics For Multimedia Database Systems, Jonathan Walpole, Charles Krasic, Ling Liu, David Maier, Calton Pu, Dylan Mcnamee, David Steere Jul 1998

Quality Of Service Semantics For Multimedia Database Systems, Jonathan Walpole, Charles Krasic, Ling Liu, David Maier, Calton Pu, Dylan Mcnamee, David Steere

Computer Science Faculty Publications and Presentations

Quality of service (QoS) support has been a hot research topic in multimedia databases, and multimedia systems in general, for the past several years. However, there remains little consensus on how QoS support should be provided. At the resource-management level, systems designers are still debating the suitability of reservation- based versus adaptive QoS management. The design of higher system layers is less clearly understood, and the specification of QoS requirements in domain-specific terms is still an open research topic. To address these issues, we propose a QoS model for multimedia databases. The model covers the specification of user-level QoS preferences …

Go to article

The Cluster Multipole Algorithm For Far-Field Computations, Rakesh R. Patel Jul 1998

The Cluster Multipole Algorithm For Far-Field Computations, Rakesh R. Patel

Electrical & Computer Engineering Theses & Dissertations

Computer simulations of N-body systems are beneficial to study the overall behavior of a number of physical systems in fields such as astrophysics, molecular dynamics, and computational fluid dynamics. A new approach for computer simulations of N-body systems is proposed in this research. The new algorithm is called the Cluster Multipole Algorithm (CMA). The goals of the new algorithm are to improve the applicability to non-point sources and to provide more control on the accuracy over current algorithms. The algorithm is targeted to applications that do not require rebuilding the data structure about the system every time step due to …

Go to article

First Prev Next Last