• The Bulletin of The Korean Astronomical Society
• /
• v.45 no.1
• /
• pp.38.2-38.2
• /
• 2020

Horizon Run 5 (HR5) is a cosmological hydrodynamical simulation which captures the properties of the Universe on a Gpc scale while achieving a resolution of 1 kpc. This enormous dynamic range allows us to simultaneously capture the physics of the cosmic web on very large scales and account for the formation and evolution of dwarf galaxies on much smaller scales. Inside the simulation box. we zoom-in on a high-resolution cuboid region with a volume of 1049 × 114 × 114 Mpc3. The subgrid physics chosen to model galaxy formation includes radiative heating/cooling, reionization, star formation, supernova feedback, chemical evolution tracking the enrichment of oxygen and iron, the growth of supermassive black holes and feedback from active galactic nuclei (AGN) in the form of a dual jet-heating mode. For this simulation we implemented a hybrid MPI-OpenMP version of the RAMSES code, specifically targeted for modern many-core many thread parallel architectures. For the post-processing, we extended the Friends-of-Friend (FoF) algorithm and developed a new galaxy finder to analyse the large outputs of HR5. The simulation successfully reproduces many observations, such as the cosmic star formation history, connectivity of galaxy distribution and stellar mass functions. The simulation also indicates that hydrodynamical effects on small scales impact galaxy clustering up to very large scales near and beyond the baryonic acoustic oscillation (BAO) scale. Hence, caution should be taken when using that scale as a cosmic standard ruler: one needs to carefully understand the corresponding biases. The simulation is expected to be an invaluable asset for the interpretation of upcoming deep surveys of the Universe.

• Imaging Science in Dentistry
• /
• v.54 no.2
• /
• pp.191-199
• /
• 2024

Purpose: The aim of this study was to evaluate image artifacts in the vicinity of dental implants in cone-beam computed tomography (CBCT) scans obtained with different spatial orientations, tube current levels, and metal artifact reduction algorithm (MAR) conditions. Materials and Methods: One dental implant and 2 tubes filled with a radiopaque solution were placed in the posterior region of a mandible using a surgical guide to ensure parallel alignment. CBCT scans were acquired with the mandible in 2 spatial orientations in relation to the X-ray projection plane (standard and modified) at 3 tube current levels: 5, 8, and 11 mA. CBCT scans were repeated without the implant and were reconstructed with and without MAR. The mean voxel and noise values of each tube were obtained and compared using multi-way analysis of variance and the Tukey test(α=0.05). Results: Mean voxel values were significantly higher and noise values were significantly lower in the modified orientation than in the standard orientation (P<0.05). MAR activation and tube current levels did not show significant differences in most cases of the modified spatial orientation and in the absence of the dental implant (P>0.05). Conclusion: Modifying the spatial orientation of the head increased brightness and reduced spatial orientation noise in adjacent regions of a dental implant, with no influence from the tube current level and MAR.

• Clinical Endoscopy
• /
• v.55 no.6
• /
• pp.736-741
• /
• 2022

Endoscopic retrograde cholangiopancreatography (ERCP) in patients with Roux-en-Y gastric bypass anatomy is a well-documented challenge. Traditionally, this problem has been overcome with adjunctive techniques, such as device-assisted ERCP, including double-balloon or single-balloon enteroscopy and laparoscopy-assisted transgastric ERCP. Endoscopic ultrasound-directed transgastric ERCP (EDGE) is a novel technique that enables access to the ampulla using a duodenoscope without surgical intervention and has shown high clinical and technical success rates in recent studies. However, this approach is technically demanding, necessitating a thorough understanding of the gastrointestinal anatomy as well as high operator experience. In this review, we provide a technical overview of EDGE in parallel with our personal experience at our center and propose a simple algorithm to select patients for its appropriate application. In conjunction, the outcomes of EDGE compared with those of device-assisted and laparoscopy-assisted transgastric ERCP will be discussed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.11
• /
• pp.51-62
• /
• 2003

This paper presents a novel survivor memeory management and decoding techniques with sequential backward state transition control in the trace back Viterbi decoder. The Viterbi algorithm is an maximum likelihood decoding scheme to estimate the likelihood of encoder state for channel error detection and correction. This scheme is applied to a broad range of digital communication such as intersymbol interference removing and channel equalization. In order to achieve the area-efficiency VLSI chip design with high throughput in the Viterbi decoder in which recursive operation is implied, more research is required to obtain a simple systematic parallel ACS architecture and surviver memory management. As a method of solution to the problem, this paper addresses a progressive decoding algorithm with sequential backward state transition control in the trace back Viterbi decoder. Compared to the conventional trace back decoding techniques, the required total memory can be greatly reduced in the proposed method. Furthermore, the proposed method can be implemented with a simple pipelined structure with systolic array type architecture. The implementation of the peripheral logic circuit for the control of memory access is not required, and memory access bandwidth can be reduced Therefore, the proposed method has characteristics of high area-efficiency and low power consumption with high throughput. Finally, the examples of decoding results for the received data with channel noise and application result are provided to evaluate the efficiency of the proposed method.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.581-592
• /
• 2016

WebRTC has quickly grown to be the world's advanced real-time communication in several platforms such as web and mobile. In spite of the advantage, the current technology in WebRTC does not handle a big-streaming efficiently between peers and a large amount request of users on the Signaling server. Therefore, in this paper, we put our work to handle the problem by delivering the flow of data with dynamical load balancing algorithms. We analyze the request source users and direct those streaming requests to a load balancing component. More specifically, the component determines an amount of the requested resource and available resource on the response server, then it delivers streaming data to the requesting user parallel or alternately. To show how the method works, we firstly demonstrate the load-balancing algorithm by using a network simulation tool OPNET, then, we seek to implement the method into an Ubuntu server. In addition, we compare the result of our work and the original implementation of WebRTC, it shows that the method performs efficiently and dynamically than the origin.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.4
• /
• pp.94-104
• /
• 2008

In this paper, we propose a new architecture of multiplier-and-accumulator (MAC) for high speed multiplication and accumulation arithmetic. By combining multiplication with accumulation and devising a hybrid type of carry save adder (CSA), the performance was improved. Since the accumulator which has the largest delay in MAC was removed and its function was included into CSA, the overall performance becomes to be elevated. The proposed CSA tree uses 1's complement-based radix-2 modified booth algorithm (MBA) and has the modified array for the sign extension in order to increase the bit density of operands. The CSA propagates the carries by the least significant bits of the partial products and generates the least significant bits in advance for decreasing the number of the input bits of the final adder. Also, the proposed MAC accumulates the intermediate results in the type of sum and carry bits not the output of the final adder for improving the performance by optimizing the efficiency of pipeline scheme. The proposed architecture was synthesized with $250{\mu}m,\;180{\mu}m,\;130{\mu}m$ and 90nm standard CMOS library after designing it. We analyzed the results such as hardware resource, delay, and pipeline which are based on the theoretical and experimental estimation. We used Sakurai's alpha power low for the delay modeling. The proposed MAC has the superior properties to the standard design in many ways and its performance is twice as much than the previous research in the similar clock frequency.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.189-196
• /
• 2004

Most of the recent researches for ATM switches have been based on multistage interconnection network known as regularity and self-routing property. These networks can switch packets simultaneously and in parallel. However, they are blocking networks in the sense that packet is capable of collision with each other Mainly Banyan network have been used for structure. There are several ways to reduce the blocking or to increase the throughput of banyan-type switches: increasing the internal link speeds, placing buffers in each switching node, using multiple path, distributing the load evenly in front of the banyan network and so on. Therefore, this paper proposes the use of recirculating shuffle-exchange network to reduce the blocking and to improve hardware complexity. This structures are recirculating shuffle-exchange network as simplified in hardware complexity and Rank network with tree structure which send only a packet with highest priority to the next network, and recirculate the others to the previous network. after it decides priority number on the Packets transferred to the same destination, The transferred Packets into banyan network use the function of self routing through decomposition and composition algorithm and all they arrive at final destinations. To analyze throughput, waiting time and packet loss ratio according to the size of buffer, the probabilities are modeled by a binomial distribution of packet arrival. If it is 50 percentage of load, the size of buffer is more than 15. It means the acceptable packet loss ratio. Therefore, this paper simplify the hardware complexity as use of recirculating shuffle-exchange network instead of bitonic sorter.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.5
• /
• pp.738-744
• /
• 2017

Recently, the installation of energy storage systems (ESSs) has increased in parallel with the extension of renewable energy resources. However, there has been no concrete analysis ofthe performance verification and economic evaluation of ESSs,which makes it difficult to perform aneffective installation and operation of an ESS. In particular, there are no international technical standards and guidelines on electric ESS for frequency regulation applications. Therefore, acomprehensive study on the power quality, impact on grid, extent of contribution, and cost benefit study of ESS are strongly being required. Under these backgrounds, this paper proposes a performance verification algorithm on ESS for frequency regulation application based on ananalysis of the AGC(Automatic Generation Control) performance verification method of PJM in USA. In addition,this paper proposes an economic evaluation algorithm on a 500 MW installation of ESS for frequency regulation applications using the account settlement of an expensive gas-fired generation plant and coal-fired power generation plant. From the simulation with real ESS operation data and 500 MW installation case, it wasconfirmed that the ESS showssuperior performance toany other conventional generators and provides anannual benefit of 500 MW ESS are between 345~429 billon won.

• Tunnel and Underground Space
• /
• v.13 no.6
• /
• pp.486-494
• /
• 2003

When the orientations of joints are measured on a rock exposure, there are frequent cases that are difficult to approach by the surveyor to the target joints or to set up scanlines on the slope. In this study, to complement such limit and weak points, a new algorithm was developed to interpret joint orientation from analyzing the images of rock slope. As a method of arranging the multiple images of a rock slope, the multistage convergent photographing system was introduced to overcome the limitation of photographing direction which existing method such as parallel stereophotogrammetric system has and to cover the range of image measurement, which is the overlapping area between the image pair, to a maximum extent. To determine camera parameters in the perspective projection equation that are the main elements of the analysis method, a new method was developed introducing three ground control points and single ground guide point. This method could be considered to be very simple compared with other existing methods using a number of ground control points and complicated analysis process. So the global coordinates of a specific point on a rock slope could be analyzed with this new method. The orientation of a joint could be calculated using the normal vector of the joint surface which can be derived from the global coordinates of several points on the joint surface analyzed from the images.

• Korean Journal of Applied Biomechanics
• /
• v.16 no.3
• /
• pp.1-7
• /
• 2006

The Primary type of swinging motion in human movement is that which is characteristic of a pendulum. The two types of pendulums are identified as simple and compound. A simple pendulum consist of a small body suspended by a relatively long cord. Its total mass is contained within the bob. The cord is not considered to have mass. A compound pendulum, on the other hand, is any pendulum such as the human body swinging by hands from a horizontal bar. Therefore a compound pendulum depicts important motions that are harmonic, periodic, and oscillatory. In this paper one discusses and compares two algorithms of Newton's method(F = m a) and Euler's method (M = $I{\times}{\alpha}$) in compound pendulum. Through exercise model such as human body with weight(m = 50 kg), body length(L = 1.5m), and center of gravity ($L_c$ = 0.4119L) from proximal end swinging by hands from a horizontal bar, one finds kinematic variables(angle displacement / velocity / acceleration), and simulates kinematic variables by changing body lengths and body mass. BSP by Clauser et al.(1969) & Chandler et al.(1975) is used to find moment of inertia of the compound pendulum. The radius of gyration about center of gravity (CoG) is $k_c\;=\;K_c{\times}L$ (단, k= radius of gyration, K= radius of gyration /segment length), and then moment of inertia about center of gravity(CoG) becomes $I_c\;=\;m\;k_c^2$. Finally, moment of inertia about Z-axis by parallel theorem becomes $I_o\;=\;I_c\;+\;m\;k^2$. The two-order ordinary differential equations of models are solved by ND function of numeric analysis method in Mathematica5.1. The results are as follows; First, The complexity of Newton's method is much more complex than that of Euler's method Second, one could be find kinematic variables according to changing body lengths(L = 1.3 / 1.7 m) and periods are increased by body length increment(L = 1.3 / 1.5 / 1.7 m). Third, one could be find that periods are not changing by means of changing mass(m = 50 / 55 / 60 kg). Conclusively, one is intended to meditate the possibility of applying a compound pendulum to sports(balling, golf, gymnastics and so on) necessary swinging motions. Further improvements to the study could be to apply Euler's method to real motions and one would be able to develop the simulator.