FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1888486528> ?p ?o ?g. }

• W1888486528 abstract "Monte Carlo simulations are one of the most important numerical techniques for investigating statistical physical systems. Among these systems, spin models are a typical example which also play an essential role in constructing the abstract mechanism for various complex systems. Unfortunately, traditional Monte Carlo algorithms are afflicted with slowing down near continuous phase transitions and the efficiency of the Monte Carlo simulation goes to zero as the size of the lattice is increased. To combat critical slowing down, a very different type of collective-mode algorithm, in contrast to the traditional single-spin-flipmode, was proposed by Swendsen and Wang in 1987 for Potts spin models. Since then, there has been an explosion of work attempting to understand, improve, or generalize it. In these so-called algorithms, clusters of spin are regarded as one template and are updated at each step of the Monte Carlo procedure. In implementing these algorithms the cluster labeling is a major time-consuming bottleneck and is also isomorphic to the problem of computing connected components of an undirected graph seen in other application areas, such as pattern recognition. A number of cluster labeling algorithms for sequential computers have long existed. However, the dynamic irregular nature of clusters complicates the task of finding good parallel algorithms and this is particularly true on SIMD (single-instruction-multiple-data machines. Our design of the Hierarchical Cluster Labeling Algorithm aims at alleviating this problem by building a hierarchical structure on the problem domain and by incorporating local and nonlocal communication schemes. We present an estimate for the computational complexity of cluster labeling and prove the key features of this algorithm (such as lower computational complexity, data locality, and easy implementation) compared with the methods formerly known. In particular, this algorithm can be viewed as a generalized scan scheme applicable to problem domains of any high dimension and of arbitrary geometry (scan is an important primitive of parallel computing). In addition, from implementation results, the hierarchical cluster labeling algorithm has proved to work equally well on MIMD machines, though originally designed for SIMD machines. Based on this success, we further study the hierarchical structure hidden in the algorithm. Hierarchical structure is a conceptual framework frequently used in building models for the study of a great variety of problems. This structure serves not only to describe the complexity of the system at different levels, but also to achieve some goals targeted by the problem, i.e., an algorithm to solve the problem. In this regard, we investigate the similarities and differences between this algorithm and others, including the FFT and the Barnes-Hut method, in terms of their hierarchical structures." @default.
• W1888486528 created "2016-06-24" @default.
• W1888486528 creator A5030977195 @default.
• W1888486528 date "1995-01-01" @default.
• W1888486528 modified "2023-09-27" @default.
• W1888486528 title "The Hierarchical Algorithms - Theory and Applications" @default.
• W1888486528 hasPublicationYear "1995" @default.
• W1888486528 type Work @default.
• W1888486528 sameAs 1888486528 @default.
• W1888486528 citedByCount "0" @default.
• W1888486528 crossrefType "dissertation" @default.
• W1888486528 hasAuthorship W1888486528A5030977195 @default.
• W1888486528 hasConcept C105795698 @default.
• W1888486528 hasConcept C11413529 @default.
• W1888486528 hasConcept C121332964 @default.
• W1888486528 hasConcept C121864883 @default.
• W1888486528 hasConcept C149635348 @default.
• W1888486528 hasConcept C19499675 @default.
• W1888486528 hasConcept C2780513914 @default.
• W1888486528 hasConcept C33923547 @default.
• W1888486528 hasConcept C41008148 @default.
• W1888486528 hasConcept C51329190 @default.
• W1888486528 hasConcept C80444323 @default.
• W1888486528 hasConcept C98925819 @default.
• W1888486528 hasConceptScore W1888486528C105795698 @default.
• W1888486528 hasConceptScore W1888486528C11413529 @default.
• W1888486528 hasConceptScore W1888486528C121332964 @default.
• W1888486528 hasConceptScore W1888486528C121864883 @default.
• W1888486528 hasConceptScore W1888486528C149635348 @default.
• W1888486528 hasConceptScore W1888486528C19499675 @default.
• W1888486528 hasConceptScore W1888486528C2780513914 @default.
• W1888486528 hasConceptScore W1888486528C33923547 @default.
• W1888486528 hasConceptScore W1888486528C41008148 @default.
• W1888486528 hasConceptScore W1888486528C51329190 @default.
• W1888486528 hasConceptScore W1888486528C80444323 @default.
• W1888486528 hasConceptScore W1888486528C98925819 @default.
• W1888486528 hasLocation W18884865281 @default.
• W1888486528 hasOpenAccess W1888486528 @default.
• W1888486528 hasPrimaryLocation W18884865281 @default.
• W1888486528 hasRelatedWork W1586025549 @default.
• W1888486528 hasRelatedWork W1648330644 @default.
• W1888486528 hasRelatedWork W1820949149 @default.
• W1888486528 hasRelatedWork W2066129337 @default.
• W1888486528 hasRelatedWork W207818447 @default.
• W1888486528 hasRelatedWork W2493267180 @default.
• W1888486528 hasRelatedWork W2585096127 @default.
• W1888486528 hasRelatedWork W2594063632 @default.
• W1888486528 hasRelatedWork W2753241298 @default.
• W1888486528 hasRelatedWork W2768683495 @default.
• W1888486528 hasRelatedWork W2790352117 @default.
• W1888486528 hasRelatedWork W2891559904 @default.
• W1888486528 hasRelatedWork W2896842204 @default.
• W1888486528 hasRelatedWork W2950034300 @default.
• W1888486528 hasRelatedWork W2953575790 @default.
• W1888486528 hasRelatedWork W2985253298 @default.
• W1888486528 hasRelatedWork W3122038897 @default.
• W1888486528 hasRelatedWork W3126635575 @default.
• W1888486528 hasRelatedWork W3149606206 @default.
• W1888486528 hasRelatedWork W71000211 @default.
• W1888486528 isParatext "false" @default.
• W1888486528 isRetracted "false" @default.
• W1888486528 magId "1888486528" @default.
• W1888486528 workType "dissertation" @default.