• 제목/요약/키워드: Evolution Computation

검색결과 114건 처리시간 0.028초

Statistical Analysis of Interacting Dark Matter Halos: On two physically distinct interaction types

  • An, Sung-Ho;Kim, Juhan;Moon, Jun-Sung;Yoon, Suk-Jin
    • 천문학회보
    • /
    • 제46권1호
    • /
    • pp.28.1-28.1
    • /
    • 2021
  • We present a statistical analysis of dark matter halos with interacting neighbors using a set of cosmological simulations. We classify the neighbors into two groups based on the total energy (E12) of the target-neighbor system; flybying neighbors (E12 ≥ 0) and merging ones (E12 < 0). First, we find a different trend between the flyby and merger fractions in terms of the halo mass and large-scale density. The flyby fraction highly depends on the halo mass and environment, while the merger fraction show little dependence. Second, we measure the spin-orbit alignment, which is the angular alignment between the spin of a target halo (${\vec{S}}$ ) and the orbital angular momentum of its neighbor (${\vec{L}}$). In the spin-orbit angle distribution, the flybying neighbors show a weaker prograde alignment with their target halos than the merging neighbors do. With respect to the nearest filament, the flybying neighbor has a behavior different from that of the merging neighbor. Finally, we discuss the physical origin of two interaction types.

  • PDF

EVOLUTION OF TRANSMISSION LOSS AND STRUCTURE IN EPOXY CURING

  • Song Hyeon-Hun;Park Jong-Hui;No Geun-Ae
    • 한국섬유공학회:학술대회논문집
    • /
    • 한국섬유공학회 1998년도 가을 학술발표회논문집
    • /
    • pp.280-282
    • /
    • 1998
  • Communications, data storage or computation by manipulating the optical signals have the strong advantages over the traditional electronic circuits in regard to the data handling speed and capacity. Effective manipulation of the optical signals, however, requires materials of large nonlinear coefficients and of fast response time. Polymeric materials are one of the promising materials to meet the requirements for nonlinear optical (NLO) materials. (omitted)

  • PDF

비선형 상호작용에 의한 풍파 성분간 에너지 전달의 계산 (Computation of Nonlinear Energy Transfer among Wind Seas)

  • 오병철;이길성
    • 한국해안해양공학회지
    • /
    • 제11권1호
    • /
    • pp.7-19
    • /
    • 1999
  • 비선형 상호작용에 의한 풍파 성분간 에너지 전달은 스펙트럼의 발달에서 중요한 역할을 한다. 비선형 전달을 표현하는 Boltzmann적분을 계산하는 데에는 방대한 계산시간이 필요하기 때문에 파랑모형에서 비선형 상호작용을 고려하는 것을 불가능하다. 본 연구에서는 산란계수의 특성과 상호작용의 상세균형의 원리를 이용하여 비선형 전달을 효율적으로 계산하는 방법에 대하여 고찰하였다. Webb의 방법(IWm)은 특이점을 퇴화시켜 매우 안정한 계산 결과를 주지만 상세균형의 원리를 적용할 수 없기 때문에 계산의 효율성에는 한계가 있는 것으로 나타났다. 한편, Masuda의 방법(IMM)에서는 특이점을 해석적으로 처리하며 계산시간은 Pentinum 300MHz Processor에서 1.3초가 소요되었다. 따라서 IMM은 1차원 파랑모형에 실용적으로 사용할 수 있으며 취송시간과 취송거리에 의한 풍파 스펙트럼의 성장 과정 연구등에 매우 유용하다.

  • PDF

HORIZON RUN 4 SIMULATION: COUPLED EVOLUTION OF GALAXIES AND LARGE-SCALE STRUCTURES OF THE UNIVERSE

  • KIM, JUHAN;PARK, CHANGBOM;L'HUILLIER, BENJAMIN;HONG, SUNGWOOK E.
    • 천문학회지
    • /
    • 제48권4호
    • /
    • pp.213-228
    • /
    • 2015
  • The Horizon Run 4 is a cosmological N-body simulation designed for the study of coupled evolution between galaxies and large-scale structures of the Universe, and for the test of galaxy formation models. Using 63003 gravitating particles in a cubic box of Lbox = 3150 h−1Mpc, we build a dense forest of halo merger trees to trace the halo merger history with a halo mass resolution scale down to Ms = 2.7 × 1011h−1M. We build a set of particle and halo data, which can serve as testbeds for comparison of cosmological models and gravitational theories with observations. We find that the FoF halo mass function shows a substantial deviation from the universal form with tangible redshift evolution of amplitude and shape. At higher redshifts, the amplitude of the mass function is lower, and the functional form is shifted toward larger values of ln(1/σ). We also find that the baryonic acoustic oscillation feature in the two-point correlation function of mock galaxies becomes broader with a peak position moving to smaller scales and the peak amplitude decreasing for increasing directional cosine μ compared to the linear predictions. From the halo merger trees built from halo data at 75 redshifts, we measure the half-mass epoch of halos and find that less massive halos tend to reach half of their current mass at higher redshifts. Simulation outputs including snapshot data, past lightcone space data, and halo merger data are available at http://sdss.kias.re.kr/astro/Horizon-Run4.

An Agent Gaming and Genetic Algorithm Hybrid Method for Factory Location Setting and Factory/Supplier Selection Problems

  • Yang, Feng-Cheng;Kao, Shih-Lin
    • Industrial Engineering and Management Systems
    • /
    • 제8권4호
    • /
    • pp.228-238
    • /
    • 2009
  • This paper first presents two supply chain design problems: 1) a factory location setting and factory selection problem, and 2) a factory location setting and factory/supplier selection problem. The first involves a number of location known retailers choosing one factory to supply their demands from a number of factories whose locations are to be determined. The goal is to minimize the transportation and manufacturing cost to satisfy the demands. The problem is then augmented into the second problem, where the procurement cost of the raw materials from a chosen material supplier (from a number of suppliers) is considered for each factory. Economic beneficial is taken into account in the cost evaluation. Therefore, the partner selections will influence the cost of the supply chain significantly. To solve these problems, an agent gaming and genetic algorithm hybrid method (AGGAHM) is proposed. The AGGAHM consecutively and alternatively enable and disable the advancement of agent gaming and the evolution of genetic computation. Computation results on solving a number of examples by the AGGAHM were compared with those from methods of a general genetic algorithm and a mutual frozen genetic algorithm. Results showed that the AGGAHM outperforms the methods solely using genetic algorithms. In addition, various parameter settings are tested and discussed to facilitate the supply chain designs.

EVOLUTIONARY STATUS AND INTERNAL STRUCTURE OF μ CASSIOPEIAE

  • BACH, KIEHUNN
    • 천문학회지
    • /
    • 제48권3호
    • /
    • pp.165-175
    • /
    • 2015
  • We investigate physical properties of the nearby (∼ 7.5 pc) astrometric binary μ Cas in the context of standard evolutionary theory. Based on the spectroscopically determined relative abundances ([α/Fe] ≳ +0.4 dex, [Fe/H] ∼ −0.7 dex), all physical inputs such as opacities and equation of state are consistently generated. By combining recent spectroscopic analyses with the astrometric observations from the HIPPARCOS parallaxes and the CHARA array, the evolutionary model grids have been constructed. Through the statistical evaluation of the χ2-minimization among alternative models, we find a reliable evolutionary solution (MA, MB, tage) = (0.74 M, 0.19 M, 11 Gyr) which excellently satisfies observational constraints. In particular, we find that the helium abundance of μ Cas is comparable with the primordial helium contents (Yp ∼ 0.245). On the basis of the well-defined stellar parameters of the primary star, the internal structure and the p-mode frequencies have been estimated. From our seismic computation, μ Cas is expected to have a first order spacing ∆ν ∼ 169 μHz. The ultimate goal of this study is to describe physical processes inside a low-mass star through a complete modelling from the spectroscopic observation to the evolutionary computation.

A Scalable Heuristic for Pickup-and-Delivery of Splittable Loads and Its Application to Military Cargo-Plane Routing

  • Park, Myoung-Ju;Lee, Moon-Gul
    • Management Science and Financial Engineering
    • /
    • 제18권1호
    • /
    • pp.27-37
    • /
    • 2012
  • This paper is motivated by a military cargo-plane routing problem which is a pickup-and-delivery problem in which load splits and node revisits are allowed (PDPLS). Although this recent evolution of a VRP-model enhances the efficiency of routing, a solution method is more of a challenge since the node revisits entail closed walks in modeling vehicle routes. For such a case, even a compact IP-formulation is not available and an effective method had been lacking until Nowak et al. (2008b) proposed a heuristic based on a tabu search. Their method provides very reasonable solu-tions as demonstrated by the experiments not only in their paper (Nowak et al., 2008b) but also in ours. However, the computation time seems intensive especially for the class of problems with dynamic transportation requests, including the military cargo-plane routing problem. This paper proposes a more scalable algorithm hybridizing a tabu search for pricing subproblem paused as a single-vehicle routing problem, with a column generation approach based on Dantzig-Wolfe decomposition. As tested on a wide variety of instances, our algorithm produces, in average, a solution of an equiva-lent quality in 10~20% of the computation time of the previous method.

점근 근사법에 의한 파랑변위 계산 (Computation of Free Surface Displacement for Water Waves by Asymptotic Approximations)

  • 서승남
    • 한국해안해양공학회지
    • /
    • 제6권1호
    • /
    • pp.12-22
    • /
    • 1994
  • 외력에 의해 생성된 일정 수심 위를 전파하는 파랑변위의 시간변화를 점근 근사법을 사용하여 분석하였다. Stationary Phase 방법, Steepest Descents 방법 그리고 선두파랑 근사법을 사용하였다. 1차원 파랑과 2차원 파랑의 해면변위에 대한 근사법을 검증하기 위해 근사식과 수치적분으로 계산한 변위를 도시하였다. 파고 감소율에 대한 기존의 결과인 1차원 선두파랑의 감소율은 t$^{-1}$3/, 후속파랑은 t$^{-1}$2 그리고 2차원 후속파낭은 t$^{-1}$로 이들 근사식의 타당함을 입증하였다. 그러나 2차원 선두파랑의 감소율은 기존 Kajiura의 결과인 t$^{-4}$ 3/과 다른 t$^{-5}$6/이 적합함을 나타내었다.

  • PDF

다목적을 갖는 혼합모델 조립라인의 밸런싱과 투입순서를 위한 공생 진화알고리즘 (A Symbiotic Evolutionary Algorithm for Balancing and Sequencing Mixed Model Assembly Lines with Multiple Objectives)

  • 김여근;이상선
    • 한국경영과학회지
    • /
    • 제35권3호
    • /
    • pp.25-43
    • /
    • 2010
  • We consider a multi-objective balancing and sequencing problem in mixed model assembly lines, which is important for an efficient use of the assembly lines. In this paper, we present a neighborhood symbiotic evolutionary algorithm to simultaneously solve the two problems of balancing and model sequencing under multiple objectives. We aim to find a set of well-distributed solutions close to the true Pareto optimal solutions for decision makers. The proposed algorithm has a two-leveled structure. At Level 1, two populations are operated : One consists of individuals each of which represents a partial solution to the balancing problem and the other consists of individuals for the sequencing problem. Level 2, which is an upper level, works one population whose individuals represent the combined entire solutions to the two problems. The process of Level 1 imitates a neighborhood symbiotic evolution and that of Level 2 simulates an endosymbiotic evolution together with an elitist strategy to promote the capability of solution search. The performance of the proposed algorithm is compared with those of the existing algorithms in convergence, diversity and computation time of nondominated solutions. The experimental results show that the proposed algorithm is superior to the compared algorithms in all the three performance measures.

Improving CMD Areal Density Analysis: Algorithms and Strategies

  • Wilson, R.E.
    • Journal of Astronomy and Space Sciences
    • /
    • 제31권2호
    • /
    • pp.121-130
    • /
    • 2014
  • Essential ideas, successes, and difficulties of Areal Density Analysis (ADA) for color-magnitude diagrams (CMD's) of resolved stellar populations are examined, with explanation of various algorithms and strategies for optimal performance. A CMD-generation program computes theoretical datasets with simulated observational error and a solution program inverts the problem by the method of Differential Corrections (DC) so as to compute parameter values from observed magnitudes and colors, with standard error estimates and correlation coefficients. ADA promises not only impersonal results, but also significant saving of labor, especially where a given dataset is analyzed with several evolution models. Observational errors and multiple star systems, along with various single star characteristics and phenomena, are modeled directly via the Functional Statistics Algorithm (FSA). Unlike Monte Carlo, FSA is not dependent on a random number generator. Discussions include difficulties and overall requirements, such as need for fast evolutionary computation and realization of goals within machine memory limits. Degradation of results due to influence of pixelization on derivatives, Initial Mass Function (IMF) quantization, IMF steepness, low Areal Densities ($\mathcal{A}$), and large variation in $\mathcal{A}$ are reduced or eliminated through a variety of schemes that are explained sufficiently for general application. The Levenberg-Marquardt and MMS algorithms for improvement of solution convergence are contained within the DC program. An example of convergence, which typically is very good, is shown in tabular form. A number of theoretical and practical solution issues are discussed, as are prospects for further development.