Search NASA⌕ Search

SEARCH · Search NASA

Results for “Point Optimization”

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 991 records · Page 55

The Zwicky Transient Facility: Data Processing, Products, and Archive

The Zwicky Transient Facility (ZTF) is a new robotic time-domain survey currently in progress using the Palomar 48-inch Schmidt Telescope. ZTF uses a 47 square degree field with a 600 megapixel camera to scan the entire northern visible sky at rates of ∼3760 square degrees/hour to median depths of g ~ 20.8 and r ~ 20.6 mag (AB, 5σ in 30 sec). We describe the Science Data System that is housed at IPAC, Caltech. This comprises the data-processing pipelines, alert production system, data archive, and user interfaces for accessing and analyzing the products. The real-time pipeline employs a novel image-differencing algorithm, optimized for the detection of point-source transient events. These events are vetted for reliability using a machine-learned classifier and combined with contextual information to generate data-rich alert packets. The packets become available for distribution typically within 13 minutes (95th percentile) of observation. Detected events are also linked to generate candidate moving-object tracks using a novel algorithm. Objects that move fast enough to streak in the individual exposures are also extracted and vetted. We present some preliminary results of the calibration performance delivered by the real-time pipeline. The reconstructed astrometric accuracy per science image with respect to Gaia DR1 is typically 45 to 85 milliarcsec. This is the RMS per-axis on the sky for sources extracted with photometric S/N ≥10 and hence corresponds to the typical astrometric uncertainty down to this limit. The derived photometric precision (repeatability) at bright unsaturated fluxes varies between 8 and 25 millimag. The high end of these ranges corresponds to an airmass approaching ∼2—the limit of the public survey. Photometric calibration accuracy with respect to Pan-STARRS1 is generally better than 2%. The products support a broad range of scientific applications: fast and young supernovae; rare flux transients; variable stars; eclipsing binaries; variability from active galactic nuclei; counterparts to gravitational wave sources; a more complete census of Type Ia supernovae; and solar-system objects.

Frank J. Masci↗

SCORPIO: A Scalable Two-Phase Parallel I/O Library With Application To A Large Scale Subsurface Simulator

Inefficient parallel I/O is known to be a major bottleneck among scientific applications employed on supercomputers as the number of processor cores grows into the thousands. Our prior experience indicated that parallel I/O libraries such as HDF5 that rely on MPI-IO do not scale well beyond 10K processor cores, especially on parallel file systems (like Lustre) with single point of resource contention. Our previous optimization efforts for a massively parallel multi-phase and multi-component subsurface simulator (PFLOTRAN) led to a two-phase I/O approach at the application level where a set of designated processes participate in the I/O process by splitting the I/O operation into a communication phase and a disk I/O phase. The designated I/O processes are created by splitting the MPI global communicator into multiple sub-communicators. The root process in each sub-communicator is responsible for performing the I/O operations for the entire group and then distributing the data to rest of the group. This approach resulted in over 25X speedup in HDF I/O read performance and 3X speedup in write performance for PFLOTRAN at over 100K processor cores on the ORNL Jaguar supercomputer. This research describes the design and development of a general purpose parallel I/O library, SCORPIO (SCalable block-ORiented Parallel I/O) that incorporates our optimized two-phase I/O approach. The library provides a simplified higher level abstraction to the user, sitting atop existing parallel I/O libraries (such as HDF5) and implements optimized I/O access patterns that can scale on larger number of processors. Performance results with standard benchmark problems and PFLOTRAN indicate that our library is able to maintain the same speedups as before with the added flexibility of being applicable to a wider range of I/O intensive applications.

High Performance Computing↗

Single-Stage Bunch Compressor for ILC-SB2009

The Project Management Design Team of the International Linear Collider has recently proposed fundamental changes to the published ILC RDR baseline with the goal of presenting a potential alternate design providing a more cost-effective solution. In this framework a new lattice for the Damping Rings has been presented, shortening the exit bunch length from the RDR value of 9 mm down to 6 mm. The shorter bunch length allowed the adoption of a simpler single-stage bunch compressor, instead of the RDR two-stage compressor. The new single-stage compressor has a compression ratio of 20 and still achieves the nominal RDR value of 0.3 mm bunch length at the Interaction Point. The new design has been optimized to generate the required compression while having a small SR emittance growth, and reduced energy spread. The new lattice and its optimization procedure are presented in this paper.

43 PARTICLE ACCELERATORS↗

Nash Embedding and Equilibrium in Pure Quantum States

With respect to probabilistic mixtures of the strategies in non-cooperative games, quantum game theory provides guarantee of fixed-point stability, the so-called Nash equilibrium. This permits players to choose mixed quantum strategies that prepare mixed quantum states optimally under constraints. Here, we show here that fixed-point stability of Nash equilibrium can also be guaranteed for pure quantum strategies via an application of the Nash embedding theorem, permitting players to prepare pure quantum states optimally under constraints.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-D-BRA-04: Computerized Framework for Marker-Less Localization of Anatomical Feature Points in Range Images Based On Differential Geometry Features for Image-Guided Radiation Therapy

Purpose: To propose a computerized framework for localization of anatomical feature points on the patient surface in infrared-ray based range images by using differential geometry (curvature) features. Methods: The general concept was to reconstruct the patient surface by using a mathematical modeling technique for the computation of differential geometry features that characterize the local shapes of the patient surfaces. A region of interest (ROI) was firstly extracted based on a template matching technique applied on amplitude (grayscale) images. The extracted ROI was preprocessed for reducing temporal and spatial noises by using Kalman and bilateral filters, respectively. Next, a smooth patient surface was reconstructed by using a non-uniform rational basis spline (NURBS) model. Finally, differential geometry features, i.e. the shape index and curvedness features were computed for localizing the anatomical feature points. The proposed framework was trained for optimizing shape index and curvedness thresholds and tested on range images of an anthropomorphic head phantom. The range images were acquired by an infrared ray-based time-of-flight (TOF) camera. The localization accuracy was evaluated by measuring the mean of minimum Euclidean distances (MMED) between reference (ground truth) points and the feature points localized by the proposed framework. The evaluation was performed for points localized on convex regions (e.g. apex of nose) and concave regions (e.g. nasofacial sulcus). Results: The proposed framework has localized anatomical feature points on convex and concave anatomical landmarks with MMEDs of 1.91±0.50 mm and 3.70±0.92 mm, respectively. A statistically significant difference was obtained between the feature points on the convex and concave regions (P<0.001). Conclusion: Our study has shown the feasibility of differential geometry features for localization of anatomical feature points on the patient surface in range images. The proposed framework might be useful for tasks involving feature-based image registration in range-image guided radiation therapy.

60 APPLIED LIFE SCIENCES↗

Optimal message log reclamation for independent checkpointing

Independent (uncoordinated) check pointing for parallel and distributed systems allows maximum process autonomy but suffers from possible domino effects and the associated storage space overhead for maintaining multiple checkpoints and message logs. In most research on check pointing and recovery, it was assumed that only the checkpoints and message logs older than the global recovery line can be discarded. It is shown how recovery line transformation and decomposition can be applied to the problem of efficiently identifying all discardable message logs, thereby achieving optimal garbage collection. Communication trace-driven simulation for several parallel programs is used to show the benefits of the proposed algorithm for message log reclamation.

Wang, Yi-Min↗

Optimal message log reclamation for independent checkpointing

Independent (uncoordinated) check pointing for parallel and distributed systems allows maximum process autonomy but suffers from possible domino effects and the associated storage space overhead for maintaining multiple checkpoints and message logs. In most research on check pointing and recovery, it was assumed that only the checkpoints and message logs older than the global recovery line can be discarded. It is shown how recovery line transformation and decomposition can be applied to the problem of efficiently identifying all discardable message logs, thereby achieving optimal garbage collection. Communication trace-driven simulation for several parallel programs is used to show the benefits of the proposed algorithm for message log reclamation.

Wang, Yi-Min↗

Optimizing the Design Tunes of the Electron Storage Ring of the Electron-Ion Collider

The Electron-Ion Collider (EIC) presently under construction at Brookhaven National Laboratory will collide polarized high energy electron beams with hadron beams with luminosities up to 10^34cm^{-2}s^{-1} in the center mass energy range of 20-140 GeV. Preliminary beam-beam simulations resulted in an optimum working point of (.08, .06) in the Electron Storage Ring (ESR). However, during the ESR polarization simulation study this working point was found to be less than optimal for electron polarization. In this article, we present beam-beam simulation results in a wide range tune scan to search for optimal ESR design tunes that are acceptable for both beam-beam and polarization performances.

43 PARTICLE ACCELERATORS↗

Time optimal paths and acceleration lines of robotic manipulators

The concept of acceleration lines and their correlation with time-optimal paths of robotic manipulators is presented. The acceleration lines represent the directions of maximum tip acceleration from a point in the manipulator work-space, starting at a zero velocity. These lines can suggest the number and shapes of time-optimal paths for a class of manipulators. It is shown that nonsingular time-optimal paths are tangent to one of the acceleration lines near the end-points. A procedure for obtaining near-optimal paths, utilizing the acceleration lines, is developed. These paths are obtained by connecting the end-points with B splines tangent to the acceleration lines. The near-minimum paths are shown to yield better traveling times than the straight-line path between the same end-points. The near-minimum paths can be used as initial conditions in existing optimization methods to speed-up convergence and computation time. This method can be used for online robot path planning and for interactive designs of robotic-cell layouts. Examples of time-optimal paths of a two-link manipulator, obtained by other optimization procedures and their acceleration lines, are shown.

Shiller, Zvi↗

Identification of PV solar cells and modules parameters using the genetic algorithms: Application to maximum power extraction

In this paper, we propose to perform a numerical technique based on genetic algorithms (GAs) to identify the electrical parameters (I{sub s}, I{sub ph}, R{sub s}, R{sub sh}, and n) of photovoltaic (PV) solar cells and modules. These parameters were used to determine the corresponding maximum power point (MPP) from the illuminated current-voltage (I-V) characteristic. The one diode type approach is used to model the AM1.5 I-V characteristic of the solar cell. To extract electrical parameters, the approach is formulated as a non convex optimization problem. The GAs approach was used as a numerical technique in order to overcome problems involved in the local minima in the case of non convex optimization criteria. Compared to other methods, we find that the GAs is a very efficient technique to estimate the electrical parameters of PV solar cells and modules. Indeed, the race of the algorithm stopped after five generations in the case of PV solar cells and seven generations in the case of PV modules. The identified parameters are then used to extract the maximum power working points for both cell and module. (author)

14 SOLAR ENERGY↗

Post-processing interstitialcy diffusion from molecular dynamics simulations

An algorithm to rigorously trace the interstitialcy diffusion trajectory in crystals is developed. The algorithm incorporates unsupervised learning and graph optimization which obviate the need to input extra domain specific information depending on crystal or temperature of the simulation. The algorithm is implemented in a flexible framework as a post-processor to molecular dynamics (MD) simulations. We describe in detail the reduction of interstitialcy diffusion into known computational problems of unsupervised clustering and graph optimization. We also discuss the steps, computational efficiency and key components of the algorithm. Using the algorithm, thermal interstitialcy diffusion from low to near-melting point temperatures is studied. We encapsulate the algorithms in a modular framework with functionality to calculate diffusion coefficients, migration energies and other trajectory properties. The study validates the algorithm by establishing the conformity of output parameters with experimental values and provides detailed insights for the interstitialcy diffusion mechanism. The algorithm along with the help of supporting visualizations and analysis gives convincing details and a new approach to quantifying diffusion jumps, jump-lengths, time between jumps and to identify interstitials from lattice atoms. -- Graphical abstract:.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dithering Strategies and Point-Source Photometry

The accuracy in the photometry of a point source depends on the point-spread function (PSF), detector pixelization, and observing strategy. The PSF and pixel response describe the spatial blurring of the source, the pixel scale describes the spatial sampling of a single exposure, and the observing strategy determines the set of dithered exposures with pointing offsets from which the source flux is inferred. In a wide-field imaging survey, sources of interest are randomly distributed within the field of view and hence are centered randomly within a pixel. A given hardware configuration and observing strategy therefore have a distribution of photometric uncertainty for sources of fixed flux that fall in the field. In this article we explore the ensemble behavior of photometric and position accuracies for different PSFs, pixel scales, and dithering patterns. We find that the average uncertainty in the flux determination depends slightly on dither strategy, whereas the position determination can be strongly dependent on the dithering. For cases with pixels much larger than the PSF, the uncertainty distributions can be non-Gaussian, with rms values that are particularly sensitive to the dither strategy. We also find that for these configurations with large pixels, pointings dithered by a fractional pixel amount do not always give minimal average uncertainties; this is in contrast to image reconstruction for which fractional dithers are optimal. When fractional pixel dithering is favored, a pointing accuracy of better than {approx}0.15 {approx}0.15 pixel width is required to maintain half the advantage over random dithers.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimum shape of a Kirkpatrick-Baez X-ray reflector supported at discrete points for on-axis performance

A method is proposed for optimizing the on-axis resolution of a Kirkpatrick-Baez reflecting element. The proposed procedure provides a way to determine the location of each of the 11,200 support points (175 different points plus repeats) by using a computer-assisted structural-optical software package. This automated procedure will make it possible to determine the optical characteristics of an entire telescope module consisting of seventy mirrors.

Cohen, L. M.↗

KinBot: Automated stationary point search on potential energy surfaces

KinBot is a Python code that automatically characterizes kinetically important stationary points on reactive potential energy surfaces and arranges the results into a form that lends itself easily to master equation calculations. This version of KinBot tackles C, H, O and S atom containing species and unimolecular (isomerization or dissociation) reactions. KinBot iteratively changes the geometry of the reactant to obtain initial guesses for reactive saddle points defined by KinBot’s reaction types, which are then optimized by a third-party quantum chemistry package. KinBot verifies the connectivity of the saddle points with the reactant and identifies the products through intrinsic reaction coordinate calculations. Here, new calculations can be automatically spawned from the products to obtain complete potential energy surfaces. The utilities of KinBot include conformer searches, projected frequency and hindered rotor calculations, and the automatic determination of the rotational symmetry numbers. Input files for popular RRKM master equation codes are automatically built, enabling an automated workflow all the way to the calculation of pressure and temperature dependent rate coefficients. Four examples are as follows: (i) [1,3]-sigmatropic H-migration reactions of unsaturated hydrocarbons and oxygenates are calculated to assess the relative importance of suprafacial and antrafacial reactions. (ii) Saddle points on three products of gamma-valerolactone thermal decomposition are studied and compared to literature potential energy surfaces. (iii) The previously published propene+OH reaction is reproduced to show the capability of building an entire potential energy surface. (iv) All species up to C4 in the Aramco Mech 2.0 are subjected to a KinBot search.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Practical aspects of variable reduction formulations and reduced basis algorithms in multidisciplinary design optimization

This paper discusses certain connections between nonlinear programming algorithms and the formulation of optimization problems for systems governed by state constraints. The major points of this paper are the detailed calculation of the sensitivities associated with different formulations of optimization problems and the identification of some useful relationships between different formulations. These relationships have practical consequences; if one uses a reduced basis nonlinear programming algorithm, then the implementations for the different formulations need only differ in a single step.

Lewis, Robert Michael↗

Statistical analysis of piloted simulation of real time trajectory optimization algorithms

A simulation of time-optimal intercept algorithms for on-board computation of control commands is described. The effects of three different display modes and two different computation modes on the pilots' ability to intercept a moving target in minimum time were tested. Both computation modes employed singular perturbation theory to help simplify the two-point boundary value problem associated with trajectory optimization. Target intercept time was affected by both the display and computation modes chosen, but the display mode chosen was the only significant influence on the miss distance.

Price, D. B.↗

Improving experimental phases for strong reflections prior to density modification

A genetic algorithm has been developed to optimize the phases of the strongest reflections in SIR/SAD data. This is shown to facilitate density modification and model building in several test cases. Experimental phasing of diffraction data from macromolecular crystals involves deriving phase probability distributions. These distributions are often bimodal, making their weighted average, the centroid phase, improbable, so that electron-density maps computed using centroid phases are often non-interpretable. Density modification brings in information about the characteristics of electron density in protein crystals. In successful cases, this allows a choice between the modes in the phase probability distributions, and the maps can cross the borderline between non-interpretable and interpretable. Based on the suggestions by Vekhter [Vekhter (2005 ▶), Acta Cryst. D61, 899–902], the impact of identifying optimized phases for a small number of strong reflections prior to the density-modification process was investigated while using the centroid phase as a starting point for the remaining reflections. A genetic algorithm was developed that optimizes the quality of such phases using the skewness of the density map as a target function. Phases optimized in this way are then used in density modification. In most of the tests, the resulting maps were of higher quality than maps generated from the original centroid phases. In one of the test cases, the new method sufficiently improved a marginal set of experimental SAD phases to enable successful map interpretation. A computer program, SISA, has been developed to apply this method for phase improvement in macromolecular crystallography.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An Iterative Approach for Solving the SCOPF Problem Applying LP, SOCP, and NLP Subproblems

We propose to develop efficient algorithms and software for the SCOPF problem. We will employ an iterative approach that will: a) use linear subproblems and other active set filtering techniques to identify the most important contingencies and drastically reduce the SCOPF model size; b) solve SOCP relaxations of the reduced SCOPF to converge to the neighborhood of the global optimal solution and establish a lower bound on the solution, and; c) use a non-convex, nonlinear interior-point solver, Artelys Knitro, to converge quickly to the optimal solution. To identify the most effective approach, we will experiment with several techniques to identify the tradeoffs between contingency subproblem complexity and fast solvability.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗