Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 10 of 10
Full-Text Articles in Computer Engineering
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 …
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.
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 …
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, …
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 …
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 …
Energy-Related Feature Abstraction For Handwritten Digit Recognition, Thomas H. Fuller Jr.
Energy-Related Feature Abstraction For Handwritten Digit Recognition, Thomas H. Fuller Jr.
All Computer Science and Engineering Research
Most handwritten character recognizers use either graphical (static) or first-order dynamic data. Our research speculates that the mental signal to write a digit might be partially encoded as an energy profile. We used artificial neural networks (ANN) to analyze energy-related features (first and second time derivatives) of handwritten digits of 20 subjects and later 40 subjects. An experimenal environment was developed on a NeXTstation with a real-time link to a pen-based GO computer. Although such an experiment cannot confirm an energy profile encoded in the writer, it did indicate the usefulness of energy-related features by recognizing 94.5% of the 600 …