Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematical techniques”

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 757 records · Page 42

AMM: Adaptive Multilinear Meshes

Adaptive representations are increasingly indispensable for reducing the in-memory and on-disk footprints of large-scale data. Usual solutions are designed broadly along two themes: reducing data precision, e.g., through compression, or adapting data resolution, e.g., using spatial hierarchies. Additionally, recent research suggests that combining the two approaches, i.e., adapting both resolution and precision simultaneously, can offer significant gains over using them individually. However, there currently exist no practical solutions to creating and evaluating such representations at scale. In this work, we present a new resolution-precision-adaptive representation to support hybrid data reduction schemes and offer an interface to existing tools and algorithms. Through novelties in spatial hierarchy, our representation, Adaptive Multilinear Meshes (AMM), provides considerable reduction in the mesh size. AMM creates a piecewise multilinear representation of uniformly sampled scalar data and can selectively relax or enforce constraints on conformity, continuity, and coverage, delivering a flexible adaptive representation. AMM also supports representing the function using mixed-precision values to further the achievable gains in data reduction. We describe a practical approach to creating AMM incrementally using arbitrary orderings of data and demonstrate AMM on six types of resolution and precision datastreams. By interfacing with state-of-the-art rendering tools through VTK, we demonstrate the practical and computational advantages of our representation for visualization techniques. With an open-source release of our tool to create AMM, we make such evaluation of data reduction accessible to the community, which we hope will foster new opportunities and future data reduction schemes.

97 MATHEMATICS AND COMPUTING↗

Mathematical Modeling of an Oscillating Droplet

Oscillating droplets are of interest in a number of disciplines. A practical application is the oscillating drop method, which is a technique for measuring surface tension and viscosity of liquid metals. It is especially suited to undercooled and highly reactive metals, because it is performed by electromagnetic levitation. The natural oscillation frequency of the droplets is related to the surface tension of the material, and the decay of oscillations is related to its viscosity. The fluid flow inside the droplet must be laminar in order for this technique to yield good results. Because no experimental method has yet been developed to visualize flow in electromagnetically-levitated oscillating metal droplets, mathematical modeling is required to determine whether or not turbulence occurs. Three mathematical models of the flow: (1) assuming laminar conditions, (2) using the k-epsilon turbulence model, and (3) using the RNG turbulence model, respectively, are compared and contrasted to determine the physical characteristics of the flow. It is concluded that the RNG model is the best suited for describing this problem. The goal of the presented work was to characterize internal flow in an oscillating droplet of liquid metal, and to verify the accuracy of the characterization by comparing calculated surface tension and viscosity.

Berry, S.↗

Diversity for Microelectronics Lifecycle Security

In this work we examine approaches for using implementation diversity to disrupt or disable hardware trojans. We explore a variety of general frameworks for building diverse variants of circuits in voting architectures, and examine the impact of these on attackers and defenders mathematically and empirically. This work is augmented by analysis of a new majority voting technique. We also describe several automated approaches for generating diverse variants of a circuit and empirically study the overheads associated with these. We then describe a general technique for targeting functional circuit modifications to hardware trojans, present several specific implementations of this technique, and study the impact that they have on trojanized benchmark circuits.

97 MATHEMATICS AND COMPUTING↗

A global solution to the Schrödinger equation: From Henstock to Feynman

One of the key elements of Feynman’s formulation of non-relativistic quantum mechanics is a so-called Feynman path integral. It plays an important role in the theory, but it appears as a postulate based on intuition, rather than a well-defined object. All previous attempts to supply Feynman’s theory with rigorous mathematics underpinning, based on the physical requirements, have not been satisfactory. The difficulty comes from the need to define a measure on the infinite dimensional space of paths and to create an integral that would possess all of the properties requested by Feynman. In the present paper, we consider a new approach to defining the Feynman path integral, based on the theory developed by Muldowney [A Modern Theory of Random Variable: With Applications in Stochastic Calcolus, Financial Mathematics, and Feynman Integration (John Wiley & Sons, Inc., New Jersey, 2012)]. Muldowney uses the Henstock integration technique and deals with non-absolute integrability of the Fresnel integrals, in order to obtain a representation of the Feynman path integral as a functional. This approach offers a mathematically rigorous definition supporting Feynman’s intuitive derivations. But in his work, Muldowney gives only local in space-time solutions. A physical solution to the non-relativistic Schrödinger equation must be global, and it must be given in the form of a unitary one-parameter group in L{sup 2}(ℝ{sup n}). The purpose of this paper is to show that a system of one-dimensional local Muldowney’s solutions may be extended to yield a global solution. Moreover, the global extension can be represented by a unitary one-parameter group acting in L{sup 2}(ℝ{sup n})

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

INTERFERENCE DETECTION IN GAUSSIAN NOISE

Interference detection in Gaussian noise is proposed. It can be applied for easy detection and editing of interference lines in radio spectral line observations. One does not need to know the position of occurrence or keep track of interference in the band. By using statistical properties of N-channel Gaussian noise it is possible to differentiate interference from normal Gaussian noise. These statistical properties are three quantities which are calculated on the subject spectrum. The first is the expected absolute maximum from the mean level across the spectrum. The second is the expected absolute difference maximum (array of adjacent differences of channel values taken across the spectrum), and the third is the expected absolute added difference maximum. For N-channel Gaussian noise, these quantities have a well-defined value. Any deviation across the spectrum that violates an upper limit formed by these expected maxima is attributed to interference. Results obtained on real data by applying this technique have been displayed.

97 MATHEMATICS AND COMPUTING↗

Enhanced Approximate Nearest Neighbor via Local Area Focused Search.

Approximate Nearest Neighbor (ANN) algorithms are increasingly important in machine learning, data mining, and image processing applications. There is a large family of space- partitioning ANN algorithms, such as randomized KD-Trees, that work well in practice but are limited by an exponential increase in similarity comparisons required to optimize recall. Additionally, they only support a small set of similarity metrics. We present Local Area Fo- cused Search (LAFS), a method that enhances the way queries are performed using an existing ANN index. Instead of a single query, LAFS performs a number of smaller (fewer similarity comparisons) queries and focuses on a local neighborhood which is refined as candidates are identified. We show that our technique improves performance on several well known datasets and is easily extended to general similarity metrics using kernel projection techniques.

97 MATHEMATICS AND COMPUTING↗

Computation research

TOCS, computer programming technique, for possible application to 360 computer

MATHEMATICS↗

Communication systems, transceivers, and methods for generating data based on channel characteristics

Examples of methods for generating data based on a communications channel are described. In one such example, a processing unit may generate a first vector representation based in part on at least two characteristics of a communications channel. A constellation having at least two dimensions may be addressed with the first vector representation to identify a first symbol associated with the first vector representation. The constellation represents a plurality of regions, each region associated with a respective symbol. The symbol may be used to generate data, which may stored in an electronic storage medium and used as a cryptographic key or a spreading code or hopping sequence in a modulation technique.

97 MATHEMATICS AND COMPUTING↗

Cyber Hygiene for Control System Security

There are many resources from government and private industry available to assist organizations in reducing their attack surface and enhancing their security posture. Furthermore, standards are being written and improved upon to make the practice of securing a network more manageable. And while the specifics of network security are complex, most system vulnerabilities can be mitigated using fairly simple cyber hygiene techniques like those offered above.

97 MATHEMATICS AND COMPUTING↗

Visualizing Electrical Power Systems as Flow Fields

We describe a method for visualizing data flows on large networks. We transform data flow on fixed networks into a vector field, which can be directly visualized using scientific flow visualization techniques. We evaluated the method on power flowing through two transmission power networks: a small, regional, IEEE test system (RTS-96) and a large national-scale system (the Eastern Interconnection). For the larger and more complex transmission system, the method illustrates features of the power flow that are not accessible when visualizing the power transmission with traditional network visualization techniques.

97 MATHEMATICS AND COMPUTING↗

A PVS Prover Strategy Package for Common Manipulations

Sequent manipulations for an interactive prover such as PVS can often be labor intensive. We describe an approach to tactic-based proving for improved interactive deduction in specialized domains. An experimental package of strategies (tactics) and support functions has been developed for PVS to reduce the tedium of arithmetic manipulation. Included are strategies aimed at algebraic simplification of real-valued expressions as well as term-access techniques applicable in arbitrary settings. The approach is general enough to serve in other mathematical domains and for provers other than PVS. This report presents the full set of arithmetic strategies and discusses how they are invoked within the prover. Included is a description of the extended expression notation for accessing terms as well as a substitution technique provided for higher-order strategies. Several sample proofs are displayed in full to show how the strategies might be used in practice.

DiVito, Ben L.↗

A Survey of Techniques for Approximate Computing

Approximate computing trades off computation quality with the effort expended and as rising performance demands confront with plateauing resource budgets, approximate computing has become, not merely attractive, but even imperative. Here, we present a survey of techniques for approximate computing (AC). We discuss strategies for finding approximable program portions and monitoring output quality, techniques for using AC in different processing units (e.g., CPU, GPU and FPGA), processor components, memory technologies etc., and programming frameworks for AC. Moreover, we classify these techniques based on several key characteristics to emphasize their similarities and differences. Finally, the aim of this paper is to provide insights to researchers into working of AC techniques and inspire more efforts in this area to make AC the mainstream computing approach in future systems.

97 MATHEMATICS AND COMPUTING↗

Accelerating SNP Development with Radiation Source Approximations for Far-Field Environment Modeling

The successful development and deployment of space nuclear power and propulsion technology requires a high-fidelity, efficient means of modeling ex-core radiation fields. Monte Carlo particle transport codes provide enable the highest level of fidelity in radiation field modeling but are inefficient for modeling ex-core radiation without modification. This paper details the development of an approach to ex-core radiation field modeling that maintains the fidelity of a Monte Carlo transport approach without sacrificing computational efficiency. This approach is based on recent improvements to an existing Monte Carlo transport acceleration technique known as surface source banking. As the transport of many particles is required to ensure adequate uncertainty in far field transport, analytical reconstruction techniques are employed to represent surface source banks as sampleable series of distributions in particle phase from which an arbitrarily large number of particles can be generated and simulated. All steps of this approach are incorporated into an AMA model to test both the underlying mathematics of the analytical source reconstruction process, as well as the relevance of the technique as a whole towards SNP applications. These tests demonstrated that this approach is capable of accelerating far-field radiation modeling in SNP-relevant scenarios by factors of at least nine over purely eigenvalue-based scenarios without significantly sacrificing simulation accuracy.

Surface Source Banking↗

Preparation of course materials: Elementary mathematics of powered flight

Non-science students at William and Mary will soon be required to take a mathematics course in order to earn a bachelor's degree. A standard menu of technique courses is the usual way in which universities provide for this requirement: Trigonometry, probability, geometry for teachers, and the like. In this work, we attempt to break away from these largely unsuccessful choices. Our intent is to prepare material that sets a variety of simple mathematical procedures in the context of a commonly experienced part of students' lives: riding in commercial airplanes. The work, begun last summer at Langley, is now close to completion and trial in upcoming fall term at William and Mary. As of this writing, the narrative is complete for 12 to 14 projected sections. We have prepared material on wind triangles, wind roses, navigation maps, drag induced loss of velocity for unpowered missiles (tennis balls), luggage and its effect on center of gravity, localized magnetic declination and VOR orientation, geometry of great circles, terminal velocity for falling bodies, pressure vessels: tires and balloons and blimps, global structure of declination lines, map projections (mercator, azimuthal equidistant, Lambert), ears and their reaction to altitude change. The next section will treat lift, drag and thrust. The last will treat control surfaces. The entire approach avoids any effort to investigate mathematical topics that arise in the solution of problems. And by the same token, we avoid any organized attempt to explain aeronautical engineering, even on an elementary level. We look only at enough mathematics to do a problem and we select only engineering topics that permit some kind of (elementary) mathematical analysis. In the end, we will think of the material as successful if two things happen: Students must come away with some confidence that even lay people can quantify parts of their surroundings. Other potential instructors must be willing to gain enough familiarity with the physical content of the material so that it can be used at other universities.

Rublein, George T.↗

Estimation of Dynamical Parameters in Atmospheric Data Sets

In this study a new technique is used to derive dynamical parameters out of atmospheric data sets. This technique, called the structure tensor technique, can be used to estimate dynamical parameters such as motion, source strengths, diffusion constants or exponential decay rates. A general mathematical framework was developed for the direct estimation of the physical parameters that govern the underlying processes from image sequences. This estimation technique can be adapted to the specific physical problem under investigation, so it can be used in a variety of applications in trace gas, aerosol, and cloud remote sensing. The fundamental algorithm will be extended to the analysis of multi- channel (e.g. multi trace gas) image sequences and to provide solutions to the extended aperture problem. In this study sensitivity studies have been performed to determine the usability of this technique for data sets with different resolution in time and space and different dimensions.

Wenig, Mark O.↗

Visualization of second order tensor fields and matrix data

We present a study of the visualization of 3-D second order tensor fields and matrix data. The general problem of visualizing unsymmetric real or complex Hermitian second order tensor fields can be reduced to the simultaneous visualization of a real and symmetric second order tensor field and a real vector field. As opposed to the discrete iconic techniques commonly used in multivariate data visualization, the emphasis is on exploiting the mathematical properties of tensor fields in order to facilitate their visualization and to produce a continuous representation of the data. We focus on interactively sensing and exploring real and symmetric second order tensor data by generalizing the vector notion of streamline to the tensor concept of hyperstreamline. We stress the importance of a structural analysis of the data field analogous to the techniques of vector field topology extraction in order to obtain a unique and objective representation of second order tensor fields.

Delmarcelle, Thierry↗

Transient Heat Transfer in Zero Gravity Environment

The objective is to provide computer codes and/or correlations for application in the design of transient heat transfer systems. The mathematical models in the computer codes are being tested by experimental data obtained in the laboratory using optical techniques. The elimination of natural convection (buoyancy) in the experimental data obtained in zero-g (KC-135) facilitates the study of thermal expansion effects which is of interest in the development and testing of the mathematical models of the transient heat transfer. Initial flight in the KC 135 (June 1983) suggested some modifications to the experimental apparatus and the data acquisition technique (high speed video will replace high speed movies for recording optical records generated during the experiments). A series of KC-135 flights with this experiment on board are scheduled for summer/fall 1984. The acquisition of the aforementioned data using interferometry and beam deflection optical techniques is anticipated. The measurements provide time dependent temperature fields above a horizontal heater surface submerged in a static fluid (Freon 13). The heater surface is electrically heated for a time interval approximately 0.100 sec. during which the data are optically recorded.

Giarratano, P. G.↗