Although Mexico is one of the major lime producing countries in the world the crop is not completely utilized. In this paper some ideas are reviewed in relation to various possible products that can be obtained from the efficient processing of limes. Among these are the extraction of the juice,...
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
This report includes information concerning experimental use of unregistered pesticides or unregistered uses of pesticides. Experimental results should not be interpreted as recommendations for use. Use of unregistered materials or use of any registered pesticides inconsistent with its label is against both Federal Law and State Law.
The general problem of classroom scheduling is well known to be NP-complete. A typical classroom scheduling problem is that of assigning students to a limited number of pieces of laboratory equipment. Frequently several identical pieces of equipment are available only at fixed hours and have limited access due to physical...
Topological Sorting is a standard computation performed on finite partial order relations, for which efficient algorithms are well known.
This work is a study of using a depth-first search of a directed graph to implement topological sorting algorithms. A new algorithm is presented, along with a discussion of how it...
This paper describes a real time garbage collection algorithm. It allocates storage automatically from a heap, and does not require the programmer to give any indication that particular items are no longer useful or accessible. A garbage collection algorithm is considered to be real time if the amount of work...
Information derived from a Landsat Multispectral Scanner CMSS) scene can be used to assign individual pixels, each representing about one acre on the Earth's surface, to natural resource classes, A lineprinter can be used to generate a 1:24,000 scale map of the scene in which each symbol corresponds to a...
University Honors Program Senior Project.
Many times the study of the behavior of an algorithm can be inhibited by the inability to actually see exactly what the algorithm does. Static diagrams and verbal descriptions are often not enough to provide real insight into the behavior of an algorithm. It would...
Over the past few years Qualitative Reasoning about physical systems has emerged strongly as an important area in Artificial Intelligence. Many qualitative reasoning formalisms have been developed and applied to varied domains, namely, hydraulic systems, electrical systems, industrial control etc.
This paper examines Qualitative Process Theory [Forbus 84] formalism in...
The Columbia River Gillnetter is the pilot of the Lower Columbia River commercial fishing industry, keeping fishermen and the public in touch with today's important issues.
The Columbia River Gillnetter is the pilot of the Lower Columbia River commercial fishing industry, keeping fishermen and the public in touch with today's important issues.
The Columbia River Gillnetter is the pilot of the Lower Columbia River commercial fishing industry, keeping fishermen and the public in touch with today's important issues.
The Columbia River Gillnetter is the pilot of the Lower Columbia River commercial fishing industry, keeping fishermen and the public in touch with today's important issues.
The Columbia River Gillnetter is the pilot of the Lower Columbia River commercial fishing industry, keeping fishermen and the public in touch with today's important issues.
The Columbia River Gillnetter is the pilot of the Lower Columbia River commercial fishing industry, keeping fishermen and the public in touch with today's important issues.
We present an extended mapping in the Hybrid Uncertainty Manager so that all the components of an influence diagram can be represented. This will allow us to perform decision analysis on a decision problem. Specifically, a representation for decision nodes, value node, and informational arcs will be given. With these...
The Large-Grain Data-Flow (LGDF) Machine is a tightly-coupled multi-processor consisting of several independent nodes, upon each of which may run one or more tasks. These tasks must be able to communicate and synchronize with each other. This document describes a message-passing system developed to meet these requirements.
The message-passing system...
This paper describes the design and implementation of a graphical user interface for construction and evaluation of influence diagrams. Specifically, this paper documents the representation, display and mouse sensitivity of an influence diagram, and the selection facility subsystem. The interface is designed to communicate with the user by a mouse...
This document describes the need for, and design of, diagnostic software that provides circuit verification, fault isolation, and troubleshooting aids. The difference between verification software and true diagnostic software is explained. A modular design of diagnostic software is proposed, consisting of a series of 3-part tests, a test manager, results...
The Sacagawea testbed has been designed to support testing and development of decision making models, and associated uncertainty management techniques, that are appropriate under real-time problem solving constraints. Conceptually, it provides a simulated temporal and spatial environment, the latter consisting of a terrain grid of elevation and tree cover data,...
This report describes "VIGRAM" (Visual Programming) which is a program understanding and complexity metric analysis tool for Pascal programs. VIGRAM is implemented on the Macintosh as one part of the "O.S.U." (Qregon Speedcode Universe) project. With VIGRAM, the source code of a Pascal procedure can be displayed as a visual...
Performance of a reliable storage subsystem for a centralized database system was studied by simulation. The reliable storage subsystem studied consists of three redundant disk units that are updated one at a time from a consistent database state to another consistent database state, Thus, even if a central processor and/or...
This survey looks at five different polygon breaking algorithms and compares them. The criteria for comparison are:
1. Complexity of the algorithm.
2. The number and type of subpolygons produced.
3. The classes of input polygons that can be broken.
The best algorithm is then coded and a comparison is...
Advanced computer architectures are centered around the parallel computer systems. This project is focused on the experiment on two parallel computer architectures : Sequent Balance 21000 shared memory multiprocessor and Cogent XTM distributed system.
A set of benchmark programs are implemented using "C" language and Dynix parallel programming library on...
A theory for resiliency control of distributed database systems is developed, and schemes that preserve the consistent global database state in the presence of site crashes and message link failures are discussed. The schemes can at least theoretically be paired with any concurrency control scheme that produces y-serializable executions. Further,...
It is highly desirable for a distributed database system to achieve logically continuous operation even if some sites or message links fail. In this paper, we describe a scheme that can automatically reconfigure a fully-replicated distributed database system upon subsystem failures. The scheme can tolerate total failures of some sites....
A typical database system maintains target data, which contain information useful for users, and access path data, which facilitate faster accesses to target data. Further, most large database systems support concurrent processing of multiple transactions. For a static database system model, where units of concurrency control are not dynamically created...
In this short paper, we present an implementation method for a distributed commit/ termination protocol for a distributed database system. The protocol, which handles both commit and termination processing of distributed transactions, is represented by communicating Moore machines. Several advantages of our approach are discussed.
A concurrency and resiliency control scheme for a distributed database system with replicated data is discussed. The scheme, true-copy token scheme, uses true-copy tokens in order to designate the physical data copies (true copies) that can be identified with the current logical data that are globally unique, and then it...
ELGDF (Extended Large Grain Data Flow) is a design language that allows representation of a wide variety of parallel programs. The syntax is graphical and hierarchical to allow construction and viewing of realistically sized programs. ELGDF language facilitates describing parallel programs in a natural way for both shared memory model...
Recently several minimal perfect hashing functions far small static word sets have been developed. However, they are limited to sets of 50 words or less. In this paper, a Two Level Minimal Perfect Hash Function for large data sets is given. It partitions a large static set into small sets...
Authentication is a means of developing an electronic signature that works like a written signature. It assumes that your data is publicly known but nevertheless ensures that the message is not tampered with and that you have an audit trail.
This project discusses the techniques and concepts used to design...
Test incorporations are program transformations that improve the performance of generate-and-test procedures by moving information out of the "test" and into the "generator." The test information is said to be "incorporated" into the generator so that items produced by the generator are guaranteed to satisfy the incorporated test. This article...
A complete approach to uncertainty management requires support for interactive and incremental problem formulation, inference, hypothesis ranking, and decision making. In addition, computational models must allow for time and resource bounds. Current approaches to uncertainty management concentrate primarily on inference, provide little or no support for the larger issues in...
In this paper we will describe two known strategies for static processors allocation in an n-cube multiprocessor, namely the buddy system strategy and the gray code strategy and then propose a new strategy that outperforms the first by (n-k+1) and the second by (n-k+1)/2 in cube recognition. Furthermore, our strategy...
One of the most popular topologies is the hypercube, that has n = 2ᵏ processors, numbered 0 to 2ᵏ -1 and connected in such a way that there is a link between any two if and only if they differ in one bit. Its popularity is due to the fact...
A computer program complexity measure is a measure of how easy the program is to understand, test, modify, maintain, etc. Many of these measures are derived from the control or flow graph of the program. We describe these measures graph theoretically, indicate what aspect or aspects of the program they...
Recently generalized Fibonacci numbers have received increasing attention. Some properties that are well known for traditional Fibonacci numbers do not generalize easily, some others do not generalize at all. In this paper we report some properties that we have generalized. Section 1 introduces the notation and a theorem due to...
Two methods for parallelizing WHILE loops are presented. The first method converts a WHILE loop into a FORALL construct, and the second method pipelines a WHILE loop. Each of the methods is based on a transformation that makes explicit the loop counting. Also, we propose two parallel WHILE constructs.
This report presents a graphical tool for implementation of the scheduling heuristics provided by Kruatrachue. The input of scheduling is a task graph and the output is a schedule in the form of a Gantt chart. The implemented scheduling heuristics are: 1) Hu's HLF (highest level first) algorithm. 2) Yu's...
One of the tasks of inequality reasoning is to determine the relationship between two quantities for any given set of qualitative constraints. For implementation of this kind of reasoning, Simmons [1] has provided a technique called the "graph search" (GS). This paper briefly reviews GS technique, then presents an implementation...
Several programming languages define a virtual machine that can be implemented as an interpreter. The interpreter runs more slowly than the real machine. In order to maintain a portable virtual machine for X2 and still achieve acceptable performance, our work compiles X2 procedures into native machine code so that the...
Several problems with user interface design and implementation have been identified: (1) user interfaces are difficult and time-consuming to design and implement; (2) most user interface management systems (UIMS) are themselves difficult to use by a programmer; (3) UIMS's have not been integrated with other tools that support structured design,...
Oregon Speedcode Universe (OSU) is a software development environment for design, implementation, and maintenance of large soft.ware systems. Designed to be highly visual, OSU combines traditional structured analysis techniques found in most CASE tools with advanced graphical user interface management systems (UIMS) found on most contemporary workstations. This paper describes...
We extend previous results for optimally scheduling concurrent program modules, called tasks, on a fixed, finite number of parallel processors in two fundamental ways: (1) we introduce a new heuristic which considers the time delay imposed by message transmission among concurrently running tasks; and (2) we introduce a second heuristic...
A project is described wherein a source code browser was implemented based upon tasks performed by software engineers looking for source code modules with only UNIX utilities. These tasks were discovered by observing the actions of software engineers looking for code modules in a library, The success of the implementation...
Cichelli gave a simple machine independent minimal perfect hashing function for small static sets. The hash function value for a word is computed as the sum of the length of the word and the values associated with the first and last letters of the word. Cichelli's algorithm (word-oriented) to find...
This paper describes the program transformation method used in DataLab, a general-purpose system for the specification and synthesis of abstract data types (ADTs). We present a model for transforming visual specifications of ADTs to imperative code. This model includes two forms of internal representations: one for the ADTs visual specifications...
Seed-Lab, is a software system for managing seed laboratory information. It was developed at the Oregon State University Seed Testing Laboratory. Seed-Lab was built around a database development package Revelation, which provides its own programming language.
Seed-Lab shields the user from the complexities of database management by supporting menu driven...
This paper discusses a new approach to the design of operating systems. We view the jobs or tasks in this system as a number of small independent steps or functions which are sequenced together to produce a desired result. The concepts upon which this operating system is based are drawn...
QCritic is a rule-based critic for analog bipolar circuits. It functions as a post-processor for the SPICE simulator, making use of netlist, current, and voltage data. The program was written in OPS83, and demonstrates good run-time performance on a VAX 11/780. At present, the system contains rules for analyzing circuits...
This paper reviews McCabe's cyclomatic complexity and Halstead's laws; it discusses studies in current literature relating the metrics to software. The studies are reproduced using data obtained from a large software project developed in a major electronics firm. Problems that occur when deriving the metrics are discussed; the result of...
This paper presents a Hypothetical Storage Server for an experimental design database system. The storage server provides unified management of historical versions and hypothetical versions of objects in a design database. The extension of each database object is man.aged as a tree of multiple distinct representatives. One branch of the...
In recent papers on machine learning, the term 'operationalization' has been used to describe the purpose of the learning process. In particular, explanation-based learning systems are said to 'operationalize' the given target concept. Unfortunately, the exact meaning of this term has varied from one paper to another, and frequently the...
Reasoning about physical systems requites the integration of a range of knowledge and reasoning techniques. P. Hayes has named the enterprise of identifying and formalizing the common-sense knowledge people use for th.is task "naive physics." Qualitative Process theory by K. Forbus proposes a structure and some of the content of...
Object oriented programming features information hiding and encapsulation, meaning that 1) each object hides the the implementation details tram access from outside and only a set of methods (interface routines) are visible outside of the object, and 2) changes to the implementation of the object do not require changes to...
This paper addresses the problem of aggregating a number of expert opinions which have been expressed in some numerical form. An important feature of sets of expert opinions is the possibility of stochastic dependence between members of the sets. We develop an approach for combining expert opinions which formally allows...
This tutorial discusses one of the oldest problems in computing: how to search and retrieve keyed information from a list in the least amount of time. Hashing -- a technique that mathematically converts a key into a storage address -- is one of the best methods of finding and retrieving...
We survey the use of genetic algorithms in function optimization. We find that there are two distinct camps. Holland's camp seems to be interested in artificial intelligence uses of genetic algorithms and seems to have made only a few attempts at function optimization. Rechenberg's camp has concentrated on the optimization...
Detecting instances of software theft and plagiarism is a difficult problem. The statistical analysis of peculiar words or phrases known to be used by an author is a common method of settling authorship disputes in English literature. This paper presents a similar method for identifying authorship of programs. The method...
Programming style guidelines and automated coding style analyzers have been developed without a solid experimental or theoretical basis. In this paper we make a distinction between typographic (layout) style characteristics and the underlying structural style content and then show through controlled studies that this distinction aids in assessing the influence...
We have identified a "book paradigm" for source code formatting which improves program comprehension and assists in maintenance work. The book paradigm can be implemented by reverse engineering code listings into a "book" with preface, tab1es of contents, chapters, sections, indices and pagination. This reverse engineering effectively reorganizes source code...
Using Smalltalk-80, programmers can produce prototypes much faster than with C or Pascal. What techniques do Smalltalk-80 programmers use to produce these prototypes? What is special about Smalltalk-80 that enables them to uses these techniques? Can these techniques be used with conventional languages such as C? In an attempt to...
Several years ago we began development of an object-based programming language and environment which we call X2. We implemented X2 using a virtual machine similar to Smalltalk-80 implementations, but X2 does no message look-up. The implementation differs from most Smalltalk-80 systems in that objects are paged and in the ability...
The term object-oriented is defined. This definition is then related to message-passing, inheritance, polymorphism, data abstraction, generics, and overloading.
Information is often incomplete in databases, and nulls are required to represent missing or unknown data; however, many difficulties occur with nulls. In his 1983 text, C. J . Date rejected outer join of relations with nulls mainly due to a perceived problem with functional dependencies (FDs): when nulls are...
This paper formalizes a new learning from examples problem: identifying a correct concept definition from positive examples such that the concept is some specialization of a target concept defined by a domain theory. This paper describes an empirical study that evaluates three methods for solving this problem: explanation based generalization...
This paper introduces a method that improves the performance of a problem solver by reformulating its domain theory into one in which functionally relevant features are explicit in the syntax. This method, in contrast to previous reformulation methods, employs sets of training examples to constrain and direct the reformulation process....
Two powerful reasoning tools have recently appeared, logic programming and assumption based truth maintenance systems (ATMS). An ATMS offers significant advantages to a problem solver: assumptions are easily managed and the search for solutions can be carried out in the most general context first and in any order. Logic programming...
We introduce five criteria by which to judge the suitability of a method for solving the problem of learning concepts from examples: correctness (the correct concept should be identified), performance efficiency (the learned definition should be efficient to apply to the performance task), flexibility (the method should be able to...
This paper presents a model for deterministic parsing which was designed to simplify the task or writing and understanding a deterministic grammar. While retaining structures and operations similar to those or Marcus's PARSIFAL parser [Marcus 80] the grammar language incorporates the following changes. (1) The use or productions operating in...
Production Systems are languages widely used for the implementation of Artificial Intelligence projects. They support programs in which the sequence of instructions is not fully determined at the beginning of their execution, as well as 'event driven' programs (i.e. the occurrence of a particular element in the data set determines...
We investigate several methods of computing Fibonacci numbers quickly and generalize some properties of the Fibonacci numbers to degree r Fibonacci (R-nacci) numbers. Sections 2 and 3 present several algorithms for computing the traditional, degree two, Fibonacci numbers quickly. Sections 4 and 5 investigate the structure of the binary representation...
Within a decade, the amount of raw data acquired each day by satellite -based instrumentation will exceed 1 terabyte (10¹² bytes). Virtually all quantitative data acquired about the Earth is useful [10]. Processing the raw data into useful information will be an enormous task . Much of the current data...
The Sacagawea testbed has been designed to support testing and development of decision making models, and associated uncertainty management techniques, that are appropriate under real-time problem solving constraints. Conceptually, it provides a simulated temporal and spatial environment, the latter consisting of a terrain grid of elevation and tree cover data,...