Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “point”

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.

At least 127 records · Page 7

Multiple interaction points in ghost collisions

The Ghost Collider makes use of unique “ghost” bunches, which are electrically neutral combinations of electrons and positrons within the same RF bucket, eliminates the beam-beam effects typically present at the interaction point (IP) in conventional colliders. This allows for the novel possibility of placing multiple interaction regions in series, achieving additive luminosity without introducing significant disruption. However, to get higher luminosity, the beta functions at the IP reaches millimeter scale, which in turn adds significant chromatic contribution to the collider. Correcting these chromatic effects is essential to maintain beam stability and ensure high luminosity during collider operation. By carefully adjusting the phase advance between two IRs that are placed in series, it becomes possible to cancel chromaticity globally, enabling stable collider operation while preserving high luminosity. In this paper we discuss the design of such IR/IRs to be used in a ghost collider.

Accelerator Physics↗

Digital approximation of continuous-data control systems by point-by-point state comparison

This paper presents a point-by-point state comparison method of approximating a continuous-data system by a sampled-data system. The problem is to attempt the matching of the states of the two systems at the sampling instants. A partial matching has to be conducted if the systems have more states than controls. A weighting matrix is used to regulate the partial matching and weights placed on each state. The digital approximation is affected by use of forward gain E(T) and feedback gain G(T) in the sampled-data system. It is shown that, in general, these gains can be approximated by truncated Taylor series expansions. An illustrative example is given using the one-axis dynamics of the Skylab satellite.

Kuo, B. C.↗

Onboard utilization of ground control points for image correction. Volume 3: Ground control point simulation software design

The software developed to simulate the ground control point navigation system is described. The Ground Control Point Simulation Program (GCPSIM) is designed as an analysis tool to predict the performance of the navigation system. The system consists of two star trackers, a global positioning system receiver, a gyro package, and a landmark tracker.

Source record↗

Time optimal robotic manipulator motions and work places for point to point tasks

High productivity requires that manipulators perform complex tasks quickly. Recently, optimal control algorithms have been developed which enable manipulators to move quickly, but only for simple motions. A method is presented here which combines simple time optimal motions in an optimal manner to yield the minimum time motions for an important class of complex manipulator tasks composed of point to point moves, such as assembly, electronic component insertion and spot welding. This method can also be used to design manipulator actions and work places so that tasks can be completd in minimum time. The method has been implemented in a CAD software package. Examples are presented which show the methods effectiveness.

Dubowsky, S.↗

Planning time-optimal robotic manipulator motions and work places for point-to-point tasks

A method is presented which combines simple time-optimal motions in an optimal manner to yield the minimum-time motions for an important class of complex manipulator tasks composed of point-to-point moves such as assembly, electronic component insertion, and spot welding. This method can also be used to design manipulator actions and work places so that tasks can be completed in minimum time. The method has been implemented in a computer-aided design software system. Several examples are presented. Experimental results show the method's validity and utility.

Dubowsky, S.↗

Defining optimal point-to-point transfer surfaces for orbital path-constrained rendezvous

Many scenarios for future orbital operations involve maneuvering in proximity to such large space structures as the Space Station Freedom; in most cases, the accidental contact of a vehicle with such a structure will be dangerous and must be avoided. Classical rendezvous targeting is inadequate for this purpose, because it recognizes no restraint on the path between the point of departure and the desired point of arrival. A computer program has been devised to minimize this susceptibility. Surfaces are found to exist whose penalty is less than that of a sphere, though not markedly less.

Soileau, Kerry M.↗

Point-to-Point Multicast Communications Protocol

This paper describes a protocol to support point-to-point interprocessor communications with multicast. Dynamic, cut-through routing with local flow control is used to provide a high-throughput, low-latency communications path between processors. In addition multicast transmissions are available, in which copies of a packet are sent to multiple destinations using common resources as much as possible. Special packet terminators and selective buffering are introduced to avoid a deadlock during multicasts. A simulated implementation of the protocol is also described.

PROTOCOLS↗

Error Mitigation of Point-to-Point Communication for Fault-Tolerant Computing

Fault tolerant systems require the ability to detect and recover from physical damage caused by the hardware s environment, faulty connectors, and system degradation over time. This ability applies to military, space, and industrial computing applications. The integrity of Point-to-Point (P2P) communication, between two microcontrollers for example, is an essential part of fault tolerant computing systems. In this paper, different methods of fault detection and recovery are presented and analyzed.

Akamine, Robert L.↗

Providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer

Methods, apparatus, and products are disclosed for providing full point-to-point communications among compute nodes of an operational group in a global combining network of a parallel computer, each compute node connected to each adjacent compute node in the global combining network through a link, that include: receiving a network packet in a compute node, the network packet specifying a destination compute node; selecting, in dependence upon the destination compute node, at least one of the links for the compute node along which to forward the network packet toward the destination compute node; and forwarding the network packet along the selected link to the adjacent compute node connected to the compute node through the selected link.

97 MATHEMATICS AND COMPUTING↗

Performance evaluation of the three-point angular correlation function

In recent years, we have observed an increase in the diversity of the processors ecosystem. Different designs and architectures are being studied based on their performance and power characteristics. While using benchmarks for this purpose allows for reproducibility and easy understanding of the results, using real scientific applications allows researchers to realize the actual implications of each design on the overall performance of their codes. This paper analyzes the performance of different implementations of a three-point angular correlation function. This function is used in the study of Large-Scale Distribution of galaxies in a variety of computational platforms. The function is based on histogram construction and presents a large computational cost. This cost dramatically increases with the size of the datasets. We have considered two different GPUs, a set of x86 Intel machines (multi- and many-core), ARM chipsets, as well as an FPGA. We first study the best possible implementation for each platform in terms of time to solution. We then compare the power used by those platforms for a predefined number of datasets. Energy is one of the main constraints that computer architects are facing nowadays. The results will be used to evaluate the performance of this function considering those two targets – time and energy – for those platforms and to analyze the suitability of each of those platforms for this specific problem.

Computer Science↗