Search NASA⌕ Search

SEARCH · Search NASA

Results for “Checking”

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,225 records · Page 68

Stochastic Verification by Analysis for Autonomous Systems Management Architecture (ASMA)

The Gateway Vehicle Systems Manager (VSM) is the top-level of a distributed, hierarchical software control system. VSM is data-driven and will make decisions related to mission, fault, resource management and vehicle control. These attributes combined with a high degree of autonomy make it susceptible to emergent behavior. In order to achieve the high level of confidence needed in this critical system, the VSM team has developed a multifaceted verification strategy employing traditional verification techniques, simulation, model checking, and runtime verification. Individual algorithms are verified using conventional testing and model checking using assume-guarantee contracts. A discrete event-based simulation approach is being developed to verify timelines. This presentation describes an enhancement to the verification approach using analysis to enhance system robustness by detecting and resolving the potential for emergent behavior. The verification by analysis employs a Software in the Loop (SITL) environment with real flight software executing on emulated processors, simulations of vehicle subsystems, flight dynamics, and human inputs. Since the possible input space and configuration data set are too large for exhaustive testing, a Monte Carlo approach is used to cover feasible scenarios, augmented with corner cases and known higher-risk scenarios. A key problem in using Monte Carlo-based system verification is evaluating test results to ensure that system behavior is correct. The presentation describes the approach the VSM team uses to monitor behavior for compliance with predetermined boundaries and to identify anomalous behavior for further analysis. This presentation describes the multi-level systems approach to verification, and the simulation-based layer that covers the feasible state space: 1. Overview of the Gateway VSM 2. Special challenges due to heterogeneous, hierarchical architecture 3. Modeling and simulation environment using flight software and system simulations 4. Developing input sets to ensure state-space coverage 5. Developing model and data configuration sets to ensure model coverage 6. Interpreting results without predetermined outcomes 7. Lessons learned and future work

Verification and Validation↗

Discrete Event Simulation-Based Timeline Validation Using R2U2

The Gateway Vehicle Systems Manager (VSM), the top-level software control system in a distributed, hierarchical Autonomous System Management Architecture is, like most modern spacecraft software control systems, heavily data-driven. For example, schedules (timelines) will be developed on the ground and, due to the high degree of autonomy, contain complex procedures involving conditional branching, variable timing, and resource contention resolution. In order to verify that an uploaded timeline will function correctly, it is necessary to explore the feasible set of possible executions. While it is possible to test a timeline using a mission simulation, the complexity of the system and duration of a timeline limits the number of trials and therefore the test coverage. To address this problem, the VSM team is using a discrete event system model that can rapidly generate from a timeline sets of event sequences using Monte Carlo techniques. To achieve rapid and trustworthy checking of the event sequences, we use an offline version of the runtime model checking tool R2U2. This presentation describes the approach the VSM team is using to implement the discrete event simulation and evaluate event sequences using R2U2. The presentation will discuss: 1. Description of the timelines by VSM in the context of VSM operations 2. Expansion of a timeline into a sequence of atomic events 3. Adjustment, in the Monte Carlo environment, of an event sequence to account for uncertainty, external events, and failures 4. Definition of R2U2 input and mission-time linear temporal logic files 5. Generation and use of R2U2 verdict sequences 6. Lessons learned and future work

Verification↗

KMT-2021-BLG-1150Lb: Microlensing Planet Detected Through a Densely Covered Planetary-Caustic Signal

Aims. Recently, there have been reports of various types of degeneracies in the interpretation of planetary signals induced by planetary caustics. In this work we check whether such degeneracies persist in the case of well-covered signals by analyzing the lensing event KMT-2021-BLG-1150, the light curve of which exhibits a densely and continuously covered short-term anomaly. Methods. In order to identify degenerate solutions, we thoroughly investigated the parameter space by conducting dense grid searches for the lensing parameters. We then checked the severity of the degeneracy among the identified solutions. Results. We identify a pair of planetary solutions resulting from the well-known inner-outer degeneracy, and find that interpreting the anomaly is not subject to any degeneracy other than the inner-outer degeneracy. The measured parameters of the planet separation (normalized to the Einstein radius) and mass ratio between the lens components are ( s , q ) in ∼ (1.297, 1.10 × 10 −3 ) for the inner solution and ( s , q ) out ∼ (1.242, 1.15 × 10 −3 ) for the outer solution. According to a Bayesian estimation, the lens is a planetary system consisting of a planet with a mass M p = 0.88 +0.38 −0.36 M J and its host with a mass M h = 0.73 +0.32 −0.30 M ⊙ lying toward the Galactic center at a distance D L = 3.8 +1.3 −1.2 kpc. By conducting analyses using mock data sets prepared to mimic those obtained with data gaps and under various observational cadences, we find that gaps in data can result in various degenerate solutions, while the observational cadence does not pose a serious degeneracy problem as long as the anomaly feature can be delineated.

Gravitational microlensing↗

Instrument tests with the new Leica AT401

In order to evaluate the performance of the Leica Absolute Tracker AT401 we devised a series of tests. The first was to compare the Laser Tracker distance measurements to our interferometer on a 30 m long horizontal bench. The second was a check of the horizontal angle measurement accuracy and the 'level to gravity' feature. The third was to check the warm up behaviour and the instrument stability. All these tests were performed in our underground test facility at sector 10 of the SLAC linac. The air-conditioning was turned off for the duration of the measurements. The temperature in the test facility was stable to 0.1 deg C. As a test that is closer to a real world application we performed part of a simplified version of the ISO 10360-10 test in one of the experimental halls at SLAC. The instrument tested was running firmware version 1.0.373.0.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Method and computer product to increase accuracy of time-based software verification for sensor networks

A recursive verification protocol to reduce the time variance due to delays in the network by putting the subject node at most one hop from the verifier node provides for an efficient manner to test wireless sensor nodes. Since the software signatures are time based, recursive testing will give a much cleaner signal for positive verification of the software running on any one node in the sensor network. In this protocol, the main verifier checks its neighbor, who in turn checks its neighbor, and continuing this process until all nodes have been verified. This ensures minimum time delays for the software verification. Should a node fail the test, the software verification downstream is halted until an alternative path (one not including the failed node) is found. Utilizing techniques well known in the art, having a node tested twice, or not at all, can be avoided.

97 MATHEMATICS AND COMPUTING↗

Assigning unique identification numbers to new user accounts and groups in a computing environment with multiple registries

A method, system, and program storage device for creating a new user account or user group with a unique identification number in a computing environment having multiple user registries is provided. In response to receiving a command to create a new user account or user group, an operating system of a clustered computing environment automatically checks multiple registries configured for the operating system to determine whether a candidate identification number for the new user account or user group has been assigned already to one or more existing user accounts or groups, respectively. The operating system automatically assigns the candidate identification number to the new user account or user group created in a target user registry if the checking indicates that the candidate identification number has not been assigned already to any of the existing user accounts or user groups, respectively.

DeRobertis, Christopher V↗

Scheduling error correction operations for a quantum computer.

In a (future) quantum computer a single logical quantum bit (qubit) will be made of multiple physical qubits. These extra physical qubits implement mandatory extensive error checking. The efficiency of error correction will fundamentally influence the performance of a future quantum computer, both in latency/speed and in error threshold (the worst error tolerated for an individual gate). Executing this quantum error correction requires scheduling the individual operations subject to architectural constraints. Since our last talk on this subject, a team of researchers at Sandia National Labortories has designed a logical qubit architecture that considers all relevant architectural issues including layout, the effects of supporting classical electronics, and the types of gates that the underlying physical qubit implementation supports most naturally. This is a two-dimensional system where 2-qubit operations occur locally, so there is no need to calculate more complex qubit/information transportation. Using integer programming, we found a schedule of qubit operations that obeys the hardware constraints, implements the local-check code in the native gate set, and minimizes qubit idle periods. Even with an optimal schedule, however, parallel Monte Carlo simulation shows that there is no finite error probability for the native gates such that the error-correction system would be benecial. However, by adding dynamic decoupling, a series of timed pulses that can reverse some errors, we found that there may be a threshold. Thus finding optimal schedules for increasingly-refined scheduling problems has proven critical for the overall design of the logical qubit system. We describe the evolving scheduling problems and the ideas behind the integer programming-based solution methods. This talk assumes no prior knowledge of quantum computing.

99 GENERAL AND MISCELLANEOUS↗

Engineered plant biomass feedstock particles

A new class of plant biomass feedstock particles characterized by consistent piece size and shape uniformity, high skeletal surface area, and good flow properties. The particles of plant biomass material having fibers aligned in a grain are characterized by a length dimension (L) aligned substantially parallel to the grain and defining a substantially uniform distance along the grain, a width dimension (W) normal to L and aligned cross grain, and a height dimension (H) normal to W and L. In particular, the L.times.H dimensions define a pair of substantially parallel side surfaces characterized by substantially intact longitudinally arrayed fibers, the W.times.H dimensions define a pair of substantially parallel end surfaces characterized by crosscut fibers and end checking between fibers, and the L.times.W dimensions define a pair of substantially parallel top and bottom surfaces. The L.times.W surfaces of particles with L/H dimension ratios of 4:1 or less are further elaborated by surface checking between longitudinally arrayed fibers. The length dimension L is preferably aligned within 30.degree. parallel to the grain, and more preferably within 10.degree. parallel to the grain. The plant biomass material is preferably selected from among wood, agricultural crop residues, plantation grasses, hemp, bagasse, and bamboo.

59 BASIC BIOLOGICAL SCIENCES↗

Linear Collider Test Facility: Twiss Parameter Analysis at the IP/Post-IP Location of the ATF2 Beam Line

At the first stage of the ATF2 beam tuning, vertical beam size is usually bigger than 3 {micro}m at the IP. Beam waist measurements using wire scanners and a laser wire are usually performed to check the initial matching of the beam through to the IP. These measurements are described in this paper for the optics currently used ({beta}{sub x} = 4cm and {beta}{sub y} = 1mm). Software implemented in the control room to automate these measurements with integrated analysis is also described. Measurements showed that {beta} functions and emittances were within errors of measurements when no rematching and coupling corrections were done. However, it was observed that the waist in the horizontal (X) and vertical (Y) plane was abnormally shifted and simulations were performed to try to understand these shifts. They also showed that multiknobs are needed in the current optics to correct simultaneously {alpha}{sub x}, {alpha}{sub y} and the horizontal dispersion (D{sub x}). Such multiknobs were found and their linearity and orthogonality were successfully checked using MAD optics code. The software for these multiknobs was implemented in the control room and waist scan measurements using the {alpha}{sub y} knob were successfully performed.

43 PARTICLE ACCELERATORS↗

Reader set encoding for directory of shared cache memory in multiprocessor system

In a parallel processing system with speculative execution, conflict checking occurs in a directory lookup of a cache memory that is shared by all processors. In each case, the same physical memory address will map to the same set of that cache, no matter which processor originated that access. The directory includes a dynamic reader set encoding, indicating what speculative threads have read a particular line. This reader set encoding is used in conflict checking. A bitset encoding is used to specify particular threads that have read the line.

97 MATHEMATICS AND COMPUTING↗

AUTOMATED, HIGHLY ACCURATE VERIFICATION OF RELAP5-3D

Computer programs that analyze light water reactor safety solve complex systems of governing, closure and special process equations to model the underlying physics. In addition, these programs incorporate many other features and are quite large. RELAP5-3D[1] has over 300,000 lines of coding for physics, input, output, data management, user-interaction, and post-processing. For software quality assurance, the code must be verified and validated before being released to users. Verification ensures that a program is built right by checking that it meets its design specifications. Recently, there has been an increased importance on the development of automated verification processes that compare coding against its documented algorithms and equations and compares its calculations against analytical solutions and the method of manufactured solutions[2]. For the first time, the ability exists to ensure that the data transfer operations associated with timestep advancement/repeating and writing/reading a solution to a file have no unintended consequences. To ensure that the code performs as intended over its extensive list of applications, an automated and highly accurate verification method has been modified and applied to RELAP5-3D. Furthermore, mathematical analysis of the adequacy of the checks used in the comparisons is provided.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Scheduler for multiprocessor system switch with selective pairing

System, method and computer program product for scheduling threads in a multiprocessing system with selective pairing of processor cores for increased processing reliability. A selective pairing facility is provided that selectively connects, i.e., pairs, multiple microprocessor or processor cores to provide one highly reliable thread (or thread group). The method configures the selective pairing facility to use checking provide one highly reliable thread for high-reliability and allocate threads to corresponding processor cores indicating need for hardware checking. The method configures the selective pairing facility to provide multiple independent cores and allocate threads to corresponding processor cores indicating inherent resilience.

97 MATHEMATICS AND COMPUTING↗

Hyperion

The Hyperion system was designed to "look inside" an executable program and determine software's function or "behavior" without the use of the software's source code. Hyperion accomplishes this by generating associated program behaviors and the complete set of conditions under which they occur. These behaviors can be automatically checked for known malicious signatures and inspected by domain experts to assure correct operation and the absence of malicious content. Hyperion can also be used to check a program's security properties and to optimize a program.

Prowell, Stacy↗

Cache as point of coherence in multiprocessor system

In a multiprocessor system, a conflict checking mechanism is implemented in the L2 cache memory. Different versions of speculative writes are maintained in different ways of the cache. A record of speculative writes is maintained in the cache directory. Conflict checking occurs as part of directory lookup. Speculative versions that do not conflict are aggregated into an aggregated version in a different way of the cache. Speculative memory access requests do not go to main memory.

97 MATHEMATICS AND COMPUTING↗

Towards a Semantically-Enabled Control Strategy for Building Simulations: Integration of Semantic Technologies and Model Predictive Control

State-of-the-art building simulation control methods incorporate physical constraints into their mathematical models, but omit implicit constraints associated with policies of operation and dependency relationships among rules representing those constraints. To overcome these shortcomings, there is a recent trend in enabling the control strategies with inference-based rule checking capabilities. One solution is to exploit semantic web technologies in building simulation control. Such approaches provide the tools for semantic modeling of domains, and the ability to deduce new information based on the models through use of Description Logic (DL). In a step toward enabling this capability, this paper presents a cross-disciplinary data-driven control strategy for building energy management simulation that integrates semantic modeling and formal rule checking mechanisms into a Model Predictive Control (MPC) formulation. The results show that MPC provides superior levels of performance when initial conditions and inputs are derived from inference-based rules.

Delgoshaei, Parastoo↗

Measurement of the Medium Energy Flux at MINER$\nu$A Using the High-$\nu$ Method

aA precise understanding of the flux is a critical input to the cross section measurements made by MINER$\nu$A. Multiple \textit{in situ} measurements are utilized to constrain and cross-check the \textit{a priori} flux prediction, including a measurement of the flux using the low-$\nu$ method. This poster introduces a new technique which is complementary to the low-$\nu$ method, using interactions at high hadronic recoil energies to measure the flux of the Medium Energy data set. This is the first joint analysis of MINER$\nu$A's Low and Medium Energy data sets, and provides an independent cross check of the Medium Energy flux prediction.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PVAnalytics: A Python Package for Automated Processing of Solar Time Series Data

Multiple publicly available software packages exist that analyze solar time series data, including RdTools and Solar Data Tools, among others. Several of these packages contain their own unique quality assurance (QA) and feature recognition algorithms. The python PVAnalytics package was developed to offer an internally consistent source for these analysis tools, making it easier for the end user to deploy these routines on his or her solar data. The PVAnalytics package currently contains routines for outlier detection, inverter clipping detection, irradiance and temperature checks, orientation checks, and data shift detection, among other functions. These functions have been aggregated from various sources including Solar Forecast Arbiter, RdTools, and the QA process developed by NREL's PV Fleets Initiative. We are continuously adding new functionality to the package, including documentation, examples and algorithms. By bundling QA functionality into a single software package, we hope to make PVAnalytics a comprehensive software library to support analysis of solar metadata and time series data.

data cleaning↗

Scalable auditability of monitoring process using public ledgers

Secure auditability of monitoring processing using public ledgers that are particularly useful for monitoring surveillance orders, whereby an overseeing enforcer (“E”) checks if law enforcement agencies and companies are respectively over-requesting or over-sharing user data beyond what is permitted by the surveillance order, in a privacy-preserving way, such that E does not know the real identities of the users being surveilled, nor does E get to read the users' unencrypted data. Embodiments of the present invention also have inbuilt checks and balances to require unsealing of surveillance orders at the appropriate times, thus enabling accounting of the surveillance operation to verify that lawful procedures were followed, protecting users from government overreach, and helping law enforcement agencies and companies demonstrate that they followed the rule of law.

Panwar, Gaurav↗