Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (698)
- Computer Sciences (697)
- Electrical and Computer Engineering (15)
- Computer and Systems Architecture (10)
- Electrical and Electronics (8)
-
- Hardware Systems (4)
- Digital Communications and Networking (3)
- Other Computer Engineering (3)
- Other Electrical and Computer Engineering (3)
- Robotics (3)
- Signal Processing (2)
- VLSI and Circuits, Embedded and Hardware Systems (2)
- Artificial Intelligence and Robotics (1)
- Biochemical and Biomolecular Engineering (1)
- Biomedical Engineering and Bioengineering (1)
- Chemical Engineering (1)
- Civil and Environmental Engineering (1)
- Controls and Control Theory (1)
- Digital Circuits (1)
- Environmental Engineering (1)
- Numerical Analysis and Scientific Computing (1)
- Optics (1)
- Physics (1)
- Software Engineering (1)
- Systems Architecture (1)
- Systems and Communications (1)
- Theory and Algorithms (1)
- Keyword
-
- FPGA (4)
- Machine learning (3)
- ADAPT (2)
- Algorithms (2)
- Distributed Embedded Systems (2)
-
- Logic simulation (2)
- OpenCL (2)
- Optimization (2)
- Polarization (2)
- Real-Time Middleware (2)
- AHE (1)
- AI (1)
- ASIC (1)
- Adaptive and reflective middleware (1)
- Adaptive denoiser (1)
- Adaptive real-time image transmission. (1)
- Adversarial Attacks (1)
- Adversarial Machine Learning (1)
- Adversarial Robustness (1)
- Aerosol size distribution (1)
- Analog Sensor (1)
- Anytime algorithms (1)
- Application-Specific Integrated Circuits (1)
- Artificial Intelligence Secure Framework;Distributed 5G Testbed;Hybrid Deep Reinforcement Learning (HDRL);Internet of Medical Things (IoMT);Internet of Things (IoT);LEMDA (1)
- Artificial Neural Network (1)
- Authentication (1)
- Automaton (1)
- Autonomous System (1)
- Autonomy (1)
- Beat Analysis (1)
- Publication Year
- Publication
- Publication Type
Articles 541 - 570 of 733
Full-Text Articles in Computer Engineering
Building Distributed Applications With Design Patterns, Gruia-Catalin Roman, James C. Hu
Building Distributed Applications With Design Patterns, Gruia-Catalin Roman, James C. Hu
All Computer Science and Engineering Research
Design patterns are a topic of great current interest within the object-oriented programming community. The motivation is both economical and intellectual. On one hand, there is the hope of establishing a common culture and language that fosters communicatino and growth in the software engineering field. While a community dominated by empiricism is seeking to achieve higher levels of formality by capturing its experiences in the form of catalogs of design patterns, another community, deeply rooted in formal thinking, is seeking to make its mark on the every day workings of the software engineering process. Distributed algorithms and the heuristics used …
Mobile Unity Coordination Constructs Applied To Packet Forwarding For Mobile Hosts, Peter J. Mccann, Gruia-Catalin Roman
Mobile Unity Coordination Constructs Applied To Packet Forwarding For Mobile Hosts, 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 language and logic for specifying and reasoning about mobile systems, the components of which must operate in a highly decoupled way. In this paper it is argued that Mobile UNITY contributes to the modular development of system specifications because of the declarative …
End-User Construction And Configuration Of Distributed Multimedia Applications, Terrance Paul Mccartney
End-User Construction And Configuration Of Distributed Multimedia Applications, Terrance Paul Mccartney
All Computer Science and Engineering Research
Distributed multimedia applications supported by a global electronic infrastructure have tremendous potential for providing users with customized communication and computation environments. Since communication and computation requirements vary by context and change dynamically, it is unlikely that off-the-shelf applications will anticipate the needs of all users. Therefore, empowering end-users to create their own customized applications for both communication and computation is an important challenge. This dissertation presents several mechanisms that enable end-users to create and configure distributed multimedia applications, including end-users construction direct manipulation graphical users interface (GUIs) and application management of distributed multimedia applications over the Internet.
Leap Forward Virtual Clock: An O(Loglogn) Fair Queuing Scheme With Guaranteed Delays And Throughput Fairness, Subhash Suri, George Varghese, Girish P. Chandranmenon
Leap Forward Virtual Clock: An O(Loglogn) Fair Queuing Scheme With Guaranteed Delays And Throughput Fairness, Subhash Suri, George Varghese, Girish P. Chandranmenon
All Computer Science and Engineering Research
We describe an efficient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds almost identical to that of PGPS fair queuing, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglogN) per packet guaranteed delay and throughput fairness. As its name suggests, our scheme is based on Zhang's virtual clock. While the original virtual clock scheme does not achieve throughput fairness, we can modify it with a simple leap forward mechanism that keeps the server clock from lagging too far behind the packet tags. We prove that our scheme guarantees a fair share …
Designing Minimum Cost Nonblocking Communication Networks, J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner
Designing Minimum Cost Nonblocking Communication Networks, J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner
All Computer Science and Engineering Research
This paper addresses the problem of topological design of ATM (and similar) communication networks. We formulate the problem from a worst-case point of view, seeking network desings that, subject to specified traffic constraints, are nonblocking for point-to-point and multicast virtual circuits. Within this model we give various conditions under which star networks are optimal or near-optimal. These conditions are approximately satisfied in many common situations making the results of practical significance. An important consequence of these results is that, where they apply, there is no added cost for nonblocking multicast communication, relative to networks that are nonblocking for point-to-point traffic …
Pac Learing Of One-Dimensional Patterns, Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott
Pac Learing Of One-Dimensional Patterns, Paul W. Goldberg, Sally A. Goldman, Stephen D. Scott
All Computer Science and Engineering Research
Developing the ability to recognize a landmark from a visual image of a robot's current location is a fundamental problem in robotics. We consider the problem of PAC-learning the concept class of geometric patterns where the target geometric pattern is a configuration of k points on the real line. Each instance is a configuration of n points on the real line, where it is labeled according to whether or not it visually resembles the target pattern. To capture the notion of visual resemblance we use the Hausdorff metric. Informally, two geometric patterns P and Q resemble each othe runder the …
A Survey Of Network Signaling, Dakang Wu
A Survey Of Network Signaling, Dakang Wu
All Computer Science and Engineering Research
Abstract Network signaling is the process of transferring control information among components of a communication network to establish, maintain, and release connections, and to pass the network management information. The rapid evolution in the field of telecommunications has led to the rapid evolution of network signaling. In this paper, we review the evolution of network signaling. We emphasize the concepts and protocols used in modern fast packet switching networks especially in emerging ATM networks.
Reasoning About Program Interactions In The Presence Of Mobility, Gruia-Catalin Roman, Peter J. Mccann
Reasoning About Program Interactions In The Presence Of Mobility, Gruia-Catalin Roman, Peter J. Mccann
All Computer Science and Engineering Research
Mobile computing is emerging as an important new paradigm which has the potential to reshape our thinking about distributed computation. Mobility has far-reaching implications on what designers and users can assume about communication patterns, resource availability, and applciation behaviors as components move from one location to another while joining or leaving groups of other components in their vicinity. New distributed algorithms are likely to be required as the nature of applications shifts with the emergence of this new kind of computing environment. Formal methods have an important role to play in the midst of these developments both in terms of …
A Single-Stroke Orientation-Orient Gesture System, Yike Hu
A Single-Stroke Orientation-Orient Gesture System, Yike Hu
All Computer Science and Engineering Research
No abstract provided.
An Interactive Model Of Teaching, H. David Mathias
An Interactive Model Of Teaching, H. David Mathias
All Computer Science and Engineering Research
Previous teaching models in the learning theory community have been batch models. That is, in these models the teacher has generated a single set of helpful examples to present to the learner. In this paper we present an interactive model in which the learner has the ability to ask queries as in the query learning model of Angluin [1]. We show that this model is at least as powerful as previous teaching models. We also show that anything learnable with queries, even by a randomized learner, is teachable in our model. In all previous teaching models, all classes shown to …
Aras: Asynchronous Risc Architecture Simulator, Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan, Prithvi Prabhu
Aras: Asynchronous Risc Architecture Simulator, Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan, Prithvi Prabhu
All Computer Science and Engineering Research
In this paper, an asynchronous pipeline instruction simulator, ARAS is presented. With this simulator, one can design selected instruction pipelines and check their performance. Performance measurements of the pipeline configuration are obtained by simulating the execution of benchmark programs on the machine architectures developed. Depending on the simulation results obtained by using ARAS, the pipeline configuration can be altered to improve its performance. Thus, one can explore the design space of aynchronous pipeline architectures.
Assertional Reasoning About Pairwise Transient Interactions In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann, Jerome Plun
Assertional Reasoning About Pairwise Transient Interactions In Mobile Computing, Gruia-Catalin Roman, Peter J. Mccann, Jerome Plun
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 of the individual components present designers with unprecedented challenges in the areas of modularity and dependability. This paper describes two ideas regarding a modular approach to specifying and reasoning about mobile computing. The novelty of our approach rests with the notion of allowing transient interactions among programs which mobe in space. In this paper we restrict our concert …
Transient Data Sharing Among Mobile Programs, Jerome Plun, Gruia-Catalin Roman
Transient Data Sharing Among Mobile Programs, Jerome Plun, Gruia-Catalin Roman
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. This paper describes a modular approach to specifying and reasoning about of mobile computing. Its novelty rests with the notion of allowing transient (location-dependent) data sharing among programs which move in space. The notation is a direct extension of that used in UNITY and reasoning about …
Real-Time Upcalls: A Mechanism To Provide Real-Time Processing Guarantees, Raman Gopalakrishna, Guru M. Parulkar
Real-Time Upcalls: A Mechanism To Provide Real-Time Processing Guarantees, Raman Gopalakrishna, Guru M. Parulkar
All Computer Science and Engineering Research
Real-time upcalls (RTUs) are an operating systems mechanism that can be used by applications to efficiently schedule code segments (or handlers) that must execute periodically. While the mechanism was conceibed to support protocol processing with quality-of-service guarantees for networked multimedia applicatoins it is general enough to be applicable in other domains like real-time image processing. Until now real-time threads have been the only mechanism for implementing protocols in user space with QoS guarantees. The RTU mechanism avoids the implementation complexity of the thread based approach while retaining its ability to ensure real-time behavior. In addition, our design simplifies protocol code, …
Load Balance Properties Of Distributed Data Layouts For Clustered Mod Servers, Milind M. Buddhikot, Guru Parulkar
Load Balance Properties Of Distributed Data Layouts For Clustered Mod Servers, Milind M. Buddhikot, Guru Parulkar
All Computer Science and Engineering Research
Large scale storage servers that provide location transparent, interactive access to hundreds or thousands of concurrent, independent clients will be important components of hte furture information super-highway infrastructure. Two key requirements of such servers are as follows: support high parallelism and concurrency in data access to allow large number of access to the same or different data. Second, support independent interactive playout control operations such as fast-forward, rewind, slow-play, pause, resume, random access etc. with minimal latency. This paper assumes a distributed storage server architecture consisting of several high performance storage nodes interconnected by a high speed desk area network …
Hart's Critics On Defeasible Concepts And Ascriptivism, Ronald P. Loui
Hart's Critics On Defeasible Concepts And Ascriptivism, Ronald P. Loui
All Computer Science and Engineering Research
Hart's "Ascription of Responsibility and Rights" is where we find perhaps the first clear pronouncement of defeasibility and the technical introduction of the term. The paper has been criticised, disavowed, and never quite fully redeemed. Its lurid history is now being used as an excuse for dismissing the importance of defeasibility. Quite to the contrary, Hart's introduction of defeasibility has uniformly been regarded as the most agreeable part of the paper. The critics' wish that defeasibility could be better expounded along the lines of a Wittgensteinian game-theoretic semantics has largely been fulfilled. Even the most contentious part of the paper, …
Efficient Demultiplexing Of Network Packets By Automatic Parsing, Mahesh Jayaram, Ron K. Cytron
Efficient Demultiplexing Of Network Packets By Automatic Parsing, Mahesh Jayaram, Ron K. Cytron
All Computer Science and Engineering Research
Packet filters are a mechanism for efficiently demultiplexing network packets to application endpoints. There is currently no general, formal specification method for packet filters that allows for easy or efficient composition of specifications. In this paper we present an automatic approach that achieves all of these goals. We approach packet filter specification as a language recognition problem: each filter is represented by a context-free grammar, whose language is the set of packets the filter should accept. Thus, packet filters can be formulated through a general, well defined specification; further, the grammar-based approach simplifies filter composition, which is essential where scalability …
Design Of A Tool For Rapid Prototyping Of Communication Protocols, Aniruddha Gokhale, Ron Cytron, George Varghese
Design Of A Tool For Rapid Prototyping Of Communication Protocols, Aniruddha Gokhale, Ron Cytron, George Varghese
All Computer Science and Engineering Research
We present a new tool for automatically generating prototypes of communication protocols on a wide variety of platforms. Our goal is to reduce design time, enhance portability, and accommodate optimizations automatically. Users of the tool are required to provide an abstract implementation of the protocol in C++ without worrying about the underlying operating system specific system calls. Instead, the user employs high-level interface functions provided by the tool to interact with the underlying operating system. Users also need not worry about complex packet formats that involve fields of various bit and byte lengths. Instead, they use simple C/C++ struct declarations …
Self-Stabilization By Window Washing, Adam M. Costello, George Varghese
Self-Stabilization By Window Washing, Adam M. Costello, George Varghese
All Computer Science and Engineering Research
A useful way to design simple and robust protocols is to make them self-stabilitizing. We describe a new general technique for self-stabilization called window washing. We apply this technique to generalized sliding window protocols that work on a number of topologies. This results in simple, efficient, and self-stabilizing protocols. As far as we know, both window washing and generalized sliding window protocols are new ideas. Our protocols can be used for data links, reliable broadcast, and flow control.
Distributed Radiological Multimedia Conferencing, Naeem Bari
Distributed Radiological Multimedia Conferencing, Naeem Bari
All Computer Science and Engineering Research
Distributed Radiological Multimedia Conference (DRMC) is a collaborative imaging/multimedia conferencing tool which allows geographically separated physicians to confer over a shared projection radiograph. DRMC utilizes the advantages of high bandwidth and scalability offered by the new Asynchronous Transfer Mode (ATM) network technology. This application is customized for the high quality of displayed images and rapid response to user requests. It allows conferees to: share a common radiograph; each possess an independently controlled globally visible cursor; be able to point to and outline areas on the image to bring it to the other conferees' attention; and see and hear each other …
A General Matrix Iterative Model For Dynamic Load Balancing, Mark A. Franklin, Vasudha Govindan
A General Matrix Iterative Model For Dynamic Load Balancing, Mark A. Franklin, Vasudha Govindan
All Computer Science and Engineering Research
Effective load balancing algorithms are crucial in fully realizing the performance potential of parallel computer systems. This paper proposes a general matrix iterative model to represent a range of dynamic load balancing algorithms. The model and associated performance measures are used to evaluate and compare vairous load balancing algorithms and derive optimal algorithms and associated parameters for a given application and multiprocessor system. The model is parameterized to represent three load balancing algorithms - the random strategy, diffusion and complete redistribution algorithms. The model is validated by comparing the results with measured performance on a realistic workload. The parallel N-body …
Issues In Distributed Control For Atm Networks, Jonathan S. Turner
Issues In Distributed Control For Atm Networks, Jonathan S. Turner
All Computer Science and Engineering Research
Asynchronous Transfer Mode (ATM) network technology is expected to become a central part of the emerging global information infrastructure. ATM networks introduce a number of features that distinguish them from earlier technologies and introduce new issues in network control. This paper offers a framework for precisely defining and analyzing alternative approaches to the distributed control of ATM networks and explores some of the key design issues through a series of examples. It is hoped that it will provide a useful foundation for researchers in networking and distributed computing interested in exploring these issues further and developing more complete solutions.
Synchronized Data Objects, Marin Bezic
Synchronized Data Objects, Marin Bezic
All Computer Science and Engineering Research
Synchronized Data Objects (SDOs) are presented as a method of encapsulating, in the datatype definition, synchronization protocols that are used to control information exchange. SDOs are presented in the context of I/O abstraction, a programming model that seeks to separate communication from computation in order to support dynamic end-user configuration of distrivuted applications. SDOs can be used to implement a variety of synchronization paradigms, including remote invalidation, demand-driven data streams, remote procedure call, and promises. An implementation of SDOs is described in the context of The Programmers' Playground, a distributed application development environment that supports the I/O abstraction programming model. …
Euphoria Reference Manual, T. Paul Mccartney, Kenneth J. Goldman
Euphoria Reference Manual, T. Paul Mccartney, Kenneth J. Goldman
All Computer Science and Engineering Research
No abstract provided.
Building Interactive Distributed Applications In C++ With The Programmers' Playground, Kenneth J. Goldman, T. Paul Mccartney, Ram Sethuraman, Bala Swaminathan And Todd Rogers
Building Interactive Distributed Applications In C++ With The Programmers' Playground, Kenneth J. Goldman, T. Paul Mccartney, Ram Sethuraman, Bala Swaminathan And Todd Rogers
All Computer Science and Engineering Research
No abstract provided.
Maintaining High Throughput During Overload In Atm Switches, Jonathan S. Turner
Maintaining High Throughput During Overload In Atm Switches, Jonathan S. Turner
All Computer Science and Engineering Research
This report analyzes two popular heuristics for ensuring packet integrity in ATM switching systems. In particular, we analyze the behavior of packet tail discarding, in order to understand how the packet level link efficiency is dependent on the rates of individual virtual circuits and the degre of the imposed overload. In addition, we study early packet discard and show that the queue capacity needed to achieve high efficiency under worst-case conditions grows with the number of virtual circuits and we determine the efficiency obtainable with more limited queue capacities. Using the insights from these analyses, extensions to early packet discard …
Distributed Debugging With I/O Abstraction, Andrew S. Koransky
Distributed Debugging With I/O Abstraction, Andrew S. Koransky
All Computer Science and Engineering Research
This thesis presents a simple, yet powerful, set of mechanisms for testing and debugging distributed applications consisting of modules that communicate through well-defined data interfaces. The tools allow default or programmer-defined functions to be attached to various communication events so that particular data values at interesting points in the program are made available for testing and debugging. The debugging status of each component of the communication interface can be controlled separately so that various debugging information can be turned on and off during program execution. By attaching breakpoints to programmer-defined fucntions in a standard debugger, fine-grained examination of each module …
Time Variability While Training A Parallel Neural Net Network, Tina L. Seawell, Barry L. Kalman
Time Variability While Training A Parallel Neural Net Network, Tina L. Seawell, Barry L. Kalman
All Computer Science and Engineering Research
The algorithmic analysis, data collection, and statistical analysis required to isolate the cause of time variability observed while an Elman style recurrent neural network is trained in parallel on a twenty processor SPARCcenter 2000 is described in detail. Correlations of system metrics indicate the operating system scheduler or an interaction of kernel processes is the most probable explanation for the variability.
Euphoria: End-User Construction Of Direct Manipulation User Interfaces For Distributed Applications, T. Paul Mccartney, Kenneth J. Goldman, David E. Saff
Euphoria: End-User Construction Of Direct Manipulation User Interfaces For Distributed Applications, T. Paul Mccartney, Kenneth J. Goldman, David E. Saff
All Computer Science and Engineering Research
The Programmers' Playground is a software library and run-time system for creating distributed multimedia applications from collections of reusable software moduels. This paper presents the design and implementation of EUPHORIA, Playground's user interface management system. Implemented as a Playground module, EUPHORIA allows end-users to create direct manipulation graphical user interfaces (GUIs) exclusively through the use of a graphics editor. No programming is required. At run-time, attributes of the GUI state can be exposed and connected to external Playground modules, allowing the user to vosualize and directly manipulate state information in remote Playground modules. Features of EUPHORIA include real-time direct manipulation …
Redesigning The Bsd Callout And Timer Facilities, Adam M. Costello, George Varghese
Redesigning The Bsd Callout And Timer Facilities, Adam M. Costello, George Varghese
All Computer Science and Engineering Research
We describe a new implementation of the BSD callout and timer facilities. Current BSD kernels take time proportional to the number of outstanding timers to set or cancel timers. Our implementation takes constant time to start, stop, and maintain timers; this leads to a highly scalable design that can support thousands of outstanding timers without much overhead. Unlike the existing implementation, our routines are guaranteed to lock out interrupts only for a small, bounded amount of time. We also extend the setitimer() interface to allow a process to have multiple outstanding timers, thereby reducing the need for users to maintain …