Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational topology”

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 307 records · Page 17

Geometric and topological entropies of sphere packing

Here, we present a statistical mechanical description of randomly packed spherical particles, where the average coordination number is treated as a macroscopic thermodynamic variable. The overall packing entropy is shown to have two contributions: geometric, reflecting statistical weights of individual configurations, and topological, which corresponds to the number of topologically distinct states. Both of them are computed in the thermodynamic limit for isostatic and weakly underconstrained packings in 2D and 3D. The theory generalizes concepts of granular and glassy configurational entropies for the case of nonjammed systems. It is directly applicable to sticky colloids and predicts an asymptotic phase behavior of sticky spheres in the limit of strong binding.

36 MATERIALS SCIENCE↗

C-MOS array design techniques

The entire complement of standard cells and components, except for the set-reset flip-flop, was completed. Two levels of checking were performed on each device. Logic cells and topological layout are described. All the related computer programs were coded and one level of debugging was completed. The logic for the test chip was modified and updated. This test chip served as the first test vehicle to exercise the standard cell complementary MOS(C-MOS) automatic artwork generation capability.

Feller, A.↗

On three dimensional object recognition and pose-determination: An abstraction based approach

A method of computing reliable Gaussian and mean curvature sign-map descriptors from the polynomial approximation of surfaces was demonstrated. Such descriptors which are invariant under perspective variation are suitable for hypothesis generation. A means for determining the pose of constructed geometric forms whose algebraic surface descriptors are nonlinear in terms of their orienting parameters was developed. This was done by means of linear functions which are capable of approximating nonlinear forms and determining their parameters. It was shown that biquadratic surfaces are suitable companion linear forms for cylindrical approximation and parameter estimation. The estimates provided the initial parametric approximations necessary for a nonlinear regression stage to fine tune the estimates by fitting the actual nonlinear form to the data. A hypothesis-based split-merge algorithm for extraction and pose determination of cylinders and planes which merge smoothly into other surfaces was developed. It was shown that all split-merge algorithms are hypothesis-based. A finite-state algorithm for the extraction of the boundaries of run-length regions was developed. The computation takes advantage of the run list topology and boundary direction constraints implicit in the run-length encoding.

Quek, Kok How Francis↗

Recursive flexible multibody system dynamics using spatial operators

This paper uses spatial operators to develop new spatially recursive dynamics algorithms for flexible multibody systems. The operator description of the dynamics is identical to that for rigid multibody systems. Assumed-mode models are used for the deformation of each individual body. The algorithms are based on two spatial operator factorizations of the system mass matrix. The first (Newton-Euler) factorization of the mass matrix leads to recursive algorithms for the inverse dynamics, mass matrix evaluation, and composite-body forward dynamics for the systems. The second (innovations) factorization of the mass matrix, leads to an operator expression for the mass matrix inverse and to a recursive articulated-body forward dynamics algorithm. The primary focus is on serial chains, but extensions to general topologies are also described. A comparison of computational costs shows that the articulated-body, forward dynamics algorithm is much more efficient than the composite-body algorithm for most flexible multibody systems.

Jain, A.↗

Aerodynamic Shape Optimization Based on Free-form Deformation

This paper presents a free-form deformation technique suitable for aerodynamic shape optimization. Because the proposed technique is independent of grid topology, we can treat structured and unstructured computational fluid dynamics grids in the same manner. The proposed technique is an alternative shape parameterization technique to a trivariate volume technique. It retains the flexibility and freedom of trivariate volumes for CFD shape optimization, but it uses a bivariate surface representation. This reduces the number of design variables by an order of magnitude, and it provides much better control for surface shape changes. The proposed technique is simple, compact, and efficient. The analytical sensitivity derivatives are independent of the design variables and are easily computed for use in a gradient-based optimization. The paper includes the complete formulation and aerodynamics shape optimization results.

Samareh, Jamshid A.↗

Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology composed of scheduled, bounded communication contacts in a network built on the Delay-Tolerant Networking (DTN) architecture. It is designed to support operations in a space network based on DTN, but it also could be used in terrestrial applications where operation according to a predefined schedule is preferable to opportunistic communication, as in a low-power sensor network. This paper will describe the operation of the CGR system and explain how it can enable data delivery over scheduled transmission opportunities, fully utilizing the available transmission capacity, without knowing the current state of any bundle protocol node (other than the local node itself) and without exhausting processing resources at any bundle router.

CGR↗

MADE3D: Enabling the Next-Generation High-Torque- Density Wind Generators by Additive Design and 3D Printing

Direct-drive wind turbine generators are increasing in popularity, thanks to recent project developments - especially offshore, where reliability and efficiency are major cost drivers. Yet, high capital costs are forcing many original equipment manufacturers to consider lightweight, high-torque density generators for next-generation multi-megawatt turbines that may be difficult to realize by traditional design or manufacturing methods. In this study, we present a new design framework enabled by advanced machine learning and multimaterial additive manufacturing to perform a magnetic topology optimization that maximizes the torque per rotor active mass for a 15-megawatt direct-drive permanent magnet wind generator. A comparison of the proposed approach against conventional topology optimization demonstrated a significant increase in computational efficiency and accuracy in performance predictions. Results using single and multimaterial compositions for rotor core and magnets identify a wider choice of 3D printable designs for a given specification. A hybrid combination of sintered and dysprosium-free polymer-bonded magnets shows good potential for torque performance by saving material costs up to 8.75%. More than 30% improvement in rotor torque densities is identified which can marginally improve the overall generator torque density. With the rapid evolution of multipowder deposition technologies, this study can greatly inspire a new paradigm for design-driven manufacturing with novel material compositions and lightweight, low-cost, high-strength multimaterial geometries that were previously unexplored for direct-drive generators.

3D printing↗

Computational chaos in massively parallel neural networks

A fundamental issue which directly impacts the scalability of current theoretical neural network models to massively parallel embodiments, in both software as well as hardware, is the inherent and unavoidable concurrent asynchronicity of emerging fine-grained computational ensembles and the possible emergence of chaotic manifestations. Previous analyses attributed dynamical instability to the topology of the interconnection matrix, to parasitic components or to propagation delays. However, researchers have observed the existence of emergent computational chaos in a concurrently asynchronous framework, independent of the network topology. Researcher present a methodology enabling the effective asynchronous operation of large-scale neural networks. Necessary and sufficient conditions guaranteeing concurrent asynchronous convergence are established in terms of contracting operators. Lyapunov exponents are computed formally to characterize the underlying nonlinear dynamics. Simulation results are presented to illustrate network convergence to the correct results, even in the presence of large delays.

Barhen, Jacob↗

Grid generation and inviscid flow computation about aircraft geometries

Grid generation and Euler flow about fighter aircraft are described. A fighter aircraft geometry is specified by an area ruled fuselage with an internal duct, cranked delta wing or strake/wing combinations, canard and/or horizontal tail surfaces, and vertical tail surfaces. The initial step before grid generation and flow computation is the determination of a suitable grid topology. The external grid topology that has been applied is called a dual-block topology which is a patched C (exp 1) continuous multiple-block system where inner blocks cover the highly-swept part of a cranked wing or strake, rearward inner-part of the wing, and tail components. Outer-blocks cover the remainder of the fuselage, outer-part of the wing, canards and extend to the far field boundaries. The grid generation is based on transfinite interpolation with Lagrangian blending functions. This procedure has been applied to the Langley experimental fighter configuration and a modified F-18 configuration. Supersonic flow between Mach 1.3 and 2.5 and angles of attack between 0 degrees and 10 degrees have been computed with associated Euler solvers based on the finite-volume approach. When coupling geometric details such as boundary layer diverter regions, duct regions with inlets and outlets, or slots with the general external grid, imposing C (exp 1) continuity can be extremely tedious. The approach taken here is to patch blocks together at common interfaces where there is no grid continuity, but enforce conservation in the finite-volume solution. The key to this technique is how to obtain the information required for a conservative interface. The Ramshaw technique which automates the computation of proportional areas of two overlapping grids on a planar surface and is suitable for coding was used. Researchers generated internal duct grids for the Langley experimental fighter configuration independent of the external grid topology, with a conservative interface at the inlet and outlet.

Smith, Robert E.↗

Local bilinear computation of Jacobi sets

Abstract We propose a novel method for the computation of Jacobi sets in 2D domains. The Jacobi set is a topological descriptor based on Morse theory that captures gradient alignments among multiple scalar fields, which is useful for multi-field visualization. Previous Jacobi set computations use piecewise linear approximations on triangulations that result in discretization artifacts like zig-zag patterns. In this paper, we utilize a local bilinear method to obtain a more precise approximation of Jacobi sets by preserving the topology and improving the geometry. Consequently, zig-zag patterns on edges are avoided, resulting in a smoother Jacobi set representation. Our experiments show a better convergence with increasing resolution compared to the piecewise linear method. We utilize this advantage with an efficient local subdivision scheme. Finally, our approach is evaluated qualitatively and quantitatively in comparison with previous methods for different mesh resolutions and across a number of synthetic and real-world examples.

97 MATHEMATICS AND COMPUTING↗

Robustness of topological persistence in knowledge distillation for wearable sensor data

Topological data analysis (TDA) has shown great success in various applications involving wearable sensor data. However, there are difficulties in leveraging topological features in machine learning and wearable sensors because of the large time consumption and computational resources required to extract the features. To address this problem, knowledge distillation (KD) is utilized to generate a small model and accommodate topological features with persistence image (PI) representations from the raw time series data. Deploying topological knowledge in KD enables the student to achieve better performance compared to the one trained solely on raw time series data. However, it is not yet known if there are coherent characteristics for topological features in PI, which can aid in improving the performance during KD. In this paper, we investigate the suitability and challenges of utilizing topological features in KD for wearable sensor data, thereby contributing to the advancement of the field. Our study explores the impact of transferred topological features by comparing the Teacher-to-Student framework with Multiple Teachers-to-Student where teachers utilize both time series data and persistence images obtained by TDA as inputs. Additionally, we conduct a rigorous examination of topological knowledge effects by testing under various corruptions, knowledge types, and learning strategies in the context of human activity recognition tasks. Our analysis of topological features in KD presents the optimal strategy for incorporating these features. This study includes datasets of varying scales, window lengths, and activity classes, providing a comprehensive evaluation. Our results demonstrate that leveraging topological features in KD to enhance performance across databases.

97 MATHEMATICS AND COMPUTING↗

3d gravity from Virasoro TQFT: Holography, wormholes and knots

We further develop the description of three-dimensional quantum gravity with negative cosmological constant in terms of Virasoro TQFT formulated in our previous paper [SciPost Phys. 15, 151 (2023)]. We compare the partition functions computed in the Virasoro TQFT formalism to the semiclassical evaluation of Euclidean gravity partition functions. This matching is highly non-trivial, but can be checked directly in some examples. We then showcase the formalism in action, by computing the gravity partition functions of many relevant topologies. For holographic applications, we focus on the partition functions of Euclidean multi-boundary wormholes with three-punctured spheres as boundaries. This precisely quantifies the higher moments of the structure constants in the proposed ensemble boundary dual and subjects the proposal to thorough checks. Finally, we investigate in detail the example of the figure eight knot complement as a hyperbolic 3-manifold. We show that the Virasoro TQFT partition function is identical to the partition function computed in Teichmüller theory, thus giving strong evidence for the equivalence of these TQFTs. We also show how to produce a large class of manifolds via Dehn surgery on the figure eight knot.

Collier, Scott (ORCID:0000000286476653)↗

Substation-Level Grid Topology Optimization Using Bus Splitting

Operations of substation circuit breakers are important for maintenance needs and topology reconfiguration in power systems. Bus splitting is one type of topology change where the two bus bars at a substation can become electrically disconnected under certain actions of circuit breakers. Because these events involve detailed substation modeling, they are typically not considered in routine power system operation and control. In this paper, an improved substation-level topology optimization framework is developed by expanding traditional line switching decisions by breaker-level bus splitting, which can further reduce grid congestion and generation costs. A tight McCormick relaxation is proposed to reformulate the bilinear terms in the resultant optimization problem to linear inequality constraints. Thus, a tractable mixed-integer linear program reformulation is attained that allows for efficient solutions in real-time operations. Numerical studies on the IEEE 14-bus and 118-bus systems demonstrate the computational performance and economic benefits of the proposed topology optimization approach.

bus split↗

Toward improved property prediction of 2D materials using many-body quantum Monte Carlo methods

The field of 2D materials has grown dramatically in the past two decades. 2D materials can be utilized for a variety of next-generation optoelectronic, spintronic, clean energy, and quantum computing applications. These 2D structures, which are often exfoliated from layered van der Waals materials, possess highly inhomogeneous electron densities and can possess short- and long-range electron correlations. The complexities of 2D materials make them challenging to study with standard mean-field electronic structure methods such as density functional theory (DFT), which relies on approximations for the unknown exchange-correlation functional. To overcome the limitations of DFT, highly accurate many-body electronic structure approaches such as diffusion Monte Carlo (DMC) can be utilized. In the past decade, DMC has been used to calculate accurate magnetic, electronic, excitonic, and topological properties in addition to accurately capturing interlayer interactions and cohesion and adsorption energetics of 2D materials. Here, this approach has been applied to 2D systems of wide interest, including graphene, phosphorene, MoS 2 , CrI 3 , VSe 2 , GaSe, GeSe, borophene, and several others. In this review article, we highlight some successful recent applications of DMC to 2D systems for improved property predictions beyond standard DFT.

2D materials↗

Advanced Shuttle Strategies for Parallel QCCD Architectures

Trapped ions (TIs) are at the forefront of quantum computing implementation, offering unparalleled coherence, fidelity, and connectivity. However, the scalability of TI systems is hampered by the limited capacity of individual ion traps, necessitating intricate ion shuttling for advanced computational tasks. The quantum charge-coupled device (QCCD) framework has emerged as a promising solution, facilitating ion mobility for universal quantum computation. Current QCCD architectures predominantly feature a linear topology, which is increasingly recognized as inefficient for complex quantum operations. Anticipating the shift toward more efficacious designs, this article introduces an innovative quantum scheduling strategy optimized for parallel QCCD topologies. Our strategy proposes a probabilistic formula for ion movement, alongside ingenious methods for local layer generation and layer compression, yielding a significant reduction in ion shuttle times. Through simulations, we demonstrate that our strategy not only substantially outstrips the linear model but also exhibits better performance over other parallel strategies that employ greedy algorithms. This is achieved through our nuanced resolution of complexities, such as traffic blocks and trap capacity limitations. The consequent reduction in shuttle operations leads to lower energy consumption and an enhancement in the quantum computer's fidelity, ultimately accelerating program execution times.

43 PARTICLE ACCELERATORS↗

Logic operations with active topological defects

Logic operations performed by semiconductor-based transistors are the basis of modern computing. There is considerable interest in creating autonomous materials systems endowed with the capability to make decisions. In this work, we introduce the concept of using topological defects in active matter to perform logic operations. When an extensile active stress in a nematic liquid crystal is turned on, +1/2 defects can self-propel, in analogy to electron transport under a voltage gradient. By relying on hydrodynamic simulations of active nematics, we demonstrate that patterns of activity, when combined with surfaces imparting certain orientations, can be used to control the formation and transport of +1/2 defects. We further show that asymmetric high- and low-activity patterns can be used to create effective defect gates, tunnels, and amplifiers. The proposed active systems offer the potential to perform computations and transmit information in active soft materials, including actin-, tubulin-, and cell-based systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unitarity cuts of the worldsheet

We compute the imaginary parts of genus-one string scattering amplitudes. Following Witten’s i\varepsilon i ε prescription for the integration contour on the moduli space of worldsheets, we give a general algorithm for computing unitarity cuts of the annulus, Möbius strip, and torus topologies exactly in \alpha' α ′ . With the help of tropical analysis, we show how the intricate pattern of thresholds (normal and anomalous) opening up arises from the worldsheet computation. The result is a manifestly-convergent representation of the imaginary parts of amplitudes, which has the analytic form expected from Cutkosky rules in field theory, but bypasses the need for performing laborious sums over the intermediate states. We use this representation to study various physical aspects of string amplitudes, including their behavior in the (s,t) ( s , t ) plane, exponential suppression, decay widths of massive strings, total cross section, and low-energy expansions. We find that planar annulus amplitudes exhibit a version of low-spin dominance: at any finite energy, only a finite number of low partial-wave spins give an appreciable contribution to the imaginary part.

97 MATHEMATICS AND COMPUTING↗

Level-set topology optimization with PDE generated conformal meshes

This paper presents a level-set topology optimization approach that uses conformal meshes for the analysis of the displacement field. The structure’s boundary is represented by the iso-contour of a level-set field discretized on a fixed background design mesh. The conformal mesh is updated for each design iteration via a PDE based mesh morphing process that identifies the set of facets in the background mesh that are homeomorphic to the boundary and relaxes the homeomorphic mesh to conform to the structure’s boundary and ensure high element quality. The conformal mesh allows for a more accurate computation of the response versus density and some level-set based methods which interpolate material properties using the volume fraction. Numerical examples illustrate the proposed approach by optimizing linear-elastic two- and three-dimensional structures, wherein insight into the performance of the mesh morphing process is provided. The examples also highlight the scalability of the approach.

42 ENGINEERING↗