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 601 - 630 of 830
Full-Text Articles in Computer Sciences
Replication Of The First Controlled Experiment On The Usefulness Of Design Patterns: Detailed Description And Evaluation, Lutz Prechelt, Barbara Unger, Douglas Schmidt
Replication Of The First Controlled Experiment On The Usefulness Of Design Patterns: Detailed Description And Evaluation, Lutz Prechelt, Barbara Unger, Douglas Schmidt
All Computer Science and Engineering Research
Advocates of software design patterns claim that using design patterns improves communication between software developers. The controled experiment that we describe in this report tests the hypothesis that software maintainers of well-structured, well-documented software containing design patterns can make changes (1) faster and (2) with less errors if the use of patterns is explicitly documented in the software. The experiment was performed with 22 participants of a university course on C++ and design patterns; it is similar to a previous experiment performed in Karlsruhe. For one of the two experiment tasks the experiment finds that both hypotheses appear to be …
Computational Detection Of Cpg Islands In Dna, Eric C. Rouchka, Richard Mazzarella, David J. States
Computational Detection Of Cpg Islands In Dna, Eric C. Rouchka, Richard Mazzarella, David J. States
All Computer Science and Engineering Research
Regions of DNA rich in CpG dinucleotides, also known as CpG islands, are often located upstream of the transcription start side in both tissue specific and housekeeping genes. Overall, CPG dinucleotides are observed at a density of 25% the expected level from base composition alone, partially due to 5-methylcytosine decay (Bird, 1993). Since CpG dinucleotides typically occur with low frequency, CpG islands can be distinguished statistically in the genome. Our method of detecting CpG islands involves a heuristic algorithm employing classic changepoint methods and log-likelihood statistics. A Java applet has been created to allow for user interaction and visualization of …
An Algorithm For Message Delivery In A Micromobility Environment, Amy L. Murphy, Gruia-Catalin Roman, George Varghese
An Algorithm For Message Delivery In A Micromobility Environment, Amy L. Murphy, Gruia-Catalin Roman, George Varghese
All Computer Science and Engineering Research
With recent advances in wireless communication and the ubiquity of laptops, mobile computing has become an important research area. An essential problem in mobile computing is the delivery of a message from a source to either a single mobile node, unicast, or to a group of mobile nodes, multicast. Standard solutions proposed for macromobility (Mobile IP) and micromobility (cellular phones) for the unicast problem rely on tracking the mobile node. Tracking solutions scale badly when mobile nodes move frequently, and do not generalize well to multicast delivery. Our paper proposes a new message delivery algorithm for micromobility based on a …
An Introduction To Mobile Unity, Gruia-Catalin Roman, Peter J. Mccann
An Introduction To Mobile Unity, Gruia-Catalin Roman, Peter J. Mccann
All Computer Science and Engineering Research
Traditionally, a distributed system has been viewed as a collection of fixed computational elements connected by a static network. Prompted by recent advances in wireless communications rechnology, the emerging field of mobile computing is challenging these assumptions by providing mobile hosts with connectivity that may change over time, raising the possibility that hosts may be called upon to operate while only weakly connected to or while completely disconnected from other hosts. We define a concurrent mobile system as one where independently executing coponents may migrate through some space during the course of the computation, and where the pattern of connectivity …
Terabit Burst Switching, Jonathan S. Turner
Terabit Burst Switching, Jonathan S. Turner
All Computer Science and Engineering Research
This report summarizes the results of an architectural study on Terabit Burst Switching. The purpose of this study was to explore alternative architectures for very high performance switching for data communication, using a combination of optical and electronic technologies. We explore two alternative implementations of the burst switching concept in detail, one using a hybrid architecture with an electronic core, and an integrated architecture using an all optical data path. We also briefly discuss an approach using optical TDM. Our results show that using the hybrid architecture, it is feasible to construct systems with aggregate capacities of tens of terabits …
Compositional Programming Abstractions For Mobile Computing, Peter J. Mccann, Gruia-Catalin Roman
Compositional Programming Abstractions For Mobile Computing, Peter J. Mccann, Gruia-Catalin Roman
All Computer Science and Engineering Research
Recent advances in wireless networking technology and the increasing demand for ubiquitous, mobile connectivity demonstrate the importance of providing reliable systems for managing reconfiguration and disconnection of components. Design of such systems requires tools and techniques appropriate to the task. Many formal models of computation, including UNITY, are not adequate for expressing reconfiguration and disconnection and are therefore inappropriate vehicles for investigating the impact of mobility on the construction of modular and composable systems. Algebraic formalisms such as the pi-calculus have been proposed for modeling mobility. This paper addresses the question of whether UNITY, a state-based formalism with a foundation …
Design And Implementation Of A New Connection Admission Control Algorithm Using A Multistate Traffic Source Model, Robert Engel
Design And Implementation Of A New Connection Admission Control Algorithm Using A Multistate Traffic Source Model, Robert Engel
All Computer Science and Engineering Research
This report develops a practical method for connection admission control in ATM networks. The method is based on a virtual cell loss probability criterion, is designed to handle heterogeneous traffic types and allows each traffic source to be described by an individual finite-state model with as many states as are needed to describe the source traffic. To make connection admission decisions with respect to individual links, an aggregate finite state model is computed from the individual models and used to estimate the virtual cell loss probabilities. To reduce the computational requirements for maintaining the aggregate traffic model, the aggregate model …
The Design And Performance Of A Real-Time Corba Event Service, Timothy H. Harrison, David L. Levine, Douglas C. Schmidt
The Design And Performance Of A Real-Time Corba Event Service, Timothy H. Harrison, David L. Levine, Douglas C. Schmidt
All Computer Science and Engineering Research
The CORBA Event Service provides a flexible model for asynchronous communication among objects.However, the standard CORBA Event Service specification lacks important features required by real-time applications. For instance, operational flight programs for fighter aircraft have complex real-time processing requirements. This paper describes the design and performance of an object-oriented, real-time implementation of the CORBA Event Service that is designed to meet these requirements. This paper makes three contributions to the design and performance measurement of object-oriented real-time systems. First, it illustrates how to extend the CORBA Event Service so that it is suitable for real-time systems. These extensions support periodic …
An Error Control Scheme For Large-Scale Multicast Applications, Christos Papadopoulos, Guru Parulkar, George Varghese
An Error Control Scheme For Large-Scale Multicast Applications, Christos Papadopoulos, Guru Parulkar, George Varghese
All Computer Science and Engineering Research
Retransmission based error control for large scale multicast applications is difficult because of two main problems: request implosion and lack of local recovery. Existing schemes (SRM, RMTP, TMTP, LBRRM) have good solutions to request implosion, but only approximate solutions (e.g., based on scoped multicast) for the local recovery problem. Our scheme achieves finer grain fault recovery by exploiting new forwarding services that allow us to create a dynamic hierarchy of receivers. We use a new paradigm, where routers provide a more refined form of multicasting (that may be useful to other applications), that enables local recovery. The new services, however, …
The Programmers' Playground Application Management System User Guide, William M. Shapiro, T. Paul Mccartney, E.F. Berkley Shands
The Programmers' Playground Application Management System User Guide, William M. Shapiro, T. Paul Mccartney, E.F. Berkley Shands
All Computer Science and Engineering Research
Application Management permits the advertising, launching, and configuring of distributed applications created using the Programmers' Playground. Applications can be documented and made available to end-users through the use of application pages on the World Wide Web. The launching and configuring of applications is performed by a brokerage system consisting of an applicatoin broker and one or more hierarchies of module launchers. This document describes how to setup and use the components of the Application Management system.
Exact Learning Of Discretized Geometric Concepts, Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
Exact Learning Of Discretized Geometric Concepts, Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
All Computer Science and Engineering Research
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the unioin of m axis-parallel boxes in d-dimensional discretized Euclidean space where each coordinate can have n discrete values. This algorithm receives at most md counterexamples and uses time and membership queries polynomial in m and log(n) for any constant d. Furthermore, all equivalence queries can be formulated as the union of O(mdlog(m)) axis-parallel boxes. Next, we show how to extend our algorithm to efficiently learn, from only equivalence queries, any discretized geometric concept generated from any number of halfspaces …
Dynamic Flow Switching: A New Communication Service For Atm Networks, Qiyong Bian, Kohei Shimoto, Jonathan Turner
Dynamic Flow Switching: A New Communication Service For Atm Networks, Qiyong Bian, Kohei Shimoto, Jonathan Turner
All Computer Science and Engineering Research
This paper presents a new communication service for ATM networks that provides one-way, adjustable rate, on-demand communication channels. The proposed dynamic flow service is designed to operate within a multi-service cell switched network that supports both conventional switched virtual circuits and IP packet routing and is designed to complement those services. It is particularly well suited to applications that transmit substantial amounts of data (a few tens of kilobytes or more) in fairly short time periods (up to a few seconds). Much of the current world-wide web traffic falls within this domain. Like IP packet networks, the new service permits …
Sequence Assembly Validation By Restriction Digest Fingerprint Comparison, Eric C. Rouchka, David J. States
Sequence Assembly Validation By Restriction Digest Fingerprint Comparison, Eric C. Rouchka, David J. States
All Computer Science and Engineering Research
DNA sequence analysis depends on the accurate assembly of fragment reads for the determination of a consensus sequence. Genomic sequences frequently contain repeat elements that may confound the fragment assembly process, and errors in fragment assembly, and errors in fragment assembly may seriously impact the biological interpretation of the sequence data. Validating the fidelity of sequence assembly by experimental means is desirable. This report examines the use of restriction digest analysis as a method for testing the fidelity of sequence assembly. Restriction digest fingerprint matching is an established technology for high resolution physical map construction, but the requirements for assembly …
Reducing Web Latencies Using Precomputed Hints, Girish P. Chandranmenon, George Varghese
Reducing Web Latencies Using Precomputed Hints, Girish P. Chandranmenon, George Varghese
All Computer Science and Engineering Research
Current network technology is bandwidth-rich but latency-poor; thus round-trip delays will dominate access latency for web traffic. We describe four new techniques that reduce the round-trips needed for web accesses. The techniques are based on the paradigm of preprocessing a web page to collect information about links and inline data in the page. Stored Address Binding almost always eliminates the DNS lookup (which can cost seconds) at the start of a transaction. In Informed Server Proxying, a server tells its client that it has cached pages referenced in a page the client just retrieved; this allows the client to retrieve …
An Algorithm For Message Delivery To Mobile Units, Amy L. Murphy, Gruia-Catalin Roman, George Varghese
An Algorithm For Message Delivery To Mobile Units, Amy L. Murphy, Gruia-Catalin Roman, George Varghese
All Computer Science and Engineering Research
With recent advances in wireless communication and the ubiquity of laptops, mobile computing has become an important research area. An essential problem in mobile computing is the delivery of a message from a source to either a single mobile node, unicast, or to a group of mobile nodes, multicast. Standard solutions used in Mobile IP and cellular phones for the unicast problem rely on tracking the mobile unit. Tracking solutions scale badly when mobile nodes move frequently, and do not generalize well to multicast delivery. Our paper proposes a new message delivery algorithm for micromobility based on a modification of …
Bringing Real-Time Scheduling Theory And Practice Closer For Multimedia Computing, R. Gopalakrishnan, Guru M. Parulkar
Bringing Real-Time Scheduling Theory And Practice Closer For Multimedia Computing, R. Gopalakrishnan, Guru M. Parulkar
All Computer Science and Engineering Research
This paper seeks to bridge the gap between theory and practice of real-time scheduling in the domain of multimedia computer systems. We show that scheduling algorithms that are good in theory, often have practical limitations. However when these algorithms are modified based on practical considerations, existing theoretical results cannot be used as they are. In this paper we motivate the need for new scheduling schemes for multimedia protocol processing, and demonstrate their real-time performance in our prototype implementation. We then explain the observed results by analysis and measurement. More specifically, we show that using strict preemption can introduce overheads in …
New Results On Generalized Caching, Saied Hosseini-Khayat
New Results On Generalized Caching, Saied Hosseini-Khayat
All Computer Science and Engineering Research
We report a number of new results in generalized caching. This problem arises in modern computer networks in which data objects of various sizes are transmitted frequently. First it is shown that its optimal solution is NP-complete. Then we explore two methods of obtaining nearly optimal answers based on the dynamic programming algorithm that we provided in [5]. These methods enable a trade-off between optimality and speed. It is also shown that LFD (the longest forward distance algorithm which is the optimal policy in the classical case), is no longer optimal but is competitive. We also prove that LRU remains …
A Usability Study Of End-User Construction Of Direct Manipulation User Interfaces, T Paul Mccartney
A Usability Study Of End-User Construction Of Direct Manipulation User Interfaces, T Paul Mccartney
All Computer Science and Engineering Research
This paper describes an empirical study of end-users that tested the usability of The Programmers' Playground graphical environment. The Programmers' Playground is a software library and run-time system for constructing distributed multimedia applications. Playground's graphical environment enables end-users to create direct manipulation graphical user interfaces (GUIs) and to dynamically configure communication among distributed application components. In this study, 28 end-users with no prior experience in distributed computing or user interface construction were timed and evaluated on several tasks using our graphical environment. Tasks included the use of direct and indirect constraint relationships, visual configuration of distributed applications, and graphical user …
Design And Implementation Of A Practical Security-Conscious Electronic Polling System, Lorrie Faith Cranor, Ron K. Cytron
Design And Implementation Of A Practical Security-Conscious Electronic Polling System, Lorrie Faith Cranor, Ron K. Cytron
All Computer Science and Engineering Research
We present the design and implementation of Sensus, a practical, secure and private system for conducting surveys and elections over computer networks. Expanding on the work of Fujioka, Okamoto, and Ohta, Sensus uses blind signatures to ensure that only registered voters can vote and that each registered voter only votes once, while at the same time maintaining voters' privacy. Sensus allows voters to verify independently that their votes were counted correctly, and anonymously challenge the results should their votes be miscounted. We outline seven desirable properties of voting systems and show that Sensus satisfied these properties well, in some cases …
Mobile Unity: Reasoning And Specification In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann
Mobile Unity: Reasoning And Specification In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann
All Computer Science and Engineering Research
Mobile computing represents a major point of departure from the traditional distributed computing paradigm. The potentially very large number of independent computing units, a decoupled computing style, frequent disconnections, continuous position changes, and the location-dependent nature of the behavior and communication patterns present designers with unprecedented challenges in the areas of modularity and dependability. So far, the literature on mobile computing is dominated by concerns having to do with the development of protocols and services. This paper complements this perspective by considering the nature of the underlying formal models that will enable us to specify and reason about such computations. …
Distributed Stream Filtering For Database Applications, William M. Shapiro, Kenneth J. Goldman
Distributed Stream Filtering For Database Applications, William M. Shapiro, Kenneth J. Goldman
All Computer Science and Engineering Research
Distributed stream filtering is a mechanism for implementing a new class of real-time applications with distributed processing requirements. These applications require scalable architectures to support the efficient processing and multiplexing of large volumes of continuously generated data. This paper provides an overview of a stream-oriented model for database query processing and presents a supporting implementation. To facilitate distributed stream filtering, we introduce several new query processing operations, including pipelined filtering that efficiently joins and eliminates duplicates from database streams and a new join method, the progressive join, that joins streams of tuples. Finally, recognizing that the stream-oriented model results in …
Optimal Solution Of Off-Line And On-Line Generalized Caching, Saied Hosseini-Khayat, Jerome R. Cox
Optimal Solution Of Off-Line And On-Line Generalized Caching, Saied Hosseini-Khayat, Jerome R. Cox
All Computer Science and Engineering Research
Network traffic can be reduced significantly if caching is utilized effectively. As an effort in this direction we study the replacement problem that arises in caching of multimedia objects. The size of objects and the cost of cache misses are assumed non-uniform. The non-uniformity of size is inherent in multimedia objects, and the non-uniformity of cost is due to the non-uniformity of size and the fact that the objects are scattered throughout the network. Although a special case of this problem, i.e. the case of uniform size and cost, has been extensively studied, the general case needs a great deal …
Extending Atm Networks For Efficient Reliable Multicast, Jonathan S. Turner
Extending Atm Networks For Efficient Reliable Multicast, Jonathan S. Turner
All Computer Science and Engineering Research
One of the important features of ATM networks is their ability to support multicast communications. This facilitates the efficient distribution of multimedia information streams (such as audio and video) to large groups of receivers (potentially millions). Because ATM networks do not provide reliable delivery mechanisms, it is up to end systems to provide end-to-end reliability where it is needed. While this is straightforward for point-to-point virtual circuits, it is more difficult for one-to many and many-to-mamy virtual circuits. In this report, we propose some minimal extensions to the hardware of ATM switches that enables end systems to implement reliable multicast …
Analysis Of Mpeg Compressed Video Traffic, Jerome R. Cox Jr., O. Matthew Beal
Analysis Of Mpeg Compressed Video Traffic, Jerome R. Cox Jr., O. Matthew Beal
All Computer Science and Engineering Research
This paper outlines a study of MPEG compressed video sequences and simulation of multiplexed video traffic in the ATM environment. A number of statistical characteristics including autocorrelation and variance of MPEG-1 compressed video sequences are used to characterize the 16 sample traces used in this study. From these measurements, a preliminary model is developed which utilizes basic measurements of the individual component video sequences to predict bandwidth requirements and cell loss of the multiplexed video traffic.
Design Of Nonblocking Atm Networks, J. Andrew Fingerhut, Rob Jackson, Subhash Suri, Jonathan S. Turner
Design Of Nonblocking Atm Networks, J. Andrew Fingerhut, Rob Jackson, Subhash Suri, Jonathan S. Turner
All Computer Science and Engineering Research
This paper considers the problem of designing ATM networks that are nonblocking with respect to virtual circuit requests, subject to specified constraints on the traffic. In this paper, we focus on global traffic constraints that simply limit the total entering and exiting traffic at each switching system. After reviewing prior results for linear link costs, we introduce a more realistic link cost model, and develop a number of results using it. We also describe a technique for converting tree-structured networks to nonblocking hierarchical networks satisfying limits on the capacity of any single switch.
Simulation Of Asynchronous Instruction Pipelines, Chia-Hsing Chien, Mark A. Franklin
Simulation Of Asynchronous Instruction Pipelines, Chia-Hsing Chien, Mark A. Franklin
All Computer Science and Engineering Research
This paper presents the ARAS simulator with which asynchronous instruction pipelines can be modelled, simulated and displayed. ARAS allows one to construct instruction pipelines by preparing various configuration files. Using these files and a number of benchmark programs, performance of the instruction pipelines can be obtained. The performance of asynchronous instruction pipelines can also be compared to synchronous case. Thus, one can decide the optimal design for instruction pipelines in asynchornous or synchronous cases and explore the deisng space of asynchronous instruction pipeline architectures.
Design Of A Gigabit Atm Switch, Tom Chaney, Andrew Fingerhut, Margaret Flucke, Jonathan S. Turner
Design Of A Gigabit Atm Switch, Tom Chaney, Andrew Fingerhut, Margaret Flucke, Jonathan S. Turner
All Computer Science and Engineering Research
This report describes the design and implementation of a gigabit ATM switching system supporting link rates from 150 Mb/s to 2.4 Gb/s, with a uniquely efficient multicast switch architecture that enables the construction of systems with essentially constant per port costs for configurations ranging from 8 to 4096 ports and system capacities approaching 1- Tb.s. The system design supports many-to-one and many-to-many forms of multicast, in addition to the usual one-to-many. It also provides multicast virtual paths, constant time configuration of multicast connections and an efficient packet-level discard method, that can achieve 100% link efficiencies, without large buffers.
On The Performance Of Early Packet Discard, Maurizio Casoni, Jonathan S. Turner
On The Performance Of Early Packet Discard, Maurizio Casoni, Jonathan S. Turner
All Computer Science and Engineering Research
In a previous paper [3], one of the authors, gave a worst-case analysis for the Early Packet Discard (EPD) technique for maintaining packet integrity during overload in ATM switches. This analysis showed that to ensure 100% goodput during overload under worst-case conditions, requires a buffer with enough storage for one maximum length packet from every active virtual circuit. This paper refines that analysis, using assumptions that are closer to what we expect to see in practice and examines how EPD performs when the buffer is not large enough to achieve 100% goodput. We show that 100% goodput can be achieved …
Vaudeville: A High Performance, Voice-Activated Teleconferencing Application, Jyoti K. Parwatikar, T. Paul Mccartney, John D. Dehart, Maynard Engebretson, Kenneth J. Goldman
Vaudeville: A High Performance, Voice-Activated Teleconferencing Application, Jyoti K. Parwatikar, T. Paul Mccartney, John D. Dehart, Maynard Engebretson, Kenneth J. Goldman
All Computer Science and Engineering Research
We present a voice-activated, hands-off, ATM-based video conferencing application. The application, called Vaudeville, features high quality NTSC video, voice-activated audio transmission, audio bridging of two audio streams, and voice-activated video switching. It supports multiple simultaneous multi-party conferences using a scalable multicast mechanism. We describe how Vaudeville was built using a component-based distributed programming environment. We also describe the algorithms used to contorl the audio and video of the applciation. Audio and video are encoded in hardware using an ATM hardware multimedia interface.
Supporting Dis Applications Using Atm Multipoint Connection Caching, Anshul Kantawala, Guru Parulkar, John Dehart, Ted Marz
Supporting Dis Applications Using Atm Multipoint Connection Caching, Anshul Kantawala, Guru Parulkar, John Dehart, Ted Marz
All Computer Science and Engineering Research
This report describes an ATM Multipoint Connection Caching strategy (AMCC) to control the explosive growth of traffic within the network and at an endpoint in a large Distributed Interactive Simulation (DIS) application such as a battlefield simulation. For very large DIS applications with 100,000 entities, the current method of broadcasting information among entities will no longer be feasible due to computational and network bandwidth limitations. Our scheme divides the simulation space into grids and each grid square or a set of grid squares forms a multicast group. Entities join the groups within their perception range and thus, they receive state …