• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.8
• /
• pp.5513-5521
• /
• 2015

There is an operational efficiency problem about wayside equipment applied to the domestic low-density branch as the equipment has been installed and operated similarly in the mainline. On-board oriented train control system, which has been developed for train safety and operation efficiency, ensures safe train operation without expensive ground control signal devices. Such system consists of on-board control system, wayside control system, and local control system. In this paper, the details of tests such as suitability test, communication test, and interface test are described by installing the on-board control system and wayside control system in field. Installation tests include checking power, voltage, cable connection, LED status, etc. Field applicability of the developed system is also verified through the dynamic operation tests with diverse scenarios, which are performed on the virtual line similar to the real environment including switch machine and level crossing gate. Dynamic operation tests were conducted for total 7 scenarios, and several tests were repeated for each scenario. The elapsed time for each operation was computed by analyzing main process log, and we could check that each operation was accomplished within several seconds. Furthermore, the developed system was verified through field test with an accredited institute, and testing certificates were issued.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.8
• /
• pp.171-180
• /
• 2020

Smart Factory consists of digital automation solutions throughout the production process, including design, development, manufacturing and distribution, and it is an intelligent factory that installs IoT in its internal facilities and machines to collect process data in real time and analyze them so that it can control itself. The smart factory's equipment works in a physical combination of numerous hardware, rather than a virtual character being driven by a single object, such as a game. In other words, for a specific common goal, multiple devices must perform individual actions simultaneously. By taking advantage of the smart factory, which can collect process data in real time, if reinforcement learning is used instead of general machine learning, behavior control can be performed without the required training data. However, in the real world, it is impossible to learn more than tens of millions of iterations due to physical wear and time. Thus, this paper uses simulators to develop grid sortation systems focusing on transport facilities, one of the complex environments in smart factory field, and design cooperative multi-agent-based reinforcement learning to demonstrate efficient behavior control.

• Proceedings of the Korean Institute of Surface Engineering Conference
• /
• 2018.06a
• /
• pp.102-102
• /
• 2018

Electronic industry had required the finer size and the higher performance of the device. Therefore, 3-D die stacking technology such as TSV (through silicon via) and micro-bump had been used. Moreover, by the development of the 3-D die stacking technology, 3-D structure such as chip to chip (c2c) and chip to wafer (c2w) had become practicable. These technologies led to the appearance of HBM (high bandwidth memory). HBM was type of the memory, which is composed of several stacked layers of the memory chips. Each memory chips were connected by TSV and micro-bump. Thus, HBM had lower RC delay and higher performance of data processing than the conventional memory. Moreover, due to the development of the IT industry such as, AI (artificial intelligence), IOT (internet of things), and VR (virtual reality), the lower pitch size and the higher density were required to micro-electronics. Particularly, to obtain the fine pitch, some of the method such as copper pillar, nickel diffusion barrier, and tin-silver or tin-silver-copper based bump had been utillized. TCB (thermal compression bonding) and reflow process (thermal aging) were conventional method to bond between tin-silver or tin-silver-copper caps in the temperature range of 200 to 300 degrees. However, because of tin overflow which caused by higher operating temperature than melting point of Tin ($232^{\circ}C$), there would be the danger of bump bridge failure in fine-pitch bonding. Furthermore, regulating the phase of IMC (intermetallic compound) which was located between nickel diffusion barrier and bump, had a lot of problems. For example, an excess of kirkendall void which provides site of brittle fracture occurs at IMC layer after reflow process. The essential solution to reduce the difficulty of bump bonding process is copper to copper direct bonding below $300^{\circ}C$. In this study, in order to improve the problem of bump bonding process, copper to copper direct bonding was performed below $300^{\circ}C$. The driving force of bonding was the self-annealing properties of electrodeposited Cu with high defect density. The self-annealing property originated in high defect density and non-equilibrium grain boundaries at the triple junction. The electrodeposited Cu at high current density and low bath temperature was fabricated by electroplating on copper deposited silicon wafer. The copper-copper bonding experiments was conducted using thermal pressing machine. The condition of investigation such as thermal parameter and pressure parameter were varied to acquire proper bonded specimens. The bonded interface was characterized by SEM (scanning electron microscope) and OM (optical microscope). The density of grain boundary and defects were examined by TEM (transmission electron microscopy).

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1283-1291
• /
• 2005

One of the problems in boosting Java performance using a Just-in-Time (JIT) compiler is removing redundant array bound checks. In conventional static compilers, many powerful algorithms have been developed, yet they are not directly applicable to JIT compilation where the compilation time is part of the whole running time. In the current JIT compilers, we tan use either a naive algorithm that is not powerful enough or an aggressive algorithm which requires the transformation into a static single assignment (SSA) form of programs (and back to the original form after optimization), thus causing too much overhead not appropriate for JIT compilation This paper proposes a new algorithm based on an inequality graph which can eliminate array bounds check codes aggressively without resorting to the SSA form. When we actually perform this type of optimization, there are many constraints in code motion caused by the precise exception rule in Java specification, which would cause the algorithm to miss many opportunities for eliminating away bound checks. We also propose a new method to overcome these constraints.

• Imaging Science in Dentistry
• /
• v.42 no.3
• /
• pp.139-146
• /
• 2012

Purpose: An individual surgical stent fabricated from computed tomography (CT) data, called a CT-guided stent, would be useful for accurate installation of implants. The purpose of the present study was to introduce a newly developed CT-guided stent with a simple design and evaluate the accuracy of the stent placement. Materials and Methods: A resin template was fabricated from a hog mandible and a specially designed plastic plate, with 4 metal balls inserted in it for radiographic recognition, was attached to the occlusal surface of the template. With the surgical stent applied, CT images were taken, and virtual implants were placed using software. The spatial positions of the virtually positioned implants were acquired and implant guiding holes were drilled into the surgical stent using a specially designed 5-axis drilling machine. The surgical stent was placed on the mandible and CT images were taken again. The discrepancy between the central axis of the drilled holes on the second CT images and the virtually installed implants on the first CT images was evaluated. Results: The deviation of the entry point and angulation of the central axis in the reference plane were $0.47{\pm}0.27$ mm, $0.57{\pm}0.23$ mm, and $0.64{\pm}0.16^{\circ}$, $0.57{\pm}0.15^{\circ}$, respectively. However, for the two different angulations in each group, the $20^{\circ}$ angulation showed a greater error in the deviation of the entry point than did the $10^{\circ}$ angulation. Conclusion: The CT-guided template proposed in this study was highly accurate. It could replace existing implant guide systems to reduce costs and effort.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.831-845
• /
• 1997

In this paper,we proposed and developed a compiler and interactive programming enviroments for C++ wich is mostly worth of nitice among the object -oriented languages.To develope the compiler for C++ we took front=end/back-end model using EM virtual machine.In develpoing Front-End,we formailized C++ gram-mar with the context semsitive tokens which must be manipulated by dexical scanner and designed a AST class li-brary which is the hierarchy of AST node class and well defined interface among them,In develpoing Bacik-End,we proposed model for three major components :code oprtimizer,code generator and run-time enviroments.We emphasized the retargatable back-end which can be systrmatically reconfigured to genrate code for a variety of distinct target computers.We also developed terr pattern matching algorithm and implemented target code gen-erator which produce SPARC code.We also proposed the theroy and model for construction interative pro-gramming enviroments. To represent language features we adopt AST as internal reprsentation and propose uncremental analysis algorithm and viseal digrams.We also studied unparsing scheme, visual diagram,graphical user interface to generate interactive environments automatically Results of our resarch will be very useful for developing a complier and programming environments, and also can be used in compilers for parallel and distributed enviroments.

• Journal of the Korean Association of Oral and Maxillofacial Surgeons
• /
• v.33 no.5
• /
• pp.511-517
• /
• 2007

Purpose: The aim of this study is to determine whether a difference in the amount of bone graft material is needed between edentulous patients and dentulous patients and to calculate the amount of augmentation for a sinus lift procedure. Methods: 19 patients(20 sinuses) were included to measure maxillary sinus volume. Facial CT scanning was performed using MX 8000 IDT CT devices(Philips, USA). And it was used for IDLvm(The IDL Virtual Machine) 6.0, CT Volume Analyzer Ver 2.3 program to measure maxillary sinus volumes Results: At edentulous patients, volumes(mean${\pm}SD$) of the inferior portion of the sinuses were $0.56{\pm}0.13cm^3$(5mm height), $2.35{\pm}0.57cm^3$(10mm height), $4.85{\pm}1.10cm^3$(15mm height). At dentulous patients, volumes(mean${\pm}SD$) of the inferior portion of the sinuses were $0.41{\pm}0.18cm^3$(5mm height), $1.76{\pm}0.42cm^3$(10mm height), $3.80{\pm}0.84cm^3$ (15mm height). A significant correlation was found between augmentation height(5mm, 10mm, 15mm) and the calculated sinus volume.(p=0.027, p=0.018, p=0.044) Conclusions: A significant correlation was found between augmentation height(5mm, 10mm, 15mm) and the calculated sinus volume. Detailed preoperative knowledge of sinus lift augmentation volume is helpful in determining the appropriate amount of the bone graft material.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.113-118
• /
• 2013

The current GPU virtualization techniques incur large overheads when executing application programs mainly due to the fine-grain time-sharing scheduling of the GPU among multiple Virtual Machines (VMs). Besides, the current techniques lack of portability, because they include the APIs for the GPU computations in the VM monitor. In this paper, we propose a low overhead and high performance GPU virtualization approach on a heterogeneous HPC system based on the open-source Xen. Our proposed techniques are tailored to the bio applications. In our virtualization framework, we allow a VM to solely occupy a GPU once the VM is assigned a GPU instead of relying on the time-sharing the GPU. This improves the performance of the applications and the utilization of the GPUs. Our techniques also allow a direct pass-through to the GPU by using the IOMMU virtualization features embedded in the hardware for the high portability. Experimental studies using microbiology genome analysis applications show that our proposed techniques based on the direct pass-through significantly reduce the overheads compared with the previous Domain0 based approaches. Furthermore, our approach closely matches the performance for the applications to the bare machine or rather improves the performance.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.5
• /
• pp.901-909
• /
• 2021

Since mobile devices have limited computational resources, it tends to use the cloud to compute or store data. As real-time becomes more important due to 5G, many studies have been conducted on edge clouds that computes at locations closer to users than central clouds. The farther the user's physical distance from the edge cloud connected to base station is, the slower the network transmits. So applications should be migrated and re-run to nearby edge cloud for smooth service use. We run applications in docker containers, which is independent of the host operating system and has a relatively light images size compared to the virtual machine. Existing migration studies have been experimented by using network simulators. It uses fixed values, so it is different from the results in the real-world environment. In addition, the method of migrating images through shared storage was used, which poses a risk of packet content exposure. In this paper, Containers are migrated with Secure CoPy(SCP) method, a data encryption transmission, by establishing an edge computing environment in a real-world environment. It compares migration time with Network File System, one of the shared storage methods, and analyzes network packets to verify safety.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2018.05a
• /
• pp.202-202
• /
• 2018

본 논문에서는 분포형 강우-유출 모형인 GRM(Grid based Rainfall-runoff Model)(최윤석, 김경탁, 2017)을 이용해서 낙동강 유역을 대상으로 대유역 홍수해석시스템을 구축하고, 유출해석을 위한 실행시간을 평가하였다. 유출모형은 낙동강의 주요 지류와 본류를 소유역으로 구분하여 모형을 구축하고, 각 소유역의 유출해석 결과를 실시간으로 연계할 수 있도록 하여 낙동강 전체 유역의 유출모형을 구축하였다. 이와 같이 하나의 대유역을 다수의 소유역시스템으로 분할하여 모형을 구축할 경우, 유출해석시스템 구성이 복잡해지는 단점이 있으나, 소유역별로 각기 다른 자료를 이용하여 다양한 해상도로 유출해석을 할 수 있으므로, 소유역별 특성에 맞는 유출모형 구축이 가능한 장점이 있다. 또한 각 소유역시스템은 별도의 프로세스로 계산이 진행되므로, 대유역을 고해상도로 해석하는 경우에도 계산시간을 단축할 수 있다. 본 연구에서는 낙동강 유역을 20개(본류 구간 3개, 1차 지류 13개, 댐상류 4개)의 소유역으로 분할하여 계산 시간을 검토하였으며, 최종적으로 21개(본류 구간 3개, 1차 지류 13개, 댐상류 5개)의 소유역으로 분할하여 유출해석시스템을 구축하였다. 댐 상류 유역은 댐하류와 유량전달이 없이 독립적으로 모의되고, 댐과 연결된 하류 유역은 관측 방류량을 상류단 하천의 경계조건으로 적용한다. 지류 유역은 본류 구간과 연결되고, 지류의 계산 유량은 본류와의 연결지점에 유량조건으로 실시간으로 입력된다. 이때 본류와 지류의 유량 연계는 데이터베이스를 매개로 하였다. 유출해석시스템의 성능을 평가하기 위해서 Microsoft 클라우드 서비스인 Azure를 이용하였다. 낙동강 유역을 20개 소유역으로 구성한 경우에서의 유출해석시스템의 속도 평가 결과 Azure virtual machine instance DS15 v2(OS : Windows Server 2012 R2, CPU : 2.4 GHz Intel $Xeon^{(R)}$ E5-2673 v3 20 cores)에서 1.5분이 소요 되었다. 계산시간 평가시 GRM은 'IsParallel=false' 옵션을 적용하였으며, 모의 기간은 24시간을 기준으로 하였다. 연구결과 분포형 모형을 이용한 대유역 유출해석시스템 구축이 가능했으며, 계산시간도 충분히 단축할 수 있었다. 또한 추가적인 CPU와 병렬계산을 적용할 경우, 계산시간은 더 단축될 수 있으며, 이러한 기법들은 분포형 모형을 이용한 대유역 유출해석시스템 구축시 유용하게 활용될 수 있을 것으로 판단된다.