Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm selection”

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,279 records · Page 71

Optimizing squeezing in a coherent quantum feedback network of optical parametric oscillators

Advances in the emerging field of coherent quantum feedback control (CQFC) have led to the development of new capabilities in the areas of quantum control and quantum engineering, with a particular impact on the theory and applications of quantum optical networks. For this study, we consider a CQFC network consisting of two coupled optical parametric oscillators (OPOs) and study the squeezing spectrum of its output field. The performance of this network as a squeezed-light source with desired spectral characteristics is optimized by searching over the space of model parameters with experimentally motivated bounds. We use the QNET package to model the network’s dynamics and the PyGMO package of global optimization algorithms to maximize the degree of squeezing at a selected sideband frequency or the average degree of squeezing over a selected bandwidth. The use of global search methods is critical for identifying the best possible performance of the CQFC network, especially for squeezing at higher-frequency sidebands and higher bandwidths. The results demonstrate that the CQFC network of two coupled OPOs makes it possible to vary the squeezing spectrum, effectively utilize the available pump power, and overall significantly outperform a single OPO. Additionally, the Hessian eigenvalue analysis shows that the squeezing generation performance of the optimally operated CQFC network is robust to small variations of phase parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SUBARU HIGH- z EXPLORATION OF LOW-LUMINOSITY QUASARS (SHELLQs). I. DISCOVERY OF 15 QUASARS AND BRIGHT GALAXIES AT 5.7 < z < 6.9

We report the discovery of 15 quasars and bright galaxies at 5.7 < z < 6.9. This is the initial result from the Subaru High- z Exploration of Low-Luminosity Quasars project, which exploits the exquisite multiband imaging data produced by the Subaru Hyper Suprime-Cam (HSC) Strategic Program survey. The candidate selection is performed by combining several photometric approaches including a Bayesian probabilistic algorithm to reject stars and dwarfs. The spectroscopic identification was carried out with the Gran Telescopio Canarias and the Subaru Telescope for the first 80 deg{sup 2} of the survey footprint. The success rate of our photometric selection is quite high, approaching 100% at the brighter magnitudes (z {sub AB} < 23.5 mag). Our selection also recovered all the known high- z quasars on the HSC images. Among the 15 discovered objects, six are likely quasars, while the other six with interstellar absorption lines and in some cases narrow emission lines are likely bright Lyman-break galaxies. The remaining three objects have weak continua and very strong and narrow Ly α lines, which may be excited by ultraviolet light from both young stars and quasars. These results indicate that we are starting to see the steep rise of the luminosity function of z ≥ 6 galaxies, compared with that of quasars, at magnitudes fainter than M {sub 1450} ∼ −22 mag or z {sub AB} ∼ 24 mag. Follow-up studies of the discovered objects as well as further survey observations are ongoing.

79 ASTRONOMY AND ASTROPHYSICS↗

A Screen Space GPGPU Surface LIC Algorithm for Distributed Memory Data Parallel Sort Last Rendering Infrastructures

The surface line integral convolution(LIC) visualization technique produces dense visualization of vector fields on arbitrary surfaces. We present a screen space surface LIC algorithm for use in distributed memory data parallel sort last rendering infrastructures. The motivations for our work are to support analysis of datasets that are too large to fit in the main memory of a single computer and compatibility with prevalent parallel scientific visualization tools such as ParaView and VisIt. By working in screen space using OpenGL we can leverage the computational power of GPUs when they are available and run without them when they are not. We address efficiency and performance issues that arise from the transformation of data from physical to screen space by selecting an alternate screen space domain decomposition. We analyze the algorithm's scaling behavior with and without GPUs on two high performance computing systems using data from turbulent plasma simulations.

Loring, Burlen↗

Detecting multiple moving objects in crowded environments with coherent motion regions

Coherent motion regions extend in time as well as space, enforcing consistency in detected objects over long time periods and making the algorithm robust to noisy or short point tracks. As a result of enforcing the constraint that selected coherent motion regions contain disjoint sets of tracks defined in a three-dimensional space including a time dimension. An algorithm operates directly on raw, unconditioned low-level feature point tracks, and minimizes a global measure of the coherent motion regions. At least one discrete moving object is identified in a time series of video images based on the trajectory similarity factors, which is a measure of a maximum distance between a pair of feature point tracks.

97 MATHEMATICS AND COMPUTING↗

A dataflow analysis tool for parallel processing of algorithms

A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on a set of identical parallel processors. Typical applications include signal processing and control law problems. Graph analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool is shown to facilitate the application of the design process to a given problem.

Jones, Robert L., III↗

Joint optimization of logistics infrastructure investments and subsidies in a regional logistics network with CO 2 emission reduction targets

This study proposes an optimization model that simultaneously incorporates the selection of logistics infrastructure investments and subsidies for green transport modes to achieve specific CO 2 emission targets in a regional logistics network. The proposed model is formulated as a bi-level formulation, in which the upper level determines the optimal selection of logistics infrastructure investments and subsidies for green transport modes such that the benefit-cost ratio of the entire logistics system is maximized. The lower level describes the selected service routes of logistics users. A genetic and Frank-Wolfe hybrid algorithm is introduced to solve the proposed model. The proposed model is applied to the regional logistics network of Changsha City, China. Findings show that using the joint scheme of the selection of logistics infrastructure investments and green subsidies is more effective than using them solely. In conclusion, carbon emission reduction targets can significantly affect logistics infrastructure investments and subsidy levels.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Market-Based and System-Wide Fuel Cycle Optimization

The Dynamic Resource Exchange (DRE) gives agency to consumer facilities to determine the preference of any particular trade that is offered by suppliers to satisfy its requests. This provides a natural balance of power in the relationship between consumers and suppliers. However, in situations in which suppliers have flexibility surrounding the way that they respond to individual requests, they have no mechanism to assess how different bids will be received by the consumer. Theoretically, a supplier can offer multiple bids to respond to a given request in an attempt to “cover their bases”, but this introduces more arcs into the underlying network flow problem, increasing the cost to solve the problem. In the extreme, when a supplier can continuously vary the characteristics of the bid, this can represent a large number of additional arcs and have real performance consequences. To remedy this inefficiency in the implementation of the market-level optimization, the definition of a request has been extended to include a function that can be used by the supplier to query the preference that would be assigned by a consumer for a potential bid. The supplier is then free to implement arbitrarily complex algorithms to revise/optimize its bid based on responses to this function. A supplier can chose to not invoke the function at all, mimicking the original DRE behavior, can use it to select among a small set of discrete choices, or can implement an internal algorithm to seek an optimum bid on a continuous parameter space. This capability was demonstrated with a storage facility that preferred material with a specific decay heat that was as close as possible to the maximum allowable decay heat, while requiring the specific decay heat to fall between a minimum and maximum level. This archetype was used to fill multiple storage roles in a simulation that also included a standard recipe reactor: wet storage with no maximum allowable specific decay heat, dry storage with a modest maximum allowable specific decay heat, and a geologic repository with a low maximum allowable specific decay heat. In such a simulation, the reactor, wet storage and dry storage always offer their material to be taken by one of the other storage facilities. The preference function of the consumer would always ensure that material only flowed when the decay heat was sufficiently low, but in the absence of objective function callbacks, would allow for many superfluous offers that exceeded those limits. If this archetype also uses a callback function to probe the preference of the receiving facility for each possible offer, it can avoid making offers that are not going to be accepted by the receiving facility.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Improving Search Properties in Genetic Programming

With the advancing computer processing capabilities, practical computer applications are mostly limited by the amount of human programming required to accomplish a specific task. This necessary human participation creates many problems, such as dramatically increased cost. To alleviate the problem, computers must become more autonomous. In other words, computers must be capable to program/reprogram themselves to adapt to changing environments/tasks/demands/domains. Evolutionary computation offers potential means, but it must be advanced beyond its current practical limitations. Evolutionary algorithms model nature. They maintain a population of structures representing potential solutions to the problem at hand. These structures undergo a simulated evolution by means of mutation, crossover, and a Darwinian selective pressure. Genetic programming (GP) is the most promising example of an evolutionary algorithm. In GP, the structures that evolve are trees, which is a dramatic departure from previously used representations such as strings in genetic algorithms. The space of potential trees is defined by means of their elements: functions, which label internal nodes, and terminals, which label leaves. By attaching semantic interpretation to those elements, trees can be interpreted as computer programs (given an interpreter), evolved architectures, etc. JSC has begun exploring GP as a potential tool for its long-term project on evolving dextrous robotic capabilities. Last year we identified representation redundancies as the primary source of inefficiency in GP. Subsequently, we proposed a method to use problem constraints to reduce those redundancies, effectively reducing GP complexity. This method was implemented afterwards at the University of Missouri. This summer, we have evaluated the payoff from using problem constraints to reduce search complexity on two classes of problems: learning boolean functions and solving the forward kinematics problem. We have also developed and implemented methods to use additional problem heuristics to fine-tune the searchable space, and to use typing information to further reduce the search space. Additional improvements have been proposed, but they are yet to be explored and implemented.

Janikow, Cezary Z.↗

EXONEST: Bayesian model selection applied to the detection and characterization of exoplanets via photometric variations

EXONEST is an algorithm dedicated to detecting and characterizing the photometric signatures of exoplanets, which include reflection and thermal emission, Doppler boosting, and ellipsoidal variations. Using Bayesian inference, we can test between competing models that describe the data as well as estimate model parameters. We demonstrate this approach by testing circular versus eccentric planetary orbital models, as well as testing for the presence or absence of four photometric effects. In addition to using Bayesian model selection, a unique aspect of EXONEST is the potential capability to distinguish between reflective and thermal contributions to the light curve. A case study is presented using Kepler data recorded from the transiting planet KOI-13b. By considering only the nontransiting portions of the light curve, we demonstrate that it is possible to estimate the photometrically relevant model parameters of KOI-13b. Furthermore, Bayesian model testing confirms that the orbit of KOI-13b has a detectable eccentricity.

79 ASTRONOMY AND ASTROPHYSICS↗

Autotuning algorithmic choice for input sensitivity

A daunting challenge faced by program performance autotuning is input sensitivity, where the best autotuned configuration may vary with different input sets. This paper presents a novel two-level input learning algorithm to tackle the challenge for an important class of autotuning problems, algorithmic autotuning. Here, the new approach uses a two-level input clustering method to automatically refine input grouping, feature selection, and classifier construction. Its design solves a series of open issues that are particularly essential to algorithmic autotuning, including the enormous optimization space, complex influence by deep input features, high cost in feature extraction, and variable accuracy of algorithmic choices. Experimental results show that the new solution yields up to a 3x speedup over using a single configuration for all inputs, and a 34x speedup over a traditional one-level method for addressing input sensitivity in program optimizations.

97 MATHEMATICS AND COMPUTING↗

Cost-effectiveness methodology for computer systems selection

A new approach to the problem of selecting a computer system design has been developed. The purpose of this methodology is to identify a system design that is capable of fulfilling system objectives in the most economical way. The methodology characterizes each system design by the cost of the system life cycle and by the system's effectiveness in reaching objectives. Cost is measured by a 'system cost index' derived from an analysis of all expenditures and possible revenues over the system life cycle. Effectiveness is measured by a 'system utility index' obtained by combining the impact that each selection factor has on the system objectives and it is assessed through a 'utility curve'. A preestablished algorithm combines cost and utility and provides a ranking of the alternative system designs from which the 'best' design is selected.

Vallone, A.↗

Ultra-Low-Power MEMS Selective Gas Sensors

This innovation is a system for gas sensing that includes an ultra-low-power MEMS (microelectromechanical system) gas sensor, combined with unique electronic circuitry and a proprietary algorithm for operating the sensor. The electronics were created from scratch, and represent a novel design capable of low-power operation of the proprietary MEMS gas sensor platform. The algorithm is used to identify a specific target gas in a gas mixture, making the sensor selective to that target gas.

Stetter, Joseph↗

Application of FARM to an IES scenario within the FORCE ecosystem

The FARM (Feasible Actuator Range Modifier) software module is a component of the RAVEN-based FORCE framework for analysis of Integrated Energy Systems (IES). FARM supports the HERON software module in the evaluation of the optimal dispatch by evaluating feasible set-points for the different IES unit components. Set-points are required to satisfy limits on both production variables (i.e., the variables to be optimized such as the electrical power, the hydrogen production rate, etc.) and process variables tied to the service life of equipment (e.g., steam flowrate, vessel pressure, turbine firing temperature, etc.). This problem is addressed by adopting a two-stage approach. First, the HERON power dispatcher determines set-points that meet the constraints on the former variables (e.g., power levels and power ramp rate limits). These constraints are called explicit constraints. Then, FARM adjusts these set-points to ensure the respect of the limits on the latter variables given the knowledge of the system physics acquired through machine learning algorithms. These constraints are called implicit constraints. From this standpoint, FARM constitutes a bridge between the HERON power dispatcher that adopts a simplified description of the IES unit (low-resolution physics) and the HYBRID high-fidelity models (high-resolution physics). The original version of the FARM software module (FARM-Alpha) was released by Argonne National Laboratory in January 2021. In the latest version of the code released in July 2022 (FARM-Delta), the Reference Governor (RG) algorithm was upgraded to a Multi-Input Multi-Output version from its original Single-Input Single-Output form. The RG algorithm acts to enforce constraints. With this improvement an IES unit is now treated as a single dynamic system from the standpoint of control. The crosstalk among components in an IES unit is now fully considered thereby ensuring a true optimization is obtained for those units that have multiple set-points. In this report, the capabilities of FARM-Delta operating within the FORCE ecosystem are demonstrated for an IES test case. The specific configuration of IES unit for this case was selected by the IES team with consultation from the Advanced Reactor IES Expert Group. A full TEA analysis that invoked HERON, HYBRID, FARM, and RAVEN was performed and serves to demonstrate how the latest modification to FARM algorithms (i.e., state variable selection, state-space matrices derivation, set-point verification) can shape setpoints that might otherwise compromise the health of equipment through accelerated wear and tear. In this specific test case, it was demonstrated that these algorithms ensure a more efficient utilization of steam resources to be shared by two different subsystems, namely Balance of Plant (BOP) and High-Temperature Steam Electrolysis (HTSE). Finally, some code improvements that can further enhance the user-friendliness are suggested.

97 MATHEMATICS AND COMPUTING↗

Rosette core fungal resistance in Arabidopsis thaliana

Main conclusion: Unlike rosette leaves, the mature Arabidopsis rosette core can display full resistance to Botrytis cinerea revealing the importance for spatial and developmental aspects of plant fungal resistance. Abstract: Arabidopsis thaliana is a model host to investigate plant defense against fungi. However, many of the reports investigating Arabidopsis fungal defense against the necrotrophic fungus, Botrytis cinerea, utilize rosette leaves as host tissue. Here we report organ-dependent differences in B. cinerea resistance of Arabidopsis. Although wild-type Arabidopsis rosette leaves mount a jasmonate-dependent defense that slows fungal growth, this defense is incapable of resisting fungal devastation. In contrast, as the fungus spreads through infected leaf petioles towards the plant center, or rosette core, there is a jasmonate- and age-dependent fungal penetration blockage into the rosette core. In this paper, we report evidence for induced and preformed resistance in the rosette core, as direct rosette core inoculation can also result in resistance, but at a lower penetrance relative to infections that approach the core from infected leaf petioles. The Arabidopsis rosette core displays a distinct transcriptome relative to other plant organs, and BLADE ON PETIOLE (BOP) transcripts are abundant in the rosette core. The BOP genes, with known roles in abscission zone formation, are required for full Arabidopsis rosette core B. cinerea resistance, suggesting a possible role for BOP-dependent modifications that may help to restrict fungal susceptibility of the rosette core. Finally, we demonstrate that cabbage and cauliflower, common Brassicaceae crops, also display leaf susceptibility and rosette core resistance to B. cinerea that can involve leaf abscission. Thus, spatial and developmental aspects of plant host resistance play critical roles in resistance to necrotrophic fungal pathogens and are important to our understanding of plant defense mechanisms.

59 BASIC BIOLOGICAL SCIENCES↗

SU-D-12A-06: A Comprehensive Parameter Analysis for Low Dose Cone-Beam CT Reconstruction

Purpose: There is always a parameter in compressive sensing based iterative reconstruction (IR) methods low dose cone-beam CT (CBCT), which controls the weight of regularization relative to data fidelity. A clear understanding of the relationship between image quality and parameter values is important. The purpose of this study is to investigate this subject based on experimental data and a representative advanced IR algorithm using Tight-frame (TF) regularization. Methods: Three data sets of a Catphan phantom acquired at low, regular and high dose levels are used. For each tests, 90 projections covering a 200-degree scan range are used for reconstruction. Three different regions-of-interest (ROIs) of different contrasts are used to calculate contrast-to-noise ratios (CNR) for contrast evaluation. A single point structure is used to measure modulation transfer function (MTF) for spatial-resolution evaluation. Finally, we analyze CNRs and MTFs to study the relationship between image quality and parameter selections. Results: It was found that: 1) there is no universal optimal parameter. The optimal parameter value depends on specific task and dose level. 2) There is a clear trade-off between CNR and resolution. The parameter for the best CNR is always smaller than that for the best resolution. 3) Optimal parameters are also dose-specific. Data acquired under a high dose protocol require less regularization, yielding smaller optimal parameter values. 4) Comparing with conventional FDK images, TF-based CBCT images are better under a certain optimally selected parameters. The advantages are more obvious for low dose data. Conclusion: We have investigated the relationship between image quality and parameter values in the TF-based IR algorithm. Preliminary results indicate optimal parameters are specific to both the task types and dose levels, providing guidance for selecting parameters in advanced IR algorithms. This work is supported in part by NIH (1R01CA154747-01)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Creating Regional and Seasonal Climatologies of Marine and Dusty Marine Aerosol Lidar Ratios using MODIS AOD Constrained Retrievals and GOCART Model Simulations

The CALIPSO aerosol algorithms currently assign one lidar ratio (LR) value globally for each of the seven tropospheric aerosol types. In this study, MODIS total column aerosol optical depths (AODs) are used to constrain collocated CALIOP backscatter profiles in a Fernald inversion that infers aerosol LRs for CALIOP-classified marine and dusty marine aerosols. The GOCART aerosol model is leveraged to estimate the sea salt volume fractions (SSVFs) that are collocated with the CALIOP+MODIS LR retrievals. An inverse empirical relationship is found between the SSVFs and LRs (i.e., smaller SSVFs and larger LRs near coastlines, but the opposite in the remote oceans). This SSVF/LR relationship is applied to create regional and seasonal hybrid (i.e., retrieval & model-assisted) climatological LR maps so as to develop more robust LR selections for marine and dusty marine aerosols in the CALIPSO algorithms. These analyses also provide critical LR information for the next generation of spaceborne elastic backscatter lidars.

Travis D. Toth↗

Creating Regional and Seasonal Climatologies of Marine and Dusty Marine Aerosol Lidar Ratios using MODIS AOD Constrained Retrievals and GOCART Model Simulations

The CALIPSO aerosol algorithms currently assign one lidar ratio (LR) value globally for each of the seven tropospheric aerosol types. In this study, MODIS total column aerosol optical depths (AODs) are used to constrain collocated CALIOP backscatter profiles in a Fernald inversion that infers aerosol LRs for CALIOP-classified marine and dusty marine aerosols. The GOCART aerosol model is leveraged to estimate the sea salt volume fractions (SSVFs) that are collocated with the CALIOP+MODIS LR retrievals. An inverse empirical relationship is found between the SSVFs and LRs (i.e., smaller SSVFs and larger LRs near coastlines, but the opposite in the remote oceans). This SSVF/LR relationship is applied to create regional and seasonal hybrid (i.e., retrieval & model-assisted) climatological LR maps so as to develop more robust LR selections for marine and dusty marine aerosols in the CALIPSO algorithms. These analyses also provide critical LR information for the next generation of spaceborne elastic backscatter lidars.

Travis D. Toth↗

Separating Peaks in X-Ray Spectra

Deconvolution algorithm assists in analysis of x-ray spectra from scanning electron microscopes, electron microprobe analyzers, x-ray fluorescence spectrometers, and like. New algorithm automatically deconvolves x-ray spectrum, identifies locations of spectral peaks, and selects chemical elements most likely producing peaks. Technique based on similarities between zero- and second-order terms of Taylor-series expansions of Gaussian distribution and of damped sinusoid. Principal advantage of algorithm: no requirement to adjust weighting factors or other parameters when analyzing general x-ray spectra.

Nicolas, David↗