In Southern Oregon, grass seed production occupies a small acreage, but is an important part of agronomic crop production. The high value of sod quality bentgrass seed (Agrostis palustris Huds.) led to some growers supplementing soil fertilizers with foliar fertilizers in an attempt to increase seed yield. However, this practice...
The objectives of this trial were to:
1. Compare onion yield under surge irrigation with continuous flow irrigation.
2. Estimate irrigation efficiency under surge irrigation and continuous flow irrigation.
3. Compare estimates of nitrogen leaching under surge irrigation with continuous flow irrigation.
The potential of mechanically applied straw mulch to reduce nutrient, pesticide and sediment losses from furrow irrigated onions and increase water use efficiency was evaluated on a Nyssa silt loam with three percent slope. Nitrogen and phosphorus losses in the runoff were of particular interest, both because of their economic...
Surface crusting of soil after planting can result in poor emergence and reduced stands. The use of polysaccharides and polyelectrolytes for soil conditioning has been found to improve seedling emergence. This trial evaluated the use of a molasses and nutrient based soil conditioner (Bright Sun Soil Booster, Cargill Inc., Minneapolis,...
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.
We define simple population models and give seven examples from the literature. We investigate visualization techniques for simple population models and demonstrate these techniques on the seven population models. The visualization techniques are basic curves, spiral plots, time plots, bifurcation maps, time-plus-2 curves, and B&W and color complex convergence plots....
Suffix trees are a well known data structure for facilitating a variety of queries on strings. Construction of the trees requires a considerable number of choices concerning the implementation. Several of those choices are examined in this paper. Performance studies are presented that reveal the consequences of these choices. The...
The problem addressed in this paper is that of usability of the Petri Net Editor used to create applications in the Objex framework. This editor puts a lot of burden on the user, in that the user needs to remember all the GUI resources previously created for the application, has...
A structural active-object systems (SAOS) is a, transition-based object-oriented system consisting of a collection of interacting structural active objects (SAOs), which can be structurally and hierarchically composed from their component SAOs. The behaviors of SAOs are determined by the transition statements provided in their class definitions. Various concurrent systems such...
In this paper, we present two systolic designs of a chip that can be used to perform Modular Multiplication. The time taken by these two designs is 5n and 3n respectively, where n is the number of digits. These designs are based on Montgomery's redc algorithm. We also present an...
A problem with a number of available parallel programming tools proposed and implemented by researchers is that there has been little consideration of the impact of the user interface on users outside the field of computer science.
In this paper we propose and implement Banger, an extension to the Parallel...
This volume contains the papers accepted for the informal workshop on Knowledge Compilation and Speedup Learning held along with the Machine Learning Conference in Aberdeen Scotland. This workshop is a sequel to the first Knowledge Compilation workshop, which was organized by Jim Bennett, Tom Dieterich, and Jack Mostow in Otter...
Until now, most hypertext systems have been implemented on large scale computers. With improvements in microprocessors and development of graphical user interfaces, personal computers can run systems that previously needed the power of a mainframe. The low costs and widespread use of PCs will enable many people to use hypertext...
In this project we have designed a new construction method for t error correcting constant weight codes. This method is an improvement over the existing codes in terms of information rate. The construction method is recursive as it is based on the observation that 2t error correcting code can be...
Development of graphical user interface (GUI) applications is difficult since the process can be both complicated and tedious. We propose a solution directed at reducing programming time and effort required to build a GUI application. Our solution is based on the Petri Network, the Oregon SpeedCode Universe (OSU) Application Framework,...
To ease the process of building GUI applications, we constructed an object-oriented application framework called Objex which defines much of an application's standard user interface and operating behavior. By incorporating the MVC (Model-ViewController) interaction model in the framework, design as well as code is reused by all applications derived from...
Most designers of object-based languages adopt a reference model of variables without explicit justification, despite its wide ranging consequences. This paper argues that the traditional container model of variables is more efficient than the reference model, nearly as flexible, and more appropriate to parallel and distributed systems. The topics addressed...
The coverage of a learning algorithm is the number of concepts that can be learned by that algorithm from samples of a given size. This paper asks whether good learning algorithms can be designed by maximizing their coverage. The paper extends a previous upper bound on the coverage of any...
This paper applies learning techniques to make engineering optimization more efficient and reliable. When the function to be optimized is highly non-linear, the search space generally forms several disjoint convex regions . Unless gradient-descent search is begun in the right region, the solution found will be suboptimal. This paper formalizes...
Visual Fortran D (VFD) is a graphical tool to assist parallel programmers in specifying data distributions. Its target is Fortran D, an extension to Fortran77 or Fortran90 which supports data parallelism. VFD provides an intuitive framework where the user employs simple, fast graphical manipulations to specify how data is to...
Dataparallel C is a SIMD style data-parallel programming language for MIMD computers. Dataparallel Chas been implemented on both shared memory (Sequent) and distributed memory (Intel and nCUBE) computers. Here we analyze the strengths and weaknesses of Dataparallel C by comparing the performance of compiled Dataparallel C programs with the performance...
This paper describes efficient methods for exact and approximate implementation of the MIN-FEATURES bias, which prefers consistent hypotheses definable over as few features as possible. This bias is useful for learning domains where many irrelevant features are present in the training data.
We first introduce FOCUS-2, a new algorithm that...
Application programming has become increasingly difficult because of the high demands of creating a Graphical User Interface. One solution to this problem is to provide an object oriented application framework which provides much of the functionality of the GUI in a reusable library. However, application frameworks do not provide reusable...
The Oregon Speedcode Universe v3.0 (OSU v3.0) has a class hierarchy designed and implemented to be portable to other platforms because there are few operating system dependent routines used in it. What needed to be ported were the 46 Application Framework Classes (Application Framework) and the 15 Shape Classes (Shape...
Understanding of techniques that can be used to develop software for various parallel machines has not fully matched the dramatic progress in hardware in recent years. Most parallel programming techniques have been closely tied to specific hardware. Different machines have different primitives and architectures. Programming and porting an application with...
Application supporting a Graphical User Interface (GUI) are difficult to create. Their inherent complexity, their interdependence with many other disciplines, and the inadequacy of the existing tools leave the programmer with too much to do. In particular, almost no help is provided to create application-specific code. Some visual formalisms such...
We have developed SearchPak, a machine independent parallel searching tool on shared and distributed memory machines. It can be used for combinatorial optimization problems and OR-parallel computations as well. Both depth-first and best-first search of the state space can be performed using the SearchPak. With SearchPak, a user just provides...
Software development has been characterized by severe schedule slippage, cost overrun and the inability of the developer to estimate with acceptable accuracy the resources and schedule required early in the requirements analysis and functional design phase when critical investment decisions must be made. This estimation difficulty has emerged as one...
Software applications that successfully employ a grap ica user interface to display and manipulate their data are recognized as easy to use and difficult to implement. While the complexity of such applications has increased dramatically, the tools available to application designers have not advanced at the same pace. Current tools...
Crops were grown at the experimental farms using accepted cultural practices within the limits of experimentation or trials were conducted on growers' fields. Most experiments were designed as randomized complete blocks with two to five replications. Herbicide treatments were applied uniformly with precision plot sprays or granular formulations were distributed...
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Reprinted July 1992. Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Reprinted July 1992. Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog
Facts and recommendations in this publication may no longer be valid. Please look for up-to-date information in the OSU Extension Catalog: http://extension.oregonstate.edu/catalog