Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Engineering (730)
- Computer Engineering (697)
- Artificial Intelligence and Robotics (25)
- Electrical and Computer Engineering (13)
- Electrical and Electronics (10)
-
- Theory and Algorithms (9)
- Life Sciences (8)
- Biomedical Engineering and Bioengineering (7)
- Graphics and Human Computer Interfaces (7)
- Data Science (5)
- Medicine and Health Sciences (5)
- Social and Behavioral Sciences (5)
- Statistics and Probability (5)
- Information Security (4)
- Numerical Analysis and Scientific Computing (4)
- Other Computer Sciences (4)
- Bioinformatics (3)
- Computer and Systems Architecture (3)
- Education (3)
- Analytical, Diagnostic and Therapeutic Techniques and Equipment (2)
- Applied Mathematics (2)
- Astrophysics and Astronomy (2)
- Biology (2)
- Computational Engineering (2)
- Control Theory (2)
- Controls and Control Theory (2)
- Curriculum and Instruction (2)
- Databases and Information Systems (2)
- Keyword
-
- Machine Learning (11)
- Machine learning (10)
- Optimization (6)
- Deep Learning (5)
- Computer vision (4)
-
- Deep learning (4)
- AI (3)
- Trust (3)
- Virtualization (3)
- Active learning (2)
- Algorithms (2)
- Bayesian (2)
- Bayesian optimization (2)
- Benchmark (2)
- Biomedical informatics;Deep learning;disease progression;Multimodal representation learning (2)
- ChatGPT (2)
- Computer Vision (2)
- Computer graphics (2)
- Computer vision;cyber physical systems;efficiency;machine learning;machine vision;trustworthy (2)
- Cyber-physical systems (2)
- Data Visualization (2)
- Distributed Embedded Systems (2)
- Electronic health record (2)
- Gated recurrent unit (2)
- Healthcare;Internet of Medical Things;Machine Learning;Wearable (2)
- Heuristic Search (2)
- Individual work (2)
- LLM (2)
- Large language models (2)
- Logic simulation (2)
- Publication Year
- Publication
- Publication Type
Articles 541 - 570 of 830
Full-Text Articles in Computer Sciences
Anmac: A Novel Architectural Framework For Network Management And Control Using Active Networks, Samphel Norden
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
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
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
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
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
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
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
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 …
An Algorithm For Optimal Winner Determination In Combinatorial Auctions, Tuomas Sandholm
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
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
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
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
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
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
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
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 …
Modeling Mobile Ip In Mobile Unity, Peter J. Mccann, Gruia-Catalin Roman
Modeling Mobile Ip In Mobile Unity, Peter J. Mccann, Gruia-Catalin Roman
All Computer Science and Engineering Research
With recent advances in wireless communication technology, mobile computing is an increasingly important area of research. A mobile system is one where independently executing components may migrate through some space during the course of the computation, and where the pattern of connectivity among the components changes as they move in and out of proximity. Mobile UNITY is a notation and proof logic for specifying and reasoning about mobile systems. In this paper it is argued that Mobile UNITY contributes to the modular development of system specifications because of the declarative fashion in which coordination among components is specified. The packet …
A Simplified Reservation And State Setup Protocol, Hari Adiseshu, Guru Parulkar, Subhash Suri
A Simplified Reservation And State Setup Protocol, Hari Adiseshu, Guru Parulkar, Subhash Suri
All Computer Science and Engineering Research
The last few years have seen the development of a model for Integrated Services Internet, which extends the traditional Internet by adding multiple service classes in addition to the traditional best effort service class, and a signaling protocol called RSVP for applications to reserve resources. While this framework has been standardized in the IETF WGs and the RSVP protocol has been defined, there has been no movement towards a commercial implementation of this framework, principally due to its perceived complexity and lack of scalability. This paper analyzes RSVP, discusses some of the its bottlenecks and shows how they can be …
Tcp/Ip Implementation With Endsystem Qos, Sherlia Y. Shi, Gurudatta M. Parulkar, R. Gopalakrishnan
Tcp/Ip Implementation With Endsystem Qos, Sherlia Y. Shi, Gurudatta M. Parulkar, R. Gopalakrishnan
All Computer Science and Engineering Research
This paper presents a Real-time Upcall (RTU) [1] based TCP/IP implementation that guarantees throughput for continuous media applications and ensures low latency bounds for interactive applications. RTU is an endsystem rate-based scheduling mechanism that provides quality of service (QoS) in terms of CPU cycles, to applications. We restructured the existing NetBSD TCP/IP implementation to exploit the RTU concurrency model and to provide predictable performance. Our experimental results show that on two 200 MHz NetBSD PCs connected by a 155Mbps ATM link, the RTU based kernel TCP/IP implementation provides excellent throughput guarantees for periodic connections regardless the system or network load. …
Application Development And Management In The Programmers' Playground, T. Paul Mccartney, E.F. Berkley Shands, Kenneth J. Goldman, William M. Shapiro
Application Development And Management In The Programmers' Playground, T. Paul Mccartney, E.F. Berkley Shands, Kenneth J. Goldman, William M. Shapiro
All Computer Science and Engineering Research
Application management refers to the process of making software applications available to end-users and providing automated mechanisms for launching and joining such applications. The Programmers' Playground is a computing environment for creating distributed applications from modular, reusable components. This paper discusses a set of tools that enable application developers to: (1) design and debug Playground distributed applications from existing "off-the-shelf" components using a visual configuration tool, (2) make new application components available on the Internet through a "launcher" service, and (3) make complete distributed applications available via a World Wide Web interface, enabling end-users to launch and join the applications …
Terabit Burst Switching Progress Report (6/98-9/98), Jonathan S. Turner
Terabit Burst Switching Progress Report (6/98-9/98), Jonathan S. Turner
All Computer Science and Engineering Research
This report summarizes progress on the Terabit Burst Switching Project at Washington University for the period from June 15, 1998 through September 15, 1998.
Agnostic Learning Of Geometric Patterns, Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott
Agnostic Learning Of Geometric Patterns, Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott
All Computer Science and Engineering Research
Goldberg, Goldman, and Scott demonstrated how the problem of recognizing a landmark from a one-dimensional visual image can be mapped to that of learning a one-dimensional geometric pattern and gave a PAC algorithm to learn that class. In this paper, we present an efficient on-line agnostic learning algorithm for learning the class of constant-dimension geometric patterns. Our algorithm can tolerate both classification and attribute noise. By working in higher dimensional spaces we can represent more features from the visual image in the geometric pattern. Our mapping of the data to a geometric pattern, and hence our learning algorithm, is applicable …
Fault-Tolerant Mobile Ip, Rajib Ghosh, George Varghese
Fault-Tolerant Mobile Ip, Rajib Ghosh, George Varghese
All Computer Science and Engineering Research
We describe mechanisms to enhance the reliability and performance of Mobile IP. In Mobile IP today home agents and foreign agents are single points of failure and potential performance bottlenecks. For example, a home agent crash can lead to communication failure if the mobile is away from home. In this paper we describe new mechanisms to allow redundant home and foreign agents. Redundant agents can take over from each other in case of failure, and also split load amongst themselves. Our mechanisms are simple, transparent to existing mobile nodes, and compatible with the existing Mobile IP specification. We have implemented …
On-Line Scheduling With Hard Deadlines, Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
On-Line Scheduling With Hard Deadlines, Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
All Computer Science and Engineering Research
We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be started. The goal is to maximize total resource utilization. The jobs are non-preemptive and exclusive, meaning once a job begins, it runs to completion, and at most one job can use …
Learning From Examples With Unspecified Attribute Values, Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott
Learning From Examples With Unspecified Attribute Values, Sally A. Goldman, Stephen S. Kwek, Stephen D. Scott
All Computer Science and Engineering Research
We introduce the UAV learning model in which some of the attributes in the examples are unspecified. In our model, an example x is classified positive (resp., negative) if all possible assignments for the unspecified attributes result in a positive (resp., negative) classification. Otherwise the classificatoin given to x is "?" (for unknown). Given an example x in which some attributes are unspecified, the oracle UAV-MQ responds with the classification of x. Given a hypothesis h, the oracle UAV-EQ returns an example x (that could have unspecified attributes) for which h(x) is incorrect. We show that any class learnable in …
Diagnostic Screening Of Digital Mammograms Using Wavelets And Neural Networks To Extract Structure, Barry L. Kalman, Stan C. Kwasny, William R. Reinus
Diagnostic Screening Of Digital Mammograms Using Wavelets And Neural Networks To Extract Structure, Barry L. Kalman, Stan C. Kwasny, William R. Reinus
All Computer Science and Engineering Research
As the primary tool for detecting breast carcinoma, mammography provides visual images from which a trained radiologist can identify suspicious areas that suggest the presence of cancer. We describe an approach to image processing that reduces an image to a small number of values based on its structural characteristics using wavelets and neural networks. To illustrate its utility, we apply this methodology to the automatic screening of mammograms for mass lesions. Our results approach performance levels of trained human mammographers.
Routing Table Compression Using Binary Tree Collapse, Jonathan Turner, Qiyong Bian, Marcel Waldvogel
Routing Table Compression Using Binary Tree Collapse, Jonathan Turner, Qiyong Bian, Marcel Waldvogel
All Computer Science and Engineering Research
This paper describes an algorithm which can roughly halve the size of the current Internet routing tables. This algorithm is based on the radix trie representation of routing tables, which was firstly used in the BSD Unix distributions. The binary tree representation, which is a simplified case of radix tree, does well at showing the relationships among all routing table entries and provides us a way to build a collapse algorithm based on its internal structure. The binary tree collapse algorithm consists of three techniques, with the first two quite intuitive while the third is a bit more elaborate. All …
Router Plugins: A Modular And Extensible Software Framework For Modern High Performance Integrated Services Routers, Dan Decasper, Zubin Dittia, Guru Parulkar, Bernhard Plattner
Router Plugins: A Modular And Extensible Software Framework For Modern High Performance Integrated Services Routers, Dan Decasper, Zubin Dittia, Guru Parulkar, Bernhard Plattner
All Computer Science and Engineering Research
Present day routers typically employ monolithic operating systems which are not easily upgraded and extensible. WIth the rapid rate of protocol development it is becoming increasingly important to dynamically upgrade router software in an incremental fashion. We have designed and implemented a high performance, modular, extended integrated services router software architecture in the NetBSD operating system kernel. This architecture allows code modules, called plugins, to be dynamically added and configured at run time. One of the novel features of our design is the ability to bind different plugins to individual flows; this allows for distinct plugin implementations to seamlessly coexist …
Terabit Burst Switching Progress Report (12/97-2/98), Jonathan S. Turner
Terabit Burst Switching Progress Report (12/97-2/98), Jonathan S. Turner
All Computer Science and Engineering Research
This report summarizes progress on the Terabit Burst Switching Project at Washington University for the period from December 15, 1997 through March 15, 1998. Efforts during this period have concentrated on working out details of the burst switch architecture, evaluating a variety of implementation alternatives and developing the physical design of the 160 Gb/s ATM switch to allow demonstration of the burst switch within a realistic network context.
Integrating A Constraint Mechanism With The Javabeans Model, William M. Shapiro
Integrating A Constraint Mechanism With The Javabeans Model, William M. Shapiro
All Computer Science and Engineering Research
The JavaBeans component model allows users to plug together software components to create Java applications by specifying simple relationships between component events and properties. This paper describes work on augmenting the simple JavaBeans model with a multi-way constraint mechanism that allows users to graphically specify more complex multi-way contraints, resolve cyclical constraints between bean properties and graphically layout bean components. We also discuss weaknesses in the JavaBeans model and Java Abstract Windowing Toolkit (AWT) that were discovered while integrating a constraint mechanism with JavaBeans.