Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Distributed Embedded Systems (2)
- Logic simulation (2)
- Real-Time Middleware (2)
- AHE (1)
- Adaptive and reflective middleware (1)
-
- Adaptive real-time image transmission. (1)
- Algorithms (1)
- Anytime algorithms (1)
- Beat Analysis (1)
- Branch-and-bound (1)
- Branch-and-cut (1)
- Circuit simulation (1)
- Composite structures (1)
- Contrast-enhancement (1)
- Data collection to cloud (1)
- Denial of Service (1)
- Design (1)
- Discrete event simulation (1)
- Distributed real-time and embedded middleware (1)
- Distributed systems (1)
- Event list algorithms (1)
- Event lists (1)
- Execution Security (1)
- Experimentation (1)
- First order logic. (1)
- Generative programming (1)
- Group Scheduling (1)
- Linear programming (1)
- Logic simulation machines (1)
- Logic simulators (1)
- Publication Year
Articles 631 - 660 of 683
Full-Text Articles in Computer Engineering
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 …
Axon: A High Speed Communication Architecture For Distributed Applications, James P.G. Sterbenz, Gurudatta M. Parulkar
Axon: A High Speed Communication Architecture For Distributed Applications, James P.G. Sterbenz, Gurudatta M. Parulkar
All Computer Science and Engineering Research
There are two complementary trends in the computer and communication fields. Increasing processor power and memory availability allow more demanding applications, such as scientific visualization and imaging. Advances in network performance and functionality have the potential for supporting programs requiring high bandwidth and predictable performance. However, the bottleneck in increasingly in the host-network interface, and thus the ability to deliver high performance communication capability to applications has not kept up with the advances in computer and network speed. We have proposed a new architecture that meets these challenges called Axon, whose novel aspects include: an integrated design of hardware, operating …
Ampliative Inference, Computation, And Dialectic, R. P. Loui
Ampliative Inference, Computation, And Dialectic, R. P. Loui
All Computer Science and Engineering Research
There are three theses here: • Non-computationally conceived inference merely expands notation. This includes induction as well as deduction, and thus both deserve the adjective non-ampliative. Deriving entailments merely expands shorthand. All of the familiar formalisms for reasoning do just this. • There now exist examples of formalism for reasoning that do something else. They are deliberative, and to say in what way they are deliberative requires reference to the process through which they compute their entailments. • The original ampliative/non-ampliative terminology best survives as referring to this new distinction. Viewed formally, all other attempted distinctions either presume deduction to …
Host-Network Interface Architecture For Gigabit Communications, James P. G. Sterbenz
Host-Network Interface Architecture For Gigabit Communications, James P. G. Sterbenz
All Computer Science and Engineering Research
There are two complementary trends in the computer and communications fields. Increasing processor power and memory availability allow more demanding applications, such as scientific visualizations and imaging. Advances in network performance and functionality have the potential for supporting applications requiring high bandwidth communications. However, the bottleneck is increasingly in the host-network interface, and thus the ability to deliver high performance communications capability to applications has not kept up with the advance in computer and network speed. We have proposed a new architecture that meets these challenges, called Axon. The Axon thesis is that an essential requirement for the support of …
Back Propagation With Integer Arithmetic, Takayuki Dan Kimura
Back Propagation With Integer Arithmetic, Takayuki Dan Kimura
All Computer Science and Engineering Research
The present work investigates the significance of arithmetic precision in neural network simulation. Noting that a biological brain consists of a large number of cells of low precision, we try to answer the question: With a fixed size of memory and CPU cycles available for simulation, does a larger sized net with less precision perform better than smaller sized one with higher precision? We evaluate the merits and demerits of using low precision integer arithmetic in simulating backpropagation networks. Two identical backpropagation simulators, ibp and fbp, were constructed on Mac II, ibp with 16 bits integer representations of network parameters …
User's Manual For Ccrc: (Common Lisp Version) Computing Reference Classes Statistical Reasoning Shell V. 2.5, R. P. Loui
User's Manual For Ccrc: (Common Lisp Version) Computing Reference Classes Statistical Reasoning Shell V. 2.5, R. P. Loui
All Computer Science and Engineering Research
CCRC implements a subset of Kyburg's rules for statistical inference. The system states from 1961 and is briefly described in "The Reference Class," (H. Kyburg Philosophy of Science 50, 1982). Consult the paper "Computing Reference Classes" (R. Loui, in Kanal, L. and Lemmer, J., Uncertainty in AI, v.1, North-Holland 1987) for a precis of the ideas underlying this program. This document is only the skeleton of a manual. It is designed to get the novice on the program as quickly as possible, and to provide some guidance for advanced questions. This piece of software is the extended version of a …
Defeasible Decisions: What The Proposal Is And Isn't, R. P. Loui
Defeasible Decisions: What The Proposal Is And Isn't, R. P. Loui
All Computer Science and Engineering Research
In two recent papers, I have proposed a description of decision analysis that differs from the Bayesian picture painted by Savage, Jeffrey and other classic authors. Response to this view have been either overly enthusiastic or unduly pessimistic. In this paper I try to place the idea in its proper place, which must be somewhere in between. Looking at decision analysis as defeasible reasoning produces a framework in which planning and decision theory can be integrated, but work on the details has barely begun. It also produces a framework in which the meta-decision regress can be stopped in a reasonable …
Model-Based Interpretation Of Time-Varying Medical Data, Michael G. Kahn, Lawrence M. Fagan Washington University In St. Louis, Lewis B. Sheiner Washington University In St. Louis
Model-Based Interpretation Of Time-Varying Medical Data, Michael G. Kahn, Lawrence M. Fagan Washington University In St. Louis, Lewis B. Sheiner Washington University In St. Louis
All Computer Science and Engineering Research
Temporal concepts are critical is medical therapy-planning. If given early enough, specific therapeutic choices may abort or suppress evolving undesired changes in a patient’s clinical status. Effective medical decision making demands recognition and interpretation of complex temporal changes that permeate the medical record. This paper presents a methodology for representing and using medical knowledge about temporal relationships to infer the presence of clinically relevant events, and describes a program, called TOPAZ, that uses this methodology to generate a narrative summary of such events. A unique feature of TOPAZ is the use of numeric and symbolic modeling techniques to perform temporal …
A Psychophysical Comparison Of Two Methods For Adaptive Histogram Equalization, John B. Zimmerman, Steve B. Cousins, Mark E. Frisse, Karin M. Hartzell, Michael C. Kahn
A Psychophysical Comparison Of Two Methods For Adaptive Histogram Equalization, John B. Zimmerman, Steve B. Cousins, Mark E. Frisse, Karin M. Hartzell, Michael C. Kahn
All Computer Science and Engineering Research
Adaptive histogram equalization (ahe) is a method for adaptive contrast enhancement of digital images propped by Pizer et. Al.. It has the properties that it is an automatic, reproducible method for the simultaneous viewing of contrast within a digital image with a large dynamic range. Recent experiments have show that in specific cases, there is no significant difference in the ability of ahe and linear intensity windowing to display grey-scale contrast. More recently, Pizer et al. have proposed a variant of ahe which limits the allowed contrast enhancement of the image. The contrast-limited adaptive histogram equalization (clahe) produces images in …
An Inexpensive Electronic Viewbox, J. R. Cox Jr., R. G. Jost, T. Monsees, S. Ramamurthy, M. Karlsson
An Inexpensive Electronic Viewbox, J. R. Cox Jr., R. G. Jost, T. Monsees, S. Ramamurthy, M. Karlsson
All Computer Science and Engineering Research
An "electronic viewbox" is described that has been designed to meet the demand for a modestly priced soft-copy display for radiology. Issues associated with spatial resolution, intensity resolution, image magnification, user interface, digital communications and possible applications are discussed.
Determinism And Connectionism In A Rule-Based Natural Language System, Stan C. Kwasny, Kanaan A. Faisal
Determinism And Connectionism In A Rule-Based Natural Language System, Stan C. Kwasny, Kanaan A. Faisal
All Computer Science and Engineering Research
The processing of Natural Language is, at the same time, natural symbolic and naturally symbolic and naturally sub-symbolic. It is symbolic because ultimately symbols play a critical role. Writing systems, for example, owe their existence to the symbolic nature of language. It is also sub-symbolic because of the nature of speech, the fuzziness of concepts, and the high degree of parallelism that is difficult to explain as a purely symbolic phenomenon. This report details a set of experiments which support the claim that Natural Language can be syntactically processed in a robust manner using a connectionist deterministic parser. The model …
The Next Generation Of Internetworking, Gurudatta M. Parulkar
The Next Generation Of Internetworking, Gurudatta M. Parulkar
All Computer Science and Engineering Research
This paper describes a research effort concerned with the design of the next generation of internet architecture, which has been necessitated by two emerging trends. First, there will be at least a few orders of magnitude increase in data rates of communication networks in the next few years. For example, researchers are already prototyping networks with data rates of up to a few hundred Mbps, and are planning networks with data rates up to a few Gbps. Second, researchers from all disciplines of science, engineering, and humanities plan to use the communication infrastructure to access widely distributed resources in order …
Comments On Proposed Transport Protocols, Anil Bhatia, James Sterbenz, Gurudatta M. Parulkar
Comments On Proposed Transport Protocols, Anil Bhatia, James Sterbenz, Gurudatta M. Parulkar
All Computer Science and Engineering Research
Over the last few years, a number of research groups have made considerable progress on the design of high speed networks- on the order of a few hundred Mbps to the few Gbps. The emphasis of this work has been on the design of packet switches and on the design of network access protocols. However, this work has not yet addressed the internetworking and transport level issues in the high speed internet. As part of our effort on the design of VHSI model, we considered the appropriateness of recently proposed transport protocols, NETBLT and VMTP, as candidates for the transport …
Relational Completeness Of Show And Tell Visual Programming Language, Takayuki Dan Kimura
Relational Completeness Of Show And Tell Visual Programming Language, Takayuki Dan Kimura
All Computer Science and Engineering Research
In this paper we present the database applications of the Show and Tell Language (STL) and demonstrate the relational completeness of the language. STL is a visual programming language designed for novice computer users who are not familiar with keyboarding. A program can be constructed by using only a pointing device, except for textual data entry. A program can be constructed by using only a pointing device, except for textual data entry. Various programming concepts such as subroutine, iteration, recursion, concurrency, exception, and so forth are represented by two-dimensional graphic patterns and icons. The language is used to test the …
A Parallel Distributed Approach To Parsing Natural Language Deterministically, Stan C. Kwasny
A Parallel Distributed Approach To Parsing Natural Language Deterministically, Stan C. Kwasny
All Computer Science and Engineering Research
The Determinism Hypothesis (Marcus, 1980) has given rise to much debate. The hypothesis makes explicit the idea that Natural Language interpretation need not depend in any fundamental way on the use of pseudo-parallelism or backtracking. We are exploring the consequences of this hypothesis in attempting to develop approaches to parsing which integrates current work in parallel distributed adaptive networks. We follow the basic approach of "Wait-and-See" parsing (WASP) which has shown the Natural Language interpretation of all but some varieties of "garden-path" sentences can be deterministically performed using a stack, a buffer for sentence constituents, and partitioned packets of rules. …
A Graph Browser With Zoom And Roam For Allegro Common Lisp, Steve B. Cousins, J. Andrew Fingerhut
A Graph Browser With Zoom And Roam For Allegro Common Lisp, Steve B. Cousins, J. Andrew Fingerhut
All Computer Science and Engineering Research
This report describes an object-oriented tool that has been developed for viewing graphs on a Macintosh II computer using Allegro Common Lisp. The tool is useful for visualizing data which can be represented in tree or graph form. The graphs can be viewed for far away to get a global view, and from close up so that the labels on the vertices can be discerned. Scrolling can be performed at a nearly infinite number of resolutions, and a search feature makes it easy to find any node rapidly. Although the 'information space' on which the graph is logically plotted is …
Using A Partial Order And A Metric To Analyze A Recursive Trace Set Equation, Jan Tijmen Udding, Tom Verhoeff
Using A Partial Order And A Metric To Analyze A Recursive Trace Set Equation, Jan Tijmen Udding, Tom Verhoeff
All Computer Science and Engineering Research
In Trace Theory the notion of a process is defined in terms of a set of finite-length traces over an alphabet. These processes are used as the semantics for a program notation. The program text for a recursive component naturally gives rise to an equation over trace sets. This paper takes two approaches at the analysis of that equation. The first approach is based on a partial order and it concentrates on the projection operator for processes. This yields a condition under which the greatest solution of that equation can be approximated by iteration. The second approach introduces a metric …
Performance Models For Noahnet, Gurudatta M. Parulkar, Adarshpal S. Sethi, David J. Farber
Performance Models For Noahnet, Gurudatta M. Parulkar, Adarshpal S. Sethi, David J. Farber
All Computer Science and Engineering Research
Noahnet is an experimental flood local area network with features such as high reliability and high performance. Noahnet uses a randomly connected graph topology with four to five interconnections per node and a flooding protocol to route messages. In Noahnet flooding, the routing of a message from a source to the destination node is a two step process: flooding-growth and flooding-contraction. During the growth of flooding, the message propagates to every node which is not occupied with a message and is reachable from the source node. During the contraction of flooding, the nodes that became occupied during the growth of …
Parallel Simulated Annealing, Roger D. Chamberlain, Mark N. Edelman, Mark A. Franklin, Ellen E. Witte
Parallel Simulated Annealing, Roger D. Chamberlain, Mark N. Edelman, Mark A. Franklin, Ellen E. Witte
All Computer Science and Engineering Research
Since the paper by Kirkpatrick, Gelatt and Vecchi in 1983, the use of Simulated Annealing (SA) in solving combinatoric optimization problems has increased substantially. The SA algorithm has been applied to difficult problems in the difficult problems in the digital design automation such as cell placement and wire routing. While these studies have yielded good or near optimum solutions, they have required very long computer execution times (hours and days). These long times, coupled with the recent availability of the number of commercial parallel processors, has prompted the search for parallel implementations of the SA algorithm. The goal ahs been …
Hierarchical Discrete-Event Simulation On Hypercube Architecture, Roger D. Chamberlain, Mark A. Franklin
Hierarchical Discrete-Event Simulation On Hypercube Architecture, Roger D. Chamberlain, Mark A. Franklin
All Computer Science and Engineering Research
This paper presents model of hierarchical discrete-event simulation algorithm running on a hypercube architecture. We assume a static allocation of system components to processors in the hypercube. We also assume a global clock algorithm, with an event-based time increment. Following development of the performance model, we describe an application of the model in the area of digital systems simulation. Hierarchical levels included are gate level (NAND, NOR, and NOT gates) and MSI level (multiplexors, shift registers, etc.). Example values (gathered from simulations running on standard von Neumann architectures) are provided at the model inputs to show the effect of different …
Lsim2 User's Manual, Roger D. Chamberlain, Mark N. Edelman
Lsim2 User's Manual, Roger D. Chamberlain, Mark N. Edelman
All Computer Science and Engineering Research
Lsim2 is gate/switch-level digital logic simulator. It enables users to model digital circuits both at the gate and switch level and incorporates features the support investigation of the simulation task itself. Lsim2 is an augmented version of the original lsim* with the addition of several new MSI-type components models. This user's manual describes procedures for specifying a circuit in lsim2, mechanisms for controlling the simulation, and approaches to modeling systems.