• Title/Summary/Keyword: alternative path

Search Result 241, Processing Time 0.032 seconds

The Usefulness of $SurePath^{TM}$ Liquid-Based Smear in Sono-Guided Thyroid Fine Needle Aspiration; a Comparison of a Conventional Smear and $SurePath^{TM}$ Liquid-Based Cytology (초음파 유도 갑삼샘 세침흡인 세포검사에서 $SurePath^{TM}$ 액상세포검사의 유용성; 고식적 도말검사와 $SurePath^{TM}$ 액상세포검사와의 비교)

  • Kim, Dong-Hoon;Kim, Min-Kyung;Chae, Seoung-Wan;Lee, Kyoung-Bun;Han, Eun Mee;Kang, Sung-Hee;Sohn, Jin-Hee
    • The Korean Journal of Cytopathology
    • /
    • v.18 no.2
    • /
    • pp.143-152
    • /
    • 2007
  • Sono-guided fine needle aspiration (FNA) of the thyroid is widely used, but the aspirated samples are typically not well preserved and low cellularity makes diagnosis difficult in many cases. The object of the current study is to evaluate the adequacy and diagnostic accuracy of the use of $SurePath^{TM}$ liquid-based cytology (SP-LBC) in the sonoguided fine needle aspiration of the thyroid nodule and to compare its use with that of the use of a conventional smear (CS). A total of 172 sono-guided FNAs of thyroid nodules from April to June, 2006 were prepared by the use of the split method with either SP-LBC or CS; the samples were stained with the use of hematoxylin-eosin (H&E) and Papanicolaou (Pap) stains. A cyto-histological correlation was performed in 69 (30 SP and 39 CS) cases that had been histologically confirmed. The rate of producing unsatisfactory slides by the use of the SP-LBC method (9.3%) was less than that of the use of the CS method (20.9%). The diagnostic accuracy of the SP method (93.3%) was better than that of the CS method (85.3%). The sensitivity and specificity of the SP method (94.4% and 92.3%) was better than that of the CS method (83.3% and 70%), respectively (p < 0.05). The CS of sono-guided aspirated specimens had some unavoidable limitations related to inadequate sampling such as a bloody background, low cellularity and an indication that some clinicians smeared many useless slides (averaging four to ten slides), and that most slides showed only blood that included few follicular cells. The SP method resulted in more thinly smeared slides and showed cleaner background and greater cellularity than the use of the CS method. Each follicular cell shows superior nuclear detail, and more distinct cytoplasmic features than with the use of the CS method. SP-LBC appears to be an easy, highly accurate, and reliable cytological method for employ for a diagnostic approach of thyroid disease and thyroid nodules. The SP-LBC method is a suitable alternative to the CS method to overcome diagnostic difficulties.

A Method for Reducing Path Recovery Overhead of Clustering-based, Cognitive Radio Ad Hoc Routing Protocol (클러스터링 기반 인지 무선 애드혹 라우팅 프로토콜의 경로 복구 오버헤드 감소 기법)

  • Jang, Jin-kyung;Lim, Ji-hun;Kim, Do-Hyung;Ko, Young-Bae;Kim, Joung-Sik;Seo, Myung-hwan
    • Journal of IKEEE
    • /
    • v.23 no.1
    • /
    • pp.280-288
    • /
    • 2019
  • In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.

DESIGN STUDY OF AN IHX SUPPORT STRUCTURE FOR A POOL-TYPE SODIUM-COOLED FAST REACTOR

  • Park, Chang-Gyu;Kim, Jong-Bum;Lee, Jae-Han
    • Nuclear Engineering and Technology
    • /
    • v.41 no.10
    • /
    • pp.1323-1332
    • /
    • 2009
  • The IHX (Intermediate Heat eXchanger) for a pool-type SFR (Sodium-cooled Fast Reactor) system transfers heat from the primary high temperature sodium to the intermediate cold temperature sodium. The upper structure of the IHX is a coaxial structure designed to form a flow path for both the secondary high temperature and low temperature sodium. The coaxial structure of the IHX consists of a central downcomer and riser for the incoming and outgoing intermediate sodium, respectively. The IHX of a pool-type SFR is supported at the upper surface of the reactor head with an IHX support structure that connects the IHX riser cylinder to the reactor head. The reactor head is generally maintained at the low temperature regime, but the riser cylinder is exposed in the elevated temperature region. The resultant complicated temperature distribution of the co-axial structure including the IHX support structure may induce a severe thermal stress distribution. In this study, the structural feasibility of the current upper support structure concept is investigated through a preliminary stress analysis and an alternative design concept to accommodate the IHTS (Intermediate Heat Transport System) piping expansion loads and severe thermal stress is proposed. Through the structural analysis it is found that the alternative design concept is effective in reducing the thermal stress and acquiring structural integrity.

A Survey Study on Oral Health Knowledge and Behaviors in Alternative School Students (일부지역 대안학교 학생의 구강보건의식 행태 조사)

  • Lee, Jae-Ra;Lee, Heung-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.3
    • /
    • pp.260-267
    • /
    • 2012
  • This study was survey about the oral health knowledge and behaviors with alternative school students results are as follow. 1. As a result of this study, toothbrushing period was the largest with 29.5% in students of doing 'after dinner.', The appearance of taking food of containing sugar for preventing caries was the largest with 53.3% in students who responded as saying of 'tending to be not so.', A path of acquiring information on oral health knowledge was the highest with 72.0% in neighbor and family. 2. A review of Toothbrushing frequency per day, this was the largest with 45.2% in execution with 3 times, There were difference depending on grade, sex, a path of go to school, come home from school, financial status. 3. A review of the oral hygiene auxiliary supplies, this was the largest with 64.5% in students who used it, There were difference depending on the higher school year in the high school, financial status. 4. as a result of taking snack of students, it was similar to two or three times with 37.7%, one time with 34.6% per day, there was difference depending on financial status. taking drink was similar to non-drink with 38.0%, one time with 37.7%, there were difference depending on grade, financial status in a statistics.

A schedule-based Public Transit Routing Algorithm for Finding K-shortest Paths Considering Transfer Penalties (환승 저항을 고려한 운행시간표 기반 대중교통 다중 경로 탐색 알고리즘)

  • Jeon, Inwoo;Nam, Hyunwoo;Jun, Chulmin
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.3
    • /
    • pp.72-86
    • /
    • 2018
  • Schedule-based public transit routing algorithm computes a single route that calculated minimum travel time using the departure and arrival times for each stop according to vehicle operation plan. However, additional factors such as transfer resistance and alternative route choice are not reflected in the path finding process. Therefore, this paper proposes a improved RAPTOR that reflected transfer resistance and multi-path searching. Transfer resistance is applied at the time of transfer and different values can be set according to type of transit mode. In this study, we analyzed the algorithm's before and after results compared with actual route of passengers. It is confirmed that the proposed algorithm reflects the various route selection criteria of passengers.

A Multi-path Search Algorithm for Multi-purpose Activities (다목적 정보 제공을 위한 다경로 탐색 기법 개발)

  • Jeong, Yeon-Jeong;Kim, Chang-Ho
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.3 s.89
    • /
    • pp.177-187
    • /
    • 2006
  • It is known that over one million car navigation devices are being currently used in Korea. Most. if not all, route guidance systems, however, Provide only one "best" route to users, not providing any options for various types of users to select. The current practice dose not consider each individual's different preferences. These days, a vast amount of information became available due to the rapid development in information processing technology. Thus, users Prefer choices to be given and like to select the one that suits him/her the "best" among available information. To provide such options in this Paper, we developed an algorithm that provides alternative routes that may not the "least cost" ones, but ones that are close to the "least cost" routes for users to select. The algorithm developed and introduced in the paper utilizes a link-based search method, rather than the traditional node-based search method. The link-based algorithm can still utilize the existing transportation network without any modifications, and yet enables to provide flexible route guidance to meet the various needs of users by allowing transfer to other modes and/or restricting left turns. The algorithm developed has been applied to a toy network and demonstrated successful implementation of the multi-path search algorithm for multi-purpose activities.

Diameter, Fault Diameter and Average Distance between Two Nodes in Z-cube Network (Z-cube 네트워크의 직경, 고장직경과 정점간 평균거리)

  • Gwon, Gyeong-Hui;Lee, Gye-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.1
    • /
    • pp.75-83
    • /
    • 1999
  • recently, a new hypercube-like interconnection network, the Z-cube, was proposed. The Z-cube retains most good topological properties, however, its node degree is 3/4 of hypercube's one. Considering hardware implementations, the Z-cube is a good alternative to the hypercube. In this paper, we obtained the diameter, fault diameter and the average distance between two nodes to evaluate the communication performance of the Z-cube. The recursive structure, the shortest path between two nodes I Z-cube and recurrence relation on the average distance were deduced, and node disjoint path was introduced. Although it is generally expected that the communication performance in an interconnection network with reduced node degree falls as much as that, this paper shows that the Z-cube's diameter is the same as the hypercube's one and the average distance between two nodes in Z-cube is about 1.125 times the average distance between two nodes in the hypercube and the fault diameter of Z-cube ranges approximately from 1.4times to 1.7times the fault diameter of the hypercube.

  • PDF

Study on the Method to Create a Pedestrian Network and Path using Navigation Data for Vehicles (차량용 내비게이션 데이터를 이용한 보행 네트워크 및 경로 생성 기법)

  • Ga, Chill-O;Lee, Won-Hee;Yu, Ki-Yun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.19 no.3
    • /
    • pp.67-74
    • /
    • 2011
  • In recent years, with increasing utilization of mobile devices such as smartphones, the need for PNS(Pedestrian Navigation Systems) that provide guidance for moving pedestrians is increasing. For the navigation services, road network is the most important component when it comes to creating route and guidance information. In particular, pedestrian network requires modeling methods for more detailed and vast space compared to road network. Therefore, more efficient method is needed to establish pedestrian network that was constructed by existing field survey and manual editing process. This research proposed a pedestrian network creation method appropriate for pedestrians, based on CNS(Car Navigation Systems) data that already has been broadly constructed. Pedestrian network was classified into pedestrian link(sidewalk, side street, walking facility) and openspace link depending on characteristics of walking space, and constructed by applying different methodologies in order to create path that similar to the movements of actual pedestrians. The proposed algorithm is expected to become an alternative for reducing the time and cost of pedestrian network creation.

An Implementation of the path-finding algorithm for TurtleBot 2 based on low-cost embedded hardware

  • Ingabire, Onesphore;Kim, Minyoung;Lee, Jaeung;Jang, Jong-wook
    • International Journal of Advanced Culture Technology
    • /
    • v.7 no.4
    • /
    • pp.313-320
    • /
    • 2019
  • Nowadays, as the availability of tiny, low-cost microcomputer increases at a high level, mobile robots are experiencing remarkable enhancements in hardware design, software performance, and connectivity advancements. In order to control Turtlebot 2, several algorithms have been developed using the Robot Operating System(ROS). However, ROS requires to be run on a high-cost computer which increases the hardware cost and the power consumption to the robot. Therefore, design an algorithm based on low-cost hardware is the most innovative way to reduce the unnecessary costs of the hardware, to increase the performance, and to decrease the power consumed by the computer on the robot. In this paper, we present a path-finding algorithm for TurtleBot 2 based on low-cost hardware. We implemented the algorithm using Raspberry pi, Windows 10 IoT core, and RPLIDAR A2. Firstly, we used Raspberry pi as the alternative to the computer employed to handle ROS and to control the robot. Raspberry pi has the advantages of reducing the hardware cost and the energy consumed by the computer on the robot. Secondly, using RPLIDAR A2 and Windows 10 IoT core which is running on Raspberry pi, we implemented the path-finding algorithm which allows TurtleBot 2 to navigate from the starting point to the destination using the map of the area. In addition, we used C# and Universal Windows Platform to implement the proposed algorithm.

A Multi-path QoS Routing Protocol for the OFDM-TDMA Mesh Networks (OFDM-TDMA 메쉬 네트워크를 위한 다중경로 QoS 라우팅 프로토콜)

  • Choi, Jungwook;Lee, Hyukjoon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.1
    • /
    • pp.57-67
    • /
    • 2015
  • A large amount of work has been done in the areas of routing, MAC, QoS, capacity, location service, cooperative communication, fault tolerance, mobility models and various applications of mesh networks thanks to their merits of cost-effective way of deployment and flexibility in extending wireline services. Although multi-path routing protocols have been proposed to be used to provide QoS and fault-tolerance, there has not been any significant results discussed that support both in the literature to our best knowledge as they are often required in military and public safety applications. In this paper, we present a novel routing protocol for a mesh network based on the OFDM-TDMA collision-free MAC that discovers and maintains multiple paths that allows retransmitting and forwarding packets that have been blocked due to a link failure using an alternative next-hop node such that the delay-capacity tradeoff is reduced and the reliability is enhanced. Simulation results show that the proposed protocol performs well in terms of both the QoS and delivery ratio.