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 37 records · Page 2

SU-G-JeP1-13: Innovative Tracking Detector for Dose Monitoring in Hadron Therapy: Realization and Monte Carlo Simulations

Purpose: Development of strategies to monitor range uncertainties is necessary to improve treatment planning in Charged Particle Therapy (CPT) and fully exploit the advantages of ion beams. Our group developed (within the framework of the INSIDE project funded by the Italian research ministry) and is currently building a compact detector Dose Profiler (DP) able to backtrack charged secondary particles produced in the patient during the irradiation. Furthermore we are studying monitoring strategy exploiting charged secondary emission profiles to control the range of the ion beam. Methods: This contribution reports on the DP detector design and construction status. The detector consists of a charged secondary tracker composed of scintillating fiber layers and a LYSO calorimeter for particles energy measurement.The detector layout has been optimized using the FLUKA Monte Carlo (MC) simulation software. The simulation of a 220 MeV Carbon beam impinging on a PMMA target has been performed to study the detector response, exploiting previous secondary radiation measurements performed by our group. The emission profile of charged secondary particles was reconstructed backtracking the particles to their generation point to benchmark the DP performances. Results: The DP construction status, including the technological details will be presented. The feasibility of range monitoring with DP will be demonstrated by means of MC studies. The correlation of the charged secondary particles emission shape with the position of the Bragg peak (BP) will be shown, as well as the spatial resolution achievable on the BP position estimation (less than 3 mm) in the clinical like conditions. Conclusion: The simulation studies supported the feasibility of an accurate range monitoring technique exploiting the use of charged secondary fragments emitted during the particle therapy treatment. The DP experimental tests are foreseen in 2016, at CNAO particle therapy center in Pavia.

60 APPLIED LIFE SCIENCES↗

Analysis of the SiMPL Method for Density-Based Topology Optimization

We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. Here, we refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.

97 MATHEMATICS AND COMPUTING↗

A flexible search strategy for production systems

Most problems considered to be solvable by expert systems have very large search space. It is imperative to use efficient search strategy in expert system tools. Thus, OPS5 uses a kind of hill climbing which is very efficient. However, hill climbing is inadequate for many problems because it is one of the least dependable search strategies. In order to make the search efficient and adequate one can: (1) adopt best-first search instead of hill climbing, or (2) modify hill climbing with intelligent backtracking. The second alternative is adopted. It is implemented in a production system called PRO2 embedded in C running on UNIX. It is called hill tracking. It is a general purpose tool for developing expert systems. This is a rule based production system with an effective, intelligent and flexible backtracking control mechanism, which makes the system more dependable. The advantages and disadvantages of PRO2 are discussed.

Dey, Pradip↗

The scheduling techniques of ESP2

The Mission Analysis Division of the Systems Analysis and Integration Laboratory at the Marshall Space Flight Center has developed a robust automatic scheduler which can produce detailed schedules for the multi-step activities required for payload operations on the Space Station. This scheduler, a part of the Expert Scheduling Program (ESP2), has five components: the bookkeeper, checker, loader, selector, and explainer. The bookkeeper maintains the usage profiles for nondepletable resources, consumables, equipment, crew, and the times of all the steps for the payload activities for several different schedules simultaneously. The checker searches the data maintained by the bookkeeper and finds times when the constraints of each step of an activity are satisfied. The loader is an expert system that uses the techniques of forward chaining, depth-first searching, and backtracking to manage the workings of the checker so that activities are placed in the schedule without violating constraints (such as crew, resources, and orbit opportunities). The checker searches the data maintained by the bookkeeper and finds times when the constraints of each step of an activity are satisfied. The loader is an expert system which uses the techniques of forward chaining, depth-first searching, and backtracking to manage the workings of the checker so that activities are placed in the schedule without violating the constraints. The selector has several methods of choosing the next activity for the loader to schedule. The explainer shows the user why an activity was or was not scheduled at a certain time; it offers a unique graphical explanation of how the expert system (the loader) works.

Jaap, John P.↗

Learning Impasses in Problem Solving

Problem Solving systems customarily use backtracking to deal with obstacles that they encounter in the course of trying to solve a problem. This paper outlines an approach in which the possible obstacles are investigated prior to the search for a solution. This provides a solution strategy that avoids backtracking.

Hodgson, J. P. E.↗

Computing Bounds on Resource Levels for Flexible Plans

A new algorithm efficiently computes the tightest exact bound on the levels of resources induced by a flexible activity plan (see figure). Tightness of bounds is extremely important for computations involved in planning because tight bounds can save potentially exponential amounts of search (through early backtracking and detection of solutions), relative to looser bounds. The bound computed by the new algorithm, denoted the resource-level envelope, constitutes the measure of maximum and minimum consumption of resources at any time for all fixed-time schedules in the flexible plan. At each time, the envelope guarantees that there are two fixed-time instantiations one that produces the minimum level and one that produces the maximum level. Therefore, the resource-level envelope is the tightest possible resource-level bound for a flexible plan because any tighter bound would exclude the contribution of at least one fixed-time schedule. If the resource- level envelope can be computed efficiently, one could substitute looser bounds that are currently used in the inner cores of constraint-posting scheduling algorithms, with the potential for great improvements in performance. What is needed to reduce the cost of computation is an algorithm, the measure of complexity of which is no greater than a low-degree polynomial in N (where N is the number of activities). The new algorithm satisfies this need. In this algorithm, the computation of resource-level envelopes is based on a novel combination of (1) the theory of shortest paths in the temporal-constraint network for the flexible plan and (2) the theory of maximum flows for a flow network derived from the temporal and resource constraints. The measure of asymptotic complexity of the algorithm is O(N O(maxflow(N)), where O(x) denotes an amount of computing time or a number of arithmetic operations proportional to a number of the order of x and O(maxflow(N)) is the measure of complexity (and thus of cost) of a maximumflow algorithm applied to an auxiliary flow network of 2N nodes. The algorithm is believed to be efficient in practice; experimental analysis shows the practical cost of maxflow to be as low as O(N1.5). The algorithm could be enhanced following at least two approaches. In the first approach, incremental subalgorithms for the computation of the envelope could be developed. By use of temporal scanning of the events in the temporal network, it may be possible to significantly reduce the size of the networks on which it is necessary to run the maximum-flow subalgorithm, thereby significantly reducing the time required for envelope calculation. In the second approach, the practical effectiveness of resource envelopes in the inner loops of search algorithms could be tested for multi-capacity resource scheduling. This testing would include inner-loop backtracking and termination tests and variable and value-ordering heuristics that exploit the properties of resource envelopes more directly.

Muscvettola, Nicola↗

Network Penetration Testing and Research

This paper will focus the on research and testing done on penetrating a network for security purposes. This research will provide the IT security office new methods of attacks across and against a company's network as well as introduce them to new platforms and software that can be used to better assist with protecting against such attacks. Throughout this paper testing and research has been done on two different Linux based operating systems, for attacking and compromising a Windows based host computer. Backtrack 5 and BlackBuntu (Linux based penetration testing operating systems) are two different "attacker'' computers that will attempt to plant viruses and or NASA USRP - Internship Final Report exploits on a host Windows 7 operating system, as well as try to retrieve information from the host. On each Linux OS (Backtrack 5 and BlackBuntu) there is penetration testing software which provides the necessary tools to create exploits that can compromise a windows system as well as other operating systems. This paper will focus on two main methods of deploying exploits 1 onto a host computer in order to retrieve information from a compromised system. One method of deployment for an exploit that was tested is known as a "social engineering" exploit. This type of method requires interaction from unsuspecting user. With this user interaction, a deployed exploit may allow a malicious user to gain access to the unsuspecting user's computer as well as the network that such computer is connected to. Due to more advance security setting and antivirus protection and detection, this method is easily identified and defended against. The second method of exploit deployment is the method mainly focused upon within this paper. This method required extensive research on the best way to compromise a security enabled protected network. Once a network has been compromised, then any and all devices connected to such network has the potential to be compromised as well. With a compromised network, computers and devices can be penetrated through deployed exploits. This paper will illustrate the research done to test ability to penetrate a network without user interaction, in order to retrieve personal information from a targeted host.

Murphy, Brandon F.↗

Identification of major moisture sources across the Mediterranean Basin

We employ a Lagrangian based moisture back trajectory method on an ensemble of four reanalysis datasets to provide a comprehensive understanding of moisture sources over the Mediterranean land region (30° N–49.5° N and 9.75° W–61.5° E) at seasonal timescales for 1980–2013 period. Using a source region between 10° S–71.35° N along the latitude and 80° W–84.88° E along the longitude that is subdivided into ten complimentary sub-regions, our analyses is able to backtrack up to > 90% of seasonal precipitation at each grid point within the target region. Our results indicate a significant role of moisture advected from the North Atlantic and Mediterranean Sea, and locally recycled moisture over the target region in shaping the spatial organization of seasonal precipitation. However, a clear east–west contrast is witnessed in determining the relative importance of each of these major moisture sources where the North Atlantic dictates the moisture supply over the western Mediterranean while moisture from Mediterranean Sea and local recycling play a key role over the eastern Mediterranean. Our analyses also demonstrate a major footprint of the North Atlantic Oscillation (NAO) on precipitation variability over the Mediterranean land as dynamic and thermodynamic anomalies during the negative phase of NAO match with those during wet years and vice versa. The findings reported here are generally consistent across the four reanalysis datasets. Overall, this study establishes the relative roles of adjacent and far-off oceanic and terrestrial evaporative sources over the Mediterranean land and should help in understanding the drivers of precipitation variability and change at varying timescales.

54 ENVIRONMENTAL SCIENCES↗

Multi-Detection Events, Probability Density Functions, and Reduced Location Area

Abstract Several efforts have been made in the Comprehensive Nuclear-Test-Ban Treaty (CTBT) community to assess the benefits of combining detections of radionuclides to improve the location estimates available from atmospheric transport modeling (ATM) backtrack calculations. We present a Bayesian estimation approach rather than a simple dilution field of regard approach to allow xenon detections and non-detections to be combined mathematically. This system represents one possible probabilistic approach to radionuclide event formation. Application of this method to a recent interesting radionuclide event shows a substantial reduction in the location uncertainty of that event.

atmospheric modeling↗

Spatial evolution of quantum mechanical states

The time-dependent Schrödinger equation is solved traditionally as an initial-time value problem, where its solution is obtained by the action of the unitary time-evolution propagator on the quantum state that is known at all spatial locations but only at t=0. We generalize this approach by examining the spatial evolution from a state that is, by contrast, known at all times t, but only at one specific location. The corresponding spatial-evolution propagator turns out to be pseudo-unitary. In contrast to the real energies that govern the usual (unitary) time evolution, the spatial evolution can therefore require complex phases associated with dynamically relevant solutions that grow exponentially. By introducing a generalized scalar product, for which the spatial generator is Hermitian, one can show that the temporal integral over the probability current density is spatially conserved, in full analogy to the usual norm of the state, which is temporally conserved. As an application of the spatial propagation formalism, we introduce a spatial backtracking technique that permits us to reconstruct any quantum information about an atom from the ionization data measured at a detector outside the interaction region.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A trailing ribosome speeds up RNA polymerase at the expense of transcript fidelity via force and allostery

In prokaryotes, translation can occur on mRNA that is being transcribed in a process called coupling. How the ribosome affects the RNA polymerase (RNAP) during coupling is not well understood. Here, we reconstituted the E. coli coupling system and demonstrated that the ribosome can prevent pausing and termination of RNAP and double the overall transcription rate at the expense of fidelity. Moreover, we monitored single RNAPs coupled to ribosomes and show that coupling increases the pause-free velocity of the polymerase and that a mechanical assisting force is sufficient to explain the majority of the effects of coupling. Also, by cryo-EM, we observed that RNAPs with a terminal mismatch adopt a backtracked conformation, while a coupled ribosome allosterically induces these polymerases toward a catalytically active anti-swiveled state. Finally, we demonstrate that prolonged RNAP pausing is detrimental to cell viability, which could be prevented by polymerase reactivation through a coupled ribosome.

59 BASIC BIOLOGICAL SCIENCES↗

Inverse aqueous transport modeling for emergency response

ALGE is a three-dimensional, finite-difference aqueous transport model that simulates pollutant fate and transport in lakes, rivers, bays, and estuaries by solving the prognostic equations of mass, momentum, and energy. Its current modeling capabilities include transport of dissolved tracer for a series of predefined basins across the continental United States. Recently, an inverse method (also known as backtracking) has been added to ALGE to provide a possible source of a pollutant should one be detected by a sensor in a body of water and a source is not known. This inverse method is a three step process that uses an algorithm to inverse the flow. We demonstrate the new model’s capabilities through simulating the 2021 Piney Point spill in Tampa Bay, Florida (USA). This involves moving tracer backwards from its detection points, encompassing a potential source area, and applying Bayes’ Theorem and $\frac{𝜒}{𝑄}$ to reduce the area within which the true source could be located.

hydrological modeling↗

Characterizing the detectability of emission signals from a North Korean nuclear detonation

Here, the detectability of emission sources, defined by a low-level of mixing with other sources, was estimated for various locations surrounding the Sea of Japan, including a site within North Korea. A high-resolution meteorological model coupled to a dispersion model was used to simulate plume dynamics for four periods, and two metrics of airborne plume mixing were calculated for each source. While emissions from several known sources in this area tended to blend with others while dispersing downwind, the North Korean plume often remained relatively distinct, thereby making it potentially easier to unambiguously ‘backtrack’ it to its source.

54 ENVIRONMENTAL SCIENCES↗

Structural basis for DNA proofreading

DNA polymerase (DNAP) can correct errors in DNA during replication by proofreading, a process critical for cell viability. However, the mechanism by which an erroneously incorporated base translocates from the polymerase to the exonuclease site and the corrected DNA terminus returns has remained elusive. Here, we present an ensemble of nine high-resolution structures representing human mitochondrial DNA polymerase Gamma, Polγ, captured during consecutive proofreading steps. The structures reveal key events, including mismatched base recognition, its dissociation from the polymerase site, forward translocation of DNAP, alterations in DNA trajectory, repositioning and refolding of elements for primer separation, DNAP backtracking, and displacement of the mismatched base into the exonuclease site. Altogether, our findings suggest a conserved ‘bolt-action’ mechanism of proofreading based on iterative cycles of DNAP translocation without dissociation from the DNA, facilitating primer transfer between catalytic sites. Functional assays and mutagenesis corroborate this mechanism, connecting pathogenic mutations to crucial structural elements in proofreading steps.

59 BASIC BIOLOGICAL SCIENCES↗

Automatic derivation of many-body theories based on general Fermi vacua

This paper describes Wick&D, an implementation of the algebra of second-quantized operators normal ordered with respect to general correlated references and the corresponding Wick theorem [D. Mukherjee, Chem. Phys. Lett. 274, 561 (1997) and W. Kutzelnigg and D. Mukherjee, J. Chem. Phys. 107, 432 (1997)]. Wick&D employs a compact representation of operators and a backtracking algorithm to efficiently evaluate Wick contractions. Since Wick&D can handle both fully and partially contracted terms, it can be applied to both projective and Fock-space many-body formalisms. To demonstrate the usefulness of Wick&D, here we use it to evaluate the single-reference coupled cluster equations up to octuple excitations and report an automated derivation and implementation of the second-order driven similarity renormalization group multireference perturbation theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

CBR antimicrobials inhibit RNA polymerase via at least two bridge-helix cap-mediated effects on nucleotide addition

RNA polymerase inhibitors like the CBR class that target the enzyme’s complex catalytic center are attractive leads for new antimicrobials. The catalysis by RNA polymerase involves multiple rearrangements of bridge helix, trigger loop, and active-center side chains that isomerize the triphosphate of bound NTP and two Mg 2+ ions from a preinsertion state to a reactive configuration. CBR inhibitors target a crevice between the N-terminal portion of the bridge helix and a surrounding cap region within which the bridge helix is thought to rearrange during the nucleotide addition cycle. Here, we report crystal structures of CBR inhibitor/Escherichia coli RNA polymerase complexes as well as biochemical tests that establish two distinct effects of the inhibitors on the RNA polymerase catalytic site. One effect involves inhibition of trigger-loop folding via the F loop in the cap, which affects both nucleotide addition and hydrolysis of 3'-terminal dinucleotides in certain backtracked complexes. The second effect is trigger-loop independent, affects only nucleotide addition and pyrophosphorolysis, and may involve inhibition of bridge-helix movements that facilitate reactive triphosphate alignment.

59 BASIC BIOLOGICAL SCIENCES↗

RNA polymerase II trapped on a molecular treadmill: Structural basis of persistent transcriptional arrest by a minor groove DNA binder

Elongating RNA polymerase II (Pol II) can be paused or arrested by a variety of obstacles. These obstacles include DNA lesions, DNA-binding proteins, and small molecules. Hairpin pyrrole-imidazole (Py-Im) polyamides bind to the minor groove of DNA in a sequence-specific manner and induce strong transcriptional arrest. Remarkably, this Py-Im–induced Pol II transcriptional arrest is persistent and cannot be rescued by transcription factor TFIIS. In contrast, TFIIS can effectively rescue the transcriptional arrest induced by a nucleosome barrier. The structural basis of Py-Im–induced transcriptional arrest and why TFIIS cannot rescue this arrest remain elusive. Here we determined the X-ray crystal structures of four distinct Pol II elongation complexes (Pol II ECs) in complex with hairpin Py-Im polyamides as well as of the hairpin Py-Im polyamides–dsDNA complex. We observed that the Py-Im oligomer directly interacts with RNA Pol II residues, introduces compression of the downstream DNA duplex, prevents Pol II forward translocation, and induces Pol II backtracking. These results, together with biochemical studies, provide structural insight into the molecular mechanism by which Py-Im blocks transcription. Our structural study reveals why TFIIS fails to promote Pol II bypass of Py-Im–induced transcriptional arrest.

59 BASIC BIOLOGICAL SCIENCES↗

Wave function analysis with a maximum flow algorithm

An efficient algorithm for computing the maximum-flow path in a network is applied to the identification of the dominant configuration state functions (CSFs) in a graphically contracted function (GCF), configuration interaction, wave function. The flow network is a space of spin-adapted CSFs represented by a Shavitt graph, wherein the nodes correspond to orbital occupations and spin quantum numbers. The graph nodes are connected by arcs, and an arc density is defined as sums of the associated squared CSF coefficients. A max-min approach determines an upper bound to the maximum possible incoming flow for each graph node. A backtracking step generates a candidate walk and is followed by a limited search of alternative branching paths for the dominant CSF. The arc density contributions are removed from the graph, and the algorithm is reapplied to the updated graph. This list of generated walks can be partitioned in order to guarantee that the dominant CSFs have been identified. All of the steps in this algorithm are computationally efficient and do not depend on the potentially large dimension of the underlying linear CSF expansion space. An analysis of low-lying valence states of C-2 illustrates the method.

74 ATOMIC AND MOLECULAR PHYSICS↗