相关论文: A Chiral Phase Transition using a Fermion Cluster …

A new depth-based clustering procedure for directional data is proposed. Such method is fully non-parametric and has the advantages to be flexible and applicable even in high dimensions when a suitable notion of depth is adopted. The…

The mean shift algorithm is a popular way to find modes of some probability density functions taking a specific kernel-based shape, used for clustering or visual tracking. Since its introduction, it underwent several practical improvements…

Using the monomer-dimer representation of strongly coupled U(N) lattice gauge theories with staggered fermions, we study finite temperature chiral phase transitions in (2+1) dimensions. A new cluster algorithm allows us to compute…

In order to develop fast inversion algorithms we have used overlap solvers in two dimensions. Lattice QED theory with U(1) group symmetry in two dimensional space-times dimensions has always been a testing ground for algorithms. By the…

This paper proposes an early detection method for cluster structural changes. Cluster structure refers to discrete structural characteristics, such as the number of clusters, when data are represented using finite mixture models, such as…

This paper comprehensively surveys the development of trajectory clustering. Considering the critical role of trajectory data mining in modern intelligent systems for surveillance security, abnormal behavior detection, crowd behavior…

This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…

Algorithms for clustering points in metric spaces is a long-studied area of research. Clustering has seen a multitude of work both theoretically, in understanding the approximation guarantees possible for many objective functions such as…

QCD with N_f=2 is a specially interesting system to investigate the chiral transition. The order of the transition has still not been established. We report the results of an in-depth numerical investigation performed with staggered…

Tempering is used to change the quark mass while remaining in equilibrium between the trajectories of a standard hybrid Monte Carlo simulation of four flavours of staggered fermions. The algorithm is faster for small enough quark masses,…

A scheme for the implementation of the cluster state model of quantum computing in optical fibers, which enables the feedforward feature, is proposed. This scheme uses the time-bin encoding of qubits. Following previously suggested methods…

Industrial transfer learning increases the adaptability of deep learning algorithms towards heterogenous and dynamic industrial use cases without high manual efforts. The appropriate selection of what to transfer can vastly improve a…

Pyramidal clustering method generalizes hierarchies by allowing non-disjoint classes at a given level instead of a partition. Moreover, the clusters of the pyramid are intervals of a total order on the set being clustered. [Diday 1984],…

Clustering is one of the most crucial problems in unsupervised learning, and the well-known $k$-means clustering algorithm has been shown to be implementable on a quantum computer with a significant speedup. However, many clustering…

This paper extends the blurring mean shift algorithm from vector-valued data to functional data, enabling effective clustering in infinite-dimensional settings without requiring specification of the number of clusters. To address the…

We study a strongly correlated fermionic model with attractive interactions in the presence of disorder in two spatial dimensions. Our model has been designed so that it can be solved using the recently discovered meron-cluster approach.…

The characteristics of the chiral phase transition are analyzed within the framework of chiral quark models with nonlocal interactions in the mean field approximation. In the chiral limit, we develop a semi-analytic framework which allows…

The reasons for the feasibility of the Microcanonical Fermionic Average ($MFA$) approach to lattice gauge theory with dynamical fermions are discussed. We then present a new exact algorithm, which is free from systematic errors and…

Determining the number of clusters is a fundamental issue in data clustering. Several algorithms have been proposed, including centroid-based algorithms using the Euclidean distance and model-based algorithms using a mixture of probability…

We discuss the adaptation of the Hybrid Monte Carlo algorithm to overlap fermions. We derive a method which can be used to account for the delta function in the fermionic force caused by the differential of the sign function. We discuss the…