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

Digital Commons Network™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 16651 - 16680 of 17472

Full-Text Articles in Entire DC Network

Why Fundamental Physical Equations Are Of Second Order?, Takeshi Yamakawa, Vladik Kreinovich Jan 1999

Why Fundamental Physical Equations Are Of Second Order?, Takeshi Yamakawa, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we use a deep mathematical result (namely, a minor modification of Kolmogorov's solution to Hilbert's 13th problem) to explain why fundamental physical equations are of second order. This same result explain why all these fundamental equations naturally lead to non-smooth solutions like singularity.

Go to article

Derivation Of Equations Of Motion For A Four Link Robotic Leg For A Walking Vehicle, Andrew B. Wright Jan 1999

Derivation Of Equations Of Motion For A Four Link Robotic Leg For A Walking Vehicle, Andrew B. Wright

Journal of the Arkansas Academy of Science

A four degree of freedom leg for a walking robot has been modeled using Newton's method. Unlike robot manipulators, which have a fixed base, a leg model must include inertial forces due to base motion. These forces have been included in the formulation. These equations can be used for design, simulation, and control. The inverse kinematics for this leg are also presented. This allows the joint angles to be computed from a desired foot-hold position.

Go to article

Fuzzy Systems Are Universal Approximators For A Smooth Function And Its Derivatives, Vladik Kreinovich, Hung T. Nguyen, Yeung Yam Jan 1999

Fuzzy Systems Are Universal Approximators For A Smooth Function And Its Derivatives, Vladik Kreinovich, Hung T. Nguyen, Yeung Yam

Departmental Technical Reports (CS)

One of the reasons why fuzzy methodology is successful is that fuzzy systems are universal approximators, i.e., that we can approximate an arbitrary continuous function within any given accuracy by a fuzzy system. In some practical applications (e.g., in control), it is desirable to approximate not only the original function, but also its derivatives (so that, e.g., a fuzzy control approximating a smooth control will also be smooth). In our paper, we show that for any given accuracy, we can approximate an arbitrary smooth function by a fuzzy systems so that not only the function is approximated within this accuracy, …

Go to article

Time-Bounded Kolmogorov Complexity May Help In Search For Extra Terrestrial Intelligence (Seti), Martin Schmidt Jan 1999

Time-Bounded Kolmogorov Complexity May Help In Search For Extra Terrestrial Intelligence (Seti), Martin Schmidt

Departmental Technical Reports (CS)

One of the main strategies in Search for Extra Terrestrial Intelligence (SETI) is trying to overhear communications between advanced civilizations. However, there is a (seeming) problem with this approach: advanced civilizations, most probably, save communication expenses by maximally compressing their messages, and the notion of a maximally compressed message is naturally formalized as a message x for which Kolmogorov complexity C(x) is close to its length l(x), i.e., as a "random" message. In other words, a maximally compressed message is indistinguishable from the truly random noise, and thus, trying to detect such a message does not seem to be a …

Go to article

Extending T-Norms Beyond [0,1]: Relevant Results Of Semigroup Theory, Yeung Yam, Vladik Kreinovich Jan 1999

Extending T-Norms Beyond [0,1]: Relevant Results Of Semigroup Theory, Yeung Yam, Vladik Kreinovich

Departmental Technical Reports (CS)

Originally, fuzzy logic was proposed to describe human reasoning. Lately, it turned out that fuzzy logic is also a convenient approximation tool, and that moreover, sometimes a better approximation can be obtained if we use real values outside the interval [0,1]; it is therefore necessary to describe possible extension of t-norms and t-conorms to such new values. It is reasonable to require that this extension be associative, i.e., that the set of truth value with the corresponding operation form a semigroup. Semigroups have been extensively studied in mathematics. In this short paper, we describe several results from semigroup theory which …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 15, Number 1, January 1999, College Of Engineering And Computer Science, Wright State University Jan 1999

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 15, Number 1, January 1999, 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

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

Effects Of Parasitic Elements On Oscillation Frequency Of Ota-C Sinusoidal Oscillators, Ari̇f Nacaroğlu, Ergun Erçelebi̇ Jan 1999

Effects Of Parasitic Elements On Oscillation Frequency Of Ota-C Sinusoidal Oscillators, Ari̇f Nacaroğlu, Ergun Erçelebi̇

Turkish Journal of Electrical Engineering and Computer Sciences

An oscillator circuit which incorporates Operational Transconductance Amplifiers is presented. The circuit is designed using three OTAs and two grounded capacitors. The frequency of oscillation is tunable over a wide frequency range. The effects of the parasitic elements on the oscillation frequency and the oscillation condition are studied. The theoretical results are compared with the experimental results for a practical oscillator circuit.

Go to article

Graduate Catalog The School Of Computer And Info Sciences 1999-2000, Nova Southeastern University Jan 1999

Graduate Catalog The School Of Computer And Info Sciences 1999-2000, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Go to article

School Of Computer And Information Sciences--Master Of Science Degree Programs 1999, Nova Southeastern University Jan 1999

School Of Computer And Information Sciences--Master Of Science Degree Programs 1999, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

First Prev Next Last