• Title/Summary/Keyword: node type

Search Result 825, Processing Time 0.025 seconds

Angiofollicular Lymph Node Hyperplasia in the Right Hilum - report of a case - (우폐문부에 발생한 Angiofollicular Lymph Node Hyperplasia -1례 보고-)

  • 정언섭
    • Journal of Chest Surgery
    • /
    • v.22 no.4
    • /
    • pp.705-708
    • /
    • 1989
  • Angiofollicular lymph node hyperplasia is a relatively rare benign lesion. It develops most often in the mediastinum, but also it found in other area of the body, usually where lymph nodes are normally found. There are histologically divided hyaline vascular type, plasma cell type and transitional type. The lesions were discovered most often on routine roentgenograms, and complete surgical excision is the treatment of choice. Recently, the authors experienced a case of angiofollicular lymph node hyperplasia, transitional type, located in the right hilar area. The lesion was removed and the patient is in good condition postoperatively. Now we report this case with review of previously reported literatures.

  • PDF

An Efficient Context-aware Opportunistic Routing Protocol (효율적인 상황 인지 기회적 라우팅 프로토콜)

  • Seo, Dong Yeong;Chung, Yun Won
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.12
    • /
    • pp.2218-2224
    • /
    • 2016
  • Opportunistic routing is designed for an environment where there is no stable end-to-end routing path between source node and destination node, and messages are forwarded via intermittent contacts between nodes and routed using a store-carry-forward mechanism. In this paper, we consider PRoPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity) protocol as a base opportunistic routing protocol and propose an efficient context-aware opportunistic routing protocol by using the context information of delivery predictability and node type, e.g., pedestrian, car, and tram. In the proposed protocol, the node types of sending node and receiving node are checked. Then, if either sending node or receiving node is tram, messages are forwarded by comparing the delivery predictability of receiving node with predefined delivery predictability thresholds depending on the combination of sending node and receiving node types. Otherwise, messages are forwarded if the delivery predictability of receiving node is higher than that of sending node, as defined in PRoPHET protocol. Finally, we analyze the performance of the proposed protocol from the aspect of delivery ratio, overhead ratio, and delivery latency. Simulation results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than PRoPHET protocol in most of the considered simulation environments.

Giant Lymph Node Hyperplasia of Castleman - Report of 2 cases - (Castleman 거대림프절 증식증 2례 보)

  • 김응수
    • Journal of Chest Surgery
    • /
    • v.20 no.3
    • /
    • pp.582-587
    • /
    • 1987
  • Castleman`s disease, giant lymph node hyperplasia, is a rare benign disease. The lesion usually consists of a single node, unassociated with any abnormality of the adjacent lymph nodes or other organs. In the first accounts of giant lymph node hyperplasia of Castleman, the lesion was described as solitary and localized to the mediastinum, which is still the most frequent site of involvement. The disease occurs in all age groups and there is no particular sex preference. It is symptomless and is usually detected on chest films as an incidental finding. On a single involvement, it does not recur after excision, whether total or partial, and the main indication of operation is to rule out more serious tumors. Recently multicentric form appears to be a variant of classic giant lymph node hyperplasia and is associated with significant morbidity and mortality. Histologically, two distinct types have been reported; hyaline-vascular and plasma cell. The hyaline-vascular type of lesion is much more common than the plasma cell type. We report two cases of the hyaline-vascular type of Castleman`s disease.

  • PDF

An Extended Hypertext Data Model based on Object-Oriented Praradigm (객체지향 개념을 기반으로한 하이퍼텍스트 데이터 모델)

  • 이재무;임해철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.9
    • /
    • pp.1680-1691
    • /
    • 1994
  • We propose an extended hypertext data model based on object oriented paradigm that can easily the real world and semantics. We use the BNF notation to formalize the model. In our model, We introduce conceptional navigation by associating semantics on links and drive intelligent navigation using weights on links to alleviate user disorientation problem which is currently somewhat vague. We functionally classify the hypertext node into three types:Indexing node, Content node, Extract node and likewise classify the link into Alink type, Rlink type, Slink type. We believe that the typed node and typed link approach accommodate efficient query/search in hypertext.

  • PDF

A Gradient-Based Explanation Method for Node Classification Using Graph Convolutional Networks

  • Chaehyeon Kim;Hyewon Ryu;Ki Yong Lee
    • Journal of Information Processing Systems
    • /
    • v.19 no.6
    • /
    • pp.803-816
    • /
    • 2023
  • Explainable artificial intelligence is a method that explains how a complex model (e.g., a deep neural network) yields its output from a given input. Recently, graph-type data have been widely used in various fields, and diverse graph neural networks (GNNs) have been developed for graph-type data. However, methods to explain the behavior of GNNs have not been studied much, and only a limited understanding of GNNs is currently available. Therefore, in this paper, we propose an explanation method for node classification using graph convolutional networks (GCNs), which is a representative type of GNN. The proposed method finds out which features of each node have the greatest influence on the classification of that node using GCN. The proposed method identifies influential features by backtracking the layers of the GCN from the output layer to the input layer using the gradients. The experimental results on both synthetic and real datasets demonstrate that the proposed explanation method accurately identifies the features of each node that have the greatest influence on its classification.

Cytologic Findings of Breast Carcinoma in Fine Needle Aspiration - Comparison with Histologic Findings, Stage and Lymph Node Metastasis - (유방암 세침흡인의 세포학적 소견 - 세포학적 소견과 조직학적 소견, 병기 및 림프절 전이 상태와의 비교 -)

  • Chang, Hee-Jin;Kim, Duck-Hwan;Paeng, Sung-Sook;Yang, Sung-Eun;Sohn, Jin-Hee;Suh, Jung-Il;Park, Hyo-Sook
    • The Korean Journal of Cytopathology
    • /
    • v.6 no.1
    • /
    • pp.18-26
    • /
    • 1995
  • In order to compare cytologic findings ol breast carcinoma in fine needle aspiration cytology (FANC) with histologic findings and prognostic factors including histologic grading, lymph node metastasis and stage, 79 cases of infiltrating ductal carcinoma diagnosed by FANC and confirmed by histology were analysed. We especially attempted to col relate nuclear grade, cellularity and smear pattern with histologic grade, type, status of lymph node metastasis and stage. The results are as fellows. 1. High nuclear grade was correlated with high histologic grade, lymph node metastasis and advanced stage. 2. Individual cell pattern was more frequently identified in high histologic grade and scirrhous or solid-tubular type than in low histolgic grade and papillotubular type. 3. Cellularity increased with higher histologic grade and lymph node metastsis. However cellularity was low in scirrhous type. 4. There is no relationship between nuclear grade and histologic type, between smear pattern and lymph node metastasis or stage, and between cellularity and stage. These results suggest that cytologic findings of breast carcinoma such as nuclear grade, cellularity and smear pattern are indicative of histologic findings in relation to histolgic grade and type. Especially, nuclear grade of FANC may yield valuable prognostic information.

  • PDF

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

Designing of Dynamic Sensor Networks based on Meter-range Swarming Flight Type Air Nodes

  • Kang, Chul-Gyu;Kim, Dae-Hwan
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.6
    • /
    • pp.625-628
    • /
    • 2011
  • Dynamic sensor network(DSN) technology which is based on swarming flight type air node offers analyzed and acquired information on target data gathered by air nodes in rotation flight or 3 dimension array flight. Efficient operation of dynamic sensor network based on air node is possible when problems of processing time, data transmission reliability, power consumption and intermittent connectivity are solved. Delay tolerant network (DTN) can be a desirable alternative to solve those problems. DTN using store-and-forward message switching technology is a solution to intermittent network connectivity, long and variable delay time, asymmetric data rates, and high error rates. However, all processes are performed at the bundle layer, so high power consumption, long processing time, and repeated reliability technique occur. DSN based on swarming flight type air node need to adopt store-and-forward message switching technique of DTN, the cancelation scheme of repeated reliability technique, fast processing time with simplified layer composition.

Finite Element Analysis for the Development of Node of Single Layered Freeform Structure (단층 프리폼 구조의 노드 개발을 위한 유한요소해석)

  • Oh, Jin-Tak;Lee, Kyoung-Ju;Ju, Young-Kyu;Woo, Woon-Taek;Kim, Sang-Dae
    • Journal of Korean Association for Spatial Structures
    • /
    • v.11 no.3
    • /
    • pp.137-145
    • /
    • 2011
  • Due to architectural requirement, the attention of single layered freeform spatial structure is increasing nowadays. Because the node of single layered structure should resist the bending and axial forces simultaneously, it is necessary to develop a new proper type of node in detail. In this study, a new type of node for single layered freeform spatial structure was proposed. And the structural performance for the node was analytically evaluated using the commercial FEM software(ABACUS). As a result, a node prototype was selected and the proposed node showed good structural behaviors.

Ordinary B-tree vs NTFS B-tree: A Digital Forensics Perspectives

  • Cho, Gyu-Sang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.8
    • /
    • pp.73-83
    • /
    • 2017
  • In this paper, we discuss the differences between an ordinary B-tree and B-tree implemented by NTFS. There are lots of distinctions between the two B-tree, if not understand the distinctions fully, it is difficult to utilize and analyze artifacts of NTFS. Not much, actually, is known about the implementation of NTFS, especially B-tree index for directory management. Several items of B-tree features are performed that includes a node size, minimum number of children, root node without children, type of key, key sorting, type of pointer to child node, expansion and reduction of node, return of node. Furthermore, it is emphasized the fact that NTFS use B-tree structure not B+structure clearly.