• Journal of the Korean Society of Laryngology, Phoniatrics and Logopedics
• /
• v.19 no.1
• /
• pp.16-20
• /
• 2008

Excising part or all part of a larynx as a cancer operation results in changes that transgress anatomic, physiologic, psychologic, and social priciples. The quality of life of a patient's life after any given cancer surgery usually is regarded as a second-priority consideration after oncologic safety. With laryngeal surgery, excision of malignant disease typically results in change that significantly influence an individual for the duration of his or her life. Nonetheless, with appropriate rehabilitation the surgical side effects can be minimized to allow for an excellent quality of life. Successful conservation surgery for laryngeal cancer requires careful interdependent selection for patients, lesions and procedure. The technical goal is to minimize trauma to uninvolved tissue and to wisely utilized local tissues or tree flap for reconstruction, while insuring for oncologically sound procedure. Rehabilitation should aim to produce a glottal sound source if possible, however voice therapy to promote false vocal fold vibration and arytenoid to epiglottis source of vibration can produce very satisfactory phonatory results.

• Journal of Chest Surgery
• /
• v.25 no.1
• /
• pp.112-116
• /
• 1992

I clinically analysed 13 cases of broncholithiasis which treated surgically and found only four cases of broncholithiasis caused by the erosion of the peribronchial lymph node named by extrinsic formation[Group II], and nine cases of broncholithiasis caused by intrinsic formation[group I] which indicates that no evidence of the erosion of the calcified per-ibronchial lymph node into the bronchial tree was found. This study is performed to see any differences between two groups regarding presenting symptoms, locations of broncholith, preoperative diagnosis, a history of pulmonary tuberculosis, a procedure of operation, and chemical compositions of broncholiths from both groups. There was no difference between two groups in the presenting symptoms, the procedure of operation, and chemical compositions of broncholiths. The broncholits from group two is located in the right middle lobe bronchus, and the broncholiths of group one were distributed at various bronchi, In group one, only five cases out of nine had preoperative diagnosis[55.5%], but in group two, all four had preoperative diagnosis. All cases had good postoperative courses without any complication and recurrences.

• Journal of the Korean Statistical Society
• /
• v.25 no.4
• /
• pp.489-497
• /
• 1996

Lower bounds for the full level probabilities are derived under order restrictions in weights. Discussions are made on typical isotonic cones such as linear order, simple tree order, and unimodal order cones. We also discuss applications of these results for constructing conditional likelihood ratio tests for ordered hypotheses in a contingency table. A real data set on torus mandibularis will be analyzed for illustrating the testing procedure.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.225-226
• /
• 2009

최근 센서를 이용한 의료 분야로의 유비쿼터스 시스템 및 서비스 연구가 활발히 진행되고 있다. 그러나 의료 분야 서비스의 기본적 전제인 WBAN 환경에서의 기존의 모니터링 시스템은 매우 수동적이다. 이를 개선해 스트림 데이터에 대해 보다 효율적인 모니터링 시스템을 구축하기 위한, 우선 순위를 표현하기 위한 큐(Queue)와 각 속성에 대한 질의로 구성된 레벨 트리(Level Tree)로 이어지는 질의 색인 구조에 대해 논하고자 한다.

• Journal of Korea Game Society
• /
• v.1 no.1
• /
• pp.61-67
• /
• 2001

This paper describes a program which learns good strategies for two-poison, deterministic, zero-sum board games of perfect information. The program learns by simply playing the game against either a human or computer opponent. The results of the program's teaming of a lot of games are reported. The program consists of search kernel and a move generator module. Only the move generator is modified to reflect the rules of the game to be played. The kernel uses a temporal difference procedure combined with a backpropagation neural network to team good evaluation functions for the game being played. Central to the performance of the program is the search procedure. This is a the capture tree search used in most successful janggi playing programs. It is based on the idea of using search to correct errors in evaluations of positions. This procedure is described, analyzed, tested, and implemented in the game-teaming program. Both the test results and the performance of the program confirm the results of the analysis which indicate that search improves game playing performance for sufficiently accurate evaluation functions.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.809-817
• /
• 2008

Program plagiarism is widespread due to intelligent software and the global Internet environment. Consequently the detection of plagiarized source code and software is becoming important especially in academic field. Though numerous studies have been reported for detecting plagiarized pairs of codes, we cannot find any profound work on understanding the underlying mechanisms of plagiarism. In this paper, we study the evolutionary process of source codes regarding that the plagiarism procedure can be considered as evolutionary steps of source codes. The final goal of our paper is to reconstruct a tree depicting the evolution process in the source code. To this end, we extend the well-known bioinformatics approach, a local alignment approach, to detect a region of similar code with an adaptive scoring matrix. The asymmetric code similarity based on the local alignment can be considered as one of the main contribution of this paper. The phylogenetic tree or evolution tree of source codes can be reconstructed using this asymmetric measure. To show the effectiveness and efficiency of the phylogeny construction algorithm, we conducted experiments with more than 100 real source codes which were obtained from East-Asia ICPC(International Collegiate Programming Contest). Our experiments showed that the proposed algorithm is quite successful in reconstructing the evolutionary direction, which enables us to identify plagiarized codes more accurately and reliably. Also, the phylogeny construction algorithm is successfully implemented on top of the plagiarism detection system of an automatic program evaluation system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1614-1632
• /
• 2017

Bag of visual words is a popular model in human action recognition, but usually suffers from loss of spatial and temporal configuration information of local features, and large quantization error in its feature coding procedure. In this paper, to overcome the two deficiencies, we combine sparse coding with spatio-temporal pyramid for human action recognition, and regard this method as the baseline. More importantly, which is also the focus of this paper, we find that there is a hierarchical structure in feature vector constructed by the baseline method. To exploit the hierarchical structure information for better recognition accuracy, we propose a tree regularized classifier to convey the hierarchical structure information. The main contributions of this paper can be summarized as: first, we introduce a tree regularized classifier to encode the hierarchical structure information in feature vector for human action recognition. Second, we present an optimization algorithm to learn the parameters of the proposed classifier. Third, the performance of the proposed classifier is evaluated on YouTube, Hollywood2, and UCF50 datasets, the experimental results show that the proposed tree regularized classifier obtains better performance than SVM and other popular classifiers, and achieves promising results on the three datasets.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.186-192
• /
• 2023

Malwares are becoming a major problem nowadays all around the world in android operating systems. The malware is a piece of software developed for harming or exploiting certain other hardware as well as software. The term Malware is also known as malicious software which is utilized to define Trojans, viruses, as well as other kinds of spyware. There have been developed many kinds of techniques for protecting the android operating systems from malware during the last decade. However, the existing techniques have numerous drawbacks such as accuracy to detect the type of malware in real-time in a quick manner for protecting the android operating systems. In this article, the authors developed a hybrid model for android malware detection using a decision tree and KNN (k-nearest neighbours) technique. First, Dalvik opcode, as well as real opcode, was pulled out by using the reverse procedure of the android software. Secondly, eigenvectors of sampling were produced by utilizing the n-gram model. Our suggested hybrid model efficiently combines KNN along with the decision tree for effective detection of the android malware in real-time. The outcome of the proposed scheme illustrates that the proposed hybrid model is better in terms of the accurate detection of any kind of malware from the Android operating system in a fast and accurate manner. In this experiment, 815 sample size was selected for the normal samples and the 3268-sample size was selected for the malicious samples. Our proposed hybrid model provides pragmatic values of the parameters namely precision, ACC along with the Recall, and F1 such as 0.93, 0.98, 0.96, and 0.99 along with 0.94, 0.99, 0.93, and 0.99 respectively. In the future, there are vital possibilities to carry out more research in this field to develop new methods for Android malware detection.

• KEPCO Journal on Electric Power and Energy
• /
• v.6 no.3
• /
• pp.259-269
• /
• 2020

With the proposal-agreement procedure, RSTP can reduce the network recovery time to 400 ms or less in the case of 40 bridges. While the legacy RSTP reverts the previous agreement at the bridge with the alternate port role in the ring during the fault recovery, a new position based fast fault recovery procedure is proposed in this paper to guarantee a single proposal-agreement transaction which can provide more faster recovery. By knowing the relative position of the faulty link or bridge in hops, the bridge on the middle of the ring can complete the recovery procedure without revert. The performance of proposed procedure is numerically calculated and verified by simulation and the result shows that the recovery time can be reduced up to 100 ms, which is 1/4 times of the legacy RSTP.

• The Journal of Korean Medicine
• /
• v.35 no.3
• /
• pp.93-102
• /
• 2014

Objectives: This study aimed at revising the Korean Out-patient Groups for Korean Medicine (KOPG-OM, version 1.0) based on clinical similarity and resource use, by using the accumulated claims data, and evaluating the validity of the revised classification system. Methods: A clinical specialist panel involving 19 specialists from 8 Korean medicine (KM) specialty areas reviewed the classification tree, diagnosis groups and procedure groups in terms of clinical similarity. Several models of outpatient grouping were formulated, with the validity of each tested based on the $R^2$ coefficient of determination for the treatment costs of all visits. To add age splits, the variances of treatment costs by age groups were also analyzed. These statistical analyses were performed using KM claims data of National Health Insurance from 2010 to 2012. Results: The classification tree designed via panel discussions was used to allocate outpatient cases to 26 diagnosis groups, with cases involving procedures such as acupuncture, moxibustion and cupping, then allocated to 9 procedure groups in each diagnosis group. The cases without procedures were categorized into the visit index - medication group. This process resulted in 298 outpatient groups. The $R^2$ values for treatment costs of all visits ranged from 0.38 to 0.69 depending on the providers' types. Conclusions: The revised model of KOPG-KM has a higher validity for outpatient classification than the current system and can provide better management of the costs of outpatient care in KM.