Search NASA⌕ Search

SEARCH · Search NASA

Results for “functional language”

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 883 records · Page 49

Different Perspectives on Asthenia in Astronauts and Cosmonauts: International Research Literature

The Behavioral Health and Performance (BHP) Element is one of the six elements within the NASA Human Research Program (HRP) and is responsible for managing four risks: a) The Risk of Performance Decrements due to inadequate Cooperation, Coordination, Communication and Psychological Adaptation within a Team (Team), b) the Risk of Performance Errors due to Sleep Loss, Circadian De-synchronization, Fatigue and Work Overload (Sleep), c) Risk of Behavioral Conditions (BMed), and d) the Risk of Psychiatric Disorders (BMed). The aim of this report is to address some of the recommendations made by the recent NASA HRP Standing Review Panel for the Behavioral Medicine Risk of Psychiatric Disorders. Such recommendations included: a) the inclusion of important national and international literature in English and non-English language materials; including journals, books, magazines, conference reports and b) an extensive literature review of certain types of psychological states to predict, detect, and assess adverse mental states that may negatively affect the psychological well being of the astronauts, specifically asthenia. This report was a collaborative international work effort focused on the evaluation and determination of the importance of continuing research on asthenia as a possible psychological problem that might affect the optimal psychological functioning among crewmembers during long-duration space flight missions. Russian medical personnel (flight surgeons and psychologist) have observed symptoms of asthenia (weakness, increased fatigue, irritability, and attention and memory disorders) in cosmonauts after four months in space (Myasnikov& Zamaleddinov1996; Grigorieve, 1996 ) and believe that asthenia is one of the greater risks that will affect crews? optimal psychological functioning.

Sandoval, Luis↗

A floating-point/multiple-precision processor for airborne applications

A compact input output (I/O) numerical processor capable of performing floating-point, multiple precision and other arithmetic functions at execution times which are at least 100 times faster than comparable software emulation is described. The I/O device is a microcomputer system containing a 16 bit microprocessor, a numerical coprocessor with eight 80 bit registers running at a 5 MHz clock rate, 18K random access memory (RAM) and 16K electrically programmable read only memory (EPROM). The processor acts as an intelligent slave to the host computer and can be programmed in high order languages such as FORTRAN and PL/M-86.

Yee, R.↗

Advanced Design and Implementation of a Control Architecture for Long Range Autonomous Planetary Rovers

An advanced design and implementation of a Control Architecture for Long Range Autonomous Planetary Rovers is presented using a hierarchical top-down task decomposition, and the common structure of each design is presented based on feedback control theory. Graphical programming is presented as a common intuitive language for the design when a large design team is composed of managers, architecture designers, engineers, programmers, and maintenance personnel. The whole design of the control architecture consists in the classic control concepts of cyclic data processing and event-driven reaction to achieve all the reasoning and behaviors needed. For this purpose, a commercial graphical tool is presented that includes the mentioned control capabilities. Messages queues are used for inter-communication among control functions, allowing Artificial Intelligence (AI) reasoning techniques based on queue manipulation. Experimental results show a highly autonomous control system running in real time on top the JPL micro-rover Rocky 7 controlling simultaneously several robotic devices. This paper validates the sinergy between Artificial Intelligence and classic control concepts in having in advanced Control Architecture for Long Range Autonomous Planetary Rovers.

Martin-Alvarez, A.↗

A General Procedure to Formulate 3D Elements for Finite Element Applications

This paper presents a general procedure to formulate and implement 3D elements of arbitrary order in meshes with multiple element types. This procedure includes obtaining shape functions and integration quadrature and establishing an approach for checking the generated element’s compatibility with adjacent elements’ surfaces. This procedure was implemented in Matlab, using its symbolic and graphics toolbox, and complied as a GUI interface named ShapeGen3D to provide finite element users with a tool to tailor elements according to their analysis needs. ShapeGen3D also outputs files with the element formulation needed to enable users to implement the generated elements in other programming languages or through user elements in commercial finite element software. Currently, finite element (FE) users are limited to employing element formulation available in the literature, commercial software, or existing element libraries. Thus, the developed procedure implemented in ShapeGen3D offers FEM users the possibility to employ elements beyond those readily available. The procedure was tested by generating the formulation for a brick element, a brick transition element, and higher-order hexahedron and tetrahedron elements that can be used in a spectral finite element analysis. The formulation obtained for the 20-node element was in perfect agreement with the formulation available in the literature. In addition, the results showed that the interpolation condition was met for all the generated elements, which provides confidence in the implementation of the process. Researchers and educators can use this procedure to efficiently develop and illustrate three-dimensional elements.

higher-order elements↗

Inference-Engine v0.1.0

Given a pre-trained neural network, Inference-Engine performs maps network inputs to outputs by executing the forward pass through the provided network. Although the predominant programming language for machine-learning is Python, most high-performance computing (HPC) applications are written in Fortran, C, or C++. Inference-Engine aims to support HPC programs and is written in Fortran, a language with a large feature set supporting interoperability with C. This software exposes concurrency in a portable way by using standard language features that some modern Fortran compilers can exploit with various optimizations, including offloading computation to a Graphics Processing Unit (GPU). In particular, this software makes extensive use of Fortran's "do concurrent" parallel loop construct, implicitly parallel array statements, and pure procedures that can be invoked inside "do concurrent" blocks. Inference-Engine also supports dynamic choice of inference methods at runtime. Two current options include one method that uses Fortran's "dot_product" intrinsic function inside "do concurrent" blocks and another method that instead uses Fortran' "matmul" array intrinsic function. We plan to investigate automatic compiler offloading of "do concurrent" calculations to GPUs and compile-time substitution of optimized libraries such as the Basic Linear Algebra Library (BLAS) for "matmul" invocations. We also envision the potential for the choice of which method to use could happen at program launch based on in situ performance measurements on any given platform.

Rouson, Damian↗

Language and Program for Documenting Software Design

Software Design and Documentation Language (SDDL) provides effective communication medium to support design and documentation of complex software applications. SDDL supports communication among all members of software design team and provides for production of informative documentation on design effort. Use of SDDL-generated document to analyze design makes it possible to eliminate many errors not detected until coding and testing attempted. SDDL processor program translates designer's creative thinking into effective document for communication. Processor performs as many automatic functions as possible, freeing designer's energy for creative effort. SDDL processor program written in PASCAL.

Kleine, H.↗

Head-Strictness is Not a Monotonic Abstract Property

A property P of a language is said to be definable by abstract interpretation if there is a monotonic map abs from the domain of standard semantics to an abstract domain A of finite height, and a partition of the abstract domain into two parts A(sub p) and A(sub non p), such that any value has property P if and only if abs maps it to an element of A(sub p). Head-strictness is a property of functions over lists which asserts, roughly speaking, that whenever the function looks at the tail of a list, it looks at the head of the tail. We prove that head-strictness is not definable by abstract interpretation. We then present a non-monotonic abstract interpretation for head-strictness and prove its safety.

Kamin, Samuel↗

"Interactive Classification Technology"

The investigators are upgrading a knowledge representation language called SL (Symbolic Language) and an automated reasoning system called SMS (Symbolic Manipulation System) to enable the technologies to be used in automated reasoning and interactive classification systems. The overall goals of the project are: a) the enhancement of the representation language SL to accommodate multiple perspectives and a wider range of meaning; b) the development of a sufficient set of operators to enable the interpreter of SL to handle representations of basic cognitive acts; and c) the development of a default inference scheme to operate over SL notation as it is encoded. As to particular goals the first-year work plan focused on inferencing and.representation issues, including: 1) the development of higher level cognitive/ classification functions and conceptual models for use in inferencing and decision making; 2) the specification of a more detailed scheme of defaults and the enrichment of SL notation to accommodate the scheme; and 3) the adoption of additional perspectives for inferencing.

deBessonet, Cary↗

GIScience in the era of Artificial Intelligence: a research agenda towards Autonomous GIS

The advent of generative AI exemplified by large language models (LLMs) opens new ways to represent and compute geographic information and transcends the process of geographic knowledge production, driving geographic information systems (GIS) towards autonomous GIS. Leveraging LLMs as the decision core, autonomous GIS can independently generate and execute geoprocessing workflows to perform spatial analysis. In this vision paper, we further elaborate on the concept of autonomous GIS and present a conceptual framework that defines its five autonomous goals, five levels of autonomy, five core functions, and three operational scales. We demonstrate how autonomous GIS could perform geospatial data retrieval, spatial analysis, and map making with four proof-of-concept GIS agents. We conclude by identifying critical challenges and future research directions, including fine-tuning and self-growing decision-cores, autonomous modelling, and examining the societal and practical implications of autonomous GIS. By establishing the groundwork for a paradigm shift in GIScience, this paper envisions a future where GIS moves beyond traditional workflows to autonomously reason, derive, innovate, and advance geospatial solutions to pressing global challenges. Meanwhile, we emphasize that as we design and deploy increasingly intelligent geospatial systems, we carry a responsibility to ensure they are developed in socially responsible ways, serve the public good, and support the continued value of human geographic insight in an AI-augmented future.

Autonomous GI↗

The Artificial Intelligence Ontology: LLM-Assisted Construction of AI Concept Hierarchies

The Artificial Intelligence Ontology (AIO) is a systematization of artificial intelligence (AI) concepts, methodologies, and their interrelations. Developed via manual curation, with the additional assistance of large language models (LLMs), AIO aims to address the rapidly evolving landscape of AI by providing a comprehensive framework that encompasses both technical and ethical aspects of AI technologies. The primary audience for AIO includes AI researchers, developers, and educators seeking standardized terminology and concepts within the AI domain. We use the term “branches” for classes, and their subclasses, in our ontology that are subclasses of owl:Thing. AIO contains eight branches: Bias, Layer, Machine Learning Task, Mathematical Function, Model, Network, Preprocessing, and Training Strategy, each designed to support the modular composition of AI methods and facilitate a deeper understanding of deep learning architectures and ethical considerations in AI. AIO uses the Ontology Development Kit (ODK) for its creation and maintenance, with its content being more easily updated through AI-driven curation support. This approach not only ensures the ontology's relevance amidst the fast-paced advancements in AI but also significantly enhances its utility for researchers, developers, and educators by simplifying the integration of new AI concepts and methodologies. The ontology's utility is demonstrated through the annotation of AI methods data in a catalog of AI research publications and the integration into the BioPortal ontology resource, highlighting its potential for cross-disciplinary research. The AIO ontology is open source and is available on GitHub ( https://w3id.org/aio/ ) and BioPortal ( https://bioportal.bioontology.org/ontologies/AIO ).

Joachimiak, Marcin P. [Biosystems Data Science Dep↗

Symbolic computation of recurrence equations for the Chebyshev series solution of linear ODE's

If a linear ordinary differential equation with polynomial coefficients is converted into integrated form then the formal substitution of a Chebyshev series leads to recurrence equations defining the Chebyshev coefficients of the solution function. An explicit formula is presented for the polynomial coefficients of the integrated form in terms of the polynomial coefficients of the differential form. The symmetries arising from multiplication and integration of Chebyshev polynomials are exploited in deriving a general recurrence equation from which can be derived all of the linear equations defining the Chebyshev coefficients. Procedures for deriving the general recurrence equation are specified in a precise algorithmic notation suitable for translation into any of the languages for symbolic computation. The method is algebraic and it can therefore be applied to differential equations containing indeterminates.

Geddes, K. O.↗

NDMAS implementation and data qualification for accident tolerant fuel experiments

In order to meet quality and regulatory requirements associated with the U.S. Department of Energy Accident Tolerant Fuels (ATF) experiments, all data and documentation associated with ATF component fabrication, characterization, traceability, testing and post irradiation examination are being managed using the Nuclear Data Management and Analysis System (NDMAS). NDMAS melds commercial off-the-shelf software to provide the full range of needed functionality. The core component of NDMAS is the SAS Enterprise Business Intelligence software, which provides data manipulation, statistical and graphical capabilities, and delivery of live content to web pages. Content delivery to both Idaho National Laboratory researchers and external users via a web interface is managed using SharePoint, which is access-controlled. Additionally, scripts, macros, and commercial wrappers may be used or written by the NDMAS team to control interfaces between SAS and the structured query language server, where much of the data reside. ATF experiment data and documentation stored in the NDMAS database may be utilized to support Nuclear Regulatory Commission licensing of ATF concepts for commercial Light Water Reactor demonstration. Therefore, Data Qualification Plans are being developed to screen and tag all document and data input for ATR water loop testing, Transient Reactor Testing (TREAT), and post irradiation examination. A project-wide document library has been created in the ATF NDMAS SharePoint Site for general unrestricted document and information access. Restricted libraries have also been created to allow individual customer access to restricted documents. Data from ATR water loop instrumented lead experimentation, TREAT, and post-irradiation examination will be available to program participants on the SharePoint site as they are collected. This offers a unique capability for team collaboration while these tests are being conducted. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

STARlight: A Monte Carlo simulation program for ultra-peripheral collisions of relativistic ions

© 2016 Elsevier B.V. Ultra-peripheral collisions (UPCs) have been a significant source of study at RHIC and the LHC. In these collisions, the two colliding nuclei interact electromagnetically, via two-photon or photonuclear interactions, but not hadronically; they effectively miss each other. Photonuclear interactions produce vector meson states or more general photonuclear final states, while two-photon interactions can produce lepton or meson pairs, or single mesons. In these interactions, the collision geometry plays a major role. We present a program, STARlight, that calculates the cross-sections for a variety of UPC final states and also creates, via Monte Carlo simulation, events for use in determining detector efficiency. Program summary Program Title: STARlight (v2.2) Program Files doi: http://dx.doi.org/10.17632/xjpf4rxtbj.1 Licensing provisions: GNU GPLv3 Programming Language: C++ External Routines: PYTHIA 8.2 and DPMJET 3.0 are needed for some final states. Nature of problem: The cross-section for ultra-peripheral collisions is obtained by integrating the photon fluxes in transverse impact parameter space, subject to the requirement (which is also impact parameter dependent) that the colliding nuclei do not interact hadronically. The program is a two step process. First, it calculates the cross-sections for the reaction of interest, as a function of W (photon–Pomeron or two-photon center of mass energy), Y (final state rapidity) and pT (final state transverse momentum). Second, STARlight generates Monte Carlo events which can be used to determine cross-sections within specific kinematic constraints or for studies of detector efficiencies. The second step includes the decay of any unstable particles produced in the reaction, with appropriate consideration of particle spins and parity. It outputs these events in ASCII format. Solution method: The program generates a two dimensional look-up table of the production cross-section as a function of final state rapidity and mass. The dimensions of the table are selectable, allowing the user to choose the desired accuracy. For certain final states, a second two-dimensional look-up table, giving the transverse momentum distribution, as a function of rapidity, is also used. With these look-up tables, the program generates final states. Particle decays and the final angular distributions are calculated for each event. Restrictions: The program is focused on ultra-relativistic collisions at Brookhaven's RHIC (Relativistic Heavy Ion Collider) and CERN's LHC (Large Hadron Collider), with final states that are visible in a central detector. At lower energies (i.e., at the CERN SPS), caution should be exercised because STARlight does not account for the longitudinal momentum transfer to the nucleus; this is larger at low beam energies. References: http://starlight.hepforge.org and references in this article.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Total Cost of Vehicle Ownership - Development of Analysis Webtool and Visualization

This report has been created to give an in-depth walkthrough of the functionality of the Total Cost of Operation webtool. The webtool was created to give users the ability to calculate the total cost of owning a vehicle over from the year they bought the vehicle to the end of the vehicles lifetime. This tool was developed using a combination of front-end and back-end technologies. To create the front-end HTML, CSS, and JavaScript were utilized. On the backend PHP is used as a scripting language with a database powered by MySQL. Through a combination of these technologies, a fully featured well developed webtool was created allowing users to view a cost breakdown of vehicle ownership over the lifetime of that vehicle.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Presentation planning using an integrated knowledge base

A description is given of user interface research aimed at bringing together multiple input and output modes in a way that handles mixed mode input (commands, menus, forms, natural language), interacts with a diverse collection of underlying software utilities in a uniform way, and presents the results through a combination of output modes including natural language text, maps, charts and graphs. The system, Integrated Interfaces, derives much of its ability to interact uniformly with the user and the underlying services and to build its presentations, from the information present in a central knowledge base. This knowledge base integrates models of the application domain (Navy ships in the Pacific region, in the current demonstration version); the structure of visual displays and their graphical features; the underlying services (data bases and expert systems); and interface functions. The emphasis is on a presentation planner that uses the knowledge base to produce multi-modal output. There has been a flurry of recent work in user interface management systems. (Several recent examples are listed in the references). Existing work is characterized by an attempt to relieve the software designer of the burden of handcrafting an interface for each application. The work has generally focused on intelligently handling input. This paper deals with the other end of the pipeline - presentations.

Arens, Yigal↗

Locating Anomalies in Complex Data Sets Using Visualization and Simulation

The research goals are to create a simulation framework that can accept any combination of models written at the gate or behavioral level. The framework provides the ability to fault simulate and create scenarios of experiments using concurrent simulation. In order to meet these goals we have had to fulfill the following requirements. The ability to accept models written in VHDL, Verilog or the C languages. The ability to propagate faults through any model type. The ability to create experiment scenarios efficiently without generating every possible combination of variables. The ability to accept adversity of fault models beyond the single stuck-at model. Major development has been done to develop a parser that can accept models written in various languages. This work has generated considerable attention from other universities and industry for its flexibility and usefulness. The parser uses LEXX and YACC to parse Verilog and C. We have also utilized our industrial partnership with Alternative System's Inc. to import vhdl into our simulator. For multilevel simulation, we needed to modify the simulator architecture to accept models that contained multiple outputs. This enabled us to accept behavioral components. The next major accomplishment was the addition of "functional fault models". Functional fault models change the behavior of a gate or model. For example, a bridging fault can make an OR gate behave like an AND gate. This has applications beyond fault simulation. This modeling flexibility will make the simulator more useful for doing verification and model comparison. For instance, two or more versions of an ALU can be comparatively simulated in a single execution. The results will show where and how the models differed so that the performance and correctness of the models may be evaluated. A considerable amount of time has been dedicated to validating the simulator performance on larger models provided by industry and other universities.

Panetta, Karen↗

Heterotic backgrounds via generalised geometry: moment maps and moduli

We describe the geometry of generic heterotic backgrounds preserving minimal supersymmetry in four dimensions using the language of generalised geometry. They are characterised by an SU(3) × Spin(6 + n) structure within O(6, 6 + n) x $\mathbb{R}$ + generalised geometry. Supersymmetry of the background is encoded in the existence of an involutive subbundle of the generalised tangent bundle and the vanishing of a moment map for the action of diffeomorphisms and gauge symmetries. We give both the superpotential and the Kähler potential for a generic background, showing that the latter defines a natural Hitchin functional for heterotic geometries. Intriguingly, this formulation suggests new connections to geometric invariant theory and an extended notion of stability. Finally we show that the analysis of infinitesimal deformations of these geometric structures naturally reproduces the known cohomologies that count the massless moduli of supersymmetric heterotic backgrounds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A symmetry principle for topological quantum order

We present a unifying framework to study physical systems which exhibit topological quantum order (TQO). The major guiding principle behind our approach is that of symmetries and entanglement. These symmetries may be actual symmetries of the Hamiltonian characterizing the system, or emergent symmetries. To this end, we introduce the concept of low-dimensional Gauge-like symmetries (GLSs), and the physical conservation laws (including topological terms, fractionalization, and the absence of quasi-particle excitations) which emerge from them. We prove then sufficient conditions for TQO at both zero and finite temperatures. The physical engine for TQO are topological defects associated with the restoration of GLSs. These defects propagate freely through the system and enforce TQO. Our results are strongest for gapped systems with continuous GLSs. At zero temperature, selection rules associated with the GLSs enable us to systematically construct general states with TQO; these selection rules do not rely on the existence of a finite gap between the ground states to all other excited states. Indices associated with these symmetries correspond to different topological sectors. All currently known examples of TQO display GLSs. Other systems exhibiting such symmetries include Hamiltonians depicting orbital-dependent spin-exchange and Jahn-Teller effects in transition metal orbital compounds, short-range frustrated Klein spin models, and p+ip superconducting arrays. The symmetry based framework discussed herein allows us to go beyond standard topological field theories and systematically engineer new physical models with finite temperature TQO (both Abelian and non-Abelian). Furthermore, we analyze the insufficiency of entanglement entropy (we introduce SU(N) Klein models on small world networks to make the argument even sharper), spectral structures, maximal string correlators, and fractionalization in establishing TQO. We show that Kitaev's Toric code model and Wen's plaquette model are equivalent and reduce, by a duality mapping, to an Ising chain, demonstrating that despite the spectral gap in these systems the toric operator expectation values may vanish once thermal fluctuations are present. This illustrates the fact that the quantum states themselves in a particular (operator language) representation encode TQO and that the duality mappings, being non-local in the original representation, disentangle the order. We present a general algorithm for the construction of long-range string and brane orders in general systems with entangled ground states; this algorithm relies on general ground states selection rules and becomes of the broadest applicability in gapped systems in arbitrary dimensions. We exactly recast some known non-local string correlators in terms of local correlation functions. We discuss relations to problems in graph theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗