• Title/Summary/Keyword: common node

Search Result 473, Processing Time 0.016 seconds

Community Detection using Closeness Similarity based on Common Neighbor Node Clustering Entropy

  • Jiang, Wanchang;Zhang, Xiaoxi;Zhu, Weihua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2587-2605
    • /
    • 2022
  • In order to efficiently detect community structure in complex networks, community detection algorithms can be designed from the perspective of node similarity. However, the appropriate parameters should be chosen to achieve community division, furthermore, these existing algorithms based on the similarity of common neighbors have low discrimination between node pairs. To solve the above problems, a noval community detection algorithm using closeness similarity based on common neighbor node clustering entropy is proposed, shorted as CSCDA. Firstly, to improve detection accuracy, common neighbors and clustering coefficient are combined in the form of entropy, then a new closeness similarity measure is proposed. Through the designed similarity measure, the closeness similar node set of each node can be further accurately identified. Secondly, to reduce the randomness of the community detection result, based on the closeness similar node set, the node leadership is used to determine the most closeness similar first-order neighbor node for merging to create the initial communities. Thirdly, for the difficult problem of parameter selection in existing algorithms, the merging of two levels is used to iteratively detect the final communities with the idea of modularity optimization. Finally, experiments show that the normalized mutual information values are increased by an average of 8.06% and 5.94% on two scales of synthetic networks and real-world networks with real communities, and modularity is increased by an average of 0.80% on the real-world networks without real communities.

A Study on Reduction of Conducted-Noise by the Expanded Node of the Forward Converter (포워드 컨버터의 노드확장에 의한 전도성 노이즈 감소에 관한 연구)

  • Yi, Hee-Hoon;Kwon, Young-Ahn
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.55 no.7
    • /
    • pp.374-379
    • /
    • 2006
  • The switch mode power supply is a source of EMI with other equipment as well as with its own proper operation because of rapid changes in voltages and currents within a switching converter. The EMI is transmitted in two forms: radiated and conducted. Conducted noise consists of two categories known as the differential mode and the common mode. Common mode noise current is a major source of EMI in the switch mode Power supply. Recently, a current balancing technique has been studied to reduce the common mode noise. This paper investigates the reduction of common mode noise according to a node expansion of the switch mode power supply which is based on a current balancing technique. In this paper, seven PCB patterns of the forward converter are manufactured and experimented.

Sinus Node Dysfunction after Orthotopic Dog Heart Transplantation (잡종견의 심장 이식후 발생한 부정맥의 관찰)

  • 박국양
    • Journal of Chest Surgery
    • /
    • v.27 no.5
    • /
    • pp.339-344
    • /
    • 1994
  • Sinus node dysfunction is common after orthotopic heart transplantation.Electrophysiologic studies have documented a high incidence [46% to 50%] of impaired sinus node automaticity and sinoatrial conduction in the early posttransplantation period. Sinus node dysfunction persists in over 20 % of patients and leads to prolonged bradyarrythmias, including sinus or nodal bradycardia and sinus arrest.The purpose of this paper was to observe sinus node dysfunction after orthotopic heart transplantation. Ten cardiac recipient dogs were monitored continuously after orthotopic transplantations between unrelated adult mongrel dogs. Crystalloid cardioplegic solution [Choongwoi Cardioplegia

  • PDF

Clinical and Pathological Evaluation of Neck Masses in Children (소아의 경부 종괴에 관한 임상 및 병리학적 고찰)

  • Park Hee-Boong;Lee Myo-Kyung;Hong Jeong;Jung Woo-Hee;Hwang Eui-Ho;Sul Joon-Hee
    • Korean Journal of Head & Neck Oncology
    • /
    • v.9 no.2
    • /
    • pp.210-220
    • /
    • 1993
  • Histologically proven 465 cases of neck mass in children were analized for the determination of the nature of lesions. Pathologic specimens were obtained during 10 years from January 1981 to December 1989 at Severance Hospital, Yonsei University, College of Medicine. 1) Congenital lesion was most common in neonate(80%) and congenital lesion and inflamatory disease were common in infancy and inflammatory disease was most common in more than one year old children. Thyroglossal duct cyst was most common(35.4%) disease of the congenital lesion. followed by cytic hygroma(34%) and branchial cleft remnants(29.2%). 2) Benign tumors were discovered most frequently in adolescence (55.2%) and thyroid adenoma(23.7%) and epithelial tumor(21.1%) and hemangiomas(19.7%) were most common. Most common malignant tumors were malignant lymphoma (50%) and Hodgkin's disease and were present in the older children. Metastatic cancers were very rare and their primary sites were deductable in all cases. 3) Reactive hyperplasia of lymph node was most common in inflammatory disease(23.7%). Tuberculosis lymphadenitis was more common than nonspecific lymphadenitis. 4) Bilaterality of lesion was commonly seen in malignant disease(41.7%), reactive hyperplasia of lymph node (38.85%) and metastatic disease(33.3%). Size and duration of the masses were not helpful in the differential diagnosis of the cause of the masses. Pediatric neck mass must be evaluated with its characteristics. sites, bilaterality, size and its cange, duration and patient's age but any of these alone cant not be predicted its causes without biopsy or excision. Biopsy or excision can be done with few complication but biopsy of lymph node for diagnosis is carefully made because a large number of lymph node biopsy showed no definite diagnosis in these selected cases of patients.

  • PDF

An Efficient Routing Algorithm Based on the Largest Common Neighbor and Direction Information for DTMNs (DTMNs를 위한 방향성 정보와 최대 공동 이웃 노드에 기반한 효율적인 라우팅 프로토콜)

  • Seo, Doo Ok;Lee, Dong Ho
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.1
    • /
    • pp.83-90
    • /
    • 2010
  • DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.

A Multistage Authentication Strategy for Reliable N-to-N Communication in CGSR based Mobile Ad Hoc Networks (CGSR 기반의 이동 애드 흑 네트워크에서 신뢰성 있는 통신을 위한 노드간 인증 기법)

  • Lee Hyewon K.;Mun Youngsong
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.6
    • /
    • pp.659-667
    • /
    • 2005
  • A Mobile Ad Hoc Network(MANET) is a multi hop wireless network with no prepared base stations or centralized administrations, where flocks of peer systems gather and compose a network. Each node operates as a normal end system in public networks. In addition to it, a MANET node is required to work as a router to forward traffic from a source or intermediate node to others. Each node operates as a normal end system in public networks, and further a MANET node work as a router to forward traffic from a source or intermediate node to the next node via routing path. Applications of MANET are extensively wide, such as battle field or any unwired place; however, these are exposed to critical problems related to network management, node's capability, and security because of frequent and dynamic changes in network topology, absence of centralized controls, restricted usage on network resources, and vulnerability oi mobile nodes which results from the special MANET's character, shared wireless media. These problems induce MANET to be weak from security attacks from eavesdropping to DoS. To guarantee secure authentication is the main part of security service In MANET because networks without secure authentication are exposed to exterior attacks. In this paper, a multistage authentication strategy based on CGSR is proposed to guarantee that only genuine and veritable nodes participate in communications. The proposed authentication model is composed of key manager, cluster head and common nodes. The cluster head is elected from secure nodes, and key manager is elected from cluster heads. The cluster head will verify other common nodes within its cluster range in MANET. Especially, ID of each node is used on communication, which allows digital signature and blocks non repudiation. For performance evaluation, attacks against node authentication are analyzed. Based on security parameters, strategies to resolve these attacks are drawn up.

Pattern of Lymph Node Pathology in Western Saudi Arabia

  • Albasri, Abdulkader Mohammed;El-Siddig, Abeer Abdalla;Hussainy, Akbar Shah;Alhujaily, Ahmed Safar
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.11
    • /
    • pp.4677-4681
    • /
    • 2014
  • Background: This study aimed to characterize the histopathological pattern of lymph node pathology among Saudi patients and to highlight the age and gender variations of these lesions as base line data. Materials and Methods: We retrospectively analyzed the data from lymph node biopsy specimens received at the Department of Pathology, King Fahad Hospital, Madinah, Saudi Arabia from January 2006 to December 2013. Results: Of the 289 lymph node biopsy specimens received, 154 (53.3%) were from males and 135 (46.7%) from females giving a male: female ratio of 1.14:1. Age of the patients ranged from 2.5 to 96 years with a mean age 33.9 years. The commonest lymph node group affected was the cervical (30.4%) followed by axillary (9.7%) and inguinal (8.7%). Malignant lymphoma [71 Hodgkin's disease (HD), 57 non Hodgkin's lymphoma (NHL)] 128 (44.3%), reactive hyperplasia 68 (23.5%), and tuberculosis 41 (14.2%) were the common causes of lymph node enlargement. While HD, reactive hyperplasia and tuberculosis were commonest in young adult patients (10-29 years old) and rare above the age of 50 years; NHL was the predominant cause of lymph node enlargement above 50 years. Conclusions: Lymph node biopsy plays an important role in establishing the cause of lymphadenopathy. Among the biopsied nodes, lymphomas were the most common (44.3%) followed by non-specific reactive hyperplasia (23.5%) and tuberculous lymphadenitis (14.2%).

An Efficient Routing Algorithm Considering Packet Collisions in Cognitive Radio Ad-hoc Network (CR Ad-hoc Network에서 패킷 충돌을 고려한 효율적인 경로탐색 알고리즘)

  • Kim, Jin-Su;Choi, Jun-Ho;Shin, Myeong-Jin;Lee, Ji-Seon;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.9
    • /
    • pp.751-764
    • /
    • 2013
  • In cognitive radio ad-hoc networks, common control channel overload and packet collisions are occured due to indiscriminate broadcasting of control packets. So that the path reliability is reduced and control channel is easily saturated. In this paper, we propose a new routing algorithm considering the probability of appearance of primary user and channel status of neighbor nodes. When the source node needs to transmit a data packet to the destination, it performs route discovery process by exchanging control messages using a control channel in ADOV CR Ad-hoc networks. If any intermediate node doesn't have common data channel with previous node to transmit data, it doesn't rebroadcast control packet. And if it has common data channels with previous node, each node determines channel contribution factor with the number of common channels. Based on the channel contribution factor, each node performs different back-off broadcasting. In addition, each node controls control packet flooding by applying to proposed advanced mode using such as number of available channels and channel stability. With the proposed method, the number of control packets to find the data transmission path and the probability of collision among control packets can be decreased. While the path reliability can be increased. Through simulation, we show that our proposed algorithm reduces packet collisions in comparison with the traditional algorithm.

Current landscape and future perspective of sentinel node mapping in endometrial cancer

  • Bogani, Giorgio;Raspagliesi, Francesco;Maggiore, Umberto Leone Roberti;Mariani, Andrea
    • Journal of Gynecologic Oncology
    • /
    • v.29 no.6
    • /
    • pp.94.1-94.10
    • /
    • 2018
  • Endometrial cancer (EC) represents the most common gynecological neoplasm in developed countries. Surgery is the mainstay of treatment for EC. Although EC is characterized by a high prevalence several features regarding its management are still unclear. In particular the execution of lymphadenectomy is controversial. The recent introduction of sentinel node mapping represents the mid-way between the execution and omission of node dissection in EC patients. In the present review we discuss the emerging role of sentinel node mapping in EC. In addition, we discussed how type of tracers utilized and site of injection impacted on sentinel node detection rates. Future perspective regarding EC management are also discussed.

A CLB based CPLD Low-power Technology Mapping Algorithm (CLB 구조의 CPLD 저전력 기술 매핑 알고리즘)

  • 김재진;윤충모;인치호;김희석
    • Proceedings of the IEEK Conference
    • /
    • 2003.07b
    • /
    • pp.1165-1168
    • /
    • 2003
  • In this paper, a CLB-based CPLD low-power technology mapping algorithm is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) 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 is packing the feasible clusters into the several proper CLBs. Therefore the proposed algorithm is proved an efficient algorithm for a low power CPLD technology mapping.

  • PDF