• Title/Summary/Keyword: node number

Search Result 1,873, Processing Time 0.024 seconds

Clinical Significance of the Pattern of Lymph Node Metastasis Depending on the Location of Gastric Cancer

  • Han, Ki-Bin;Jang, You-Jin;Kim, Jong-Han;Park, Sung-Soo;Park, Seong-Heum;Kim, Seung-Joo;Mok, Young-Jae;Kim, Chong-Suk
    • Journal of Gastric Cancer
    • /
    • v.11 no.2
    • /
    • pp.86-93
    • /
    • 2011
  • Purpose: When performing a laparoscopic assisted gastrectomy, a function-preserving gastrectomy is performed depending on the location of the primary gastric cancer. This study examined the incidence of lymph node metastasis by the lymph node station number by tumor location to determine the optimal extent of the lymph node dissection. Materials and Methods: The subjects consisted of 1,510 patients diagnosed with gastric cancer who underwent a gastrectomy between 1996 and 2005. The patients were divided into three groups: upper, middle and lower third, depending on the location of the primary tumor. The lymph node metastasis patterns were analyzed in the total and early gastric cancer patients. Results: In all patients, lymph node station numbers 1, 2, 3, 7, 10 and 11 metastases were dominant in the cancer originating in the upper third, whereas station numbers 4, 5, 6 and 8 were dominant in the lower third. In early gastric cancer patients, the station number of lymph nodes with a metastasis did not show a significant difference in stage pT1a disease. On the other hand, a metastasis in lymph node station number 6 was dominant in stage pT1b disease that originated in the lower third of the stomach. Conclusions: When performing a laparoscopic-assisted gastrectomy for early gastric cancer, a limited lymphadenectomy is considered adequate during a function-preserving gastrectomy in mucosal (T1a) cancer. On the other hand, for submucosal (T1b) cancer, a number 6 node dissection should be performed when performing a pylorus preserving gastrectomy.

Performance Evaluation of Node.js for Web Service Gateway in IoT Remote Monitoring Applications

  • Nkenyereye, Lionel;Jang, Jong-Wook
    • International Journal of Advanced Culture Technology
    • /
    • v.4 no.3
    • /
    • pp.13-19
    • /
    • 2016
  • The growth of mobile devices in Internet of Things (IoT) leads to a number of remote and controlling system related IoT applications. For instance, home automation controlling system uses client system such web apps on smartphone or web service to access the home server by sending control commands. The home server receives the command, then controls for instance the light system. The web service gateway responsible for handling clients' requests attests an internet latency when an increasing number of end users requests submit toward it. Therefore, this web service gateway fails to detect several commands, slows down predefined actions which should be performed without human intervention. In this paper, we investigate the performance of a web server-side platgorm based event-driven, non-blocking approach called Node.js against traditional thread-based server side approach to handle a large number of client requests simultaneously for remote and controlling system in IoT remote monitoring applications. The Node.JS is 40% faster than the traditional web server side features thread-based approach. The use of Node.js server-side handles a large number of clients' requests, then therefore, reduces delay in performing predefined actions automatically in IoT environment.

Node-reduction Model of Large-scale Network Grape (대형 회로망 그래프 마디축소 모델)

  • Hwang, Jae-Ho
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.50 no.2
    • /
    • pp.93-99
    • /
    • 2001
  • A new type geometric and mathematical network reduction model is introduced. Large-scale network is analyzed with analytic approach. The graph has many nodes, branches and loops. Circuit equation are obtained from these elements and connection rule. In this paper, the analytic relation between voltage source has a mutual different graphic property. Node-reduction procedure is achieved with this circuit property. Consequently voltage source value is included into the adjacent node-analyzing equation. A resultant model equations are reduced as much as voltage source number. Matrix rank is (n-1-k), where n, k is node and voltage source number. The reduction procedure is described and verified with geometric principle and circuit theory. Matrix type circuit equation can be composed with this technique. The last results shall be calculated by using computer.

  • PDF

Collective Betweenness Centrality in Networks

  • Gombojav, Gantulga;Purevsuren, Dalaijargal;Sengee, Nyamlkhagva
    • Journal of Multimedia Information System
    • /
    • v.9 no.2
    • /
    • pp.121-126
    • /
    • 2022
  • The shortest path betweenness value of a node quantifies the amount of information passing through the node when all the pairs of nodes in the network exchange information in full capacity measured by the number of the shortest paths between the pairs assuming that the information travels in the shortest paths. It is calculated as the cumulative of the fractions of the number of shortest paths between the node pairs over how many of them actually pass through the node of interest. It's possible for a node to have zero or underrated betweenness value while sitting just next to the giant flow of information. These nodes may have a significant influence on the network when the normal flow of information is disrupted. We propose a betweenness centrality measure called collective betweenness that takes into account the surroundings of a node. We will compare our measure with other centrality metrics and show some applications of it.

Minimum Number of Retrieved Lymph Nodes for Staging in Gastric Cancer (위암에서 병기결정을 위한 최소 절제 림프절 수)

  • Min, Byung-Wook;Kim, Wan-Bae;Kim, Seung-Ju;Kim, Chong-Suk;Mok, Young-Jae
    • Journal of Gastric Cancer
    • /
    • v.3 no.3
    • /
    • pp.134-138
    • /
    • 2003
  • Purpose: The lymph node (N) classification in the International Union Against Cancer (UICC) TNM staging system for gastric adenocarcinomas has been revised from the anatomic sites of metastatic lymph nodes to the number of metastatic lymph nodes. The purpose of this study was to investigate the proper number of retrieved lymph nodes for applying the new TNM staging system. Materials and Methods: We retrospectively studied 267 patients who had undergone a curative resection performed by one surgeon for gastric adenocarcinomas from March 1993 to December 1996 at Korea University Guro Hospital. We compared the old staging system to the new one and analyzed the number of retrieved and metastatic lymph nodes. We also analyzed the number of retrieved and metastatic lymph nodes according to the operative procedure and the extent of the lymphadenectomy, as well as the correlation of lymph-node metastasis to the number of retrieved lymph nodes. Results: The mean number of retrieved lymph nodes was $34.27\pm14.18$, of those $6.85\pm6.24$ were metastatic. According to the extent of the lymphadenectomy, these numbers were $17.8\pm9.3\;and\;7.0\pm5.3$ in D1, $33.1\pm14.6\;and\;3.0\pm3.0$ in $D1+\alpha$, $33.9\pm13.8\;and\;7.5\pm6.2$ in D2, and $40.6\pm13.3\;and\;7.9\pm7.5$ in $D2+\alpha$. There was no correlation between the percentage of the specimen with positive lymph nodes and the number of retrieved lymph nodes, but a logistic regres sion analysis showed that the probability of lymph-node metastasis increased as the number of retrieved lymph nodes increased. Conclusion: The mean number of retrieved lymph nodes was about 34. Although by logistic regression analysis, the probability of lymph-node metastasis increased as the number of retrieved lymph nodes increased, we failed to determine the minimum number of nodes retrieved during a lymphadenectomy needed for accurate staging in a gastric adenocarcinoma. Further study is required to identify the optimum number of lymph nodes that need to be retrieved.

  • PDF

Digital Sequence CPLD Technology Mapping Algorithm

  • Youn, Choong-Mo
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.2
    • /
    • pp.131-135
    • /
    • 2007
  • In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

A CLB-based CPLD Low-power Technology Mapping Algorithm considered a Trade-off

  • Youn, Choong-Mo;Kim, Jae-Jin
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.1
    • /
    • pp.59-63
    • /
    • 2007
  • In this paper, a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

Implementation of Efficient Distributed Crawler through Stepwise Crawling Node Allocation

  • Kim, Hyuntae;Byun, Junhyung;Na, Yoseph;Jung, Yuchul
    • Journal of Advanced Information Technology and Convergence
    • /
    • v.10 no.2
    • /
    • pp.15-31
    • /
    • 2020
  • Various websites have been created due to the increased use of the Internet, and the number of documents distributed through these websites has increased proportionally. However, it is not easy to collect newly updated documents rapidly. Web crawling methods have been used to continuously collect and manage new documents, whereas existing crawling systems applying a single node demonstrate limited performances. Furthermore, crawlers applying distribution methods exhibit a problem related to effective node management for crawling. This study proposes an efficient distributed crawler through stepwise crawling node allocation, which identifies websites' properties and establishes crawling policies based on the properties identified to collect a large number of documents from multiple websites. The proposed crawler can calculate the number of documents included in a website, compare data collection time and the amount of data collected based on the number of nodes allocated to a specific website by repeatedly visiting the website, and automatically allocate the optimal number of nodes to each website for crawling. An experiment is conducted where the proposed and single-node methods are applied to 12 different websites; the experimental result indicates that the proposed crawler's data collection time decreased significantly compared with that of a single node crawler. This result is obtained because the proposed crawler applied data collection policies according to websites. Besides, it is confirmed that the work rate of the proposed model increased.

A Study on Determination of the Number of Work Processes Reflecting Characteristics of Program on Computational Grid (계산 그리드 상에서 프로그램의 특성을 반영한 작업 프로세스 수의 결정에 관한 연구)

  • Cho, Soo-Hyun;Kim, Young-Hak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.71-85
    • /
    • 2006
  • The environment of computational grid is composed of the LAN/WAN each of which has different efficiency and heterogeneous network conditions, and where various programs are running. In this environment, the role of the resource selection broker is very important because the work of each node is performed by considering heterogeneous network environment and the computing power of each node according to the characteristics of a program. In this paper, a new resource selection broker is presented that decides the number of work processes to be allocated at each node by considering network state information and the performance of each node according to the characteristics of a program in the environment of computational grid. The proposed resource selection broker has three steps as follows. First, the performance ratio of each node is computed using latency-bandwidth-cpu mixture information reflecting the characteristics of a program, and the number of work processes that will be performed at each node are decided by this ratio. Second, RSL file is automatically made based on the number of work processes decided at the previous step. Finally, each node creates work processes by using that RSL file and performs the work which has been allocated to itself. As experimental results, the proposed method reflecting characteristics of a program, compared with the existing (uniformity) and latency-bandwidth method is improved $278%\sim316%,\;524%\sim595%,\;924%\sim954%$ in the point of work amount, work process number, and node number respectively.

  • PDF

Variable-node element families for mesh connection and adaptive mesh computation

  • Lim, Jae Hyuk;Sohn, Dongwoo;Im, Seyoung
    • Structural Engineering and Mechanics
    • /
    • v.43 no.3
    • /
    • pp.349-370
    • /
    • 2012
  • Variable-node finite element families, termed (4 + k + l + m + n)-node elements with an arbitrary number of nodes (k, l, m, and n) on each of their edges, are developed based on the generic point interpolation with special bases having slope discontinuities in two-dimensional domains. They retain the linear interpolation between any two neighboring nodes, and passes the standard patch test when subdomain-wise $2{\times}2$ Gauss integration is employed. Their shape functions are automatically generated on the master domain of elements although a certain number of nodes are inserted on their edges. The elements can provide a flexibility to resolve nonmatching mesh problems like mesh connection and adaptive mesh refinement. In the case of adaptive mesh refinement problem, so-called "1-irregular node rule" working as a constraint in performing mesh adaptation is relaxed by adopting the variable-node elements. Through several examples, we show the performance of the variable-node finite elements in terms of accuracy and efficiency.