Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “shared”

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 433 records · Page 24

Gut bacteria are rarely shared by co-hospitalized premature infants, regardless of necrotizing enterocolitis development

Premature infants are highly vulnerable to aberrant gastrointestinal tract colonization, a process that may lead to diseases like necrotizing enterocolitis. Thus, spread of potential pathogens among hospitalized infants is of great concern. Here, we reconstructed hundreds of high-quality genomes of microorganisms that colonized co-hospitalized premature infants, assessed their metabolic potential, and tracked them over time to evaluate bacterial strain dispersal among infants. We compared microbial communities in infants who did and did not develop necrotizing enterocolitis. Surprisingly, while potentially pathogenic bacteria of the same species colonized many infants, our genome-resolved analysis revealed that strains colonizing each baby were typically distinct. In particular, no strain was common to all infants who developed necrotizing enterocolitis. The paucity of shared gut colonizers suggests the existence of significant barriers to the spread of bacteria among infants. Importantly, we demonstrate that strain-resolved comprehensive community analysis can be accomplished on potentially medically relevant time scales.

59 BASIC BIOLOGICAL SCIENCES↗

A widespread family of serine/threonine protein phosphatases shares a common regulatory switch with proteasomal proteases

PP2C phosphatases control biological processes including stress responses, development, and cell division in all kingdoms of life. Diverse regulatory domains adapt PP2C phosphatases to specific functions, but how these domains control phosphatase activity was unknown. We present structures representing active and inactive states of the PP2C phosphatase SpoIIE from Bacillus subtilis. Based on structural analyses and genetic and biochemical experiments, we identify an α-helical switch that shifts a carbonyl oxygen into the active site to coordinate a metal cofactor. Our analysis indicates that this switch is widely conserved among PP2C family members, serving as a platform to control phosphatase activity in response to diverse inputs. Remarkably, the switch is shared with proteasomal proteases, which we identify as evolutionary and structural relatives of PP2C phosphatases. Although these proteases use an unrelated catalytic mechanism, rotation of equivalent helices controls protease activity by movement of the equivalent carbonyl oxygen into the active site.

59 BASIC BIOLOGICAL SCIENCES↗

Sharing the Sun Community Solar Project Data

This database represents a list of community solar projects, complete and pending, identified through various sources. The dataset is updated multiple times per year. The current version is the first file located below. Previous versions of the dataset published before June of 2024 can be found in the dataset below labeled “ARCHIVE_Sharing the Sun Community Solar Project Data_Before 06.24.“ The list has been reviewed but errors may exist, and the list may not be comprehensive. Errors in the sources e.g. press releases may be duplicated in the list. Blank spaces represent missing information. NLR invites input to improve the database including, to correct erroneous information, add missing projects, fill in missing information, and remove inactive projects. Updated information can be submitted to Sudha Kannan ( sudha.kannan@nlr.gov ).

14 SOLAR ENERGY↗

County Electric Vehicle Home Charging Access Shares from the 2030 National Charging Network Study

This file contains modeled county-level home electric vehicle (EV) charging access shares from the study, "The 2030 National Charging Network: Estimating U.S. Light-Duty Demand for Electric Vehicle Charging Infrastructure" by Wood et al. (2023). These are based on modeling in "There's No Place Like Home: Residential Parking, Electrical Access, and Implications for the Future of Electric Vehicle Charging Infrastructure" by Ge et al. (2021). Wood, Eric, et al. 2023. The 2030 National Charging Network: Estimating U.S. Light-Duty Demand for Electric Vehicle Charging Infrastructure. Golden, CO: National Renewable Energy Laboratory. NREP/TP-5400-85654. https://www.nlr.gov/docs/fy23osti/85654.pdf . Ge, Yanbo, et al. 2021. There's No Place Like Home: Residential Parking, Electrical Access, and Implications for the Future of Electric Vehicle Charging Infrastructure. Golden, CO: National Renewable Energy Laboratory. NREL/TP-5400-81065. https://www.nlr.gov/docs/fy22osti/81065.pdf .

24 POWER TRANSMISSION AND DISTRIBUTION↗

Active Site Sharing and Subterminal Hairpin Recognition in a New Class of DNA Transposases

Many bacteria harbor simple transposable elements termed insertion sequences (IS). In Helicobacter pylori, the chimeric IS605 family elements are particularly interesting due to their proximity to genes encoding gastric epithelial invasion factors. Protein sequences of IS605 transposases do not bear the hallmarks of other well-characterized transposases. We have solved the crystal structure of full-length transposase (TnpA) of a representative member, ISHp608. Structurally, TnpA does not resemble any characterized transposase; rather, it is related to rolling circle replication (RCR) proteins. Consistent with RCR, Mg{sup 2+} and a conserved tyrosine, Tyr127, are essential for DNA nicking and the formation of a covalent intermediate between TnpA and DNA. TnpA is dimeric, contains two shared active sites, and binds two DNA stem loops representing the conserved inverted repeats near each end of ISHp608. The cocrystal structure with stem-loop DNA illustrates how this family of transposases specifically recognizes and pairs ends, necessary steps during transposition.

36 MATERIALS SCIENCE↗

DEVELOPMENT OF ASME SECTION X CODE RULES FOR HIGH PRESSURE COMPOSITE HYDROGEN PRESSURE VESSELS WITH NON-LOAD SHARING LINERS

The Boiler and Pressure Vessel Project Team on Hydrogen Tanks was formed in 2004 to develop Code rules to address the various needs that had been identified for the design and construction of up to 15000 psi hydrogen storage vessel. One of these needs was the development of Code rules for high pressure composite vessels with non-load sharing liners for stationary applications. In 2009, ASME approved new Appendix 8, for Section X Code which contains the rules for these vessels. These vessels are designated as Class III vessels with design pressure ranging from 20.7 MPa (3,000 ps)i to 103.4 MPa (15,000 psi) and maximum allowable outside liner diameter of 2.54 m (100 inches). The maximum design life of these vessels is limited to 20 years. Design, fabrication, and examination requirements have been specified, included Acoustic Emission testing at time of manufacture. The Code rules include the design qualification testing of prototype vessels. Qualification includes proof, expansion, burst, cyclic fatigue, creep, flaw, permeability, torque, penetration, and environmental testing.

08 HYDROGEN↗

Methods and apparatuses for information analysis on shared and distributed computing systems

Apparatuses and computer-implemented methods for analyzing, on shared and distributed computing systems, information comprising one or more documents are disclosed according to some aspects. In one embodiment, information analysis can comprise distributing one or more distinct sets of documents among each of a plurality of processes, wherein each process performs operations on a distinct set of documents substantially in parallel with other processes. Operations by each process can further comprise computing term statistics for terms contained in each distinct set of documents, thereby generating a local set of term statistics for each distinct set of documents. Still further, operations by each process can comprise contributing the local sets of term statistics to a global set of term statistics, and participating in generating a major term set from an assigned portion of a global vocabulary.

97 MATHEMATICS AND COMPUTING↗

Integrating Data Management and Collaborative Sharing with Computational Science Processes

Structured Scientific Data Management - the management of storage, access, usage, lifecycle, content and meaning for scientific data - is not as commonly employed in computational science as it is in other fields of scientific endeavor. However, where it has been co-developed and integrated with the computational science research it has had a transformational influence on the scientific work. These infrastructures enabled not only new research previously impossible, but also helped to speed up the research process and improved the quality of the research output. Good data management systems are capable of facilitating effective scientific collaborations on a group, institutional, national or international level, through the easy sharing of resources and results. Today as computational science is becoming more data rich and collaborative, integrated scientific data management is becoming an essential tool for every computational science research and production environment. This chapter will describe the fundamental principles and components of a good data management system, provide real world examples of successful implementations and provides an outlook on future developments. We conclude with a short section on how to get started for those whose interest has been peaked by this chapter

42 ENGINEERING↗

Tracking Efficiency And Charge Sharing of 3D Silicon Sensors at Different Angles in a 1.4T Magnetic Field

A 3D silicon sensor fabricated at Stanford with electrodes penetrating throughout the entire silicon wafer and with active edges was tested in a 1.4 T magnetic field with a 180 GeV/c pion beam at the CERN SPS in May 2009. The device under test was bump-bonded to the ATLAS pixel FE-I3 readout electronics chip. Three readout electrodes were used to cover the 400 {micro}m long pixel side, this resulting in a p-n inter-electrode distance of {approx} 71 {micro}m. Its behavior was confronted with a planar sensor of the type presently installed in the ATLAS inner tracker. Time over threshold, charge sharing and tracking efficiency data were collected at zero and 15{sup o} angles with and without magnetic field. The latest is the angular configuration expected for the modules of the Insertable B-Layer (IBL) currently under study for the LHC phase 1 upgrade expected in 2014.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

D-Factor: A Quantitative Model of Application Slow-Down in Multi-Resource Shared Systems

Scheduling multiple jobs onto a platform enhances system utilization by sharing resources. The benefits from higher resource utilization include reduced cost to construct, operate, and maintain a system, which often include energy consumption. Maximizing these benefits comes at a price - resource contention among jobs increases job completion time. In this paper, we analyze slow-downs of jobs due to contention for multiple resources in a system; referred to as dilation factor. We observe that multiple-resource contention creates non-linear dilation factors of jobs. From this observation, we establish a general quantitative model for dilation factors of jobs in multi-resource systems. A job is characterized by a vector-valued loading statistics and dilation factors of a job set are given by a quadratic function of their loading vectors. We demonstrate how to systematically characterize a job, maintain the data structure to calculate the dilation factor (loading matrix), and calculate the dilation factor of each job. We validate the accuracy of the model with multiple processes running on a native Linux server, virtualized servers, and with multiple MapReduce workloads co-scheduled in a cluster. Evaluation with measured data shows that the D-factor model has an error margin of less than 16%. We also show that the model can be integrated with an existing on-line scheduler to minimize the makespan of workloads.

99 GENERAL AND MISCELLANEOUS↗

Multi-core and Many-core Shared-memory Parallel Raycasting Volume Rendering Optimization and Tuning

Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. And, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

97 MATHEMATICS AND COMPUTING↗

RF/optical shared aperture for high availability wideband communication RF/FSO links

An RF/Optical shared aperture is capable of transmitting and receiving optical signals and RF signals simultaneously. This technology enables compact wide bandwidth communications systems with 100% availability in clear air turbulence, rain and fog. The functions of an optical telescope and an RF reflector antenna are combined into a single compact package by installing an RF feed at either of the focal points of a modified Gregorian telescope.

47 OTHER INSTRUMENTATION↗

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↗

Conditional load and store in a shared memory

A method, system and computer program product for implementing load-reserve and store-conditional instructions in a multi-processor computing system. The computing system includes a multitude of processor units and a shared memory cache, and each of the processor units has access to the memory cache. In one embodiment, the method comprises providing the memory cache with a series of reservation registers, and storing in these registers addresses reserved in the memory cache for the processor units as a result of issuing load-reserve requests. In this embodiment, when one of the processor units makes a request to store data in the memory cache using a store-conditional request, the reservation registers are checked to determine if an address in the memory cache is reserved for that processor unit. If an address in the memory cache is reserved for that processor, the data are stored at this address.

97 MATHEMATICS AND COMPUTING↗

RF/optical shared aperture for high availability wideband communication RF/FSO links

An RF/Optical shared aperture is capable of transmitting and receiving optical signals and RF signals simultaneously. This technology enables compact wide bandwidth communications systems with 100% availability in clear air turbulence, rain and fog. The functions of an optical telescope and an RF reflector antenna are combined into a single compact package by installing an RF feed at either of the focal points of a modified Gregorian telescope.

47 OTHER INSTRUMENTATION↗

DMA shared byte counters in a parallel computer

A parallel computer system is constructed as a network of interconnected compute nodes. Each of the compute nodes includes at least one processor, a memory and a DMA engine. The DMA engine includes a processor interface for interfacing with the at least one processor, DMA logic, a memory interface for interfacing with the memory, a DMA network interface for interfacing with the network, injection and reception byte counters, injection and reception FIFO metadata, and status registers and control registers. The injection FIFOs maintain memory locations of the injection FIFO metadata memory locations including its current head and tail, and the reception FIFOs maintain the reception FIFO metadata memory locations including its current head and tail. The injection byte counters and reception byte counters may be shared between messages.

97 MATHEMATICS AND COMPUTING↗

Secret Key Generation via a Modified Quantum Secret Sharing Protocol

We present and experimentally show a novel protocol for distributing secret information between two and only two parties in a N-party single-qubit Quantum Secret Sharing (QSS) system. We demonstrate this new algorithm with N = 3 active parties over 6km of telecom. ber. Our experimental device is based on the Clavis2 Quantum Key Distribution (QKD) system built by ID Quantique but is generalizable to any implementation. We show that any two out of the N parties can build secret keys based on partial information from each other and with collaboration from the remaining N > 2 parties. This algorithm allows for the creation of two-party secret keys were standard QSS does not and signicantly reduces the number of resources needed to implement QKD on a highly connected network such as the electrical grid.

Smith, IV, Amos M↗

Request queues for interactive clients in a shared file system of a parallel computing system

Interactive requests are processed from users of log-in nodes. A metadata server node is provided for use in a file system shared by one or more interactive nodes and one or more batch nodes. The interactive nodes comprise interactive clients to execute interactive tasks and the batch nodes execute batch jobs for one or more batch clients. The metadata server node comprises a virtual machine monitor; an interactive client proxy to store metadata requests from the interactive clients in an interactive client queue; a batch client proxy to store metadata requests from the batch clients in a batch client queue; and a metadata server to store the metadata requests from the interactive client queue and the batch client queue in a metadata queue based on an allocation of resources by the virtual machine monitor. The metadata requests can be prioritized, for example, based on one or more of a predefined policy and predefined rules.

97 MATHEMATICS AND COMPUTING↗