Related papers: Revisiting the Global Minimum Structure of the Pt5…
In this paper, we study the form over the minimum spanning tree problem (MST) from which we will derive an intuitively generalized model and new methods with the upper bound of runtimes of logarithm. The new pattern we made has taken…
When it comes to clustering nonconvex shapes, two paradigms are used to find the most suitable clustering: minimum cut and maximum density. The most popular algorithms incorporating these paradigms are Spectral Clustering and DBSCAN. Both…
The global minima of clusters bound by a Dzugutov potential form non-compact polytetrahedral clusters mainly composed of interpenetrating and face-sharing 13-atom icosahedra. As the size increases, these icosahedral units first form linear…
This paper proposes a new scheme for performance enhancement of distributed genetic algorithm (DGA). Initial population is divided in two classes i.e. female and male. Simple distance based clustering is used for cluster formation around…
A new method for stability assessment of inverter-based microgrids is presented in this paper. It leverages the notion of critical clusters -- a localized group of inverters with parameters having the highest impact on the system stability.…
The reduced density matrix of an interacting system can be used as the basis for a truncation scheme, or in an unbiased method to discover the strongest kind of correlation in the ground state. In this paper, we investigate the structure of…
Graph Structure Learning (GSL) recently has attracted considerable attentions in its capacity of optimizing graph structure as well as learning suitable parameters of Graph Neural Networks (GNNs) simultaneously. Current GSL methods mainly…
This paper deals with the design and analysis of the distributed weighted clustering algorithm SD_DWCA proposed for homogeneous mobile ad hoc networks. It is a connectivity, mobility and energy based clustering algorithm which is suitable…
In heterogeneous network systems such as ecological and social networks, structural stability depends on how connectivity changes under node removal, as different removal sequences can trigger distinct modes of systemic collapse. While…
In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spanning tree on general graphs with positive real edge weights. The goal of a dynamic MST algorithm is to update efficiently the minimum spanning…
This paper investigates the contact structures and dynamics of stochastic vector bundles, leading to the formulation of the least constraint theorem. It is found that the probability space of stochastic vector bundles possesses an…
Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors of a similarity matrix. It often outperforms traditional clustering algorithms such as $k$-means when the structure of the individual…
We consider the minimal k-grouping problem: given a graph G=(V,E) and a constant k, partition G into subgraphs of diameter no greater than k, such that the union of any two subgraphs has diameter greater than k. We give a silent…
The stability of the linear chain structure of three $\alpha$ clusters for $^{12}$C against the bending and fission is investigated in the cranking covariant density functional theory, in which the equation of motion is solved on a 3D…
This study focuses on developing precise machine learning (ML) regression models for predicting energy bandgap values based on chemical compositions and crystal structures. The primary aim is to match the accuracy of predictions derived…
Feed-forward 3D foundation models face a key challenge: the quadratic computational cost introduced by global attention, which severely limits scalability as input length increases. Concurrent acceleration methods, such as token merging,…
A new procedure for simultaneously finding the optimal cluster structure of multivariate functional objects and finding the subspace to represent the cluster structure is presented. The method is based on the $k$-means criterion for…
A numerical simulation utilizing a box_tree code is used to investigate the structure and vertical mode spectrum of finite two-dimensional (2D) plasma crystals. The overall structural symmetry of the system is examined for various Debye…
In several environmental applications data are functions of time, essentially con- tinuous, observed and recorded discretely, and spatially correlated. Most of the methods for analyzing such data are extensions of spatial statistical tools…
Double-hybrid density functional theory (DHDFT) offers a pathway to accuracies approaching composite wavefunction approaches like G4 theory. However, the GLPT2 (G{\"o}rling 2nd order perturbation theory) term causes them to partially…