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 379 records · Page 21

Flexure-Ring for Centering a Concave Lens in a Bore of a Housing for an Optical System

A flexure-ring is provided for centering a lens in a bore of a housing with 3N lens contacting stubs, where N is an integer equal to or greater than one. The stubs are formed by increasing the inside diameter of the ring made to fit tightly around a lens except at 3N locations for the aforesaid stubs, and said ring having an outside diameter made to fit tightly inside the housing bore locations. Behind each stub, a segment of the ring is removed down to a chord perpendicular to a ring diameter passing through the center of each stub. That chord is selected to have a length greater than the lens contacting surface of the stub, thereby to produce a reduced cross section of the ring on both sides of the stub to serve as flexures in relieving stresses due to different coefficients of thermal expansion of the three parts involved due to changes in temperature while in use.

Viriginia Gordon Ford↗

SMEX-Lite Modular Solar Array Architecture

For the most part, Goddard solar arrays have been custom designs that are unique to each mission. The solar panel design has been frozen prior to issuing an RFP for their procurement. There has typically been 6-9 months between RFP release and contract award, followed by an additional 24 months for performance of the contract. For Small Explorer (SMEX) missions, with three years between mission definition and launch, this has been a significant problem. The SMEX solar panels have been sufficiently small that the contract performance period has been reduced to 12-15 months. The bulk of this time is used up in the final design definition and fabrication of flight solar cell assemblies. Even so, it has been virtually impossible to have the spacecraft design at a level of maturity sufficient to freeze the solar panel geometry and release the RFP in time to avoid schedule problems with integrating the solar panels to the spacecraft. With that in mind, the SMEX-Lite project team developed a modular architecture for the assembly of solar arrays to greatly reduce the cost and schedule associated with the development of a mission- specific solar array. In the modular architecture, solar cells are fabricated onto small substrate panels. This modular panel (approximately 8.5" x 17" in this case) becomes the building block for constructing solar arrays for multiple missions with varying power requirements and geometrical arrangements. The mechanical framework that holds these modules together as a solar array is the only mission-unique design, changing in size and shape as required for each mission. There are several advantages to this approach. First, the typical solar array development cycle requires a mission unique design, procurement, and qualification including a custom qualification panel. With the modular architecture, a single qualification of the SMEX-Lite modules and the associated mechanical framework in a typical configuration provided a qualification by similarity to multiple missions. It then becomes possible to procure solar array modules in advance of mission definition and respond quickly and inexpensively to a selected mission's unique requirements. The solar array modular architecture allows the procurement of solar array modules before the array geometry has been frozen. This reduces the effect of procurement lead-time on the mission integration and test flow by as much as 50%. Second, by spreading the non-recurring costs over multiple missions, the cost per unit area is also reduced. In the case of the SMEX-Lite procurement, this reduction was by about one third of the cost per unit area compared to previous SMEX mission-unique procurements. Third, the modular architecture greatly facilitates the infusion of new solar cell technologies into flight programs as these technologies become available. New solar cell technologies need only be fabricated onto a standard-sized module to be incorporated into the next available mission. The modular solar array can be flown in a mixed configuration with some new and some standard cell technologies. Since each module has its own wiring terminals, the array can be arranged as desired electrically with little impact to cost and schedule. The solar array modular architecture does impose some additional constraints on systems and subsystem engineers. First, they must work with discrete solar array modules rather than size the array to fit exactly within an available envelope. The array area is constrained to an integer multiple of the module area. Second, the modular design is optimized for space radiation and thermal environments not greatly different from a typical SMEX LEO environment. For example, a mission with a highly elliptical orbit (e.g., Polar, SMEX/FAST) would require thicker coverglasses to protect the solar cells from the more intense radiation environment.

Lyons, John↗

NAS Parallel Benchmarks

We describe a new problem size, called Class D, for the NAS Parallel Benchmarks (NPB), whose MPI source code implementation is being released as NPB 2.4. A brief rationale is given for how the new class is derived. We also describe the modifications made to the MPI (Message Passing Interface) implementation to allow the new class to be run on systems with 32-bit integers, and with moderate amounts of memory. Finally, we give the verification values for the new problem size.

VanderWijngaart, Rob↗

Self-Consistent Physical Properties of Carbon Nanotubes in Composite Materials

A set of relationships is developed for selected physical properties of single-walled carbon nanotubes (SWCN) and their hexagonal arrays as a function of nanotube size in terms of the chiral vector integer pair, (n,m). Properties include density, principal Young's modulus, and specific Young's modulus. Relationships between weight fraction and volume fraction of SWCN and their arrays are developed for polymeric mixtures.

Pipes, R. B.↗

Generalized Symbolic Execution for Model Checking and Testing

Modern software systems, which often are concurrent and manipulate complex data structures must be extremely reliable. We present a novel framework based on symbolic execution, for automated checking of such systems. We provide a two-fold generalization of traditional symbolic execution based approaches: one, we define a program instrumentation, which enables standard model checkers to perform symbolic execution; two, we give a novel symbolic execution algorithm that handles dynamically allocated structures (e.g., lists and trees), method preconditions (e.g., acyclicity of lists), data (e.g., integers and strings) and concurrency. The program instrumentation enables a model checker to automatically explore program heap configurations (using a systematic treatment of aliasing) and manipulate logical formulae on program data values (using a decision procedure). We illustrate two applications of our framework: checking correctness of multi-threaded programs that take inputs from unbounded domains with complex structure and generation of non-isomorphic test inputs that satisfy a testing criterion. Our implementation for Java uses the Java PathFinder model checker.

Khurshid, Sarfraz↗

GPS-Like Phasing Control of the Space Solar Power System Transmission Array

The problem of phasing of the Space Solar Power System's transmission array has been addressed by developing a GPS-like radio navigation system. The goal of this system is to provide power transmission phasing control for each node of the array that causes the power signals to add constructively at the ground reception station. The phasing control system operates in a distributed manner, which makes it practical to implement. A leader node and two radio navigation beacons are used to control the power transmission phasing of multiple follower nodes. The necessary one-way communications to the follower nodes are implemented using the RF beacon signals. The phasing control system uses differential carrier phase relative navigation/timing techniques. A special feature of the system is an integer ambiguity resolution procedure that periodically resolves carrier phase cycle count ambiguities via encoding of pseudo-random number codes on the power transmission signals. The system is capable of achieving phasing accuracies on the order of 3 mm down to 0.4 mm depending on whether the radio navigation beacons operate in the L or C bands.

Psiaki, Mark L.↗

Barometric Tides from ECMWF Operational Analyses

The solar diurnal and semidiurnal tidal oscillations in surface pressure are extracted from the the operational analysis product of the European Centre for Medium Range Weather Forecasting (ECMWF). For the semidiurnal tide this involves a special temporal interpolation, following Van den Dool and colleagues. The resulting tides are compared with a ground truth tide dataset, a compilation of well-determined tide estimates deduced from long time series of station barometer measurements. These comparisons show that the ECMWF tides are significantly more accurate than the tides deduced from two other widely available reanalysis products. Spectral analysis of ECMWF pressure series shows that the tides consist of sharp central peaks with modulating sidelines at integer multiples of 1 cycle/year, superimposed on a broad cusp of stochastic energy. The integrated energy in the cusp dominates that of the sidelines. This complicates development of a simple model that can characterize the full temporal variability of the tides.

Ray, R. D.↗

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗

Understanding Vibration Spectra of Planetary Gear Systems for Fault Detection

An understanding of the vibration spectra is very useful for any gear fault detection scheme based upon vibration measurements. The vibration measured from planetary gears is complicated. Sternfeld noted the presence of sidebands about the gear mesh harmonics spaced at the planet passage frequency in spectra measured near the ring gear of a CH-47 helicopter. McFadden proposes a simple model of the vibration transmission that predicts high spectral amplitudes at multiples of the planet passage frequency, for planetary gears with evenly spaced planets. This model correctly predicts no strong signal at the meshing frequency when the number of teeth on the ring gear is not an integer multiple of the number of planets. This paper will describe a model for planetary gear vibration spectra developed from the ideas started in reference. This model predicts vibration to occur only at frequencies that are multiples of the planet repetition passage frequency and clustered around gear mesh harmonics. Vibration measurements will be shown from tri-axial accelerometers mounted on three different planetary gear systems and compared with the model. The model correctly predicts the frequencies with large components around the first several gear mesh harmonics in measurements for systems with uniformly and nonuniformly spaced planet gears. Measurements do not confirm some of the more detailed features predicted by the model. Discrepancies of the ideal model to the measurements are believed due to simplifications in the model and will be discussed. Fault detection will be discussed applying the understanding will be discussed.

Mosher, Marianne↗

Characterization of the Crab Pulsar's Timing Noise

We present a power spectral analysis of the Crab pulsar's timing noise, mainly using radio measurements from Jodrell Bank taken over the period 1982-1989, an interval bounded by sparse data sampling and a large glitch. The power spectral analysis is complicated by nonuniform data sampling and the presence of a steep red power spectrum that can distort power spectra measurement by causing severe power 'leakage'. We develop a simple windowing method for computing red noise power spectra of uniformly sampled data sets and test it on Monte Carlo generated sample realizations of red power-law noise. We generalize time-domain methods of generating power-law red noise with even integer spectral indices to the case of noninteger spectral indices. The Jodrell Bank pulse phase residuals are dense and smooth enough that an interpolation onto a uniform time series is possible. A windowed power spectrum is computed revealing a periodic or nearly periodic component with a period of 568 +/- 10 days and a l/f(exp 3) power-law noise component in pulse phase with a noise strength S(sub infinity)=(1.24 +/- 0.067) x 10(exp 16) cycles(exp 2)/sec(exp 2) over the analysis frequency range f=0.003- 0.1 cycles/day. This result deviates from past analyses which characterized the pulse phase timing residuals as either l/f(sub 4) power-law noise or a quasiperiodic process. The analysis was checked using the Deeter polynomial method of power spectrum estimation that was developed for the case of nonuniform sampling, but has lower spectral resolution. The timing noise is consistent with a torque noise spectrum rising with analysis frequency as f implying blue torque noise, a result not predicted by current models of pulsar timing noise. If the periodic or nearly periodic component is due to a binary companion, we find a mass function f(M) = (6.8 +/- 2.4) x 10(exp -16) solar mass and a companion mass, M(sub c) is greater than or equal to 3.2 solar mass assuming a Crab pulsar mass of 1.4 solar mass.

Scott, D. M.↗

Analysis and Modeling of Ground Operations at Hub Airports

Building simple and accurate models of hub airports can considerably help one understand airport dynamics, and may provide quantitative estimates of operational airport improvements. In this paper, three models are proposed to capture the dynamics of busy hub airport operations. Two simple queuing models are introduced to capture the taxi-out and taxi-in processes. An integer programming model aimed at representing airline decision-making attempts to capture the dynamics of the aircraft turnaround process. These models can be applied for predictive purposes. They may also be used to evaluate control strategies for improving overall airport efficiency.

Atkins, Stephen↗

Runway Operations Planning: A Two-Stage Heuristic Algorithm

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, can also be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. This paper introduces a two stage heuristic algorithm for solving the Runway Operations Planning (ROP) problem. In the first stage, sequences of departure class slots and runway crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program with a Branch & Bound algorithm implementation. Preliminary results from this implementation of the two-stage algorithm on real-world traffic data are presented.

Anagnostakis, Ioannis↗

Runway Operations Planning: A Two-Stage Solution Methodology

The airport runway is a scarce resource that must be shared by different runway operations (arrivals, departures and runway crossings). Given the possible sequences of runway events, careful Runway Operations Planning (ROP) is required if runway utilization is to be maximized. Thus, Runway Operations Planning (ROP) is a critical component of airport operations planning in general and surface operations planning in particular. From the perspective of departures, ROP solutions are aircraft departure schedules developed by optimally allocating runway time for departures given the time required for arrivals and crossings. In addition to the obvious objective of maximizing throughput, other objectives, such as guaranteeing fairness and minimizing environmental impact, may be incorporated into the ROP solution subject to constraints introduced by Air Traffic Control (ATC) procedures. Generating optimal runway operations plans was approached in with a 'one-stage' optimization routine that considered all the desired objectives and constraints, and the characteristics of each aircraft (weight class, destination, Air Traffic Control (ATC) constraints) at the same time. Since, however, at any given point in time, there is less uncertainty in the predicted demand for departure resources in terms of weight class than in terms of specific aircraft, the ROP problem can be parsed into two stages. In the context of the Departure Planner (OP) research project, this paper introduces Runway Operations Planning (ROP) as part of the wider Surface Operations Optimization (SOO) and describes a proposed 'two stage' heuristic algorithm for solving the Runway Operations Planning (ROP) problem. Focus is specifically given on including runway crossings in the planning process of runway operations. In the first stage, sequences of departure class slots and runwy crossings slots are generated and ranked based on departure runway throughput under stochastic conditions. In the second stage, the departure class slots are populated with specific flights from the pool of available aircraft, by solving an integer program. Preliminary results from the algorithm implementation on real-world traffic data are included.

Anagnostakis, Ioannis↗

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental tool in numerous image processing and remote sensing applications. For example, unsupervised clustering is often used to obtain vegetation maps of an area of interest. This approach is useful when reliable training data are either scarce or expensive, and when relatively little a priori information about the data is available. Unsupervised clustering methods play a significant role in the pursuit of unsupervised classification. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points (or samples) in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute a set of cluster centers in d-space. Although there is no specific optimization criterion, the algorithm is similar in spirit to the well known k-means clustering method in which the objective is to minimize the average squared distance of each point to its nearest center, called the average distortion. One significant feature of ISOCLUS over k-means is that clusters may be merged or split, and so the final number of clusters may be different from the number k supplied as part of the input. This algorithm will be described in later in this paper. The ISOCLUS algorithm can run very slowly, particularly on large data sets. Given its wide use in remote sensing, its efficient computation is an important goal. We have developed a fast implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm, the filtering algorithm, by Kanungo et al.. They showed that, by storing the data in a kd-tree, it was possible to significantly reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm. For technical reasons, which are explained later, it is necessary to make a minor modification to the ISOCLUS specification. We provide empirical evidence, on both synthetic and Landsat image data sets, that our algorithm's performance is essentially the same as that of ISOCLUS, but with significantly lower running times. We show that our algorithm runs from 3 to 30 times faster than a straightforward implementation of ISOCLUS. Our adaptation of the filtering algorithm involves the efficient computation of a number of cluster statistics that are needed for ISOCLUS, but not for k-means.

Memarsadeghi, Nargess↗

Coupled-Resonator-Induced Transparency

We demonstrate that a cancellation of absorption occurs on resonance for two (or any even number of) coupled optical resonators, due to mode splitting and classical destructive interference, particularly when the resonator finesse is large and the loss in the resonator furthest from the excitation waveguide is small. The linewidth and group velocity of a collection of such coupled-resonator structures may be decreased by using larger resonators of equal size, using larger resonators of unequal size where the optical path length of the larger resonator is an integer multiple of that of the smaller one, or by using a larger number of resonators per structure. We explore the analogy between these effects and electromagnetically induced transparency in an atomic system.

Smith, David D.↗

A Solar System Survey of Forced Librations in Longitude

Physical librations in longitude are forced periodic variations of a body's rotation rate. If the torque producing the librations can be calculated, then observations of the phase and amplitude of librations can provide information on mass distribution, and effective strength of the body. In the near future prospects for observing physical librations look quite promising. Radio interferometric observations of Venus and Mercury may yield sufficiently accurate rotational observations that librations there may be visible. Range measurements from Earth to networks of landed instrument packages on Mars are likely to yield librational data there as well. We compute expected libration amplitudes from physical and orbital parameters of a set of planets and satellites partially motivated by a desire to identify candidates for future observations. Solar system bodies occupy one of three general rotation states: non-resonant states, resonant states, and the synchronous resonant state. Analytical treatments of forced librations were initially motivated by the Moon. Lunar librations were predicted by Newton, first detected telescopically by Bessel, and definitively resolved through lunar laser ranging which has led to quite thorough analysis of of librations for the synchronous case. The synchronous resonant state is commonly observed among satellites. The only known body to exist in a non-synchronous resonance is Mercury which exists in a 3:2 resonance, completing three rotations for every two revolutions about the sun. The analysis of Goldreich and Peale has lead to improved understanding of the general case of half integer resonance states. The dynamics of forced librations in non-resonant rotators has received less attention. While there are few cases in which non-resonant forced librations have been observed, Earth is an important exception, and current observing techniques may have the capacity to detect them on Venus. A comprehensive observing program spanning a range of solar system bodies can address an array of geophysical issues involving interior mass distribution of planets, satellites, and asteroids. Calculations of expected librations can supply amplitude estimates helpful in identifying the likelihood of detecting librations observationally. We present a survey of expected libration amplitudes for a subset of solar system bodies, identifying those bodies with amplitudes likely to be detectable, and commenting on spin state, and radial structure implications.

Comstock, R. L.↗

Algorithms for the Fractional Calculus: A Selection of Numerical Methods

Many recently developed models in areas like viscoelasticity, electrochemistry, diffusion processes, etc. are formulated in terms of derivatives (and integrals) of fractional (non-integer) order. In this paper we present a collection of numerical algorithms for the solution of the various problems arising in this context. We believe that this will give the engineer the necessary tools required to work with fractional models in an efficient way.

Diethelm, K.↗

Computational Analysis of Cryogenic Flow Through a Control Valve

The initial efforts to develop the capability to model valves used in rocket engine component testing at Stennis Space Center are documented. An axisymmetric model of a control valve with LN2 as the working fluid was developed. The goal was to predict the effect of change in the plug/sear region of the valve prior to testing. The valve flow coefficient was predicted for a range of plug positions. Verification of the calculations was carried out to quantify the uncertainty in the numerical answer. The modeled results compared well qualitatively to experimental trends. Additionally, insights into the flow processes in the valve were obtained. Benefits from the verification process included the ability to use coarser grids and insight into ways to reduce computational time by using double precision accuracy and non-integer grid ratios. Future valve modeling activities will include shape optimization of the valve/seat region and dynamic grid modeling.

Danes, Russell↗