Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem solving environment”

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 685 records · Page 38

Information Power Grid Posters

This document is a summary of the accomplishments of the Information Power Grid (IPG). Grids are an emerging technology that provide seamless and uniform access to the geographically dispersed, computational, data storage, networking, instruments, and software resources needed for solving large-scale scientific and engineering problems. The goal of the NASA IPG is to use NASA's remotely located computing and data system resources to build distributed systems that can address problems that are too large or complex for a single site. The accomplishments outlined in this poster presentation are: access to distributed data, IPG heterogeneous computing, integration of large-scale computing node into distributed environment, remote access to high data rate instruments,and exploratory grid environment.

Vaziri, Arsi↗

Open Collaboration: A Problem Solving Strategy That Is Redefining NASA's Innovative Spirit

In 2010, NASA?s Space Life Sciences Directorate announced the successful results from pilot experiments with open innovation methodologies. Specifically, utilization of internet based external crowd sourcing platforms to solve challenging problems in human health and performance related to the future of spaceflight. The follow-up to this success was an internal crowd sourcing pilot program entitled NASA@work, which was supported by the InnoCentive@work software platform. The objective of the NASA@work pilot was to connect the collective knowledge of individuals from all areas within the NASA organization via a private web based environment. The platform provided a venue for NASA Challenge Owners, those looking for solutions or new ideas, to pose challenges to internal solvers, those within NASA with the skill and desire to create solutions. The pilot was launched in 57 days, a record for InnoCentive and NASA, and ran for three months with a total of 20 challenges posted Agency wide. The NASA@work pilot attracted over 6000 participants throughout NASA with a total of 183 contributing solvers for the 20 challenges posted. At the time of the pilot?s closure, solvers provided viable solutions and ideas for 17 of the 20 posted challenges. The solver community provided feedback on the pilot describing it as a barrier breaking activity, conveying that there was a satisfaction associated with helping co-workers, that it was "fun" to think about problems outside normal work boundaries, and it was nice to learn what challenges others were facing across the agency. The results and the feedback from the solver community have demonstrated the power and utility of an internal collaboration tool, such as NASA@work.

Rando, Cynthia M.↗

Applications of Nd:YAG laser micromanufacturing in High Temperature Gas Reactor research

Two innovative applications of Nd:YAG laser micromachining techniques are demonstrated in this publication. Research projects to determine the fission product transport mechanisms in TRISO coated particles necessitate heat treatment studies as well as the manufacturing of a unique sealed system for experimentation at very high temperatures. This article describes firstly the design and creation of an alumina jig designed to contain 500 {mu}m diameter ZrO2 spheres intended for annealing experiments at temperatures up to 1600 C. Functional requirements of this jig are the precision positioning of spheres for laser ablation, welding and post weld heat treatment in order to ensure process repeatability and accurate indexing of individual spheres. The design challenges and the performance of the holding device are reported. Secondly the manufacture of a sealing system using laser micromachining is reported. ZrO2 micro plugs isolate the openings of micro-machined cavities to produce a gas-tight seal fit for application in a high temperature environment. The technique is described along with a discussion of the problems experienced during the sealing process. Typical problems experienced were seating dimensions and the relative small size ({approx} 200 {mu}m) of these plugs that posed handling challenges. Manufacturing processes for both the tapered seating cavity and the plug are demonstrated. In conclusion, this article demonstrates the application of Nd-YAG micromachining in an innovative way to solve practical research problems.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Integration of design information

The overall concepts of the integrated programs for aerospace-vehicle design (IPAD) from the user's viewpoint are discussed. Also a top-level view of what the user requires from such a system is provided, and the interactions between the system and user are described. The four major components discussed are design process; data storage, management and manipulation; user interface; and project management. Although an outgrowth of aerospace production experience, the basic concepts discussed, and especially their emphasis on integration, are considered applicable to all problem solving. Thus, these concepts may offer a broad base for exploitation by industry in general. This is the first in a set of three papers, the other two being Future Integrated Design Process, by D. D. Mayer, and Requirements for Company-Wide Management of Engineering Information, by J. W. Southall. In addition to tying the three together, how project management can be handled in a computing environment and also the user interface needs are discussed in detail.

Anderton, G. L.↗

Octree based automatic meshing from CSG models

Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is emphasized. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary respresentation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractors. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.

Perucchio, Renato↗

Geometrical and topological issues in octree based automatic meshing

Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is discussed. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary representation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractor. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.

Saxena, Mukul↗

Exhaustive Versus Randomized Searchers for Nonlinear Optimization in 21st Century Computing: Solar Application

We present a simple multi-dimensional exhaustive search method to obtain, in a reasonable time, the optimal solution of a nonlinear programming problem. It is more relevant in the present day non-mainframe computing scenario where an estimated 95% computing resources remains unutilized and computing speed touches petaflops. While the processor speed is doubling every 18 months, the band width is doubling every 12 months, and the hard disk space is doubling every 9 months. A randomized search algorithm or, equivalently, an evolutionary search method is often used instead of an exhaustive search algorithm. The reason is that a randomized approach is usually polynomial-time, i.e., fast while an exhaustive search method is exponential-time i.e., slow. We discuss the increasing importance of exhaustive search in optimization with the steady increase of computing power for solving many real-world problems of reasonable size. We also discuss the computational error and complexity of the search algorithm focusing on the fact that no measuring device can usually measure a quantity with an accuracy greater than 0.005%. We stress the fact that the quality of solution of the exhaustive search - a deterministic method - is better than that of randomized search. In 21 st century computing environment, exhaustive search cannot be left aside as an untouchable and it is not always exponential. We also describe a possible application of these algorithms in improving the efficiency of solar cells - a real hot topic - in the current energy crisis. These algorithms could be excellent tools in the hands of experimentalists and could save not only large amount of time needed for experiments but also could validate the theory against experimental results fast.

Sen, Syamal K.↗

Blackbird: Object-Oriented Planning, Simulation, and Sequencing Framework Used by Multiple Missions

Every JPL flight mission relies on activity planning and sequence generation software to perform operations. Most such tools in use at JPL and elsewhere use attribute-based schemas or domain-specific languages (DSLs) to define activities. This reliance poses user training, software maintenance, performance, and other challenges. To solve this problem for future missions, a new software called Blackbird was developed which allows engineers to specify behavior in standard Java. The new code base has over an order of magnitude fewer lines of code than other JPL planning software, since no DSL or schema interpreter is needed. The use of Java for defining activities also allows mission adapters to debug their code in an integrated development environment, seamlessly call external libraries, and set up truly multimission models. These efficiency gains have significantly reduced the amount of development effort required to support the software. This paper discusses Blackbird’s design, principles, and use cases.

Lawler, Christopher↗

Electromagnetics and Advanced Manufacturing Simulation Development within the MOOSE Ecosystem

The MOOSE electromagnetics module (EMM) was developed to provide a general simulation tool for modeling a wide range of problems encountered in computational electromagnetics and enable MOOSE and MOOSE-based application coupling to Maxwell's equations to solve a wide class of new problems. Development of the electromagnetics module has also enabled development of new advanced manufacturing models in the MOOSE ecosystem, including that of the electric field-assisted sintering (EFAS) process. Recent results from this effort show good agreement with experimental results, and these two capabilities will be used in future projects to develop models for novel materials development and manufacturing for extreme environments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗

From passive storage to daily waste retrieval; changing the working culture at Sellafield's pile fuel storage pond

The Pile Fuel Storage Pond (PFSP) was built in 1948/50 to treat materials from the Windscale Piles. Multiple operational regimes over the intervening 60 years have resulted in a complex inventory of spent nuclear fuels, solid and liquid intermediate level wastes. A coordinated programme of work, designed to retrieve and safely dispose of the pond contents, has been implemented to enable the decommissioning of the facility. The long period of passive storage operations which preceded the implementation of the programme meant that the operator was faced with a dual challenge of providing new technical capability and changing a working culture that was inappropriate for the dynamic environment required to successfully deliver the programme. It was recognised that the nature of the programme meant that implementing a standard manufacturing approach to operations would not be appropriate. In order to create a dynamic retrievals focussed working culture, the operator has vigorously embraced change programmes aimed at improving a number of working practices including encouraging innovation, managing integrated but flexible production schedules, and encouraging work-face problem solving. The combined impact of beginning to resolve the technical challenges and focussing on the delivery culture has resulted in the facility making a step change towards becoming fully retrievals operations focussed. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗

Paracousti-UQ: A Stochastic 3-D Acoustic Wave Propagation Algorithm.

Acoustic full waveform algorithms, such as Paracousti, provide deterministic solutions in complex, 3-D variable environments. In reality, environmental and source characteristics are often only known in a statistical sense. Thus, to fully characterize the expected sound levels within an environment, this uncertainty in environmental and source factors should be incorporated into the acoustic simulations. Performing Monte Carlo (MC) simulations is one method of assessing this uncertainty, but it can quickly become computationally intractable for realistic problems. An alternative method, using the technique of stochastic partial differential equations (SPDE), allows computation of the statistical properties of output signals at a fraction of the computational cost of MC. Paracousti-UQ solves the SPDE system of 3-D acoustic wave propagation equations and provides estimates of the uncertainty of the output simulated wave field (e.g., amplitudes, waveforms) based on estimated probability distributions of the input medium and source parameters. This report describes the derivation of the stochastic partial differential equations, their implementation, and comparison of Paracousti-UQ results with MC simulations using simple models.

97 MATHEMATICS AND COMPUTING↗

Proceedings of the 1998 International Computational Accelerator Physics Conference

The 1998 International Computational Accelerator Physics Conference, ICAP’98, was held September 14-18, 1998, at the Monterey Convention Center in Monterey, California. The meeting continued the tradition of four earlier Computational Accelerator Physics conferences, held in La Jolla, California (1988), Los Alamos, New Mexico (1990), Pleasanton, California (1993), and Williamsburg, Virginia (1996). ICAP’98 was organized by the Stanford Linear Accelerator Center (SLAC), Los Alamos National Laboratory (LANL), and the National Energy Research Scientific Computing Center (NERSC), and received support from the U.S. Department of Energy. The aim of this conference series is to discuss recent advances in Computational Accelerator Physics and their applications to solving important problems related to present and future accelerators. The ICAP’98 program included plenary sessions on modeling challenges in next-generation accelerators, state-of-the art methods in computational accelerator physics, and a view of what high-end computing would be like in the 21st century. There were also focused sessions on accelerator design and control, modeling high intensity beam phenomena, electromagnetic modeling, advanced algorithms, software environments and libraries, visualization and graphic interfaces, modeling advanced accelerator concepts, modeling the beam-beam interaction, computing wakefields, and combined particle/field simulations. In addition to these oral sessions there was a poster session and a vendor display. Prior to the start of the technical program, a half-day tutorial on High Performance Computing was hosted by NERSC. The ICAP series recognizes that computing and, in particular, advanced computing, is playing an increasingly important role in the successful design and development of major accelerator facilities, and in research and development leading to advances in accelerator technology. We expect that this new emphasis on high-end computing will continue in future ICAP conferences.

Ko, Kwok↗

Computational models and resource allocation for supercomputers

There are several different architectures used in supercomputers, with differing computational models. These different models present a variety of resource allocation problems that must be solved. The computational needs of a program must be cast in terms of the computational model supported by the supercomputer, and this must be done in a way that makes effective use of the machine's resources. This is the resource allocation problem. The computational models of available supercomputers and the associated resource allocation techniques are surveyed. It is shown that many problems and solutions appear repeatedly in very different computing environments. Some case studies are presented, showing concrete computational models and the allocation strategies used.

Mauney, Jon↗

Theories of glass formation and glass transition

This key-issues review is a plea for a new focus on simpler and more realistic models of glass-forming fluids. It seems to me that we have too often been led astray by sophisticated mathematical models that beautifully capture some of the most intriguing features of glassy behavior, but are too unrealistic to provide bases for predictive theories. As illustrations of what I mean, the first part of this article is devoted to brief summaries of imaginative, sensible, but disparate and often contradictory ideas for solving glass problems. Almost all of these ideas remain alive today, with their own enthusiastic advocates. I then describe numerical simulations, mostly by H Tanaka and coworkers, in which it appears that very simple, polydisperse systems of hard disks and spheres develop long range, Ising-like, bond-orientational order as they approach glass transitions. Finally, a summary of my recent proposal that topologically ordered clusters of particles, in disordered environments, tend to become aligned with each other as if they were two-state systems, and thus produce the observed Ising-like behavior. Neither Tanaka’s results nor my proposed interpretation of them fit comfortably within any of the currently popular glass theories.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

pnnl/safekit

Some of the most pressing machine learning applications such as cyber security and object recognition lack enough ground-truth training data to build a classifier. We solve this problem by using unsupervised deep learning techniques to determine when data were anomalous or deviated from the norm. Traditional methods require either specific context dependent expertise to construct models, or prior examples of events and large amounts of well-labeled data to perform machine learning. Some cutting-edge deep learning approaches have been used to characterize complex events, but these have not been applied to the streaming environment and require a great deal of data. We demonstrated the use of an autoencoder and relevant featurization techniques to both learn a feature space and then identify anomalous portions without the aid of labeled data or domain knowledge. In this way, we demonstrated the detection of anomalous features without domain knowledge or tagged examples, and delivered these features to users.

Central, PNNL Developer↗

Application of the GERTS II simulator in the industrial environment.

GERT was originally developed to aid in the analysis of stochastic networks. GERT can be used to graphically model and analyze complex systems. Recently a simulator model, GERTS II, has been developed to solve GERT Networks. The simulator language used in the development of this model was GASP II A. This paper discusses the possible application of GERTS II to model and analyze (1) assembly line operations, (2) project management networks, (3) conveyor systems and (4) inventory systems. Finally, an actual application dealing with a job shop loading problem is presented.

Whitehouse, G. E.↗