• Journal of Chest Surgery
• /
• 제28권12호
• /
• pp.1144-1149
• /
• 1995

Adenocarcinoma involving esophago-gastric junction[EGJ is usually originated from the gastric cardia and it presents unique clinical manifestations, requires special surgical care, and bears a much poor prognosis. We analyse the clinical data of 109 adenocarcinoma involving EGJ operated between August, 1987 and March, 1994. Curative resection of primary tumor including esophagus and lymph node dissection was possible on 102 cases[93.5% . Among these cases, 89 cases were advanced state over the stage III. The operative mortality was 1.8% and postoperative morbidity was 16.5%. The overall 3 year and 5 year survival rate was 48.5%, 34.1% each, and median survival was 27.5 month in the curative resected cases. The treatment failure was mainly distant metastsis including lymph node, except one local recurrence.Among many factors influencing long term results of resected adenocarcinoma involving EGJ, the only effort a surgeon can make is to attain completeness of tumor removal by dissecting all involved lymph node and ensuring adequate tumor free margins of both esophageal and cardiac side.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2003년도 춘계학술대회 논문집 기술교육전문연구회
• /
• pp.90-95
• /
• 2003

For the safety driving of an automobile which is become individual requisites, a new Neural Network algorithm which recognized the load vehicles in real time is proposed. The proposed neural network technique is the real time computation method through the inter-node diffusion. In the network, a node corresponds to a state in the quantized input space. Each node is composed of a processing unit and fixed weights from its neighbor nodes as well as its input terminal. The most reliable algorithm derived for real time recognition of vehicles, is a dynamic programming based algorithm based on sequence matching techniques that would process the data as it arrives and could therefore provide continuously updated neighbor information estimates. Through several simulation experiments, real time reconstruction of the nonlinear image information is processed. 1-D LIPN hardware has been composed and various experiments with static and dynamic signals have been implemented.

• 한국분말야금학회:학술대회논문집
• /
• 한국분말야금학회 2006년도 Extended Abstracts of 2006 POWDER METALLURGY World Congress Part 1
• /
• pp.266-267
• /
• 2006

We present a systematic study of the heating and pre-sintering behavior of porous copper powder metal compacts. We employ a TE102 single mode microwave system to position the samples in the separated electric field (E) or magnetic field (H) anti-node of the cavity. We observe significant differences in the heating, pre-sintering, and microstructure evolution of the samples due to the individual fields. We note that sample history (whether heated first in the E-field or H-field) greatly effects a difference in heating trends and subsequent heating behavior and does not appear to be solely a thermal process.

• 정보처리학회논문지C
• /
• 제13C권2호
• /
• pp.211-218
• /
• 2006

Mobile IP는 노드의 이동성을 제공함으로써 보다 향상된 서비스를 제공해 준다. Mobile IP에서 이동노드는 이동시마다 홈 주소와 외부 네트워크에서의 주소를 바인딩 하기 위한 메시지를 홈에이전트에게 보내야 한다. 이러한 이동관리 메시지는 노드 자체의 처리비용과 네트워크상의 많은 트래픽을 유발할 수 있다. Paging Hierarchical Mobile IPv6(PHMIPv6)는 위치 관리 비용을 줄이기 위해 Hierarchical Mobile IPv6 (HMIPv6) 환경에서 페이징 기법을 적용하여 이동노드의 상태를 고려한 위치 관리를 수행한다. PHMIPv6에서 이동노드는 통신 중이지 않을 경우 도메인 내부에서 이동을 하여도 위치 바인딩 메시지를 보내지 않음으로써 위치 관리에 사용되는 비용을 절약할 수 있다. 그러나 외부에서 패킷이 도착 시 수행하는 페이징 메카니즘의 비용이 크기 때문에 상황에 따라 많은 위치 관리 비용이 발생할 수 있다. 본 논문에서는 PHMIPv6의 문제점을 분석하고 이동관리 시그널을 줄이기 위한 방안을 제안한다. 제안방안은 효율적으로 페이징 시그널을 줄임으로써 전체적인 위치 관리 비용을 줄이게 되고, 서브넷 수에 의존하지 않고 동작함으로써 HMIPv6 보다 약 50% 정도의 성능향상을 보였다.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1997년도 춘계학술대회
• /
• pp.150-155
• /
• 1997

Modelling and Simulation of the activation process for the myocardium is meaningful to understand special excitation conduction system in the heart and to study cardiac functions. In this paper, we propose two dimensional cellular automata model for the activation process of the myocardium and simulated by means of discrete time and discrete event algorithm. In the model, cells are classified into anatomically similar characteristic parts of heart; SA node, internodal tracks, AV node, His bundle, bundle branch and four layers of the ventricular muscle, each of which has a set of cells with preassigned properties, that is, activation time, refractory duration and conduction time between neighbor cell. Each cell in this model has state variables to represent the state of the cell and has some simple state transition rules to change values of state variables executed by state transition function. Simulation results are as follows. First, simulation of the normal and abnormal activation process for the myocardium has been done with discrete time and discrete event formalism. Next, we show that the simulation results of discrete time and discrete event cell space model is the same. Finally, we compare the simulation time of discrete event myocardium model with discrete time myocardium models and show that the discrete event myocardium model spends much less simulation time than discrete time myocardium model and conclude the discrete event simulation method Is excellent in the simulation time aspect if the interval deviation of event time is large.

• 한국통신학회논문지
• /
• 제19권6호
• /
• pp.1085-1094
• /
• 1994

본 논문에서는 망 노드에서의 폭주를 B-ISDN UNI에서 예방하기 위해 B-NT에서 일시적인 셀 저장 및 선택적 셀 폐기를 수행하는 트래픽 흐름 제어를 제안하였다. 제안된 구조는 B-NT 시스템에서 T 접속을 향하는 출력 셀 흐름을 감소 또는 억제시키도록 구성하고, 인접 망 노드의 상태를 정상, 준폭주, 폭주의 세상태로 정의하였다. 준폭주 상태에서는 손실에 민감한 트래픽은 일시적으로 저장되어 출력 셀 흐름의 속도를 저하시키고, 폭주 상태에서는 손실에 민감한 트래픽의 셀 저장과 더불어 지연에 민감한 트래픽의 셀이 선택적으로 폐기되어 최대한 출력 트래픽 흐름을 억제시킨다. 입력 셀 흐름과 망 노드 상태의 변화를 IBP와 3 상태 마르코프 체인으로 모델링하여 B-NT 시스템에서 제안된 구조의 성능 분석을 위한 시뮬레이션을 수행하여 적당한 버퍼 사이즈를 구하고 망 노드의 상태에 따른 제안한 구조의 성능 변화를 조사한 결과 망 노드에서의 폭주 정도가 극심한 경우에는 제안한 방법으로 제어가 거의 불가능하지만, 그 외의 경우에는 2,000셀 이상의 버퍼 사이즈로 제어가 가능함을 알 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권6호
• /
• pp.612-627
• /
• 2009

The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

• Journal of Computing Science and Engineering
• /
• 제11권2호
• /
• pp.49-57
• /
• 2017

This paper proposes a new IPv6 networking paradigm as a counter answer to the rationale for locator/identifier separation. Instead of involving separate number spaces each for node identifiers and locators, the context of the IP address as a node identifier alone is utilized and no additional locators are incorporated. That is, there are only node addresses and no locators, and location information is indirectly derived from neighbor relations between nodes. In order to accomplish this, no subnet IDs are utilized; the ID value is set to zero for all subnets. The paper details how to construct this paradigm through novel choice of operational policies in various IPv6 protocols and some trivial modifications. Especially, inherent provision of intra-domain node- as well as subnet-mobility by use of standard link-state intra-domain routing protocols is discussed. A number of important advantages of this paradigm over the canonical IPv6 networking and various known solutions of locator/identifier separation are discussed. Tailoring for multi-area domains and IPv4 is left for further study.

• ETRI Journal
• /
• 제37권1호
• /
• pp.77-87
• /
• 2015

In wireless networks, cooperation is necessary for many protocols, such as routing, clock synchronization, and security. It is known that cooperator nodes suffer greatly from problems such as increasing energy consumption. Therefore, rational nodes have no incentive to cooperatively forward traffic for others. A rational node is different from a malicious node. It is a node that makes the best decision in each state (cooperate or non-cooperate). In this paper, game theory is used to analyze the cooperation between nodes. An evolutionary game has been investigated using two nodes, and their strategies have been compared to find the best one. Subsequently, two approaches, one based on a genetic algorithm (GA) and the other on learning automata (LA), are presented to incite nodes for cooperating in a noisy environment. As you will see later, the GA strategy is able to disable the effect of noise by using a big enough chromosome; however, it cannot persuade nodes to cooperate in a noisefree environment. Unlike the GA strategy, the LA strategy shows good results in a noise-free environment because it has good agreement in cooperation-based strategies in both types of environment (noise-free and noisy).

• 디지털산업정보학회논문지
• /
• 제12권3호
• /
• pp.75-85
• /
• 2016

MANET is a network composed only mobile network having limited resources and has dynamic topology characteristics. Therefore, every mobile node acts as a route and delivers data by using multi-hop method. In particular, group communication such as multicast is desperately needed because of characteristics such as battery life of limited wireless bandwidth and mobile nodes. However, the multicast technique can have different efficient of data transmission according to configuring method of a virtual topology by the movement of the nodes and the performance of a multicast can be significantly degraded. In this paper, the region based security multicast technique is proposed in order to increase the efficiency of data transmission by maintaining an optimal path and enhance the security features in data transmission. The group management node that manages the state information of the member nodes after the whole network is separated to area for efficient management of multicast member nodes is used. Member node encrypts using member key for secure data transmission and the security features are strengthened by sending the data after encrypted using group key in group management node. The superiority of the proposed technique in this paper was confirmed through experiments.