• Journal of Gastric Cancer
• /
• v.23 no.4
• /
• pp.535-548
• /
• 2023

Purpose: This study evaluated real-world compliance with surgical treatment according to Korea's gastric cancer treatment guidelines. Materials and Methods: The 2018 Korean Gastric Cancer Treatment Guidelines were evaluated using the 2019 national survey data for surgically treated gastric cancer based on postoperative pathological results in Korea. In addition, the changes in surgical treatments in 2019 were compared with those in the 2014 national survey data implemented before the publication of the guidelines in 2018. The compliance rate was evaluated according to the algorithm recommended in the 2018 Korean guidelines. Results: The overall compliance rates in 2019 were 83% for gastric resection extent, 87% for lymph node dissection, 100% for surgical approach, and 83% for adjuvant chemotherapy, similar to 2014. Among patients with pathologic stages IB, II, and III disease who underwent total gastrectomy, the incidence of splenectomy was 8.08%, a practice not recommended by the guidelines. The survey findings revealed that 48.66% of the patients who underwent gastrectomy had pathological stage IV disease, which was not recommended by the 2019 guidelines. Compared to that in 2014, the rate of gastrectomy in stage IV patients was 54.53% in 2014. Compliance rates were similar across all regions of Korea, except for gastrectomy in patients with stage IV disease. Conclusions: Real-world compliance with gastric cancer treatment guidelines was relatively high in Korea.

• Archives of Plastic Surgery
• /
• v.45 no.6
• /
• pp.525-533
• /
• 2018

Background Patients with ectropion experience devastating symptoms. Therefore, the prevention and management of this condition are of utmost importance. To treat ectropion, it is important to perform medial and lateral canthopexy in an effective way. In this study, we propose a comprehensive algorithm for the prevention and management of ectropion based on a new classification of ectropion according to its signs and causes. Methods Canthopexy was performed in 68 cases according to the proposed algorithm, which starts with a categorization of the types of ectropion and ends with the recommended operative technique. To assess the results, we reviewed clinical preoperative and postoperative photographs. To evaluate improvements in patients' symptoms, we conducted a survey with responses scored on a Likert scale. Results None of the patients had scleral show postoperatively. The average patient satisfaction score was satisfied or higher for all symptoms, and the most improved symptom was aesthetic appearance. No major complications were reported. Conclusions For the comprehensive management of ectropion, it is crucial to consider both treatment and prevention. Through the simple surgical algorithm proposed in this study, both medically acceptable results and high levels of patient satisfaction were achieved without significant postoperative complications. We recommend using this algorithm for the comprehensive management of ectropion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1297-1308
• /
• 2006

Multiplications in finite fields are one of the most important arithmetic operations for implementations of elliptic curve cryptographic systems. In this paper, we propose a new multiplication algorithm and VLSI architecture over $GF(2^m)$ using Gaussian normal basis. The proposed algorithm is designed by using a symmetric property of normal elements multiplication and transforming coefficients of normal elements. The proposed multiplication algorithm is applicable to all the five recommended fields $GF(2^m)$ for elliptic curve cryptosystems by NIST and IEEE 1363, where $m\in${163, 233, 283, 409, 571}. A new VLSI architecture based on the proposed multiplication algorithm is faster or requires less hardware resources compared with previously proposed normal basis multipliers over $GF(2^m)$. In addition, we gives an easy method finding a basic multiplication matrix of normal elements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.69-77
• /
• 2002

Sine digital signal processing for motion pictures requires huge amount of data computation to store, manipulate and transmit, more effective data compression is necessary. Therefore, the ITU-T recommended H.26x as data compression standards for digital motion pictures. The data compression method that eliminates time redundancies by motion estimation using relationship between picture frames has been widely used. Most video conding systems employ block matching algorithm for the motion estimation and compensation, and the algorithm is based on the minimun value of cast functions. Therefore, fast search algorithm rather than full search algorithm is more effective in real time low data rates encodings such as H.26x. In this paper, motion estimation employing the Nearest-Neighbors algorithm is designed to reduce search time using FPGA, coded in VHDL, and simulated and verified using Xilink Foundation.

• Journal of Service Research and Studies
• /
• v.5 no.2
• /
• pp.25-33
• /
• 2015

As Data mining is a method of extracting the information based on the large data, the technique has been used in many application areas to deal with data in particular. However, the status of the algorithm that can deal with the healthcare data are not fully developed. In this paper, One of clustering algorithm, the EM and DBSCAN are used for performance comparison. It could be analyzed using by the same data. To do this, EM and DBSACN algorithm are changing performance according to the variables in Health expenditure database. Based on the results of the experimental data, We analyze more precise and accurate results using by Kernel Filtering. In this study, we tried comparison of the performance for the algorithm as well as attempt to improve the performance. Through this work, we were analyzed the comparison result of the application of the experimental data and of performance change according to expansion algorithm. Especially, Collects data from the various cluster using the medical record, it could be recommended the effective spending on medical services.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.145-152
• /
• 2010

In this paper, we first propose a fast division algorithm in GF($2^{163}$) using standard basis representation, and then it is mapped into divider for GF($2^{163}$) with iterative hardware structure. The proposed algorithm is based on the binary ExtendedGCD algorithm, and the arithmetic operations for modular reduction are performed within only one "while-statement" unlike conventional approach which uses two "while-statement". In this paper, we use reduction polynomial $f(x)=x^{163}+x^7+x^6+x^3+1$ that is recommended in SEC2(Standards for Efficient Cryptography) using standard basis representation, where degree m = 163. We also have implemented the proposed iterative architecture in FPGA using Verilog HDL, and it operates at a clock frequency of 85 MHz on Xilinx-VirtexII XC2V8000 FPGA device. From implementation results, we will show that computation speed of the proposed scheme is significantly improved than the existing two approaches.

• East Asian mathematical journal
• /
• v.32 no.4
• /
• pp.565-587
• /
• 2016

The purpose of this study was to analyze the understanding of the meaning of fraction division and fraction division algorithm of elementary mathematical gifted students through the process of problem posing and solving activities. For this goal, students were asked to pose more than two real-world problems with respect to the fraction division of ${\frac{3}{4}}{\div}{\frac{2}{3}}$, and to explain the validity of the operation ${\frac{3}{4}}{\div}{\frac{2}{3}}={\frac{3}{4}}{\times}{\frac{3}{2}}$ in the process of solving the posed problems. As the results, although the gifted students posed more word problems in the 'inverse of multiplication' and 'inverse of a cartesian product' situations compared to the general students and pre-service elementary teachers in the previous researches, most of them also preferred to understanding the meaning of fractional division in the 'measurement division' situation. Handling the fractional division by converting it into the division of natural numbers through reduction to a common denominator in the 'measurement division', they showed the poor understanding of the meaning of multiplication by the reciprocal of divisor in the fraction division algorithm. So we suggest following: First, instruction on fraction division based on various problem situations is necessary. Second, eliciting fractional division algorithm in partitive division situation is strongly recommended for helping students understand the meaning of the reciprocal of divisor. Third, it is necessary to incorporate real-world problem posing tasks into elementary mathematics classroom for fostering mathematical creativity as well as problem solving ability.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.6
• /
• pp.259-267
• /
• 2002

In this paper, we focus on comparison and analysis of performance for existing Topology Aggregation algorithm. For these, we designed and implemented PNNI routing simulator which contain various TA schemes, and evaluate performance of TA schemes by this simulator. The PNNI 1.0 specification of the ATM Forum is recommended that hierarchical routing protocol and topology information is aggregated in the network constructed hierarchically Aggregating topology information is known as TA(Topology Aggregation) and TA is very important for scalability and security in network. Therefore, the performance of PNNI network would vary with TA schemes and routing algorithm. PNNI routing simulator can be applied to develope Routing algorithm and TA algorithm and can be develope these algorithms in short period.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.27-32
• /
• 2009

Colored thread algorithm, suggested to be used for the label switching network, needs to be modified for the packet switching network. In this paper, it is recommended to add a merged state, besides the 3 states - null, colored and transparent - which are resulted from the behaviors of extend, rewind, stall, withdraw and merge events. The original colored thread algorithm is designed to generate a new thread and extend it to the downstream direction with unknown hop count when the thread has revisited the node that was visited. It also suggested rewinding the thread to the downstream direction by the source node, instead of rewinding it upstream direction by the revisited node. If a node received multiple threads which had a same forward equivalent class, then it checks first whether the hop counts are ascending or not. If it is in ascending order, then threads are merged. Otherwise the later thread is stalled until the former thread's color is to be changed to transparent or it is removed. This idea removes the effort of generating a new thread with unknown hop count.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.1
• /
• pp.117-122
• /
• 2023

This paper introduces the improved and expanded contents of the previous research that implemented a system that guides the visually impaired using the vibration of a smart watch. In the previous study, we proposed an algorithm that recommends the most safe route based on calculating negative and positive values for the topography of the route and the features installed on the route. In addition, by designing several vibration patterns, a system that guides the user through vibration was proposed and implemented. In this paper, the user's personal preferences are reflected in the algorithm that recommends the safe route first. In addition, an automatic feedback function was added to the algorithm so that the user's satisfaction evaluation on the recommended route was immediately reflected. A history simulation function was added so that the past route could be reviewed, and the compass of a smart watch was used to help visually impaired people find directions at junctions.