Results 41 to 50 of about 520,046 (284)
DNA Switching Circuits Based on Binary Tree
Switching circuits provide an interesting strategy for modularization construction of digital computing. Multi-step reactions on DNA origami template are essentially the same as switching circuits.
Zhao Chen +4 more
doaj +1 more source
Spanning tree size in Random Binary Search Trees
This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal distribution.
Panholzer, Alois, Prodinger, Helmut
core +3 more sources
Stabilization of L‐PBF Ni50.7Ti49.3 under low‐cycle loading was investigated. Recoverable strain after cycling was dependent on the amount of applied load. Recovery ratio was 53.4% and 35.1% at intermediate and high load, respectively. The maximum total strain reached 10.3% at a high load of 1200 MPa.
Ondřej Červinek +5 more
wiley +1 more source
A Comparison of the Use of Binary Decision Trees and Neural Networks in Top Quark Detection
The use of neural networks for signal vs.~background discrimination in high-energy physics experiment has been investigated and has compared favorably with the efficiency of traditional kinematic cuts.
D. E. Rumelhart +8 more
core +2 more sources
A combined finite element and phase‐field approach predicts the evolution of microstructure during the directional solidification of Ni‐based superalloys. The model reveals how withdrawal rate, temperature gradient, and wall thickness control the dendrite spacing, highlighting the strong effect of surface regions in thin sections where dendrite growth ...
Sean Böhm +3 more
wiley +1 more source
Based on the vectorised and cache optimised kernel, a parallel lower upper decomposition with a novel communication avoiding pivoting scheme is developed to solve dense complex matrix equations generated by the method of moments.
Yan Chen +4 more
doaj +1 more source
Generation of optimal binary split trees [PDF]
A binary split tree is a search structure combining features of heaps and binary search trees. Building an optimal binary split tree was originally conjectured to be intractable due to difficulties in applying dynamic programming techniques to the ...
Hester, J. H., Hirschbery, D. S.
core +1 more source
High-Performance Architecture for Binary-Tree-Based Finite State Machines [PDF]
A binary-tree-based finite state machine (BT-FSM) is a state machine with a 1-bit input signal whose state transition graph is a binary tree. BT-FSMs are useful in those application areas where searching in a binary tree is required, such as computer
García Vargas, Ignacio +1 more
core
The algebra of binary search trees
49 ...
Hivert, Florent +2 more
openaire +3 more sources
The wettability of aluminum droplets (Al) on different copper substrates (Cu), where liquid Al spreads on solid Cu surfaces to form a liquid–solid interface, is studied numerically and experimentally. The experimental and numerical results show good agreement in the fast‐spreading regime.
Shan Lyu +8 more
wiley +1 more source

