Search NASA⌕ Search

SEARCH · Search NASA

Results for “backtracking”

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 55 records · Page 3

The first allwise proper motion discovery: Wisea J070720.50+170532.7

While quality checking a new motion-aware co-addition of all 12.5 months of Wide-field Infrared Survey Explorer (WISE) data, we found that the source WISE J070720.48+170533.0 moved 0.''9 in six months. Backtracking this motion allowed us to identify this source as 2MASS J07071961+1705464, with several entries in the USNO B catalog. An astrometric fit to these archival data gives a proper motion of μ = 1793 ± 2 mas yr{sup –1} and a parallax of piv = 35 ± 42 mas. Photometry from WISE, 2MASS, and the POSS can be fit reasonably well by a blackbody with T = 3658 K and an angular radius of 4.36 × 10{sup –11} radians. No clear evidence of H{sub 2} collision-induced absorption is seen in the near-infrared. An optical spectrum shows broad deep CaH bands at 638 and 690 nm, broad deep Na D at 598.2 nm, and weak or absent TiO, indicating that this source is an ultra-subdwarf M star with a radial velocity v {sub rad} ≈ –21 ± 18 km s{sup –1} relative to the Sun. Given its apparent magnitude, the distance is about 39 ± 9 pc and the tangential velocity is probably ≈330 km s{sup –1}, but a more precise parallax is needed to be certain.

79 ASTRONOMY AND ASTROPHYSICS↗

DETECTING COLD GAS AT z = 3 WITH THE ATACAMA LARGE MILLIMETER/SUBMILLIMETER ARRAY AND THE SQUARE KILOMETER ARRAY

We forecast the abilities of the Atacama Large Millimeter/submillimeter Array (ALMA) and the Square Kilometer Array (SKA) to detect CO and H I emission lines in galaxies at redshift z = 3. A particular focus is set on Milky Way (MW) progenitors at z = 3 since their detection within 24 hr constitutes a key science goal of ALMA. The analysis relies on a semi-analytic model, which permits the construction of an MW progenitor sample by backtracking the cosmic history of all simulated present-day galaxies similar to the real MW. Results are as follows: (1) ALMA can best observe an MW at z = 3 by looking at CO(3-2) emission. The probability of detecting a random model MW at 3{sigma} in 24 hr using 75 km s{sup -1} channels is roughly 50%, and these odds can be increased by co-adding the CO(3-2) and CO(4-3) lines. These lines fall into ALMA band 3, which therefore represents the optimal choice toward MW detections at z = 3. (2) Higher CO transitions contained in the ALMA bands {>=}6 will be invisible, unless the considered MW progenitor coincidentally hosts a major starburst or an active black hole. (3) The high-frequency array of SKA, fitted with 28.8 GHz receivers, would be a powerful instrument for observing CO(1-0) at z = 3, able to detect nearly all simulated MWs in 24 hr. (4) H I detections in MWs at z = 3 using the low-frequency array of SKA will be impossible in any reasonable observing time. (5) SKA will nonetheless be a supreme H I survey instrument through its enormous instantaneous field of view (FoV). A one-year pointed H I survey with an assumed FoV of 410 deg{sup 2} would reveal at least 10{sup 5} galaxies at z = 2.95-3.05. (6) If the positions and redshifts of those galaxies are known from an optical/infrared spectroscopic survey, stacking allows the detection of H I at z = 3 in less than 24 hr.

79 ASTRONOMY AND ASTROPHYSICS↗

STELLAR POPULATIONS FROM SPECTROSCOPY OF A LARGE SAMPLE OF QUIESCENT GALAXIES AT Z > 1: MEASURING THE CONTRIBUTION OF PROGENITOR BIAS TO EARLY SIZE GROWTH

We analyze the stellar populations of a sample of 62 massive (log M {sub *}/M {sub ☉} > 10.7) galaxies in the redshift range 1 < z < 1.6, with the main goal of investigating the role of recent quenching in the size growth of quiescent galaxies. We demonstrate that our sample is not biased toward bright, compact, or young galaxies, and thus is representative of the overall quiescent population. Our high signal-to-noise ratio Keck/LRIS spectra probe the rest-frame Balmer break region that contains important absorption line diagnostics of recent star formation activity. We obtain improved measures of the various stellar population parameters, including the star formation timescale τ, age, and dust extinction, by fitting templates jointly to both our spectroscopic and broadband photometric data. We identify which quiescent galaxies were recently quenched and backtrack their individual evolving trajectories on the UVJ color-color plane finding evidence for two distinct quenching routes. By using sizes measured in the previous paper of this series, we confirm that the largest galaxies are indeed among the youngest at a given redshift. This is consistent with some contribution to the apparent growth from recent arrivals, an effect often called progenitor bias. However, we calculate that recently quenched objects can only be responsible for about half the increase in average size of quiescent galaxies over a 1.5 Gyr period, corresponding to the redshift interval 1.25 < z < 2. The remainder of the observed size evolution arises from a genuine growth of long-standing quiescent galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗

Fast QSTS for Distributed PV Impact Studies Using Vector Quantization and Variable Time-Steps

As the penetration level of PV systems increases, utilities are in great need of methods to quickly and effectively analyze PV's impact on electric distribution systems. Compared to other conventional methods, quasi-static time-series (QSTS) based analysis has demonstrated its advantages of accurately capturing the impact of interest, e.g. control device operations, and min and max voltages. However, yearlong QSTS simulation with 1-second granularity is currently too computationally expensive for regular use. Therefore, vector quantization (VQ) and variable time-step (VTS) solution methods have been developed to accelerate QSTS simulation. This paper proposes the combination of VQ with VTS. We investigate the effectiveness of implementing VQ in combination with 2 VTS algorithms, predetermined time-step (PT) and VTS with backtrack downsampling (VTS-BD) to demonstrate a runtime reduction of 99.55% with error metrics below acceptable thresholds.

14 SOLAR ENERGY↗

Variable Time-Step Implementation for Rapid Quasi-Static Time-Series (QSTS) Simulations of Distributed PV

Distribution system analysis with high penetrations of distributed PV require quasi-static time-series (QSTS) analysis to model the variability introduced on the distribution system, but current QSTS algorithms are prohibitively burdensome and computationally intensive. This paper proposes a variable timestep algorithm to calculate the critical time periods when QSTS simulations should be solved at higher or lower time-resolution and to backtrack for any critical periods that were missed. This variable time-step solver is a new method of performing timeseries simulations with high accuracy while performing the simulation more than 50 times faster. The scalability of the algorithm is demonstrated using a real utility distribution system model with thousands of buses.

14 SOLAR ENERGY↗

Using flow information to support 3D vessel reconstruction from rotational angiography

For the assessment of cerebrovascular diseases, it is beneficial to obtain three-dimensional (3D) morphologic and hemodynamic information about the vessel system. Rotational angiography is routinely used to image the 3D vascular geometry and we have shown previously that rotational subtraction angiography has the potential to also give quantitative information about blood flow. Flow information can be determined when the angiographic sequence shows inflow and possibly outflow of contrast agent. However, a standard volume reconstruction assumes that the vessel tree is uniformly filled with contrast agent during the whole acquisition. If this is not the case, the reconstruction exhibits artifacts. Here, we show how flow information can be used to support the reconstruction of the 3D vessel centerline and radii in this case. Our method uses the fast marching algorithm to determine the order in which voxels are analyzed. For every voxel, the rotational time intensity curve (R-TIC) is determined from the image intensities at the projection points of the current voxel. Next, the bolus arrival time of the contrast agent at the voxel is estimated from the R-TIC. Then, a measure of the intensity and duration of the enhancement is determined, from which a speed value is calculated that steers the propagation of the fast marching algorithm. The results of the fast marching algorithm are used to determine the 3D centerline by backtracking. The 3D radius is reconstructed from 2D radius estimates on the projection images. The proposed method was tested on computer simulated rotational angiography sequences with systematically varied x-ray acquisition, blood flow, and contrast agent injection parameters and on datasets from an experimental setup using an anthropomorphic cerebrovascular phantom. For the computer simulation, the mean absolute error of the 3D centerline and 3D radius estimation was 0.42 and 0.25 mm, respectively. For the experimental datasets, the mean absolute error of the 3D centerline was 0.45 mm. Under pulsatile and nonpulsatile conditions, flow information can be used to enable a 3D vessel reconstruction from rotational angiography with inflow and possibly outflow of contrast agent. We found that the most important parameter for the quality of the reconstruction of centerline and radii is the range through which the x-ray system rotates in the time span of the injection. Good results were obtained if this range was at least 135 deg. . As a standard c-arm can rotate 205 deg., typically one third of the acquisition can show inflow or outflow of contrast agent, which is required for the quantification of blood flow from rotational angiography.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Ghost marker detection and elimination in marker-based optical tracking systems for real-time tracking in stereotactic body radiotherapy

Purpose: To propose a simple model to explain the origin of ghost markers in marker-based optical tracking systems (OTS) and to develop retrospective strategies to detect and eliminate ghost markers. Methods: In marker-based OTS, ghost markers are virtual markers created due to the cross-talk between the two camera sensors, which can lead to system execution failure or inaccuracy in patient tracking. As a result, the users have to limit the number of markers and avoid certain marker configurations to reduce the chances of ghost markers. In this work, the authors propose retrospective strategies to detect and eliminate ghost markers. The two camera sensors were treated as mathematical points in space. The authors identified the coplanar within limit (CWL) condition as the necessary condition for ghost marker occurrence. A simple ghost marker detection method was proposed based on the model. Ghost marker elimination was achieved through pattern matching: a ghost marker-free reference set was matched with the optical marker set observed by the OTS; unmatched optical markers were eliminated as either ghost markers or misplaced markers. The pattern matching problem was formulated as a constraint satisfaction problem (using pairwise distances as constraints) and solved with an iterative backtracking algorithm. Wildcard markers were introduced to address missing or misplaced markers. An experiment was designed to measure the sensor positions and the limit for the CWL condition. The ghost marker detection and elimination algorithms were verified with samples collected from a five-marker jig and a nine-marker anthropomorphic phantom, rotated with the treatment couch from −60° to +60°. The accuracy of the pattern matching algorithm was further validated with marker patterns from 40 patients who underwent stereotactic body radiotherapy (SBRT). For this purpose, a synthetic optical marker pattern was created for each patient by introducing ghost markers, marker position uncertainties, and marker displacement. Results: The sensor positions and the limit for the CWL condition were measured with excellent reproducibility (standard deviation ≤ 0.39 mm). The ghost marker detection algorithm had perfect detection accuracy for both the jig (1544 samples) and the anthropomorphic phantom (2045 samples). Pattern matching was successful for all samples from both phantoms as well as the 40 patient marker patterns. Conclusions: The authors proposed a simple model to explain the origin of ghost markers and identified the CWL condition as the necessary condition for ghost marker occurrence. The retrospective ghost marker detection and elimination algorithms guarantee complete ghost marker elimination while providing the users with maximum flexibility in selecting the number of markers and their configuration to meet their clinic needs.

60 APPLIED LIFE SCIENCES↗

On the Reversibility of Newton-Raphson Root-Finding Method

Reversibility of a computational method is the ability to execute the method forward as well as backward. Reversible computational methods are generally useful in undoing incorrect computation in a speculative execution setting designed for efficient parallel processing. Here, reversibility is explored of a common component in scientific codes, namely, the Newton-Raphson root-finding method. A reverse method is proposed that is aimed at retracing the sequence of points that are visited by the forward method during forward iterations. When given the root, along with the number of iterations, of the forward method, this reverse method is aimed at backtracking along the reverse sequence of points to finally recover the original starting point of the forward method. The operation of this reverse method is illustrated on a few example functions, serving to highlight the method's strengths and shortcomings.

97 MATHEMATICS AND COMPUTING↗

AnalyzeHOLE: An Integrated Wellbore Flow Analysis Tool

Conventional interpretation of flow logs assumes that hydraulic conductivity is directly proportional to flow change with depth. However, well construction can significantly alter the expected relation between changes in fluid velocity and hydraulic conductivity. Strong hydraulic conductivity contrasts between lithologic intervals can be masked in continuously screened wells. Alternating intervals of screen and blank casing also can greatly complicate the relation between flow and hydraulic properties. More permeable units are not necessarily associated with rapid fluid-velocity increases. Thin, highly permeable units can be misinterpreted as thick and less permeable intervals or not identified at all. These conditions compromise standard flow-log interpretation because vertical flow fields are induced near the wellbore. AnalyzeHOLE, an integrated wellbore analysis tool for simulating flow and transport in wells and aquifer systems, provides a better alternative for simulating and evaluating complex well-aquifer system interaction. A pumping well and adjacent aquifer system are simulated with an axisymmetric, radial geometry in a two-dimensional MODFLOW model. Hydraulic conductivities are distributed by depth and estimated with PEST by minimizing squared differences between simulated and measured flows and drawdowns. Hydraulic conductivity can vary within a lithology but variance is limited with regularization. Transmissivity of the simulated system also can be constrained to estimates from single-well, pumping tests. Water-quality changes in the pumping well are simulated with simple mixing models between zones of differing water quality. These zones are differentiated by backtracking thousands of particles from the well screens with MODPATH. An Excel spreadsheet is used to interface the various components of AnalyzeHOLE by (1) creating model input files, (2) executing MODFLOW, MODPATH, PEST, and supporting FORTRAN routines, and (3) importing and graphically displaying pertinent results.

58 GEOSCIENCES↗

High-resolution and high-accuracy topographic and transcriptional maps of the nucleosome barrier

Nucleosomes represent mechanical and energetic barriers that RNA Polymerase II (Pol II) must overcome during transcription. A high-resolution description of the barrier topography, its modulation by epigenetic modifications, and their effects on Pol II nucleosome crossing dynamics, is still missing. Here, we obtain topographic and transcriptional (Pol II residence time) maps of canonical, H2A.Z, and monoubiquitinated H2B (uH2B) nucleosomes at near base-pair resolution and accuracy. Pol II crossing dynamics are complex, displaying pauses at specific loci, backtracking, and nucleosome hopping between wrapped states. While H2A.Z widens the barrier, uH2B heightens it, and both modifications greatly lengthen Pol II crossing time. Using the dwell times of Pol II at each nucleosomal position we extract the energetics of the barrier. The orthogonal barrier modifications of H2A.Z and uH2B, and their effects on Pol II dynamics rationalize their observed enrichment in +1 nucleosomes and suggest a mechanism for selective control of gene expression.

59 BASIC BIOLOGICAL SCIENCES↗

QA4, a language for artificial intelligence.

Introduction of a language for problem solving and specifically robot planning, program verification, and synthesis and theorem proving. This language, called question-answerer 4 (QA4), embodies many features that have been found useful for constructing problem solvers but have to be programmed explicitly by the user of a conventional language. The most important features of QA4 are described, and examples are provided for most of the material introduced. Language features include backtracking, parallel processing, pattern matching, set manipulation, and pattern-triggered function activation. The language is most convenient for use in an interactive way and has extensive trace and edit facilities.

Derksen, J. A. C.↗

Injection boundary dynamics during a geomagnetic storm

A series of proton and electron injections were observed by Explorer 45 associated with several substorms during the main phase of the Feb. 24, 1972 geomagnetic storm. The 1- to 290-keV protons and 1- to 560-keV electrons were observed in the evening quadrant up to L of about 5.2. A model distorted dipole magnetic field and McIlwain's E3 convection electric field were used to backtrack the energy-dispersed electron and proton fluxes to their source at the time of injection. The source turns out to be a region extending over several earth radii outside an injection boundary. In the night magnetosphere, the inferred injection boundary is displaced inward with each successive substorm. The energy dispersion plot of the particles injected during orbit 314 indicates that as the energy of the observed particles decreases there is a smooth transition to the position of the plasmapause. This suggests that for that substorm the injection boundary and the plasmapause were one and the same. The proton 'noses' reported by Smith and Hoffman (1974) are discussed.

Konradi, A.↗

Path selection process utilizing rapid estimation scheme

The paper describes the use of a rapid estimation scheme for path selection by a roving vehicle. Essentially, the evaluation procedure simulates movement of the rover over each of several corridors lying radially outward from the scanning position. Two levels of corridors are used, and the path selection scheme selects the optimal primary corridor according to a dynamic programming algorithm. In the present version, the length of the corridors is variable. The rapid estimation scheme provides information to define corridor dimensions. This corridor structure, which varies as a function of the terrain, eliminates the need for backtracking, except in certain extreme cases. Computer results are promising in that obstacles were avoided while corridor lengths were kept to a maximum where safety permitted.

Ring, H.↗

Deviser - An AI planner for spacecraft operations

The 'Deviser III' automated spacecraft mission planner prototype can plan complete Voyager spacecraft operational sequences consisting of over 100 data capture goals, working 10-50 times faster than a human analyst. The planner generates a loop-free network of actions and events resembling a program evaluation and review technique chart. Actions, events, and inferences are the building blocks from which plans are assembled. It is noted that, for a very large spacecraft mission plan, the backtracking through remembered decision trees entailed by this artificial intelligence system can consume megabite quantities of computer memory.

Vere, S. A.↗

SWITCH user's manual

The planning program, SWITCH, and its surrounding changed-goal-replanning program, Runaround, are described. The evolution of SWITCH and Runaround from an earlier planner, DEVISER, is recounted. SWITCH's plan representation, and its process of building a plan by backward chaining with strict chronological backtracking, are described. A guide for writing knowledge base files is provided, as are narrative guides for installing the program, running it, and interacting with it while it is running. Some utility functions are documented. For the sake of completeness, a narrative guide to the experimental discrepancy-replanning feature is provided. Appendices contain knowledge base files for a blocksworld domain, and a DRIBBLE file illustrating the output from, and user interaction with, the program in that domain.

Source record↗

Space station payload operations scheduling with ESP2

The Mission Analysis Division of the Systems Analysis and Integration Laboratory at the Marshall Space Flight Center is developing a system of programs to handle all aspects of scheduling payload operations for Space Station. The Expert Scheduling Program (ESP2) is the heart of this system. The task of payload operations scheduling can be simply stated as positioning the payload activities in a mission so that they collect their desired data without interfering with other activities or violating mission constraints. ESP2 is an advanced version of the Experiment Scheduling Program (ESP) which was developed by the Mission Integration Branch beginning in 1979 to schedule Spacelab payload activities. The automatic scheduler in ESP2 is an expert system that embodies the rules that expert planners would use to schedule payload operations by hand. This scheduler uses depth-first searching, backtracking, and forward chaining techniques to place an activity so that constraints (such as crew, resources, and orbit opportunities) are not violated. It has an explanation facility to show why an activity was or was not scheduled at a certain time. The ESP2 user can also place the activities in the schedule manually. The program offers graphical assistance to the user and will advise when constraints are being violated. ESP2 also has an option to identify conflict introduced into an existing schedule by changes to payload requirements, mission constraints, and orbit opportunities.

Stacy, Kenneth L.↗

A database/knowledge structure for a robotics vision system

Desirable properties of robotics vision database systems are given, and structures which possess properties appropriate for some aspects of such database systems are examined. Included in the structures discussed is a family of networks in which link membership is determined by measures of proximity between pairs of the entities stored in the database. This type of network is shown to have properties which guarantee that the search for a matching feature vector is monotonic. That is, the database can be searched with no backtracking, if there is a feature vector in the database which matches the feature vector of the external entity which is to be identified. The construction of the database is discussed, and the search procedure is presented. A section on the support provided by the database for description of the decision-making processes and the search path is also included.

Dearholt, D. W.↗

Neural Network Solves "Traveling-Salesman" Problem

Experimental electronic neural network solves "traveling-salesman" problem. Plans round trip of minimum distance among N cities, visiting every city once and only once (without backtracking). This problem is paradigm of many problems of global optimization (e.g., routing or allocation of resources) occuring in industry, business, and government. Applied to large number of cities (or resources), circuits of this kind expected to solve problem faster and more cheaply.

Thakoor, Anilkumar P.↗