Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Software algorithms”

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 811 records · Page 45

A Thermo-Optic Propagation Modeling Capability.

A new theoretical basis is derived for tracing optical rays within a finite-element (FE) volume. The ray-trajectory equations are cast into the local element coordinate frame and the full finite-element interpolation is used to determine instantaneous index gradient for the ray-path integral equation. The FE methodology (FEM) is also used to interpolate local surface deformations and the surface normal vector for computing the refraction angle when launching rays into the volume, and again when rays exit the medium. The method is implemented in the Matlab(TM) environment and compared to closed- form gradient index models. A software architecture is also developed for implementing the algorithms in the Zemax(TM) commercial ray-trace application. A controlled thermal environment was constructed in the laboratory, and measured data was collected to validate the structural, thermal, and optical modeling methods.

Schrader, Karl↗

RIKEN/RBRC Scientific Review Committee Meeting April 5-8, 2016. Proceedings of RIKEN BNL Research Center, Volume 126

Considerable progress in lattice gauge computing has been made by the RBRC Computing Group over the last 5 years. The lattice gauge community has recognized some of this work by awarding two Wilson prizes, in 2012 and in 2015. The Computing Group, in collaboration with RIKEN, BNL and the UKQCD collaboration, has focused on both physics simulations and technical developments, in both software and hardware. The physics output has been primarily in the area of fundamental physical quantities, e.g., in K and B mesons, nucleon form factors, g-2 of the muon, electric dipole moments and physics beyond the Standard Model. The software effort has produced new and/or more efficient algorithms, such as the all-mode averaging (AMA), and ensemble generation techniques. This proceedings records the 14th scientific evaluation of the RIKEN BNL Research Center (RBRC). In order to illustrate the breadth and scope of the RBRC program, each member of the Center made a presentation on his/her research efforts. This encompassed three major areas of investigation: theoretical, experimental and computational physics. In addition, the committee met privately with the fellows and postdocs to ascertain their opinions and concerns. Although the main purpose of this review is a report to RIKEN management on the health, scientific value, management and future prospects of the Center, the RBRC management felt that a compendium of the scientific presentations are of sufficient quality and interest that they warrant a wider distribution. Therefore we have made this compilation and present it to the community for its information and enlightenment.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Integrated IO Services for Trilinos Data Structures

The Trilinos Project is an effort to develop algorithms and enabling technologies within an object- oriented software framework for the solution of large-scale, complex multi-physics engineering and scientific problems. A unique design feature of Trilinos is its focus on packages. While the abstractions make it easy to incorporate advanced processing and data manipulation tools, it is not always obvious how to take advantage of these features. The trios package incorporated two years ago offers general data management services, but has yet to offer integrated support for core Trilinos data structures, such as those offered in the Tpetra package. An initial attempt to incorporate native Trilinos data structure support into trios services revealed the complexity, from a non-mathematician's perspective, of using Trilinos. This project sought to understand the complexities and potential barriers not just for non-mathematicians that want to contribute to or use Trilinos, but potentially for new mathematically-inclined users as well that may want to offer services to support users. This report documents the challenges for trios to offer some simple data manipulation required as a precursor to any direct data services integration and makes recommendations for clarifying the performance implications and general approach to use.

97 MATHEMATICS AND COMPUTING↗

Multi-scale Molecular Systems Biology: Reconstruction and Model Optimization (Final Report)

Within the Biological and Environmental Research program, the goal of the Genomic Science program is to achieve a predictive, systems-level understanding of plants, microbes, and biological communities to enable biobased solutions to DOE mission challenges in energy and environment. To achieve this goal, an ultimate objective is to develop the knowledgebase, computational infrastructure, and modeling capabilities to advance predictive understanding and manipulation of biological systems. Our project has increased the modeling capabilities and computational infrastructure required to advance predictive understanding and manipulation of biological systems. In particular, we have developed novel algorithms, for modelling biochemical reaction kinetics at genome-scale. These new algorithms have been publicly disseminated as open source software with extensive documentation and tutorials that enable widespread application of this advanced software to practical modelling scenarios. The technical effectiveness of all novel software has been conclusively demonstrated and the quality of this software is maintained by a dedicated continuous integration system. Ultimately, the results of this project will benefit the public because it will enable biologists to more accurately computationally model biological systems that need to be understood to address DOE challenges in energy and environment.

09 BIOMASS FUELS↗

Calibration and Commissioning of the LSST

Understanding the nature of dark energy and dark matter remains one of the fundamental questions in physics today; impacting our understanding of particle physics, cosmology, and possibly theories of gravity. Given the scale and complexity of the next generation of cosmology experiments (e.g., the Rubin Observatory, the Euclid satellite mission, and the Roman space telescope) we are entering an era where statistical noise no longer determines the accuracy to which we can measure cosmological parameters. Our ability to control and correct for systematics will ultimately determine the scientific impact of these experiments. This award addressed the challenge of how we determine what limits the accuracy of our cosmological measures, what techniques are appropriate for measuring and calibrating the properties of galaxies to best constrain cosmological models, how to develop statistical techniques that are insensitive to systematic errors, and how to optimize survey strategies in order to minimize systematics while maximizing the speed at which an experiment can achieve its science objectives. In this final technical report for award DE-SC0011635 we describe a set of open-source frameworks that simulate the characteristics and properties of current and planned cosmology surveys and the application of these frameworks to the development of new methodologies for estimating the properties and distances to galaxies that are robust to noisy and incomplete data.

79 ASTRONOMY AND ASTROPHYSICS↗

Route Energy Prediction (RouteE) Powertrain Validation Report

The National Renewable Energy Laboratory's flagship package in the RouteE suite, RouteE-Powertrain, is a mesoscopic energy model that predicts vehicle energy consumption given discrete attributes that describe each segment or link in a vehicle's path on a road network. High-frequency, physics-based, powertrain simulators, such as NREL's FASTSim, are well-suited to model vehicle energy consumption when real driving data and a detailed understanding of the vehicle powertrain specifications are available. However, there are a variety of situations in the past, present (real-time), and future where high-frequency driving data and/or vehicle information may not be available, but reliable energy consumption is still desired, such as energy-aware vehicle routing. These are the ideal applications for RouteE-Powertrain. The suite of RouteE tools also includes RouteE-Compass, which is an eco-routing software that incorporates energy consumption into network routing algorithms, and RouteE-Mobile, which is a prototype smartphone navigation app to demonstrate the integrated capabilities of the RouteE suite for real-world eco-routing. The focus of this validation report is to share key metrics about the data sets and models behind RouteE-Powertrain. The set of RouteE-Powertrain models discussed in this report are made available through the RouteE web API through the NREL Developer Network.

33 ADVANCED PROPULSION SYSTEMS↗

The Analysis Description Language Ecosystem: Latest developments and physics applications

We present latest developments in Analysis Description Language (ADL), a declarative domain-specific language describing the physics algorithm of a HEP data analysis decoupled from software frameworks. Analyses written in ADL can be integrated into any framework for various tasks. ADL is a multipurpose construct with uses ranging from analysis design to preservation, reinterpretation, queries, visualisation, combination, etc. The most advanced infrastructure to execute ADL on events is the CutLang runtime interpreter. Recent technical developments include an automated interface with different data types, generation of the abstract syntax tree, a visualization tool that that auto-converts analysis flows to graphs, incorporation of trained machine learning models and a Jupyter-based plotting tool. We also report physics implications including a large scale LHC analysis implementation and validation effort for beyond the standard model reinterpretation purposes and studies with ATLAS and CMS open data.

Sekmen, Sezen [Kyungpook National Univ., Daegu (Ko↗

Modular Environment for Graph Research and Analysis with a Persistent

The MEGRAPHS software package provides a front-end to graphs and vectors residing on special-purpose computing resources. It allows these data objects to be instantiated, destroyed, and manipulated. A variety of primitives needed for typical graph analyses are provided. An example program illustrating how MEGRAPHS can be used to implement a PageRank computation is included in the distribution.The MEGRAPHS software package is targeted towards developers of graph algorithms. Programmers using MEGRAPHS would write graph analysis programs in terms of high-level graph and vector operations. These computations are transparently executed on the Cray XMT compute nodes.

JANSSEN, CURTIS↗

ISMB Conference Funding to Support Attendance of Early Researchers and Students

ISMB Conference Funding for Students and Young Scientists Historical Description The Intelligent Systems for Molecular Biology (ISMB) conference has provided a general forum for disseminating the latest developments in bioinformatics on an annual basis for the past 22 years. ISMB is a multidisciplinary conference that brings together scientists from computer science, molecular biology, mathematics and statistics. The goal of the ISMB meeting is to bring together biologists and computational scientists in a focus on actual biological problems, i.e., not simply theoretical calculations. The combined focus on “intelligent systems” and actual biological data makes ISMB a unique and highly important meeting. 21 years of experience in holding the conference has resulted in a consistently well-organized, well attended, and highly respected annual conference. "Intelligent systems" include any software which goes beyond straightforward, closed-form algorithms or standard database technologies, and encompasses those that view data in a symbolic fashion, learn from examples, consolidate multiple levels of abstraction, or synthesize results to be cognitively tractable to a human, including the development and application of advanced computational methods for biological problems. Relevant computational techniques include, but are not limited to: machine learning, pattern recognition, knowledge representation, databases, combinatorics, stochastic modeling, string and graph algorithms, linguistic methods, robotics, constraint satisfaction, and parallel computation. Biological areas of interest include molecular structure, genomics, molecular sequence analysis, evolution and phylogenetics, molecular interactions, metabolic pathways, regulatory networks, developmental control, and molecular biology generally. Emphasis is placed on the validation of methods using real data sets, on practical applications in the biological sciences, and on development of novel computational techniques. The ISMB conferences are distinguished from many other conferences in computational biology or artificial intelligence by an insistence that the researchers work with real molecular biology data, not theoretical or toy examples; and from many other biological conferences by providing a forum for technical advances as they occur, which otherwise may be shunned until a firm experimental result is published. The resulting intellectual richness and cross-disciplinary diversity provides an important opportunity for both students and senior researchers. ISMB has become the premier conference series in this field with refereed, published proceedings, establishing an infrastructure to promote the growing body of research.

60 APPLIED LIFE SCIENCES↗

Unobtrusive Multi-Static Serial LiDAR Imager (UMSLI) First Generation Shape-Matching Based Classifier for 2D Contours

A multi-static serial LiDAR system prototype was developed under DE-EE0006787 to detect, classify, and record interactions of marine life with marine hydrokinetic generation equipment. This software implements a shape-matching based classifier algorithm for the underwater automated detection of marine life for that system. In addition to applying shape descriptors, the algorithm also adopts information theoretical learning based affine shape registration, improving point correspondences found by shape descriptors as well as the final similarity measure.

Cao, Zheng↗

Cooperative Adaptive Cruise Control (CACC) in Controlled and Real-World Environments: Testing and Results

The transportation industry annually travels more than 6 times as many miles as passenger vehicles. The fuel cost associated with this represents 38% of the total marginal operating cost for this industry. As a result, industry’s interest in applications of autonomy have grown. One application of this technology is Cooperative Adaptive Cruise Control (CACC) using Dedicated Short-Range Communications (DSRC). Auburn University outfitted four class 8 vehicles, two Peterbilt 579’s and two M915’s, with a basic hardware suite, and software library to enable level 1 autonomy. These algorithms were tested in controlled environments, such as the American Center for Mobility (ACM), and on public roads, such as highway 280 in Alabama, and Interstates 275/696 in Michigan. This paper reviews the results of these real-world tests and discusses the anomalies and failures that occurred during testing.

42 ENGINEERING↗

Jitter tracking anti-spoofing algorithm

A system and method to distinguish spoofing signals from true GNSS signals is disclosed. One aspect of the present invention combines measuring GNSS carrier signals with measuring jitter in a vehicle's position via a low-cost inertial measurement unit (IMU) to distinguish spoofing signals from true GNSS signals. The present invention employs natural and/or artificial jitter of a vehicle, that, when combined with a tightly coupled inertial navigation system (INS), allows the receiver to distinguish the spoofing GNSS signal from the true GNSS signal. This spoofer survivability algorithm may be implemented, for example, in the software of a GNSS (or GPS) navigation system.

Brashar, Connor↗

Automation of Vulnerability and Patch Management: Information Extraction, Association, and Optimization

Vulnerability and patch management is an integral part of a robust cybersecurity program, yet it grows increasingly complex due to the sheer amount of data that must be analyzed. Particularly in Operational Technology (OT) environments, analysis must be done manually because of the lack of automated solutions. Additionally, there are many steps in this process, from the initial discovery of the vulnerability to the implementation of its remediation, and each step in the process requires different data in order to be performed effectively. In this work, we provide approaches and strategies to assist operators in industrial or OT environments throughout the vulnerability management cycle. Security advisories provide key information about mitigation strategies, or actions that can be taken when a patch is unavailable or cannot be installed. Details of these strategies are not shared in public vulnerability databases and must be found manually. We approach this problem by designing a solution to automatically identify that information within vendor security advisories and retrieve it for operator use. We start with an approach that requires domain-specific knowledge of certain frequently-seen reference websites. Next, an approach that can work on an arbitrary website but relies on certain keywords. Finally, an approach that uses Natural Language Processing (NLP) methods and does not require specific knowledge or keywords. Each of these approaches is more general than its predecessor; we demonstrate high accuracy for all approaches Advisories also often contain details of affected products in non-standard or natural language formats. While this information can be easily understood when read by an operator, the non-standard format acts as a barrier to effective automation. We provide an approach for the first step in this process: identifying vendors in security advisories and mapping them to a standard framework for representing digital assets and software products. We evaluate five established string similarity algorithms, plus one of our own design that combines string similarity and information theory, on the task of mapping vendors to their corresponding entries in the Common Platform Enumeration (CPE) repository. Our results show that our proposed metric outperforms all others. Due to the constraints on time, finances, and personnel for organizations, Large Language Models (LLMs) may seem like attractive opportunities for security operators to speed up information gathering; however, it is still not clear whether LLMs can handle vulnerability management tasks well. To answer this question, we perform an empirical study of LLMs’ ability to provide consistent, accurate information about vulnerabilities in order to guide organizations in their adoption of LLMs. We observe poor performance for all models tested, suggesting that these models are not well-suited to the consistent retrieval of accurate vulnerability information. Finally, once vulnerabilities have been identified and any additional information has been obtained, operators must decide which remediation actions to implement based on their available resources. This already-complex problem becomes even more so when we consider that a vulnerability may have multiple avenues for remediation. We formulate this scenario as two knapsack problems and provide solutions, which we then compare against several existing strategies for vulnerability prioritization seen in real operational environments.

McClanahan, Kylie↗

Improving ICARUS track reconstruction algorithms

The ICARUS experiment is part of the Short-Baseline Neutrino program at Fermilab. Its primary objective is to explore the possible existence of sterile neutrinos in the O(1 eV) mass range and to clarify the anomalies observed in the Liquid Scintillator Neutrino Detector and MiniBooNE experiments. The ICARUS-T600 detector is a Liquid Argon Time Projection Chamber, capable of producing high-resolution 3D images and precise calorimetric measurements of ionizing particles. This technology allows for a detailed study of neutrino interactions across a broad energy range, from a few keV to several hundred GeV. The track reconstruction is achieved through a software framework that applies a series of pattern recognition algorithms, transforming raw detector signals into fully reconstructed event topologies. This process involves identifying interaction vertices, particle tracks, and electromagnetic showers within the TPC. However, in certain cases, these algorithms may mistakenly break a single particle track into several shorter segments, interpreting each as a distinct particle. Since track length is used to estimate the particle's energy, such fragmentation can result in an energy underestimation of several hundred MeV. Furthermore, when a track is split into multiple segments, the particle identification (which relies on analyzing the energy loss as a function of the residual range) may fail, potentially leading to the loss of the entire event. To mitigate this problem, we have developed a dedicated algorithm designed to identify and reconnect (“stitch”) the tracks that were erroneously divided into multiple segments.

Ricci, Alessandro Maria [Pisa U.; INFN, Pisa] (ORC↗

Fast analysis of molecular dynamics trajectories with graphics processing units-Radial distribution function histogramming

The calculation of radial distribution functions (RDFs) from molecular dynamics trajectory data is a common and computationally expensive analysis task. The rate limiting step in the calculation of the RDF is building a histogram of the distance between atom pairs in each trajectory frame. Here we present an implementation of this histogramming scheme for multiple graphics processing units (GPUs). The algorithm features a tiling scheme to maximize the reuse of data at the fastest levels of the GPU's memory hierarchy and dynamic load balancing to allow high performance on heterogeneous configurations of GPUs. Several versions of the RDF algorithm are presented, utilizing the specific hardware features found on different generations of GPUs. We take advantage of larger shared memory and atomic memory operations available on state-of-the-art GPUs to accelerate the code significantly. The use of atomic memory operations allows the fast, limited-capacity on-chip memory to be used much more efficiently, resulting in a fivefold increase in performance compared to the version of the algorithm without atomic operations. The ultimate version of the algorithm running in parallel on four NVIDIA GeForce GTX 480 (Fermi) GPUs was found to be 92 times faster than a multithreaded implementation running on an Intel Xeon 5550 CPU. On this multi-GPU hardware, the RDF between two selections of 1,000,000 atoms each can be calculated in 26.9 s per frame. The multi-GPU RDF algorithms described here are implemented in VMD, a widely used and freely available software package for molecular dynamics visualization and analysis.

97 MATHEMATICS AND COMPUTING↗

SU-E-J-264: Comparison of Two Commercially Available Software Platforms for Deformable Image Registration

Purpose: To evaluate and compare the deformable image registration algorithms available in the Velocity (Velocity Medical Solutions, Atlanta, GA) and RayStation (RaySearch Americas, Inc., Garden city NY). Methods: Ten consecutive patient cone beam CTs (CBCT) for each fraction were collected. The CBCTs along with the simulation CT were exported to the Velocity and the RayStation software. Each CBCT was registered using deformable image registration to the simulation CT and the resulting deformable vector matrix was generated. Each registration was visually inspected by a physicist and the prescribing physician. The volumes of the critical organs were calculated for each deformable CT and used for comparison. Results: The resulting deformable registrations revealed differences between the two algorithms. These differences were realized when the organs at risk were contoured on each deformed CBCT. Differences in the order of 10% ±30% in volume were observed for bladder, 17 ±21% for rectum and 16±10% for sigmoid. The prostate and PTV volume differences were in the order of 3±5%. The volumetric differences observed had a respective impact on the DVHs of all organs at risk. Differences of 8–10% in the mean dose were observed for all organs above. Conclusion: Deformable registration is a powerful tool that aids in the definition of critical structures and is often used for the evaluation of daily dose delivered to the patient. It should be noted that extended QA should be performed before clinical implementation of the software and the users should be aware of advantages and limitations of the methods.

60 APPLIED LIFE SCIENCES↗

ALERT AATR Final Report: Lawrence Livermore National Laboratory

This report addresses the problem of automatically recognizing objects of interest (OOIs) in x-ray computed tomography (CT) images of baggage (plastic bins in our case). The discussion draws heavily from the material in [1]. The material composition and basic physical features of interest (FOIs, such as mass and thickness) of the OOIs are defined in an object requirement specification (ORS). The ORS may also provide a detection – false alarm probability goal for each material of interest (MOI). Automatic threat recognition (ATR) systems identify CT images of baggage that contain OOIs. ATRs must also identify locations of OOIs within baggage. The current ATR certification process used by DHS requires the ATR hardware and software to be certified on a specific ORS. When the ORS changes, the ATR hardware and software must be recertified. To pass re-certification, the hardware, algorithms and codes may need to be modified. Because ATR-based certification and re-certification are so time-consuming, the current process cannot quickly adapt to changing requirements. Unlike ATRs, adaptive automatic threat recognition (AATR) systems can quickly adapt to an ORS that changes or evolves over time [2]. The proposed AATR-based certification process would require the AATR hardware and software to be certified on a specific baseline ORS. Once certified, the same AATR hardware, algorithms and codes would be applied (by TSA or its delegates) to any ORS supplied in the future as input without going through lengthy recertification. This proposed process would enable the AATR to quickly adapt to changing requirements. This report describes the AATR developed at the Lawrence Livermore National Laboratory (LLNL) for x-ray CT images of baggage. The need and technical requirements for an AATR were developed in collaboration with DHS’s Explosives Division and Northeastern University’s Awareness and Localization of Explosives-Related Threats (ALERT) Center, a DHS Center of Excellence (http://www.northeastern.edu/alert/).

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗