2,791 research outputs found
Standardization of Rational BĂ©zier Surfaces
National audienceThe sufficient and necessary condition for the existence of linear Möbius transformations that can standardize the rational Bézier surfaces is given based on Möbius reparameterization theorem. To obtain the standard form of an arbitrary cubic rational Bézier surface, we then present a quadratic reparameterization algorithm to reparameterize the surface so that all the corner weights of the surface are equal to one. Examples are included to show the performance of the new method.
Inducing Effect on the Percolation Transition in Complex Networks
Percolation theory concerns the emergence of connected clusters that
percolate through a networked system. Previous studies ignored the effect that
a node outside the percolating cluster may actively induce its inside
neighbours to exit the percolating cluster. Here we study this inducing effect
on the classical site percolation and K-core percolation, showing that the
inducing effect always causes a discontinuous percolation transition. We
precisely predict the percolation threshold and core size for uncorrelated
random networks with arbitrary degree distributions. For low-dimensional
lattices the percolation threshold fluctuates considerably over realizations,
yet we can still predict the core size once the percolation occurs. The core
sizes of real-world networks can also be well predicted using degree
distribution as the only input. Our work therefore provides a theoretical
framework for quantitatively understanding discontinuous breakdown phenomena in
various complex systems.Comment: Main text and appendices. Title has been change
Studies of Stability and Robustness for Artificial Neural Networks and Boosted Decision Trees
In this paper, we compare the performance, stability and robustness of
Artificial Neural Networks (ANN) and Boosted Decision Trees (BDT) using
MiniBooNE Monte Carlo samples. These methods attempt to classify events given a
number of identification variables. The BDT algorithm has been discussed by us
in previous publications. Testing is done in this paper by smearing and
shifting the input variables of testing samples. Based on these studies, BDT
has better particle identification performance than ANN. The degradation of the
classifications obtained by shifting or smearing variables of testing results
is smaller for BDT than for ANN.Comment: 23 pages, 13 figure
- …