On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks

1995 ◽  
pp. 255-266 ◽  
Author(s):  
J. Hromkovič ◽  
K. Loryś ◽  
P. Kanarek ◽  
R. Klasing ◽  
W. Unger ◽  
...  
Keyword(s):  
Bounded Degree ◽  
Efficient Simulation ◽  
Permutation Networks

scholarly journals On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks

2009 ◽  
Vol 23 (3) ◽  
pp. 1612-1645
Author(s):  
Juraj Hromkovič ◽  
PrzemysŁawa Kanarek ◽  
Ralf Klasing ◽  
Krzysztof Loryś ◽  
Walter Unger ◽  
...  
Keyword(s):  
Bounded Degree ◽  
Efficient Simulation ◽  
Permutation Networks

Reconstruction of complex shaped crack from ECT signals based on a fast forward solver using an advanced multi-media element

2020 ◽  
Vol 64 (1-4) ◽  
pp. 621-629
Author(s):  
Yingsong Zhao ◽  
Cherdpong Jomdecha ◽  
Shejuan Xie ◽  
Zhenmao Chen ◽  
Pan Qi ◽  
...  
Keyword(s):  
Coefficient Matrix ◽  
Crack Edge ◽  
Numerical Accuracy ◽  
Gauss Point ◽  
Current Testing ◽  
Efficient Simulation ◽  
Shaped Crack ◽  
Multi Media ◽  
Profile Reconstruction ◽  
Crack Profile

In this paper, the conventional database type fast forward solver for efficient simulation of eddy current testing (ECT) signals is upgraded by using an advanced multi-media finite element (MME) at the crack edge for treating inversion of complex shaped crack. Because the analysis domain is limited at the crack region, the fast forward solver can significantly improve the numerical accuracy and efficiency once the coefficient matrices of the MME can be properly calculated. Instead of the Gauss point classification, a new scheme to calculate the coefficient matrix of the MME is proposed and implemented to upgrade the ECT fast forward solver. To verify its efficiency and the feasibility for reconstruction of complex shaped crack, several cracks were reconstructed through inverse analysis using the new MME scheme. The numerical results proved that the upgraded fast forward solver can give better accuracy for simulating ECT signals, and consequently gives better crack profile reconstruction.

scholarly journals Advanced soft robot modeling in ChainQueen

Robotica ◽  
2021 ◽  
pp. 1-31
Author(s):  
Andrew Spielberg ◽  
Tao Du ◽  
Yuanming Hu ◽  
Daniela Rus ◽  
Wojciech Matusik
Keyword(s):  
Application Programming Interface ◽  
Material Point ◽  
Soft Robotics ◽  
Soft Robot ◽  
Inference Control ◽  
Simulation And Optimization ◽  
Efficient Simulation ◽  
Application Programming ◽  
Robot Modeling ◽  
Programming Interface

Abstract We present extensions to ChainQueen, an open source, fully differentiable material point method simulator for soft robotics. Previous work established ChainQueen as a powerful tool for inference, control, and co-design for soft robotics. We detail enhancements to ChainQueen, allowing for more efficient simulation and optimization and expressive co-optimization over material properties and geometric parameters. We package our simulator extensions in an easy-to-use, modular application programming interface (API) with predefined observation models, controllers, actuators, optimizers, and geometric processing tools, making it simple to prototype complex experiments in 50 lines or fewer. We demonstrate the power of our simulator extensions in over nine simulated experiments.

scholarly journals A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 164
Author(s):  
Tobias Rupp ◽  
Stefan Funke
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Real World ◽  
Road Network ◽  
Upper And Lower Bounds ◽  
Bounded Degree ◽  
Shortest Path Routing ◽  
Graph Classes ◽  
Speed Up ◽  
To Come

We prove a Ω(n) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing. Our construction is based on a graph family not too far from subgraphs that occur in real-world road networks, in particular, it is planar and has a bounded degree. Additionally, we borrow ideas from our lower bound proof to come up with instance-based lower bounds for concrete road network instances of moderate size, reaching up to 96% of an upper bound given by a constructed CH. For a variant of our instance-based schema applied to some special graph classes, we can even show matching upper and lower bounds.

Sign in / Sign up

Export Citation Format

Share Document