Open Access. Powered by Scholars. Published by Universities.®
Articles 31 - 41 of 41
Full-Text Articles in Computer Engineering
Trainrec: A System For Training Feedforward & Simple Recurrent Networks Efficiently And Correctly, Barry L. Kalman, Stan C. Kwasny
Trainrec: A System For Training Feedforward & Simple Recurrent Networks Efficiently And Correctly, Barry L. Kalman, Stan C. Kwasny
All Computer Science and Engineering Research
TRAINREC is a system for training feedforward and recurrent neural networks that incorporates several ideas. It uses the conjugate-gradient method which is demonstrably more efficient than traditional backward error propagation. We assume epoch-based training and derive a new error function having several desirable properties absent from the traditional sum-of-squared-error function. We argue for skip (shortcut) connections where appropriate and the preference for a sigmoidal yielding values over the [-1,1] interval. The input feature space is often over-analyzed, but by using singular value decomposition, input patterns can be conditioned for better learning often with a reduced number of input units. Recurrent …
A Characterization Of The Computational Power Of Rule-Based Visualization, Kenneth C. Cox, Gruia-Catalin Roman
A Characterization Of The Computational Power Of Rule-Based Visualization, Kenneth C. Cox, Gruia-Catalin Roman
All Computer Science and Engineering Research
Declarative visualization is a paradigm in which the process of visualization is treated as a mapping from some domain (typically a program) to an image. One means of declaring such mappings is through the use of rules which specify the relationship between the domain and the image. This paper examines the computational power of such rule-based mappings. Computational power is measure using three separate criteria. The first of these uses the Chomsky hierarchy, in which computational power is treated as string-acceptance; with this criterion we are able to show that certain rule-based models are equivalent in power to Turing machines. …
Logical Interference In Symmetric Connectionist Networks, Gadi Pinkas
Logical Interference In Symmetric Connectionist Networks, Gadi Pinkas
All Computer Science and Engineering Research
This work delineates the relation between logic and symmetric neural networks. The motivation is two-fold: 1) to study the capabilities and limitations of connectionist networks with respect to knowledge representatoin; and 2) to develop a new kind of inference negine that is expressive, massively parallel, capable of coping with nonmonotonic or noisy knowledge and capable of learning. The thesis shows that propositional logic can be implemented efficiently in networks where hidden units allow the representation of arbitrary constraints. An inference engine is constructed which can obtain its knowledge either by compiling symbolic rules or by learning them inductively from examples. …
A Comparison Study Of The Pen And The Mouse In Editing Graphic Diagrams, Ajay Apte, Takayuki Dan Kimura
A Comparison Study Of The Pen And The Mouse In Editing Graphic Diagrams, Ajay Apte, Takayuki Dan Kimura
All Computer Science and Engineering Research
We report the results of an experiment comparing the merits of the pen and the mouse as drawing devices. For this study a pen-based graphic diagram editor equipped with a shape recognition algorithm was developed on GO's PenPoint operating system. A commercially available drawing program on NeXT was used for mouse-based editing. Twelve CS students were chosen as subjects and asked to draw four different diagrams of similar complexity: two with a pen and the other two with a mouse. The diagrams are chosen from the categories of dataflow visual language, Petri nets, flowcharts, and state diagrams. The results indicate …
A Taxonomy Of Program Visualization Systems, Gruia-Catalin Roman, Kenneth C. Cox
A Taxonomy Of Program Visualization Systems, Gruia-Catalin Roman, Kenneth C. Cox
All Computer Science and Engineering Research
Program visualization may be viewed as a mapping from programs to graphical representations. This simple idea provides a formal framework for a new taxonomy of program visualization systems. The taxonomy is compared briefly against previous attempts to organize the program visualization field. The taxonomic principles and their motivation are explained in detail with reference to a number of existing systems, especially Balsa, Tango, and Pavane.
Asking Questions To Minimize Errors, Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar
Asking Questions To Minimize Errors, Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, Sleiman Matar
All Computer Science and Engineering Research
A number of efficient learning algorithms achieve exact identification of an unknown function from some clas using membership and equivalence queries. Using a standard transformation such algorithms can easily be converted to on-line learning algorithms that use membership queries. Under such a transformation the number of equivalence queries made by the query algorithm directly corresponds to the number of mistakes made by the on-line algorithm. In this paper we consider several of the natural classes known to be learnable in this setting, and investigate the minimum number of equivalence queries with accompanying counterexamples (or equivalently the minimum number of mistakes …
Dna Mapping Algorithms: Synchronized Double Digest Mapping, Jim Daues, Will Gillett
Dna Mapping Algorithms: Synchronized Double Digest Mapping, Jim Daues, Will Gillett
All Computer Science and Engineering Research
A technique called Synchronized Double Digest Mapping (SDDM) is presented; it combines classical Double Digest Mapping (DDM) and Multiple-Restriction-Enzyme Mapping (MREM). Classical DDM is a technique for determining the order of restriction fragments in a clone given three digestions of the clone: a digestion by enzyme1, a digestion by enzyme2, and a digestion by enzyme1 and enzyme2 combined. All algorithms for applying this technique are exponential (in the number of fragments present in the clone) in nature. MREM is an extension of classical high-resolution restriction-fragment mapping of a YAC or a genome, in which the overlaps among a set of …
Fril - A Fractal Intermediate Language, Ron Cytron, David Shields
Fril - A Fractal Intermediate Language, Ron Cytron, David Shields
All Computer Science and Engineering Research
This document describes the motivation, language description, and experience using FrIL, an intermediate language for a compiler's "middle-end." FrIL has subbessfully supported a two-semester compiler construction sequence, where the first semester included code generation from a C-like language and the second semester included advanced data flow analysis and program transformation.
The Pessimism Behind Optimistic Simulation, George Varghese, Roger D. Chamberlain, William E. Weihl
The Pessimism Behind Optimistic Simulation, George Varghese, Roger D. Chamberlain, William E. Weihl
All Computer Science and Engineering Research
In this paper we make an analogy between the time that storage must be maintained in an optimistic simulation and the blocking time in a conservative simulation. By exploring this analogy, we design two new Global Virtual Time (GVT) protocols for Time Warp systems. The first simple protocol is based on the null message scheme proposed for clock advancement in some conservative approaches; this yields what we call Local Guaranteed Time. Our main contribution is a second new protocol that is inspired by Misra's circulating marker scheme for deadlock recovery in conservative simulations, and appears to have advantages over previous …
The Washington University Multimedia Explorer, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts, Craig Horn
The Washington University Multimedia Explorer, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts, Craig Horn
All Computer Science and Engineering Research
The Washington University MultiMedia eXplorer (MMX) is a complete, host-independent multimedia system capable of transmitting and receiving JPEG-compressed video, CD-quality audio, and high-resolution radiographic images over the Washington University broadband ATM network. If the host is equipped with an ATM interface card, normal network traffic is supported via "T" and "Y" connections. The MMX consists of an ATMizer and three multimedia subsystems. The ATMizer implements the host interface, the interface to the ATM network, and the interface to the three multimdeia channels. This paper describes the architecture of the MMX, the software used with the system, and the applications which …
Rule-Maker's And Rule-Follower's Meaning, R. P. Loui
Rule-Maker's And Rule-Follower's Meaning, R. P. Loui
All Computer Science and Engineering Research
No abstract provided.