Related papers: The Cluster Processor: New Results
The FFT of three-dimensional (3D) input data is an important computational kernel of numerical simulations and is widely used in High Performance Computing (HPC) codes running on a large number of processors. Performance of many scientific…
The exact solution of the Ising model on the complete graph (CG) provides an important, though mean-field, insight for the theory of continuous phase transitions. Besides the original spin, the Ising model can be formulated in the…
In this article we create a new algorithm for the perfect simulation of the infinite Potts model at a sufficiently small or at a sufficiently high temperature, in particular under the transition phase temperature. We study the model for…
The equilibrium phase behavior of microphase-forming substances and models is notoriously difficult to obtain because of the extended metastability of the modulated phases. We develop a simulation method based on thermodynamic integration…
We propose a Fourier-based approach for optimization of several clustering algorithms. Mathematically, clusters data can be described by a density function represented by the Dirac mixture distribution. The density function can be smoothed…
The dynamics associated with the time series of the iteration scheme of coupled cluster theory has been analysed. The phase space analysis indicates the presence of a few significant cluster amplitudes, mostly involving valence excitations,…
Clustering analysis of daily load profiles represents an effective technique to classify and aggregate electric users based on their actual consumption patterns. Among other purposes, it may be exploited as a preliminary stage for load…
A quantum computer is a hypothetical device in which the laws of quantum mechanics are used to introduce a degree of parallelism into computations and which could therefore significantly improve on the computational speed of a classical…
In this work we have studied the dynamic scaling behavior of two scaling functions and we have shown that scaling functions obey the dynamic finite size scaling rules. Dynamic finite size scaling of scaling functions opens possibilities for…
An approach to improve neural network interpretability is via clusterability, i.e., splitting a model into disjoint clusters that can be studied independently. We define a measure for clusterability and show that pre-trained models form…
Boltzmann machines are physics informed generative models with wide applications in machine learning. They can learn the probability distribution from an input dataset and generate new samples accordingly. Applying them back to physics, the…
Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerates clusters of objects in all subspaces of a dataset. It tends…
In model-based clustering and classification, the cluster-weighted model constitutes a convenient approach when the random vector of interest constitutes a response variable Y and a set p of explanatory variables X. However, its…
We describe a number of recently developed cluster-flipping algorithms for the efficient simulation of classical spin models near their critical temperature. These include the algorithms of Wolff, Swendsen and Wang, and Niedermeyer, as well…
Quantifying uncertainties in physical or engineering systems often requires a large number of simulations of the underlying computer models that are computationally intensive. Emulators or surrogate models are often used to accelerate the…
The equilibrium phase behavior of microphase-forming systems is notoriously difficult to obtain because of the extended metastability of their modulated phases. In this paper we present a systematic simulation methodology for studying…
Interest in non-algorithmic, unconventional computing is rising in recent years due to more and more apparent short comings of classic stored-program digital computers, such as energy efficiency, degree of parallelism in computations, clock…
Using extensive Monte Carlo simulations, we clarify the critical behaviour of the 3 dimensional simple cubic Ising Fully Frustrated system. We find two transition temperatures and two long range ordered phases. Within the present numerical…
We propose a number of Monte Carlo algorithms for the simulation of ice models and compare their efficiency. One of them, a cluster algorithm for the equivalent three colour model, appears to have a dynamic exponent close to zero, making it…
This paper examines a new parallel computation model called bulk synchronous farm (BSF) that focuses on estimating the scalability of compute-intensive iterative algorithms aimed at cluster computing systems. In the BSF model, a computer is…