Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (696)
- Computer Sciences (695)
- Electrical and Computer Engineering (9)
- Electrical and Electronics (6)
- Computer and Systems Architecture (5)
-
- Digital Communications and Networking (3)
- Hardware Systems (3)
- Other Computer Engineering (2)
- Biomedical Engineering and Bioengineering (1)
- Civil and Environmental Engineering (1)
- Digital Circuits (1)
- Environmental Engineering (1)
- Numerical Analysis and Scientific Computing (1)
- Optics (1)
- Other Electrical and Computer Engineering (1)
- Physics (1)
- Robotics (1)
- Signal Processing (1)
- Software Engineering (1)
- Systems Architecture (1)
- Systems and Communications (1)
- Theory and Algorithms (1)
- VLSI and Circuits, Embedded and Hardware Systems (1)
- Keyword
-
- Machine learning (3)
- Distributed Embedded Systems (2)
- FPGA (2)
- Logic simulation (2)
- OpenCL (2)
-
- Optimization (2)
- Polarization (2)
- Real-Time Middleware (2)
- ADAPT (1)
- AHE (1)
- Adaptive and reflective middleware (1)
- Adaptive real-time image transmission. (1)
- Adversarial Attacks (1)
- Adversarial Machine Learning (1)
- Adversarial Robustness (1)
- Aerosol size distribution (1)
- Algorithms (1)
- Algorithms, Biophysics, Cryptic Pockets, Deep Learning, Molecular Dynamics, Proteins (1)
- Analog Sensor (1)
- Anytime algorithms (1)
- Artificial Neural Network (1)
- Authentication (1)
- Beat Analysis (1)
- Bio-Inspired (1)
- Blockchain (1)
- Branch-and-bound (1)
- Branch-and-cut (1)
- Budgeted learning (1)
- Catoptric Surface (1)
- Circuit simulation (1)
- Publication Year
- Publication
- Publication Type
Articles 691 - 717 of 717
Full-Text Articles in Computer Engineering
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 …
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 …
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.
Automatic Interface Generations From Grammar Specifications, Steve B. Cousins
Automatic Interface Generations From Grammar Specifications, Steve B. Cousins
All Computer Science and Engineering Research
This paper presents a method for automatically generating user interfaces to programs. All possible legal strings of input to a moderately interactive program, taken together, specify the input language of that program. A grammar for such a language is fundamentally knowledge about the language, and that knowledge can be used to assist the program's user in constructing legal program input. The set of words which can appear next in an input sentence, the 'Next set', is defined and a technique for calculating it with a modified version of Prologs's Definite Clause Grammar parser is given. One type of interface this …
Evaluation Of 3d Voxel Rendering Algorithms For Real-Time Interaction On A Simd Graphics Processor, Don Schreiter, John B. Zimmerman
Evaluation Of 3d Voxel Rendering Algorithms For Real-Time Interaction On A Simd Graphics Processor, Don Schreiter, John B. Zimmerman
All Computer Science and Engineering Research
The display of three-dimensional medical data is becoming more common, but current hardware and image rendering algorithms do not generally allow real-time interaction with the image by the user. Real-time interactions, such as image rotation, utilize the motion processing capabilities of the human visual system, allowing a better understanding of the structures being imaged. Recent advances in general purpose graphics display equipment could make real-time interaction feasible in clinical setting. We have evaluated the capabilities of one type of advanced display architecture, the PIXAR Imaging Computer, for real-time interaction while displaying three-dimensional medical data as two-dimensional projections. It was discovered …
An Evaluation Of The Effectiveness Of Adaptive Histogram Equalization For Contrast Enhancement, John B. Zimmerman, Stephen M. Pizer, Edward V. Staab, J. Randolph Perry, William Mccartney, Bradley C. Brenton
An Evaluation Of The Effectiveness Of Adaptive Histogram Equalization For Contrast Enhancement, John B. Zimmerman, Stephen M. Pizer, Edward V. Staab, J. Randolph Perry, William Mccartney, Bradley C. Brenton
All Computer Science and Engineering Research
Adaptive Histogram Equalization (AHE), a method of contrast enhancement which is sensitive to local spatial information in an image, has been proposed as a solution to the problem of the inability of ordinary display devices to depict the full dynamic intensity range in some medical images. This method is automatic, reproducible, and simultaneously displays most of the information contained in the grey-scale contrast of the image. However, it has not been known whether the use of AHE causes the loss of diagnostic information relative to the commonly-used method intensity windowing. In the current work, AHE and intensity windowing are compared …
Load And Communications Balancing On Multiprocessor Logic Simulation Engines, Ken Wong, Mark A. Franklin
Load And Communications Balancing On Multiprocessor Logic Simulation Engines, Ken Wong, Mark A. Franklin
All Computer Science and Engineering Research
The problem considered in this paper is to find an assignment of logic components to processors which will achieve logic simulation speed-ups approaching the ideal for large processor populations. This problem becomes particularly important when a significant portion of the speed-up expected from logic simulation engines is attributed to load sharing (as opposed to obtaining speed-up by employing specialized hardware to carry out specific tasks associated with the simulation process such as event queue manipulation or function evaluation). Our research considers this problem for a particular multiprocessor simulation architecture for which a performance model has bene developed. The model is …
Transaction Network: A Parallel Computation Model Based On Consume/Produce Paradigm, Takayuki Dan Kimura
Transaction Network: A Parallel Computation Model Based On Consume/Produce Paradigm, Takayuki Dan Kimura
All Computer Science and Engineering Research
This report introduces a new parallel computation model that is suitable for pursuit of large scale concurrency. Our goal is to develop a semantically clean paradigm for distributed computation with fine-grained parallelism. Our approach is to demote the notion of process as the key concept in organizing large scale parallel computation. We promote, instead, the notion of transaction, an anonymous atomic action void of internal state, as the basic element of computation. We propose to organize a computation as a network, called a transaction net, of databases connected by transactions. A transaction, when it is fired, consumes data objects from …
Advanced Communications Systems, Jonathan S. Turner
Advanced Communications Systems, Jonathan S. Turner
All Computer Science and Engineering Research
The Advanced Communication Systems Project is concerned with new communication technologies that can support a wide range of different communication applications in the context of large public networks. Communications networks in common use today have been tailored to specific applications and while they perform their assigned functions well, they are difficult to adapt to new uses. There currently are no general purpose networks, rather there are telephone networks, low-speed data networks and cable television networks. As new communications applications proliferate, it becomes clear that in the long term, a more flexible communications infrastructure will be needed. The Integrated Services Digital …
Prodb: An Experimental Generalized Database System User's Manual, Guillermo R. Simari
Prodb: An Experimental Generalized Database System User's Manual, Guillermo R. Simari
All Computer Science and Engineering Research
The following notes document in a succinct manner the use of the system PRODB. The system is still evolving and several new features are in the process of being added. PRODB is a prototype system that is being used as an exploration vehicle of the possible extensions to the relational model through logic programming. The system consists of a relational database system having a relational algebra type language as a query language. It is written in Prolog and it extends the capabilities of Prolog predicates with the relational algebra operators for handling the database structure. The database system currently provides …
Belief Maintenance Systems: Initial Prototype Specification, Roseanne M. Fulcomer, William E. Ball, John P. Tadlock
Belief Maintenance Systems: Initial Prototype Specification, Roseanne M. Fulcomer, William E. Ball, John P. Tadlock
All Computer Science and Engineering Research
A fundamental need in future information systems is an effective method of accurately representing and monitoring dynamic, real-world situations inside a computer. Information is represented using an Extended Open World Assumption (EOWA), in which the data are explicitly true or false. Reasoning within the EOWA is done through the use of a dynamic dependency net which only represents those beliefs and justifications that are both currently valid and in current use. In this paper, we present definitions and uses of the EOWA and dynamic dependency net in our current research of developing a database with which we can use deductive …
A Unified Approach To Mixed-Mode Simulation, Roger D. Chamberlain, Mark A. Franklin
A Unified Approach To Mixed-Mode Simulation, Roger D. Chamberlain, Mark A. Franklin
All Computer Science and Engineering Research
This paper presents a unified approach to mixed-mode simulation. It investigates the algorithms for both logic and circuit simulation, considering their similarities and differences, and a general framework is presented for integrating the two algorithms in uniform manner. The time advance mechanisms and component functional evaluations of the algorithms are show to be similar in nature, and mechanisms for the translation of information represented uniquely in the two algorithms are given. The resulting integrated algorithms is capable of performing mixed-mode simulation, where a circuit is partitioned into discrete and continuous regions, and each region is simulated at the appropriate level. …
A Compiler For A Two-Dimensional Programming Language, Julie Wing Kam Choi
A Compiler For A Two-Dimensional Programming Language, Julie Wing Kam Choi
All Computer Science and Engineering Research
A visual programming language is presented. This language uses interactive graphics to convey notion such as subroutine, recursion, block structure, parallel and serial processing to school children. Currently the system is interpreter based. To overcome the inefficiency of the interpreter based system, a compiler is implemented for this language. This report gives an overview of the compiler and the details about the parser, semantic analyzer and the code generator. Finally, a performance comparison between the interpreter based system and the compiler based system is given.
Progressive Coding And Transmission Of Digital Diagnostic Pictures, Sharaf E. Elnahas, Kou-Hu Tsou, Jerome R. Cox, Rexford L. Hill, R. Gilbert Jost
Progressive Coding And Transmission Of Digital Diagnostic Pictures, Sharaf E. Elnahas, Kou-Hu Tsou, Jerome R. Cox, Rexford L. Hill, R. Gilbert Jost
All Computer Science and Engineering Research
In radiology, as a result if the increased utilization of digital imaging modalities, such as computed tomography (CT) and magnetic resonance imaging (MRI), over a third of the images produced in a typical radiology department are currently in digital form, and this percentage is steadily increasing, Image compression provides a means for the economical storage and efficient transmission of these diagnostic pictures. The level of coding distortion than can be accepted for clinical diagnosis purposes is not yet well-defined. In this paper we introduce some constraints on the design of existing transform codes in order to achieve progressive image transmission …
Show And Tell User's Manual, Peter Mclain, Takayuki Dan Kimura
Show And Tell User's Manual, Peter Mclain, Takayuki Dan Kimura
All Computer Science and Engineering Research
The purpose of this report is to introduce essential features of the Show and Tell Language system to those computer users who are already familiar with some high-level programming language such as FORTRAN, BASIC or PASCAL. This manual is not intended for school children. Some familiarity with the Macintosh user interface and the MacPaint application program is assumed. It is also assumed that the Show and Tell application program disk and the Sample program are available to the reader. The basic programming concepts in Show and Tell are introduced in Chapter Three. The reader may find it easer to start …
A Systolic Parsing Algorithm For A Visual Programming Language, Adam W. Bojanczyk, Takayuki Dan Kimura
A Systolic Parsing Algorithm For A Visual Programming Language, Adam W. Bojanczyk, Takayuki Dan Kimura
All Computer Science and Engineering Research
In this paper we consider a problem of parsing a two-dimensional visual programming language Show and Tell on a two-dimensional array of processors. A program in Show and Tell is a bit-mapped, two-dimensional pattern satisfying a certain set of grammatical rules. The pattern consists of partially ordered set of rectilinear boxes and arrows distributed over the space of nxn pixel area. The corresponding directed graph, the box graph, where boxes are nodes and arrows are directed edges, may not have a cycle in a Show and Tell program. The cycle detection is the most computationally intensive stage of the parsing …
Lsim User Manual, Roger D. Chamberlain
Lsim User Manual, Roger D. Chamberlain
All Computer Science and Engineering Research
Lsim is a gate/switch level digital logic similar. It enables users to model digital circuits both at the gate and switch level and incorporates features that support investigation of the simulation task itself. This user's manual describes the procedures used to specify a circuit to lsim and control the simulation of the circuit (i.e., specifying inputs vectors, running the simulation, and monitoring output signals).
Statistics On Logic Simulation, K. F. Wong, Mark A. Franklin, Roger D. Chamberlain, B. L. Shing
Statistics On Logic Simulation, K. F. Wong, Mark A. Franklin, Roger D. Chamberlain, B. L. Shing
All Computer Science and Engineering Research
The high costs associated with logic simulation of large VLSI based systems have led to the need for new computer architectures tailored to the simulation task. Such architecture have the potential for significant speedups over standard software based logic simulators. Several commercial simulation engines have been produced to satisfy need in this area. To properly explore the space of alternative simulation architectures, data is required on the simulation process itself. This paper presents a framework for such data gathering activity by first examining possible sources of speedup in the logic simulation task, examining the sort of data needed in the …
On The Probable Performance Of Graph Coloring Algorithms, Jonathan S. Turner
On The Probable Performance Of Graph Coloring Algorithms, Jonathan S. Turner
All Computer Science and Engineering Research
We define a natural probability distribution over the set of k-colorable graphs on n vertices and study the probable performance of several algorithms on graphs selected from this distribution. The main results are listed below. • We describe an algorithm to determine if a given n vertex graph is k-colorable, which runs in time O(n + m log k), where m is the number of edges. We show that this algorithm can successfully identify almost all random k-colorable graphs for constant or slowly growing values of k. • We show that an algorithm proposed by Brelas, and justified on experimental …
Collecting Data About Logic Simulation, Roger D. Chamberlain, Mark A. Franklin
Collecting Data About Logic Simulation, Roger D. Chamberlain, Mark A. Franklin
All Computer Science and Engineering Research
Design of high performance hardware and software based gate-switch level logic simulators requires knowledge about the logic simulation process itself. Unfortunately, little data is publically available concerning key aspects of this process. An example of this is the lack of published empirical measurements relating to the time distribution of events generated by such simulators. This paper presents a gate-switch level logic simulator lsim which is oriented towards the collection of data about the simulation process. The basic components of lsim are reviewed, and its relevant data gathering facilities are discussed. An example is presented which illustrates the use of lsim …
Ads Formal Semantics, Takayuki Kimura
Ads Formal Semantics, Takayuki Kimura
All Computer Science and Engineering Research
Abstract Database System (ADS) is a data model developed for an enduring medical information system where frequent changes in the conceptual schema are anticipated and multi-level abstraction is required. The mechanism of abstraction in ADS is based on the abstraction operator of the lamba calculus. The formal semantics of a subset of the ADS model is presented using the denotational specification method.
Some Design Considerations For Picture Archiving And Communication Systems, J. R. Cox, G. J. Blaine, R. L. Hill, R. G. Jost, C. D. Shum
Some Design Considerations For Picture Archiving And Communication Systems, J. R. Cox, G. J. Blaine, R. L. Hill, R. G. Jost, C. D. Shum
All Computer Science and Engineering Research
Design considerations for picture archiving and communication systems are reviewed with special emphasis on those issues that differ from conventional network architectures. Design equations for three layers of a picture network are developed and discussed in the context of preliminary estimates of the flow of digital images between a multiplicity of picture sources, picture archives and picture viewing stations. Discussions of differences from conventional networks focuses on the local nature of the net, the availability of a wide-band transmission media with low error rates, the relative costliness of network equipment capable of taking advantage of the wide-band transmission media and …
Octal-Tree Spatial Sorting And Its Applications, Jeffrey L. Posdamer
Octal-Tree Spatial Sorting And Its Applications, Jeffrey L. Posdamer
All Computer Science and Engineering Research
An octal tree subdivision recursively divides a bounded three-dimensional volume into octanta about an internal division point. This scheme has been used to represent cellular or enumerated voxel models of solid objects. Given one or more sets of points sampled from the surface of a solid, an octal tree may be generated in which each leaf node contains m or less points. By specifying the tree traversal rule, the points are accessed in a sorted order. By defining m=3, a divide-and-conquer surface triangulation algorithm may be developed which does not require special sampling conditions (such as co-planarity) on subsets of …
An Abstract Model Of Unstratified Database System, Takayuki D. Kimura, Jerome R. Cox Jr., Will D. Gillett
An Abstract Model Of Unstratified Database System, Takayuki D. Kimura, Jerome R. Cox Jr., Will D. Gillett
All Computer Science and Engineering Research
A semantic data model is introduced with the following capabilities: (1) Abstraction mechanisms for aggregation, generalization and classification, (2) Unstratified control of the database content, (3) Refined control of intentional and extensional information, and (4) Extensive semantic consistency checking. The basic features of the model are illustrated through a scenario of interactions between the user and the database system (using the proposed model) for constructing a simple database on technical publications.
Design Studies Suggested By An Abstract Model For Medical Information System, Jerome R. Cox Jr., Takayuki D. Kimura, P. Moore, Will D. Gillett, Mishell J. Stucki
Design Studies Suggested By An Abstract Model For Medical Information System, Jerome R. Cox Jr., Takayuki D. Kimura, P. Moore, Will D. Gillett, Mishell J. Stucki
All Computer Science and Engineering Research
We have developed a formal model of a database system that is unusual in that it has the ability to represent information about its own structure and to insure semantic consistency. The model distinguishes general laws from instances of events and objects, but many of its mechanisms serve both categories of information. The model form a substrate upon which an information structure appropriate to neonatology is being developed. Some example queries are shown and a design study for an associative memory suggested by the model is described briefly.
Synchronization Strategies, Mishell J. Stucki, Jerome R. Cox Jr
Synchronization Strategies, Mishell J. Stucki, Jerome R. Cox Jr
All Computer Science and Engineering Research
Computing systems are now frequently composed of independently clocked subsystems that cooperate to perform the function desired for the whole. This type of architecture has many advantages and promises to be the standard for the foreseeable future. With the trend towards more and more gates per chip, the number of chips per subsystem gets smaller and smaller, and we can expect to soon see one or more subsystems per chip. This transition will require contributions from disciplines previously outside the field of chip design, and every issue will have to be carefully worked out beforehand because debugging chips of this …