• Title/Summary/Keyword: cluster calculation

Search Result 141, Processing Time 0.035 seconds

On the origin of post-merger features in galaxy clusters

  • Choi, Hoseung;Yi, Sukyoung
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.37 no.2
    • /
    • pp.72.1-72.1
    • /
    • 2012
  • Sheen et al. 2012 reported a high fraction of galaxies with post-merger features in clusters. The fraction is much higher than what analytic calculation predicts based on the fact that subhalos inside galaxy clusters have high relative velocities. In this study, we aim to address the origin of the post-merger features and to draw an implication for the assembly history of the cluster galaxies. We have performed high-resolution hydrodynamic zoom-in simulations on a cluster of ~1015M using the publicly available Adaptive Mesh Refinements (AMR) code, RAMSES. From the simulations, we have constructed mock images of cluster galaxies taking into account age, metallicity, mass of stellar populations and extinction. The mock images enable us to directly compare the simulation result with deep observation data of cluster galaxies. We discuss possible scenarios for the origin of the post-merger features. We also discuss caveats and future perspectives from the study.

  • PDF

Analytic Solutions of Finite F.C.C. Metal Clusters with Cluster Orbitals

  • Juhyeok Lee;Geun Ha Ryu;Hojing Kim
    • Bulletin of the Korean Chemical Society
    • /
    • v.14 no.1
    • /
    • pp.63-71
    • /
    • 1993
  • By use of cluster orbitals, analytic solutions of finite face-centered cubic clusters are obtained. Taking interactions between up to the second nearest neighbors into account, the forms of all the elements of the Hamiltonian matrix are found explicitly within Huckel approximation. By adopting $D_{2k}$ point group to the cluster, the matrix is simplified. We assume that the cluster orbitals can mix together only when their state indices are indentical. It is then possible to calculate various physical properties of face-centered cubic metal clusters and example are shown for palladium clusters. The results show that density of states and projected density of states are similar, qualitatively, with those obtained by extended Huckel calculation.

Bubble Nucleation in Polymer Solutions (폴리머 용액에서의 기포 형성)

  • Kang, Sung-Lin;Kim, Ki-Young;Kwak, Ho-Young
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1228-1233
    • /
    • 2003
  • The molecular cluster model for the homogeneous bubble nucleation was extended to predict the bubble nucleation events in elastomers, polymers and polymer solutions. For the bubble nucleation in elastomers and polymers, the strain energy overcome by a critical bubble was also considered. The calculation results for the number of bubbles nucleated are in good agreement with observed ones.

  • PDF

Web Server Cluster's Load Balancing for Security Session

  • Kim Seok-Soo
    • Journal of information and communication convergence engineering
    • /
    • v.3 no.2
    • /
    • pp.93-95
    • /
    • 2005
  • In order to create security session, security keys are preconfigured between communication objects. For this purpose, Handshake Protocol exists. The pre-master secret key that is used in this process needs to interpreted by a server to create master secret key, whose process requires a big calculation, resulting in deteriorating system's transmission performance. Therefore, it is helpful in increasing transmission speed to reuse secret keys rather than to create them at every connection.

Stability of the Pentagon Structure of Water Cluster

  • Yoon, Byoung-Jip;Jhon, Mu-Shik
    • Bulletin of the Korean Chemical Society
    • /
    • v.12 no.1
    • /
    • pp.67-70
    • /
    • 1991
  • A hexagonal hexamer of water cluster is optimized by ab initio method using the 4-31G basis set. At this geometry the nonadditive many-body interactions are calculated. The ab initio calculation with large basis set [T. H. Dunning, J. Chem. Phys., 53, 2823 (1970); 54, 3958 (1971)] shows that a pentagonal unit is rather stable among several kinds of clustering units of water molecules.

Measurement of noise characteristics of an image sensor (화상센서의 잡음 특성 측정)

  • Lee, Tae-Kyoung;Hahn, Jae-Won
    • Transactions of the Society of Information Storage Systems
    • /
    • v.5 no.2
    • /
    • pp.89-95
    • /
    • 2009
  • We setup the system to measure the noise characteristics of the 5M complementary metal-oxide semiconductor (CMOS) image sensor by generic measurement indicator of Standard mobile imaging architecture (SMIA) which is one of internal standard of mobile imaging architecture. To evaluate the effect of environment and setting parameters, such as temperature and integration time, we measure the variation of the dark signal, dynamic range and fixed pattern noise of image sensor. We also detect the number of defective pixels and cluster defects defined as adjacent single defect pixels at 5M CMOS image sensor. Then, we find the existence of some cluster defects in experiment, which are not expected in calculation.

  • PDF

Cosmological N-body simulations for Intracluster Light using the Galaxy Repacement Technique

  • Chun, Kyungwon;Shin, Jihye;Smith, Rory;Ko, Jongwan;Yoo, Jaewon
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.46 no.1
    • /
    • pp.29.2-29.2
    • /
    • 2021
  • Intracluster light (ICL) is composed of the stars diffused throughout the galaxy cluster but does not bound to any galaxy. The ICL is a ubiquitous feature of galaxy clusters and occupies a significant fraction of the total stellar mass in the cluster. Therefore, the ICL components are believed to help understand the formation and evolution of the clusters. However, in the numerical study, one needs to perform the high-resolution cosmological hydrodynamic simulations, which require an expensive calculation, to trace these low-surface brightness structures (LSB). Here, we introduce the Galaxy Replacement Technique (GRT) that focuses on implementing the gravitational evolution of the diffused ICL structures without the expensive baryonic physics. The GRT reproduces the ICL structures by a multi-resolution cosmological N-body re-simulation using a full merger tree of the cluster from a low-resolution DM-only cosmological simulation and an abundance matching model. Using the GRT, we show the preliminary results about the evolution of the ICL in the on-going simulations for the various clusters.

  • PDF

Parallel Algorithm of Improved FunkSVD Based on Spark

  • Yue, Xiaochen;Liu, Qicheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.5
    • /
    • pp.1649-1665
    • /
    • 2021
  • In view of the low accuracy of the traditional FunkSVD algorithm, and in order to improve the computational efficiency of the algorithm, this paper proposes a parallel algorithm of improved FunkSVD based on Spark (SP-FD). Using RMSProp algorithm to improve the traditional FunkSVD algorithm. The improved FunkSVD algorithm can not only solve the problem of decreased accuracy caused by iterative oscillations but also alleviate the impact of data sparseness on the accuracy of the algorithm, thereby achieving the effect of improving the accuracy of the algorithm. And using the Spark big data computing framework to realize the parallelization of the improved algorithm, to use RDD for iterative calculation, and to store calculation data in the iterative process in distributed memory to speed up the iteration. The Cartesian product operation in the improved FunkSVD algorithm is divided into blocks to realize parallel calculation, thereby improving the calculation speed of the algorithm. Experiments on three standard data sets in terms of accuracy, execution time, and speedup show that the SP-FD algorithm not only improves the recommendation accuracy, shortens the calculation interval compared to the traditional FunkSVD and several other algorithms but also shows good parallel performance in a cluster environment with multiple nodes. The analysis of experimental results shows that the SP-FD algorithm improves the accuracy and parallel computing capability of the algorithm, which is better than the traditional FunkSVD algorithm.