Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sorting”

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 37 records · Page 2

Mammalian Chromosome Analysis and Sorting by Flow Cytometry

The analysis of chromosomes by flow cytometry is termed flow cytogenetics, and it involves the analysis and sorting of single mitotic chromosomes in suspension. The study of flow karyograms provides insight into chromosome number and structure to provide information on chromosomal DNA content and can enable the detection of deletions, translocations, or any forms of aneuploidy. Beyond its clinical applications, flow cytogenetics greatly contributed to the Human Genome Project through the ability to sort pure populations of chromosomes for gene mapping, cloning, and the construction of DNA libraries. Maximizing the potential of these important applications of flow cytogenetics relies on precise instrument setup and optimal sample processing, both of which impact the accuracy and quality of the data that are generated. This article is a compilation of the existing protocols that describe the stepwise methodology of accumulating, isolating, and staining metaphase chromosomes to prepare single-chromosome suspensions for flow cytometric analysis and sorting. Although the chromosome preparation protocols have remained largely unchanged, cytometer technology has advanced dramatically since these protocols were originally developed. Advances in cytometry technologies offer new and exciting approaches for understanding and monitoring chromosomal aberrations, but the hallmark of these protocols remains their simplicity in methodologies and reagent requirements and the accuracy of data resolvable to every chromosome of the cell.

59 BASIC BIOLOGICAL SCIENCES↗

Impact of automated battery sorting for mineral recovery from lithium-ion battery recycling in the United States

The United States has identified several lithium-ion battery materials as critical for reaching the national emission reduction targets that have been set in accordance with the 2015 Paris Agreement. However, with few natural resources available domestically, there is a rapidly growing focus on the development of a domestic recycling industry to recover these materials from end-of-life batteries. Here, we use the Lithium-Ion Battery Resources Assessment (LIBRA) system dynamics model to evaluate the impact of automated battery sorting technology in terms of the shares of cobalt and nickel that are recovered through recycling. Findings show that automated sorting has clear benefits over manual sorting methods by helping recyclers selectively process high-cobalt batteries. By maximizing cobalt recovery, recycling becomes more profitable and drives greater investment in recycling capacity, resulting in a higher share of nickel and cobalt recovered from EOL batteries over time.

25 ENERGY STORAGE↗

Self-Sorting vs Coassembly in Peptide Amphiphile Supramolecular Nanostructures

The functionality of supramolecular nanostructures can be expanded if systems containing multiple components are designed to either self-sort or mix into coassemblies. This is critical to gain the ability to craft self-assembling materials that integrate functions, and our understanding of this process is in its early stages. Here, in this work, we have utilized three different peptide amphiphiles with the capacity to form β-sheets within supramolecular nanostructures and found binary systems that self-sort and others that form coassemblies. This was measured using atomic force microscopy to reveal the nanoscale morphology of assemblies and confocal laser scanning microscopy to determine the distribution of fluorescently labeled monomers. We discovered that PA assemblies with opposite supramolecular chirality self-sorted into chemically distinct nanostructures. In contrast, the PA molecules that formed a mixture of right-handed, left-handed, and flat nanostructures on their own were able to coassemble with the other PA molecules. We attribute this phenomenon to the energy barrier associated with changing the handedness of a β-sheet twist in a coassembly of two different PA molecules. This observation could be useful for designing biomolecular nanostructures with dual bioactivity or interpenetrating networks of PA supramolecular assemblies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Raman-based sorting of microbial cells to link functions to their genes

In our recent work, we developed an optofluidic platform that allows a direct link to be made between the phenotypes (functions) and the genotypes (genes) of microbial cells within natural communities. By combining stable isotope probing, optical tweezers, Raman microspectroscopy, and microfluidics, the platform performs automated Raman-based sorting of taxa from within a complex community in terms of their functional properties. In comparison with manual sorting approaches, our method provides high throughput (up to 500 cells per hour) and very high sorting accuracy (98.3 ± 1.7%), and significantly reduces the human labour required. The system provides an efficient manner to untangle the contributions of individual members within environmental and host-associated microbiomes. In this News and Thoughts, we provide an overview of our platform, describe potential applications, suggest ways in which the system could be improved, and discuss future directions in which Raman-based analysis of microbial populations might be developed.

59 BASIC BIOLOGICAL SCIENCES↗

Parallel sorting algorithm classification: is manual instrumentation necessary?

Understanding parallel algorithms is crucial for accelerating scientific simulations on complex, distributed memory, high-performance computers. Modern algorithm classification approaches learn semantics directly from source code to differentiate between algorithms, however, accessing source code is not always possible. We can learn about parallel algorithms from observing their performance, as programs running the same algorithms and using the same hardware should exhibit similar performance characteristics. We present an approach to learn algorithm classes from parallel performance data directly in order to classify algorithms without access to the source code. We extend previous work to enable classifying parallel sorting algorithms using automatic instrumentation instead of requiring manual region annotations in the source code. In this work, we design and demonstrate a study for classification of parallel sorting algorithms using parallel performance data collected from automatic instrumentation, and evaluate the performance of our new methodology on classification. We leverage Caliper to collect the performance data, Thicket for our exploratory data analysis (EDA), and PyTorch and Scikit-learn to evaluate the effectiveness of random forests, support vector machines (SVMs), decision trees, neural networks, and logistic regressions on parallel performance data. Additionally, we study noise in parallel performance data, whether the removal of noise and pre-processing of the data is necessary to accurately classify parallel sorting algorithms, and determine the effectiveness of features created from performance data. In conclusion, we demonstrate classification accuracy for these five different models of up to 97.7% across four different parallel algorithm classes.

Algorithm Classification↗

Efficient searching and sorting applications using an associative array processor

The purpose of this paper is to describe a method of searching and sorting data by using some of the unique capabilities of an associative array processor. To understand the application, the associative array processor is described in detail. In particular, the content addressable memory and flip network are discussed because these two unique elements give the associative array processor the power to rapidly sort and search. A simple alphanumeric sorting example is explained in hardware and software terms. The hardware used to explain the application is the STARAN (Goodyear Aerospace Corporation) associative array processor. The software used is the APPLE (Array Processor Programming Language) programming language. Some applications of the array processor are discussed. This summary tries to differentiate between the techniques of the sequential machine and the associative array processor.

Pace, W.↗

Sorting process of nanoparticles and applications of same

A sensing platform includes a substrate, an array of wells formed in the substrate, and sorted nanoparticles filling in the array of wells such that each well contains a single sorted nanoparticle, wherein the sorted nanoparticles are in a cluster state.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Sorting cast and wrought aluminum

A material sorting system sorts materials utilizing a vision system that implements a machine learning system in order to identify or classify each of the materials, which are then sorted into separate groups based on such an identification or classification determining that the materials are composed of either wrought aluminum or cast aluminum.

36 MATERIALS SCIENCE↗

River Organic Carbon Fluxes Modulated by Hydrodynamic Sorting of Particulate Organic Matter

Rivers regulate the global carbon cycle by transferring particulate organic carbon (POC) from terrestrial landscapes to marine sedimentary basins, but the processes controlling the amount and composition of fluvially exported POC are poorly understood. We propose that hydrodynamic sorting processes modify POC fluxes during fluvial transit. We test this hypothesis by studying POC transported along a ~1,200 km reach of the Rio Bermejo, Argentina. Nanoscale secondary ion mass spectrometry revealed that POC was either fine, mineral-associated organic matter, or coarse discrete organic particles. Mineral-associated POC is more resistant to oxidation and has a lower particle settling velocity than discrete POC. Consequently, hydraulic sorting and downstream fining amplify the proportion of fine, mineral-associated POC from ~55% to ~78% over 1,220 km of downstream transit. This suggests that mineral-associated POC has a greater probability of export and preservation in marine basins than plant detritus, which may be oxidized to CO 2 during transit.

58 GEOSCIENCES↗

Design of an AI Trash Sorting Machine for Use on the Moon and Mars

As NASA prepares for Mars colonization, resource conservation will be critical for survival. Artificial Intelligence (AI) powered waste sorting technologies, already emerging on Earth, offer promising solutions for recycling and material recovery. These systems use advanced sensors and machine learning algorithms to identify and separate materials with remarkable accuracy. On Mars, where every item has significant value, efficient recycling will be essential to reduce resupply needs and support closed-loop life support systems. This paper explores how terrestrial AI-based trash sorting technologies can be adapted for Martian conditions, focusing on challenges such as the harsh surface environment, minimizing system mass, power, volume, and estimating waste composition. Addressing these issues will be key to enabling sustainable operations on the Red Planet.

Sorting↗

Design of an AI Trash Sorting Machine for Use on the Moon and Mars

As NASA prepares for Mars colonization, resource conservation will be critical for survival. Artificial Intelligence (AI) powered waste sorting technologies, already emerging on Earth, offer promising solutions for recycling and material recovery. These systems use advanced sensors and machine learning algorithms to identify and separate materials with remarkable accuracy. On Mars, where every item has significant value, efficient recycling will be essential to reduce resupply needs and support closed-loop life support systems. This paper explores how terrestrial AI-based trash sorting technologies can be adapted for Martian conditions, focusing on challenges such as the harsh surface environment, minimizing system mass, power, volume, and estimating waste composition. Addressing these issues will be key to enabling sustainable operations on the Red Planet.

AI↗

Delamination-informed lifecycle decisions: A dielectric and machine learning framework for composite sorting and recycling

Composite materials are widely used in aerospace, marine, and automotive sectors due to their high strength-to-weight ratio and durability. However, their long-term reliability can be compromised by damage accumulation. Specifically, delamination initiation serves as a precursor to structural failure, which is often difficult to detect during damage inspection. Identifying and sorting delamination initiation in samples not only increases operational safety while providing critical information for end-of-life decisions, which influences both the service life extension value and the efficiency of fiber extraction during recycling. This research addresses two challenges: (1) developing a nondestructive, ex-situ framework to sort composite materials based on damage severity, particularly delamination, and (2) understanding how damage in composites influences resin removal during pyrolysis. Both experimental work and finite element analysis were performed to predict critical stress levels that are associated with delamination onset. Based on these results, three loading levels 50 %, 75 %, and 90 % of maximum stress, were selected for controlled experiments, generating composite samples with varying extents of damage for machine learning model training. Microscopic imaging of these samples confirmed the damage progression from matrix cracking to delamination, validating the computational predictions. We explored supervised machine learning using dielectric measurements to classify damage states. Preliminary results show an artificial neural network can identify early delamination which is a potential precursor to failure, with 94.44 % accuracy on our dataset. A parallel investigation into the effect of damage severity on pyrolysis recycling showed that heavily delaminated samples required significantly less energy for comparable matrix removal than undamaged samples.

dielectric variables↗

Evaluation of sustainable waste management: An analysis of techno-economic and life cycle assessments of municipal solid waste sorting and decontamination

This study evaluates the economic and environmental feasibility of Municipal Solid Waste (MSW) sorting and decontamination technologies across urban, suburban, and rural areas. Using Techno-Economic Analysis (TEA) and Life Cycle Assessment (LCA), the research assesses cost-effectiveness and environmental impacts, with a focus on cost variability analyzed through Monte Carlo simulations. Findings indicate significant cost differences based on population density: rural areas incur high costs up to $$764/ton due to low waste volumes and limited infrastructure, whereas suburban and urban areas have more feasible costs ranging from $36.3 to $142.5/ton. Environmental impacts also vary, with greenhouse gas emissions at 171 kg CO 2 eq/ton for copy paper and 118.6 kg CO 2 eq/ton for plastics. PM2.5 levels are 9.1 g/ton for copy paper and 6.3 g/ton for plastics, with sorting lines being the main contributors. Monte Carlo simulations reveal a 50% probability of costs being below $$102.26/ton for copy paper and $115.8/ton for plastics in suburban settings. Further, the study underscores the importance of customized waste management strategies to improve economic viability and sustainability based on local conditions.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Two-Point Mixing, Buoyancy Sorting, and Updraft Dilution in the RACORO Campaign

Aircraft measurements of shallow cumulus cases from the RACORO campaign are studied in a transformed Paluch diagram. Previous studies have interpreted samples in Paluch diagrams in terms of two-point mixing and buoyancy sorting. The two-point mixing behavior is frequently seen in the RACORO observations and can be unambiguously distinguished from buoyancy sorting. The latter is not found in the RACORO observations and is also rare in a large-eddy simulation (LES) of a RACORO case. As opposed to often assumed gradual dilution of updrafts, around half of the instances of two-point mixing show no clear evidence of updraft dilution. We also find substantial spread in the properties of parcels that have adjusted to their level of neutral buoyancy and that a LES with horizontally homogeneous surface underestimates this spread. The inclusion of surface heterogeneity in the LES improves the agreement of its horizonal moisture variations with the aircraft measurements.

54 ENVIRONMENTAL SCIENCES↗

Skyrmion dynamics and topological sorting on periodic obstacle arrays

Abstract We examine skyrmions under a dc drive interacting with a square array of obstacles for varied obstacle size and damping. When the drive is applied in a fixed direction, we find that the skyrmions are initially guided in the drive direction but also move transverse to the drive due to the Magnus force. The skyrmion Hall angle, which indicates the difference between the skyrmion direction of motion and the drive direction, increases with drive in a series of quantized steps as a result of the locking of the skyrmion motion to specific symmetry directions of the obstacle array. On these steps, the skyrmions collide with an integer number of obstacles to create a periodic motion. The transitions between the different locking steps are associated with jumps or dips in the velocity–force curves. In some regimes, the skyrmion Hall angle is actually higher than the intrinsic skyrmion Hall angle that would appear in the absence of obstacles. In the limit of zero damping, the skyrmion Hall angle is 90°, and we find that it decreases as the damping increases. For multiple interacting skyrmion species in the collective regime, we find jammed behavior at low drives where the different skyrmion species are strongly coupled and move in the same direction. As the drive increases, the species decouple and each can lock to a different symmetry direction of the obstacle lattice, making it possible to perform topological sorting in analogy to the particle sorting methods used to fractionate different species of colloidal particles moving over two-dimensional obstacle arrays.

36 MATERIALS SCIENCE↗

An Intelligent Garbage Sorting System Based on Edge Computing and Visual Understanding of Social Internet of Vehicles

In order to enable Social Internet of Vehicles devices to achieve the purpose of intelligent and autonomous garbage classification in a public environment, while avoiding network congestion caused by a large amount of data accessing the cloud at the same time, it is therefore considered to combine mobile edge computing with Social Internet of Vehicles to give full play to mobile edge computing features of high bandwidth and low latency. At the same time, based on cutting-edge technologies such as deep learning, knowledge graph, and 5G transmission, the paper builds an intelligent garbage sorting system based on edge computing and visual understanding of Social Internet of Vehicles. First of all, for the massive multisource heterogeneous Social Internet of Vehicles big data in the public environment, different item modal data adopts different processing methods, aiming to obtain a visual understanding model. Secondly, using the 5G network, the model is deployed on the edge device and the cloud for cloud-side collaborative management, aiming to avoid the waste of edge node resources, while ensuring the data privacy of the edge node. Finally, the Social Internet of Vehicles devices is used to make intelligent decision-making on the big data of the items. First, the items are judged as garbage, and then the category is judged, and finally the task of grabbing and sorting is realized. The experimental results show that the system proposed in this paper can efficiently process the big data of Social Internet of Vehicles and make valuable intelligent decisions. At the same time, it also has a certain role in promoting the promotion of Social Internet of Vehicles devices.

Shen, Xuehao↗

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm

Consider a scalar field f : M → R, where M is a triangulated simplicial mesh in R d . A level set, or contour, at value v is a connected component of f –1 (v). As v is changed, these contours change topology, merge into each other, or split. Contour trees are concise representations of f that track this contour behavior. The vertices of these trees are the critical points of f, where the gradient is zero. The edges represent changes in the topology of contours. It is a fundamental data structure in data analysis and visualization, and there is significant previous work (both theoretical and practical) on algorithms for constructing contour trees. Suppose M has n vertices, N facets, and t critical points. A classic result of Carr, Snoeyink, and Axen (2000) gives an algorithm that takes O(n log n+Nα(N)) time (where α(·) is the inverse Ackermann function). A further improvement to O(t log t + N) time was given by Chiang et al. All these algorithms involve a global sort of the critical points, a significant computational bottleneck. Unfortunately, lower bounds of Ω(t log t) also exist. We present the first algorithm that can avoid the global sort and has a refined time complexity that depends on the contour tree structure. Intuitively, if the tree is short and fat, we get significant improvements in running time. For a partition of the contour tree into a set of descending paths, P, our algorithm runs in O($\Sigma$ pϵP |p| log |p| + tα(t) + N). This is at most O(t log D + N), where D is the diameter of the contour tree. Moreover, it is O(tα(t) + N) for balanced trees, a significant improvement over the previous complexity. Our algorithm requires numerous ideas: partitioning the contour tree into join and split trees, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis. There is a crucial use of a family of binomial heaps to maintain priorities, ensuring that any comparison made is between comparable nodes of the contour tree. We also prove lower bounds showing that the $\Sigma$ pϵP |p| log |p| complexity is inherent to computing contour trees.

97 MATHEMATICS AND COMPUTING↗

Image Analysis for Rapid Assessment and Quality-Based Sorting of Corn Stover

Imaging in the visible spectrum is a low-cost tool that can be readily deployed for in-field or over-belt monitoring of biomass quality for bio-refining operations. Rapid image analysis coupled with innovative preprocessing may reduce the impacts of feedstock variability through identification of contaminants or other material attributes to guide selective sorting and quality management. Image analysis was employed to evaluate the quality of corn stover in red-green-blue (RGB) chromatic space. This study used controlled, bench-scale imaging as a proof-of-concept for rapid quality assessment of corn stover based on variations in material attributes, including chemical and physical attributes, that relate to biological degradation and soil contamination. Additionally, logistic regression-based classification algorithms were used to develop a method for biomass screening as a function of biological degradation or soil contamination. This study demonstrated the use of image analysis to extract features from RGB color space to investigate variations in critical material attributes from chemical composition of corn stover. Fourier transform infrared (FT-IR) suggested a correlation between red band intensity and biological degradation, while detailed surface texture analysis was found to distinguish among variations in ash. These insights offer promise for development of a rapid screening tool that could be deployed by farmers for in-field assessment of biomass quality or biorefinery operators for in-line sorting and process optimization.

09 BIOMASS FUELS↗