Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Convex hull”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

RhizoVision Explorer: open-source software for root image analysis and measurement standardization

Abstract Roots are central to the function of natural and agricultural ecosystems by driving plant acquisition of soil resources and influencing the carbon cycle. Root characteristics like length, diameter and volume are critical to measure to understand plant and soil functions. RhizoVision Explorer is an open-source software designed to enable researchers interested in roots by providing an easy-to-use interface, fast image processing and reliable measurements. The default broken roots mode is intended for roots sampled from pots and soil cores, washed and typically scanned on a flatbed scanner, and provides measurements like length, diameter and volume. The optional whole root mode for complete root systems or root crowns provides additional measurements such as angles, root depth and convex hull. Both modes support providing measurements grouped by defined diameter ranges, the inclusion of multiple regions of interest and batch analysis. RhizoVision Explorer was successfully validated against ground truth data using a new copper wire image set. In comparison, the current reference software, the commercial WinRhizo™, drastically underestimated volume when wires of different diameters were in the same image. Additionally, measurements were compared with WinRhizo™ and IJ_Rhizo using a simulated root image set, showing general agreement in software measurements, except for root volume. Finally, scanned root image sets acquired in different labs for the crop, herbaceous and tree species were used to compare results from RhizoVision Explorer with WinRhizo™. The two software showed general agreement, except that WinRhizo™ substantially underestimated root volume relative to RhizoVision Explorer. In the current context of rapidly growing interest in root science, RhizoVision Explorer intends to become a reference software, improve the overall accuracy and replicability of root trait measurements and provide a foundation for collaborative improvement and reliable access to all.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Machine learning-accelerated discovery of iron cobalt phosphides as rare-earth-free magnets

Here, the discovery of rare-earth-free permanent magnets has been a goal of scientists for decades. The absence of rare-earth elements will alleviate a pressing concern about the availability of rare-earth elements used in permanent magnets. These magnets are crucial for applications such as wind turbines, electric cars, and memory devices. Rare-earth magnets are special owing to a large magnetic anisotropy energy (K 1 ). In contrast, iron cobalt phosphides hold promise since doping P into cubic FeCo can induce anisotropy, leading to a large coercivity, without introducing rare-earth elements. We present a comprehensive search over the Fe-Co-P ternary space for magnets, utilizing recently developed adaptive machine learning feedback to efficiently screen over 850 000 structures. We focus on machine learning acceleration as a paradigm for materials design. Further adaptive genetic algorithm searches and first-principles calculations aid in the identification of 16 new structures below the known convex hull. Five of them possess high magnetic polarization (J s > 1 T). The structures with desirable magnetic properties center on (Fe,Co) 2⁢ P. This supports conventional wisdom, which focuses on the mixture of the two known end compounds: Fe 2 ⁢P and Co 2 ⁢P. Our work provides guidance for synthesis. We find Fe 7 ⁢CoP 4 shows the most promise (J s = 1.03T and K 1 = 0.83MJ/m 3 ).

36 MATERIALS SCIENCE↗
DOE OSTI2023

Rethinking the Price Formation Problem–Part 2: Rewarding Flexibility and Managing Price Risk

In this study, part 1 of this two-part paper describes the impact that uncertainty has on the design and analysis of price formation policies in the non-convex auctions conducted by U.S. wholesale electricity market operators. Using first a toy model and then a large-scale test system, Part 2 demonstrates the difference in prices under the idealized benchmark of ex ante convex hull pricing defined in Part 1 versus existing methods, in particular documenting the potential for suppression of volatility and therefore under-compensation of flexibility by existing methods. The examples highlight that inefficient spot price formation can induce inefficient forward commitments of generators, necessitating out-of-market intervention to restore a reliable and efficient operating plan.Given the potential side effects of existing policies for investment and operation, we suggest two elements in a reoriented approach to the price formation problem: first ensuring that prices exhibit full-strength volatility, and second ensuring that risk-averse market participants have sufficient ability to manage this volatility.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

RhizoNet: semantic segmentation of plant roots using CNN (RhizoNet) v0.0.1

RhizoNet is designed for the semantic segmentation of plant root scans, utilizing a sophisticated deep learning network known as Residual Unet. It specializes in processing color images of plants cultivated in a hydroponic EcoFAB system, captured using an Epson scanner. The core of the algorithm is based on Residual U-nets, which significantly improve prediction accuracy. This is achieved through the implementation of a convex hull operation, which effectively delineates the primary root component by leveraging spatio-temporal image data. This enables researchers to accurately assess predicted biomass and monitor plant growth over time.

Ushizima, Daniela↗
DOE OSTI2022

Advances in MINLP to Identify Energy-Efficient Distillation Configurations

Separation of mixtures of chemicals, ubiquitous in chemical and petrochemical industries, by distillation is energy intensive. Nearly 3% of the overall energy is used for distillation in the United States. Improving the distillation process is crucial for making chemical industries more sustainable. However, designing distillation sequences is challenging because the choice set is vast, and the equations governing the physical process are highly nonconvex. Traditional design practices rely on heuristics and often result in suboptimal solutions. Tumbalam Gooty et al. present the first approach that reliably identifies the distillation sequence that requires the least energy for a given separation. By embedding convex hulls of substructures and adapting the reformulation-linearization technique to fractions of polynomials, they demonstrated that their approach outperforms the state-of-the-art. Their work will help the chemical industry reduce greenhouse gas emissions associated with distillation.

Business & Economics↗
DOE OSTI2022

GEOMWRITER - A Workflow for Automatically Generating MCNP Geometry for Neutron Guide Simulations

This report describes the functionality of the geomwriter.py script, which is a python script for producing complex MCNP CSG geometries from the IGES CAD format. It is specifically written to handle neutron supermirror guides, but can handle more complex objects through utilizing a convex hull algorithm. This work flow reduces the amount of time spent on generating the surface definitions for a complex neutron guide system with hundreds of segments such that changes to the neutron guide system design in McStas can be rapidly incorporated into an MCNP model and integrated with the shielding geometry present in that model.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Root system architecture and environmental flux analysis in mature crops using 3D root mesocosms

Current methods of root sampling typically only obtain small or incomplete sections of root systems and do not capture their true complexity. To facilitate the visualization and analysis of full-sized plant root systems in 3-dimensions, we developed customized mesocosm growth containers. While highly scalable, the design presented here uses an internal volume of 45 ft 3 (1.27 m 3 ), suitable for large crop and bioenergy grass root systems to grow largely unconstrained. Furthermore, they allow for the excavation and preservation of 3-dimensional root system architecture (RSA), and facilitate the collection of time-resolved subterranean environmental data. Sensor arrays monitoring matric potential, temperature and CO 2 levels are buried in a grid formation at various depths to assess environmental fluxes at regular intervals. Methods of 3D data visualization of fluxes were developed to allow for comparison with root system architectural traits. Following harvest, the recovered root system can be digitally reconstructed in 3D through photogrammetry, which is an inexpensive method requiring only an appropriate studio space and a digital camera. We developed a pipeline to extract features from the 3D point clouds, or from derived skeletons that include point cloud voxel number as a proxy for biomass, total root system length, volume, depth, convex hull volume and solidity as a function of depth. Ground-truthing these features with biomass measurements from manually dissected root systems showed a high correlation. We evaluated switchgrass, maize, and sorghum root systems to highlight the capability for species wide comparisons. We focused on two switchgrass ecotypes, upland (VS16) and lowland (WBC3), in identical environments to demonstrate widely different root system architectures that may be indicative of core differences in their rhizoeconomic foraging strategies. Finally, we imposed a strong physiological water stress and manipulated the growth medium to demonstrate whole root system plasticity in response to environmental stimuli. Hence, these new “3D Root Mesocosms” and accompanying computational analysis provides a new paradigm for study of mature crop systems and the environmental fluxes that shape them.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1976

Timesharing without synchronization

The capacity region of a multiple-access channel has recently been identified as the convex hull (barred K) of a certain set (K) of points in the first quadrant of the (R1,R2) plane. For a pair of rates in K, a more or less standard random-coding argument can be used to show the existence of a good pair of codes. But for points in barred K-K, it is apparently necessary for the two senders to use some form of time sharing to achieve the desired rates. However, in order to share time, at least one of the senders must have knowledge of the other's phase; and in many practical situations this knowledge does not exist. This paper investigates the problems which arise in coding for multiple-access channels when the senders cannot synchronize with each other.

Mceliece, R. J.↗
NASA NTRS1985

Some properties of n-dimensional triangulations

A number of mathematical results relevant to the problem of constructing a triangulation, i.e., a simplicial tessellation, of the convex hull of an arbitrary finite set of points in n-space are described. The principal results achieved are: (1) a set of n+2 points in n-space may be triangulated in at most 2 different ways; (2) the sphere test defined in this report selects a preferred one of these two triangulations; (3) a set of parameters is defined that permits the characterization and enumeration of all sets of n+2 points in n-space that are significantly different from the point of view of their possible triangulation; (4) the local sphere test induces a global sphere test property for a triangulation; and (5) a triangulation satisfying the global sphere property is dual to the n-dimensional Dirichlet tesselation, i.e., it is a Delaunay triangulation.

Lawson, C. L.↗
NASA NTRS1986

Properties of n-dimensional triangulations

This paper establishes a number of mathematical results relevant to the problem of constructing a triangulation, i.e., a simplical tessellation of the convex hull of an arbitrary finite set of points in n-space. The principal results of the present paper are: (1) a set of n + 2 points in n-space may be triangulated in at most 2 different ways; (2) the 'sphere test' defined in this paper selects a preferred one of these two triangulations; (3) a set of parameters is defined that permits the characterization and enumeration of all sets on n + 2 points in n-space that are significantly different from the point of view of their possible triangulations; and (4) the local sphere test induces a global sphere test property for a triangulation.

Lawson, Charles L.↗
NASA NTRS1990

The shape of Eros

Monte Carlo simulations are presently used to optimize estimation, ascertain associated errors, and guide bias-correction procedures, for the Eros polar silhouette convex hull that has been estimated from radar echo spectra. This hull is trapezoidal; this nonaxisymmetric shape may account for odd harmonics in Eros' echo spectral signature as a function of rotation phase. Additional constraints have been obtained for the figure of Eros through the inversion of the optical lightcurve to estimate the asteroid's two-dimensional average of the three-dimensional shape. This 'mean cross-section' and the polar silhouette exhibit similar elongations.

Ostro, S. J.↗
NASA NTRS1991

Surface reconstruction from scattered data through pruning of unstructured grids

This paper describes an algorithm for reconstructing a surface from a randomly digitized object. Scan data (treated as a cloud of points) is first tesselated out to its convex hull using Delaunay triangulation. The line-of-sight between each surface point and the scanning device is traversed, and any tetrahedra which are pierced by it are removed. The remaining tetrahedra form an approximate solid model of the scanned object. Due to the inherently limited resolution of any scan, this algorithm requires two additional procedures to produce a smooth, polyhedral surface: one process removes long, narrow tetrahedra which span indentations in the surface between digitized points; the other smooths sharp edges. The results for a moderately resolved sample body and a highly resolved aircraft are displayed.

Maksymiuk, C. M.↗
NASA NTRS1992

Recursive optimal pruning with applications to tree structured vector quantizers

A pruning algorithm of Chou et al. (1989) for designing optimal tree structures identifies only those codebooks which lie on the convex hull of the original codebook's operational distortion rate function. The authors introduce a modified version of the original algorithm, which identifies a large number of codebooks having minimum average distortion, under the constraint that, in each step, only modes having no descendents are removed from the tree. All codebooks generated by the original algorithm are also generated by this algorithm. The new algorithm generates a much larger number of codebooks in the middle- and low-rate regions. The additional codebooks permit operation near the codebook's operational distortion rate function without time sharing by choosing from the increased number of available bit rates. Despite the statistical mismatch which occurs when coding data outside the training sequence, these pruned codebooks retain their performance advantage over full search vector quantizers (VQs) for a large range of rates.

Kiang, Shei-Zein↗
NASA NTRS1992

Data reduction using cubic rational B-splines

A geometric method is proposed for fitting rational cubic B-spline curves to data that represent smooth curves including intersection or silhouette lines. The algorithm is based on the convex hull and the variation diminishing properties of Bezier/B-spline curves. The algorithm has the following structure: it tries to fit one Bezier segment to the entire data set and if it is impossible it subdivides the data set and reconsiders the subset. After accepting the subset the algorithm tries to find the longest run of points within a tolerance and then approximates this set with a Bezier cubic segment. The algorithm uses this procedure repeatedly to the rest of the data points until all points are fitted. It is concluded that the algorithm delivers fitting curves which approximate the data with high accuracy even in cases with large tolerances.

Chou, Jin J.↗
NASA NTRS1991

Efficient distance calculation using the spherically-extended polytope (s-tope) model

An object representation scheme which allows for Euclidean distance calculation is presented. The object model extends the polytope model by representing objects as the convex hull of a finite set of spheres. An algorithm for calculating distances between objects is developed which is linear in the total number of spheres specifying the two objects.

Hamlin, Gregory J.↗
NASA NTRS1992

Cartography of asteroids and comet nuclei from low resolution data

High resolution images of non-spherical objects, such as Viking images of Phobos and the anticipated Galileo images of Gaspra, lend themselves to conventional planetary cartographic procedures: control network analysis, stereophotogrammetry, image mosaicking in 2D or 3D, and airbrush mapping. There remains the problem of a suitable map projection for bodies which are extremely elongated or irregular in shape. Many bodies will soon be seen at lower resolution (5-30 pixels across the disk) in images from speckle interferometry, the Hubble Space Telescope, ground-based radar, distinct spacecraft encounters, and closer images degraded by smear. Different data with similar effective resolutions are available from stellar occultations, radar or lightcurve convex hulls, lightcurve modeling of albedo variations, and cometary jet modeling. With such low resolution, conventional methods of shape determination will be less useful or will fail altogether, leaving limb and terminator topography as the principal sources of topographic information. A method for shape determination based on limb and terminator topography was developed. It has been applied to the nucleus of Comet Halley and the jovian satellite Amalthea. The Amalthea results are described to give an example of the cartographic possibilities and problems of anticipated data sets.

Stooke, Philip J.↗
NASA NTRS1993

Two generalizations of Kohonen clustering

The relationship between the sequential hard c-means (SHCM), learning vector quantization (LVQ), and fuzzy c-means (FCM) clustering algorithms is discussed. LVQ and SHCM suffer from several major problems. For example, they depend heavily on initialization. If the initial values of the cluster centers are outside the convex hull of the input data, such algorithms, even if they terminate, may not produce meaningful results in terms of prototypes for cluster representation. This is due in part to the fact that they update only the winning prototype for every input vector. The impact and interaction of these two families with Kohonen's self-organizing feature mapping (SOFM), which is not a clustering method, but which often leads ideas to clustering algorithms is discussed. Then two generalizations of LVQ that are explicitly designed as clustering algorithms are presented; these algorithms are referred to as generalized LVQ = GLVQ; and fuzzy LVQ = FLVQ. Learning rules are derived to optimize an objective function whose goal is to produce 'good clusters'. GLVQ/FLVQ (may) update every node in the clustering net for each input vector. Neither GLVQ nor FLVQ depends upon a choice for the update neighborhood or learning rate distribution - these are taken care of automatically. Segmentation of a gray tone image is used as a typical application of these algorithms to illustrate the performance of GLVQ/FLVQ.

Bezdek, James C.↗