相关论文: Effect of spatial constraints on fragment producti…

We investigate the fragmentation process of solid materials with crystalline and amorphous phases using the discrete element method. Damage initiates inside spherical samples above the contact zone in a region where the circumferential…

We include in statistical model calculations the facts that in the nuclear multifragmentation process the fragments are produced within a given volume and have a finite size. The corrections associated with these constraints affect the…

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…

To make a statement about the nature and mechanism of fragmentation, it is necessary to probe directly any competition, or lack thereof, between the emission of various particle species as a function of excitation energy. The task is then…

Minimum spanning trees (MSTs) provide a convenient representation of datasets in numerous pattern recognition activities. Moreover, they are relatively fast to compute. In this paper, we quantify the extent to which they are meaningful in…

The most important characteristics of the fragmentation of heterogeneous solids is that the mass (size) distribution of pieces is described by a power law functional form. The exponent of the distribution displays a high degree of…

We compare the existent methods including the minimum spanning tree based method and the local stellar density based method, in measuring mass segregation of star clusters. We find that the minimum spanning tree method reflects more the…

We define a spatially-dependent fragmentation process, which involves rectangles breaking up into progressively smaller pieces at rates that depend on their shape. Long, thin rectangles are more likely to break quickly, and are also more…

We analyze the fragmentation behavior of random clusters on the lattice under a process where bonds between neighboring sites are successively broken. Modeling such structures by configurations of a generalized Potts or random-cluster model…

As an alternative to the paradigmatic fragmentation problem of a single object crushed into a great number of pieces, we survey a large collection of identical bodies, each one randomly split into two fragments only. While some key features…

Clustering can be defined as the process of assembling objects into a number of groups whose elements are similar to each other in some manner. As a technique that is used in many domains, such as face clustering, plant categorization,…

In the paper (Goloveshkin and Myagkov 2014) we proposed a two-dimensional energy-based model of fragmentation of rapidly expanding cylinder under plane strain conditions. The model allowed one to estimate the average fragment length and the…

Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged as prevailing methods for efficiently recovering sparse and…

Abridged. A large fraction of stars are found in binary systems. It is therefore important for our understanding of the star formation process, to investigate the fragmentation of dense molecular cores. We study the influence of the…

Fragment properties of hot fragmenting sources of similar sizes produced in central and semi-peripheral collisions are compared in the excitation energy range 5-10 AMeV. For semi-peripheral collisions a method for selecting compact…

Random dimensionality reduction is a versatile tool for speeding up algorithms for high-dimensional problems. We study its application to two clustering problems: the facility location problem, and the single-linkage hierarchical clustering…

Fragmentation can be observed in nature and in everyday life on a wide range of length scales and for all kinds of technical applications. Most studies on dynamic failure focus on the behaviour of bulk systems in one, two and three…

The inclusion of a fragmentation mechanism in population balance equations introduces complex interactions that make the analytical or even computational treatment much more difficult than for the pure aggregation case. This is specially…

The quadratic minimum spanning tree problem (QMSTP) is the problem of finding a spanning tree of a graph such that the total interaction cost between pairs of edges in the tree is minimized. We first show that most of the bounding…

We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the…