Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (698)
- Computer Engineering (684)
- Computer Sciences (683)
- Mechanical Engineering (209)
- Electrical and Computer Engineering (16)
-
- Optics (14)
- Physics (14)
- Bioimaging and Biomedical Optics (8)
- Biomedical Engineering and Bioengineering (8)
- Chemistry (8)
- Physical Chemistry (8)
- Electromagnetics and Photonics (6)
- Applied Mathematics (3)
- Atomic, Molecular and Optical Physics (3)
- Nanoscience and Nanotechnology (3)
- Biochemistry, Biophysics, and Structural Biology (2)
- Biological and Chemical Physics (2)
- Chemicals and Drugs (2)
- Digital Communications and Networking (2)
- Life Sciences (2)
- Medicine and Health Sciences (2)
- Numerical Analysis and Computation (2)
- Signal Processing (2)
- Amino Acids, Peptides, and Proteins (1)
- Analytical, Diagnostic and Therapeutic Techniques and Equipment (1)
- Biochemistry (1)
- Biophysics (1)
- Catalysis and Reaction Engineering (1)
- Chemical Engineering (1)
- Keyword
-
- Mems411 (9)
- Single-molecule localization microscopy (4)
- Fluorescence microscopy (3)
- Molecules (3)
- Rotational diffusion (3)
-
- Diffusion (2)
- Distributed Embedded Systems (2)
- Fluorescence (2)
- Logic simulation (2)
- Nanoparticles (2)
- Photons (2)
- Point spread functions (2)
- Polymers (2)
- Real-Time Middleware (2)
- Rotational dynamics (2)
- Super resolution microscopy (2)
- Thin films (2)
- 3D super-resolution fluorescence microscopy (1)
- AHE (1)
- Acoustic analysis (1)
- Acoustic sensing (1)
- Acoustic source identification (1)
- Adaptive and reflective middleware (1)
- Adaptive real-time image transmission. (1)
- Algorithms (1)
- Amyloid aggregation (1)
- Amyloid beta-peptides (1)
- Amyloid-beta peptides (1)
- Anytime algorithms (1)
- Automated thresher (1)
- Publication Year
- Publication
-
- All Computer Science and Engineering Research (683)
- Mechanical Engineering Design Project Class (183)
- Washington University / UMSL Mechanical Engineering Design Project JME 4110 (26)
- Electrical & Systems Engineering Publications and Presentations (16)
- Computer Science and Engineering Publications and Presentations (1)
Articles 901 - 911 of 911
Full-Text Articles in Engineering
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 …