SEARCH · Search NASA
Results for “COMPUTING PROBLEMS”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Robot computer problem solving system
A robot computer problem solving system which represents a robot exploration vehicle in a simulated Mars environment is described. The model exhibits changes and improvements made on a previously designed robot in a city environment. The Martian environment is modeled in Cartesian coordinates; objects are scattered about a plane; arbitrary restrictions on the robot's vision have been removed; and the robot's path contains arbitrary curves. New environmental features, particularly the visual occlusion of objects by other objects, were added to the model. Two different algorithms were developed for computing occlusion. Movement and vision capabilities of the robot were established in the Mars environment, using LISP/FORTRAN interface for computational efficiency. The graphical display program was redesigned to reflect the change to the Mars-like environment.
Robot, computer problem solving system
The development of a computer problem solving system is reported that considers physical problems faced by an artificial robot moving around in a complex environment. Fundamental interaction constraints with a real environment are simulated for the robot by visual scan and creation of an internal environmental model. The programming system used in constructing the problem solving system for the simulated robot and its simulated world environment is outlined together with the task that the system is capable of performing. A very general framework for understanding the relationship between an observed behavior and an adequate description of that behavior is included.
Robot computer problem solving system
The conceptual, experimental, and practical phases of developing a robot computer problem solving system are outlined. Robot intelligence, conversion of the programming language SAIL to run under the THNEX monitor, and the use of the network to run several cooperating jobs at different sites are discussed.
Robot computer problem solving system
The conceptual, experimental, and practical aspects of the development of a robot computer problem solving system were investigated. The distinctive characteristics were formulated of the approach taken in relation to various studies of cognition and robotics. Vehicle and eye control systems were structured, and the information to be generated by the visual system is defined.
Robot computer problem solving system
Continuing research is reported in a program aimed at the development of a robot computer problem solving system. The motivation and results are described of a theoretical investigation concerning the general properties of behavioral systems. Some of the important issues which a general theory of behavioral organization should encompass are outlined and discussed.
Robot, computer problem solving system
The TENEX computer system, the ARPA network, and computer language design technology was applied to support the complex system programs. By combining the pragmatic and theoretical aspects of robot development, an approach is created which is grounded in realism, but which also has at its disposal the power that comes from looking at complex problems from an abstract analytical point of view.
Computational problems and signal processing in SETI
The Search for Extraterrestrial Intelligence (SETI), currently being planned at NASA, will require that an enormous amount of data (on the order of 10 exp 11 distinct signal paths for a typical observation) be analyzed in real time by special-purpose hardware. Even though the SETI system design is not based on maximum entropy and Bayesian methods (partly due to the real-time processing constraint), it is expected that enough data will be saved to be able to apply these and other methods off line where computational complexity is not an overriding issue. Interesting computational problems that relate directly to the system design for processing such an enormous amount of data have emerged. Some of these problems are discussed, along with the current status on their solution.
High-Performance Systems Biology and Associated Combinatorial Scientific Computing Problems (Presentation)
Presentation discussing a metabolomics study focused on a hydrogen-producing green alga and the problems encountered that are addressable using combinatorial scientific computing methods.
A study of the critical computational problems associated with strapdown inertial navigation systems
Analytic computational error models for strapdown inertial navigation systems
Computational problems in three and four dimensional boundary layer theory
It is shown that three-dimensional and time-dependent boundary layer flows can be calculated in a reasonable amount of time with the current generation of computers. The physical problems used to illustrate this have a wide application, and are the following: (1) oscillating flows over cylinders with both the wall and the inviscid flow oscillating, and (2) time-dependent and three-dimensional flow over a rotating airfoil in forward flight.
Hardware Architectures for Data-Intensive Computing Problems: A Case Study for String Matching
DNA analysis is an emerging application of high performance bioinformatic. Modern sequencing machinery are able to provide, in few hours, large input streams of data, which needs to be matched against exponentially growing databases of known fragments. The ability to recognize these patterns effectively and fastly may allow extending the scale and the reach of the investigations performed by biology scientists. Aho-Corasick is an exact, multiple pattern matching algorithm often at the base of this application. High performance systems are a promising platform to accelerate this algorithm, which is computationally intensive but also inherently parallel. Nowadays, high performance systems also include heterogeneous processing elements, such as Graphic Processing Units (GPUs), to further accelerate parallel algorithms. Unfortunately, the Aho-Corasick algorithm exhibits large performance variability, depending on the size of the input streams, on the number of patterns to search and on the number of matches, and poses significant challenges on current high performance software and hardware implementations. An adequate mapping of the algorithm on the target architecture, coping with the limit of the underlining hardware, is required to reach the desired high throughputs. In this paper, we discuss the implementation of the Aho-Corasick algorithm for GPU-accelerated high performance systems. We present an optimized implementation of Aho-Corasick for GPUs and discuss its tradeoffs on the Tesla T10 and he new Tesla T20 (codename Fermi) GPUs. We then integrate the optimized GPU code, respectively, in a MPI-based and in a pthreads-based load balancer to enable execution of the algorithm on clusters and large sharedmemory multiprocessors (SMPs) accelerated with multiple GPUs.
Spatial moments of continuous transport problems computed on grids
Abstract Not Provided
The computation problem with sequential coding Technical report no. 439
Probability distribution study of data transmission time random variable - sequential decoding technique
Computational problems in autoregressive moving average (ARMA) models
The choice of the sampling interval and the selection of the order of the model in time series analysis are considered. Band limited (up to 15 Hz) random torque perturbations are applied to the human ankle joint. The applied torque input, the angular rotation output, and the electromyographic activity using surface electrodes from the extensor and flexor muscles of the ankle joint are recorded. Autoregressive moving average models are developed. A parameter constraining technique is applied to develop more reliable models. The asymptotic behavior of the system must be taken into account during parameter optimization to develop predictive models.
Computational problems on composite grids
Most currently used algorithms for the numerical solution of the partial differential equations encountered in fluid flow problems can be implemented on composite grid systems. Finite volume formulations are easier to derive on composite grids, and may in principle be derived for partial differential equations of all types. Except when using Alternating Difference Implicit-type schemes, the overlapping of grids is an alternative to the more common grid construction procedure where grid lines continue smoothly from one subregion to the next. In the solution of model problems, the correct choice of an interpolation formula has been found able to reduce errors by a factor of two.
Survey Computation Problems Associated with Multi-Planar Electron-Positron Colliders
Explore the source record for details and available documents.
ANALYTIC DIFFERENTIATION BY COMPUTER APPLIED TO THE ''FLAT EARTH'' PROBLEM
Computer application to flat earth problem with analytical functions - guidance systems