Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 1,711 records · Page 95

Subspace Barzilai-Borwein Gradient Method for Large-Scale Bound Constrained Optimization

An active set subspace Barzilai-Borwein gradient algorithm for large-scale bound constrained optimization is proposed. The active sets are estimated by an identification technique. The search direction consists of two parts: some of the components are simply defined; the other components are determined by the Barzilai-Borwein gradient method. In this work, a nonmonotone line search strategy that guarantees global convergence is used. Preliminary numerical results show that the proposed method is promising, and competitive with the well-known method SPG on a subset of bound constrained problems from CUTEr collection.

97 MATHEMATICS AND COMPUTING↗

Optimal design and fabrication of three-dimensional calibration specimens for scanning probe microscopy

Micro-/nano-scale roughness specimens are highly demanded to synthetically calibrate the scanning probe microscopy (SPM) instrument. In this study, three-dimensional (3D) specimens with controllable main surface evaluation parameters were designed. In order to improve the design accuracy, the genetic algorithm was introduced into the conventional digital filter method. A primary 3D calibration specimen with the dimension of 10 {mu}m x 10 {mu}m was fabricated by electron beam lithography. Atomic force microscopy characterizations demonstrated that the statistical and spectral parameters of the fabricated specimen match well with the designed values. Such a kind of 3D specimens has the potential to calibrate the SPM for applications in quantitative surface evaluations.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

High-contrast imaging testbed

Several high-contrast imaging systems are currently under construction to enable the detection of extra-solar planets. In order for these systems to achieve their objectives, however, there is considerable developmental work and testing which must take place. Given the need to perform these tests, a spatially-filtered Shack-Hartmann adaptive optics system has been assembled to evaluate new algorithms and hardware configurations which will be implemented in these future high-contrast imaging systems. In this article, construction and phase measurements of a membrane 'woofer' mirror are presented. In addition, results from closed-loop operation of the assembled testbed with static phase plates are presented. The testbed is currently being upgraded to enable operation at speeds approaching 500 hz and to enable studies of the interactions between the woofer and tweeter deformable mirrors.

99 GENERAL AND MISCELLANEOUS↗

Change detection for hyperspectral sensing in a transformed low-dimensional space

We present an approach to the problem of change in hyperspectral imagery that operates in a two-dimensional space. The coordinates in the space are related to Mahalanobis distances for the combined ('stacked') data and the individual hyperspectral scenes. Although it is only two-dimensional, this space is rich enough to include several well-known change detection algorithms, including the hyperbolic anomalous change detector, based on Gaussian scene clutter, and the EC-uncorrelated detector based on heavy-tailed (elliptically contoured) clutter. Because this space is only two-dimensional, adaptive machine learning methods can produce new change detectors without being stymied by the curse of dimensionality. We investigate, in particular, the utility of the support vector machine for learning boundaries in this 2-D space, and compare the performance of the resulting nonlinearly adaptjve detector to change detectors that have themselves shown good performance.

99 GENERAL AND MISCELLANEOUS↗

Circuit model of the ITER-like antenna for JET and simulation of its control algorithms

The ITER-like Antenna (ILA) for JET [1] is a 2 toroidal by 2 poloidal array of Resonant Double Loops (RDL) featuring in-vessel matching capacitors feeding RF current straps in conjugate-T manner, a low impedance quarter-wave impedance transformer, a service stub allowing hydraulic actuator and water cooling services to reach the aforementioned capacitors and a 2nd stage phase-shifter-stub matching circuit allowing to correct/choose the conjugate-T working impedance. Toroidally adjacent RDLs are fed from a 3dB hybrid splitter. It has been operated at 33, 42 and 47MHz on plasma (2008-2009) while it presently estimated frequency range is from 29 to 49MHz. At the time of the design (2001-2004) as well as the experiments the circuit models of the ILA were quite basic. The ILA front face and strap array Topica model was relatively crude and failed to correctly represent the poloidal central septum, Faraday Screen attachment as well as the segmented antenna central septum limiter. The ILA matching capacitors, T-junction, Vacuum Transmission Line (VTL) and Service Stubs were represented by lumped circuit elements and simple transmission line models. The assessment of the ILA results carried out to decide on the repair of the ILA identified that achieving routine full array operation requires a better understanding of the RF circuit, a feedback control algorithm for the 2nd stage matching as well as tighter calibrations of RF measurements. The paper presents the progress in modelling of the ILA comprising a more detailed Topica model of the front face for various plasma Scrape Off Layer profiles, a comprehensive HFSS model of the matching capacitors including internal bellows and electrode cylinders, 3D-EM models of the VTL including vacuum ceramic window, Service stub, a transmission line model of the 2nd stage matching circuit and main transmission lines including the 3dB hybrid splitters. A time evolving simulation using the improved circuit model allowed to design and simulate the effectiveness of a feedback control algorithm for the 2nd stage matching and demonstrates the simultaneous matching and control of the 4 RDLs: 11 feedback loops control 21 actuators (8 capacitors, 4 phase shifters and 4 stubs for the 2nd stage matching, 4 main phase shifters controlling of the toroidal phasing and the electronically controlled phase between RF sources feeding top and bottom parts of the array and determines the poloidal phasing of the array which is solved explicitly at each time step) on (simulated) ELMy plasmas.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DELTACON: A Principled Massive-Graph Similarity Function with Attribution

How much did a network change since yesterday? How different is the wiring between Bob's brain (a left-handed male) and Alice's brain (a right-handed female)? Graph similarity with known node correspondence, i.e. the detection of changes in the connectivity of graphs, arises in numerous settings. In this work, we formally state the axioms and desired properties of the graph similarity functions, and evaluate when state-of-the-art methods fail to detect crucial connectivity changes in graphs. We propose DeltaCon, a principled, intuitive, and scalable algorithm that assesses the similarity between two graphs on the same nodes (e.g. employees of a company, customers of a mobile carrier). In our experiments on various synthetic and real graphs we showcase the advantages of our method over existing similarity measures. We also employ DeltaCon to real applications: (a) we classify people to groups of high and low creativity based on their brain connectivity graphs, and (b) do temporal anomaly detection in the who-emails-whom Enron graph.

97 MATHEMATICS AND COMPUTING↗

An efficient approach to unstructured mesh hydrodynamics on the cell broadband engine

Unstructured mesh physics for the Cell Broadband Engine (CBE) has received little or no attention to date, largely because the CBE architecture poses particular challenges for unstructured mesh algorithms. The most common SPU memory management strategies cannot be applied to the irregular memory access patterns of unstructured meshes, and the SPU vector instruction set does not support the indirect addressing needed by connectivity arrays. This paper presents an approach to unstructured mesh physics that addresses these challenges, by creating a new mesh data structure and reorganizing code to give efficient CBE performance. The approach is demonstrated on the FLAG production hydrodynamics code using standard test problems, and results show an average speedup of more than 5x over the original code.

99 GENERAL AND MISCELLANEOUS↗

Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

Van Benthem, Mark H↗

Second-order time evolution of P{sub N} equations for radiation transport

Using polynomials to represent the angular variation of the radiation intensity is usually referred to as the P{sub N} or spherical harmonics method. For infinite order, the representation is an exact solution of the radiation transport solution. For finite N, in some physical situations there are oscillations in the solution that can make the radiation energy density be negative. For small N, the oscillations may be large enough to force the material temperature to numerically have non-physical negative values. The second-order time evolution algorithm presented here allows for more accurate solutions with larger time steps; however, it also can resolve the negativities that first-order time solutions smear out. Therefore, artificial scattering is studied to see how it can be used to decrease the oscillations in low-order solutions and prevent negativities. Small amounts of arbitrary, non-physical scattering can significantly improve the accuracy of the solution to test problems. Flux-limited diffusion solutions can also be improved by including artificial scattering. One- and two-dimensional test results are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An efficient approach to unstructured mesh hydrodynamics on the cell broadband engine (u)

Unstructured mesh physics for the Cell Broadband Engine (CBE) has received little or no attention to date, largely because the CBE architecture poses particular challenges for unstructured mesh algorithms. SPU memory management strategies such as data preloading cannot be applied to the irregular memory storage patterns of unstructured meshes; and the SPU vector instruction set does not support the indirect addressing needed by connectivity arrays. This paper presents an approach to unstructured mesh physics that addresses these challenges, by creating a new mesh data structure and reorganizing code to give efficient CBE performance. The approach is demonstrated on the FLAG production hydrodynamics code using standard test problems, and results show an average speedup of more than 5x over the original code.

99 GENERAL AND MISCELLANEOUS↗

Particle Swarm Social Model for Group Social Learning in Adaptive Environment

This report presents a study of integrating particle swarm algorithm, social knowledge adaptation and multi-agent approaches for modeling the social learning of self-organized groups and their collective searching behavior in an adaptive environment. The objective of this research is to apply the particle swarm metaphor as a model of social learning for a dynamic environment. The research provides a platform for understanding and insights into knowledge discovery and strategic search in human self-organized social groups, such as insurgents or online communities.

97 MATHEMATICS AND COMPUTING↗

ConnectX2 In niBand Management Queues: New support for Network Of oaded

This paper introduces the newly developed InfiniBand (IB) Management Queue capability, used by the Host Channel Adapter (HCA) to manage network task data flow dependancies, and progress the communications associated with such flows. These tasks include sends, receives, and the newly supported wait task, and are scheduled by the HCA based on a data dependency description provided by the user. This functionality is supported by the ConnectX-2 HCA, and provides the means for delegating collective communication management and progress to the HCA, also known as collective communication offload. This provides a means for overlapping collective communications managed by the HCA and computation on the Central Processing Unit (CPU), thus making it possible to reduce the impact of system noise on parallel applications using collective operations. This paper further describes how this new capability can be used to implement scalable Message Passing Interface (MPI) collective operations, describing the high level details of how this new capability is used to implement the MPI Barrier collective operation, focusing on the latency sensitive performance aspects of this new capability. This paper concludes with small scale benchmark experiments comparing implementations of the barrier collective operation, using the new network offload capabilities, with established point-to-point based implementations of these same algorithms, which manage the data flow using the central processing unit. These early results demonstrate the promise this new capability provides to improve the scalability of high-performance applications using collective communications. The latency of the HCA based implementation of the barrier is similar to that of the best performing point-to-point based implementation managed by the central processing unit, starting to outperform these as the number of processes involved in the collective operation increases.

99 GENERAL AND MISCELLANEOUS↗

Breeding Realistic D‐Brane Models

Abstract Intersecting branes provide a useful mechanism to construct particle physics models from string theory with a wide variety of desirable characteristics. The landscape of such models can be enormous, and navigating towards regions which are most phenomenologically interesting is potentially challenging. Machine learning techniques can be used to efficiently construct large numbers of consistent and phenomenologically desirable models. In this work we phrase the problem of finding consistent intersecting D‐brane models in terms of genetic algorithms, which mimic natural selection to evolve a population collectively towards optimal solutions. For a four‐dimensional supersymmetric type IIA orientifold with intersecting D6‐branes, we demonstrate that unique, fully consistent models can be easily constructed, and, by a judicious choice of search environment and hyper‐parameters, of the found models contain the desired Standard Model gauge group factor. Having a sizable sample allows us to draw some preliminary landscape statistics of intersecting brane models both with and without the restriction of having the Standard Model gauge factor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive tau-leaping method for stochastic simulations of reaction-diffusion systems

Stochastic modelling is critical for studying many biochemical processes in a cell, in particular when some reacting species have low population numbers. For many such cellular processes the spatial distribution of the molecular species plays a key role. The evolution of spatially heterogeneous biochemical systems with some species in low amounts is accurately described by the mesoscopic model of the Reaction-Diffusion Master Equation. The Inhomogeneous Stochastic Simulation Algorithm provides an exact strategy to numerically solve this model, but it is computationally very expensive on realistic applications. We propose a novel adaptive time-stepping scheme for the tau-leaping method for approximating the solution of the Reaction-Diffusion Master Equation. This technique combines effective strategies for variable time-stepping with path preservation to reduce the computational cost, while maintaining the desired accuracy. The numerical tests on various examples arising in applications show the improved efficiency achieved by the new adaptive method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A computational approach for hypersonic nonequilibrium radiation utilizing space partition algorithm and Gauss quadrature

An efficient computational capability for nonequilibrium radiation simulation via the ray tracing technique has been accomplished. The radiative rate equation is iteratively coupled with the aerodynamic conservation laws including nonequilibrium chemical and chemical–physical kinetic models. The spectral properties along tracing rays are determined by a space partition algorithm of the nearest neighbor search process, and the numerical accuracy is further enhanced by a local resolution refinement using the Gauss–Lobatto polynomial. The interdisciplinary governing equations are solved by an implicit delta formulation through the diminishing residual approach. The axisymmetric radiating flow fields over the reentry RAM-CII probe have been simulated and verified with flight data and previous solutions by traditional methods. A computational efficiency gain nearly forty times is realized over that of the existing simulation procedures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computer-Based Redesign of a Beta Sandwich Protein Suggests That Extensive Negative Design is not Required for de novo beta Sheet Design

The de novo design of globular {Beta} sheet proteins remains largely an unsolved problem. It is unclear whether most designs are failing because the designed sequences do not have favorable energies in the target conformations or whether more emphasis should be placed on negative design, that is, explicitly identifying sequences that have poor energies when adopting undesired conformations. We tested whether we could redesign the sequence of a naturally occurring {Beta} sheet protein, tenascin, with a design algorithm that does not include explicit negative design. Denaturation experiments indicate that the designs are significantly more stable than the wild-type protein and the crystal structure of one design closely matches the design model. These results suggest that extensive negative design is not required to create well-folded {Beta} sandwich proteins. However, it is important to note that negative design elements may be encoded in the conformation of the protein backbone which was preserved from the wild-type protein.

36 MATERIALS SCIENCE↗

Control of collective network chaos

Under certain conditions, the collective behavior of a large globally-coupled heterogeneous network of coupled oscillators, as quantified by the macroscopic mean field or order parameter, can exhibit low-dimensional chaotic behavior. Recent advances describe how a small set of “reduced” ordinary differential equations can be derived that captures this mean field behavior. Here, we show that chaos control algorithms designed using the reduced equations can be successfully applied to imperfect realizations of the full network. To systematically study the effectiveness of this technique, we measure the quality of control as we relax conditions that are required for the strict accuracy of the reduced equations, and hence, the controller. Although the effects are network-dependent, we show that the method is effective for surprisingly small networks, for modest departures from global coupling, and even with mild inaccuracy in the estimate of network heterogeneity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MASSCLEAN-MASSIVE CLUSTER EVOLUTION AND ANALYSIS PACKAGE: DESCRIPTION AND TESTS

We present MASSCLEAN, a new, sophisticated and robust stellar cluster image and photometry simulation package. This visualization tool is able to create color-magnitude diagrams (CMDs) and standard FITS images in any of the traditional optical and near-infrared bands based on cluster characteristics input by the user, including but not limited to distance, age, mass, radius, and extinction. At the limit of very distant, unresolved clusters, we have checked the integrated colors created in MASSCLEAN against those from other simple stellar population models with consistent results. We have also tested models that provide a reasonable estimate of the field star contamination in images and CMDs. We demonstrate the package by simulating images and CMDs of well-known massive Milky Way clusters and compare their appearance to real data. Because the algorithm populates the cluster with a discrete number of tenable stars, it can be used as part of a Monte Carlo Method to derive the probabilistic range of characteristics (integrated colors, for example) consistent with a given cluster mass and age. Our simulation package is available for download and will run on any standard desktop running UNIX/Linux. Full documentation on installation and its use is also available. Finally, a Web-based version of MASSCLEAN, which can be immediately used and is sufficiently adaptable for most applications, is available through a Web interface.

79 ASTRONOMY AND ASTROPHYSICS↗