• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.53-61
• /
• 2008

Consider a typical wireless sensor network in which stem nodes form the backbone network of mesh topology while each stem node together with leaf nodes in its vicinity forms a subnetwork of star topology. In such a wireless sensor network, we must heed the following when we design a MAC scheme supporting the packet delivery from a leaf node to a stem node. First, leaf nodes are usually battery-powered and it is difficult to change or recharge their batteries. Secondly, a wireless sensor network is often deployed to collect and update data periodically. Late delivery of a data segment by a sensor node causes the sink node to defer data processing and the data segment itself to be obsolete. Thirdly, extensive signaling is extremely limited and complex computation is hardly supported. Taking account of these facts, a MAC scheme must be able to save energy and support timeliness in packet delivery while being simple and robust as well. In this paper, we propose a version of ALOHA as a MAC scheme for a wireless sensor network. While conserving the simplicity and robustness of the original version of ALOHA, the proposed version of ALOHA possesses a distinctive feature that a sensor node decides between stop and continuation prior to each delivery attempt for a packet. Such a decision needs a stopping rule and we suggest a Bayes stopping rule. Note that a Bayes stopping rule minimizes the Bayes risk which reflects the energy, timeliness and throughput losses. Also, a Bayes stopping rule is practical since a sensor node makes a decision only using its own history of delivery attempt results and the prior information about the failure in delivery attempt. Numerical examples confirm that the proposed version of ALOHA employing a Bayes stopping rule is a useful MAC scheme in the severe environment of wireless sensor network.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.14 no.3
• /
• pp.1-10
• /
• 2011

This program was developed to operate and manage the massive digital forest cover type map using SDE(spatial database engine) in order to solve the problems of the analogue mapping system, mapping process and managing vast amounts of data. It was established the standardization process by performing the several functions of application related to the spatial DB search, mapping history and progress control, modification and inspection of the topology error, approval and reject of those maps. It can be possible to generate the effective mapping and distribute maps to the public service. It is expected that the results will be able to reduce time-cost.

• Journal of The Korean Astronomical Society
• /
• v.44 no.6
• /
• pp.217-234
• /
• 2011

We present two large cosmological N-body simulations, called Horizon Run 2 (HR2) and Horizon Run 3 (HR3), made using $6000^3$ = 216 billions and $7210^3$ = 374 billion particles, spanning a volume of $(7.200\;h^{-1}Gpc)^3$ and $(10.815\;h^{-1}Gpc)^3$, respectively. These simulations improve on our previous Horizon Run 1 (HR1) up to a factor of 4.4 in volume, and range from 2600 to over 8800 times the volume of the Millennium Run. In addition, they achieve a considerably finer mass resolution, down to $1.25{\times}10^{11}h^{-1}M_{\odot}$, allowing to resolve galaxy-size halos with mean particle separations of $1.2h^{-1}$Mpc and $1.5h^{-1}$Mpc, respectively. We have measured the power spectrum, correlation function, mass function and basic halo properties with percent level accuracy, and verified that they correctly reproduce the CDM theoretical expectations, in excellent agreement with linear perturbation theory. Our unprecedentedly large-volume N-body simulations can be used for a variety of studies in cosmology and astrophysics, ranging from large-scale structure topology, baryon acoustic oscillations, dark energy and the characterization of the expansion history of the Universe, till galaxy formation science - in connection with the new SDSS-III. To this end, we made a total of 35 all-sky mock surveys along the past light cone out to z = 0.7 (8 from the HR2 and 27 from the HR3), to simulate the BOSS geometry. The simulations and mock surveys are already publicly available at http://astro.kias.re.kr/Horizon-Run23/.

• Journal of Popular Narrative
• /
• v.25 no.1
• /
• pp.87-122
• /
• 2019

This paper examines how the melancholia and death drive foregrounded in Kwak Ji-kyun's films have changed the affect and production trend of South Korean melodrama films of the late 1980s and thereafter. It particularly analyzes Kwak's The Home of Two Women (1987) as his exemplary melodrama film. Kwak is not only an auteur filmmaker of the 1980s and 1990s but was also a herald of South Korean New Sentimentalist films back then. The New Sentimentalist filmmakers have aspired to sophisticate the South Korean melodrama film not only by de-sentimentalizing it from the shimpa quality but also separating it from excessive emotion of shimpa that had long dominated the national cinema. This affective sophistication is directly linked to the sense of loss and melancholia/depression of the characters in the film caused by the death of one's beloved. This New Sentimentalist affect is best represented in Kwak's The Home of Two Women through its depiction of the internal conflicts of artists struggling to artistically sublimate the death drive and sense of loss. By textually analyzing The Home of Two Women, this paper not only reevaluates Kwak's film style but also reposition the topology of the New Sentimentalists in Korean film history.

• The Journal of the Korea Contents Association
• /
• v.18 no.3
• /
• pp.70-80
• /
• 2018

Due to the recent development of social media and mobile devices, graph data have been using in various fields. In addition, caching techniques for reducing I/O costs in the process of large capacity graph data have been studied. In this paper, we propose a multi-layer caching scheme considering the connectivity of the graph, which is the characteristics of the graph topology, and the history of the past subgraph usage. The proposed scheme divides a cache into Used Data Cache and Prefetched Cache. The Used Data Cache maintains data by weights according to the frequently used sub-graph patterns. The Prefetched Cache maintains the neighbor data of the recently used data that are not used. In order to extract the graph patterns, their past history information is used. Since the frequently used sub-graphs have high probabilities to be reused, they are cached. It uses a strategy to replace new data with less likely data to be used if the memory is full. Through the performance evaluation, we prove that the proposed caching scheme is superior to the existing cache management scheme.

• Journal for History of Mathematics
• /
• v.22 no.2
• /
• pp.27-52
• /
• 2009

This article discusses the contributions of the leader Oswald Veblen, who was the president of AMS during 1923-1924. In 2006, Korea ranked 12th in SCIE publications in mathematics, more than doubling its publications in less than 10 years, a successful model for a country with relatively short history of modern mathematical research. Now there are 192 four-year universities in Korea. Some 42 of these universities have Ph.D. granting graduate programs in mathematics and/or mathematical education in Korea. Rapid growth is observed over a broad spectrum including a phenomenal performance surge in International Mathematical Olympiad. Western mathematics was first introduced in Korea in the 17th century, but real significant mathematical contributions by Korean mathematicians in modern mathematics were not much known yet to the world. Surprisingly there is no Korean mathematician who could be found in MaC Tutor History Birthplace Map. We are at the time, to have a clear vision and leadership for the 21st century. Even with the above achievement, Korean mathematical community has had obstacles in funding. Many people thinks that mathematical research can be done without funding rather unlike other science subjects, even though they agree fundamental mathematical research is very important. We found that the experience of early American mathematical community can help us to give a vision and role model for Korean mathematical community. When we read the AMS Notice article 'The Vision, Insight, and Influence of Oswald Veblen' by Steve Batterson, it answers many of our questions on the development of American mathematics in early 20th century. We would like to share the story and analyze its meaning for the development of Korean Mathematics of 21st century.