Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer Programming Integrity”

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,531 records · Page 85

Dose calculation software for helical tomotherapy, utilizing patient CT data to calculate an independent three-dimensional dose cube

Purpose: Treatment plans for the TomoTherapy unit are produced with a planning system that is integral to the unit. The authors have produced an independent dose calculation system, to enable plans to be recalculated in three dimensions, using the patient's CT data. Methods: Software has been written using MATLAB. The DICOM-RT plan object is used to determine the treatment parameters used, including the treatment sinogram. Each projection of the sinogram is segmented and used to calculate dose at multiple calculation points in a three-dimensional grid using tables of measured beam data. A fast ray-trace algorithm is used to determine effective depth for each projection angle at each calculation point. Calculations were performed on a standard desktop personal computer, with a 2.6 GHz Pentium, running Windows XP. Results: The time to perform a calculation, for 3375 points averaged 1 min 23 s for prostate plans and 3 min 40 s for head and neck plans. The mean dose within the 50% isodose was calculated and compared with the predictions of the TomoTherapy planning system. When the modified CT (which includes the TomoTherapy couch) was used, the mean difference for ten prostate patients, was -0.4% (range -0.9% to +0.3%). With the original CT (which included the CT couch), the mean difference was -1.0% (range -1.7% to 0.0%). The number of points agreeing with a gamma 3%/3 mm averaged 99.2% with the modified CT, 96.3% with the original CT. For ten head and neck patients, for the modified and original CT, respectively, the mean difference was +1.1% (range -0.4% to +3.1%) and 1.1% (range -0.4% to +3.0%) with 94.4% and 95.4% passing a gamma 4%/4 mm. The ability of the program to detect a variety of simulated errors has been tested. Conclusions: By using the patient's CT data, the independent dose calculation performs checks that are not performed by a measurement in a cylindrical phantom. This enables it to be used either as an additional check or to replace phantom measurements for some patients. The software has potential to be used in any application where one wishes to model changes to patient conditions.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Group purchasing organization design: a clustering approach

Supply chain management is monitoring of activities involved in supply chain, for integrating and coordinating between suppliers, manufacturing, inventory and transportation both within and among members. The ultimate aim of supply chains is to reduce costs and increase market coverage. Procuring and purchasing requested items in a timely manner are the two most important issues for supply chain stockholders. Group purchasing is one of the purchasing strategies in supply chains. It offers great potential by ordering large volumes to decrease expenses which can increase services to customers. A clustering optimization approach is employed to model group purchasing for a set of pharmacies in the field of healthcare. The proposed model determines a cooperation strategy based on factors such as distance between pharmacies and procurement expenditure in this network. Moreover, the proposed multi-objective group purchasing model is optimized using both goal programming and non-dominated sorting genetic algorithm. To illustrate the application of the proposed model, designing a purchasing group organization for Chalus city pharmacies is investigated. Purchasing groups are established in the way that sum of pharmacies ordering quantity has been located in the second or the third level of discount rate. Thus, the results show that GPOs can take the advantage of this cooperation.

97 MATHEMATICS AND COMPUTING↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Convolution Correction Factor Adjustments on Static PRA Models for Event Assessment

Current probabilistic risk assessment (PRA) models will contain cut sets that have time-constrained basic events such as switched components, recovery of failed components, and failures in time. For these cut sets that have multiple time-constrained events that interact (e.g., offsite power recover at the same time as multiple diesel generators fail to run), there is the possibility that the minimal cut set quantified result is too large. Since current PRA models typically assume that the accident scenario starts at “time zero,” the fails-to-run basic events use this starting time as the basis for their respective reliability models. Over time, the standard practice was to recognize this issue and accept it as part of the conservatism built into the event tree/fault tree PRA models. However, now that these same PRA models are being used in a regulatory forum, this conservatism needs to be addressed. Further, this issue exists not only for the baseline PRA results, but for deficiencies that have been observed or those that have the potential of occurrence, whether the deficiency is complete failure or just a degraded condition. We have found that this conservatism becomes very important when evaluating scenarios such as station blackout sequences and other loss of offsite power sequences. This paper will address the theory and implemented process used by the Systems Analysis Programs for Hands-on Integrated Reliability Evaluations (SAPHIRE) PRA software. Starting with SAPHIRE version 8, the process that was developed is to calculate a “convolution correction factor” based on three distinct calculations. The first calculation is the cut set based frequency calculated via the standard event tree/fault tree PRA model (assuming all run failures start at time equal to zero). The second calculation is to perform the exact time-constrained calculation by integrating the component failure models over the time period of interest (e.g., time to recover, a mission time). For example, this exact calculation for the case of the diesel generators is to convolve their failure models with the offsite power recovery model to obtain the exact frequency. The third calculation is to produce the convolution correction factor by dividing the exact frequency calculation by the standard cut set frequency. This convolution correction factor is then applied to the PRA cut sets in order to remove the time-constrained conservatism. The process used to obtain the convolution correction factor for the baseline PRA is important; however, in this paper we also describe what happens when there is degradation of a component or a potential deficiency. These issues become very important in order to ensure that the convolution correction factor is re-calculated correctly. If the correction factor does not get re-calculated and the same baseline convolution correction factor is used, the final analysis result could be over conservative or under conservative. This paper will discuss how these issues are addressed and provide examples on how SAPHIRE automatically makes the necessary adjustments. MathCad verification results can be computed using the provided equations and input data.

99 GENERAL AND MISCELLANEOUS↗

SU-C-209-05: Monte Carlo Model of a Prototype Backscatter X-Ray (BSX) Imager for Projective and Selective Object-Plane Imaging

Purpose: To develop a Monte Carlo N-Particle (MCNP) model for the validation of a prototype backscatter x-ray (BSX) imager, and optimization of BSX technology for medical applications, including selective object-plane imaging. Methods: BSX is an emerging technology that represents an alternative to conventional computed tomography (CT) and projective digital radiography (DR). It employs detectors located on the same side as the incident x-ray source, making use of backscatter and avoiding ring geometry to enclose the imaging object. Current BSX imagers suffer from low spatial resolution. A MCNP model was designed to replicate a BSX prototype used for flaw detection in industrial materials. This prototype consisted of a 1.5mm diameter 60kVp pencil beam surrounded by a ring of four 5.0cm diameter NaI scintillation detectors. The imaging phantom consisted of a 2.9cm thick aluminum plate with five 0.6cm diameter holes drilled halfway. The experimental image was created using a raster scanning motion (in 1.5mm increments). Results: A qualitative comparison between the physical and simulated images showed very good agreement with 1.5mm spatial resolution in plane perpendicular to incident x-ray beam. The MCNP model developed the concept of radiography by selective plane detection (RSPD) for BSX, whereby specific object planes can be imaged by varying kVp. 10keV increments in mean x-ray energy yielded 4mm thick slice resolution in the phantom. Image resolution in the MCNP model can be further increased by increasing the number of detectors, and decreasing raster step size. Conclusion: MCNP modelling was used to validate a prototype BSX imager and introduce the RSPD concept, allowing for selective object-plane imaging. There was very good visual agreement between the experimental and MCNP imaging. Beyond optimizing system parameters for the existing prototype, new geometries can be investigated for volumetric image acquisition in medical applications. This material is based upon work supported under an Integrated University Program Graduate Fellowship sponsored by the Department of Energy Office of Nuclear Energy.

60 APPLIED LIFE SCIENCES↗

Tools And Methods to Analyze Plant Outage Schedule and Assist Schedulers in Improving Outage Resilience

Refueling outages of nuclear power plants (NPPs) are considered one of the most critical phases throughout the plant lifetime. In such instances, tens of thousands of activities (e.g., maintenance, surveillance) are performed in a short amount of time (typically 2-3 weeks unless major backfitting or modernization projects are carried out) by a large number of crews (e.g., electricians, mechanics) that are hired as contractors. As a consequence, a plant outage can be expensive not only in terms of costs (e.g., contractor labor, material), but also in terms of loss generation since the plant is taken off the grid during the full outage duration (an indicative metric is about 1.2M$/day of loss of revenue). Thus, there is a continuous need to decrease the economic impact of outages on plant finances. This can be done by: decreasing the frequency of plant outages (e.g., from 18 to 24 months), reducing the time to complete the outage, and reducing the risk of outage delays. The Optimization of Outage Activities project under the Risk Informed Systems Analysis Pathway (RISA) sponsored by Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program focuses on developing tools and methods to support NPPs with outage schedule optimization. The developed tools and methods are designed to analyze plant outage schedule with the goal of identify critical elements in the schedule that might pose a high risk of delays. These methods and tools can be considered resource-centric in the sense that they address outage challenges as a resource optimization problem. In this context, resources are either time and crews; outage delays occurs when either (or both) resources are insufficient to complete the set of tasks assigned at a specific time instant of the outage. This report provides details on how plant resources (time and crews) can be allocated in such a way that delays are minimized. In this respect, two classes of methods have been developed: the first one focuses on the time resource and how variability of the time to complete outage tasks may impact outage delays. The second one integrates available resources to assess when dailies activities should be performed such that the risk of outage delays are minimized.

97 MATHEMATICS AND COMPUTING↗

Controlling Subsurface Fractures and Fluid Flow: A Basic Research Agenda

From beneath the surface of the earth, we currently obtain about 80-percent of the energy our nation consumes each year. In the future we have the potential to generate billions of watts of electrical power from clean, green, geothermal energy sources. Our planet’s subsurface can also serve as a reservoir for storing energy produced from intermittent sources such as wind and solar, and it could provide safe, long-term storage of excess carbon dioxide, energy waste products and other hazardous materials. However, it is impossible to underestimate the complexities of the subsurface world. These complexities challenge our ability to acquire the scientific knowledge needed for the efficient and safe exploitation of its resources. To more effectively harness subsurface resources while mitigating the impacts of developing and using these resources, the U.S. Department of Energy established SubTER – the Subsurface Technology and Engineering RD&D Crosscut team. This DOE multi-office team engaged scientists and engineers from the national laboratories to assess and make recommendations for improving energy-related subsurface engineering. The SubTER team produced a plan with the overall objective of “adaptive control of subsurface fractures and fluid flow.”This plan revolved around four core technological pillars—Intelligent Wellbore Systems that sustain the integrity of the wellbore environment; Subsurface Stress and Induced Seismicity programs that guide and optimize sustainable energy strategies while reducing the risks associated with subsurface injections; Permeability Manipulation studies that improve methods of enhancing, impeding and eliminating fluid flow; and New Subsurface Signals that transform our ability to see into and characterize subsurface systems. The SubTER team developed an extensive R&D plan for advancing technologies within these four core pillars and also identified several areas where new technologies would require additional basic research. In response, the Office of Science, through its Office of Basic Energy Science (BES), convened a roundtable consisting of 15 national lab, university and industry geoscience experts to brainstorm basic research areas that underpin the SubTER goals but are currently underrepresented in the BES research portfolio. Held in Germantown, Maryland on May 22, 2015, the round-table participants developed a basic research agenda that is detailed in this report. Highlights include the following: -A grand challenge calling for advanced imaging of stress and geological processes to help understand how stresses and chemical substances are distributed in the subsurface—knowledge that is critical to all aspects of subsurface engineering; -A priority research direction aimed at achieving control of fluid flow through fractured media; -A priority research direction aimed at better understanding how mechanical and geochemical perturbations to subsurface rock systems are coupled through fluid and mineral interactions; -A priority research direction aimed at studying the structure, permeability, reactivity and other properties of nanoporous rocks, like shale, which have become critical energy materials and exhibit important hallmarks of mesoscale materials; -A cross-cutting theme that would accelerate development of advanced computational methods to describe heterogeneous time-dependent geologic systems that could, among other potential benefits, provide new and vastly improved models of hydraulic fracturing and its environmental impacts; -A cross-cutting theme that would lead to the creation of “geo-architected materials” with controlled repeatable heterogeneity and structure that can be tested under a variety of thermal, hydraulic, chemical and mechanical conditions relevant to subsurface systems; -A cross-cutting theme calling for new laboratory studies on both natural and geo-architected subsurface materials that deploy advanced high-resolution 3D imaging and chemical analysis methods to determine the ;rates and mechanisms of fluid-rock processes, and to test predictive models of such phenomena. Many of the key energy challenges of the future demand a greater understanding of the subsurface world in all of its complexity. This greater under- standing will improve the ability to control and manipulate the subsurface world in ways that will benefit both the economy and the environment. This report provides specific basic research pathways to address some of the most fundamental issues of energy-related subsurface engineering.

15 GEOTHERMAL ENERGY↗

High-Speed Ionic Synaptic Memory Based on 2D Titanium Carbide MXene

Synaptic devices with linear high-speed switching can accelerate learning in artificial neural networks (ANNs) embodied in hardware. Conventional resistive memories however suffer from high write noise and asymmetric conductance tuning, preventing parallel programming of ANN arrays. Electrochemical random-access memories (ECRAMs), where resistive switching occurs by ion insertion into a redox-active channel, aim to address these challenges due to their linear switching and low noise. ECRAMs using 2D materials and metal oxides however suffer from slow ion kinetics, whereas organic ECRAMs enable high-speed operation but face challenges toward on-chip integration due to poor temperature stability of polymers. Here, ECRAMs using 2D titanium carbide (Ti 3 C 2 T x ) MXene that combine the high speed of organics and the integration compatibility of inorganic materials in a single high-performance device are demonstrated. These ECRAMs combine the speed, linearity, write noise, switching energy, and endurance metrics essential for parallel acceleration of ANNs, and importantly, they are stable after heat treatment needed for back-end-of-line integration with Si electronics. The high speed and performance of these ECRAMs introduces MXenes, a large family of 2D carbides and nitrides with more than 30 stoichiometric compositions synthesized to date, as promising candidates for devices operating at the nexus of electrochemistry and electronics.

2D materials↗

Enabling a systems biology knowledgebase with gaggle and firegoose

The overall goal of this project was to extend the existing Gaggle and Firegoose systems to develop an open-source technology that runs over the web and links desktop applications with many databases and software applications. This technology would enable researchers to incorporate workflows for data analysis that can be executed from this interface to other online applications. The four specific aims were to (1) provide one-click mapping of genes, proteins, and complexes across databases and species; (2) enable multiple simultaneous workflows; (3) expand sophisticated data analysis for online resources; and enhance open-source development of the Gaggle-Firegoose infrastructure. Gaggle is an open-source Java software system that integrates existing bioinformatics programs and data sources into a user-friendly, extensible environment to allow interactive exploration, visualization, and analysis of systems biology data. Firegoose is an extension to the Mozilla Firefox web browser that enables data transfer between websites and desktop tools including Gaggle. In the last phase of this funding period, we have made substantial progress on development and application of the Gaggle integration framework. We implemented the workspace to the Network Portal. Users can capture data from Firegoose and save them to the workspace. Users can create workflows to start multiple software components programmatically and pass data between them. Results of analysis can be saved to the cloud so that they can be easily restored on any machine. We also developed the Gaggle Chrome Goose, a plugin for the Google Chrome browser in tandem with an opencpu server in the Amazon EC2 cloud. This allows users to interactively perform data analysis on a single web page using the R packages deployed on the opencpu server. The cloud-based framework facilitates collaboration between researchers from multiple organizations. We have made a number of enhancements to the cmonkey2 application to enable and improve the integration within different environments, and we have created a new tools pipeline for generating EGRIN2 models in a largely automated way.

97 MATHEMATICS AND COMPUTING↗

Investigation of Application Specific k eff Sensitivities to Existing and New Subcritical and Critical Experiments

Integral subcritical and critical experiments are essential in providing validation of computational codes which improve confidence in the predicted k eff results of specific applications. This work discusses the relevance of existing integral subcritical and critical experiments to applications far reaching across the nuclear complex. These applications include Travelling Wave Reactors (TWR), Kilopower Reactor Using Stirling Technology (KRUSTY), and plutonium reflected by tantalum. The primary goal of this work is to improve knowledge of energy-dependent cross-section sensitivities for specific applications, identify nuclear data gaps in existing experiments, enable an optimized design of new experiments to address these gaps, and design practical new experiments that could be executed at the National Criticality Experiments Research Center (NCERC) that have a high-value to these applications.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

ROBOT: A Tool for Automating Ontology Workflows

BACKGROUND:Ontologies are invaluable in the life sciences, but building and maintaining ontologies often requires a challenging number of distinct tasks such as running automated reasoners and quality control checks, extracting dependencies and application-specific subsets, generating standard reports, and generating release files in multiple formats. Similar to more general software development, automation is the key to executing and managing these tasks effectively and to releasing more robust products in standard forms. For ontologies using the Web Ontology Language (OWL), the OWL API Java library is the foundation for a range of software tools, including the Protégé ontology editor. In the Open Biological and Biomedical Ontologies (OBO) community, we recognized the need to package a wide range of low-level OWL API functionality into a library of common higher-level operations and to make those operations available as a command-line tool. RESULTS:ROBOT (a recursive acronym for "ROBOT is an OBO Tool") is an open source library and command-line tool for automating ontology development tasks. The library can be called from any programming language that runs on the Java Virtual Machine (JVM). Most usage is through the command-line tool, which runs on macOS, Linux, and Windows. ROBOT provides ontology processing commands for a variety of tasks, including commands for converting formats, running a reasoner, creating import modules, running reports, and various other tasks. These commands can be combined into larger workflows using a separate task execution system such as GNU Make, and workflows can be automatically executed within continuous integration systems. CONCLUSIONS:ROBOT supports automation of a wide range of ontology development tasks, focusing on OBO conventions. It packages common high-level ontology development functionality into a convenient library, and makes it easy to configure, combine, and execute individual tasks in comprehensive, automated workflows. This helps ontology developers to efficiently create, maintain, and release high-quality ontologies, so that they can spend more time focusing on development tasks. It also helps guarantee that released ontologies are free of certain types of logical errors and conform to standard quality control checks, increasing the overall robustness and efficiency of the ontology development lifecycle.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Height Above Nearest Drainage (HAND) and Hydraulic Property Table for CONUS

The continental flood inundation mapping (CFIM) framework is a high-performance computing (HPC)-based computational framework for the Height Above Nearest Drainage (HAND)-based inundation mapping methodology. Using the 10m Digital Elevation Model (DEM) data produced by U.S. Geological Survey (USGS) 3DEP (the 3-D Elevation Program) and the NHDPlus hydrography dataset produced by USGS and the U.S. Environmental Protection Agency (EPA), a hydrological terrain raster called HAND is computed for HUC6 units in the conterminous U.S. (CONUS). The value of each raster cell in HAND is an approximation of the relative elevation between the cell and its nearest water stream. Derived from HAND, a hydraulic property table is established to calculate river geometry properties for each of the 2.7 million river reaches covered by NHDPlus (5.5 million kilometers in total length). This table is a lookup table for water depth given an input stream flow value. Such lookup is available between water depth 0m and 25m at 1-foot interval. The flood inundation map is then computed by using HAND and this lookup table based on the near real-time water forecast from the National Water Model (NWM) at the National Oceanic and Atmospheric Administration (NOAA). HAND and the Hydraulic Property Table version 0.2. is created to correspond to data updates in the USGS 1/3 arcsec DEM, the USGS National Hydrography Dataset, including its Water Boundary Dataset, and the NHDPlus medium resolution dataset. This dataset comprises 331 HUC6 units for CONUS (excluding the five great lakes units), each is a downloadable zip file. Version 0.1 was computed at the National Center for Supercomputing Applications (NCSA) at the University of Illinois at Urban-Champaign in 2016 and is currently hosted at the Texas Advanced Computing Center (TACC). Please cite this data DOI and the following publications and data DOIs when you use HAND and the hydraulic property table: Liu, Yan Y., David R. Maidment, David G. Tarboton, Xing Zheng, and Shaowen Wang. 'A CyberGIS integration and computation framework for high-resolution continental-scale flood inundation mapping.' JAWRA Journal of the American Water Resources Association 54, no. 4 (2018): 770-784. DOI: 10.1111/1752-1688.12660 Zheng, Xing, David G. Tarboton, David R. Maidment, Yan Y. Liu, and Paola Passalacqua. 'River channel geometry and rating curve estimation using height above the nearest drainage.' JAWRA Journal of the American Water Resources Association 54, no. 4 (2018): 785-806. DOI: 10.1111/1752-1688.12661 Liu, Y. (2018). Height Above Nearest Drainage (HAND) for CONUS - v0.1, HydroShare, https://doi.org/10.4211/hs.69f7d237675c4c73938481904358c789 LICENSE FOR USE -- MAPS AND DATA DISCLAIMER This resource is shared under the Creative Commons Attribution CC BY, http://creativecommons.org/licenses/by/4.0/ MAPS AND DATA DISCLAIMER The Oak Ridge National Laboratory (ORNL) shall not be held liable for improper or incorrect use of the data described or information contained on this map or associated series of maps. The data and related map graphics are not legal, land survey or engineering documents and are not intended to be used as such. ORNL gives no warranty, express or implied, as to the accuracy, reliability, utility or completeness of this information. The user of these maps and data assumes all responsibility and risk for the use of the maps and data. ORNL disclaims all warranties, representations or endorsements either express or implied, with regard to the information contained in this map product, including, but not limited to, all implied warranties of merchantability, fitness for a particular purpose or non-infringement. This preliminary map product is for research and review purposes only. It is not intended to be used for emergency management operational or life safety decisions at the local or regional governmental level or by the general public. Users requiring information regarding hazardous conditions or meteorological conditions for specific geographic areas should consult directly with their city or county emergency management office.

54 ENVIRONMENTAL SCIENCES↗

Validation of GOES-Derived Surface Radiation Using NOAA's Physical Retrieval Method

A comparison of satellite-derived solar resource with nine high-quality, ground-based solar radiation measurements from NOAA’s Surface Radiation (SURFRAD) Network, the Integrated Surface Insolation Study (ISIS) Network, the Solar Radiation Research Laboratory (SRRL) at NREL, and DOE’s Solar Resource and Meteorological Assessment Project (SOLRMAP) program was conducted. The comparison was made using data from 2009 for various locations. Our results showed that the satellite-based method underpredicted both global horizontal irradiance (GHI) and direct normal irradiance (DNI). GHI values were underestimated by about 13% to 22% for the stations located in a desert environment, such as Desert Rock, Nevada, and SOLRMAP stations located around southwest Nevada and Arizona. We found that the Satellite Algorithm for Shortwave Radiation Budget (SASRAB) radiative transfer model caused the underprediction of GHI and DNI, especially in clear-sky situations and low zenith angles (around solar noon). Using other radiative transfer algorithms reduced the bias from SASRAB, and it is expected that the accuracy of the satellite-based product will significantly improve with the introduction of a high-quality, radiative transfer model. Future work will aim to reduce the biases by using better input parameters and applying these parameters to a better, simple, clear-sky radiative transfer model that properly accounts for the parameters.

14 SOLAR ENERGY↗

Improving Coal-Fired Plant Performance Through Integrated Predictive and Condition-Based Monitoring Tools

The project demonstrated the ability to improve boiler performance and reliability through the integrated use of condition-based monitoring (CBM) and predictions of the impacts of coal quality on boiler operations at a full-scale coal-fired power plant. The advanced tool developed actively monitors and manages coal quality and overall boiler conditions that maximizes availability and maintains generating capacity while reducing cost. The tool is used to forecast and alert plant operators and engineers about poor boiler conditions which may occur as a result of incoming coal and/or current power plant operating conditions. The Combustion System Performance Indices (CSPI) and CoalTracker (CT) programs predicts fireside performance of the plant including slagging, fouling, erosion, slag flow, strength development (sintering/densification), and slag layer thickness based on the composition of delivered coal. CT program is tailored for each plant and is used to track the coal from the point of delivery to the burner. The most successful application of the CSPI-CT has been at plants where the coal composition is determined through the use of a full stream elemental analyzers based on prompt gamma neutron analysis (PGNAA). The CSPI-CT program information is used by coal procurement, coal mining and plant operations personnel to select and blend coal properties for the best plant performance.

01 COAL, LIGNITE, AND PEAT↗

The IQ-wall and IQ-station -- harnessing our collective intelligence to realize the potential of ultra-resolution and immersive visualization

We present a pair of open-recipe, affordably-priced, easy-to-integrate, and easy-to-use visualization systems. The IQ-wall is an ultra-resolution tiled display wall that scales up to 24 screens with a single PC. The IQ-station is a semi-immersive display system that utilizes commodity stereoscopic displays, lower cost tracking systems, and touch overlays. These systems have been designed to support a wide range of research, education, creative activities, and information presentations. They were designed to work equally well as stand-alone installations or as part of a larger distributed visualization ecosystem. We detail the hardware and software components of these systems, describe our deployments and experiences in a variety of research lab and university environments, and share our insights for effective support and community development.

97 MATHEMATICS AND COMPUTING↗

JBlulce Data Acquisition Software for Macromolecular Crystallography

JBlulce (Java Beam Line Universal Integrated Configuration Environment is a data acquisition software for macromolecular crystallography conforming user interface of the SSRL Blulce that has become a de-factor standard in the field. Besides this interface conformity, JBlulce is a unique system in terms of architecture, spec, capability and software implementation. It features only two software layers, the JBlulce clients and the EPICS servers, as compared to three layers present in Blulce and most of similar systems. This layers reduction provides a faster communication with hardware and an easier access to advanced hardware capabilities like on-the-fly scanning. Then JBlulce clients are designed to operate in parallel with the other beamline controls which streamlines the tasks performed by staff such as beamline preparation, maintenance, auditing and user assistance. Another distinction is the deployment of multiple plugins that can be written in any programming language thus involving more staff into the development. further on, JBlulce makes use of unified motion controls allowing for easy scanning and optimizing of any beamline component. Finally, the graphic interface is implemented in Java making full use of rich Java libraries and Jave IDE for debugging. to compare, Blulce user interface is implemented with aging Tcl/tk language providing very restricted capabilities. JBlulce makes full use of the industrial power and wide drivers selection of EPICS in controlling hardware; all hardware communication is routed via multiple EPICS servers residing on local area network. JBlulce also includes several EPICS State Notation servers aimed at making hardware communication more robust. Besides using EPICS for controlling hardware, JBlulce extensively uses EPICS databases for efficient communications between multiple instances of JBlulce clients and JBlulce plugins that can run in parallel on different computers. All of the above makes JBlulce one of the biggest and most sophisticated EPICS client projects to date. JBlulce configuration is stored in my SQL database which provides flexibility in tuning the system. The database is also accessible by the plugins. From the users perspective JBlulce provides all standard features of data acquisition software for macromolecular crystallography plus such unique capabilities as one click beamline energy change that may involve switching undulator harmonics, mirrors lanes and beam realignment, automated diffraction rtastering for finding small crystals and sweet spots on poorly diffracting crystals with automated scoring of raster cells by the number of reflections; data collection along a vector; automated on-the-fly fluorescent tastering, a faster and lower-irradiation compliment to the diffraction raster; fully automated fluorescence measurements for MAD that include signal optimization, fast on the fly energy scanning and automated adapting of scan range to chemical shifts; fly-scan minibeam realignment; automated loop and crystal centering, controls for sample automounter, automated screening, data collection auditing, remote access and a lot more.

Stepanov, Sergey↗

Search for New Phenomena Using W/Z + (b)-Jets Measurements Performed with the ATLAS Detector

The Project proposed to use data of the ATLAS experiment, obtained during the 2011 and 2012 data-taking campaigns, to pursue studies of the strong interaction (QCD) and to examine promising signatures for new physics. The Project also contains a service component dedicated to a detector development initiative. The objective of the strong interaction studies is to determine how various predictions from the main theory (QCD) compare to the data. Results of a set of measurements developed by the Tufts team indicate that the dominant factor of discrepancy between data and QCD predictions come from the mis-modeling of the low energy gluon radiation as described by algorithms called parton showers. The discrepancies introduced by parton showers on LHC predictions could even be larger than the effect due to completely new phenomena (dark matter, supersymmetry, etc.) and could thus block further discoveries at the LHC. Some of the results obtained in the course of this Project also specify how QCD predictions must be improved in order to open the possibility for the discovery of something completely new at the LHC during Run-II. This has been integrated in the Run-II ATLAS physics program. Another objective of Tufts studies of the strong interaction was to determine how the hypothesis about an intrinsic heavy-quark component of the proton (strange, charm or bottom quarks) could be tested at the LHC. This hypothesis has been proposed by theorists 30 years ago and is still controversial. The Tufts team demonstrated that intrinsic charms can be observed, or severely constrained, at the LHC, and determine how the measurement should be performed in order to maximize its sensitivity to such an intrinsic heavy-quark component of the proton. Tufts also embarked on performing the measurement that is in progress, but final results are not yet available. They should shade a light of understanding on the fundamental structure of the proton. Determining the nature of dark matter particles, composing about 25% of all the matter in the universe, is one of the most exciting research goals at the LHC. Within this Project, the Tufts team proposed a way to improve over the standard approach used to look for dark matter at the LHC in events involving jets and a large amount of unbalanced energy in the detector (jets+ETmiss). The Tufts team has developed a measurement to test these improvements on data available (ATLAS 2012 dataset), in order to be ready to apply them on the new Run-II data that will be available at the end of 2015. Preliminary results on the proposed measurement indicate that a very high precision can be obtained on results free of detector effects. That will allow for better constrains of dark matter theories and will spare the needs for huge computing resources in order to compare dark matter theories to data. Finally, the Tufts team played a leading role in the development and the organization of the 6Et trigger, the detector component needed to collect the data used in dark matter searches and in many other analyses. The team compared the performance of the various algorithms capable of reconstructing the value of the ETmiss on each LHC collision event, and developed a strategy to commission these algorithms online. Tufts also contributed in the development of the ETmiss trigger monitoring software. Finally, the PI of this Project acted as the co-coordinator of the group of researchers at CERN taking care of the development and the operation of this detector component. The ETmiss trigger is now taking data, opening the possibility for the discovery of otherwise undetectable particles at the LHC.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SU-C-207-01: Four-Dimensional Inverse Geometry Computed Tomography: Concept and Its Validation

Purpose: In past few years, the inverse geometry computed tomography (IGCT) system has been developed to overcome shortcomings of a conventional computed tomography (CT) system such as scatter problem induced from large detector size and cone-beam artifact. In this study, we intend to present a concept of a four-dimensional (4D) IGCT system that has positive aspects above all with temporal resolution for dynamic studies and reduction of motion artifact. Methods: Contrary to conventional CT system, projection data at a certain angle in IGCT was a group of fractionated narrow cone-beam projection data, projection group (PG), acquired from multi-source array which have extremely short time gap of sequential operation between each of sources. At this, for 4D IGCT imaging, time-related data acquisition parameters were determined by combining multi-source scanning time for collecting one PG with conventional 4D CBCT data acquisition sequence. Over a gantry rotation, acquired PGs from multi-source array were tagged time and angle for 4D image reconstruction. Acquired PGs were sorted into 10 phase and image reconstructions were independently performed at each phase. Image reconstruction algorithm based upon filtered-backprojection was used in this study. Results: The 4D IGCT had uniform image without cone-beam artifact on the contrary to 4D CBCT image. In addition, the 4D IGCT images of each phase had no significant artifact induced from motion compared with 3D CT. Conclusion: The 4D IGCT image seems to give relatively accurate dynamic information of patient anatomy based on the results were more endurable than 3D CT about motion artifact. From this, it will be useful for dynamic study and respiratory-correlated radiation therapy. This work was supported by the Industrial R&D program of MOTIE/KEIT [10048997, Development of the core technology for integrated therapy devices based on real-time MRI guided tumor tracking] and the Mid-career Researcher Program (2014R1A2A1A10050270) through the National Research Foundation of Korea funded by the Ministry of Science, ICT&Future Planning.

60 APPLIED LIFE SCIENCES↗