Publications

Results 49301–49400 of 99,299

Search results

Jump to search filters

Experimental Evaluation of the Free Piston Engine - Linear Alternator (FPLA)

Leick, Michael T.; Moses, Ronald W.

This report describes the experimental evaluation of a prototype free piston engine - linear alternator (FPLA) system developed at Sandia National Laboratories. The opposed piston design wa developed to investigate its potential for use in hybrid electric vehicles (HEVs). The system is mechanically simple with two - stroke uniflow scavenging for gas exchange and timed port fuel injection for fuel delivery, i.e. no complex valving. Electrical power is extracted from piston motion through linear alternators wh ich also provide a means for passive piston synchronization through electromagnetic coupling. In an HEV application, this electrical power would be used to charge the batteries. The engine - alternator system was designed, assembled and operated over a 2 - year period at Sandia National Laboratories in Livermore, CA. This report primarily contains a description of the as - built system, modifications to the system to enable better performance, and experimental results from start - up, motoring, and hydrogen combus tion tests.

More Details
TYPE SAND Report YEAR 2015
DOIOSTI

ASC-ATDM Performance Portability Requirements for 2015-2019

Edwards, Harold C.; Trott, Christian R.

This report outlines the research, development, and support requirements for the Advanced Simulation and Computing (ASC ) Advanced Technology, Development, and Mitigation (ATDM) Performance Portability (a.k.a., Kokkos) project for 2015 - 2019 . The research and development (R&D) goal for Kokkos (v2) has been to create and demonstrate a thread - parallel programming model a nd standard C++ library - based implementation that enables performance portability across diverse manycore architectures such as multicore CPU, Intel Xeon Phi, and NVIDIA Kepler GPU. This R&D goal has been achieved for algorithms that use data parallel pat terns including parallel - for, parallel - reduce, and parallel - scan. Current R&D is focusing on hierarchical parallel patterns such as a directed acyclic graph (DAG) of asynchronous tasks where each task contain s nested data parallel algorithms. This five y ear plan includes R&D required to f ully and performance portably exploit thread parallelism across current and anticipated next generation platforms (NGP). The Kokkos library is being evaluated by many projects exploring algorithm s and code design for NGP. Some production libraries and applications such as Trilinos and LAMMPS have already committed to Kokkos as their foundation for manycore parallelism an d performance portability. These five year requirements includes support required for current and antic ipated ASC projects to be effective and productive in their use of Kokkos on NGP. The greatest risk to the success of Kokkos and ASC projects relying upon Kokkos is a lack of staffing resources to support Kokkos to the degree needed by these ASC projects. This support includes up - to - date tutorials, documentation, multi - platform (hardware and software stack) testing, minor feature enhancements, thread - scalable algorithm consulting, and managing collaborative R&D.

More Details
TYPE SAND Report YEAR 2015
DOIOSTI

Submittal of SWMU Assessment Report for Building 9960 Surface Discharge

Dotson, Patrick W.

Sandia National Laboratories is a multi-purpose engineering and science laboratory owned by the U.S. Department of Energy (DOE)/National Nuclear Security Administration and managed and operated by Sandia Corporation (Sandia), a wholly-owned subsidiary of Lockheed Martin Corporation. This Solid Waste Management Unit (SWMU) Assessment Report (SAR) for the Sandia National Laboratories, New Mexico (SNL/NM), Coyote Test Field, Building 9960 Surface Discharge, has been prepared in accordance with Section V of the Compliance Order on Consent (the Consent Order) between the New Mexico Environment Department (NMED), DOE, and Sandia (NMED April 2004). The DOE and Sandia formally notified the NMED of this newly identified or suspected SWMU or Area of Concern (AOC) by letter dated December 9, 2014. This SAR is being submitted in accordance with the NMED Hazardous Waste Bureau (HWB) letter dated February 16, 2015 letter (Kieling February 2015). This SAR presents the available information for the Building 9960 Surface Discharge, including location, designation of type and function, a general description, the operational dates, waste characteristics, and a summary of existing analytical wastewater and soil data

More Details
TYPE Other Report YEAR 2015
DOIOSTI

FY14 Laboratory Directed Research and Development Annual Report

Chavez, Donna L.; Schunk, Peter R.

This report summarizes progress from the Laboratory Directed Research and Development (LDRD) program during fiscal year 2014. In addition to the programmatic and financial overview, the report includes progress reports from 419 individual R&D projects in 16 categories. Information for 176 projects in their final year is presented in a more comprehensive format, while for those 243 in their pre-final years, only an abstract is presented herein.

More Details
TYPE Other Report YEAR 2015
DOIOSTI

Optimizing the Configuration of Sensor Networks to Detect Intruders

Sandia journal manuscript; Not yet accepted for publication

Brown, Nathanael J.K.; Jones, Katherine; Nozick, Linda; Xu, Ningxiong

This paper focuses on optimizing the selection and configuration of detection technologies to protect a target of interest. The ability of an intruder to simply reach the target is assumed to be sufficient to consider the security system a failure. To address this problem, we develop a game theoretic model of the strategic interactions between the system owner and a knowledgeable intruder. A decomposition-based exact method is used to solve the resultant model.

More Details
TYPE Journal Article YEAR 2015
OSTI

2015 Neuro-Inspired Computational Elements (NICE) Workshop: Information Processing and Computation Systems beyond von Neumann/Turing Architecture and Moore’s Law Limits (Summary Report)

Okandan, Murat

The third Neuro-Inspired Computational Elements (NICE) Workshop was held February 23-25, 2015 in Albuquerque, New Mexico. The goal of the Workshop was to bring together researchers from different scientific disciplines and application areas to provide a common point from which to develop the next generation of information processing/computing architectures that go beyond stored program architecture and Moore’s Law limits.

More Details
TYPE Other Report YEAR 2015
DOIOSTI

On Bipartite Graphs Trees and Their Partial Vertex Covers

ACM Transactions on Algorithms

Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas D.; Subramani, K.

Graphs can be used to model risk management in various systems. Particularly, Caskurlu et al. in [7] have considered a system, which has threats, vulnerabilities and assets, and which essentially represents a tripartite graph. The goal in this model is to reduce the risk in the system below a predefined risk threshold level. One can either restricting the permissions of the users, or encapsulating the system assets. The pointed out two strategies correspond to deleting minimum number of elements corresponding to vulnerabilities and assets, such that the flow between threats and assets is reduced below the predefined threshold level. It can be shown that the main goal in this risk management system can be formulated as a Partial Vertex Cover problem on bipartite graphs. It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs has remained open. In this paper, we establish that the Partial Vertex Cover problem is NP-hard on bipartite graphs, which was also recently independently demonstrated [N. Apollonio and B. Simeone, Discrete Appl. Math., 165 (2014), pp. 37–48; G. Joret and A. Vetta, preprint, arXiv:1211.4853v1 [cs.DS], 2012]. We then identify interesting special cases of bipartite graphs, for which the Partial Vertex Cover problem, the closely related Budgeted Maximum Coverage problem, and their weighted extensions can be solved in polynomial time. We also present an 8/9-approximation algorithm for the Budgeted Maximum Coverage problem in the class of bipartite graphs. We show that this matches and resolves the integrality gap of the natural LP relaxation of the problem and improves upon a recent 4/5-approximation.

More Details
TYPE Journal Article YEAR 2015
OSTI
Results 49301–49400 of 99,299
Results 49301–49400 of 99,299