• Title/Summary/Keyword: Degree of node

Search Result 318, Processing Time 0.028 seconds

Clinicopathological Significance of Osteopontin in Cholangiocarcinoma Cases

  • Laohaviroj, Marut;Chamgramol, Yaovalux;Pairojkul, Chawalit;Mulvenna, Jason;Sripa, Banchob
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.17 no.1
    • /
    • pp.201-205
    • /
    • 2016
  • Cholangiocarcinoma (CCA) is generally a rare primary liver tumor of the bile duct with extremely poor clinical outcomes due to late diagnosis. Osteopontin (OPN) is the most abundant expressed gene in intrahepatic CCA and its involvement in tumor aggressiveness suggests it could be a useful prognostic biomarker. However, the prognostic significance of OPN expression in CCA is still controversial. We therefore immunohistochemically studied OPN expression in 354 resected CCAs and correlated the results with patient clinicopathological parameters. OPN expression was separately scored according to the percentage of cancer cells or degree of stromal tissue staining and classified as low (score 0-1) and high (score 2-3). OPN expression in CCA cells was found in 177 out of 354 patients (56.5%), whereas stroma was positive in 185 out of 354 patients (52.3%). Univariate analysis with several of the aforementioned parameters revealed that stromal but not cancer cell OPN expression was significantly associated with tumor size, tumor direct invasion into normal liver parenchyma, regional lymph node metastasis and higher staging. The combination of cancer cell and stromal OPN expression demonstrated a positive trend for linkage with lymph node metastasis. Multivariate analysis identified gender, the presence of lymphatic permeation and lymph node metastasis, but not OPN expression, as independent prognostic factors. This study confirms the presence of stromal OPN expression in tumor aggressiveness but not survival in CCA patients.

Fault-Tolerant Event Detection in Wireless Sensor Networks using Evidence Theory

  • Liu, Kezhong;Yang, Tian;Ma, Jie;Cheng, Zhiming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3965-3982
    • /
    • 2015
  • Event detection is one of the key issues in many wireless sensor network (WSN) applications. The uncertainties that are derived from the instability of sensor node, measurement noise and incomplete sampling would influence the performance of event detection to a large degree. Many of the present researches described the sensor readings with crisp values, which cannot adequately handle the uncertainties inhered in the imprecise sensor readings. In this paper, a fault-tolerant event detection algorithm is proposed based on Dempster-Shafer (D-S) theory (also called evidence theory). Instead of crisp values, all possible states of the event are represented by the Basic Probability Assignment (BPA) functions, with which the output of each sensor node are characterized as weighted evidences. The combination rule was subsequently applied on each sensor node to fuse the evidences gathered from the neighboring nodes to make the final decision on whether the event occurs. Simulation results show that even 20% nodes are faulty, the accuracy of the proposed algorithm is around 80% for event region detection. Moreover, 97% of the error readings have been corrected, and an improved detection capability at the boundary of the event region is gained by 75%. The proposed algorithm can enhance the detection accuracy of the event region even in high error-rate environment, which reflects good reliability and robustness. The proposed algorithm is also applicable to boundary detection as it performs well at the boundary of the event.

Clinical Evaluation of Primary Lung Cancer (III) (폐암의 임상적 고찰 (III))

  • Hur, Y.;Yu, H.K.;Ahn, W.S.;Kim, B.Y.;Lee, J.H.;Yu, H.S.
    • Journal of Chest Surgery
    • /
    • v.23 no.1
    • /
    • pp.73-80
    • /
    • 1990
  • A total of 129 patients with a confirmed diagnosis of primary lung cancer were treated at Dep. of Thoracic k Cardiovascular Surgery, National Medical Center, Seoul, Korea, between July, 1981 and Dec., 1988. Particular emphasis was given in this review to the 72 patients that underwent surgical resection of their primary lung lesion. Factors such as histology, type of resection, sex, age, staging, and degree of dissemination were considered possible influences on survival. The age group of fifty k sixty decade occupied 55.8 %, and the youngest being 24 years and oldest 78 years. The incidence ratio of male to female was 3,2:1. The subjective symptoms of the patients were coughing [72.6%], chest pain [48.2%] and hemoptysis [35.6%], which were due to primary local influence. The confirmed diagnostic procedures were bronchoscopic biopsy, sputum cytology needle aspiration biopsy, open lung biopsy, anterior mediastinotomy & lymph node biopsy. By pathologic classifications, the squamous cell carcinoma was the most prevalent, 67 cases [51.9 %], and the adenocarcinoma in 36 cases [27.9%], undifferentiated small cell carcinoma in 13 cases [10.1 %], undifferentiated large cell carcinoma in 9 cases [6.9%], bronchioloalveolar carcinoma was 4 cases [3.1%]. The lymph node dissection with pneumonectomy [42 cases], lobectomy [14 cases] and pneumonectomy [6 cases], lobectomy [9 cases] without lymph node dissection were performed. The post operative TNM Staging[AJC] in 72 cases were Stage I in 24 cases, Stage II in 27 cases, and Stage III in 21 cases. Overall resectable was possible in 72 cases [55.8 %], and the operation mortality was 5.6 % [4 cases].

  • PDF

Measuring the Connectivity of Nodes in Road Networks (도로 네트워크의 노드 연계성 산정에 관한 연구)

  • Park, Jun-Sik;Gang, Seong-Cheol
    • Journal of Korean Society of Transportation
    • /
    • v.28 no.4
    • /
    • pp.129-139
    • /
    • 2010
  • This study proposes a model for measuring the connectivity of nodes in road networks. The connectivity index between two nodes is characterized by the number of routes, degree of circuitousness, design speed, and route capacity between the nodes. The connectivity index of a node is then defined as the weighted average of the connectivity indexes between the node and other nodes under consideration. The weighting factor between two nodes is determined by the travel demand and distance between them. The application of the model to a toy network shows that it reasonably well quantifies the level of connectivity of nodes in the network. If flow of rail networks can be measured in the same scale as that of road networks and the capacity of rail links can be estimated, the model proposed in this paper could be applied to intermodal transportation networks as well.

Effective address assignment method in hierarchical structure of Zigbee network (Zigbee 네트워크 계층 구조에서의 효율적인 주소 할당 방법)

  • Kim, Jae-Hyun;Hur, Soo-Jung;Kang, Won-Sek;Lee, Dong-Ha;Park, Yong-Wan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.20-28
    • /
    • 2007
  • Zigbee sensor network base on IEEE802.15.4 has local address of 2 byte on transmit packet data which is pick up the address for each sensor node. Sensor network is requested low power, low cost, many nodes at hues physical area. There for Zigbee is very good solution supporting for next Ubiquitous generation but the Zigbee sensor network has address allocation problem of each sensor node. Is established standard from Zigbee Alliance, to the address allocation method uses Cskip algorithm. The Cskip algorithm use the hazard which allocates an address must blow Hop of the maximum modification and child node number. There is to address allocation and from theoretically it will be able to compose a personal 65536 sensor nodes only actual with concept or space, only 500 degree will be able to compose expansion or the low Zigbee network. We proposed an address allocation method using coordinate value for Zigbee sensor network.

Caching Framework for Multimedia (멀티미디어를 위한 캐슁 기술)

  • Kim, Baek-Hyeon;U, Yo-Seop;Kim, Ik-Su
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.507-514
    • /
    • 2001
  • In VOD(Video-on-Demand) system, the real-time interactive service is one of the most important factor to determine the degree of QoS(Quality of Service). In this paper, we propose the head-end system consisted of switching agent and head-end node, which needs to receive the only video stream for multiple users which have requested the same video, to serve the unlimited interactive service which has no service delay and block. The unlimited VCR services can be served by storing the video stream with buffer at client and head-end node. And the proposed algorithm presents the method to enhance the efficiency by buffer, offer the true interactive VOD services to users because all of service requested by clients are processed immediately. In this paper, we implemented the VOD system which has the VCR functions without service delay and block. Simulation results indicate that the proposed algorithm has better performance in the number of service request and time interval.

  • PDF

Analysis of Geographic Network Structure by Business Relationship between Companies of the Korean Automobile Industry (한국 자동차산업의 기업간 거래관계에 의한 지리적 네트워크 구조 분석)

  • KIM, Hye-Lim;MOON, Tae-Heon
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.24 no.3
    • /
    • pp.58-72
    • /
    • 2021
  • In July 2021, UNCTAD classified Korea as a developed country. After the Korean War in the 1950s, economic development was promoted despite difficult conditions, resulting in epoch-making national growth. However, in order to respond to the rapidly changing global economy, it is necessary to continuously study the domestic industrial ecosystem and prepare strategies for continuous change and growth. This study analyzed the industrial ecosystem of the automobile industry where it is possible to obtain transaction data between companies by applying complexity spatial network analysis. For data, 295 corporate data(node data) and 607 transaction data (link data) were used. As a result of checking the spatial distribution by geocoding the address of the company, the automobile industry-related companies were concentrated in the Seoul metropolitan area and the Southeastern(Dongnam) region. The node importance was measured through degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality, and the network structure was confirmed by identifying density, distance, community detection, and assortativity and disassortivity. As a result, among the automakers, Hyundai Motor, Kia Motors, and GM Korea were included in the top 15 in 4 indicators of node centrality. In terms of company location, companies located in the Seoul metropolitan area were included in the top 15. In terms of company size, most of the large companies with more than 1,000 employees were included in the top 15 for degree centrality and betweenness centrality. Regarding closeness centrality and eigenvector centrality, most of the companies with 500 or less employees were included in the top 15, except for automakers. In the structure of the network, the density was 0.01390522 and the average distance was 3.422481. As a result of community detection using the fast greedy algorithm, 11 communities were finally derived.

Immunohistochemical Study on the Suppression of Cell mediated immunity in Lymph node of mouse by Cyclosporin A -Based on the change of T lymphocytes, Il-2 receptors, and NK cells- (Cyclosporin A로 유도된 생쥐 림프절의 세포성 면역억제에 관한 면역조직화학적 연구 -T 림프구, IL-2 수용기 및 NK세포의 변화를 중심으로-)

  • Kim, Jin-Taek;Park, In-Sick;Ahn, Sang-Hyun;Choi, Nan-Hee;Kim, Dong-Hoan
    • The Journal of Dong Guk Oriental Medicine
    • /
    • v.6 no.2
    • /
    • pp.99-107
    • /
    • 1998
  • Cyclosporin A(CsA) is a selective immunosuppressive agent that has been credited with improved survival of solid organ allografts. Lymph node of BALB/C mouse administered CsA immunohistochemically observed to understand immunosuppressive effects of CsA on T lymphocytes, IL-2 receptors, and natural killer NK cells in lymph node. CsA orally administered daily for 10days at the dose 45mg/kg/day/. The lymph node were obtained at day 3, 7, and 14 after CsA administration and embedded with paraffin, and then stained by following ABC method that used monoclonal antibody including L3T4(CD4), Ly2(CD8), IL-2R(CD25), and NK-1.1(CD56). There were little changes of reactive degree and number of helper T lymphocytes, cytotoxic T lymphocytes, IL-2 receptors, and NK cells at day 3 after CsA administration, but they began to decrease at day 7. These decrease were greatest at day 14. The helper T lymphocytes. cytotoxic T lymphocytes, IL-2 receptors, and NK cells distributed in paracortex and medullary sinus. These results indicated that the secretion of IL-2 began to decrease at day 7 after CsA administration and subsequently to suppress T lymphocytes and NK cell as components of cell-mediated immunity.

  • PDF

Design and Implementation of collaborative system for mobile devices (모바일 기기를 위한 협동작업 시스템의 구현)

  • 이은령;김지용;김두현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5B
    • /
    • pp.512-521
    • /
    • 2003
  • In this paper, we introduce our experience of the design and implementation of mobile collaboration system(MCS) that support people using mobile devices to participate in cooperative session. There are considerable differences between desktop PC and mobile devices like PDA in processing ability, resolution of display and color degree. In the case of mobile devices, they use different processors and different operating system and they have even differences in ability of executing application. The mobile collaborative system based on T.120 protocol of ITU-T standard compromised of mobile collaboration server, mobile collaboration client, session node and application. We also define the session node in desktop PC in which session control block and communication block runs. This node provide functions of session control block and communication block to mobile collaboration clients and so lighten load of clients. The mobile collaboration server provides information of candidates for session node, session and user to mobile collaboration client. And this server support clients to configure their own session node and manage sessions. Only the mobile collaboration client module and applications including APE are executed in a mobile device when user using mobile devices would like to participate in cooperative session. We implemented mobile collaboration client and applications with JAVA to support platform independency.

Data Congestion Control Using Drones in Clustered Heterogeneous Wireless Sensor Network (클러스터된 이기종 무선 센서 네트워크에서의 드론을 이용한 데이터 혼잡 제어)

  • Kim, Tae-Rim;Song, Jong-Gyu;Im, Hyun-Jae;Kim, Bum-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.7
    • /
    • pp.12-19
    • /
    • 2020
  • The clustered heterogeneous wireless sensor network is comprised of sensor nodes and cluster heads, which are hierarchically organized for different objectives. In the network, we should especially take care of managing node resources to enhance network performance based on memory and battery capacity constraints. For instances, if some interesting events occur frequently in the vicinity of particular sensor nodes, those nodes might receive massive amounts of data. Data congestion can happen due to a memory bottleneck or link disconnection at cluster heads because the remaining memory space is filled with those data. In this paper, we utilize drones as mobile sinks to resolve data congestion and model the network, sensor nodes, and cluster heads. We also design a cost function and a congestion indicator to calculate the degree of congestion. Then we propose a data congestion map index and a data congestion mapping scheme to deploy drones at optimal points. Using control variable, we explore the relationship between the degree of congestion and the number of drones to be deployed, as well as the number of drones that must be below a certain degree of congestion and within communication range. Furthermore, we show that our algorithm outperforms previous work by a minimum of 20% in terms of memory overflow.