Search NASA⌕ Search

SEARCH · Search NASA

Results for “hybrid 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 757 records · Page 42

Adapting Secure MultiParty Computation to Support Machine Learning in Radio Frequency Sensor Networks

In this project we developed and validated algorithms for privacy-preserving linear regression using a new variant of Secure Multiparty Computation (MPC) we call "Hybrid MPC" (hMPC). Our variant is intended to support low-power, unreliable networks of sensors with low-communication, fault-tolerant algorithms. In hMPC we do not share training data, even via secret sharing. Thus, agents are responsible for protecting their own local data. Only the machine learning (ML) model is protected with information-theoretic security guarantees against honest-but-curious agents. There are three primary advantages to this approach: (1) after setup, hMPC supports a communication-efficient matrix multiplication primitive, (2) organizations prevented by policy or technology from sharing any of their data can participate as agents in hMPC, and (3) large numbers of low-power agents can participate in hMPC. We have also created an open-source software library named "Cicada" to support hMPC applications with fault-tolerance. The fault-tolerance is important in our applications because the agents are vulnerable to failure or capture. We have demonstrated this capability at Sandia's Autonomy New Mexico laboratory through a simple machine-learning exercise with Raspberry Pi devices capturing and classifying images while flying on four drones.

42 ENGINEERING↗

KSSOLV 2.0: An efficient MATLAB toolbox for solving the Kohn-Sham equations with plane-wave basis set

KSSOLV (Kohn-Sham Solver) is a MATLAB toolbox for performing Kohn-Sham density functional theory (DFT) calculations with a plane-wave basis set. KSSOLV 2.0 preserves the design features of the original KSSOLV software to allow users and developers to easily set up a problem and perform ground-state calculations as well as to prototype and test new algorithms. Furthermore, it includes new functionalities such as new iterative diagonalization algorithms, k-point sampling for electron band structures, geometry optimization and advanced algorithms for performing DFT calculations with local, semi-local, and hybrid exchange-correlation functionals. It can be used to study the electronic structures of both molecules and solids. So, we describe these new capabilities in this work through a few use cases. We also demonstrate the numerical accuracy and computational efficiency of KSSOLV on a variety of examples.

97 MATHEMATICS AND COMPUTING↗

Holodeck Testbed Project

The main objective of the Holodeck Testbed is to create a cost effective, realistic, and highly immersive environment that can be used to train astronauts, carry out engineering analysis, develop procedures, and support various operations tasks. Currently, the Holodeck testbed allows to step into a simulated ISS (International Space Station) and interact with objects; as well as, perform Extra Vehicular Activities (EVA) on the surface of the Moon or Mars. The Holodeck Testbed is using the products being developed in the Hybrid Reality Lab (HRL). The HRL is combining technologies related to merging physical models with photo-realistic visuals to create a realistic and highly immersive environment. The lab also investigates technologies and concepts that are needed to allow it to be integrated with other testbeds; such as, the gravity offload capability provided by the Active Response Gravity Offload System (ARGOS). My main two duties were to develop and animate models for use in the HRL environments and work on a new way to interface with computers using Brain Computer Interface (BCI) technology. On my first task, I was able to create precise computer virtual tool models (accurate down to the thousandths or hundredths of an inch). To make these tools even more realistic, I produced animations for these tools so they would have the same mechanical features as the tools in real life. The computer models were also used to create 3D printed replicas that will be outfitted with tracking sensors. The sensor will allow the 3D printed models to align precisely with the computer models in the physical world and provide people with haptic/tactile feedback while wearing a VR (Virtual Reality) headset and interacting with the tools. Getting close to the end of my internship the lab bought a professional grade 3D Scanner. With this, I was able to replicate more intricate tools at a much more time-effective rate. The second task was to investigate the use of BCI to control objects inside the hybrid reality ISS environment. This task looked at using an Electroencephalogram (EEG) headset to collect brain state data that could be mapped to commands that a computer could execute. On this Task, I had a setback with the hardware, which stopped working and was returned to the vendor for repair. However, I was still able to collect some data, was able to process it, and started to create correlation algorithms between the electrical patterns in the brain and the commands we wanted the computer to carry out. I also carried out a test to investigate the comfort of the headset if it is worn for a long time. The knowledge gained will benefit me in my future career. I learned how to use various modeling and programming tools that included Blender, Maya, Substance Painter, Artec Studio, Github, and Unreal Engine 4. I learned how to use a professional grade 3D scanner and 3D printer. On the BCI Project I learned about data mining and how to create correlation algorithms. I also supported various demos including a live demo of the hybrid reality lab capabilities at ComicPalooza. This internship has given me a good look into engineering at NASA. I developed a more thorough understanding of engineering and my overall confidence has grown. I have also realized that any problem can be fixed, if you try hard enough, and as an engineer it is your job to not only fix problems but to embrace coming up with solutions to those problems.

Arias, Adriel↗

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automated Sequence Design of 3D Polyhedral Wireframe DNA Origami with Honeycomb Edges

3D polyhedral wireframe DNA nanoparticles (DNA-NPs) fabricated using scaffolded DNA origami offer complete and independent control over NP size, structure, and asymmetric functionalization on the 10–100 nm scale. However, the complex DNA sequence design needed for the synthesis of these versatile DNA-NPs has limited their widespread use to date. While the automated sequence design algorithms DAEDALUS and vHelix-BSCOR apply to DNA-NPs synthesized using either uniformly dual or hybrid single-dual duplex edges, respectively, these DNA-NPs are relatively compliant mechanically and are therefore of limited utility for some applications. Further, these algorithms are incapable of handling DNA-NP edge designs composed of more than two duplexes, which are needed to enhance DNA-NP mechanical stiffness. As an alternative, here we introduce the scaffolded DNA origami sequence design algorithm TALOS, which is a generalized procedure for the fully automated design of wireframe 3D polyhedra composed of edges of any cross section with an even number of duplexes, and apply it to DNA-NPs composed uniformly of single honeycomb edges. We also introduce a multiway vertex design that enables the fabrication of DNA-NPs with arbitrary edge lengths and vertex angles and apply it to synthesize a highly asymmetric origami object. Sequence designs are demonstrated to fold robustly into target DNA-NP shapes with high folding efficiency and structural fidelity that is verified using single particle cryo-electron microscopy and 3D reconstruction. Furthermore, in order to test its generality, we apply TALOS to design an in silico library of over 200 DNA-NPs of distinct symmetries and sizes, and for broad impact, we also provide the software as open source for the generation of custom NP designs.

3D cryo-EM reconstruction↗

Hybrid methods for cybersecurity analysis :

Early 2010 saw a signi cant change in adversarial techniques aimed at network intrusion: a shift from malware delivered via email attachments toward the use of hidden, embedded hyperlinks to initiate sequences of downloads and interactions with web sites and network servers containing malicious software. Enterprise security groups were well poised and experienced in defending the former attacks, but the new types of attacks were larger in number, more challenging to detect, dynamic in nature, and required the development of new technologies and analytic capabilities. The Hybrid LDRD project was aimed at delivering new capabilities in large-scale data modeling and analysis to enterprise security operators and analysts and understanding the challenges of detection and prevention of emerging cybersecurity threats. Leveraging previous LDRD research e orts and capabilities in large-scale relational data analysis, large-scale discrete data analysis and visualization, and streaming data analysis, new modeling and analysis capabilities were quickly brought to bear on the problems in email phishing and spear phishing attacks in the Sandia enterprise security operational groups at the onset of the Hybrid project. As part of this project, a software development and deployment framework was created within the security analyst work ow tool sets to facilitate the delivery and testing of new capabilities as they became available, and machine learning algorithms were developed to address the challenge of dynamic threats. Furthermore, researchers from the Hybrid project were embedded in the security analyst groups for almost a full year, engaged in daily operational activities and routines, creating an atmosphere of trust and collaboration between the researchers and security personnel. The Hybrid project has altered the way that research ideas can be incorporated into the production environments of Sandias enterprise security groups, reducing time to deployment from months and years to hours and days for the application of new modeling and analysis capabilities to emerging threats. The development and deployment framework has been generalized into the Hybrid Framework and incor- porated into several LDRD, WFO, and DOE/CSL projects and proposals. And most importantly, the Hybrid project has provided Sandia security analysts with new, scalable, extensible analytic capabilities that have resulted in alerts not detectable using their previous work ow tool sets.

Dunlavy, Daniel M.↗

Full Gradient Solution to Adaptive Hybrid Control

This paper focuses on the adaptation mechanisms in adaptive hybrid controllers. Most adaptive hybrid controllers update two filters individually according to the filtered-reference least mean squares (FxLMS) algorithm. Because this algorithm was derived for feedforward control, it does not take into account the presence of a feedback loop in the gradient calculation. This paper provides a derivation of the proper weight vector gradient for hybrid (or feedback) controllers that takes into account the presence of feedback. In this formulation, a single weight vector is updated rather than two individually. An internal model structure is assumed for the feedback part of the controller. The full gradient is equivalent to that used in the standard FxLMS algorithm with the addition of a recursive term that is a function of the modeling error. Some simulations are provided to highlight the advantages of using the full gradient in the weight vector update rather than the approximation.

Bean, Jacob↗

Impact of solvent forces and broken symmetry on the assembly of designed proteins at a liquid-solid interface

The era of protein design has enabled the creation of hybrid protein-inorganic interfaces, leading to both surface-directed self-assembly of de novo protein architectures and protein-directed formation of inorganic materials. However, the resulting patterns of protein assembly are often unexpected, implying that essential interactions are not accounted for in current design platforms. Here, we use high-speed atomic force microscopy (AFM) analyzed through machine learning to follow the assembly of protein nanorods in aqueous electrolytes on two types of mica exhibiting disparate symmetry elements, which are imprinted on the overlying hydration structure. Using Monte Carlo simulations, we reproduce the observed phases and show that an observed smectic phase, previously thought to be unstable for non-interacting rods in two dimensions, emerges when crystal symmetry introduces a directional bias. The findings demonstrate the importance of incorporating solvent forces as modulated by the hydration structure inherent to interfacial systems when designing protein assemblies at liquid-crystal interfaces. Coupling physics-based simulations that can account for these factors to de novo protein design algorithms can lead to improved design platforms for bio-inspired, hybrid materials.

bioinspired materials↗

A hybrid Monte Carlo, discontinuous Galerkin method for linear kinetic transport equations

Here we present a hybrid method for time-dependent particle transport problems that combines Monte Carlo (MC) estimation with deterministic solutions based on discrete ordinates. For spatial discretizations, the MC algorithm computes a piecewise constant solution and the discrete ordinates use bilinear discontinuous finite elements. From the hybridization of the problem, the resulting problem solved by Monte Carlo is scattering free, resulting in a simple, efficient solution procedure. Between time steps, we use a projection approach to “relabel” collided particles as uncollided particles. In conclusion, from a series of standard 2-D Cartesian test problems we observe that our hybrid method has improved accuracy and reduction in computational complexity of approximately an order of magnitude relative to standard discrete ordinates solutions.

97 MATHEMATICS AND COMPUTING↗

Particle simulations of mode conversion between slow mode and fast mode in lower hybrid range of frequencies

The propagation and mode conversion of lower hybrid waves in an inhomogeneous plasma are investigated by using the nonlinear δf algorithm in a two-dimensional particle-in-cell simulation code based on the gyrokinetic electron and fully kinetic ion (GeFi) scheme [Lin et al., Plasma Phys. Controlled Fusion 47, 657 (2005)]. The characteristics of the simulated waves, such as wavelength, frequency, phase, and group velocities, agree well with the linear theoretical analysis. It is shown that a significant reflection component emerges in the conversion process between the slow mode and the fast mode when the scale length of the density variation is comparable to the local wavelength. The dependences of the reflection coefficient on the scale length of the density variation are compared with the results based on the linear full wave model for cold plasmas. It is indicated that the mode conversion for the waves with a frequency of 2.45 GHz (ω ∼ 3ω{sub LH}, where ω{sub LH} represents the lower hybrid resonance) and within Tokamak relevant amplitudes can be well described in the linear scheme. As the frequency decreases, the modification due to the nonlinear term becomes important. For the low-frequency waves (ω ∼ 1.3ω{sub LH}), the generations of the high harmonic modes and sidebands through nonlinear mode-mode coupling provide new power channels and thus could reduce the reflection significantly.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

HyLiPoD: Parallel Particle Advection via a Hybrid of Lifeline Scheduling and Parallelization-Over-Data

Performance characteristics of parallel particle advection algorithms can vary greatly based on workload.With this short paper, we build a new algorithm based on results from a previous bake-off study which evaluated the performance of four algorithms on a variety of workloads. Our algorithm, called HyLiPoD, is a ''meta-algorithm,'' i.e., it considers the desired workload to choose from existing algorithms to maximize performance. To demonstrate HyliPoD's benefit, we analyze results from 162 tests including concurrencies of up to 8192 cores, meshes as large as 34 billion cells, and particle counts as large as 300 million. Our findings demonstrate that HyLiPoD's adaptive approach allows it to match the best performance of existing algorithms across diverse workloads.

high performance computing↗

Hybrid detection of lung nodules on CT scan images

Purpose: The diversity of lung nodules poses difficulty for the current computer-aided diagnostic (CAD) schemes for lung nodule detection on computed tomography (CT) scan images, especially in large-scale CT screening studies. We proposed a novel CAD scheme based on a hybrid method to address the challenges of detection in diverse lung nodules. Methods: The hybrid method proposed in this paper integrates several existing and widely used algorithms in the field of nodule detection, including morphological operation, dot-enhancement based on Hessian matrix, fuzzy connectedness segmentation, local density maximum algorithm, geodesic distance map, and regression tree classification. All of the adopted algorithms were organized into tree structures with multi-nodes. Each node in the tree structure aimed to deal with one type of lung nodule. Results: The method has been evaluated on 294 CT scans from the Lung Image Database Consortium (LIDC) dataset. The CT scans were randomly divided into two independent subsets: a training set (196 scans) and a test set (98 scans). In total, the 294 CT scans contained 631 lung nodules, which were annotated by at least two radiologists participating in the LIDC project. The sensitivity and false positive per scan for the training set were 87% and 2.61%. The sensitivity and false positive per scan for the testing set were 85.2% and 3.13%. Conclusions: The proposed hybrid method yielded high performance on the evaluation dataset and exhibits advantages over existing CAD schemes. We believe that the present method would be useful for a wide variety of CT imaging protocols used in both routine diagnosis and screening studies.

60 APPLIED LIFE SCIENCES↗

Hybrid Dynamic Modeling of Smart Inverter

This letter proposes a novel hybrid method for assessing grid-connected three-phase converter interfaced resources (CIR) dynamics with the IEEE standard 1547-2018 grid support functions (GSFs), which blends physics and data-driven techniques. First, the letter derives an analytical model of a CIR to represent the internal physics and data-driven model (DDM) using a system identification algorithm to represent the rest of the dynamics, including the GSF. The derived hybrid model combines the analytical model of CIR and DDM, which balances accuracy and flexibility and is compared with the detailed switched model. Furthermore, the efficacy of the proposed approach to represent the advanced CIR dynamics is substantiated by power hardware-in-the-loop experiment data where real measurements from a commercial CIR are used to cross-validate the proposed approach. Furthermore, the results indicate that despite simple, the hybrid model accurately reproduces the dynamics of the detailed CIR model with an acceptable accuracy.

Data-driven model↗

A Scalable Gaussian Process Analysis Algorithm for Biomass Monitoring

Biomass monitoring is vital for studying the carbon cycle of earth's ecosystem and has several significant implications, especially in the context of understanding climate change and its impacts. Recently, several change detection methods have been proposed to identify land cover changes in temporal profiles (time series) of vegetation collected using remote sensing instruments, but do not satisfy one or both of the two requirements of the biomass monitoring problem, i.e., {\em operating in online mode} and {\em handling periodic time series}. In this paper, we adapt Gaussian process regression to detect changes in such time series in an online fashion. While Gaussian process (GP) have been widely used as a kernel based learning method for regression and classification, their applicability to massive spatio-temporal data sets, such as remote sensing data, has been limited owing to the high computational costs involved. We focus on addressing the scalability issues associated with the proposed GP based change detection algorithm. This paper makes several significant contributions. First, we propose a GP based online time series change detection algorithm and demonstrate its effectiveness in detecting different types of changes in {\em Normalized Difference Vegetation Index} (NDVI) data obtained from a study area in Iowa, USA. Second, we propose an efficient Toeplitz matrix based solution which significantly improves the computational complexity and memory requirements of the proposed GP based method. Specifically, the proposed solution can analyze a time series of length $t$ in $O(t^2)$ time while maintaining a $O(t)$ memory footprint, compared to the $O(t^3)$ time and $O(t^2)$ memory requirement of standard matrix manipulation based methods. Third, we describe a parallel version of the proposed solution which can be used to simultaneously analyze a large number of time series. We study three different parallel implementations: using threads, MPI, and a hybrid implementation using threads and MPI. Experimental results show that the hybrid implementation scales better than the multi-threaded and MPI based implementations. The application of the proposed scalable algorithm is demonstrated in analyzing massive remote sensing observation data. The hybrid implementation, using 1536 computing cores, can analyze an NDVI data set for the Iowa study area in nearly 5 seconds, while a serial algorithm, using standard Cholesky decomposition based routines, takes several days to process the same data set.

09 BIOMASS FUELS↗

Quantum-Inspired Maximizer

A report discusses an algorithm for a new kind of dynamics based on a quantum- classical hybrid-quantum-inspired maximizer. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen 'computational' potential. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables, using classical methods. Such optimal combination of characteristics is a perfect match for quantum-inspired computing. As an application, an algorithm for global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithm is very simple: based upon the Quantum-inspired Maximizer (QIM), introduce a positive function to be maximized as the probability density to which the solution is attracted. Then the larger value of this function will have the higher probability to appear. Special attention is paid to simulation of integer programming and NP-complete problems. It is demonstrated that the problem of global maximum of an integrable function can be found in polynomial time by using the proposed quantum- classical hybrid. The result is extended to a constrained maximum with applications to integer programming and TSP (Traveling Salesman Problem).

Zak, Michail↗

Control of Hybrid Power Unit with a Mechanical Transmission in High-Speed Caterpillar Vehicles

Abstract—: The properties of a hybrid power unit in which a mechanical transmission rigidly connects the internal combustion engine to the driving wheels are considered. In this transmission, the torque created by the parallel electric field is summed with the torque generated by the engine in the event of overloading. The control algorithms developed for the electric power prevent its opposition to the mechanical power under any circumstances.

42 ENGINEERING↗

Conceptual design of a hybrid neutron-gamma detector for study of β-delayed neutrons at the RIB facility of RIKEN

Here, the conceptual design of the BRIKEN neutron detector at the radioactive ion beam factory (RIBF) of the RIKEN Nishina Center is reported. The BRIKEN setup is a complex system aimed at detecting heavy-ion implants, β particles, γ rays and β-delayed neutrons. The whole setup includes the Advanced Implantation Detection Array (AIDA), two HPGe Clover detectors and up to 166 3 He-filled counters embedded in a high-density polyethylene moderator. The design is quite complex due to the large number and different types of 3 He-tubes involved and the additional constraints introduced by the ancillary detectors for charged particles and γ rays. This article reports on a novel methodology developed for the conceptual design and optimisation of the 3 He-counter array, aiming for the best possible performance in terms of neutron detection. The algorithm is based on a geometric representation of two selected detector parameters of merit, namely, the average neutron detection efficiency and the efficiency flatness as a function of a reduced number of geometric variables. The response of the neutron detector is obtained from a systematic Monte Carlo simulation implemented in GEANT4. The robustness of the algorithm allowed us to design a versatile detection system, which operated in hybrid mode includes the full neutron counter and two clover detectors for high-precision gamma spectroscopy. In addition, the system can be reconfigured into a compact mode by removing the clover detectors and re-arranging the 3 He tubes in order to maximize the neutron detection performance. Both operation modes shows a rather flat and high average efficiency. In summary, we have designed a system which shows an average efficiency for hybrid mode ( 3 He tubes + clovers) of 68.6% and 64% for neutron energies up to 1 and 5 MeV, respectively. For compact mode (only 3 He tubes), the average efficiency is 75.7% and 71% for neutron energies up to 1 and 5 MeV, respectively. The performance of the BRIKEN detection system has been also quantified by means of Monte Carlo simulations with different neutron energy distributions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Fast, accurate evaluation of exact exchange: The occ-RI-K algorithm

Construction of the exact exchange matrix, K, is typically the rate-determining step in hybrid density functional theory, and therefore, new approaches with increased efficiency are highly desirable. We present a framework with potential for greatly improved efficiency by computing a compressed exchange matrix that yields the exact exchange energy, gradient, and direct inversion of the iterative subspace (DIIS) error vector. The compressed exchange matrix is constructed with one index in the compact molecular orbital basis and the other index in the full atomic orbital basis. To illustrate the advantages, we present a practical algorithm that uses this framework in conjunction with the resolution of the identity (RI) approximation. We demonstrate that convergence using this method, referred to hereafter as occupied orbital RI-K (occ-RI-K), in combination with the DIIS algorithm is well-behaved, that the accuracy of computed energetics is excellent (identical to conventional RI-K), and that significant speedups can be obtained over existing integral-direct and RI-K methods. For a 4400 basis function C{sub 68}H{sub 22} hydrogen-terminated graphene fragment, our algorithm yields a 14 × speedup over the conventional algorithm and a speedup of 3.3 × over RI-K.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗