Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (29)
- Computer Sciences (26)
- Computer and Systems Architecture (11)
- Electrical and Computer Engineering (7)
- OS and Networks (5)
-
- Systems and Communications (4)
- Electrical and Electronics (3)
- Electromagnetics and Photonics (3)
- Optics (3)
- Other Electrical and Computer Engineering (3)
- Physics (3)
- Digital Communications and Networking (2)
- Digital Circuits (1)
- Engineering Education (1)
- Hardware Systems (1)
- Operations Research, Systems Engineering and Industrial Engineering (1)
- Other Computer Engineering (1)
- Other Operations Research, Systems Engineering and Industrial Engineering (1)
- Robotics (1)
- Systems Architecture (1)
- Theory and Algorithms (1)
- VLSI and Circuits, Embedded and Hardware Systems (1)
- Institution
- Keyword
-
- Engineering (9)
- College of Engineering and Computer Science (8)
- Computer Science (8)
- Newsletters (8)
- Science news (8)
-
- Technical writing (8)
- Information Retrieval (4)
- Hewlett-Packard computers (3)
- RISC microprocessors (3)
- Computer architecture -- Design (2)
- Discourse and human communication (2)
- Discourse and human interaction (2)
- Discourse level structure. (2)
- Information retrieval and discourse (2)
- Operating systems (Computers) (2)
- Operating systems (Computers) -- Evaluation (2)
- Situational information retrieval (2)
- Virtual storage (Computer science) -- Design and construction (2)
- Cedarville (1)
- Component failure (1)
- Computer algorithms (1)
- Computer architecture -- Evaluation (1)
- Computer input-output equipment -- Enhancement (1)
- Computer networks (1)
- Computer software -- Testing (1)
- Computer vision -- Industrial application (1)
- Computerized Conferencing & Communications Center (1)
- Debugging in computer science (1)
- Fault-tolerance (1)
- Fault-tolerant open distribution systems (1)
- Publication
-
- All Computer Science and Engineering Research (10)
- BITs and PCs Newsletter (8)
- College of Engineering and Computing Course Catalogs (8)
- Computer Science Faculty Publications and Presentations (6)
- Electrical and Computer Engineering Faculty Publications (3)
-
- Dissertations and Theses (2)
- Robert Oddy (2)
- School of Information Studies - Faculty Scholarship (2)
- Computer Science: Faculty Publications and Other Works (1)
- Computerized Conferencing and Communications Center Reports (1)
- Department of Electrical and Computer Engineering: Faculty Publications (1)
- Electrical Engineering and Computer Science - All Scholarship (1)
- Electrical and Computer Engineering Faculty Research and Publications (1)
- Engineering News (1)
- Mechanical Engineering Faculty Publications (1)
- Robert A Iannucci (1)
- Theses (1)
- Publication Type
Articles 1 - 30 of 50
Full-Text Articles in Computer Engineering
An Efficient Technique For Finding The Desired Global Optimum Of Robotic Joint Displacement, Paul P. Lin, An-Jen J. Yang
An Efficient Technique For Finding The Desired Global Optimum Of Robotic Joint Displacement, Paul P. Lin, An-Jen J. Yang
Mechanical Engineering Faculty Publications
For an industrial robot on a daily operation basis such as pick and place, it is desired to minimize the robotic joint displacements when moving the robot from one location to another. The objective of the optimization here is to simultaneously minimize a robot end effector's positional error and the robotic joint displacements. By modifying the searching algorithm in the existing complex optimization method, this article presents a technique for finding the desired global optimum solution more efficiently. To compare the optimum searching capability between the proposed and existing searching algorithms, a modified Himmelblau's function is used as an objective …
Efficient Accommodation Of May-Alias Information In Ssa Form, Ron Cytron, Reid Gershbein
Efficient Accommodation Of May-Alias Information In Ssa Form, Ron Cytron, Reid Gershbein
All Computer Science and Engineering Research
We present an algorithm for incrementally including may-alias information into Static Single Assignment form by computing a sequence of increasingly precise (and correspondingly larger) partial SSA forms. Our experiments show significant speedup of our method over exhaustive use of may-alias information, as optimization problems converge well before most may-aliases are needed.
Exact Dominance Without Search In Decision Trees, Nilesh L. Jain, Ronald P. Loui
Exact Dominance Without Search In Decision Trees, Nilesh L. Jain, Ronald P. Loui
All Computer Science and Engineering Research
In order to improve understanding of how planning and decision analysis relate, we propose a hybrid model containing concepts from both. This model is comparable to [Hartman90], with slightly more detail. Dominance is simple concept in decision theory. In a restricted version of our model, we give conditions under which dominance can be detected without search: that is, it can be used as a pruning strategy to avoid growing large trees. This investigation follows the lead of [Wellman87]. The conditions seem hard to meet, but may nevertheless be useful in forward-chaining situations without focus, such as [Breese87]. It may be …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 8, November 1992, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 8, November 1992, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A fourteen page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
The Programmers' Playground: I/O Abstraction For Heterogeneous Distributed Systems, Kenneth J. Goldman, Michael D. Anderson
The Programmers' Playground: I/O Abstraction For Heterogeneous Distributed Systems, Kenneth J. Goldman, Michael D. Anderson
All Computer Science and Engineering Research
A new high-level approach to interprocess communication in heterogeneous distributed systems in introduced, This approach, called I/O Abstraction, allows one to write each functional component of a distributed system as an encapsulated program that acts upon a set of local data structures, some of which may be published for external use. The functional components are separately configured by establishing logical connections among the published data structures. In order to illustrate this approach, we describe the The Programmers' Playground, a high-level language "veneer" and protocol designed to support I/O abstraction in heterogeneous computing environment. Support for communication among programs written in …
Computing Specificity, Ronald Loui, J. Norman, K. Stiefvater, A. Merrill, A. Costello, J. Olson
Computing Specificity, Ronald Loui, J. Norman, K. Stiefvater, A. Merrill, A. Costello, J. Olson
All Computer Science and Engineering Research
This note reports on an effort to implement a version of Poole's rule for specificity. Relatively, efficient implementation relies on correcting and improving a pruning lemma of Simari-Loui [92]. This in turn requires revision of Poole's specificity concept. The resulting system is a usable knowledge representation system with first-order-language and defeasible reasoning. Sample input and output are included in an appendix. It is a good candidate for multiple inheritance applications; it is useful for planning, but limited by the underlying search for plans.
Automatic Surface Mount Solder Joints Inspection, Zhu Liu
Automatic Surface Mount Solder Joints Inspection, Zhu Liu
Theses
This thesis reports the research results on automatic inspection of solder joints on printed circuit boards. The previous work on this subject has been advanced significantly in the following three aspects. With the support of AT&T Bell Lab, the most updated surface mount solder joints are inspected in this work instead of larger simulation solder joints or traditional through hole solder joints in the previous work. A small set of features is extracted for surface mount solder joints in both infrared and visual light inspection. A new image processing software named Khoros has been applied to improve the quality of …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 7, October 1992, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 7, October 1992, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Process And Policy: Resource-Bounded Non-Demonstrative Reasoning, Ronald P. Loui
Process And Policy: Resource-Bounded Non-Demonstrative Reasoning, Ronald P. Loui
All Computer Science and Engineering Research
This paper investigates the appropriateness of formal dialectics as a basis for non-monotonic and defeasible reasoning that takes computational limits seriously. Rules that can come into conflict should be regarded as policies, which are inputs to deliberative processes. Dialectical protocols are appropriate for such deliberations when resources are bounded and search is serial. AI, it is claimed here, is now perfectly positioned to correct many misconceptions about reasoning that have resulted from mathematical logic's enormous success in this century: among them (1) that all reasons are demonstrative, (2) that rational belief is constrained, not constructed, (3) that process and disputation …
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh
Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh
Computer Science: Faculty Publications and Other Works
In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of “congestion” and “dilation” measures for a set of packet paths. We give, for any constant ε > 0, a randomized on-line algorithm for routing any set of N packets in O((Clg^ε(Nd)+Dlg(Nd))/lglg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into account, and d is the longest path in terms of number of wires. We also …
Interaction Of Profiled Light With Contrapropagating Acoustic Waves: Fourier Transform Approach, Partha P. Banerjee, Chen-Wen Tarn, Jaw-Jueh Liu
Interaction Of Profiled Light With Contrapropagating Acoustic Waves: Fourier Transform Approach, Partha P. Banerjee, Chen-Wen Tarn, Jaw-Jueh Liu
Electrical and Computer Engineering Faculty Publications
A straightforward Fourier-transform approach is employed to investigate acousto-optic interaction between an input optical beam with arbitrary profile and contrapropagating cw sound in the Bragg regime. The process can be analyzed in terms of the simultaneous scattering of light by the two sound waves in the interaction region. Analytic expressions for the equivalent transfer functions are obtained and the scattered light profiles are plotted.
Separating Structure From Function In The Specification And Design Of Distributed Systems, Kenneth J. Goldman
Separating Structure From Function In The Specification And Design Of Distributed Systems, Kenneth J. Goldman
All Computer Science and Engineering Research
A distributed system is viewed as a collection of functional components and a unifying structure that defines relationships among the components. In the paper, we advocate a particular approach to distributed system specification and design in which the structure of a distributed system is specified separately from the functional components. This permits one to reason about individual functional components in isolation, and encourages one to make explicit not only the input/output behavior of the functional components but also the logical placement of these components within the overall structure of the system. We describe a new software tool for the specification, …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 6, September 1992, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 6, September 1992, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Dna Mapping Algorithms: Strategies For Single Restriction Enzyme And Multiple Restriction Enzyme Mapping, Will Gillett
Dna Mapping Algorithms: Strategies For Single Restriction Enzyme And Multiple Restriction Enzyme Mapping, Will Gillett
All Computer Science and Engineering Research
An approach to high-resolution restriction-fragment DNA mapping, known as Multiple-Restriction-Enzyme mapping (MRE mapping), is present. This approach significantly reduces the uncertainty of clone placement by using clone ends to synchronize the position in of clones within different maps, each map being constructed from fragment-length data produced by digestion of each clone with a specific restriction enzyme. Maps containing both fragments-length data and clone-end data are maintained for each restriction enzyme, and synchronization between two such maps is achieved by requiring them to have "compatible" clone-end map projections. Basic definitions of different kinds of maps, such as restriction sites maps, restriction …
Can Pac Learning Algorithms Tolerate Random Attribute Noise?, Sally A. Goldman, Robert H. Sloane
Can Pac Learning Algorithms Tolerate Random Attribute Noise?, Sally A. Goldman, Robert H. Sloane
All Computer Science and Engineering Research
This paper studies the robustness of pac learning algorithms when the instances 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 that the truth lies somewhere in between these two alternatives. For uniform attribute noise, in which each attribute is flipped independently at random with the same probability, we present an algorithm that …
Discourse-Level Analysis Of Abstracts For Information Retrieval: A Probabilistic Approach, Robert N. Oddy
Discourse-Level Analysis Of Abstracts For Information Retrieval: A Probabilistic Approach, Robert N. Oddy
Robert Oddy
The objective of this research is to contribute to our knowledge of how people seek information, and how computer systems can be designed to help in this process. Most information retrieval research since the field emerged in the 1950's has reduced these questions to that of trying to determine how documents relevant to a user's query might be selected from a large collection of texts---a question that has proved remarkably difficult to answer. The present work takes the stance that this particular reduction increasingly limits progress towards the objective stated above. It is directed instead towards the development of a …
Discourse-Level Analysis Of Abstracts For Information Retrieval: A Probabilistic Approach, Robert N. Oddy
Discourse-Level Analysis Of Abstracts For Information Retrieval: A Probabilistic Approach, Robert N. Oddy
School of Information Studies - Faculty Scholarship
The objective of this research is to contribute to our knowledge of how people seek information, and how computer systems can be designed to help in this process. Most information retrieval research since the field emerged in the 1950's has reduced these questions to that of trying to determine how documents relevant to a user's query might be selected from a large collection of texts---a question that has proved remarkably difficult to answer. The present work takes the stance that this particular reduction increasingly limits progress towards the objective stated above. It is directed instead towards the development of a …
Analysis Of Multifrequency Dispersive Optical Bistability And Switching In Nonlinear Ring Cavities With Large Medium-Response Times, Pawel Pliszka, Partha P. Banerjee
Analysis Of Multifrequency Dispersive Optical Bistability And Switching In Nonlinear Ring Cavities With Large Medium-Response Times, Pawel Pliszka, Partha P. Banerjee
Electrical and Computer Engineering Faculty Publications
Using a simple model of a ring cavity comprising a cubically nonlinear medium, we analyze dispersive optical bistability in the presence of more than one spectral component. We show the phenomenon of so-called competition for resonance. In addition to presenting cavity characteristics for the cases of two and three different frequencies, we also discuss the general method for finding steady-state solutions and checking their stability. A simple and efficient algorithm, based on a relaxation method, is devised to find steady-state solutions satisfying appropriate boundary conditions. The relaxation dynamics is physically related to a finite response time of the medium.
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 …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 5, May 1992, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 5, May 1992, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A six page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Engineering News, Cedarville College
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 4, April 1992, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 4, April 1992, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 3, March 1992, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 3, March 1992, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Model-Based Target Recognition Using Laser Radar Imagery, Robert Y. Li
Model-Based Target Recognition Using Laser Radar Imagery, Robert Y. Li
Department of Electrical and Computer Engineering: Faculty Publications
Autonomous target recognition can be assisted by using CO2 laser radar data. Of these data, range data provide 3-D geometric information and Doppler data boundaries of moving targets. A powerful 3-D feature extraction algorithm based on the Hough transform is used to obtain the orientations and dimensions of the target. This information is then utilized by an inference procedure that recognizes targets based on the available evidence from the sensory data. The experimental results using actual laser radar imagery are successful and the procedure can be used for the future development of a model-based system for target recognition.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 2, February 1992, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 8, Number 2, February 1992, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Analysis Of Algorithms For Velocity Estimation From Discrete Position Versus Time Data, Ronald H. Brown, Susan C. Schneider Phd, Michael G. Mulligan
Analysis Of Algorithms For Velocity Estimation From Discrete Position Versus Time Data, Ronald H. Brown, Susan C. Schneider Phd, Michael G. Mulligan
Electrical and Computer Engineering Faculty Research and Publications
Algorithms for constructing velocity approximations from discrete position versus time data are investigated. The study is limited to algorithms suitable to provide velocity information in discrete-time feedback control systems such as microprocessor-based systems with a discrete position encoder. Velocity estimators based on lines per period, reciprocal-time, Taylor series expansion, backward difference expansions, and least-square curve fits are presented. Based on computer simulations, comparisons of relative accuracies of the different algorithms are made. The least-squares velocity estimators filtered the effect of imperfect measurements best, whereas the Taylor series expansions and backward difference equation estimators respond better to velocity transients.
Developing Image Processing Tools In X Window System, Xin Zhang
Developing Image Processing Tools In X Window System, Xin Zhang
Dissertations and Theses
The X Window System is an industry-standard software system which facilitates programmers to develop portable graphical user interfaces. This thesis describes an image processing tool developed under the X Window System. A multiwindow image display software with image editing and improvement functions is developed. The software has four modules: environment generation, image creation, image editing and image improvement.
The environment generation module creates working windows, scrollbars, dialogbox and pulldown menu buttons, and tracks mouse cursor positions. The working windows are three adjacent windows allowing display of three different images simultaneously. The dialogbox provides an interface between the user and the …
Eies 2 : A Distributed Architecture For Supporting Group Work, Computerized Conferencing & Communications Center, James Whitescarver, Robert M. Czech, Sreenivas Reddy, Ajaz R. Rana, Murray Turoff
Eies 2 : A Distributed Architecture For Supporting Group Work, Computerized Conferencing & Communications Center, James Whitescarver, Robert M. Czech, Sreenivas Reddy, Ajaz R. Rana, Murray Turoff
Computerized Conferencing and Communications Center Reports
The Computerized Conferencing Center (CCCC) at New Jersey Institute of Technology (NJIT) has been researching on-line group communications for 17 years by developing and studying tools to advance the "collective intelligence". The Electronic Information Exchange System 2 (EIES2) provides a research, development and operational environment for distributed computer supported cooperative work (CSCW) systems. The EIES 2 distributed Smalltalk processor provides for rapid prototyping and implementation of muti-media CSCW facilities in the network environment. The Smalltalk support of the object model, and meta-language properties make it ideally suited for incremental development CSCW applications. The EIES2 communication environment supports a decentralized network …
Center For Computer And Information Sciences Application Package, Nova Southeastern University
Center For Computer And Information Sciences Application Package, Nova Southeastern University
College of Engineering and Computing Course Catalogs
No abstract provided.
Doctor Of Education Specialization In Computing And Information Technology 1992-1993, Nova Southeastern University
Doctor Of Education Specialization In Computing And Information Technology 1992-1993, Nova Southeastern University
College of Engineering and Computing Course Catalogs
No abstract provided.