Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Abstract”

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,333 records · Page 74

STELAR: An experiment in the electronic distribution of astronomical literature

STELAR (Study of Electronic Literature for Astronomical Research) is a Goddard-based project designed to test methods of delivering technical literature in machine readable form. To that end, we have scanned a five year span of the ApJ, ApJ Supp, AJ and PASP, and have obtained abstracts for eight leading academic journals from NASA/STI CASI, which also makes these abstracts available through the NASA RECON system. We have also obtained machine readable versions of some journal volumes from the publishers, although in many instances, the final typeset versions are no longer available. The fundamental data object for the STELAR database is the article, a collection of items associated with a scientific paper - abstract, scanned pages (in a variety of formats), figures, OCR extractions, forward and backward references, errata and versions of the paper in various formats (e.g., TEX, SGML, PostScript, DVI). Articles are uniquely referenced in the database by journal name, volume number and page number. The selection and delivery of articles is accomplished through the WAIS (Wide Area Information Server) client/server models requiring only an Internet connection. Modest modifications to the server code have made it capable of delivering the multiple data types required by STELAR. WAIS is a platform independent and fully open multi-disciplinary delivery system, originally developed by Thinking Machines Corp. and made available free of charge. It is based on the ISO Z39.50 standard communications protocol. WAIS servers run under both UNIX and VMS. WAIS clients run on a wide variety of machines, from UNIX-based Xwindows systems to MS-DOS and macintosh microcomputers. The WAIS system includes full-test indexing and searching of documents, network interface and easy access to a variety of document viewers. ASCII versions of the CASI abstracts have been formatted for display and the full test of the abstracts has been indexed. The entire WAIS database of abstracts is now available for use by the astronomical community. Enhancements of the search and retrieval system are under investigation to include specialized searches (by reference, author or keyword, as opposed to full test searches), improved handling of word stems, improvements in relevancy criteria and other retrieval techniques, such as factor spaces. The STELAR project has been assisted by the full cooperation of the AAS, the ASP, the publishers of the academic journals, librarians from GSFC, NRAO and STScI, the Library of Congress, and the University of North Carolina at Chapel Hill.

Warnock, A.↗

Intent Specifications

We have been investigating the implications of using abstractions based on intent rather than the aggregation and information-hiding abstractions commonly used in software en- gineering: Cognitive psychologists have shown that intent abstraction is consistent with human problem-solving processes. We believe that new types of specifications and designs based on this concept can assist in understanding and specifying requirements, capturing the most important design rationale information in an efficient and economical way, and supporting the process of identifying and analyzing required changes to minimize the introduction of errors. The goal of hierarchical abstraction is to allow both top-down and bottom-up reasoning about a complex system. In computer science, we have made much use of (1) part-whole abstractions where each level of a hierarchy represents an aggregation of the components at a lower level and of (2) information-hiding abstractions where each level contains the same conceptual information but hides some details about the concepts, that is, each level is a refinement of the information at a higher level.

Leveson, Nancy G.↗

Towards Generic Parallel Programming in Computer Science Education with Kokkos

Parallel patterns, views, and spaces are promising abstractions to capture the programmer's intent as well as the contextual information that can be used by an underlying runtime to efficiently map software to parallel hardware. These abstractions can be valuable in cases where an algorithm must accommodate requirements of code and performance portability across hardware architectures and vendor programming models. Kokkos is a parallel programming model for host- and accelerator architectures that relies on these abstractions and targets these requirements. It consists of a pure C++ interface, a specification, and a programming library. The programming library exposes patterns and types and maps them to an underlying abstract machine model. The abstract machine model offers a generic view of parallel hardware. While Kokkos is gaining popularity in large-scale HPC applications at some DOE laboratories, we believe that the implemented concepts are of interest to a broader audience including academia as they may contribute to a generic, vendor, and architecture-independent education of parallel programming. In this work, we give an insight into the design considerations of this programming model and list important abstractions. Further, we document best practices obtained from giving virtual classes on Kokkos and give pointers to resources that the reader may consider valuable for a lecture on generic parallel programming for students with preexisting knowledge on this matter.

Ciesko, Jan↗

Nuclear studies with FSU Hamiltonian

You should leave 8 mm of space above the abstract and 10 mm after the abstract. The heading Abstract should be typed in bold 9-point Arial. The body of the abstract should be typed in normal 9-point Times in a single paragraph, immediately following the heading. The text should be set to 1 line spacing. The abstract should be centred across the page, indented 17 mm from the left and right page margins and justified. It should not normally exceed 200 words.

Volya, Alexander [Florida State University, Tallah↗

SharP Data Constructs: Data Constructs to Enable Data-Centric Computing

Extreme-scale applications (i.e., Big-Compute) are becoming increasingly data-intensive, i.e., producing and consuming increasingly large amounts of data. The HPC systems traditionally used for these applications are now used for Big-Data applications such as data analytics, social network analysis, machine learning, and genomics. As a consequence of these trends, the system architecture should be flexible and data-centric. This can already be witnessed in the pre-exascale systems with TBs of on-node hierarchical and heterogeneous memories, PBs of system memory, low-latency, high-throughput networks, and many threaded cores. As such, the pre-exascale systems suit the needs of both Big-Compute and Big-Data applications. Though the system architecture is flexible enough to support both Big-Compute and Big-Data, we argue there is a software gap. Particularly, we need data-centric abstractions to leverage the full potential of the system, i.e., there is a need for native support for data resilience, the ability to express data locality and affinity, mechanisms to reduce data movement, the ability to share data, and abstractions to express User's data usage and data access patterns. In this paper, we (i) show the need for taking a holistic approach towards data-centric abstractions, (ii) show how these approaches were realized in the SHARed data-structure centric Programming abstraction (SharP) library, a data-structure centric programming abstraction, and (iii) apply these approaches to a variety of applications that demonstrate its usefulness. Particularly, we apply these approaches to QMCPack and the Graph500 benchmark and demonstrate the advantages of this approach on extreme-scale systems.

Aderholdt, William Ferrol↗

ROSE LCOM Tools

This project provides a tool to compute LCOM metrics for important Ada abstraction mechanisms (e.g., packages, protected objects). It analyzes data accesses and routine calls to compute an abstract representation of an Ada package (or some other abstraction). Different LCOM metrics (1-5) are computed from the abstract representation. The project also provides support for representing the abstraction graphically (via graphviz). The LCOM tool requires an existing ROSE installation configured with the GNAT 2019 compiler.

Lamar, KennethM↗

An Algebra of Machine Learners with Applications

Machine learning (ML) methods are increasingly being applied to solve complex, data-driven problems in diverse areas, by exploiting the physical laws derived from first principles such as thermal hydraulics and the abstract laws developed recently for data and computing infrastructures. These physical and abstract laws encapsulate, typically in compact algebraic forms, the critical knowledge that complements data-driven ML models. We present a unified perspective of these laws and ML methods using an abstract algebra (A;⊕,Ⓧ), wherein the performance estimation and classification tasks are characterized by the additive ⊕ operations, and the diagnosis, reconstruction, and optimization tasks are characterized by the difference Ⓧ operations. This abstraction provides ML codes and their performance characterizations that are transferable across different areas. We describe practical applications of these abstract operations using examples of throughput profile estimation tasks in data transport infrastructures, and power-level and sensor error estimation tasks in nuclear reactor systems.

Rao, Nageswara↗

Robust fault diagnosis of physical systems in operation

Ideas are presented and demonstrated for improved robustness in diagnostic problem solving of complex physical systems in operation, or operative diagnosis. The first idea is that graceful degradation can be viewed as reasoning at higher levels of abstraction whenever the more detailed levels proved to be incomplete or inadequate. A form of abstraction is defined that applies this view to the problem of diagnosis. In this form of abstraction, named status abstraction, two levels are defined. The lower level of abstraction corresponds to the level of detail at which most current knowledge-based diagnosis systems reason. At the higher level, a graph representation is presented that describes the real-world physical system. An incremental, constructive approach to manipulating this graph representation is demonstrated that supports certain characteristics of operative diagnosis. The suitability of this constructive approach is shown for diagnosing fault propagation behavior over time, and for sometimes diagnosing systems with feedback. A way is shown to represent different semantics in the same type of graph representation to characterize different types of fault propagation behavior. An approach is demonstrated that threats these different behaviors as different fault classes, and the approach moves to other classes when previous classes fail to generate suitable hypotheses. These ideas are implemented in a computer program named Draphys (Diagnostic Reasoning About Physical Systems) and demonstrated for the domain of inflight aircraft subsystems, specifically a propulsion system (containing two turbofan systems and a fuel system) and hydraulic subsystem.

Abbott, Kathy Hamilton↗

Mass storage system reference model, Version 4

The high-level abstractions that underlie modern storage systems are identified. The information to generate the model was collected from major practitioners who have built and operated large storage facilities, and represents a distillation of the wisdom they have acquired over the years. The model provides a common terminology and set of concepts to allow existing systems to be examined and new systems to be discussed and built. It is intended that the model and the interfaces identified from it will allow and encourage vendors to develop mutually-compatible storage components that can be combined to form integrated storage systems and services. The reference model presents an abstract view of the concepts and organization of storage systems. From this abstraction will come the identification of the interfaces and modules that will be used in IEEE storage system standards. The model is not yet suitable as a standard; it does not contain implementation decisions, such as how abstract objects should be broken up into software modules or how software modules should be mapped to hosts; it does not give policy specifications, such as when files should be migrated; does not describe how the abstract objects should be used or connected; and does not refer to specific hardware components. In particular, it does not fully specify the interfaces.

Coleman, Sam↗

From the Origins of Life to Intelligence: The Emergence of Symbolic Constructs

Intelligence cannot be understood - and cannot be 'artificially recreated' - without also understanding how it fits as a phenomenon in the evolution of matter. I say 'matter' instead of 'life' because my thesis is that the distinction between matter, with its associated interactions, and life, is simply in the complexity of these interactions and in the number of 'symbolic levels' that are defined by these interactions. Most of us think of symbols only in the context of language. This is understandable, since it is at this level where it is easiest to draw a distinction between natural objects and their 'names', i.e., the different sets of 'abstract' objects that can be manipulated to produce models of the 'real' world. Of course sets of abstract objects can also acquire names and be manipulated at higher and higher conceptual levels. When we use the words 'philosophy' or 'the Declaration of Independence' we use abstract constructs that will only make sense in other specific abstract contexts. Additional information is contained in the original extended abstract.

Colombano, Silvano P.↗

Reactions of SiCl2 and SiHCl with H and Cl Atoms

Calculations have been carried out for the reaction of SiCl2 and SiHCl with H and Cl atoms. In each case, the stationary point geometries and harmonic frequencies were characterized using CASSCF/derivative methods and the cc-pVDZ basis set. Accurate energetics were obtained by combining the CCSD(T) results using the a-cc-pVTZ basis set with an extrapolation to the basis set limit using the a-cc-pVDZ, a-cc-pVTZ, and a-cc-pVQZ basis sets at the MP2 level. The geometries, energetics, and harmonic frequencies were used to obtain rate constants using conventional transition state theory or a Gorin-like model. In each case we find direct abstraction pathways compete with an addition elimination pathway. In the case of SiClH + H the two direct pathways are H abstraction which is barrierless and Cl abstraction with a barrier of 13.5 kcal/mol, while the addition elimination process has a barrier of 26.9 kcal/mol. In the case of SiCl2 + H the direct pathway is Cl abstraction with a barrier of 16.4 kcal/mol, while the addition elimination pathway has a barrier of 29.6 kcal/mol. In the case of SiClH + Cl the direct pathway is H abstraction which is barrierless and the addition elimination pathway has a barrier of 2.0 kcal/mol.

Walch, Stephen P.↗

Microbeam Investigations of Presolar and Early Solar System Materials

This grant provided three years of funding to initiate an independent research program in Cosmochemistry at Arizona State University. Because the new equipment that was installed at ASU took longer than expected to get running, the project was extended for a fourth year with no additional funding. By the time the funds were expended, we had set up an entirely new ion microprobe laboratory at ASU, and we have been fully operational for over two years. This laboratory was funded in almost equal parts by NASA, NSF, and ASU. Papers describing the first results from this new laboratory are being published now, and the results have been making an impact on the Cosmochemistry community. While this laboratory was being built, I continued my research program in collaboration with G. J. Wasserburg at Caltech. As equipment became available, I gradually shifted my research to ASU. Over the lifetime of this grant, my research program resulted in 12 papers and 13 abstracts on topics ranging from presolar grains (2 papers, 3 abstracts), short-lived radionuclides (6 papers, 6 abstracts), chemical compositions of chondritic materials (3 papers, 3 abstracts), silicon isotopic fractionation (1 abstract), and the oxygen composition of the Sun (1 paper). The most important results of this period were the discovery of presolar hibonite in a meteorite residue, the measurement of 26A1 in CAIs from enstatite chondrites, and the measurements of 10Be in type A CAIs from CV chondrites. All of these results have had a significant impact on research in Cosmochemstry.

Huss, Gary R.↗

The NASA ADS: Searching, Linking and More

The NASA ADS Abstract Service is a NASA-funded project which provides FREE World Wide Web abstract search services. We currently have over 3.6 million references in four databases: 1) Astronomy and Planetary Sciences; 2) Physics and Geophysics; 3) Space Instrumentation; and 4) Astronomy Preprints. Our eleven mirror sites in France, Germany, Japan, Chile, Great Britain, India, Russia, Brazil, Argentina, Korea and China help to provide better global access. Each database contains abstracts from hundreds of journals, publications, colloquia, symposia, proceedings, PhD Theses, and NASA reports. All abstracts can be searched by author, title, or abstract text words.

Thompson, D. M.↗

Impact of Water Withdrawals from Groundwater and Surface Water on Continental Water Storage Variations

Humans have strongly impacted the global water cycle, not only water flows but also water storage. We have performed a first global-scale analysis of the impact of water withdrawals on water storage variations, using the global water resources and use model WaterGAP. This required estimation of fractions of total water withdrawals from groundwater, considering five water use sectors. According to our assessment, the source of 35% of the water withdrawn worldwide (4300 cubic km/yr during 1998-2002) is groundwater. Groundwater contributes 42%, 36% and 27% of water used for irrigation, households and manufacturing, respectively, while we assume that only surface water is used for livestock and for cooling of thermal power plants. Consumptive water use was 1400 cubic km/yr during 1998-2002. It is the sum of the net abstraction of 250 cubic km/yr of groundwater (taking into account evapotranspiration and return flows of withdrawn surface water and groundwater) and the net abstraction of 1150 km3/yr of surface water. Computed net abstractions indicate, for the first time at the global scale, where and when human water withdrawals decrease or increase groundwater or surface water storage. In regions with extensive surface water irrigation, such as Southern China, net abstractions from groundwater are negative, i.e. groundwater is recharged by irrigation. The opposite is true for areas dominated by groundwater irrigation, such as in the High Plains aquifer of the central USA, where net abstraction of surface water is negative because return flow of withdrawn groundwater recharges the surface water compartments. In intensively irrigated areas, the amplitude of seasonal total water storage variations is generally increased due to human water use; however, in some areas, it is decreased. For the High Plains aquifer and the whole Mississippi basin, modeled groundwater and total water storage variations were compared with estimates of groundwater storage variations based on groundwater table observations, and with estimates of total water storage variations from the GRACE satellites mission. Due to the difficulty in estimating area-averaged seasonal groundwater storage variations from point observations of groundwater levels, it is uncertain whether WaterGAP underestimates actual variations or not. We conclude that WaterGAP possibly overestimates water withdrawals in the High Plains aquifer where impact of human water use on water storage is readily discernible based on WaterGAP calculations and groundwater observations. No final conclusion can be drawn regarding the possibility of monitoring water withdrawals in the High Plains aquifer using GRACE. For the less intensively irrigated Mississippi basin, observed and modeled seasonal groundwater storage reveals a discernible impact of water withdrawals in the basin, but this is not the case for total water storage such that water withdrawals at the scale of the whole Mississippi basin cannot be monitored by GRACE.

Doell, Petra↗

Regression Verification Using Impact Summaries

Regression verification techniques are used to prove equivalence of syntactically similar programs. Checking equivalence of large programs, however, can be computationally expensive. Existing regression verification techniques rely on abstraction and decomposition techniques to reduce the computational effort of checking equivalence of the entire program. These techniques are sound but not complete. In this work, we propose a novel approach to improve scalability of regression verification by classifying the program behaviors generated during symbolic execution as either impacted or unimpacted. Our technique uses a combination of static analysis and symbolic execution to generate summaries of impacted program behaviors. The impact summaries are then checked for equivalence using an o-the-shelf decision procedure. We prove that our approach is both sound and complete for sequential programs, with respect to the depth bound of symbolic execution. Our evaluation on a set of sequential C artifacts shows that reducing the size of the summaries can help reduce the cost of software equivalence checking. Various reduction, abstraction, and compositional techniques have been developed to help scale software verification techniques to industrial-sized systems. Although such techniques have greatly increased the size and complexity of systems that can be checked, analysis of large software systems remains costly. Regression analysis techniques, e.g., regression testing [16], regression model checking [22], and regression verification [19], restrict the scope of the analysis by leveraging the differences between program versions. These techniques are based on the idea that if code is checked early in development, then subsequent versions can be checked against a prior (checked) version, leveraging the results of the previous analysis to reduce analysis cost of the current version. Regression verification addresses the problem of proving equivalence of closely related program versions [19]. These techniques compare two programs with a large degree of syntactic similarity to prove that portions of one program version are equivalent to the other. Regression verification can be used for guaranteeing backward compatibility, and for showing behavioral equivalence in programs with syntactic differences, e.g., when a program is refactored to improve its performance, maintainability, or readability. Existing regression verification techniques leverage similarities between program versions by using abstraction and decomposition techniques to improve scalability of the analysis [10, 12, 19]. The abstractions and decomposition in the these techniques, e.g., summaries of unchanged code [12] or semantically equivalent methods [19], compute an over-approximation of the program behaviors. The equivalence checking results of these techniques are sound but not complete-they may characterize programs as not functionally equivalent when, in fact, they are equivalent. In this work we describe a novel approach that leverages the impact of the differences between two programs for scaling regression verification. We partition program behaviors of each version into (a) behaviors impacted by the changes and (b) behaviors not impacted (unimpacted) by the changes. Only the impacted program behaviors are used during equivalence checking. We then prove that checking equivalence of the impacted program behaviors is equivalent to checking equivalence of all program behaviors for a given depth bound. In this work we use symbolic execution to generate the program behaviors and leverage control- and data-dependence information to facilitate the partitioning of program behaviors. The impacted program behaviors are termed as impact summaries. The dependence analyses that facilitate the generation of the impact summaries, we believe, could be used in conjunction with other abstraction and decomposition based approaches, [10, 12], as a complementary reduction technique. An evaluation of our regression verification technique shows that our approach is capable of leveraging similarities between program versions to reduce the size of the queries and the time required to check for logical equivalence. The main contributions of this work are: - A regression verification technique to generate impact summaries that can be checked for functional equivalence using an off-the-shelf decision procedure. - A proof that our approach is sound and complete with respect to the depth bound of symbolic execution. - An implementation of our technique using the LLVMcompiler infrastructure, the klee Symbolic Virtual Machine [4], and a variety of Satisfiability Modulo Theory (SMT) solvers, e.g., STP [7] and Z3 [6]. - An empirical evaluation on a set of C artifacts which shows that the use of impact summaries can reduce the cost of regression verification.

Backes, John↗

Apparatuses and Methods for Producing Runtime Architectures of Computer Program Modules

Apparatuses and methods for producing run-time architectures of computer program modules. One embodiment includes creating an abstract graph from the computer program module and from containment information corresponding to the computer program module, wherein the abstract graph has nodes including types and objects, and wherein the abstract graph relates an object to a type, and wherein for a specific object the abstract graph relates the specific object to a type containing the specific object; and creating a runtime graph from the abstract graph, wherein the runtime graph is a representation of the true runtime object graph, wherein the runtime graph represents containment information such that, for a specific object, the runtime graph relates the specific object to another object that contains the specific object.

Abi-Antoun, Marwan Elia↗

Information processing systems, reasoning modules, and reasoning system design methods

Information processing systems, reasoning modules, and reasoning system design methods are described. According to one aspect, an information processing system includes working memory comprising a semantic graph which comprises a plurality of abstractions, wherein the abstractions individually include an individual which is defined according to an ontology and a reasoning system comprising a plurality of reasoning modules which are configured to process different abstractions of the semantic graph, wherein a first of the reasoning modules is configured to process a plurality of abstractions which include individuals of a first classification type of the ontology and a second of the reasoning modules is configured to process a plurality of abstractions which include individuals of a second classification type of the ontology, wherein the first and second classification types are different.

97 MATHEMATICS AND COMPUTING↗

Information processing systems, reasoning modules, and reasoning system design methods

Information processing systems, reasoning modules, and reasoning system design methods are described. According to one aspect, an information processing system includes working memory comprising a semantic graph which comprises a plurality of abstractions, wherein the abstractions individually include an individual which is defined according to an ontology and a reasoning system comprising a plurality of reasoning modules which are configured to process different abstractions of the semantic graph, wherein a first of the reasoning modules is configured to process a plurality of abstractions which include individuals of a first classification type of the ontology and a second of the reasoning modules is configured to process a plurality of abstractions which include individuals of a second classification type of the ontology, wherein the first and second classification types are different.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗