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,405 records · Page 78

On the rejection-based algorithm for simulation and analysis of large-scale reaction networks

Stochastic simulation for in silico studies of large biochemical networks requires a great amount of computational time. We recently proposed a new exact simulation algorithm, called the rejection-based stochastic simulation algorithm (RSSA) [Thanh et al., J. Chem. Phys. 141(13), 134116 (2014)], to improve simulation performance by postponing and collapsing as much as possible the propensity updates. In this paper, we analyze the performance of this algorithm in detail, and improve it for simulating large-scale biochemical reaction networks. We also present a new algorithm, called simultaneous RSSA (SRSSA), which generates many independent trajectories simultaneously for the analysis of the biochemical behavior. SRSSA improves simulation performance by utilizing a single data structure across simulations to select reaction firings and forming trajectories. The memory requirement for building and storing the data structure is thus independent of the number of trajectories. The updating of the data structure when needed is performed collectively in a single operation across the simulations. The trajectories generated by SRSSA are exact and independent of each other by exploiting the rejection-based mechanism. We test our new improvement on real biological systems with a wide range of reaction networks to demonstrate its applicability and efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Performance analysis of a finite radon transform in OFDM system under different channel models

In this paper, a class of discrete Radon transforms namely Finite Radon Transform (FRAT) was proposed as a modulation technique in the realization of Orthogonal Frequency Division Multiplexing (OFDM). The proposed FRAT operates as a data mapper in the OFDM transceiver instead of the conventional phase shift mapping and quadrature amplitude mapping that are usually used with the standard OFDM based on Fast Fourier Transform (FFT), by the way that ensure increasing the orthogonality of the system. The Fourier domain approach was found here to be the more suitable way for obtaining the forward and inverse FRAT. This structure resulted in a more suitable realization of conventional FFT- OFDM. It was shown that this application increases the orthogonality significantly in this case due to the use of Inverse Fast Fourier Transform (IFFT) twice, namely, in the data mapping and in the sub-carrier modulation also due to the use of an efficient algorithm in determining the FRAT coefficients called the optimal ordering method. The proposed approach was tested and compared with conventional OFDM, for additive white Gaussian noise (AWGN) channel, flat fading channel, and multi-path frequency selective fading channel. The obtained results showed that the proposed system has improved the bit error rate (BER) performance by reducing inter-symbol interference (ISI) and inter-carrier interference (ICI), comparing with conventional OFDM system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Case Study on Investigating the Effect of Genetic Algorithm Operators on Predicting the Global Minimum Hardness Value of Biomaterial Extrudate

Crossover and mutation are the main search operators of genetic algorithm, one of the most important features which distinguish it from other search algorithms like simulated annealing. A genetic algorithm adopts crossover and mutation as their main genetic operators. The present work was aimed to see the effect of genetic algorithm operators like crossover and mutation (Pc & Pm), population size (n), and number of iterations (I) on predicting the minimum hardness (N) of the biomaterial extrudate. The second order polynomial regression equation developed for the extrudate property hardness in terms of the independent variables like barrel temperature, screw speed, fish content of the feed, and feed moisture content was used as the objective function in the GA analysis. A simple genetic algorithm (SGA) with a crossover and mutation operators was used in the present study. A program was developed in C language for a SGA with a rank based fitness selection method. The upper limit of population and iterations were fixed at 100. It was observed that increasing population and iterations the prediction of function minimum improved drastically. Minimum predicted hardness values were achievable with a medium population of 50, iterations of 50 and crossover and mutation probabilities of 50 % and 0.5 %. Further the Pareto charts indicated that the effect of Pc was found to be more significant when population is 50 and Pm played a major role at low population ( 10). A crossover probability of 50 % and mutation probability of 0.5 % are the threshold values for the convergence of GA to reach a global search space. A minimum predicted hardness value of 3.82 (N) was observed for n = 60 and I = 100 and Pc & Pm of 85 % and 0.5 %.

59 BASIC BIOLOGICAL SCIENCES↗

SU-E-T-10: A Clinical Implementation and the Dosimetric Evidence in High Dose Rate Vaginal Multichannel Applicator Brachytherapy

Purpose: The multichannel cylindrical applicator has a distinctive modification of the traditional single channel cylindrical applicator. The novel multichannel applicator has additional peripheral channels that provide more flexibility both in treatment planning process and outcomes. To protect by reducing doses to adjacent organ at risk (OAR) while maintaining target coverage with inverse plan optimization are the goals for such novel Brachytherapy device. Through a series of comparison and analysis of reults in more than forty patients who received HDR Brachytherapy using multichannel vaginal applicator, this procedure has been implemented in our institution. Methods: Multichannel planning was CT image based. The CTV of 5mm vaginal cuff rind with prescribed length was well reconstructed as well as bladder and rectum. At least D95 of CTV coverage is 95% of prescribed dose. Multichannel inverse plan optimization algorithm not only shapes target dose cloud but set dose avoids to OAR’s exclusively. The doses of D2cc, D5cc and D5; volume of V2Gy in OAR’s were selected to compare with single channel results when sole central channel is only possibility. Results: Study demonstrates plan superiorly in OAR’s doe reduction in multi-channel plan. The D2cc of the rectum and bladder were showing a little lower for multichannel vs. single channel. The V2Gy of the rectum was 93.72% vs. 83.79% (p=0.007) for single channel vs. multichannel respectively. Absolute reduced mean dose of D5 by multichannel was 17 cGy (s.d.=6.4) and 44 cGy (s.d.=15.2) in bladder and rectum respectively. Conclusion: The optimization solution in multichannel was to maintain D95 CTV coverage while reducing the dose to OAR’s. Dosimetric advantage in sparing critical organs by using a multichannel applicator in HDR Brachytherapy treatment of the vaginal cuff is so promising and has been implemented clinically.

60 APPLIED LIFE SCIENCES↗

Variable Circular Collimator in Robotic Radiosurgery: A Time-Efficient Alternative to a Mini-Multileaf Collimator?

Purpose: Compared with many small circular beams used in CyberKnife treatments, beam's eye view-shaped fields are generally more time-efficient for dose delivery. However, beam's eye view-shaping devices, such as a mini-multileaf collimator (mMLC), are not presently available for CyberKnife, although a variable-aperture collimator (Iris, 12 field diameters; 5-60 mm) is available. We investigated whether the Iris can mimic noncoplanar mMLC treatments using a limited set of principal beam orientations (nodes) to produce time-efficient treatment plans. Methods and Materials: The data from 10 lung cancer patients and the beam-orientation optimization algorithm 'Cycle' were used to generate stereotactic treatment plans (3 x 20 Gy) for a CyberKnife virtually equipped with a mMLC. Typically, 10-16 favorable beam orientations were selected from 117 available robot node positions using beam's eye view-shaped fields with uniform fluence. Second, intensity-modulated Iris plans were generated by inverse optimization of nonisocentric circular candidate beams targeted from the same nodes selected in the mMLC plans. The plans were evaluated using the mean lung dose, lung volume receiving {>=}20 Gy, conformality index, number of nodes, beams, and monitor units, and estimated treatment time. Results: The mMLC plans contained an average of 12 nodes and 11,690 monitor units. For a comparable mean lung dose, the Iris plans contained 12 nodes, 64 beams, and 21,990 monitor units. The estimated fraction duration was 12.2 min (range, 10.8-13.5) for the mMLC plans and 18.4 min (range, 12.9-28.5) for the Iris plans. In contrast to the mMLC plans, the treatment time for the Iris plans increased with an increasing target volume. The Iris plans were, on average, 40% longer than the corresponding mMLC plans for small targets (<80 cm{sup 3}) and {<=}121% longer for larger targets. For a comparable conformality index, similar results were obtained. Conclusion: For stereotactic lung irradiation, time-efficient and high-quality plans were obtained for robotic-controlled noncoplanar treatments using a mMLC. Iris is a time-efficient alternative for small targets, with similar or better plan quality.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Multimodal parameter spaces of a complex multi-channel neuron model

One of the most common types of models that helps us to understand neuron behavior is based on the Hodgkin–Huxley ion channel formulation (HH model). A major challenge with inferring parameters in HH models is non-uniqueness: many different sets of ion channel parameter values produce similar outputs for the same input stimulus. Such phenomena result in an objective function that exhibits multiple modes (i.e., multiple local minima). This non-uniqueness of local optimality poses challenges for parameter estimation with many algorithmic optimization techniques. HH models additionally have severe non-linearities resulting in further challenges for inferring parameters in an algorithmic fashion. To address these challenges with a tractable method in high-dimensional parameter spaces, we propose using a particular Markov chain Monte Carlo (MCMC) algorithm, which has the advantage of inferring parameters in a Bayesian framework. The Bayesian approach is designed to be suitable for multimodal solutions to inverse problems. We introduce and demonstrate the method using a three-channel HH model. We then focus on the inference of nine parameters in an eight-channel HH model, which we analyze in detail. We explore how the MCMC algorithm can uncover complex relationships between inferred parameters using five injected current levels. The MCMC method provides as a result a nine-dimensional posterior distribution, which we analyze visually with solution maps or landscapes of the possible parameter sets. The visualized solution maps show new complex structures of the multimodal posteriors, and they allow for selection of locally and globally optimal value sets, and they visually expose parameter sensitivities and regions of higher model robustness. We envision these solution maps as enabling experimentalists to improve the design of future experiments, increase scientific productivity and improve on model structure and ideation when the MCMC algorithm is applied to experimental data.

97 MATHEMATICS AND COMPUTING↗

On the optimal design of the disassembly and recovery processes

This paper tackles the problem of the optimal design of the recovery processes of the end-of-life (EOL) electric and electronic products, with a special focus on the disassembly issues. The objective is to recover as much ecological and economic value as possible, and to reduce the overall produced quantities of waste. In this context, a medium-range tactical problem is defined and a novel two-phased algorithm is presented for a remanufacturing-driven reverse supply chain. In the first phase, we propose a multicriteria/goal-programming analysis for the identification and the optimal selection of the most 'desirable' subassemblies and components to be disassembled for recovery, from a set of different types of EOL products. In the second phase, a multi-product, multi-period mixed-integer linear programming (MILP) model is presented, which addresses the optimization of the recovery processes, while taking into account explicitly the lead times of the disassembly and recovery processes. Moreover, a simulation-based solution approach is proposed for capturing the uncertainties in reverse logistics. The overall approach leads to an easy-to-use methodology that could support effectively middle level management decisions. Finally, the applicability of the developed methodology is illustrated by its application on a specific case study.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A quantum cascade laser-based water vapor isotope analyzer for environmental monitoring

A field-deployable mid-infrared quantum cascade laser-based spectrometer was designed and developed for measurements of H{sub 2}{sup 16}O and H{sub 2}{sup 18}O at 7.12 μm. H{sub 2}{sup 16}O and H{sub 2}{sup 18}O absorption features at 1390.52 cm{sup −1} and 1389.91 cm{sup −1}, respectively, accessible within current tuning range of the laser, were targeted. The target lines were carefully selected to assure similar absorption levels and similar temperature sensitivities of the line strength due to comparable lower state energies. A real-time spectral fitting algorithm was implemented for isotopic concentration retrieval. Detection limits for H{sub 2}{sup 16}O and H{sub 2}{sup 18}O of 2.2 ppm and 7.0 ppb, respectively, were achieved at a dew point of 14 °C (volume mixing ratio of 15 766 ppm) in 1 s integration time, which resulted in a δ{sup 18}O isotopic ratio measurement precision of 0.25‰. The ultimate minimum detection limits obtained after 160 s integration time for H{sub 2}{sup 16}O and H{sub 2}{sup 18}O, and δ{sup 18}O measurements were 0.6 ppm, 1.7 ppb, and 0.05‰, respectively.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Survey of Gravitationally lensed objects in HSC Imaging (SuGOHI). VIII. New galaxy-scale lenses from the HSC SSP

Abstract We conduct a search for galaxy-scale strong gravitational lens systems in Data Release 4 of the Hyper Suprime-Cam Subaru Strategic Program (HSC SSP), consisting of data taken up to the S21A semester. We select 103191 luminous red galaxies from the Baryon Oscillation Spectroscopic Survey (BOSS) sample that have deep multiband imaging from the HSC SSP and use the YattaLens algorithm to identify lens candidates with blue arc-like features automatically. The candidates are visually inspected and graded based on their likelihood of being a lens. We find eight definite lenses, 28 probable lenses, and 138 possible lenses. The new lens candidates generally have lens redshifts in the range 0.3 ≲ zL ≲ 0.9, a key intermediate redshift range to study the evolution of galaxy structure. Follow-up spectroscopy will confirm these new lenses and measure source redshifts to enable detailed lens modeling.

Astronomy & Astrophysics↗

Approximate l-Fold Cross-Validation with Least Squares SVM and Kernel Ridge Regression

Kernel methods have difficulties scaling to large modern data sets. The scalability issues are based on computational and memory requirements for working with a large matrix. These requirements have been addressed over the years by using low-rank kernel approximations or by improving the solvers' scalability. However, Least Squares Support Vector Machines (LS-SVM), a popular SVM variant, and Kernel Ridge Regression still have several scalability issues. In particular, the O(n^3) computational complexity for solving a single model, and the overall computational complexity associated with tuning hyper parameters are still major problems. We address these problems by introducing an O(nlog n) approximate l-fold cross-validation method that uses a multi-level circulant matrix to approximate the kernel. In addition, we prove our algorithm's computational complexity and present empirical runtimes on data sets with approximately one million data points. We also validate our approximate method's effectiveness at selecting hyper parameters on real world and standard benchmark data sets. Lastly, we provide experimental results on using a multi level circulant kernel approximation to solve LS-SVM problems with hyper parameters selected using our method.

Computer Science↗

Let Each Quantum Bit Choose Its Basis Gates

Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit (1Q) gates that can be implemented in a given technology. 2Q entangling gates, coupled with some 1Q gates, allow for universal quantum computation. In superconducting technologies, the current state of the art is to implement the same 2Q gate between every pair of qubits (typically an XX-or XY-type gate). This strict hardware uniformity requirement for 2Q gates in a large quantum computer has made scaling up a time and resource-intensive endeavor in the lab. We propose a radical idea – allow the 2Q basis gate(s) to differ between every pair of qubits, selecting the best entangling gates that can be calibrated between given pairs of qubits. This work aims to give quantum scientists the ability to run meaningful algorithms with qubit systems that are not perfectly uniform. Scientists will also be able to use a much broader variety of novel 2Q gates for quantum computing. We develop a theoretical framework for identifying good 2Q basis gates on “nonstandard” Cartan trajectories that deviate from “standard” trajectories like XX. We then introduce practical methods for calibration and compilation with nonstandard 2Q gates, and discuss possible ways to improve the compilation. To demonstrate our methods in a case study, we simulated both standard XY-type trajectories and faster, nonstandard trajectories using an entangling gate architecture with far-detuned transmon qubits. We identify efficient 2Q basis gates on these nonstandard trajectories and use them to compile a number of standard benchmark circuits such as QFT and QAOA. Furthermore, our results demonstrate an 8x improvement over the baseline 2Q gates with respect to speed and coherence-limited gate fidelity.

quantum computing↗

Peer-to-Peer Energy Trading in a Prosumer-Based Community Microgrid: A Game-Theoretic Model

This paper proposes a novel game-theoretic model for peer-to-peer (P2P) energy trading among the prosumers in a community. The buyers can adjust the energy consumption behavior based on the price and quantity of the energy offered by the sellers. There exist two separate competitions during the trading process: 1) price competition among the sellers; and 2) seller selection competition among the buyers. The price competition among the sellers is modeled as a noncooperative game. The evolutionary game theory is used to model the dynamics of the buyers for selecting sellers. Moreover, an M-leader and N-follower Stackelberg game approach is used to model the interaction between buyers and sellers. Two iterative algorithms are proposed for the implementation of the games such that an equilibrium state exists in each of the games. The proposed method is applied to a small community microgrid with photo-voltaic and energy storage systems. Simulation results show the convergence of the algorithms and the effectiveness of the proposed model to handle P2P energy trading. The results also show that P2P energy trading provides significant financial and technical benefits to the community, and it is emerging as an alternative to cost-intensive energy storage systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multiplicity dependence of charged-particle intra-jet properties in pp collisions at $\sqrt{s}$ = 13 TeV

The first measurement of the multiplicity dependence of intra-jet properties of leading charged-particle jets in proton–proton (pp) collisions is reported. The mean charged particle multiplicity and jet fragmentation distributions are measured in minimum-bias and high-multiplicity pp collisions at center-of-mass energy $\sqrt{s}$ = 13 TeV using the ALICE detector. Jets are reconstructed from charged particles produced in the midrapidity region (|η| < 0.9) using the sequential recombination anti-k T algorithm with jet resolution parameters R = 0.2, 0.3, and 0.4 for the trans verse momentum (p T ) interval 5–110 GeV/c. The high multiplicity events are selected by the forward V0 scintilla tor detectors. The mean charged-particle multiplicity inside the leading jet cone rises monotonically with increasing jet p T in qualitative agreement with previous measurements at lower energies. The distributions of jet fragmentation function variables z ch and ξ ch are measured for different jet-p T intervals. Jet-p T independent fragmentation of leading jets is observed for wider jets except at high- and low-z ch values. The observed “hump-backed plateau” structure in the ξ ch distribution indicates suppression of low-p T particles. In high-multiplicity events, an enhancement of the fragmen tation probability of low-z ch particles accompanied by a suppression of high-zch particles is observed compared to minimum-bias events. This behavior becomes more promi nent for low-p T jets with larger jet radius. The results are compared with predictions of QCD-inspired event generators, PYTHIA 8 with Monash 2013 tune and EPOS LHC. It is found that PYTHIA 8 qualitatively reproduces the jet modification in high-multiplicity events except at high jet p T . These measurements provide important constraints to models of jet fragmentation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

GenomeFace v1.0

GenomeFace is meta-genome binning software. Metagenomic binning, the process of grouping DNA sequences into taxonomic units, is critical for understanding the functions, interactions, and evolutionary dynamics of microbial communities. We propose a deep learning approach to binning using two neural networks, one based on composition and another on environmental abundance, dynamically weighting the contribution of each based on characteristics of the input data. Trained on over 43,000 prokaryotic genomes, our network for composition-based binning is inspired by metric learning techniques used for facial recognition. Using a task-specific, multi-GPU accelerated algorithm to cluster the embeddings produced by our network, our binner leverages marker genes observed to be universally present in nearly all taxa to grade and select optimal clusters of sequences from a hierarchy of candidates. We evaluate our approach on four simulated datasets with known ground truth. Our linear time integration of marker genes recovers more near complete genomes than state of the art but computationally infeasible solutions using them, while being over an order of magnitude faster. Finally, we demonstrate the scalability and acuity of our approach by testing it on three of the largest metagenome assemblies ever performed. Compared to other binners, we produced 47%-183% more near complete genomes. From these datasets, we find over the genomes of over 3000 new candidate species which have never been previously cataloged, representing a potential 4% expansion of the known bacterial tree of life.

Lettich, Richard [Lawrence Berkeley National Labor↗

Approximate l-fold cross-validation with Least Squares SVM and Kernel Ridge Regression

Kernel methods have difficulties scaling to large modern data sets. The scalability issues are based on computational and memory requirements for working with a large matrix. These requirements have been addressed over the years by using low-rank kernel approximations or by improving the solvers scalability. However, Least Squares Support VectorMachines (LS-SVM), a popular SVM variant, and Kernel Ridge Regression still have several scalability issues. In particular, the O(n^3) computational complexity for solving a single model, and the overall computational complexity associated with tuning hyperparameters are still major problems. We address these problems by introducing an O(n log n) approximate l-fold cross-validation method that uses a multi-level circulant matrix to approximate the kernel. In addition, we prove our algorithm s computational complexity and present empirical runtimes on data sets with approximately 1 million data points. We also validate our approximate method s effectiveness at selecting hyperparameters on real world and standard benchmark data sets. Lastly, we provide experimental results on using a multi-level circulant kernel approximation to solve LS-SVM problems with hyperparameters selected using our method.

Edwards, Richard E↗

Fluorescence Color by Data-Driven Design of Genomic Silver Clusters

DNA nucleobase sequence controls the size of DNA-stabilized silver clusters, leading to their well-known yet little understood sequence-tuned colors. The enormous space of possible DNA sequences for templating clusters has challenged the understanding of how sequence selects cluster properties and has limited the design of applications that employ these clusters. Here, we investigate the genomic role of DNA sequence for fluorescent silver clusters using a data-driven approach. Employing rapid parallel silver cluster synthesis and fluorimetry, we determine the fluorescence spectra of silver cluster products stabilized by 1432 distinct DNA oligomers. By applying pattern recognition algorithms to this large experimental data set, we discover certain DNA base patterns, or “motifs,” that correlate to silver clusters with similar fluorescence spectra. These motifs are employed in machine learning classifiers to predictively design DNA template sequences for specific fluorescence color bands. Our method improves selectivity of templates by 330% for silver clusters with peak emission wavelengths beyond 660 nm. The discovered base motifs also provide physical insights into how DNA sequence controls silver cluster size and color. Finally, this predictive design approach for color of DNA-stabilized silver clusters exhibits the potential of machine learning and data mining to increase the precision and efficiency of nanomaterials design, even for a soft-matter-inorganic hybrid system characterized by an extremely large parameter space.

59 BASIC BIOLOGICAL SCIENCES↗

Computational Approach for Epitaxial Polymorph Stabilization through Substrate Selection

With the ultimate goal of finding new polymorphs through targeted synthesis conditions and techniques, we outline a computational framework to select optimal substrates for epitaxial growth using first principle calculations of formation energies, elastic strain energy, and topological information. To demonstrate the approach, we study the stabilization of metastable VO2 compounds which provides a rich chemical and structural polymorph space. We find that common polymorph statistics, lattice matching, and energy above hull considerations recommends homostructural growth on TiO2 substrates, where the VO2 brookite phase would be preferentially grown on the a-c TiO2 brookite plane while the columbite and anatase structures favor the a-b plane on the respective TiO2 phases. Overall, we find that a model which incorporates a geometric unit cell area matching between the substrate and the target film as well as the resulting strain energy density of the film provide qualitative agreement with experimental observations for the heterostructural growth of known VO2 polymorphs: rutile, A and B phases. The minimal interfacial geometry matching and estimated strain energy criteria provide several suggestions for substrates and substrate-film orientations for the heterostructural growth of the hitherto hypothetical anatase, brookite, and columbite polymorphs. These criteria serve as a preliminary guidance for the experimental efforts stabilizing new materials and/or polymorphs through epitaxy. The current screening algorithm is being integrated within the Materials Project online framework and data and hence publicly available.

36 MATERIALS SCIENCE↗