• Asian Pacific Journal of Cancer Prevention
• /
• v.16 no.14
• /
• pp.5951-5956
• /
• 2015

Background: To evaluate the rate of pathologic high-risk factors, intermediate-risk factors, and treatment outcomes in early-stage cervical cancer patients undergoing radical hysterectomy and pelvic lymphadenectomy (RHPL). Materials and Methods: Medical records of stage IA-IIA1 cervical cancer patients who underwent RHPL during the 2006 to 2012 time period and patient follow-up data until December 2013 were reviewed. Results: Of 331 patients, 52 women (15.7%) had pathologic high-risk factors and 59 women (17.8%) had intermediate-risk factors without high-risk factors. All studied patients had an initial complete response. At median follow-up time of 40.9 months (range 1-103.3 months) and mean follow-up time of$ 43.3{\pm}25.3$ months, 37 women had disease recurrence and 4 women had died of disease. The most common site of recurrence was the pelvis (64.8%). Five-year and 10-year disease free survival rates were 96.1% and 91.5%, respectively. Five-year and 10-year overall survival rates were 100% and 99.4%, respectively. Independent factors related to recurrence were pelvic node metastasis (odds ratio [OR], 2.670; 95%CI, 1.001-7.119), and >1/3 cervical stromal invasion (OR, 3.763; 95%CI, 1.483-9.549). Conclusions: The rates of pathologic high-risk and intermediate-risk factors should be considered and disclosed when counseling patients regarding primary treatment by RHPL. Oncologic outcomes of primary surgical treatment for early-stage cervical carcinoma were found to be excellent.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.951-958
• /
• 2000

In wavelength-routed all-optical networks, signals are transmitted on a direct optical path, or a lightpath, in a single-hop manner without opto-electronic/electro-optic(OE/EO) conversion at intermediate nodes. However, due to the physical constraints of optical elements such as ASE noise and crosstalk signals can be degraded un a long path. To establish a connection under such impairments, the optical signal may need to be regenerated at intermediate nodes, dividing a lightpath into two or more fragments. However, since signal regeneration at intermediate nodes requires additional network resources, the selection of these nodes should be made carefully to minimize blocking of other lightpaths. In this paper, we deal with the problem of establishing a lightpath in a multihop manner under physical constraints. We provide both minimal-cost and heuristic algorithms for locating signal regeneration nodes(SRNs). For a minimal-cost algorithm, we formulate the problem using dynamic programming(DP) such that blocking of other lightpaths due to the lack of transmitters/receivers(TXs/RXs) and wavelengths is minimized throughout the network.

• Korean Journal of Radiology
• /
• v.21 no.5
• /
• pp.605-613
• /
• 2020

Objective: To determine the malignancy risk of isolated macrocalcifications (a calcified nodule with complete posterior acoustic shadowing) detected on ultrasonography (US) and to evaluate the postoperative American Thyroid Association (ATA) risk stratification of malignant tumors manifesting as isolated macrocalcifications. Materials and Methods: A total of 3852 thyroid nodules (≥ 1 cm) of 3061 consecutive patients who had undergone biopsy between January 2011 and June 2018 were included in this study. We assessed the prevalence, malignancy rate, and size distribution of isolated macrocalcifications and evaluated the histopathologic features and postoperative ATA risk stratification of malignant tumors manifesting as isolated macrocalcifications. Results: Isolated macrocalcifications were found in 38 (1.2%) of the 3061 patients. Final diagnosis was established in 30 (78.9%) nodules; seven malignant tumors were diagnosed as papillary thyroid carcinomas (PTCs). The malignancy rate of the isolated macrocalcifications was 23.3% in the 30 nodules with final diagnoses and 18.4% in all nodules. Among the six surgically-treated malignant tumors, five (83.3%) had an extrathyroidal extension (ETE) (minor ETE 1, gross ETE 4), and two (33.3%) had macroscopic lymph node metastasis. Four (66.7%) malignant tumors were categorized as high-risk tumors, one as an intermediate-risk tumor, and one as a low-risk tumor using the ATA risk stratification. Histopathologically, out of the six malignant tumors, ossifications were noted in four (66.7%) and predominant calcifications in two (33.3%). Conclusion: The US pattern of isolated macrocalcifications (≥ 1 cm) showed an intermediate malignancy risk (at least 18.4%). All malignant tumors were PTCs, and most showed an aggressive behavior and a high or intermediate postoperative ATA risk.

• Smart Media Journal
• /
• v.8 no.2
• /
• pp.29-38
• /
• 2019

With the advancement of information and communication technology, tactical networks are continuously being converted to All-IP future tactical networks that integrate all application services based on Internet protocol. Futuristic tactical mesh network is built with tactical WAN (wide area network) nodes that are inter-connected by a mesh structure. In order to guarantee QoS (quality of service) of application services, tactical service mesh (TSM) is suggested as an intermediate layer between infrastructure and application layers for futuristic tactical mesh network. The tactical service mesh requires dynamic QoS monitoring and control for intelligent QoS coordination. However, legacy networking nodes used for existing tactical networks are difficult to support these functionality due to inflexible monitoring support. In order to resolve such matter, we propose a tactical mesh WAN node as a hardware/software co-designed networking node in this paper. The tactical mesh WAN node is conceptually designed to have multi-access networking interfaces and virtualized networking switches by leveraging the DANOS whitebox server/switch. In addition, we explain how to apply eBPF-based traffic monitoring to the tactical mesh WAN node and verify the traffic monitoring feasibility for supporting QoS coordination of tactical-mesh traffic.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.21-28
• /
• 2016

This paper presents a cooperative transmission scheme for underwater acoustic sensor networks to improve packet transmission rate and reduce energy consumption. Source node transmits duplicated information relayed by distributed antennas called a virtual antenna array. Destination node combines that information to reduce packet error rate. The suggested cooperative scheme enhances the reliability by providing high diversity gains through intermediate relay nodes to overcome the distinct characteristics of the underwater channel, such as high transmission loss, propagation delay, and ambient noises. It is suggested that the algorithm select destinations and potential relays from a set of neighboring nodes that utilize distance cost, the residual energy of each node and local measurement of the channel conditions into calculation. Simulation results show that the proposed scheme reduces average energy consumption, response time, and increases packet delivery ratio compared with the SPF(Shortest Path First) and non-cooperative scheme using OPNET Moduler.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.603-609
• /
• 2003

Adaptive routing methods are studied for effective routing in many topologies where occurrence of the faulty nodes are inevitable. Mesh topology provides simplicity in implementing these methods. Many routing methods for mesh are able to tolerate a large number of faults enclosed by a rectangular faulty block. But they consider even good nodes in the faulty block as faulty nodes. Hence, it results the degradation of node utilization. This problem is solved by a method which transmits messages to destinations within faulty blocks via multiple “intermediate nodes”. It also divides faulty block into multiple expanded meshes. With these expanded meshes, DAG(Directed Acyclic Graph) is formed and a message is able to be routed by the shortest path according to the DAG. Therefore, the additional number of hops can be resulted. We propose a method that reduces the number of hops by searching direct paths from the destination node to the border of the faulty block. This path is called SCP(Short-Cut Path). If the path and the traversing message is on the same side of outside border of the faulty block, the message will cut into the path found by our method. It also reduces the message traverse latency between the source and the destination node.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.9-22
• /
• 2006

When the legacy multicast routing protocols are adopted in If-based mobile core networks, there are some problems such as traffic injection from unnecessary sources, traffic overhead by group management and router performance degradation by large amount of multicast session information. In this paper, we propose a stateless multicast mechanism which has no need to maintain multicast information for session status and reduces redundant network overhead for maintaining multicast tree. In addition interworking with IGMPv3 gets rid of traffic from unnecessary sources which have no registration from receivers. The operations of essential components including a gateway node for interworking with the legacy Internet multicast network, a gateway node for transparency to radio access network and a intermediate node in mobile core networks, are definitely defined and the proposed communication architecture is completed. Finally we evaluate and approve the performance of the proposed architecture by means of well-designed network simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.1
• /
• pp.703-712
• /
• 2015

This paper proposes the UIGRP, which can tackle the problem of the network disconnection and packet transmission delay caused by turning vehicles frequently in an urban intersection. The UIGRP was designed as follows. First, it calculates the direction of vehicles using the moving direction of vehicles and the location of a destination. Second, it makes the RSU measure the density of an urban intersection. Third, the TGF Algorithm in the UIGRP decides the data transmission paths by setting as an intermediate node, not only the vehicle that is moving in the direction where a destination node is located, but also the node that has the highest density. The TGF algorithm using a moving direction and density minimizes or removes the occurrence of local maximum problems that the existing Greedy Forwarding algorithm has. Therefore, the simulation result shows that UIGRP decreases the occurrence of local maximum problems by 3 and 1 times, and the packet transmission time by 6.12 and 2.04(ms), and increases the success rate of packet transmission by 15 and 3%, compared to the existing GPSR and GPUR.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1284-1294
• /
• 2010

The ZigBee is one of the most important technologies for composing USN. It is one of the IEEE 802.15.4 standards to support personal area networks. It uses a hierarchical routing or an on-demand route discovery strategy as an address allocation method. A hierarchical routing doesn't use a routing table but only uses a child node or a parent node as an intermediate node for data delivery. Therefore, the ZigBee network's topology greatly affects the overall network performance. In this paper, we propose a more trustworthy algorithm than only using the depth and widely variable LQI during network formation, and moreover we propose an algorithm to measure network's trustworthiness. We simulate our algorithm using the NS-2 and implement our network using the MG2400 ZigBee module for verifying performance.

• Journal of KIISE:Information Networking
• /
• v.33 no.6
• /
• pp.451-460
• /
• 2006

In HMIPv6, the nested mobile network because of the mobility of node and router can be constituted. Many subnets exist and many mobile router(MR)s and mobile node(MN)s activate in the nested mobile network. If the nested depth is deeper, the number of mobile router that packet goes through, increases and data transmission delay owing to this might be larger. This paper proposes EPA algorithm which finds out the path from Mobility Anchor Point(MAP) to a destination mobile node using the binding cache information of MAP and processes the path information by adding it to packet header. If we apply EAP algorithm, the quantity of unnecessary packet within MAP domain can be decreased. Also, the transmission delay can be decreased in a intermediate mobile router because it supports packet re-transmission just by simple packet substitution.