Related papers: The SISCone jet algorithm optimised for low partic…
We describe Ccluster, a software for computing natural $\epsilon$-clusters of complex roots in a given box of the complex plane. This algorithm from Becker et al.~(2016) is near-optimal when applied to the benchmark problem of isolating all…
In this work we propose a simple and easily parallelizable algorithm for multiway graph partitioning. The algorithm alternates between three basic components: diffusing seed vertices over the graph, thresholding the diffused seeds, and then…
This paper presents a kind of effective synchronization clustering method based on a linearized version of Vicsek model. This method can be represented by an Effective Synchronization Clustering algorithm (ESynC), an Improved version of…
A distributed spiral algorithm for distributed optimization in WSN is proposed. By forming a spiral-shape message passing scheme among clusters, without loss of estimation accuracy and convergence speed, the algorithm is proved to converge…
We study the factorization of the dijet cross section in $e^+ e^-$ annihilation using the generalized exclusive jet algorithm which includes the cone-type, the JADE, the $k_T$, the anti-$k_T$ and the Cambridge/Aachen jet algorithms as…
We consider programmable matter that consists of computationally limited devices (called particles) that are able to self-organize in order to achieve some collective goal without the need for central control or external intervention. We…
As a kind of basic machine learning method, clustering algorithms group data points into different categories based on their similarity or distribution. We present a clustering algorithm by finding hyper-planes to distinguish the data…
When calculating satellite trajectories in low-earth orbit, engineers need to adequately estimate aerodynamic forces. But to this day, obtaining the drag acting on the complicated shapes of modern spacecraft suffers from many sources of…
Particle swam optimization (PSO) is a popular stochastic optimization method that has found wide applications in diverse fields. However, PSO suffers from high computational complexity and slow convergence speed. High computational…
Process monitoring and control requires detection of structural changes in a data stream in real time. This article introduces an efficient sequential Monte Carlo algorithm designed for learning unknown changepoints in continuous time. The…
In this paper, we describe the deep sparse coding network (SCN), a novel deep network that encodes intermediate representations with nonnegative sparse coding. The SCN is built upon a number of cascading bottleneck modules, where each…
This paper proposes a simple, automatic and efficient clustering algorithm, namely, Automatic Merging for Optimal Clusters (AMOC) which aims to generate nearly optimal clusters for the given datasets automatically. The AMOC is an extension…
The cascade training technique which was developed during our work on the MiniBooNE particle identification has been found to be a very efficient way to improve the selection performance, especially when very low background contamination…
The particle swarm approach provides a low complexity solution to the optimization problem among various existing heuristic algorithms. Recent advances in the algorithm resulted in improved performance at the cost of increased computational…
The problem of estimating the number of clusters (say k) is one of the major challenges for the partitional clustering. This paper proposes an algorithm named k-SCC to estimate the optimal k in categorical data clustering. For the…
The Stokeslet and stresslet kernels are commonly used in boundary element simulations and singularity methods for slow viscous flow. Evaluating the velocity induced by a collection of Stokeslets and stresslets by direct summation requires…
Processes involving narrow jets receive perturbative corrections enhanced by logarithms of the jet opening angle and the ratio of the energies inside and outside the jets. Analyzing cone-jet processes in effective field theory, we find that…
In several jetted AGNs, structured jets have been observed. In particular spine-sheath configurations where the jet is radially divided into two or more zones of different flow velocities. We present a model based on the particle and…
A systematic framework for jet definition is developed from first principles of physical measurement, quantum field theory, and QCD. A jet definition is found which: is theoretically optimal in regard of both minimization of detector errors…
This work introduces a simple and efficient linesearch method for composite minimization that accelerates proximal-gradient iterations with fast Newton-type directions. Our algorithm is based on simple operations and only requires the…