• Applied Microscopy
• /
• 제27권3호
• /
• pp.235-241
• /
• 1997

(001) GaAs 기판 위에 성장된 (ZnSe/FeSe) 초격자의 구성층 사이에 상호확산으로 형성된 $Zn_{1-x}Fe_xSe$ 의 미세구조가 고분해능 투과전자현미경과 컴퓨터 이미지 시뮬레이션에 의해 연구되었다. 컴퓨터 이미지 시뮬레이션은 multislice 방법으로 여러 시편 두께와 초점 거리에서 실시되었다. 컴퓨터 시뮬레이션에 의해 얻은 이미지는 실험에 의해 얻은 이미지와 비교되었다. 또한, CuAu-I 형태 규칙화가 $Zn_{1-x}Fe_xSe$ 상호화산층에서 일어났다. 이 CuAu-I 형태 규칙격자는 <100>과 <110> 방향에 따라서 ZnSe와 FeSe 층이 교대로 구성되어 있다.

• 한국조경학회지
• /
• 제26권4호
• /
• pp.1-13
• /
• 1999

Previous research for visual assessment of streetscape employed static simulation methods to represent future landscape. However, streetscape is experienced sequentially, and thus dynamic simulations can be more effective. This study tried to adopt computer animation in the evaluation of streetscape, and examined its effects and possibilities. Three development scenarios for the redevelopment districts of Sokong-Ro and Banpo-Ro in Seoul were designed, and simulations were produced by three methods-photo-retouching, computer still image, and animation. A preference questionnaire was asked to 69 university students, and the effects of simulation methods on visual preference were examined. In addition, the frames of the animation were reclassed to identify the visibility of physical elements. The relationships between the visibility and visual preference were analyzed. The results showed that visual preference can be explained by three factors-Amenity, Tidiness, and Variousness-that account for 62.4% of the total variance, and the Amenity showed the highest proportion: 36.0%. Among the three simulation methods, animation showed the largest difference in preference for the most important factor(Amenity), and yielded the highest correlation between visibility of physical elements and Amenity. This result demonstrated that dynamic simulations can provide more accurate observation of visual changes, especially because the simulated landscape is experienced sequentially. The results also revealed that the sequential change in the visibility of physical elements can be examined easily and precisely by animation. This benefit of animation enables analysts to identify the points where the landscape varies the most, and thus visual preference should be evaluated.

• 조명전기설비학회논문지
• /
• 제13권1호
• /
• pp.102-110
• /
• 1999

제어용 스피커 및 검출용 마이크로폰 등 트랜스듀서들의 위치는 능동 소음제어 시스템의 성능에 큰 영향을 미친다. 능동 소음제어 시스템의 음향 특성이 매우 복잡하고, 유체 밀도, 복소 전파계수 등 음향 파라미터들의 값을 실제 적용 시에는 알 수 없는 경우가 많아 트랜스듀서들의 위치가 능동 소음제어 시스템의 성능에 미치는 영향을 해석적으로 구하기는 매우 어렵다. 본 논문에서는 트랜스듀서들 간의 전달함수들을 중첩의 원리를 이용하여 유도하였으며, 트랜스듀서들 간의 거리가 능동 소음제어 시스템의 성능에 미치는 영향을 컴퓨터 시뮬레이션을 통해 연구하였다. 단일극 시스템은 소음원과 제어 음원 사이의 거리에 영향을 받으며, 이중극 시스템은 두 제어 음원 사이의 거리와 소음원과 1차 제어 음원 사이의 거리에 많은 영향을 받는 것을 알 수 있었다.

• Nuclear Engineering and Technology
• /
• 제49권6호
• /
• pp.1165-1171
• /
• 2017

The traditional form of parallelism in Monte Carlo particle transport simulations, wherein each individual particle history is considered a unit of work, does not lend itself well to data-level parallelism. Event-based algorithms, which were originally used for simulations on vector processors, may offer a path toward better utilizing data-level parallelism in modern computer architectures. In this study, a simple model is developed for estimating the efficiency of the event-based particle transport algorithm under two sets of assumptions. Data collected from simulations of four reactor problems using OpenMC was then used in conjunction with the models to calculate the speedup due to vectorization as a function of the size of the particle bank and the vector width. When each event type is assumed to have constant execution time, the achievable speedup is directly related to the particle bank size. We observed that the bank size generally needs to be at least 20 times greater than vector size to achieve vector efficiency greater than 90%. When the execution times for events are allowed to vary, the vector speedup is also limited by differences in the execution time for events being carried out in a single event-iteration.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2013년도 춘계학술발표대회
• /
• pp.476-477
• /
• 2013

Gadget-2 is a scientific simulation code has been used for many different types of simulations like, Colliding Galaxies, Cluster Formation and the popular Millennium Simulation. The code is parallelized with Message Passing Interface (MPI) and is written in C language. There is also a Java adaptation of the original code written using MPJ Express called Java Gadget. Java Gadget writes a lot of checkpoint data which may or may not use the HDF-5 file format. Since, HDF-5 is MPI-IO compliant, we can use our MPJ-IO library to perform parallel reading and writing of the checkpoint files and improve I/O performance. Additionally, to add reliability to the code execution, we propose the usage of Hadoop Distributed File System (HDFS) for writing the intermediate (checkpoint files) and final data (output files). The current code writes and reads the input, output and checkpoint files sequentially which can easily become bottleneck for large scale simulations. In this paper, we propose Sim-Hadoop, a framework to leverage HDFS and MPJ-IO for improving the I/O performance of Java Gadget code.

• International Journal of Computer Science & Network Security
• /
• 제22권5호
• /
• pp.127-134
• /
• 2022

Generally developed for medical testing, electrocardiogram (ECG) recordings seizure the cardiac electrical signals from the surface of the body. ECG study can consequently be a vital first step to support analyze, comprehend, and expect cardiac ailments accountable for 31% of deaths globally. Different tools are used to analyze ECG signals based on computational methods, and explicitly machine learning method. In all abovementioned computational simulations are prevailing tools for cataloging and clustering. This review demonstrates the different effective methods for heart disease based on computational methods for ECG analysis. The accuracy in machine learning and three-dimensional computer simulations, among medical inferences and contributions to medical developments. In the first part the classification and the methods developed to get data and cataloging between standard and abnormal cardiac activity. The second part emphases on patient analysis from entire ECG recordings due to different kind of diseases present. The last part represents the application of wearable devices and interpretation of computer simulated results. Conclusively, the discussion part plans the challenges of ECG investigation and offers a serious valuation of the approaches offered. Different approaches described in this review are a sturdy asset for medicinal encounters and their transformation to the medical world can lead to auspicious developments.

• Bulletin of the Korean Chemical Society
• /
• 제26권5호
• /
• pp.769-775
• /
• 2005

An efficiency of Monte Carlo (MC) docking simulations was examined for the prediction of chiral discrimination by cyclodextrins. Docking simulations were performed with various computational parameters for the chiral discrimination of a series of 17 enantiomers by $\beta$-cyclodextrin ($\beta$-CD) or by 6-amino-6-deoxy-$\beta$-cyclodextrin (am-$\beta$-CD). A total of 30 sets of enantiomeric complexes were tested to find the optimal simulation parameters for accurate predictions. Rigid-body MC docking simulations gave more accurate predictions than flexible docking simulations. The accuracy was also affected by both the simulation temperature and the kind of force field. The prediction rate of chiral preference was improved by as much as 76.7% when rigid-body MC docking simulations were performed at low-temperatures (100 K) with a sugar22 parameter set in the CHARMM force field. Our approach for MC docking simulations suggested that the conformational rigidity of both the host and guest molecule, due to either the low-temperature or rigid-body docking condition, contributed greatly to the prediction of chiral discrimination.

• Macromolecular Research
• /
• 제9권4호
• /
• pp.185-196
• /
• 2001

The self-assembly of block copolymers can lead to a variety of ordered structures on a nanometer scale. In this article, the self-assembling behaviors of triblock copolymers in the melt and the selective solvent are described with the results obtained from the computer simulations. With the advances of computing power, computer simulations using molecular dynamics and Monte Carlo techniques make it possible to study very complicated phenomena observed in the self-assembly of triblock copolymer. 13king full advantage of the computer simulation based on well-defined model, the effects of various structural and thermodynamic parameters such as the copolymer composition, the block sequence, the pairwise interaction energies, and temperature on the self-assembly are discussed in some detail. Some simulation results are compared with experimental ones End analyzed by comparing them with the theoretical treatment.

• 한국자동차공학회논문집
• /
• 제3권3호
• /
• pp.97-108
• /
• 1995

A 3-dimensional double track vehicle model, that has 12-degress-of-freedom, was proposed to analyze handling and riding behaviours of an automotive car. Nonlinear characteristics of the suspension and steering systems of the vehicle model were considered in its equations of motion, which were solved by using the 4th-order Runge-Kutta integration method. Computer simulations for lane change, steady-state handling, and running-over-bump manoeuvres were made and verified by vehicle tests on proving ground. The computed results of the proposed model showed better agreement with test results than those of the conventional 2-dimensional single track model did. Especially they showed good accuracy near the characteristic speed and in high lateral accelerated manoeuvres.

• ETRI Journal
• /
• 제33권1호
• /
• pp.39-49
• /
• 2011

A new structure learning approach for Bayesian networks based on asexual reproduction optimization (ARO) is proposed in this paper. ARO can be considered an evolutionary-based algorithm that mathematically models the budding mechanism of asexual reproduction. In ARO, a parent produces a bud through a reproduction operator; thereafter, the parent and its bud compete to survive according to a performance index obtained from the underlying objective function of the optimization problem: This leads to the fitter individual. The convergence measure of ARO is analyzed. The proposed method is applied to real-world and benchmark applications, while its effectiveness is demonstrated through computer simulations. Results of simulations show that ARO outperforms genetic algorithm (GA) because ARO results in a good structure and fast convergence rate in comparison with GA.