• The Bulletin of The Korean Astronomical Society
• /
• v.36 no.2
• /
• pp.110.1-110.1
• /
• 2011

오리온 A 분자운은 별탄생이 활발하게 일어나는 영역이다. 때문에 분자운 연구를 통해서 별탄생을 연구하기에는 최적의 곳이다. 특기할 것은 Orion A에는 필라멘트 구조가 있다는 점이다. 필라멘트는 전형적으로는 길이 4.8pc, 너비 1.4 pc 로 제시되었다(Nagahama et al. 1998). 많은 미지의 조건들 가운데 필라멘트 구조는 별탄생에 대한 새로운 조명을 던져주는 데, 가령 분자운이 수축, 분열하며 작은 덩어리를 만드는 과정에 이런 기다란 구조가 별탄생에 어떤 과정에서 나타나며 이것이 별탄생이 어떤 효과를 발생하는지 연구되어야 하는 문제들이다. 대덕전파안테나의 1분의 분해능(Channel resolution 63 KHz/ Band Width 25 MHz) 의 12CO, 13CO(J=1-0) 분자선 관측으로 필라멘트를 이전 연구보다 자세하게 관측하여 이것 안에 있을 것으로 보이는 substructure들 연구하고자 한다. 관측영역은 적경: 5h 32m ~ 5h 37m, 적위: $-5^{\circ}$ 14' ~ $-5^{\circ}$ 37'으로 ($1^{\circ}{\times}1^{\circ}$) 영역을 관측하였다. 그 결과 필라멘트구조를 확인할 수 있었으며 약 0.7pc,약 $1000\;M_{\odot}$의 덩어리들이 이전관측에서 보여진 X자형태가 아니라 일자형태로 분포되어있는 것을 알 수 있었다. 관측된 최소덩어리는 star cluster mass이고 stellar size 의 덩어리는 별탄생 과정 이후 소멸된 것으로 보인다. 관측으로 확인된 덩어리들의 물리적인 성질과 분포를 깊이 연구해 보고자 한다. 향후 Orion A 전체를 추가로 관측하고자 한다.

• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.2
• /
• pp.54.2-54.2
• /
• 2015

Within 100 pc of the Galactic Centre the tidal field is extremely strong. We investigate the survival of star clusters of different masses in strong tidal fields. We show that dense low-mass clusters are destroyed by strong tidal fields as the tidal fields add energy to the cluster. Only massive clusters (like the Arches) can survive for more than 1-2 Myr in strong tidal fields. Therefore, in Galactic Centre environments only massive young clusters should ever be observed.

• Proceedings of the Korea Society of Costume Conference
• /
• 2003.10a
• /
• pp.82-82
• /
• 2003

The purposes of this study were to examine the purchasing and using behaviors of cosmetics according to women's consumption propensity. A self administered Questionnaire was used and the subjects were 600 women of 20s and 30s in Jeonbuk Province. The data collecting periods were July, 2003. Means, percentages, and frequency were calculated. And factor analysis, cluster analysis, one-way ANOVA, and Chi-square test were done by use of SPSS PC (Ver. 10.0).

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.355-357
• /
• 2004

최근 무선통신기술의 발전으로 PC뿐만 아니라 PDA, 휴대폰 등 다양한 장치를 통하여 멀티미디어 서비스를 제공받을 수 있게 되었다. 무선망은 유선망에 비해 대역폭이 낮기 때문에 높은 비트율을 갖는 스트림을 낮은 비트율로 변환하기 위해 트랜스코딩을 이용한다. 따라서 이러한 트랜스코딩 시스템에서 효율적으로 무선 스트리밍을 전송하기 위해서는 부하분산에 관한 연구가 필요하다 본 논문에서 제안한 클러스터 트랜스코딩 시스템은 스트리밍 서비스의 모바일 호스트 등급에 따른 CPU 사용량, 네트워크 대역폭, 메모리의 가중치를 계산하여 부하 배분에 사용할 수 있는 부하 분산 모델을 제시한다.

• The KIPS Transactions:PartA
• /
• v.12A no.7 s.97
• /
• pp.627-636
• /
• 2005

This paper presents a PC cluster-based distributed video on demand (VOD) server that minimizes the load of the interconnection network by adopting channel bonding-based MVIA and the interval cache algorithm Video data is distributed to the disks of each server node of the distributed VOD server and each server node receives the data through the interconnection network and sends it to clients. The load of the interconnection network increases because of the large volume of video data transferred. We adopt two techniques to reduce the load of the interconnection network. First, an Msupporting channel bonding technique is adopted for the interconnection network. n which is a user-level communication protocol that reduces the overhead of the TCP/IP protocol in cluster systems, minimizes the time spent in communicating. We increase the bandwidth of the interconnection network using the channel bonding technique with MThe channel bonding technique expands the bandwidth by sending data concurrently through multiple network cards. Second, the interval cache reduces traffic on the interconnection network by caching the video data transferred from the remote disks in main memory Experiments using the distributed VOD server of this paper showed a maximum performance improvement of $30\%$ compared with a distributed VOD server without channel bonding-based MVIA and the interval cache, when used with a four-node PC cluster.

• Korean Journal of Plant Taxonomy
• /
• v.40 no.3
• /
• pp.145-152
• /
• 2010

The external morphological characters of the Korean Oldenlandia were reviewed, and numerical analysis of 25 quantitative characters carried out to evaluate the delimitation of the taxa. Among the qualitative characters, the leaf shape, inflorescence, pilose of insde corolla, expansion of capsule apex, and seed shape were used to delimit 5 species of Korean Oldenlandia. As the result of principal component analysis of quantitative characters, O. corymbosa, O. hirsuta and O. strigulosa were evidently separated on a two-dimensional plot by PC1 and PC2, and O. brachypoda and O. diffusa slightly overlapped. However, O. brachypoda was distinctly delimited from O. diffusa by the shape of calyx lobe, the lengths of pedicel, filament and stigma. Also each of those two species was in a group of its own by cluster analysis.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.3
• /
• pp.60-71
• /
• 2017

Smart devices such as smart phones, smart TVs, and smart pads have become essential devices in recent years. As the popularity and demand grows, the performance of smart devices is also getting better and users are dealing with a lot of things such as education and business using smart devices instead of desktop. However, smart devices that still have poor performance compared to desktop, even with improved performance, have difficulty running high performance applications due to limited resources. In this paper, we propose a load balancing algorithm applying the characteristics of smart devices to overcome the resource limitations of devices. in order to verify the algorithm, we implemented the algorithm after adding the distributed processing system service in Android platform. After constructing the cluster on the smart device, various experiments were conducted. Through the analysis of the test results, it is confirmed that the proposed algorithm efficiently improves the overall distributed processing performance by effectively aggregating different amounts of computing resources in heterogeneous smart devices.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.363-372
• /
• 2009

For large scale VOD service, cluster servers are spotlighted to their high performance and low cost. A cluster server usually consists of a front-end node and multiple back-end nodes. Though increasing the number of back-end nodes can result in the more QoS streams for clients, the possibility of failures in back-end nodes is proportionally increased. The failure causes not only the stop of all streaming service but also the loss of the current playing positions. In this paper, when a back-end node becomes a failed state, the recovery mechanisms are studied to support the unceasing streaming service. For the actual VOD service environment, we implement a cluster-based VOD servers composed of general PCs and adopt the parallel processing for MPEG movies. From the implemented VOD server, a video block recovery mechanism is designed on parity algorithms. However, without considering the architecture of cluster-based VOD server, the application of the basic technique causes the performance bottleneck of the internal network for recovery and also results in the inefficiency CPU usage of back-end nodes. To address these problems, we propose a new failure recovery mechanism based on the pipeline computing concept.

• Journal of the Korea Society for Simulation
• /
• v.19 no.3
• /
• pp.91-98
• /
• 2010

This paper is on the research result for analyzing the performance of GLORY(GLobal Resource management sYstem) used for Web Server Cluster system, which was developed at ETRI(Electronic and Telecommunication Research Institute). The paper includes the definition of Web Server Cluster System, the characteristics of the system, user oriented system performance, current performance enhancement methods, computer simulation model for GLORY and its experimental results for the performance of GLORY. GLORY is composed of 2048~1,000,000 units of PCs, and is used for Internet servers. From the results of the simulation experiments, we notice that GLORY has enough capacity to fully serve the appropriate level of Internet services. Also, the results show that Web server service time is longer than that for network transmission time but requires more DNS than expected, and that 100Mbps LAN is good enough for directly connecting Internet to the Web servers while not affecting the total system performance.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.169-180
• /
• 2009

Generally home networks are based on wired network and wireless network. This makes customers be capable of using electric home appliances and full-duplex multimedia services and controlling the machines without any restrictions of place or time. Now that the scope of home security is being extended, the home networks can be formed with not only personal computer but also home automation, electric home appliances, and etc. But this causes many of attacks of invasion and damages. Therefore in this paper we suggest the SSIP(Secure Session Initiate protocol) model for solving those problems. The SSIP model is able to provide an efficient authentication and reduce the time of session re-establishment and set-up by adding ability of SIP authentication to Cluster-to-Cluster environment performed on home gateway.