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

Radiological Soil Sorting Pilot Study Results - Middlesex Municipal Landfill - 19394

The U.S. Army Corps of Engineers (USACE) conducted a pilot scale study of radiological sorting technology at the Formerly Utilized Sites Remedial Action Program (FUSRAP) Middlesex Municipal Landfill (MML) site in Middlesex, New Jersey. Residual uranium ore pieces or 'nuggets' and associated soil contamination are present at the MML site as a result of the nation's early atomic energy program. Study questions and objectives of the MML Pilot Study project were to 1) evaluate the accuracy with which contaminated soils can be separated from uncontaminated soils using a radiologic soil sorting system, 2) determine the optimal full-scale operational process throughput rate that might reasonably be achieved, 3) determine the waste volume reduction that might be expected when operating at full scale, and 4) help establish the feasibility of implementing soil sorting as a potential remedy to other areas of the site. To accomplish the objectives soils were processed through the sorting system in a series of 30 different sorting experimental (test) runs utilizing approximately 917 cubic meters [1200 cubic yards (CY)] of material. The test runs included varying parameters such as belt speeds, soil layer thicknesses, and alarm criteria, all in varying combinations. Test runs also included engineered tests to evaluate point source segregation issues. This paper presents the challenges, results, lessons learned, and recommendations of the radiological soil sorting pilot study. The technical aspects and evaluation of the results of the test runs will also be discussed. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Techno-Economic Impact of a Smart Battery Sorting System

Create analytical framework to capture costs and benefits of the automated sorting into battery recycling including the development and deployment of various types of battery recycling technologies such as pyrometallurgical, hydrometallurgical, and direct recycling. Li Industries, Inc. is a Virginia startup company focused on reinventing how lithium-ion batteries (LIBs) are recycled. Li Industries is focused on developing direct LIB recycling and automated battery sorting technologies in order to reduce the environmental impact of the LIB lifecycle. This work is to be conducted in support of the American-Made Challenges Lithium-Ion Battery Recycling Prize. Li Industries and NREL will work together to understand how novel technologies, such as those being developed by Li Industries, can impact the development and economics of the battery recycling industry. This voucher is being used to evaluate the profitability of an automated sorting system developed by Li Industries and the potential effect this increased value could have on the domestic lithium-ion battery (LIB) recycling industries in the United States. NREL has developed the Lithium-Ion Battery Resources Assessment (LIBRA) system dynamics model to project the future viability of the US LIB manufacturing and recycling industries under varying technoeconomic conditions and battery adoption scenarios over the coming decades. Additional logic was added to LIBRA to analyze the role automated sorting of recycling feedstock could play in the buildout of the industry and the impacts it has on the recovery of end-of-life (EOL) battery materials. This report summarizes the outcomes of this modeling analysis in the US context through a series of sensitivity analyses run for a range of values of a given input dimension and compared across the unsorted or automated sorting cases for LIB recycling feedstock. For greater detail on the process and analysis, the researchers are publishing a forthcoming journal article titled Techno-Economic Impact of a Smart Battery Sorting System for Lithium-Ion Battery Recycling and Mineral Recovery in the United States by Weigl, et al. In the event the article is not accepted by any currently seeking publication in academic or industry journal, it may be published by NREL. CRADA benefit to DOE, Participant, and US Taxpayer: assists laboratory in achieving programmatic scope competencies, uses the laboratory's core competencies.

25 ENERGY STORAGE↗

Pre-accretional sorting of grains in the outer solar nebula

Despite their micrometer-scale dimensions and nanogram masses, chondritic porous interplanetary dust particles (CP IDPs) are an important class of extraterrestrial material since their properties are consistent with a cometary origin and they show no evidence of significant post-accretional parent body alteration. Consequently, they can provide information about grain accretion in the comet-forming region of the outer solar nebula. We have previously reported our comparative study of the sizes and size distributions of crystalline silicate and sulfide grains in CP IDPs, in which we found these components exhibit a size-density relationship consistent with having been sorted together prior to accretion. Here we extend our data set and include GEMS (glass with embedded metal and sulfide), the most abundant amorphous silicate phase observed in CP IDPs. We find that while the silicate and sulfide sorting trend previously observed is maintained, the GEMS size data do not exhibit any clear relationship to these crystalline components. Therefore, GEMS do not appear to have been sorted with the silicate and sulfide crystals. The disparate sorting trends observed in GEMS and the crystalline grains in CP IDPs present an interesting challenge for modeling early transport and accretion processes. They may indicate that several sorting mechanisms operated on these CP IDP components, or alternatively, they may simply be a reflection of different source environments.

79 ASTRONOMY AND ASTROPHYSICS↗

TH-EF-BRA-06: A Novel Retrospective 3D K-Space Sorting 4D-MRI Technique Using a Radial K-Space Acquisition MRI Sequence

Purpose: Current retrospective 4D-MRI provides superior tumor-to-tissue contrast and accurate respiratory motion information for radiotherapy motion management. The developed 4D-MRI techniques based on 2D-MRI image sorting require a high frame-rate of the MR sequences. However, several MRI sequences provide excellent image quality but have low frame-rate. This study aims at developing a novel retrospective 3D k-space sorting 4D-MRI technique using radial k-space acquisition MRI sequences to improve 4D-MRI image quality and temporal-resolution for imaging irregular organ/tumor respiratory motion. Methods: The method is based on a RF-spoiled, steady-state, gradient-recalled sequence with minimal echo time. A 3D radial k-space data acquisition trajectory was used for sampling the datasets. Each radial spoke readout data line starts from the 3D center of Field-of-View. Respiratory signal can be extracted from the k-space center data point of each spoke. The spoke data was sorted based on its self-synchronized respiratory signal using phase sorting. Subsequently, 3D reconstruction was conducted to generate the time-resolved 4D-MRI images. As a feasibility study, this technique was implemented on a digital human phantom XCAT. The respiratory motion was controlled by an irregular motion profile. To validate using k-space center data as a respiratory surrogate, we compared it with the XCAT input controlling breathing profile. Tumor motion trajectories measured on reconstructed 4D-MRI were compared to the average input trajectory. The mean absolute amplitude difference (D) was calculated. Results: The signal extracted from k-space center data matches well with the input controlling respiratory profile of XCAT. The relative amplitude error was 8.6% and the relative phase error was 3.5%. XCAT 4D-MRI demonstrated a clear motion pattern with little serrated artifacts. D of tumor trajectories was 0.21mm, 0.23mm and 0.23mm in SI, AP and ML directions, respectively. Conclusion: A novel retrospective 3D k-space sorting 4D-MRI technique has been developed and evaluated on human digital phantom. NIH (1R21CA165384-01A1)

60 APPLIED LIFE SCIENCES↗

High-throughput single-cell sorting by stimulated Raman-activated cell ejection

Raman-activated cell sorting isolates single cells in a nondestructive and label-free manner, but its throughput is limited by small spontaneous Raman scattering cross section. Coherent Raman scattering integrated with microfluidics enables high-throughput cell analysis, but faces challenges with small cells (<3 μm) and tissue sections. Here, we report stimulated Raman-activated cell ejection (S-RACE) that enables high-throughput single-cell sorting by integrating stimulated Raman imaging, in situ image decomposition, and laser-induced cell ejection. S-RACE allows ejection of live bacteria or fungi guided by their Raman signatures. Furthermore, S-RACE successfully sorted lipid-richRhodotorula glutiniscells from a cell mixture with a throughput of ~13 cells per second, and the sorting results were confirmed by downstream quantitative polymerase chain reaction. Beyond single cells, S-RACE shows high compatibility with tissue sections. Incorporating a closed-loop feedback control circuit further enables real-time SRS imaging-identification-ejection. In summary, S-RACE opens exciting opportunities for diverse single-cell sorting applications.

Science & Technology - Other Topics↗

Flexible File Sort Utility

This program sorts a text file alphabetically (forward or reverse). It supports both in-memory sorts for smaller files and use of temporary swap files for large files. It can alternatively sort on a column in a tab-delimited or comma-separated file. The column sort mode also supports numeric sorting.

Monroe, Matthew↗

Derivation of sorting programs

Program synthesis for critical applications has become a viable alternative to program verification. Nested resolution and its extension are used to synthesize a set of sorting programs from their first order logic specifications. A set of sorting programs, such as, naive sort, merge sort, and insertion sort, were successfully synthesized starting from the same set of specifications.

Varghese, Joseph↗

Data parallel sorting for particle simulation

Sorting on a parallel architecture is a communications intensive event which can incur a high penalty in applications where it is required. In the case of particle simulation, only integer sorting is necessary, and sequential implementations easily attain the minimum performance bound of O (N) for N particles. Parallel implementations, however, have to cope with the parallel sorting problem which, in addition to incurring a heavy communications cost, can make the minimun performance bound difficult to attain. This paper demonstrates how the sorting problem in a particle simulation can be reduced to a merging problem, and describes an efficient data parallel algorithm to solve this merging problem in a particle simulation. The new algorithm is shown to be optimal under conditions usual for particle simulation, and its fieldwise implementation on the Connection Machine is analyzed in detail. The new algorithm is about four times faster than a fieldwise implementation of radix sort on the Connection Machine.

Dagum, Leonardo↗

Material sorting system

A material sorting system sorts materials, such as scrap pieces composed of unknown metal alloys, as a function of their detected x-ray fluorescence. The x-ray fluorescence may be converted into an elemental composition signature that is then compared to an elemental composition signature of a reference material in order to identify and/or classify each of the materials, which are then sorted into separate groups based on such an identification/classification. The material sorting system may include an in-line x-ray tube having a plurality of separate x-ray sources, each of which can irradiate a separate stream of materials to be sorted.

36 MATERIALS SCIENCE↗

Material sorting using a vision system

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. The material sorting system may include an x-ray fluorescence system to perform a classification of the materials in combination with the vision system, whereby the classification efforts of the vision system and x-ray fluorescence system are combined in order to classify and sort the materials.

Kumar, Nalin↗

Alloy selective optical sorting of mixed post-consumer aluminum scrap streams

Shredded post-consumer non-ferrous scrap stream, also known as Zorba, contains a mixture of cast and wrought aluminum pieces with very different compositions. Cast Al pieces, with their high Si, Cu and Fe content, are a major contaminant in wrought scrap fraction, which results in downcycling of the mixed cast + wrought scrap into non-structural cast Al alloys and parts. Here, in this paper, we introduce a chemical treatment method to color-code scrap aluminum pieces by alloy family and demonstrate low-cost optical sorting of cast from wrought pieces to upgrade the scrap stream. We utilized non-acidic chemical solutions that react with (i.e., etch) the scrap pieces to produce colors based on the Al alloy chemistry of a given piece. Cast pieces with high Si and Cu fractions turned black, whereas the much leaner wrought pieces remained unreacted. We showed > 95% sorting efficiency of mixed cast and wrought pieces using a repurposed low-cost optical sorter originally designed for food sorting. We also colored wrought Al pieces by alloy families, such as 5xxx and 6xxx, using a two-step chemical etching technique, which has the potential to create a circular supply chain in which wrought aluminum alloys are sorted from the mixed scrap stream and recycled back to high-value wrought products such as sheets, extrusions, and forgings with minimal contamination from cast scrap.

Aluminum↗

Self–Sorting of 10–µm–Long Single–Walled Carbon Nanotubes in Aqueous Solution

Single-walled carbon nanotubes (SWCNTs) are a class of 1D nanomaterials that exhibit extraordinary electrical and optical properties. However, many of the fundamental studies and practical applications are stymied by sample polydispersity. SWCNTs are synthesized in bulk with broad structural (chirality) and geometrical (length and diameter) distributions; problematically, all known post-synthetic sorting methods rely on ultrasonication, which cuts SWCNTs into short segments (typically <1 μm). Here it is demonstrated that ultralong (>10 μm) SWCNTs can be efficiently separated from the shorter ones through a solution-phase “self-sorting.” It is shown that thin film transistors fabricated from long semiconducting SWCNTs exhibit a carrier mobility as high as ≈90 cm 2 V –1 s –1 , which is ≈10 times higher than the shorter counterparts and well exceeding other known materials such as organic semiconducting polymers (<1 cm 2 V –1 s –1 ), amorphous silicon (≈1 cm 2 V –1 s –1 ), and nanocrystalline silicon (≈50 cm 2 V –1 s –1 ). Mechanistic studies suggest that this self-sorting relies on the equilibrium between isotropic and liquid crystalline SWCNT phases, which is driven by the solution phase behavior above the cloud point of the isotropic phase, and inversely scales with the SWCNT length. Furthermore, this length-dependent self-sorting technique opens a path to attain the long- sought ultralong, electronically pure carbon nanotube materials through scalable solution processing.

36 MATERIALS SCIENCE↗

A Fundamental Frequency Sorting Algorithm for Capacitor Voltage Balance of Modular Multilevel Converter With Low-Frequency Carrier Phase Shift Modulation

This paper proposes a fundamental frequency sorting algorithm for balancing the floating capacitors in modular multilevel converters with low-frequency carrier phase shift modulation. The relationship between the driving pulses and submodules (SMs) is rebuilt in every fundamental period by sorting the voltage increments and present voltages. Besides, an improved and simplified strategy is proposed to predict the charging abilities of the driving pulses, so as to avoid sorting the voltage increments. Based on the proposed method, the switching frequency of each power device and the carrier frequency are identical, which reduces the operational losses for applications regarding high power. At the same time, the sorting frequency is as low as the fundamental frequency, which alleviates a large amount of computational cost, and the necessity to measure arm currents is omitted. In this case, the arm current sensors are eliminated, and simplified communication among the central controller and the local ones is set up. Finally, a three-phase 1-MVA simulation platform with 120 SMs and a down-scaled 6-kVA experimental prototype with 48 SMs are constructed to validate the proposed approach.

42 ENGINEERING↗

The Power of Exclusion using Automated Osteometric Sorting: Pair‐Matching,

Abstract This study compares the original pair‐matching osteometric sorting model ( J Forensic Sci 2003 ;48:717) against two new models providing validation and performance testing across three samples. The samples include the Forensic Data Bank, USS Oklahoma , and the osteometric sorting reference used within the Defense POW / MIA Accounting Agency. A computer science solution to generating dynamic statistical models across a commingled assemblage is presented. The issue of normality is investigated showing the relative robustness against non‐normality and a data transformation to control for normality. A case study is provided showing the relative exclusion power of all three models from an active commingled case within the Defense POW / MIA Accounting Agency. In total, 14,357,220 osteometric t ‐tests were conducted. The results indicate that osteometric sorting performs as expected despite reference samples deviating from normality. The two new models outperform the original, and one of those is recommended to supersede the original for future osteometric sorting work.

Lynch, Jeffrey James↗

SU-D-18C-01: A Novel 4D-MRI Technology Based On K-Space Retrospective Sorting

Purpose: Current 4D-MRI techniques lack sufficient temporal/spatial resolution and consistent tumor contrast. To overcome these limitations, this study presents the development and initial evaluation of an entirely new framework of 4D-MRI based on k-space retrospective sorting. Methods: An important challenge of the proposed technique is to determine the number of repeated scans(NR) required to obtain sufficient k-space data for 4D-MRI. To do that, simulations using 29 cancer patients' respiratory profiles were performed to derive the relationship between data acquisition completeness(Cp) and NR, also relationship between NR(Cp=95%) and the following factors: total slice(NS), respiratory phase bin length(Lb), frame rate(fr), resolution(R) and image acquisition starting-phase(P0). To evaluate our technique, a computer simulation study on a 4D digital human phantom (XCAT) were conducted with regular breathing (fr=0.5Hz; R=256×256). A 2D echo planer imaging(EPI) MRI sequence were assumed to acquire raw k-space data, with respiratory signal and acquisition time for each k-space data line recorded simultaneously. K-space data was re-sorted based on respiratory phases. To evaluate 4D-MRI image quality, tumor trajectories were measured and compared with the input signal. Mean relative amplitude difference(D) and cross-correlation coefficient(CC) are calculated. Finally, phase-sharing sliding window technique was applied to investigate the feasibility of generating ultra-fast 4D-MRI. Result: Cp increased with NR(Cp=100*[1-exp(-0.19*NR)], when NS=30, Lb=100%/6). NR(Cp=95%) was inversely-proportional to Lb (r=0.97), but independent of other factors. 4D-MRI on XCAT demonstrated highly accurate motion information (D=0.67%, CC=0.996) with much less artifacts than those on image-based sorting 4D-MRI. Ultra-fast 4D-MRI with an apparent temporal resolution of 10 frames/second was reconstructed using the phase-sharing sliding window technique. Conclusions: A novel 4D-MRI technology based on k-space sorting has been successfully developed and evaluated on the digital phantom. Framework established can be applied to a variety of MR sequences, showing great promises to develop the optimal 4D-MRI technique for many radiation therapy applications. NIH (1R21CA165384-01A1)

60 APPLIED LIFE SCIENCES↗

T2-weighted four dimensional magnetic resonance imaging with result-driven phase sorting

Purpose: T2-weighted MRI provides excellent tumor-to-tissue contrast for target volume delineation in radiation therapy treatment planning. This study aims at developing a novel T2-weighted retrospective four dimensional magnetic resonance imaging (4D-MRI) phase sorting technique for imaging organ/tumor respiratory motion. Methods: A 2D fast T2-weighted half-Fourier acquisition single-shot turbo spin-echo MR sequence was used for image acquisition of 4D-MRI, with a frame rate of 2–3 frames/s. Respiratory motion was measured using an external breathing monitoring device. A phase sorting method was developed to sort the images by their corresponding respiratory phases. Besides, a result-driven strategy was applied to effectively utilize redundant images in the case when multiple images were allocated to a bin. This strategy, selecting the image with minimal amplitude error, will generate the most representative 4D-MRI. Since we are using a different image acquisition mode for 4D imaging (the sequential image acquisition scheme) with the conventionally used cine or helical image acquisition scheme, the 4D dataset sufficient condition was not obviously and directly predictable. An important challenge of the proposed technique was to determine the number of repeated scans (N{sub R}) required to obtain sufficient phase information at each slice position. To tackle this challenge, the authors first conducted computer simulations using real-time position management respiratory signals of the 29 cancer patients under an IRB-approved retrospective study to derive the relationships between N{sub R} and the following factors: number of slices (N{sub S}), number of 4D-MRI respiratory bins (N{sub B}), and starting phase at image acquisition (P{sub 0}). To validate the authors’ technique, 4D-MRI acquisition and reconstruction were simulated on a 4D digital extended cardiac-torso (XCAT) human phantom using simulation derived parameters. Twelve healthy volunteers were involved in an IRB-approved study to investigate the feasibility of this technique. Results: 4D data acquisition completeness (C{sub p}) increases as NR increases in an inverse-exponential fashion (C{sub p} = 100 − 99 × exp(−0.18 × N{sub R}), when N{sub B} = 6, fitted using 29 patients’ data). The N{sub R} required for 4D-MRI reconstruction (defined as achieving 95% completeness, C{sub p} = 95%, N{sub R} = N{sub R,95}) is proportional to N{sub B} (N{sub R,95} ∼ 2.86 × N{sub B}, r = 1.0), but independent of N{sub S} and P{sub 0}. Simulated XCAT 4D-MRI showed a clear pattern of respiratory motion. Tumor motion trajectories measured on 4D-MRI were comparable to the average input signal, with a mean relative amplitude error of 2.7% ± 2.9%. Reconstructed 4D-MRI for healthy volunteers illustrated clear respiratory motion on three orthogonal planes, with minimal image artifacts. The artifacts were presumably caused by breathing irregularity and incompleteness of data acquisition (95% acquired only). The mean relative amplitude error between critical structure trajectory and average breathing curve for 12 healthy volunteers is 2.5 ± 0.3 mm in superior–inferior direction. Conclusions: A novel T2-weighted retrospective phase sorting 4D-MRI technique has been developed and successfully applied on digital phantom and healthy volunteers.

60 APPLIED LIFE SCIENCES↗

Sorting on STAR

Timing comparisons are given for three sorting algorithms written for the CDC STAR computer. One algorithm is Hoare's (1962) Quicksort, which is the fastest or nearly the fastest sorting algorithm for most computers. A second algorithm is a vector version of Quicksort that takes advantage of the STAR's vector operations. The third algorithm is an adaptation of Batcher's (1968) sorting algorithm, which makes especially good use of vector operations but has a complexity of N(log N)-squared as compared with a complexity of N log N for the Quicksort algorithms. In spite of its worse complexity, Batcher's sorting algorithm is competitive with the serial version of Quicksort for vectors up to the largest that can be treated by STAR. Vector Quicksort outperforms the other two algorithms and is generally preferred. These results indicate that unusual instruction sets can introduce biases in program execution time that counter results predicted by worst-case asymptotic complexity analysis.

Stone, H. S.↗

Algorithm Sorts Groups Of Data

For efficient sorting, algorithm finds set containing minimum or maximum most significant data. Sets of data sorted as desired. Sorting process simplified by reduction of each multielement set of data to single representative number. First, each set of data expressed as polynomial with suitably chosen base, using elements of set as coefficients. Most significant element placed in term containing largest exponent. Base selected by examining range in value of data elements. Resulting series summed to yield single representative number. Numbers easily sorted, and each such number converted back to original set of data by successive division. Program written in BASIC.

Evans, J. D.↗