Resource utilization model for the algorithm to architecture mapping model

The analytical model for resource utilization and the variable node time and conditional node model for the enhanced ATAMM model for a real-time data flow architecture are presented in this research. The Algorithm To Architecture Mapping Model, ATAMM, is a Petri net based graph theoretic model developed at Old Dominion University, and is capable of modeling the execution of large-grained algorithms on a real-time data flow architecture. Using the resource utilization model, the resource envelope may be obtained directly from a given graph and, consequently, the maximum number of required resources may be evaluated. The node timing diagram for one iteration period may be obtained using the analytical resource envelope. The variable node time model, which describes the change in resource requirement for the execution of an algorithm under node time variation, is useful to expand the applicability of the ATAMM model to heterogeneous architectures. The model also describes a method of detecting the presence of resource limited mode and its subsequent prevention. Graphs with conditional nodes are shown to be reduced to equivalent graphs with time varying nodes and, subsequently, may be analyzed using the variable node time model to determine resource requirements. Case studies are performed on three graphs for the illustration of applicability of the analytical theories

Strategies for concurrent processing of complex algorithms in data driven architectures

Research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a special distributed computer environment is presented. This model is identified by the acronym ATAMM which represents Algorithms To Architecture Mapping Model. The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation

Strategies for concurrent processing of complex algorithms in data driven architectures

The results of ongoing research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a spatial distributed computer environment is presented. This model is identified by the acronym ATAMM (Algorithm/Architecture Mapping Model). The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to optimize computational concurrency in the multiprocessor environment and to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation

Simulator for concurrent processing data flow architectures

A software simulator capability of simulating execution of an algorithm graph on a given system under the Algorithm to Architecture Mapping Model (ATAMM) rules is presented. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. Investigating the behavior and determining the performance of an ATAMM based system requires the aid of software tools. The ATAMM Simulator presented is capable of determining the performance of a system without having to build a hardware prototype. Case studies are performed on four algorithms to demonstrate the capabilities of the ATAMM Simulator. Simulated results are shown to be comparable to the experimental results of the Advanced Development Model System

The morphology and cytology of Bacterium malvacearum, E. F. S

RESP-56

Modeling and optimum time performance for concurrent processing

The development of a new graph theoretic model for describing the relation between a decomposed algorithm and its execution in a data flow environment is presented. Called ATAMM, the model consists of a set of Petri net marked graphs useful for representing decision-free algorithms having large-grained, computationally complex primitive operations. Performance time measures which determine computing speed and throughput capacity are defined, and the ATAMM model is used to develop lower bounds for these times. A concurrent processing operating strategy for achieving optimum time performance is presented and illustrated by example

Concepts of War and Their Correlation in an Integrated Strategy

In approaching the subject of concepts of war It is very evident at once that we are dealing with a subject which to­day effects the lives of most human beings on this earth. In this age of total war when national strategies are determined by factors other than military, it is still the military who must im­plement these strategies by pursuing a concept of war that will bring victory and not defeat

Space station definitions, design, and development. Task 5: Multiple arm telerobot coordination and control: Manipulator design methodology

A proposed methodology applicable to the design of manipulator systems is described. The current design process is especially weak in the preliminary design phase, since there is no accepted measure to be used in trading off different options available for the various subsystems. The design process described uses Cartesian End-Effector Impedance as a measure of performance for the system. Having this measure of performance, it is shown how it may be used to determine the trade-offs necessary to the preliminary design phase. The design process involves three main parts: (1) determination of desired system performance in terms of End-Effector Impedance; (2) trade-off design options to achieve this desired performance; and (3) verification of system performance through laboratory testing. The design process is developed using numerous examples and experiments to demonstrate the feasability of this approach to manipulator design

Neural basis for unique hues

SummaryAll colors can be described in terms of four non-reducible ‘unique’ hues: red, green, yellow, and blue [1]. These four hues are also the most common ‘focal’ colors — the best examples of color terms in language [2]. The significance of the unique hues has been recognized since at least the 14th century [3] and is universal [4,5], although there is some individual variation [6,7]. Psychophysical linking hypotheses predict an explicit neural representation of unique hues at some stage of the visual system, but no such representation has been described [8]. The special status of the unique hues “remains one of the central mysteries of color science” [9]. Here we report that a population of recently identified cells in posterior inferior temporal cortex of macaque monkey contains an explicit representation of unique hues

Discovery of Claytonia lanceolata var. peirsonii in the San Bernardino Mountains Perpetuates a History of Taxonomic Uncertainty

Claytonia lanceolata is a widespread perennial herb that typically blooms in areas where snow persists, occurring along mountain corridors from Canada to southern California. Numerous varieties have been described for this species, but most are not recognized under current taxonomic treatments. The discovery of new populations of C. lanceolata in southern California is reported, and the taxonomic uncertainties associated with the C. lanceolata species complex and the southern California var. peirsonii are discussed. Subtle characters for distinguishing the southern populations of C. lanceolata may be obscured during the process of making herbarium specimens. We clarify some of the distinguishing morphological features and associated ecology of C. lanceolata var. peirsonii. Based on detailed field observations in southern California, information is collated for populations across the entire known range of the variety. Recommendations are made regarding opportunities for further investigation, and information pertinent to the conservation of C. lanceolata var. peirsonii in California is updated