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 661 - 690 of 733
Full-Text Articles in Computer Engineering
The 3-Tier Structured Access Protocol To Control Unfairness In Dqdb Mans, Lakshmana N. Kumar, Andreas D. Bovopoulos
The 3-Tier Structured Access Protocol To Control Unfairness In Dqdb Mans, Lakshmana N. Kumar, Andreas D. Bovopoulos
All Computer Science and Engineering Research
This paper addresses the unfairness problem appearing in 802.6-based DQDB MANs. Traffic load demand is characterized as low (below 0.4 of the channel capacity), normal (from 0.4 to 0.9 of the channel capacity) or heavy (greater than 0.9 of the channel capacity). At low loads the 802.6 protocol is acceptably fair. At normal loads, however, the protocol performance is markedly unfair. The unfairness is related to the latency in transporting a request. At heavy loads the unfairness is both latency-related and flooding-related. In this paper, both types of unfairness are carefully analyzed. As a control measure, a 3-Tier Structured Access …
Energy-Related Feature Abstraction For Handwritten Digit Recognition, Thomas H. Fuller Jr.
Energy-Related Feature Abstraction For Handwritten Digit Recognition, Thomas H. Fuller Jr.
All Computer Science and Engineering Research
Most handwritten character recognizers use either graphical (static) or first-order dynamic data. Our research speculates that the mental signal to write a digit might be partially encoded as an energy profile. We used artificial neural networks (ANN) to analyze energy-related features (first and second time derivatives) of handwritten digits of 20 subjects and later 40 subjects. An experimenal environment was developed on a NeXTstation with a real-time link to a pen-based GO computer. Although such an experiment cannot confirm an energy profile encoded in the writer, it did indicate the usefulness of energy-related features by recognizing 94.5% of the 600 …
Dna Mapping Algorithms: Clone Sequencing, Judith H. Lewis, Will Gillett
Dna Mapping Algorithms: Clone Sequencing, Judith H. Lewis, Will Gillett
All Computer Science and Engineering Research
The DNA restriction mapping problem can be abstracted to the Shortest Common Matching String problem by viewing the restriction fragment lengths as symbols and the clones as bags. The Shortest Common Matching String problem can be decomposed into the Bag Sequencing problem and the Symbol Sequencing problem. All three of these problems have bene shown to be NP-hard. Rhee has proposed a family of greedy algorithms to compute polynomial time approximations to the Bag Sequencing problem, which produced surprisingly good performance results on abstracted data. In the test data generated by Rhee for pragmatic analysis, the symbols in bags represented …
Converting Binary Thresholds Networks Into Equivalent Symmetric Networks, Gadi Pinkas
Converting Binary Thresholds Networks Into Equivalent Symmetric Networks, Gadi Pinkas
All Computer Science and Engineering Research
We give algorithms to convert any network of binary threshold units (that does not oscillate) into an equivalent network with symmetric weight matrix (like Hopfield networks [Hopfield 82] or Boltzmann machines [Hinton, Sejnowski 88]). The motivation for the transformation is dual: a) to demonstrate the expressive power of symmetric networks; i.e. binary threshold networks (that do not oscillate) are subsumed in the energy minimization paradigm; 2) to use network modules (developed for the spreading activation paradigm for example), within the energy minimization paradigm. Thus optimization [Tank, Hopfield 88] and approximation of hard problems can be combined with efficient modules, that …
Composition, Superposition, And Encapsulation In The Formal Specification Of Distributed Systems, Kenneth J. Goldman
Composition, Superposition, And Encapsulation In The Formal Specification Of Distributed Systems, Kenneth J. Goldman
All Computer Science and Engineering Research
Composition, superposition, and encapsulation are important techniques that work well together for designing large distributed software systems. Composition is a symmetric operator that allows system components to communicate with each other across module boundaries. Superposition is an asymmetric relationship that allows one system component to observe the state of another. Encapsulation is the ability to define the reason about the behavior of a module in terms of a well-defined boundary between that module and its environment, while hiding the internal operations of that module. In this paper, the I/O automation model of Lynch and Tuttle is extended to permit superposition …
The Spectrum Simulation System: A Formal Approach To Distributed Algorithm Development Tools, Kenneth J. Goldman
The Spectrum Simulation System: A Formal Approach To Distributed Algorithm Development Tools, Kenneth J. Goldman
All Computer Science and Engineering Research
We present the Spectrum Simulation System, a new research tool for the design and study of distributed algorithms. Based on the formal Input/Output Automation model of Lynch and Tuttle, Spectrum allows one to express distributed algorithms as collections of I/O automata and simulate them directly in terms of the semantics of that model. This permits integration of algorithm specification, design, debugging, analysis, and proof of correctness within a single formal framework that is natural for describing distributed algorithms. Spectrum provides a language for expressing algorithms as I/O automata, a simulator for generating algorithm executions, and a graphics interface for constructing …
An Access Protection Solution For Heavy Load Unfairness In Dqdb, Lakshmana N. Kumar, Andreas D. Bovopoulos
An Access Protection Solution For Heavy Load Unfairness In Dqdb, Lakshmana N. Kumar, Andreas D. Bovopoulos
All Computer Science and Engineering Research
This paper discusses the unfairness issue arising in a 802.6 DQDB network at high loads-- when the traffic demand to a bus exceeds the capacity of that bus. As per the 802.6 protocol, at heavy loads, the end nodes along a bus experience longer delays than the other nodes. The origin and remedy of this heavy load unfairness is discussed. An access control scheme is proposed as a solution. The comparison of the proposed scheme with 802.6 protocol is presented. The simulation results and performance characteristics are discussed under several types of loads. With symmetric load conditions under the proposed …
Rapid Display Of Radiographic Images, Jerome R. Cox Jr., Stephen M. Moore, Robert A. Whitman, G. James Blaine, R. Gilbert Jost, L. Magnus Karlsson, Thomas L. Monsees, Gregory L. Hansen, Timothy C. David
Rapid Display Of Radiographic Images, Jerome R. Cox Jr., Stephen M. Moore, Robert A. Whitman, G. James Blaine, R. Gilbert Jost, L. Magnus Karlsson, Thomas L. Monsees, Gregory L. Hansen, Timothy C. David
All Computer Science and Engineering Research
The requirements for the rapid display of radiographic images exceed the capabilities of widely available display, computer and communication technologies. Computed radiography captures data with a resolution of about four megapixels. Large format displays are available that can present over four megapixels. One megapixel displays are practical for use in combination with large format displays and in areas where the viewing task does not require primary diagnosis. This paper describes an electronic radiology system that approximates the highest quality systems, but through the use of several interesting techniques allows the possibility of its widespread installation throughout hospitals. The techniques uses …
Dna Mapping Algorithms: Abstract Data Types - Concepts And Implementation, Will Gillett, Liz Hanks
Dna Mapping Algorithms: Abstract Data Types - Concepts And Implementation, Will Gillett, Liz Hanks
All Computer Science and Engineering Research
The conceptual aspects of and the implementation details of a set of self-identifying abstract data types (ADT) are described. Each of the ADTs constitutes a specific class of object, upon which a set of well-defined access functions is available. The intent of these ADTs is to supply a paradigm in which a class of object is available for manipulation, but in which the underlying implementation is hidden from the application programmer. Specific ADTs are the described in some detail. The tagged architecture used to achieve the self-identifying property of the ADTs is presented, and a set of required system-backbone access …
The Difficulty Of Random Attribute Noise, Sally A. Goldman, Robert H. Sloan
The Difficulty Of Random Attribute Noise, Sally A. Goldman, Robert H. Sloan
All Computer Science and Engineering Research
This paper studies the robustness of pac learning algorithms when the instance space is {0,1}n, and the examples are corrupted by purely random noise affecting only the instances (and not the labels). In the past, conflicting results on this subject have been obtained-- the "best agreement" rule can only tolerate small amounts of noise, yet in some cases large amounts of noise can be tolerated. We show the truth lies somewhere between the two alternatives. For uniform attribute noise, in which each attribute is flipped independently at random with the same probability, we present an algorithm that pac learns monomial …
Computational Learning Theory Lecture Notes For Cs 582 Spring Semester, 1991, Sally A. Goldman
Computational Learning Theory Lecture Notes For Cs 582 Spring Semester, 1991, Sally A. Goldman
All Computer Science and Engineering Research
This manuscript is a compilation of lecture notes from the graduate level course CS 582, "Computational Learning Theory," I taught at Washington University in the spring of 1991. Students taking the course were assumed to have background in the design and analysis of algorithms as well as good mathematical background. Given that there is no text available on this subject, the course material was drawn from recent research papers. I selected the first twelve topics and the remainder were selected by the students from a list of provided topics. This list of topics is given at the end of these …
Applying Formal Verification Methods To Pure Rule-Based Programs, Rose F. Gamble, Gruia-Catalin Roman, William E. Ball, H. Conrad Cunningham
Applying Formal Verification Methods To Pure Rule-Based Programs, Rose F. Gamble, Gruia-Catalin Roman, William E. Ball, H. Conrad Cunningham
All Computer Science and Engineering Research
Reliability, defined as the guarantee that a program satisfies its specifications, is an important aspect of many applications for which rule-based expert systems are suited. Verification refer to the process used to determine the reliability of the rule-based program. Because past approaches to verification are informal, guarantees of reliability cannot fully be made without severely restricting the system. On the other hand, by constructing formal specifications for a program and showing the program satisfies those specifications, guarantees of reliability can be made. This paper presents an assertional approach to the verification of rule-based programs. The proof logical needed for verification …
Dna Mapping Algorithms: Topological Mapping, Kenneth Moorman, Paul Poulosky, Will Gillett
Dna Mapping Algorithms: Topological Mapping, Kenneth Moorman, Paul Poulosky, Will Gillett
All Computer Science and Engineering Research
There are several basic approaches that can be used in attempting to produce high-resolution DNA restriction maps. A standard approach is the match/merge approach in which first the topology of the map units being mapped together is suppressed and lists of potential matches between fragments are generated, and second the topology is introduced to eliminate matchlists which are inconsistent with the topology. This technical report documents a different approach to DNA mapping, known as topological mapping. In topological mapping the precedence of the two criteria are reversed, i.e., the topology of the two map units is used as the primary …
Performance Evaluation Of A Traffic Control Mechanism For Atm Networks, Andreas D. Bovopoulos
Performance Evaluation Of A Traffic Control Mechanism For Atm Networks, Andreas D. Bovopoulos
All Computer Science and Engineering Research
Future ATM networks will be required to support a plethora of services, transaction types and cell sequence behaviors with performance guarantees. Before this goal can be realized, however, some basically problems related to bandwidth allocation and traffic control in the ATM layer must be resolve. Such problems will in all likelihood defy solution as long as they studied in isolation without a unifying traffic characterization and traffic control framework. This work presented in this paper is part of an ongoing effort directed at the development of an integrated traffic characterization and control infrastructure for ATM networks. In this paper a …
Saam: The Strategic Asset Allocation Model, Judy Lewis, Todd Gamble, John Tai
Saam: The Strategic Asset Allocation Model, Judy Lewis, Todd Gamble, John Tai
All Computer Science and Engineering Research
Asset Allocation has become a dominant factor for investment strategies in recent years. It has found that by holding a strategically diversified portfolio, a high total return on investments can be maintained while, at the same time, reducing portfolio volatility. With recent federal regulations mandating pension investment responsibilities, appropriate asset allocation has become more important than ever. SAAM is a software package specifically designed to be used as a tool to aid the investment professional in determining pension portfolio allocations. SAAM uses the expect system shell CLIPS, has a user-friendly interface, displays output graphically, and runs within the confines of …
Performance Analysis Of The Ethernet Under Conditions Of Bursty Traffic, Tony Y. Mazraani, Gurudatta M. Parulkar
Performance Analysis Of The Ethernet Under Conditions Of Bursty Traffic, Tony Y. Mazraani, Gurudatta M. Parulkar
All Computer Science and Engineering Research
In this paper we present a simulation study of the Ethernet performance under conditions of bursty traffic. This study is motivated by two observations: Ethernet will continue to be a widely used Local Area Network (LAN), especially as an access LAN for future high speed internet (or Broadband ISDN); and future high speed applications can best be modeled as bursty sources. Bursty traffic in this study is specified using three parameters: peak bandwidth, average bandwidth, and burst factor. The simulation study shows that the inherent behavior of the Ethernet does not change with bursty traffic. That is, as long as …
Transforming A Rule-Based Program, Rose F. Gamble
Transforming A Rule-Based Program, Rose F. Gamble
All Computer Science and Engineering Research
Conflict resolution is a form of global control used in production systems to achieve an efficient sequential execution of a rule-based program. This type of control is not used to parallel production system models [6,13]. Instead, only those programs that make no assumptions regarding conflict resolution are executed in parallel. Therefore, the initial sequential rule-based programs are either executed in parallel without their conflict resolution strategy, which normally results in incorrect behavior, or the programs are transformed in an ad hoc manner to execute on an particular parallel production system model. As a result, these programs do not exhibit the …
A Multi-Scale Approach For Recognizing Complex Annotations In Engineering Documents., Andrew Francis Laine, William Ball, Arun Kumar
A Multi-Scale Approach For Recognizing Complex Annotations In Engineering Documents., Andrew Francis Laine, William Ball, Arun Kumar
All Computer Science and Engineering Research
This paper describes a novel method of character recognition targeted for extracting complex annotations found in engineering documents. The results of this work will make it possible to capture the information contained in documents used to support facilities management and manufacturing. The recognition problem is made difficult in part because characters and text may be expressed in arbitrary fonts and orientations. Our approach includes a novel incremental strategy based on the multi-scale representation of wavelet decompositions. Our approach is motivated by biological mechanisms of the human visual systems. Using wavelets as a set of basis functions, we may decompose an …
Segment Streaming For Efficient Pipelined Televisualization, Fengmin Gong
Segment Streaming For Efficient Pipelined Televisualization, Fengmin Gong
All Computer Science and Engineering Research
The importance of scientific visualization for both science and engineering endeavors has been well recognized. Televisualization becomes necessary because of the physical distribution of data, computation resources, and users involved in the visualization process. However, televisualization poses a number of challenges to the designers of communication protocols. A pipelined televisualization (PTV) model is proposed for efficient implementation of a class of visualization applications. Central to the proposed research is the development of a segment of streaming IPC (interprocess communication) mechanism in support of efficient pipelining across very high speed internetworks. This requires exploration of special issues arising from extending a …
Highly Concurrent Logically Synchronous Multicast, Kenneth J. Goldman
Highly Concurrent Logically Synchronous Multicast, Kenneth J. Goldman
All Computer Science and Engineering Research
We define the logically synchronous multicast problem, which imposes a natural and useful structure on message delivery order in an asynchronous system. In this problem, a computation proceeds by a sequence of multicasts, in which a process sends a message to some arbitrary subset of the processes, including itself. A logically synchronously multicast protocol must make it appear to every process as if each multicast occurs simultaneously at all participants of that multicast (sender plus receivers). Furthermore, if a process continually wishes to sends a message, it must eventually be permitted to do so. We present a highly concurrent solution …
Studies In The Hybrid Deterministic Parsing, Stan C. Kwasny, Anne M. Johnstone, Barry L. Kalman
Studies In The Hybrid Deterministic Parsing, Stan C. Kwasny, Anne M. Johnstone, Barry L. Kalman
All Computer Science and Engineering Research
This report details research plans to extend work on hybrid deterministic parsing. The approach is hybrid in its combination of symbolic and sub-symbolic (connectionist) approaches. The research is investigating (1) new and more robust architectures for deterministic parsing which are hybrid mixtures of symbolic and sub-symbolic components, (2) combinations of syntax with lexical access and other components of natural language processing in order to determine how the distributed patterns of connectionism may enable better interfaces among these components, and (3) properties of the rules in the rule-based deterministic processing of natural language that make them most suitable for sub-symbolic training. …
Super Linear Learning In Back Propagation Neural Nets, Barry L. Kalman
Super Linear Learning In Back Propagation Neural Nets, Barry L. Kalman
All Computer Science and Engineering Research
The important feature of this work is the combination of minimizing a function with desirable properties, using the conjugate gradient method (cgm). The method has resulted in significant improvements for both easy and difficult training tasks. Two major problems slow the rate at which large back propagation neural networks (bpnns) can be taught. First is the linear convergence of gradient descent used by modified steepest descent method (msdm). Second is the abundance of saddle points which occur because of the minimization of the sum of squared errors. This work offers a solution to both difficulties. The cgm which is super …
Btc Test Methodology, Gaurav Garg
Btc Test Methodology, Gaurav Garg
All Computer Science and Engineering Research
This paper describes the testing methodology for the Broadcast Translation Circuit. It covers logic simulation, timing simulation, and a single push-button test for the device. The document is intended to be a supplement to documents WUCS-89-52 and WUCS-90-19, which outline the design of the BTC in full details. The intent of a push-button test is to have a single test that causes the device to process every type of packets that it could receive. This would include various combination of RC and OP fields, a test that examines every table entry thoroughly, as well as a test of the parity …
The Equivalence Of Connectionist Energy Minimization And Propositional Calculus Satisfiability, Gadi Pinkas
The Equivalence Of Connectionist Energy Minimization And Propositional Calculus Satisfiability, Gadi Pinkas
All Computer Science and Engineering Research
Quadratic energy minimization is the essence of certain connectionist models. We define high order connectionist models to support the minimization of high order energy functions and we prove that high order energy functions are equivalent to quadratic ones. We show that the standard quadratic models can minimize high order functions using additional hidden units and we demonstrate trade-offs of size (number of hidden units), order of the model, and fan-out. We prove an equivalence between the problem of satisfiability in propositional calculus and the problem of minimization of energy functions. An energy function describes a Well Formed Formula (WFF) if …
The Wic Advisor: A Case Study In Medical Expert System Development, Elizabeth J. Mattson, Matthew M. Thomas, Sharon A. Trenz, Steve B. Cousins
The Wic Advisor: A Case Study In Medical Expert System Development, Elizabeth J. Mattson, Matthew M. Thomas, Sharon A. Trenz, Steve B. Cousins
All Computer Science and Engineering Research
This project provides a good case study of expert system development with untrained experts over a short period of time. We describe the development of a working medical screening and diagnosis expert system for use at the Women, Infants and Children (WIC) clinics in Madison County, Illinois. The system was designed and implemented over the period of four months. A large number of knowledge acquisition techniques were employed, some of them customized in ways that greatly increased their effectiveness. This paper explores the development of THE WIC Advisor, from problem definition through expert system delivery. The knowledge acquisition methods used …
A Simulation Testbed For Image Compression Algorithms, Andrew Francis Laine
A Simulation Testbed For Image Compression Algorithms, Andrew Francis Laine
All Computer Science and Engineering Research
This paper presents an overview of the design and development of a real-time (30 frames/sec) simulation testbed for evaluating and comparing image compression algorithms. The system was motivated by the need to visualize the performance of a novel compression algorithm when operating on moving pictures originating from "live" video sources. The simulation utilities are designed to exploit the parallelism of a Pixar Image Computer and high-throughput of a parallel disk assembly. The design of two key utilities are discussed: (1) A program to format precomputed four channel (RGBA) 256 X 256 color frames onto a parallel disk assembly. (2) A …
A Methodology For Developing Correct Rule-Based Programs For Parallel Implementation, Rosanne Fulcomer Gamble
A Methodology For Developing Correct Rule-Based Programs For Parallel Implementation, Rosanne Fulcomer Gamble
All Computer Science and Engineering Research
Production systems, also called rule-based systems, are very useful in automating certain human expert tasks, but the current technology exhibits many problems. We believe that parallelism is difficult to exploit in production system programs for two reasons. First, the original serial programs are designed with a priori knowledge of an explicit global control mechanism which must be simulated for correct execution in parallel. The second reason for the difficulty is that no formal language exists in which to express these programs and no verification techniques are utilized to prove properties which guarantee correct execution in parallel. With these two obstacles …
The Display And Manipulation Of Temporal Information, Steve B. Cousins, Michael G. Kahn Washington University In St. Louis, Mark E. Frisse Washington University In St. Louis
The Display And Manipulation Of Temporal Information, Steve B. Cousins, Michael G. Kahn Washington University In St. Louis, Mark E. Frisse Washington University In St. Louis
All Computer Science and Engineering Research
Because medical data have complex temporal features, special techniques are required for storing, retrieving, and displaying clinical data from electronic databases. One significant problem caused by the temporal nature of medical data has been called the temporal granularity problem. The temporal granularity problem is said to occur when the set of facts relevant to a specific problem changes as the time scale changes. We argue that what is needed to deal with changes in the relevant time scale are temporal granularity heuristics. One heuristic that we have explored is that, for any level of problem abstraction, and for each type …
Axon: Application-Oriented Lightweight Transport Protocol Design, James P.G. Sterbenz, Gurudatta M. Parulkar
Axon: Application-Oriented Lightweight Transport Protocol Design, James P.G. Sterbenz, Gurudatta M. Parulkar
All Computer Science and Engineering Research
This paper describes the application-oriented lightweight transport protocol for object transfer (ALTP-OT) in the Axon host communication architecture for distributed applications. The Axon Project is investigating an integrated design of host architecture, operating systems, and communication protocols to allow the utilization of the high band-width provided by the next generation of communication networks. ALTP-OT provides the end-to-end transport of segment and message objects for interprocess communication across a very high speed internetwork, supporting demanding applications such as scientific visualization and imaging. ALTP-OT uses rate-based flow control specifically oriented to the transfer of objects directly between application memory spaces. This document …
A Mathematical Treatment Of Defeasible Reasoning And Its Implementation, Guillermo R. Simari, R. P. Loui
A Mathematical Treatment Of Defeasible Reasoning And Its Implementation, Guillermo R. Simari, R. P. Loui
All Computer Science and Engineering Research
We present a mathematical approach to defeasible reasoning. This approach is based on the notion of specificity introduced by Poole and the theory of warrant presented by Pollock. We combine the ideas of the two. This main contribution of this paper is a precise well-defined system which exhibits correct behavior when applied to the benchmark examples in the literature. We prove that an order relation can be introduced among equivalence classes under the equi-specificity relation. We also prove a theorem that ensures the termination of the process of finding the justified facts. Two more lemmas define a reduced search space …