• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.911-918
• /
• 2002

An important issue in the design of future Personal Communication Service (PCS) networks is the efficient management of location information. In this paper, we propose an adaptive distributed dynamic location management algorithm that stores the position of the mobile terminal in k of the n location information databases (LIDs). The proposed algorithm chooses adaptively k. replication factor according to both the space locality of LIDs in wireless mobile networks and the location query popularity to local mobile terminal from remote mobile terminals. The performance of proposed algorithm is evaluated by both an analytical model and a simulation. Based on the results of performance evaluation, we know that the performance of the proposed algorithm is better than that of Krishnamurthi's algorithm regardless of call-mobility ratio.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.187-190
• /
• 2000

전형적인 멀티미디어 시스템은 클라이언트-서버 구조로 이루어지고 있다. 사용자의 요청에 따라 요청된 데이터를 갖고 있는 적절한 서버를 찾는 방법을 확장성 있게 지원하기 위해 계층적 관리 구조가 제시되었다. 이 접근방법에서는 중간 계층에서 영역 관리자가 사용자의 요청을 전달해 줌으로 인해서, 사용자 요청에 대한 거부 확률을 효과적으로 줄일 수 있다. 그러나 load balancing 을 이루기 위한 계층적 관리 구조에서는 정적 복제 방식을 사용함으로 인해서 사용자 요청에 대한 거부 확률이 최소화되지 못하였다. 따라서, 본 연구에서는 계층적 관리구조에 멀티미디어 데이터가 요청되는 패턴에 따라 동적으로 변화하는 동적 복제 방식을 도입할 것을 제안하고, 실험을 통하여 제안된 방법은 기존의 방법과 비교하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.64-66
• /
• 2005

인터넷은 수많은 AS(Autonomous System)들로 이루어져 있으며, 각 AS들은 ISP(Internet Service Provider)를 통하여 인터넷에 접속한다. AS와 ISP 사이에는 계층성과 네트워크 속도 차에 따른 대역폭 병목현상이 존재한다. 이러한 인터넷의 물리적 네트워크 구조는 그리드 환경에서 데이터 접근시간에 가장 큰 영향을 미친다. 기존의 데이터 그리드 복제 정책은 물리적 네트워크의 구조를 고려하지 못하였기 때문에 실제 인터넷 환경에서 최적의 성능을 얻지 못하는 문제점이 있었다. 본 논문에서는 실제 인터넷의 물리적 네트워크 구조를 고려한 데이터 그리드 복제 정책을 제안한다. 이 복제 정책은 ISP와 AS 단위로 복사본을 유지하여 병목현상을 최소화함으로써 전체적인 데이터 그리드의 성능을 향상시킨다.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.2
• /
• pp.267-277
• /
• 2017

One of fundamental problems in developing robust distributed services is how to achieve distributed consensus agreeing some data values that should be shared among participants in a distributed service. As one of algorithms for distributed consensus, Raft is known as a simple and understandable algorithm by decomposing the distributed consensus problem into three subproblems(leader election, log replication and safety). But, the algorithm dose not mention any types of dynamic configuration of participant peers such as adding new peers to a consensus group or deleting peers from the group. In this paper, we present a new consensus algorithm named Raft-D, which supports the dynamic configuration of participant peers by extending the Raft algorithm. For this, Raft-D manages the additional information maintained by participant nodes, and provides a technique to check the connection status of the nodes belonging to the consensus group. Based on the technique, Raft-D defines conditions and states to deal with adding new peers to the consensus group or deleting peers from the group. Based on those conditions and states, Raft-D performs the dynamic configuration process for a consensus group through the log update mechanism of the Raft algorithm.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1410-1420
• /
• 2006

In this paper, a replica update propagation method for cost optimization of request forwarding in the Grid database is proposed,. In the Grid database, the data is replicated for performance and availability. In the case of data update, update information is forwarded to the neighbor nodes to synchronize with the others replicated data. There are two kinds of update propagation method that are the query based scheme and the log based scheme. And, only one of them is commonly used. But, because of dynamically changing environment through property of update query and processing condition, strategies that using one propagation method increases transmission cost in dynamic environment. In the proposed method, the three classes are defined from two cost models of query and log based scheme. And, cost functions and update propagation method is designed to select optimized update propagation scheme from these three classes. This paper shows a proposed method has an optimized performance through minimum transmission cost in dynamic processing environment.

• The Journal of Korean Physical Therapy
• /
• v.16 no.3
• /
• pp.205-216
• /
• 2004

The purpose of this study is to find application of combination of insotonic(CI) in clinical approach. This is a literature study with books and clinical experience. CI was developed after Margaret Knott that is very useful in clinically. CI has two lever system. It has class II lever system for eccentric contraction and class III lever system for concentric contraction. Therefore it make two different contraction that is not only magnitude of motion and speed increase of motion but also biomechanical advantage. Application of CI has much variety by patient position and treatment position. Especially, it is very effectable on mat activities and training for mid stance period. CI apply in supine position on treatment table, mat or high mat activities, bridging activities, all fourth activities and sit on chair activities. CI apply serially with different techniques. These are rhythmic initiation, dynamic reversal, approximation, rhythmic stabilization and replication.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.623-632
• /
• 2006

We propose a peer-to-peer search scheme in which super peers with high rapacity constitute a ring by themselves and all peers utilize the ring for their query and publishing keys. In a dynamic peer-to-peer environment, the size of the super peer ring changes adaptively according to the changes of the system, but more powerful peers are continuously promoted to super peers. By simulations, we show that our proposed search scheme improves the query success rate of Gnutella+1hop replication search method, and maintains shorter query delay than JXTA as a static ring.

• Transactions of Materials Processing
• /
• v.22 no.1
• /
• pp.23-29
• /
• 2013

In this study, a micro/nano-random-pattern-structure surface was machined by electric discharge machining (EDM) followed by replicating the EDM surface with a silicone elastomer having low energy and greater hydrophobicity. The variation of hydrophobicity was of prime interest and was examined as a function of the surface roughness of the replicated silicone elastomer. The hydrophobicity was evaluated by the water contact angle (WCA) measured on the relevant surface. For the experiments, the original surfaces were machined by die sinking electric discharge machining (DS-EDM) and wire cutting electric discharge machining (WC-EDM). The ranges of surface roughness were Ra $0.8{\sim}19{\mu}m$ for the DS-EDM and Ra $0.5{\sim}4.7{\mu}m$ for the WC-EDM. In order to fabricate a hydrophobic surface, the EDM surfaces were directly replicated using a liquid-state silicone elastomer, which was thermally cured. The measured WCA on the replicated surfaces for DS-EDM was in the range of $115{\sim}130^{\circ}$ and for WC-EDM the WCA was in the range of $123{\sim}150^{\circ}$. Additionally, the dynamic hydrophobicity was evaluated by measuring an advancing and a receding WCA on the replicated silicone elastomer surfaces.

• Molecules and Cells
• /
• v.37 no.2
• /
• pp.126-132
• /
• 2014

As a tumor suppressor homologue during mitosis, Chk2 is involved in replication checkpoints, DNA repair, and cell cycle arrest, although its functions during mouse oocyte meiosis and early embryo development remain uncertain. We investigated the functions of Chk2 during mouse oocyte maturation and early embryo development. Chk2 exhibited a dynamic localization pattern; Chk2 expression was restricted to germinal vesicles at the germinal vesicle (GV) stage, was associated with centromeres at pro-metaphase I (Pro-MI), and localized to spindle poles at metaphase I (MI). Disrupting Chk2 activity resulted in cell cycle progression defects. First, inhibitor-treated oocytes were arrested at the GV stage and failed to undergo germinal vesicle breakdown (GVBD); this could be rescued after Chk2 inhibition release. Second, Chk2 inhibition after oocyte GVBD caused MI arrest. Third, the first cleavage of early embryo development was disrupted by Chk2 inhibition. Additionally, in inhibitor-treated oocytes, checkpoint protein Bub3 expression was consistently localized at centromeres at the MI stage, which indicated that the spindle assembly checkpoint (SAC) was activated. Moreover, disrupting Chk2 activity in oocytes caused severe chromosome misalignments and spindle disruption. In inhibitor-treated oocytes, centrosome protein ${\gamma}$-tubulin and Polo-like kinase 1 (Plk1) were dissociated from spindle poles. These results indicated that Chk2 regulated cell cycle progression and spindle assembly during mouse oocyte maturation and early embryo development.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1107-1117
• /
• 2006

In this paper, a load balancing method using ring network structure in the Grid database is proposed. In the Grid database, generally, data is replicated for performance and availability. And, user's request is transferred to node and processed in that node which has target data. But, in such environment, a decline of performance can be occurred because unbalanced workload. A traditional research is proposed to solve unbalanced load problem. However, the Grid database has a number of systems and user's request always changes dynamically. Therefore, a traditional research can not be applied. The proposed method connects each node which has a same replicated data through ing network structure. If workload is overflowed in some node, user's request is transferred to a linked node which has a target data. And, this node stops another request processing until workload is decreased. Then, it changes the link structure through sending a message to a previous node, to stop request forwarding from a previous node. This paper shows a proposed method increases performance than existing research through performance evaluation and is more suitable for a complex and dynamic environment.