• Title/Summary/Keyword: Multiple node

Search Result 789, Processing Time 0.027 seconds

Worse Survival of Patients With T1 Stage II Gastric Cancer Following Radical Gastrectomy

  • Hayemin Lee;Kyo Young Song;Han Hong Lee;Junhyun Lee
    • Journal of Gastric Cancer
    • /
    • v.23 no.4
    • /
    • pp.598-608
    • /
    • 2023
  • Purpose: Lymph node (LN) metastasis is a crucial factor in the prognosis of patients with gastric cancer (GC) and is known to occur more frequently in cases with an advanced T stage. This study aimed to analyze the survival data of patients with advanced LN metastasis in T1 GC. Materials and Methods: From January 2008 to June 2018, 677 patients with pathological stage II GC who underwent radical gastrectomy were divided into an early GC group (EG: T1N2 and T1N3a, n=103) and an advanced GC (AGC) group (AG: T2N1, T2N2, T3N0, T3N1, and T4aN0, n=574). Short- and long-term survival rates were compared between the 2 groups. Results: A total of 80.6% (n=83) of the patients in the EG group and 52.8% (n=303) in the AG group had stage IIA AGC. The extent of LN dissection, number of retrieved LNs, and short-term morbidity and mortality rates did not differ between the 2 groups. The 5-year relapse-free survival (RFS) of all patients was 87.8% and the overall survival was 84.0%. RFS was lower in the EG group than in the AG group (82.2% vs. 88.7%, P=0.047). This difference was more pronounced among patients with stage IIA (82.4% vs. 92.9%, P=0.003). Conclusions: T1 GC with multiple LN metastases seems to have a worse prognosis compared to tumors with higher T-stages at the same level. Adjuvant chemotherapy is highly recommended for these patients, and future staging systems may require upstaging T1N2-stage tumors.

Aircraft application with artificial fuzzy heuristic theory via drone

  • C.C. Hung;T. Nguyen;C.Y. Hsieh
    • Advances in aircraft and spacecraft science
    • /
    • v.10 no.6
    • /
    • pp.495-519
    • /
    • 2023
  • The drone serves the customers not served by vans. At the same time, considering the safety, policy and terrain as well as the need to replace the battery, the drone needs to be transported by truck to the identified station along with the parcel. From each such station, the drone serves a subset of customers according to a direct assignment pattern, i.e., every time the drone is launched, it serves one demand node and returns to the station to collect another parcel. Similarly, the truck is used to transport the drone and cargo between stations. This is somewhat different from the research of other scholars. In terms of the joint distribution of the drone and road vehicle, most scholars will choose the combination of two transportation tools, while we use three. The drone and vans are responsible for distribution services, and the trucks are responsible for transporting the goods and drone to the station. The goal is to optimize the total delivery cost which includes the transportation costs for the vans and the delivery cost for the drone. A fixed cost is also considered for each drone parking site corresponding to the cost of positioning the drone and using the drone station. A discrete optimization model is presented for the problem in addition to a two-phase heuristic algorithm. The results of a series of computational tests performed to assess the applicability of the model and the efficiency of the heuristic are reported. The results obtained show that nearly 10% of the cost can be saved by combining the traditional delivery mode with the use of a drone and drone stations.

A Case of Multiple Giant Coronary Aneurysms with Large Mural Thrombus due to Kawasaki Disease in a Young Infant (가와사끼병 영아에서 발생한 혈전을 동반한 거대관상동맥류 1례)

  • Choi, Eun Na;Kim, Jeoung Tae;Kim, Yuria;Yoo, Byung Won;Choi, Deok Young;Choi, Jae Young;Sul, Jun Hee;Lee, Sung Kye;Kim, Dong Soo;Park, Young Hwan
    • Clinical and Experimental Pediatrics
    • /
    • v.48 no.3
    • /
    • pp.321-326
    • /
    • 2005
  • Kawasaki disease is an acute systemic vasculitis of unknown origin. Giant coronary aneurysm is one of the most serious complications, although peripheral artery vasculitis can produce life-threatening events. Myocardial ischemia and infarction can be caused by coronary artery stenosis, aneurysm, and stagnation of blood flow in coronary arteries which triggers thromboembolism. Atypical presentation in young infants often interferes with prompt diagnosis and timely treatment, resulting in poor outcomes. We describe a 3-month-old infant with multiple giant coronary aneurysms with flow stagnation, stenosis and large mural thrombus due to Kawasaki disease. He presented with a prolonged course of severe coronary involvement in spite of all measures to reduce coronary complications. Finally, surgical intervention was tried because of the worsening coronary artery abnormalities. The patient died of acute cardiorespiratory failure shortly after weaning from cardiopulmonary bypass.

Cost-Effective Inter-LMA Domain Distributed Mobility Control Scheme in PMIPv6 Networks (PMIPv6 네트워크에서 비용효과적인 도메인 간의 분산 이동성 제어기법)

  • Jang, Soon-Ho;Jeong, Jong-Pil
    • The KIPS Transactions:PartC
    • /
    • v.19C no.3
    • /
    • pp.191-208
    • /
    • 2012
  • Proxy Mobile IPv6 (PMIPv6) is designed to provide network-based mobility management support to an MN without any involvement of the MN in the mobility related signalling, hence, the proxy mobility entity performs all related signalling on behalf of the MN. The new principal functional entities of PMIPv6 are the local mobility anchor (LMA) and the mobile access gateway (MAG). In PMIPv6, all the data traffic sent from the MN gets routed to the LMA through a tunnel between the LMA and the MAG, but it still has the single point of failure (SPOF) and bottleneck state of traffic. To solve these problems, various approaches directed towards PMIPv6 performance improvements such as route optimization proposed. But these approaches add additional signalling to support MN's mobility, which incurs extra network overhead and still has difficult to apply to multiple-LMA networks. In this paper, we propose a improved route optimization in PMIPv6-based multiple-LMA networks. All LMA connected to the proxy internetworking gateway (PIG), which performs inter-domain distributed mobility control. And, each MAG keeps the information of all LMA in PMIPv6 domain, so it is possible to perform fast route optimization. Therefore, it supports route optimization without any additional signalling because the LMA receives the state information of route optimization from PIG.

Improvement of Class Reuse at Sensor Network System Based on TinyOS Using CATL Model and Facade Pattern (CATL 모델과 Facade 패턴을 이용한 TinyOS 기반 센서네트워크 시스템 클래스 재사용 개선)

  • Baek, Jeong-Ho;Lee, Hong-Ro
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.15 no.2
    • /
    • pp.46-56
    • /
    • 2012
  • Recently, when software architecture is designed, the efficiency of reusability is emphasized. The reusability of the design can raise the quality of GIS software, and reduce the cost of maintenance. Because the object oriented GoF design pattern provides the class hierarchy that can represent repetitively, the importance is emphasized more. This method that designs the GIS software can be applied from various application systems. A multiple distributed sensor network system is composed of the complex structure that each node of the sensor network nodes has different functions and sensor nodes and server are designed by the combination of many classes. Furthermore, this sensor network system may be changed into more complex systems according to a particular purpose of software designer. This paper will design the CATL model by applying Facade pattern that can enhance the efficiency of reuse according to attributes and behaviors in classes in order to implement the complicated structure of the multiple distributed sensor network system based on TinyOS. Therefore, our object oriented GIS design pattern model will be expected to utilize efficiently for design, update, or maintenance, etc. of new systems by packing up attributes and behaviors of classes at complex sensor network systems.

Test Case Generation for Simulink/Stateflow Model Based on a Modified Rapidly Exploring Random Tree Algorithm (변형된 RRT 알고리즘 기반 Simulink/Stateflow 모델 테스트 케이스 생성)

  • Park, Han Gon;Chung, Ki Hyun;Choi, Kyung Hee
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.12
    • /
    • pp.653-662
    • /
    • 2016
  • This paper describes a test case generation algorithm for Simulink/Stateflow models based on the Rapidly exploring Random Tree (RRT) algorithm that has been successfully applied to path finding. An important factor influencing the performance of the RRT algorithm is the metric used for calculating the distance between the nodes in the RRT space. Since a test case for a Simulink/Stateflow (SL/SF) model is an input sequence to check a specific condition (called a test target in this paper) at a specific status of the model, it is necessary to drive the model to the status before checking the condition. A status maps to a node of the RRT. It is usually necessary to check various conditions at a specific status. For example, when the specific status represents an SL/SF model state from which multiple transitions are made, we must check multiple conditions to measure the transition coverage. We propose a unique distance calculation metric, based on the observation that the test targets are gathered around some specific status such as an SL/SF state, named key nodes in this paper. The proposed metric increases the probability that an RRT is extended from key nodes by imposing penalties to non-key nodes. A test case generation algorithm utilizing the proposed metric is proposed. Three models of Electrical Control Units (ECUs) embedded in a commercial vehicle are used for the performance evaluation. The performances are evaluated in terms of penalties and compared with those of the algorithm using a typical RRT algorithm.

Design and Implementation of a High-Performance Index Manager in a Main Memory DBMS (주기억장치 DBMS를 위한 고성능 인덱스 관리자의 설계 및 구현)

  • Kim, Sang-Wook;Lee, Kyung-Tae;Choi, Wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7B
    • /
    • pp.605-619
    • /
    • 2003
  • The main memory DBMS(MMDBMS) efficiently supports various database applications that require high performance since it employs main memory rather than disk as a primary storage. In this paper, we discuss the index manager of the Tachyon, a next-generation MMDBMS. Recently, the gap between the CPU processing and main memory access times is becoming much wider due to rapid advance of CPU technology. By devising data structures and algorithms that utilize the behavior of the cache in CPU, we are able to enhance the overall performance of MMDBMSs considerably. In this paper, we address the practical implementation issues and our solutions for them obtained in developing the cache-conscious index manager of the Tachyon. The main issues touched are (1) consideration of the cache behavior, (2) compact representation of the index entry and the index node, (3) support of variable-length keys, (4) support of multiple-attribute keys, (5) support of duplicated keys, (6) definition of the system catalog for indexes, (7) definition of external APIs, (8) concurrency control, and (9) backup and recovery. We also show the effectiveness of our approach through extensive experiments.

Pathologic Correlation of Serum Carcinoembryonic Antigen and Cytokeratin 19 Fragment in Resected Nonsmall Cell Lung Cancer

  • Lee, Seokkee;Lee, Chang Young;Kim, Dae Joon;Hong, Dae Jin;Lee, Jin Gu;Chung, Kyung Young
    • Journal of Chest Surgery
    • /
    • v.46 no.3
    • /
    • pp.192-196
    • /
    • 2013
  • Background: This study focused on the association between preoperative serum carcinoembryonic antigen (CEA) and cytokeratin 19 fragment (Cyfra 21-1) levels and pathologic parameters in patients with resected non-small-cell lung cancer (NSCLC). Materials and Methods: The records of 527 patients who underwent pulmonary resection of NSCLC were reviewed. The association between preoperative serum CEA and Cyfra 21-1 levels and variables that had p-values of less than 0.05 in a t-test or one-way analyses of variance was analyzed by multiple linear regression. Results: The mean serum CEA and Cyfra 21-1 levels prior to surgery were $6.8{\pm}23.1$ mg/dL (range, 0.01 to 390.8 mg/dL) and $5.4{\pm}12.3$ mg/dL (range, 0.65 to 140.2 mg/dL). The serum CEA levels were associated with tumor (T) and lymph node (N) stage and histology. The serum Cyfra 21-1 levels were associated with T stage, tumor size, and histology. Multiple linear regression indicated that serum CEA levels were associated with T (T3/4 vs. T1: ${\beta}$=8.463, p=0.010) and N stage (N2/3 vs. N0: ${\beta}$=9.208, p<0.001) and histology (adenocarcinoma vs. squamous cell: ${\beta}$=6.838, p=0.001), and serum Cyfra 21-1 levels were associated with tumor size (${\beta}$=2.579, p<0.001) and histology (squamous cell vs. adenocarcinoma: ${\beta}$=4.420, p=0.020). Conclusion: Serum CEA level was correlated with T and N stage, and Cyfra 21-1 with tumor size. CEA and Cyfra 21-1 showed histologic correlation. CEA is mainly elevated in adenocarcinoma and Cyfra 21-1 in squamous cell carcinoma. These results might be helpful for predicting pathologic status in preoperative NSCLC.

An analysis on the development of a new multicasting method for telecommunication networking (텔레커뮤니케이션 네트워크상 멀티캐스팅 신기술 개발 분석)

  • Cho, Myeong-Rai
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • v.5 no.3
    • /
    • pp.27-45
    • /
    • 2010
  • It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast routing protocol that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

  • PDF

A RSS-Based Localization for Multiple Modes using Bayesian Compressive Sensing with Path-Loss Estimation (전력 손실 지수 추정 기법과 베이지안 압축 센싱을 이용하는 수신신호 세기 기반의 위치 추정 기법)

  • Ahn, Tae-Joon;Koo, In-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.29-36
    • /
    • 2012
  • In Wireless Sensor Network(WSN)s, the detection of precise location of each node is essential for utilizing sensing data acquired from sensor nodes effectively. Among various location methods, the received signal strength(RSS) based localization scheme is mostly preferable in many applications because it can be easily implemented without any additional hardware cost. Since a RSS-based localization scheme is mainly affected by radio channel or obstacles such as building and mountain between two nodes, the localization error can be inevitable. To enhance the accuracy of localization in RSS-based localization scheme, a number of RSS measurements are needed, which results in the energy consumption. In this paper, a RSS based localization using Bayesian Compressive Sensing(BSS) with path-loss exponent estimation is proposed to improve the accuracy of localization in the energy-efficient way. In the propose scheme, we can increase the adaptative, reliability and accuracy of localization by estimating the path-loss exponents between nodes, and further we can enhance the energy efficiency by the compressive sensing. Through the simulation, it is shown that the proposed scheme can enhance the location accuracy of multiple unknown nodes with fewer RSS measurements and is robust against the channel variation.