• Journal of Korean Traditional Oncology
• /
• v.27 no.1
• /
• pp.25-36
• /
• 2022

The Randomized Control Trial (RCT) is the most well-established and widely used statistical methodology in clinical research; however, applying thorough RCT to cancer patients presents challenges such as ethical concerns, high costs, short clinical periods, and limitations in collecting various side effects. To address this issue, the propensity score matching method, which takes advantage of the benefits of observational research while compensating for the drawbacks of randomized control trials, is used in a variety of fields. In recent years, 28 studies on the effectiveness of Korean medicine on tumors have been conducted abroad using the Propensity Score Matching Method, but none have been conducted in Korea. The majority of studies have focused on liver cancer, colon cancer, lung cancer, and stomach cancer, with endpoints such as survival time, incidence rate, quality of life, and treatment outcomes revealing statistical differences in how Korean medicine intervention affects treatment outcomes. As a result, well-established studies using the propensity matching score methodology should be useful in evaluating the impact of Korean medicine in oncology treatments.

• Journal of KIBIM
• /
• v.13 no.1
• /
• pp.22-32
• /
• 2023

Due to the increased use of digital maps in the construction industry, there is a growing demand for high-quality digital map analysis. With the large amounts of data found in digital maps at earthwork sites, there is a particular need to enhance the accuracy and speed of digital map analysis. To address this issue, our study aims to develop new technology and verify its performance to address non-ground and range mismatch issues that commonly arise. Additionally, our study presents a new digital map analysis framework for earthwork sites that utilizes three newly developed technologies to improve the performance of digital map analysis. Through this, it achieved about 95% improvement in analysis performance compared to the existing framework. This study is expected to contribute to the improvement of the quality of digital map analysis data of earthworks.

• Journal of Cadastre & Land InformatiX
• /
• v.52 no.1
• /
• pp.105-118
• /
• 2022

The demand for information related to 3D spatial objects model in metaverse, smart cities, digital twins, autonomous vehicles, urban air mobility will be increased. 3D model construction for spatial objects is possible with various equipments such as satellite-, aerial-, ground platforms and technologies such as modeling, artificial intelligence, image matching. However, it is not easy to quickly detect and convert spatial objects that need updating. In this study, based on spatial information (features) and attributes, using matching elements such as address code, number of floors, building name, and area, the converged building DB and the detected building DB are constructed. Both to support above and to verify the suitability of object selection that needs to be updated, one system prototype was developed. When constructing the converged building DB, the convergence of spatial information and attributes was impossible or failed in some buildings, and the matching rate was low at about 80%. It is believed that this is due to omitting of attributes about many building objects, especially in the pilot test area. This system prototype will support the establishment of an efficient drone shooting plan for the rapid update of 3D spatial objects, thereby preventing duplication and unnecessary construction of spatial objects, thereby greatly contributing to object improvement and cost reduction.

• International journal of advanced smart convergence
• /
• v.5 no.3
• /
• pp.47-55
• /
• 2016

Router main task is to provide routing of Internet Protocol (IP) packets. Routing is achieved with help of the IP lookup. Router stores information about the networks and interfaces in data structures commonly called as routing tables. Comparison of IP from incoming packet with the IPs stored in routing table for the information about route is IP Lookup. IP lookup performs by longest IP prefix matching. The performance of the IP router is based on the speed of prefix matching. IP lookup is a major bottle neck in the performance of Router. Various algorithms and data structures are available for IP lookup. This paper is about reviewing various tree based structure and its performance evaluation.

• Journal of Creative Information Culture
• /
• v.5 no.2
• /
• pp.145-156
• /
• 2019

In this study, we have developed and evaluated an information extracting module based on the named entity recognition technique. For the given purpose in this paper, the module was designed to apply to the problem dealing with extraction of postal address information from arbitrary documents without any prior knowledge on the document layout. From the perspective of information technique practice, our approach can be said as a probabilistic n-gram (bi- or tri-gram) method which is a generalized technique compared with a uni-gram based keyword matching. It is the main difference between our approach and the conventional methods adopted in natural language processing that applying sentence detection, tokenization, and POS tagging recursively rather than applying the models sequentially. The test results with approximately two thousands documents are presented at this paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.583-599
• /
• 2015

We apply the Bayesian matching pursuit (BMP) algorithm to the estimation of time-frequency selective channels in orthogonal frequency division multiplexing (OFDM) systems. By exploiting prior statistics and sparse characteristics of propagation channels, the Bayesian method provides a more accurate and efficient detection of the channel status information (CSI) than do conventional sparse channel estimation methods that are based on compressive sensing (CS) technologies. Using a reasonable approximation of the system model and a skillfully designed pilot arrangement, the proposed estimation scheme is able to address the Doppler-induced inter-carrier interference (ICI) with a relatively low complexity. Moreover, to further reduce the computational cost of the channel estimation, we make some modifications to the BMP algorithm. The modified algorithm can make good use of the group-sparse structure of doubly selective channels and thus reconstruct the CSI more efficiently than does the original BMP algorithm, which treats the sparse signals in the conventional manner and ignores the specific structure of their sparsity patterns. Numerical results demonstrate that the proposed Bayesian estimation has a good performance over rapidly time-varying channels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.1984-2002
• /
• 2020

With the appearance of wireless spectrum crisis in traditional cellular network, device-to-device (D2D) communication has been regarded as a promising solution to ease heavy traffic burden by enabling precise content delivery among mobile users. However, due to the channel sharing, the interference between D2D and cellular users can affect the transmission rate and narrow the throughput in the network. In this paper, we firstly present a weighted interference minimization cluster formation model involving both social attribute and physical closeness. The weighted-interference, which is evaluated under the susceptible-infected(SI) model, is utilized to gather user in social and physical proximity. Then, we address the cluster formation problem via spectrum clustering with iterative operation. Finally, we propose the stable matching theory algorithm in order to maximize rate oriented to accomplish the one-to-one resource allocation. Numerical results show that our proposed scheme acquires quite well clustering effect and increases the accumulative transmission rate compared with the other two advanced schemes.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.968-976
• /
• 1999

Currently, in the most mail automatic processing centers, after facing and canceling, envelope mail is passed through an Optical Character Recognition/Barcode Sorter(OCR/BS) to read the address and 3 of 5 fluorescent(luminescent) barcode is applied. Normally, 30%∼35% of this mail is rejected. The usual reasons for read failure are poor printing quality of address and barcode, script printing and failure to locate the address. This paper describes a verification system of the postal 3 of 5 customer barcode for solving this problem. The certification system of the 3 of 5 customer barcode consists of barcode verification system and postal address database. The purpose of certification system of the customer barcode verifies the postal 3 of 5 customer barcode and tests matching of mail piece postal address, and retrieves postal code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.911-919
• /
• 2004

IP address lookup is one of the essential functions on internet routers, and it determines overall router performance. The most important evaluation factor for software-based IP address lookup is the number of the worst case memory accesses. Binary prefix tree (BPT) scheme gives small number of worst case memory accesses among previous software-based schemes. However the tree structure of BPT is normally unbalanced. In this paper, we propose weighted binary prefix tree (WBP) scheme which generates nearly balanced tree, through combining the concept of weight to the BPT generation process. The proposed WBPT gives very small number of worst case memory accesses compared to the previous software-based schemes. Moreover the WBPT requires comparably small size of memory which can be fit within L2 cache for about 30,000 prefixes, and it is rather simple for prefix addition and deletion. Hence the proposed WBPT can be used for software-based If address lookup in practical routers.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.1
• /
• pp.59-65
• /
• 2012

In this paper, we proposed a method for automatic detection of a updating object from spatial data sets of different scale and updating cycle by using areal feature matching based on shape similarity. For this, we defined a updating object by analysing matching relationships between two different spatial data sets. Next, we firstly eliminated systematic errors in different scale by using affine transformation. Secondly, if any object is overlaid with several areal features of other data sets, we changed several areal features into a single areal feature. Finally, we detected the updating objects by applying areal feature matching based on shape similarity into the changed spatial data sets. After applying the proposed method into digital topographic map and a base map of Korean Address Information System in South Korea, we confirmed that F-measure is highly 0.958 in a statistical evaluation and that significant updating objects are detected from a visual evaluation.