Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “integer”

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 91 records · Page 5

A gradient in the duration of the G1 phase in the murine neocortical proliferative epithelium

Neuronogenesis in the neocortical pseudostratified ventricular epithelium (PVE) is initiated rostrolaterally and progresses caudo-medially as development progresses. Here we have measured the cytokinetic parameters and the fractional neuronal output parameter, Q, of laterally located early-maturing regions over the principal embryonic days (E12-E15) of neocortical neuronogenesis in the mouse. These measures are compared with ones previously made of a medial, late-maturing portion of the PVE. Laterally, as medially, the duration of the neuronogenetic interval is 6 days and comprises 11 integer cell cycles. Also, in both lateral and medial areas the length of G1 phase (TG1) increases nearly 4-fold and is the only cell cycle parameter to change. Q progresses essentially identically laterally and medially with respect to the succession of integer cell cycles. Most importantly, from E12 to E13 there is a steeply declining lateral to medial gradient in TG1. The gradient is due both to the lateral to medial graded stage of neuronogenesis and to the stepwise increase in TG1 with each integer cycle during the neuronogenetic interval. To our knowledge this gradient in TG1 of the cerebral PVE is the first cell biological gradient to be demonstrated experimentally in such an extensive proliferative epithelial sheet. We suggest that this gradient in TG1 is the cellular mechanism for positionally encoding a protomap of the neocortex within the PVE.

Non-NASA Center↗

System using leo satellites for centimeter-level navigation

Disclosed herein is a system for rapidly resolving position with centimeter-level accuracy for a mobile or stationary receiver [4]. This is achieved by estimating a set of parameters that are related to the integer cycle ambiguities which arise in tracking the carrier phase of satellite downlinks [5,6]. In the preferred embodiment, the technique involves a navigation receiver [4] simultaneously tracking transmissions [6] from Low Earth Orbit Satellites (LEOS) [2] together with transmissions [5] from GPS navigation satellites [1]. The rapid change in the line-of-sight vectors from the receiver [4] to the LEO signal sources [2], due to the orbital motion of the LEOS, enables the resolution with integrity of the integer cycle ambiguities of the GPS signals [5] as well as parameters related to the integer cycle ambiguity on the LEOS signals [6]. These parameters, once identified, enable real-time centimeter-level positioning of the receiver [4]. In order to achieve high-precision position estimates without the use of specialized electronics such as atomic clocks, the technique accounts for instabilities in the crystal oscillators driving the satellite transmitters, as well as those in the reference [3] and user [4] receivers. In addition, the algorithm accommodates as well as to LEOS that receive signals from ground-based transmitters, then re-transmit frequency-converted signals to the ground.

Rabinowitz, Matthew↗

High-Performance Algorithm for Solving the Diagnosis Problem

An improved method of model-based diagnosis of a complex engineering system is embodied in an algorithm that involves considerably less computation than do prior such algorithms. This method and algorithm are based largely on developments reported in several NASA Tech Briefs articles: The Complexity of the Diagnosis Problem (NPO-30315), Vol. 26, No. 4 (April 2002), page 20; Fast Algorithms for Model-Based Diagnosis (NPO-30582), Vol. 29, No. 3 (March 2005), page 69; Two Methods of Efficient Solution of the Hitting-Set Problem (NPO-30584), Vol. 29, No. 3 (March 2005), page 73; and Efficient Model-Based Diagnosis Engine (NPO-40544), on the following page. Some background information from the cited articles is prerequisite to a meaningful summary of the innovative aspects of the present method and algorithm. In model-based diagnosis, the function of each component and the relationships among all the components of the engineering system to be diagnosed are represented as a logical system denoted the system description (SD). Hence, the expected normal behavior of the engineering system is the set of logical consequences of the SD. Faulty components lead to inconsistencies between the observed behaviors of the system and the SD. Diagnosis the task of finding faulty components is reduced to finding those components, the abnormalities of which could explain all the inconsistencies. The solution of the diagnosis problem should be a minimal diagnosis, which is a minimal set of faulty components. The calculation of a minimal diagnosis is inherently a hard problem, the solution of which requires amounts of computation time and memory that increase exponentially with the number of components of the engineering system. Among the developments to reduce the computational burden, as reported in the cited articles, is the mapping of the diagnosis problem onto the integer-programming (IP) problem. This mapping makes it possible to utilize a variety of algorithms developed previously for IP to solve the diagnosis problem. In the IP approach, the diagnosis problem can be formulated as a linear integer optimization problem, which can be solved by use of well-developed integer-programming algorithms. This concludes the background information.

Fijany, Amir↗

Next Generation Aircraft Design Considering Airline Operations and Economics

Traditional approaches to design and optimization of a new system often use a system-centric objective and do not take into consideration how the operator will use this new system alongside other existing systems. When the new system design is incorporated into the broader group of systems, the performance of the operator-level objective can be sub-optimal due to the unmodeled interaction between the new system and the other systems. Among the few available references that describe attempts to address this disconnect, most follow an MDO (Multidisciplinary Design Optimization)-motivated sequential decomposition approach of first designing a very good system and then providing this system to the operator who, decides the best way to use this new system along with the existing systems. This paper addresses this issue by including aircraft design, airline operations, and revenue management "subspaces"; and presents an approach that could simultaneously solve these subspaces posed as a monolithic optimization problem rather than the traditional approach described above. The monolithic approach makes the problem an expensive Mixed Integer Non-Linear Programming problem, which are extremely difficult to solve. To address the problem, we use a recently developed optimization framework that simultaneously solves the subspaces to capture the "synergy" in the problem that the previous decomposition approaches did not exploit, addresses mixed-integer/discrete type design variables in an efficient manner, and accounts for computationally expensive analysis tools. This approach solves an 11-route airline network problem consisting of 94 decision variables including 33 integer and 61 continuous type variables. Simultaneously solving the subspaces leads to significant improvement in the fleet-level objective of the airline when compared to the previously developed sequential subspace decomposition approach.

Roy, Satadru↗

A Convexification-Based Outer-Approximation Method for Convex and Nonconvex MINLP

The advancement of domain reduction techniques has significantly enhanced the performance of solvers in mathematical programming. This paper delves into the impact of integrating convexification and domain reduction techniques within the Outer-Approximation method. We propose a refined convexification-based Outer-Approximation method alongside a Branch-and-Bound method for both convex and nonconvex Mixed-Integer Nonlinear Programming problems. These methods have been developed and incorporated into the open-source Mixed-Integer Nonlinear Decomposition Toolbox for Pyomo-MindtPy. Comprehensive benchmark tests were conducted, validating the effectiveness and reliability of our proposed algorithms. These tests highlight the improvements achieved by incorporating convexification and domain reduction techniques into the Outer-Approximation and Branch-and-Bound methods.

Optimization↗

Planning air transport network in Appalachia

Main issues to be considered in designing an air transport system are discussed, and a model for the selection of an optimal air network for a region is presented. It was desired to have the ability to consider a dense network of nodes and air routes and variations in schedules on routes, which in combination would represent virtually all conceivable alternatives. Linear and integer programming were chosen as the most promising analysis methodologies. Integer programming was found to be intractable, while linear programming provided efficient solutions. The model was applied to studying the feasibility of a STOL network in West Virginia. Based on allowable paths, an examination of intercity demands, and established growth points, desired levels of service expressed as minimum flights were determined for certain city pairs.

Carter, E. C.↗

Coefficients of associated Legendre functions

The exact coefficients for the explicit forms of the associated Legendre functions Pm for integer values of m,n=0,1,2,...25 are presented in tabular form together with two cross-referenced listings of the zeroes for these functions rounded to five decimal places. The unfactored coefficients and the interger coefficients are presented in adjacent columns for each function. The greatest common factor and divisor have been removed and listed separately for the integer coefficients.

Peasley, Q. D.↗

Open loop digital frequency multiplier

An open loop digital frequency multiplier is described which has a multiplied output synchronized to low frequency clock pulse. The system includes a multistage digital counter which provides a pulse output as a function of an integer divisor. The integer divisor and the timing or counting cycle of the counter are interrelated to the frequency of a clock input. The counting cycle is controlled by a one shot multivibrator which, in turn, is driven by a reference frequency input.

Moore, R. C.↗

An improved algorithm for the isolation of polynomial real zeros

THe Collins-Loos algorithm for computing isolating intervals for the zeros of an integer polynomial requires the evaluation of polynomials at rational points. This implies the use of arbitrary precision integer arithmetic. It is shown how careful use of single precision, floating point arithmetic within the context of a slightly modified algorithm can make the calculation considerably faster and no less exact. Typically, 95% or more of the evaluations can be done without exact arithmetic. The precise speedup depends on the relative costs of the arithmetic in a given implementation. The implementation on DEC KL-10 computer is some 5 to 10 times faster than the original Univac 1110 implementation in SAC-I.

Fateman, R. J.↗

A new algorithm for the integration of exponential and logarithmic functions

An algorithm for symbolic integration of functions built up from the rational functions by repeatedly applying either the exponential or logarithm functions is discussed. This algorithm does not require polynomial factorization nor partial fraction decomposition and requires solutions of linear systems with only a small number of unknowns. It is proven that if this algorithm is applied to rational functions over the integers, a computing time bound for the algorithm can be obtained which is a polynomial in a bound on the integer length of the coefficients, and in the degrees of the numerator and denominator of the rational function involved.

Rothstein, M.↗

Non-symmetric two-stream instability

A theoretical investigation is performed concerning the instability spectrum of quasi-electrostatic waves at shifted half-odd-integer values of the cyclotron frequency due to nonsymmetric counterstreaming electron beams. The beam velocities parallel and perpendicular to the static magnetic field are represented by double Dirac delta functions with no imposition of parameter limitations. Systematic consideration is given to the coupling between plasma modes and cyclotron modes as well as the coupling between cyclotron modes of the two beams that result in shifted half-odd-integer multiples of the cyclotron frequency. The general dispersion equation for quasi-electrostatic waves is analyzed, and plasma-cyclotron coupling in the nonsymmetric case is treated by deriving approximate analytical expressions for maximum growth rates and marginal stability. Exact numerical solutions in both frequency and wavenumber space are obtained and compared with the analytical expressions. Cyclotron-cyclotron coupling modes are treated in the same way, and the results for both types of coupling are compared. It is found that certain modes may be weakened or completely suppressed when the Bessel functions for specific plasma parameters vanish.

Cuperman, S.↗

An array processing system for lunar geochemical and geophysical data

A computerized array processing system has been developed to reduce, analyze, display, and correlate a large number of orbital and earth-based geochemical, geophysical, and geological measurements of the moon on a global scale. The system supports the activities of a consortium of about 30 lunar scientists involved in data synthesis studies. The system was modeled after standard digital image-processing techniques but differs in that processing is performed with floating point precision rather than integer precision. Because of flexibility in floating-point image processing, a series of techniques that are impossible or cumbersome in conventional integer processing were developed to perform optimum interpolation and smoothing of data. Recently color maps of about 25 lunar geophysical and geochemical variables have been generated.

Eliason, E. M.↗

Numerical precision and data structures

Technical proposals and recommendations for revising FORTRAN were studied and categorized. In the area of numerical precision, the proposals basically agree on a set of necessary parameters, although a wide range of nomenclature and specific function names are used. Environmental parameters identified include the following: (1) base of floating point representation, (2) largest positive real number, exponent and integer, (3) largest negative real number, exponent and integer, (4) number of significant digits, and (5) exponent bias.

Schenk, W.↗

Loran-C flight data base

Loran-C time-difference data were collected on January 9, 1979 during a flight from Athens, Ohio to Madison VOR in Connecticut, thence to Millville VOR in New Jersey, and a landing at Atlantic City NAFEC. Portions of the return trip to Athens, Ohio were also recorded. Loran-C GRI data frames were recorded using the 99600 U. S. Northeast Loran chain stations Seneca/Nantucket (TDA) and Seneca/Carolina Beach (TDB). The GRI sequence number TDA and TDB were recorded as integer numbers, with the TD's in integer microseconds. Actual time-of-day can be determined from the data start time, plus the time per GRI and the sequence number. The low cost Loran-C receiver was used to obtain the time-difference data for each GRI. Data was recorded on digital magnetic tape and post-processed into latitude and longitude using an IBM system/370 computer.

Lilley, R. W.↗

Considerations in the placement of phase calibration tones

In the use of tones to calibrate unwanted instrumental phases for very long baseline interferometry experiments, certain problems exist which are related to the placement of these phase calibrator tones. (1) A bias exists in an analytically generated stopping function used during correlation if its frequency satisfies the following condition; f = (f sub s)x(m)/n, where f sub s = sampling frequency, m = any integer, and n = any odd integer. (2) Due to the quantized representation of sine waves in the stopping function, odd harmonics of the fundamental frequencies are generated. Several mechanisms are available through which these harmonics can cause errors in the residual phase extracted from the recorded tones. (3) When multiple tones are injected into a pass band, intermodulation products can occur. The magnitude of these effects is discussed along with strategies designed to avoid them.

Young, L. E.↗

Multipulse precession of spinning spacecraft with flexible appendages

A multipulse precession scheme for spinners with large flexible appendages is described. By choosing the prescribed time delay between pulses as integer (or half integer) multiples of the several incommensurate modal periods it is possible to leave both central spinner and appendages in a final state of negligible nutation. Computer simulations illustrate the several schemes. The results indicate that the proposed method is relatively insensitive to parameter variations such as thruster and inertia uncertainties. Complete equations are presented, including a closed form solution for an important special case: the appendage plane contains the central body mass center.

Vogel, E.↗

Modeling of thin-film GaAs growth

A model of crystal growth is discussed that takes into account the processes of nucleation on the growing surface and also considers the processes of surface migration and desorption of adatoms. The solid on solid (SOS) model of crystal growth is represented by a rectangular array of integers where each integer represents the number of adatoms in a column perpendicular to some reference frame. The adatoms can represent atoms or molecules that are being stacked. This SOS method is used to simulate epitaxial growth of crystals. Output of the computer program developed can be graphic or quantitative.

Heinbockel, J. H.↗

Theory and implementation of a fast algorithm linear equalizer

The theory and implementation of a multiplication-free linear mean-square error criterion equalizer for data transmission are considered. For many real-time signal processing situations, a large number of multiplications is objectionable. The linear estimation problem on a binary computer is considered where the estimation parameters are constrained to be powers of two and thus all multiplications are replaced by shifts. The optimal solution is obtained from an integer-programming-like problem except that the allowable discrete points are non-integers. The branch-and-bound algorithm is used to obtain the coefficients of the equalization TDL. Specific experimental performance results are given for an equalizer implemented with a 12 bit A/D device and a 8080 microprocessor.

Yan, T. Y.↗