Search NASA⌕ Search

SEARCH · Search NASA

Results for “weights”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Exploring Enhanced Dominant Resource Fairness Using Linear Programming Calculated Weights

Maintaining resource fairness while achieving optimization for various performance metrics such as resource utilization, turnaround time and job latency is a well-known resource scheduling challenge in cloud computing. Despite the significant progress made with the introduction of dominant resource fairness by Ghodsi et al., which ensures major allocation properties such as sharing incentive, strategy-proofness, envy-freeness and Pareto efficiency to be achieved

Yan, Bo [Binghamton University]↗
DOE OSTI2026

Retrofit & Expansion Project at Ultra-High Molecular Weight Polyethylene Plant: Completing a Full Domestic Supply Chain for Lithium-Ion Batteries (Final Scientific and Technical Report)

The UTEC-1 LIBS Retrofit and Expansion Project aimed to retrofit and expand Braskem’s UHMWPE unit in La Porte, TX to produce lithium-ion battery separator (LIBS) grade material and increase capacity. The project sought to strengthen the domestic supply chain for advanced battery manufacturing and reduce reliance on imports. While significant progress was achieved in conceptual design and FEL-2 engineering, strategic realignment and external factors led to project termination prior to FEL-3 and FEED execution.

25 ENERGY STORAGE↗
DOE OSTI2025

Methodology for Extracting High-Molecular-Weight DNA from Field Collections of Macrofungi

Many macrofungi are impractical or impossible to culture. Consequently, DNA for long-read sequencing required for the assembly of high-quality genomes must be isolated from samples taken from the environment. Collection is often in remote locations, limiting the options for stabilising samples to methods that do not require refrigeration. Fungi contain species-specific arrays of metabolites that may complicate purification techniques and call for judgement to be made to apply appropriate modifications to the DNA extraction protocol in specific cases. The protocols and commentary we describe are informed by the preparation of DNA from a range of Australasian ectomycorrhizal and saprotrophic macrofungi. We collect samples into isopropanol at ambient temperature and employ a strategy of chromatin isolation followed by the sequential removal of unwanted molecular components to purify DNA.

Burgoyne, Leigh A↗
DOE OSTI2024

Device and methods for determination of molecular weight distributions of polymers and distributions of other polymer properties without physical separation

Devices and methods for determining the cumulative distribution of a polymer property in a reactor without physical separation of reaction subcomponents. The device includes a means of measuring an instantaneous property of the polymers being produced in a reaction vessel a plurality of times during a polymerization reaction as well as a means of determining the corresponding change in polymer concentration in the reaction vessel between measurements of the instantaneous polymer property. The device also includes a means of computing a statistical distribution appropriate to the polymer characteristic and applying the statistical distribution to a recently measured instantaneous value of the polymer property so as to have an instantaneous distribution of the polymer property and a means of adding together the instantaneous distributions of the polymer property in order to obtain the cumulative distribution of the polymer property in the reactor.

Reed, Wayne Frederick↗
DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗