• Title/Summary/Keyword: Intermediate Node

Search Result 165, Processing Time 0.034 seconds

Peripheral Blood Lymphocytosis without Bone Marrow Infiltration in a Dog with T-Zone Lymphoma

  • YeSeul Jeon;Hyeona Bae;DoHyeon Yu
    • Journal of Veterinary Clinics
    • /
    • v.40 no.3
    • /
    • pp.203-208
    • /
    • 2023
  • A 13-year-old neutered male mixed-breed dog presented with generalized lymphadenopathy and erythematous cutaneous lesions in the ear pinnae. Fine-needle aspiration cytology of the lymph nodes revealed small to intermediate lymphocytes with a "hand mirror" configuration as the predominant cell type. Histopathological analysis of the lymph node showed an infiltrate of CD3-positive small lymphocytes compressing the follicles against the capsule owing to neoplastic cell expansion. Flow cytometric analysis revealed a homogeneous population of CD3+/CD4-/CD5+/CD8-/CD21+/CD34-/CD45- cells in both the peripheral blood and aspirated lymph nodes, which supports the diagnosis of T-zone lymphoma. Laboratory tests revealed lymphocytosis (14,144 cells/µL) in the peripheral blood. However, contrary to expectations, the bone marrow examination revealed no evidence of lymphocytic infiltration. T-zone lymphoma is an indolent lymphoma with a long survival period, and knowledge of its characteristics may affect disease staging and prognosis evaluation. Therefore, peripheral blood count as a sole screening tool for bone marrow metastasis should be used with caution.

Anthracofibrosis Mimicking Lung Cancer on CT: MR Imaging Findings (CT상 폐암과 유사하게 보이는 기관지 탄분 섬유화증의 자기공명영상 소견)

  • 류대식;이덕희;정승문;최수정;박성빈;박만수;강길현
    • Investigative Magnetic Resonance Imaging
    • /
    • v.5 no.1
    • /
    • pp.18-23
    • /
    • 2001
  • Purpose : To describe the MRI findings in the bronchial anthracofibrosis mimicking lung cancer on CT examination. Materials and methods : Ten patients, who showed CT findings mimicking lung cancer, were selected among fifty patients of bronchial anthracofibrosis proven by bronchoscopic biopsy, consisting of two men and eight women, ranging in age from 58 to 79 years old faverage age, 68 years old). CT scan and MRI were performed in all patients (n=10). Percutaneous lung biopsy on mass was performed in one patient. MRI findings were analyzed with the emphasis on the signal intensity of the mass (n=4), collapsed lung (n=4) and Iymph node (n=10) on axial T1 and T2-weighted images by two radiologists in consensus. No contrast enhancement was used in all cases. Results : CT scan revealed mass (n=4), atelectasis with obstructive pneumonia(n=4) and bronchial wall thickening(n=2). All patients showed enlarged medistinal Iymph nodes(n=10). The mass showed low signal intensity on T1WI and T2WI (n =4). The collapsed lung in patients with atelectasis indicated intermediate signal intensity on T1WI and low signal intensity on T2WI (n= 4). Nine patients showed low sisnal intensity of Iymph node on T1WI and T2WI, except one patient who showed central high signal intensity with peripheral rim of low signal intensity in right lower paratracheal llmph node on T2WI. Conclusion : Low signal intensity of a mass, collapsed lung, and lymph nodes on T2WI in anthracofibrosis patients may be helpful in differentiation of the lesion from lung cancer.

  • PDF

Multiple Path Security-Aware Routing Protocol Mechanism for Ad Hoc Network (Ad Hoc 네트워크 라우팅 보안을 위한 다중경로 기반의 MP-SAR 프로토콜)

  • Han, In-Sung;Ryou, Hwang-Bin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.260-267
    • /
    • 2008
  • As pervious the SAR(Security Aware Routing)[10] protocol is an secure Ad Hoc network protocol that finds a secure path, it is the security routing protocol that uses the security level of nodes as the routing information. However, the SAR protocol sometimes transfers data through inefficient transmission paths because it always tries to find secure nodes for a safe transmission. Since it is a protocol based on AODV[6], it will cause transmission delay as researching of security routing path. when a node is out of the data transmission range as its battery dying or movement. Although it is possible to connection of nodes because a characteristic of the SAR protocol, the connection is not easy to reconnect when the security level of intermediate node is lower than the level requested by a source node. In this paper, we suggest the MP-SAR based on the SAR to solve the SAR protocol's problem. The MP-SAR seeks multiple secure path for maintenance of data confidentiality using the expanded secure path detection techniques based on the SAR. It can transfer data quickly and reliably by using the shortest efficient path among multiple paths. In the research result, we proved a outstanding performance of MP-SAR than the previous SAR through comparison and analysis.

Evaluation of Biochemical Recurrence-free Survival after Radical Prostatectomy by Cancer of the Prostate Risk Assessment Post-Surgical (CAPRA-S) Score

  • Aktas, Binhan Kagan;Ozden, Cuneyt;Bulut, Suleyman;Tagci, Suleyman;Erbay, Guven;Gokkaya, Cevdet Serkan;Baykam, Mehmet Murat;Memis, Ali
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.6
    • /
    • pp.2527-2530
    • /
    • 2015
  • Background: The cancer of the prostate risk assessment (CAPRA) score has been defined to predict prostate cancer recurrence based on the pre-clinical data, then pathological data have also been incorporated. Thus, CAPRA post-surgical (CAPRA-S) score has been developed based on six criteria (prostate specific antigen (PSA) at diagnosis, pathological Gleason score, and information on surgical margin, seminal vesicle invasion, extracapsular extension and lymph node involvement) for the prediction of post-surgical recurrences. In the present study, biochemical recurrence (BCR)-free probabilities after open retropubic radical prostatectomy (RP) were evaluated by the CAPRA-S scoring system and its three-risk level model. Materials and Methods: CAPRA-S scores (0-12) of our 240 radical prostatectomies performed between January 2000-May 2011 were calculated. Patients were distributed into CAPRA-S score groups and also into three-risk groups as low, intermediate and high. BCR-free probabilities were assessed and compared using Kaplan-Meier analysis and Cox proportional hazards regression. Ability of CAPRA-S in BCR detection was evaluated by concordance index (c-index). Results: BCR was present in 41 of total 240 patients (17.1%) and the mean follow-up time was $51.7{\pm}33.0$ months. Mean BCR-free survival time was 98.3 months (95% CI: 92.3-104.2). Of the patients in low, intermediate and high risk groups, 5.4%, 22.0% and 58.8% had BCR, respectively and the difference among the three groups was significant (P = 0.0001). C-indices of CAPRA-S score and three-risk groups for detecting BCR-free probabilities in 5-yr were 0.87 and 0.81, respectively. Conclusions: Both CAPRA-S score and its three-risk level model well predicted BCR after RP with high c-index levels in our center. Therefore, it is a clinically reliable post-operative risk stratifier and disease recurrence predictor for prostate cancer.

Identity-Based Secure Many-to-Many Multicast in Wireless Mesh Networks (무선 메쉬 네트워크에서의 아이디 기반 프록시 암호화를 이용한 안전한 다대다 멀티캐스트 기법)

  • Hur, Jun-Beom;Yoon, Hyun-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.1
    • /
    • pp.72-83
    • /
    • 2010
  • Group communication in a wireless mesh network is complicated due to dynamic intermediate mesh points, access control for communications between different administrative domains, and the absence of a centralized network controller. Especially, many-to-many multicasting in a dynamic mesh network can be modeled by a decentralized framework where several subgroup managers control their members independently and coordinate the inter-subgroup communication. In this study, we propose a topology-matching decentralized group key management scheme that allows service providers to update and deliver their group keys to valid members even if the members are located in other network domains. The group keys of multicast services are delivered in a distributed manner using the identity-based encryption scheme. Identity-based encryption facilitates the dynamic changes of the intermediate relaying nodes as well as the group members efficiently. The analysis result indicates that the proposed scheme has the advantages of low rekeying cost and storage overhead for a member and a data relaying node in many-to-many multicast environment. The proposed scheme is best suited to the settings of a large-scale dynamic mesh network where there is no central network controller and lots of service providers control the access to their group communications independently.

Dynamic-size Multi-hop Clustering Mechanism based on the Distance in Sensor Networks (센서 네트워크에서의 거리에 따른 동적 크기 다중홉 클러스터링 방법)

  • Ahn, Sang-Hyun;Lim, Yu-Jin
    • The KIPS Transactions:PartC
    • /
    • v.14C no.6
    • /
    • pp.519-524
    • /
    • 2007
  • One of the most important issues on the sensor network with resource limited sensor nodes is prolonging the network lifetime by effectively utilizing the limited node energy. The most representative mechanism to achieve a long lived sensor network is the clustering mechanism which can be further classified into the single hop mode and the multi hop mode. The single hop mode requires that all sensor nodes in a cluster communicate directly with the cluster head(CH) via single hop md, in the multi hop mode, sensor nodes communicate with the CH with the help of other Intermediate nodes. One of the most critical factors that impact on the performance of the existing multi hop clustering mechanism is the cluster size and, without the assumption on the uniform node distribution, finding out the best cluster size is intractable. Since sensor nodes in a real sensor network are distributed non uniformly, the fixed size mechanism may not work best for real sensor networks. Therefore, in this paper, we propose a new dynamic size multi hop clustering mechanism in which the cluster size is determined according to the distance from the sink to relieve the traffic passing through the CHs near the sink. We show that our proposed scheme outperforms the existing fixed size clustering mechanisms by carrying out numerical analysis and simulations.

A Flow Control Scheme based on Queue Priority (큐의 우선순위에 근거한 흐름제어방식)

  • Lee, Gwang-Jun;Son, Ji-Yeon;Son, Chang-Won
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.237-245
    • /
    • 1997
  • In this paper, a flow control mechanism is proposed which is based on the priority control between communication path of a node. In this scheme, demanding length of a data queue for any pre-defined, then each node in that path is forced to maintains buffer size under the limit by controlling priority level of the path. The communication path which requires higher bandwidth sets its demanding queue length smaller. By providing relationship between the priority of a path and length of its queue, the high bandwidth requesting path has a better chance to get high bandwidth by defining the smaller demanding queue size. And also, by forcing a path which has high flow rate to maintain small queue size in the path of the communication, the scheme keep the transmission delay of the path small. The size of the demanding queue of a path is regularly adjusted to meet the applications requirement, and the load status of the network during the life time of the communication. The priority control based on the demanding queue size is also provided in the intermediate nodes as well as the end nodes. By that the flow control can provide a quicker result than end to-end flow control, it provides better performance advantage especially for the high speed network.

  • PDF

Power-aware Dynamic Path Selection Scheme in AOMDV(Ad hoc On-demand Distance Vector) (AOMDV(Ad hoc On-demand Multipath Distance Vector)에서의 전력을 고려한 동적 경로 선택 기법)

  • Lee, Jang-Su;Kim, Sung-Chun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.1
    • /
    • pp.42-50
    • /
    • 2008
  • Unlike a cellular network, a mobile ad hoc network(MANET) is constructed only by mobile nodes without access point. Mobile nodes in MANET operate with scarce resources and restricted battery. If battery of intermediate node is exhausted, overall network might be diverged. Therefore, power-aware is really important. An on-demand multipath routing protocol which is proposed to compensate for shortcoming of on-demand single path routing protocol can reduce mute discovery overhead because route discovery starts only when all routes are disconnected. AOMDV(Ad hoc On-demand Multipath Distance Vector) which is on-demand multipath routing protocol based on AODV, reduces 40% of route discovery frequency. However, AOMDV have none of power-aware. So AOMDV have problem that route discovery for power exhaustion is not reduced at all. This paper proposes new power-aware path selection algorithm for AOMDV and scheme that broadcast REER packets when mobile node's battery can be gone. Performance comparison of proposed algorithm with AOMDV using ns-2 simulator shows that route discovery of proposed algorithm is reduced maximally 36.57% than AOMDV's.

Correlation Between Mammograghic Findings and Clinical/Pathologic Features in Women with Small Invasive Breast Carcinomas

  • Li, Jun-Nan;Xu, Jing;Wang, Ju;Qing, Chun;Zhao, Yu-Mei;Liu, Pei-Fang
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.24
    • /
    • pp.10643-10646
    • /
    • 2015
  • Background: To study the relationship between mammographic findings and clinical/pathologic features in women with 1-15mm sized invasive breast cancer. Materials and Methods: We investigated a consecutive series of 134 cases diagnosed in Tianjin Medical University Cancer Institute and Hospital in 2007. Mammographic findings were classified into five groups as follows :1) stellate mass without calcification; 2) non-stellate mass without calcification; 3) intermediate suspicious calcification with or without associated mass; 4) higher probability malignant calcification with or without associated mass; 5) focal asymmetry/distortion without associated calcification. Associations between mammographic and clinical/pathological features (menopause status/family history/histologic grade/lymph node status and ER/PR/HER2 status) was analyzed through logistic regression and chi square tests. Results: Compared to the stellate mass without calcification group, higher probability malignant calcification patients were associated significantly with a positive lymph node status, always presenting in patients who were non-menopausal and with a family history of carcinoma. Conclusions: Higher probability malignant calcifications with or without associated tumor masses are associated with clinical/pathologic features of poor prognosis.

Proactive Congestion Control for Energy Efficiency of Mobile Device in Ad-hoc Network (Ad-hoc 통신망에서 이동 단말의 에너지 효율성을 고려한 능동적인 혼잡 제어 기법)

  • Cho, Nam-Ho;Lee, Jung-Min;Choi, Woong-Chul;Rhee, Seung-Hyong;Chung, Kwang-Sue
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.340-342
    • /
    • 2005
  • 최근 기지국(Base Station)의 도움 없이 이동 단말기(Mobile Device) 간의 다중 무선 홉을 사용하여 송수신자 간의 데이터 전송을 가능하게 하는 Ad-hoc 통신망에 관한 연구가 활발히 진행되고 있다. Ad-hoc 통신망을 구성하는 이동 단말은 이동성을 고려하여 한정된 배터리로 동작을 하게 된다. Ad-hoc 통신망에서 이동 단말은 종단(End Host)으로만 동작하는 것이 아닌 중계 노드(Intermediate Node)로도 동작을 하기 때문에 통신상에 경로를 제공하는 중요한 역할도 한다. 하지만, 현재 인터넷 상에서 광범위하게 사용되고 있는 전송 규약인 TCP(Transmission Control Protocol)는 수동적인(Reactive)혼잡 제어(Congestion Control)방식으로 망의 혼잡으로 인한 패킷 손실 발생 이전까지 전송 윈도우의 크기를 증가 때문에 반복적인 혼잡과 그로 인한 패킷 손실로 인해 불필요한 재전송을 반복하게 된다. 이와 같이 기존 TCP는 무선 통신망에서 동작하는 이동 단말의 한정된 배터리 전원을 고려하지 않고 동작하기 때문에 이동 단말의 에너지를 불필요하게 낭비하는 문제를 가지게 된다. 본 논문은 Ad-hoc 망에서 이동 단말의 에너지 효율을 개선하기 위해 불필요한 재전송 방지 및 망 상태에 따라 전송률을 적절하게 조절하는 TCP의 새로운 혼잡 제어 기법을 제시하였다. 또한 ns-2 시뮬레이터를 이용한 실험을 통해 이동 단말의 에너지 효율이 제안된 혼잡 제어 기법에 의해 향상되었음을 확인하였다.

  • PDF