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 451 records · Page 25

Laser System for Precise, Unambiguous Range Measurements

The Modulation Sideband Technology for Absolute Range (MSTAR) architecture is the basis of design of a proposed laser-based heterodyne interferometer that could measure a range (distance) as great as 100 km with a precision and resolution of the order of 1 nm. Simple optical interferometers can measure changes in range with nanometer resolution, but cannot measure range itself because interference is subject to the well-known integer-multiple-of-2 -radians phase ambiguity, which amounts to a range ambiguity of the order of 1 m at typical laser wavelengths. Existing rangefinders have a resolution of the order of 10 m and are therefore unable to resolve the ambiguity. The proposed MSTAR architecture bridges the gap, enabling nanometer resolution with an ambiguity range that can be extended to arbitrarily large distances. The MSTAR architecture combines the principle of the heterodyne interferometer with the principle of extending the ambiguity range of an interferometer by using light of two wavelengths. The use of two wavelengths for this purpose is well established in optical metrology, radar, and sonar. However, unlike in traditional two-color laser interferometry, light of two wavelengths would not be generated by two lasers. Instead, multiple wavelengths would be generated as sidebands of phase modulation of the light from a single frequency- stabilized laser. The phase modulation would be effected by applying sinusoidal signals of suitable frequencies (typically tens of gigahertz) to high-speed electro-optical phase modulators. Intensity modulation can also be used

Dubovitsky, Serge↗

Conservative Patch Algorithm and Mesh Sequencing for PAB3D

A mesh-sequencing algorithm and a conservative patched-grid-interface algorithm (hereafter Patch Algorithm ) have been incorporated into the PAB3D code, which is a computer program that solves the Navier-Stokes equations for the simulation of subsonic, transonic, or supersonic flows surrounding an aircraft or other complex aerodynamic shapes. These algorithms are efficient, flexible, and have added tremendously to the capabilities of PAB3D. The mesh-sequencing algorithm makes it possible to perform preliminary computations using only a fraction of the grid cells (provided the original cell count is divisible by an integer) along any grid coordinate axis, independently of the other axes. The patch algorithm addresses another critical need in multi-block grid situation where the cell faces of adjacent grid blocks may not coincide, leading to errors in calculating fluxes of conserved physical quantities across interfaces between the blocks. The patch algorithm, based on the Stokes integral formulation of the applicable conservation laws, effectively matches each of the interfacial cells on one side of the block interface to the corresponding fractional cell area pieces on the other side. This approach is comprehensive and unified such that all interface topology is automatically processed without user intervention. This algorithm is implemented in a preprocessing code that creates a cell-by-cell database that will maintain flux conservation at any level of full or reduced grid density as the user may choose by way of the mesh-sequencing algorithm. These two algorithms have enhanced the numerical accuracy of the code, reduced the time and effort for grid preprocessing, and provided users with the flexibility of performing computations at any desired full or reduced grid resolution to suit their specific computational requirements.

Pao, S. P.↗

Coding for Communication Channels with Dead-Time Constraints

Coding schemes have been designed and investigated specifically for optical and electronic data-communication channels in which information is conveyed via pulse-position modulation (PPM) subject to dead-time constraints. These schemes involve the use of error-correcting codes concatenated with codes denoted constrained codes. These codes are decoded using an interactive method. In pulse-position modulation, time is partitioned into frames of Mslots of equal duration. Each frame contains one pulsed slot (all others are non-pulsed). For a given channel, the dead-time constraints are defined as a maximum and a minimum on the allowable time between pulses. For example, if a Q-switched laser is used to transmit the pulses, then the minimum allowable dead time is the time needed to recharge the laser for the next pulse. In the case of bits recorded on a magnetic medium, the minimum allowable time between pulses depends on the recording/playback speed and the minimum distance between pulses needed to prevent interference between adjacent bits during readout. The maximum allowable dead time for a given channel is the maximum time for which it is possible to satisfy the requirement to synchronize slots. In mathematical shorthand, the dead-time constraints for a given channel are represented by the pair of integers (d,k), where d is the minimum allowable number of zeroes between ones and k is the maximum allowable number of zeroes between ones. A system of the type to which the present schemes apply is represented by a binary- input, real-valued-output channel model illustrated in the figure. At the transmitting end, information bits are first encoded by use of an error-correcting code, then further encoded by use of a constrained code. Several constrained codes for channels subject to constraints of (d,infinity) have been investigated theoretically and computationally. The baseline codes chosen for purposes of comparison were simple PPM codes characterized by M-slot PPM frames separated by d-slot dead times.

Moision, Bruce↗

Reducing Errors by Use of Redundancy in Gravity Measurements

A methodology for improving gravity-gradient measurement data exploits the constraints imposed upon the components of the gravity-gradient tensor by the conditions of integrability needed for reconstruction of the gravitational potential. These constraints are derived from the basic equation for the gravitational potential and from mathematical identities that apply to the gravitational potential and its partial derivatives with respect to spatial coordinates. Consider the gravitational potential in a Cartesian coordinate system {x1,x2,x3}. If one measures all the components of the gravity-gradient tensor at all points of interest within a region of space in which one seeks to characterize the gravitational field, one obtains redundant information. One could utilize the constraints to select a minimum (that is, nonredundant) set of measurements from which the gravitational potential could be reconstructed. Alternatively, one could exploit the redundancy to reduce errors from noisy measurements. A convenient example is that of the selection of a minimum set of measurements to characterize the gravitational field at n3 points (where n is an integer) in a cube. Without the benefit of such a selection, it would be necessary to make 9n3 measurements because the gravitygradient tensor has 9 components at each point. The problem of utilizing the redundancy to reduce errors in noisy measurements is an optimization problem: Given a set of noisy values of the components of the gravity-gradient tensor at the measurement points, one seeks a set of corrected values - a set that is optimum in that it minimizes some measure of error (e.g., the sum of squares of the differences between the corrected and noisy measurement values) while taking account of the fact that the constraints must apply to the exact values. The problem as thus posed leads to a vector equation that can be solved to obtain the corrected values.

Kulikov, Igor↗

Signal Design for Improved Ranging Among Multiple Transceivers

"Ultra-BOC" (where "BOC" signifies "binary offset carrier") is the name of an improved generic design of microwave signals to be used by a group of spacecraft flying in formation to measure ranges and bearings among themselves and to exchange telemetry needed for these measurements. Ultra-BOC could also be applied on Earth for diverse purposes -- for example, measuring relative positions of vehicles on highways for traffic-control purposes and determining the relative alignments of machines operating in mines and of construction machines and structures at construction sites. Ultra-BOC provides for rapid and robust acquisition of signals, even when signal-to-noise ratios are low. The design further provides that each spacecraft or other platform constantly strives to acquire and track the signals from the other platforms while simultaneously transmitting signals that provide full range, bearing, and telemetry service to the other platforms. In Ultra-BOC, unlike in other signal designs that have been considered for the same purposes, it is not necessary to maneuver the spacecraft or other platforms to obtain the data needed for resolving integer-carrier-cycle phase ambiguities.

Young, Lawrence↗

Iterative Demodulation and Decoding of Non-Square QAM

It has been shown that a non-square (NS) 2(sup 2n+1)-ary (where n is a positive integer) quadrature amplitude modulation [(NS)2(sup 2n+1)-QAM] has inherent memory that can be exploited to obtain coding gains. Moreover, it should not be necessary to build new hardware to realize these gains. The present scheme is a product of theoretical calculations directed toward reducing the computational complexity of decoding coded 2(sup 2n+1)-QAM. In the general case of 2(sup 2n+1)-QAM, the signal constellation is not square and it is impossible to have independent in-phase (I) and quadrature-phase (Q) mapping and demapping. However, independent I and Q mapping and demapping are desirable for reducing the complexity of computing the log likelihood ratio (LLR) between a bit and a received symbol (such computations are essential operations in iterative decoding). This is because in modulation schemes that include independent I and Q mapping and demapping, each bit of a signal point is involved in only one-dimensional mapping and demapping. As a result, the computation of the LLR is equivalent to that of a one-dimensional pulse amplitude modulation (PAM) system. Therefore, it is desirable to find a signal constellation that enables independent I and Q mapping and demapping for 2(sup 2n+1)-QAM.

Li, Lifang↗

Fast Image Texture Classification Using Decision Trees

Texture analysis would permit improved autonomous, onboard science data interpretation for adaptive navigation, sampling, and downlink decisions. These analyses would assist with terrain analysis and instrument placement in both macroscopic and microscopic image data products. Unfortunately, most state-of-the-art texture analysis demands computationally expensive convolutions of filters involving many floating-point operations. This makes them infeasible for radiation- hardened computers and spaceflight hardware. A new method approximates traditional texture classification of each image pixel with a fast decision-tree classifier. The classifier uses image features derived from simple filtering operations involving integer arithmetic. The texture analysis method is therefore amenable to implementation on FPGA (field-programmable gate array) hardware. Image features based on the "integral image" transform produce descriptive and efficient texture descriptors. Training the decision tree on a set of training data yields a classification scheme that produces reasonable approximations of optimal "texton" analysis at a fraction of the computational cost. A decision-tree learning algorithm employing the traditional k-means criterion of inter-cluster variance is used to learn tree structure from training data. The result is an efficient and accurate summary of surface morphology in images. This work is an evolutionary advance that unites several previous algorithms (k-means clustering, integral images, decision trees) and applies them to a new problem domain (morphology analysis for autonomous science during remote exploration). Advantages include order-of-magnitude improvements in runtime, feasibility for FPGA hardware, and significant improvements in texture classification accuracy.

Thompson, David R.↗

Characterization of Deficiencies in the Frequency Domain Forced Response Analysis Technique for Supersonic Turbine Bladed Disks

Turbine blades in rocket and jet engine turbomachinery experience enormous harmonic loading conditions. These loads result from the integer number of upstream and downstream stator vanes as well as the other turbine stages. Assessing the blade structural integrity is a complex task requiring an initial characterization of whether resonance is possible and then performing a forced response analysis if that condition is met. The standard technique for forced response analysis in rocket engines is to decompose a CFD-generated flow field into its harmonic components, and to then perform a frequency response analysis at the problematic natural frequencies. Recent CFD analysis and water-flow testing at NASA/MSFC, though, indicates that this technique may miss substantial harmonic and non-harmonic excitation sources that become present in complex flows. A substantial effort has been made to account for this denser spatial Fourier content in frequency response analysis (described in another paper by the author), but the question still remains whether the frequency response analysis itself is capable of capturing the excitation content sufficiently. Two studies comparing frequency response analysis with transient response analysis, therefore, of bladed-disks undergoing this complex flow environment have been performed. The first is of a bladed disk with each blade modeled by simple beam elements. Six loading cases were generated by varying a baseline harmonic excitation in different ways based upon cold-flow testing from Heritage Fuel Air Turbine Test. It was hypothesized that the randomness and other variation from the standard harmonic excitation would reduce the blade structural response, but the results showed little reduction. The second study was of a realistic model of a bladed-disk excited by the same CFD used in the J2X engine program. It was hypothesized that enforcing periodicity in the CFD (inherent in the frequency response technique) would overestimate the response. The results instead showed that the transient analysis results were up to 10% higher for "clean" nodal diameter excitations and six times larger for "messy" excitations, where substantial Fourier content around the main harmonic exists. Because the bulk of resonance problems are due to the "clean" excitations, a 10% underprediction is not necessarily a problem, especially since the average response in the transient is similar to the frequency response result, and so in a realistic finite life calculation, the life would be same. However, in the rare cases when the "messy" excitations harmonics are identified as the source of potential resonance concerns, this research does indicate that frequency response analysis is inadequate for accurate characterization of blade structural capability.

Brown, Andrew M.↗

Virtual Machine Language 2.1

VML (Virtual Machine Language) is an advanced computing environment that allows spacecraft to operate using mechanisms ranging from simple, time-oriented sequencing to advanced, multicomponent reactive systems. VML has developed in four evolutionary stages. VML 0 is a core execution capability providing multi-threaded command execution, integer data types, and rudimentary branching. VML 1 added named parameterized procedures, extensive polymorphism, data typing, branching, looping issuance of commands using run-time parameters, and named global variables. VML 2 added for loops, data verification, telemetry reaction, and an open flight adaptation architecture. VML 2.1 contains major advances in control flow capabilities for executable state machines. On the resource requirements front, VML 2.1 features a reduced memory footprint in order to fit more capability into modestly sized flight processors, and endian-neutral data access for compatibility with Intel little-endian processors. Sequence packaging has been improved with object-oriented programming constructs and the use of implicit (rather than explicit) time tags on statements. Sequence event detection has been significantly enhanced with multi-variable waiting, which allows a sequence to detect and react to conditions defined by complex expressions with multiple global variables. This multi-variable waiting serves as the basis for implementing parallel rule checking, which in turn, makes possible executable state machines. The new state machine feature in VML 2.1 allows the creation of sophisticated autonomous reactive systems without the need to develop expensive flight software. Users specify named states and transitions, along with the truth conditions required, before taking transitions. Transitions with the same signal name allow separate state machines to coordinate actions: the conditions distributed across all state machines necessary to arm a particular signal are evaluated, and once found true, that signal is raised. The selected signal then causes all identically named transitions in all present state machines to be taken simultaneously. VML 2.1 has relevance to all potential space missions, both manned and unmanned. It was under consideration for use on Orion.

Riedel, Joseph E.↗

Characterization of Deficiencies in the Frequency Domain Forced Response Analysis Technique for Supersonic Turbine Bladed Disks

Turbine blades in rocket and jet engine turbomachinery experience enormous harmonic loading conditions. These loads result from the integer number of upstream and downstream stator vanes as well as the other turbine stages. Assessing the blade structural integrity is a complex task requiring an initial characterization of whether resonance is possible and then performing a forced response analysis if that condition is met. The standard technique for forced response analysis in rocket engine turbines is to decompose a computational fluid dynamics (CFD).generated flow field into its harmonic components, and to then perform a frequency response analysis at the problematic natural frequencies using cyclically symmetric structural dynamic models. Recent CFD analysis and water-flow testing at NASA/MSFC, though, indicates that this technique may miss substantial harmonic and non ]harmonic excitation sources that become present in complex flows. This complex content can only be captured by a CFD flow field encompassing at least an entire revolution. A substantial development effort to create a series of software programs to enable application of the 360 degree forcing function in a frequency response analysis on cyclic symmetric models has been completed (to be described in a future paper), but the question still remains whether the frequency response analysis itself is capable of capturing the excitation content sufficiently. Two studies comparing frequency response analysis with transient response analysis, therefore, of bladed-disks undergoing this complex flow environment have been performed. The first is of a bladed disk with each blade modeled by simple beam elements and the disk modeled with plates (using the finite element code MSC/NASTRAN). The focus of this model is to be representative of response of realistic bladed disks, and so the dimensions are roughly equivalent to the new J2X rocket engine 1st stage fuel pump turbine. The simplicity of the model allows the CFD load to be able to be readily applied, along with analytical and experimental variations in both the temporal and spatial fourier components of the excitation. In addition, this model is a first step in identifying response differences between transient and frequency forced response analysis techniques. The second phase assesses this difference for a much more realistic solid model of a bladed-disk in order to evaluate the effect of the spatial variation in loading on blade dominated modes. Neither research on the accuracy of the frequency response method when used in this context or a comprehensive study of the effect of test-observed variation on blade forced response have been found in the literature, so this research is a new contribution to practical structural dynamic analysis of gas turbines. The primary excitation of the upstream nozzles interacts with the blades on fuel pump of the J2X causes the 5th Nodal diameter modes to be excited, as explained by Tyler and Sofrin1, so a modal analysis was first performed on the beam/plate model and the 5ND bladed-disk mode at 40167 hz was identified and chosen to be the one excited at resonance (see figure 1). The first forced response analysis with this model focuses on identifying differences between frequency and transient response analyses. A hypothesis going into the analysis was that perhaps the frequency response was enforcing a temporal periodicity that did not really exist, and so therefore it would overestimate the response. As high dynamic response was a considerable source of stress in the J2X, examining this concept could potentially be beneficial for the program.

Brown, Andrew M.↗

Characterization of Deficiencies in the Frequency Domain Forced Response Analysis Technique for Turbine Bladed Disks

Turbine blades in rocket and jet engine turbomachinery experience enormous harmonic loading conditions. These loads result from the integer number of upstream and downstream stator vanes as well as the other turbine stages. The standard technique for forced response analysis to assess structural integrity is to decompose a CFD generated flow field into its harmonic components, and to then perform a frequency response analysis at the problematic natural frequencies. Recent CFD analysis and water-flow testing at NASA/MSFC, though, indicates that this technique may miss substantial harmonic and non-harmonic excitation sources that become present in complex flows. These complications suggest the question of whether frequency domain analysis is capable of capturing the excitation content sufficiently. Two studies comparing frequency response analysis with transient response analysis, therefore, have been performed. The first is of a bladed disk with each blade modeled by simple beam elements. It was hypothesized that the randomness and other variation from the standard harmonic excitation would reduce the blade structural response, but the results showed little reduction. The second study was of a realistic model of a bladed-disk excited by the same CFD used in the J2X engine program. The results showed that the transient analysis results were up to 10% higher for "clean" nodal diameter excitations and six times larger for "messy" excitations, where substantial Fourier content around the main harmonic exists.

Brown, Andrew M.↗

A Search Model for Imperfectly Detected Targets

Under the assumptions that 1) the search region can be divided up into N non-overlapping sub-regions that are searched sequentially, 2) the probability of detection is unity if a sub-region is selected, and 3) no information is available to guide the search, there are two extreme case models. The search can be done perfectly, leading to a uniform distribution over the number of searches required, or the search can be done with no memory, leading to a geometric distribution for the number of searches required with a success probability of 1/N. If the probability of detection P is less than unity, but the search is done otherwise perfectly, the searcher will have to search the N regions repeatedly until detection occurs. The number of searches is thus the sum two random variables. One is N times the number of full searches (a geometric distribution with success probability P) and the other is the uniform distribution over the integers 1 to N. The first three moments of this distribution were computed, giving the mean, standard deviation, and the kurtosis of the distribution as a function of the two parameters. The model was fit to the data presented last year (Ahumada, Billington, & Kaiwi, 2 required to find a single pixel target on a simulated horizon. The model gave a good fit to the three moments for all three observers.

Ahumada, Albert↗

Stereo and IMU-Assisted Visual Odometry for Small Robots

This software performs two functions: (1) taking stereo image pairs as input, it computes stereo disparity maps from them by cross-correlation to achieve 3D (three-dimensional) perception; (2) taking a sequence of stereo image pairs as input, it tracks features in the image sequence to estimate the motion of the cameras between successive image pairs. A real-time stereo vision system with IMU (inertial measurement unit)-assisted visual odometry was implemented on a single 750 MHz/520 MHz OMAP3530 SoC (system on chip) from TI (Texas Instruments). Frame rates of 46 fps (frames per second) were achieved at QVGA (Quarter Video Graphics Array i.e. 320 240), or 8 fps at VGA (Video Graphics Array 640 480) resolutions, while simultaneously tracking up to 200 features, taking full advantage of the OMAP3530's integer DSP (digital signal processor) and floating point ARM processors. This is a substantial advancement over previous work as the stereo implementation produces 146 Mde/s (millions of disparities evaluated per second) in 2.5W, yielding a stereo energy efficiency of 58.8 Mde/J, which is 3.75 better than prior DSP stereo while providing more functionality.

Source record↗

A Linear Programming Approach to the Development of Contrail Reduction Strategies Satisfying Operationally Feasible Constraints

A class of strategies has been proposed to reduce contrail formation in the United States airspace. A 3D grid based on weather data and the cruising altitude level of aircraft is adjusted to avoid the persistent contrail potential area with the consideration to fuel-efficiency. In this paper, the authors introduce a contrail avoidance strategy on 3D grid by considering additional operationally feasible constraints from an air traffic controller's aspect. First, shifting too many aircraft to the same cruising level will make the miles-in-trail at this level smaller than the safety separation threshold. Furthermore, the high density of aircraft at one cruising level may exceed the workload for the traffic controller. Therefore, in our new model we restrict the number of total aircraft at each level. Second, the aircraft count variation for successive intervals cannot be too drastic since the workload to manage climbing/descending aircraft is much larger than managing cruising aircraft. The contrail reduction is formulated as an integer-programming problem and the problem is shown to have the property of total unimodularity. Solving the corresponding relaxed linear programming with the simplex method provides an optimal and integral solution to the problem. Simulation results are provided to illustrate the methodology.

Wei, Peng↗

Efficient Computation of Separation-Compliant Speed Advisories for Air Traffic Arriving in Terminal Airspace

A class of problems in air traffic management asks for a scheduling algorithm that supplies the air traffic services authority not only with a schedule of arrivals and departures, but also with speed advisories. Since advisories must be finite, a scheduling algorithm must ultimately produce a finite data set, hence must either start with a purely discrete model or involve a discretization of a continuous one. The former choice, often preferred for intuitive clarity, naturally leads to mixed-integer programs, hindering proofs of correctness and computational cost bounds (crucial for real-time operations). In this paper, a hybrid control system is used to model air traffic scheduling, capturing both the discrete and continuous aspects. This framework is applied to a class of problems, called the Fully Routed Nominal Problem. We prove a number of geometric results on feasible schedules and use these results to formulate an algorithm that attempts to compute a collective speed advisory, effectively finite, and has computational cost polynomial in the number of aircraft. This work is a first step toward optimization and models refined with more realistic detail.

Sadovsky, Alexander V.↗

Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion

Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current approach to allow for arbitrary motion. Model problem results in one and two dimensions are included to demonstrate the viability of the method and the convergence properties. Section IV briefly outlines the implementation into the OVERFLOW solver, and the abstract closes with a description of the benchmark test cases which will be included in the final paper.

Leffell, Joshua Isaac↗

Applied Meteorology Unit (AMU) Quarterly Report Third Quarter FY-08

This report summarizes the Applied Meteorology Unit (AMU) activities for the third quarter of Fiscal Year 2008 (April - June 2008). Tasks reported on are: Peak Wind Tool for User Launch Commit Criteria (LCC), Anvil Forecast Tool in AWIPS Phase II, Completion of the Edward Air Force Base (EAFB) Statistical Guidance Wind Tool, Volume Averaged Height Integ rated Radar Reflectivity (VAHIRR), Impact of Local Sensors, Radar Scan Strategies for the PAFB WSR-74C Replacement, VAHIRR Cost Benefit Analysis, and WRF Wind Sensitivity Study at Edwards Air Force Base

Bauman, William↗

Java Programming Language

The Java seminar covers the fundamentals of Java programming language. No prior programming experience is required for participation in the seminar. The first part of the seminar covers introductory concepts in Java programming including data types (integer, character, ..), operators, functions and constants, casts, input, output, control flow, scope, conditional statements, and arrays. Furthermore, introduction to Object-Oriented programming in Java, relationships between classes, using packages, constructors, private data and methods, final instance fields, static fields and methods, and overloading are explained. The second part of the seminar covers extending classes, inheritance hierarchies, polymorphism, dynamic binding, abstract classes, protected access. The seminar conclude by introducing interfaces, properties of interfaces, interfaces and abstract classes, interfaces and cailbacks, basics of event handling, user interface components with swing, applet basics, converting applications to applets, the applet HTML tags and attributes, exceptions and debugging.

Shaykhian, Gholam Ali↗