Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Np”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Production rates of neon xenon isotopes by energetic neutrons

As a first step in an experimental program to study the behavior of noble gases produced in situ in minerals, a suite of minerals and pure chemicals were irradiated with 14.5 MeV neutrons at LLNL's Rotating Target Neutron Source (RTNS-II) and production rates for noble gases were determined. While neutron effects in meteorites and lunar samples are dominated by low-energy neutron capture, more energetic cosmic-ray secondary neutrons can provide significant depth-dependent contributions to production of cosmogenic nuclides through endothermic reactions such as (n,2n), (n,np), (n,d) and (n,alpha). Production rates for nuclides produced by cosmic-ray secondary neutrons are therefore useful in interpreting shielding histories from the relative abundances of cosmogenic nuclides. Absolute production cross sections were calculated from isotope dilution analyses of NaCl, Mg, CsCl, and Ba(NO3)2 samples, assuming purity, stoichiometry, and quantitative noble gas retention and extraction. Relative production cross sections determined from neon isotopic ratios in the mineral samples were also considered in evaluating the neon production cross sections. Results are presented.

Leich, D. A.↗
NASA NTRS1984

Singular value decomposition with systolic arrays

Systolic arrays for determining the singular value decomposition of a mxn, m greater than or equal to n, matrix A of bandwidth w are presented. After A has been reduced to bidiagonal form B by means of Givens plane rotations, the singular values of B are computed by the Golub-Reinsch iteration. The products of plane rotations form the matrices of left and right singular vectors. Assuming each processor can compute or supply a plane rotation, O(wn) processors accomplish the reduction to bidiagonal form in O(np) steps, where p is the number of superdiagonals. A constant number of processors then determines each singular value in about 6n steps. The singular vectors are computed by rerouting the rotations through the arrays used for the reduction to bidiagonal form, or else along the way by employing another rectangular array of O(wm) processors.

Ipsen, I.↗
NASA NTRS1987

Resonant enhanced multiphoton ionization studies of atomic oxygen

In resonant enhanced multiphoton ionization (REMPI), an atom absorbs several photons making a transition to a resonant intermediate state and subsequently ionizing out of it. With currently available tunable narrow-band lasers, the extreme sensitivity of REMPI to the specific arrangement of levels can be used to selectively probe minute amounts of a single species (atom) in a host of background material. Determination of the number density of atoms from the observed REMPI signal requires a knowledge of the multiphoton ionization cross sections. The REMPI of atomic oxygen was investigated through various excitation schemes that are feasible with available light sources. Using quantum defect theory (QDT) to estimate the various atomic parameters, the REMPI dynamics in atomic oxygen were studied incorporating the effects of saturation and a.c. Stark shifts. Results are presented for REMPI probabilities for excitation through various 2p(3) (4S sup o) np(3)P and 2p(3) (4S sup o) nf(3)F levels.

Dixit, S. N.↗
NASA NTRS1986

The absorption spectrum of titanium between 1900 A and 2315 A

The absorption spectrum of Ti I has been analyzed in the region 1900-2315 A. The list contains 219 lines, of which 64 have been identified as transitions between the ground term and terms of the odd configurations (3d + 4s)3 np (n = 4, 5). Sixteen new energy levels have been found, and three odd level values have been revised. Most of the identified Ti I lines are present in the solar spectrum.

Forsberg, P.↗
NASA NTRS1987

Ultraviolet spectra and chromospheres of cool carbon stars

The authors assemble and discuss all available low-resolution IUE spectra of N-type carbon stars - including TW Hor, BL Ori, UU Aur, NP Pup, U Hya, T Ind, and TX Psc. Identification of spectral features is aided by a composite spectrum. Shortward of 2850 A only emission lines of C II, Mg II, Al II, and Fe II are seen, while the spectrum longward of 2850 A appears to be a photospheric absorption spectrum with a few superposed emission lines of Fe II. The most prominent absorption features are due to Fe I, CH, and CaCl. The emission feature at 2325 A, second only to Mg II in strength, is conclusively identified as C II (UV 0.01). Ultraviolet spectra of N-type carbon stars are similar to, though the emission-line fluxes are generally weaker than, those of the coolest M-giant stars available, such as HD 18191 (M6 III).

Johnson, Hollis R.↗
NASA NTRS1988

Experiences with serial and parallel algorithms for channel routing using simulated annealing

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

Brouwer, Randall Jay↗
NASA NTRS1987

Specific immunization of mice against Leishmania mexicana amazonensis using solubilized promastigotes

In this work, it was demonstrated that mice (BALB/c strain) highly susceptible to Leishmania mexicana amazonensis can be protected against infection by this parasite by being preimmunized with whole solubilized (in a buffer that contained EDTA, NP-40, and SDS) promastigotes; the use of adjuvant or intact inactivated parasite cells is shown to be not necessary. The best immunization schedule consisted of three intravenous injections of 5 x 10 to the 7th parasite equivalents, administered one to eight weeks before infection. Immunized mice exhibited a marked inhibition of primary lesion development, reduced numbers of parasites in the spleen, and reduced death rate.

Barral-Netto, M.↗
NASA NTRS1988

An all sky study of fast X-ray transients

In the HEAO 1 A-2 survey of fast X-ray transients, a search of 2 to 20 keV scanning data was made for brief increases in flux, greater than 4 millicrabs, on timescales approximately 1 to 10 to the 4th s above a 12-hour average. The search was divided into two regions, and all-sky survey of the Galaxy, and a survey of the Magellanic Clouds. In the latter, 37 events were found and identified with 4 of the 5 brighest sources in the LMC, plus 2 as flares from a foreground star. Np X-ray bursts, no gamma-ray bursts, and no events from the SMC were found. In the all-sky survey, after excluding well-known variable sources, out of the equivalent of approximately 104 days of data, 15 events were found which falling into 2 broad categories: flares from coronal sources, roughly isotropically distributed, with optically thin thermal spectra; and harder fast transients apparently distributed near the Galactic plane. The first were identified as flares from ubiquitous active cool dwarf stars. It was hypothesized that the second may have been from distant Be-neutron star binaries. However, at least two of the harder, more luminous events remained unidentified. Future research should examine the nature of these rare events, and how they may fit into a hierarchy of hard fast transients from gamma-ray bursts to outbursts from pulsar systems.

Connors, Alanna↗
NASA NTRS1988

A multistage linear array assignment problem

The implementation of certain algorithms on parallel processing computing architectures can involve partitioning contiguous elements into a fixed number of groups, each of which is to be handled by a single processor. It is desired to find an assignment of elements to processors that minimizes the sum of the maximum workloads experienced at each stage. This problem can be viewed as a multi-objective network optimization problem. Polynomially-bounded algorithms are developed for the case of two stages, whereas the associated decision problem (for an arbitrary number of stages) is shown to be NP-complete. Heuristic procedures are therefore proposed and analyzed for the general problem. Computational experience with one of the exact problems, incorporating certain pruning rules, is presented with one of the exact problems. Empirical results also demonstrate that one of the heuristic procedures is especially effective in practice.

Nicol, David M.↗
NASA NTRS1989

Dynamics of carbon dioxide exchange of a wheat community grown in a semi-closed environment

A wheat (Triticum aestivum Yecora Rojo) community was grown in the semi-closed conditions of the NASA/KSC Biomass Production Chamber (BPC). Experiments were conducted to determine whole community carbon dioxide exchange rates as influenced by growth and development, carbon dioxide concentration, time within the photoperiod, irradiance, and temperature. Plants were grown at a population of about 1500 per sq meter using a 20 hour light/4 hour dark daily regime. Light was supplied by HPS vapor lamps and irradiance was maintained in the range of 590 to 675 mu mol per sq meter. The temperature regime was 20 C light/16 C dark and nutrients were supplied hydroponically as a thin film. Fractional interception of PPF by the community increased rapidly during growth reaching a maximum of 0.96, 24 days after planting. This time corresponded to canopy closure and maximum rates of net photosynthesis (NP). Net daily CO2 utilization rates were calculated to day 48 and a 4th order regression equation integrated to obtain total moles of CO2 fixed by the community. This procedure may be useful for monitoring and prediction of biomass yields in a closed ecology life support system (CELSS).

Corey, Kenneth A.↗
NASA NTRS1990

Space communications scheduler: A rule-based approach to adaptive deadline scheduling

Job scheduling is a deceptively complex subfield of computer science. The highly combinatorial nature of the problem, which is NP-complete in nearly all cases, requires a scheduling program to intelligently transverse an immense search tree to create the best possible schedule in a minimal amount of time. In addition, the program must continually make adjustments to the initial schedule when faced with last-minute user requests, cancellations, unexpected device failures, quests, cancellations, unexpected device failures, etc. A good scheduler must be quick, flexible, and efficient, even at the expense of generating slightly less-than-optimal schedules. The Space Communication Scheduler (SCS) is an intelligent rule-based scheduling system. SCS is an adaptive deadline scheduler which allocates modular communications resources to meet an ordered set of user-specified job requests on board the NASA Space Station. SCS uses pattern matching techniques to detect potential conflicts through algorithmic and heuristic means. As a result, the system generates and maintains high density schedules without relying heavily on backtracking or blind search techniques. SCS is suitable for many common real-world applications.

Straguzzi, Nicholas↗
NASA NTRS1989

Efficient mapping algorithms for scheduling robot inverse dynamics computation on a multiprocessor system

Two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting of p identical homogeneous processors with processor and communication costs to achieve minimum computation time are presented. An objective function is defined in terms of the sum of the processor finishing time and the interprocessor communication time. The minimax optimization is performed on the objective function to obtain the best mapping. This mapping problem can be formulated as a combination of the graph partitioning and the scheduling problems; both have been known to be NP-complete. Thus, to speed up the searching for a solution, two heuristic algorithms were proposed to obtain fast but suboptimal mapping solutions. The first algorithm utilizes the level and the communication intensity of the task modules to construct an ordered priority list of ready modules and the module assignment is performed by a weighted bipartite matching algorithm. For a near-optimal mapping solution, the problem can be solved by the heuristic algorithm with simulated annealing. These proposed optimization algorithms can solve various large-scale problems within a reasonable time. Computer simulations were performed to evaluate and verify the performance and the validity of the proposed mapping algorithms. Finally, experiments for computing the inverse dynamics of a six-jointed PUMA-like manipulator based on the Newton-Euler dynamic equations were implemented on an NCUBE/ten hypercube computer to verify the proposed mapping algorithms. Computer simulation and experimental results are compared and discussed.

Lee, C. S. G.↗
NASA NTRS1992

Towards a theory of automated elliptic mesh generation

The theory of elliptic mesh generation is reviewed and the fundamental problem of constructing computational space is discussed. It is argued that the construction of computational space is an NP-Complete problem and therefore requires a nonstandard approach for its solution. This leads to the development of graph-theoretic, combinatorial optimization and integer programming algorithms. Methods for the construction of two dimensional computational space are presented.

Cordova, J. Q.↗
NASA NTRS1990

Automated Spacelab Stowage Expert System for SLS missions

Issues related to the development of the Automated Spacelab Stowage Expert System (ASSESS) are examined including the problem domain, design, and status. The ASSESS concept is designed to configure stowage items into Spacelab lockers with an expert-system approach in which knowledge is available for every item and locker and for the complete heuristics. ASSESS employs the Knowledge Engineering Environment for development, and graphic displays present data on the items, lockers, and general system status. The automatic and manual modes are presented; the former provides the capability for an automatic solution to the stowage of a set of items into Spacelab lockers based on stowage heuristics defined and/or set by the user. The approach and heuristics algorithms are shown to permit the effective practical solution of NP-hard problems.

Kao, C. Y.↗
NASA NTRS1992

Generating effective project scheduling heuristics by abstraction and reconstitution

A project scheduling problem consists of a finite set of jobs, each with fixed integer duration, requiring one or more resources such as personnel or equipment, and each subject to a set of precedence relations, which specify allowable job orderings, and a set of mutual exclusion relations, which specify jobs that cannot overlap. No job can be interrupted once started. The objective is to minimize project duration. This objective arises in nearly every large construction project--from software to hardware to buildings. Because such project scheduling problems are NP-hard, they are typically solved by branch-and-bound algorithms. In these algorithms, lower-bound duration estimates (admissible heuristics) are used to improve efficiency. One way to obtain an admissible heuristic is to remove (abstract) all resources and mutual exclusion constraints and then obtain the minimal project duration for the abstracted problem; this minimal duration is the admissible heuristic. Although such abstracted problems can be solved efficiently, they yield inaccurate admissible heuristics precisely because those constraints that are central to solving the original problem are abstracted. This paper describes a method to reconstitute the abstracted constraints back into the solution to the abstracted problem while maintaining efficiency, thereby generating better admissible heuristics. Our results suggest that reconstitution can make good admissible heuristics even better.

Janakiraman, Bhaskar↗
NASA NTRS1993

Isomorphic routing on a toroidal mesh

We study a routing problem that arises on SIMD parallel architectures whose communication network forms a toroidal mesh. We assume there exists a set of k message descriptors (xi, yi), where (xi, yi) indicates that the ith message's recipient is offset from its sender by xi hops in one mesh dimension, and yi hops in the other. Every processor has k messages to send, and all processors use the same set of message routing descriptors. The SIMD constraint implies that at any routing step, every processor is actively routing messages with the same descriptors as any other processor. We call this isomorphic routing. Our objective is to find the isomorphic routing schedule with least makespan. We consider a number of variations on the problem, yielding complexity results from O(k) to NP-complete. Most of our results follow after we transform the problem into a scheduling problem, where it is related to other well-known scheduling problems.

Mao, Weizhen↗
NASA NTRS1993

Nuclear Propulsion Technical Interchange Meeting, volume 1

The Nuclear Propulsion Technical Interchange Meeting (NP-TIM-92) was sponsored and hosted by the Nuclear Propulsion Office at the NASA Lewis Research Center. The purpose of the meeting was to review the work performed in fiscal year 1992 in the areas of nuclear thermal and nuclear electric propulsion technology development. These proceedings are a compilation of the presentations given at the meeting (many of the papers are presented in outline or viewgraph form). Volume 1 covers the introductory presentations and the system concepts and technology developments related to nuclear thermal propulsion.

Source record↗