• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.902-910
• /
• 2016

Recently, the volume of mobile data traffic increases exponentially due to the emergence of various mobile services. In order to resolve the problem of mobile traffic increase, various new technologies have been devised. Especially, two-way relay communication in which two nodes can transfer data simultaneously through relay node, has gained lots of interests due to its capability to improve spectral efficiency. In this paper, we analyze the SM-PNC which combines Physical-layer Network Coding (PNC) and Spatial Modulation (SM) under two-way relay communication environment. Log-Likelihood Ratio (LLR) is considered and both separate decoding and direct decoding have been taken into account in performance analysis. Through performance evaluation, we have found that the bit error rate of the proposed scheme is improved compared to that of the conventional PNC scheme, especially when SNR is high and the number of antennas is large.

• Pediatric Infection and Vaccine
• /
• v.11 no.2
• /
• pp.170-175
• /
• 2004

Purpose : We experienced 7 patients with Kikuchi-Fujimoto disease(KFD) who had presented a prolonged fever and lymphadenopathy. The clinical and the laboratory aspects of the patients were analyzed. Methods : The medical records of the 7 KFD patients, who were confirmed by excisional lymph node biopsy from January 1996 through December 2003, were retrospectively analyzed. Results : The mean age of the children was $11.4{\pm}2.8$ years(ranging from 8 to 15 years). The male to female ratio was 1.3 : 1. The median duration of the fever prior to admission and the total duration of the fever were 12 days(ranging from 5 to 65 days) and 27 days(ranging 9 to 75 days), respectively. One patient had supraclavicular lymphadenopathy, 5 had cercical involvement, and 1 had axillary lymphadenopathy. All the histologic findings of the lymph nodes biopsies showed the characteristic findings consistent with KFD such as paracortical necrosis with karyorrhexis and an increase in the number of phagocytic histiocytes and atypical lymphocytes. As for the laboratory findings, leukopenia($3,800{\pm}700/mm^3$), anemia(hemoglobin, $11.0{\pm}1.2g/dL$), an elevated erythrocyte sedimentation rate($42{\pm}17mm/hr$), and a relatively low C-reactive protein level($1.3{\pm}0.9mg/dL$) were noted. Four patients received conservative therapy with antipyretics, and 3 patients were treated with prednisolone. Conclusion : KFD is a rare disease, yet should be considered in the differential diagnosis for older children with prolonged fever and lymphadenopathy.

• Journal of the Economic Geographical Society of Korea
• /
• v.18 no.4
• /
• pp.539-555
• /
• 2015

This study proposes the methodology for measuring the time-distance accessibility on the Seoul bus system based on the T-card transaction databases and analyzes the results. T-card transaction databases contain the time/space information of each passenger's locations and times of the departure, transfers, and destination. We introduce the bus network graph and develop the algorithms for time-distance accessibility measurement. We account the average speed based on each passenger's get-in and getoff information in the T-card data as well as the average transfer time from the trip chain transactions. Employing the modified Floyd APSP algorithm, the shortest time distance between each pair of bus stops has been accounted. The graph-theoretic nodal accessibility has been given by the sum of the inverse time distance to all other nodes on the network. The results and spatial patterns are analyzed. This study is the first attempt to measure the time-distance accessibility for such a large transport network as the Seoul bus system consists of 34,934 bus stops on the 600 bus routes, and each bus route can have different properties in terms of speed limit, number of lanes, and traffic signal systems, and thus has great significance in the accessibility measurement studies.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.164-175
• /
• 2019

The Tor Tong Daeng Irrigation Project with the irrigation area of 61,400 hectares is located in the Ping Basin of the Upper Central Plain of Thailand where farmers depended on both surface water and groundwater. In the drought year, water storage in the Bhumipol Dam is inadequate to allocate water for agriculture, and caused water deficit in many irrigation projects. Farmers need to find extra sources of water such as water from farm pond or groundwater as a supplement. The operation of Bhumipol Dam and irrigation demand estimation are vital for irrigation water allocation to help solve water shortage issue in the irrigation project. The study aims to determine the smart dam operation system to mitigate water shortage in this irrigation project via introduction of machine learning to improve dam operation and irrigation demand estimation via soil moisture estimation from satellite images. Via ANN technique application, the inflows to the dam are generated from the upstream rain gauge stations using past 10 years daily rainfall data. The input vectors for ANN model are identified base on regression and principal component analysis. The structure of ANN (length of training data, the type of activation functions, the number of hidden nodes and training methods) is determined from the statistics performance between measurements and ANN outputs. On the other hands, the irrigation demand will be estimated by using satellite images, LANDSAT. The Enhanced Vegetation Index (EVI) and Temperature Vegetation Dryness Index (TVDI) values are estimated from the plant growth stage and soil moisture. The values are calibrated and verified with the field plant growth stages and soil moisture data in the year 2017-2018. The irrigation demand in the irrigation project is then estimated from the plant growth stage and soil moisture in the area. With the estimated dam inflow and irrigation demand, the dam operation will manage the water release in the better manner compared with the past operational data. The results show how smart system concept was applied and improve dam operation by using inflow estimation from ANN technique combining with irrigation demand estimation from satellite images when compared with the past operation data which is an initial step to develop the smart dam operation system in Thailand.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.2
• /
• pp.113-119
• /
• 2016

Wireless sensor networks are vulnerable to an adversary due to scarce resources and wireless communication. An adversary can compromise a sensor node and launch a variety of attacks such as false report injection attacks. This attack may cause monetary damage resulting in energy drain by forwarding the false reports and false alarms at the base station. In order to address this problem, a number of en-route filtering schemes has been proposed. Notably, a dynamic en-route filtering scheme can save energy by filtering of the false report. In the key dissemination phase of the existing scheme, the nodes closer to the source node may not have matching keys to detect the false report. Therefore, continuous attacks may result in unnecessary energy wastage. In this paper, we propose a key re-distribution scheme to solve this issue. The proposed scheme early detects the false report injection attacks using initially assigned secret keys in the phase of the key pre-distribution. The experimental results demonstrate the validity of our scheme with energy efficiency of up to 26.63% and filtering capacity up to 15.92% as compared to the existing scheme.

• Journal of Internet Computing and Services
• /
• v.21 no.3
• /
• pp.1-9
• /
• 2020

Along with the growth of Blockchain, DApp (Distributed Application) is getting attention. As interest in DApp grows, market size continues to grow and many developers participate in development. Many developers are using API(Application Programming Interface) services to mediate Blockchain nodes, such as Infura, for DApp development. However, when using such a service, there is a serious risk that the API service operator can violate the user's privacy by 1 to 1 matching the account address of the Transaction executed by the DApp user with the IP address of the DApp user. It can have an adverse effect on the reliability of public Blockchains that need to provide users with a secure DApp service environment. The proposed Blockchain platform is expected to provide user privacy protection from API services and provide a reliable DApp use environment that existing Blockchain platforms did not provide. It is also expected to help to activate DApp and increase the number of DApp users, which has not been activated due to the risk of an existing privacy breach.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.673-684
• /
• 2004

As the wireless mobile communication is being widespread, mobile technologies will have important roles in the communication with the explosive growth of demanding for wireless portable devices. Among the mobile technologies, a great deal of interest has been taken in mobile ad hoc network (MANET), which is a collection of wireless mobile nodes forming a temporary network without the aid of stationary infrastructure in recent. Furthermore, considering characteristic of ad hoc networks, the design of efficient routing protocols is an important issue. In recent years, on-demand protocols among routing protocols have noticed because of the low routing overhead. However, on-demand protocols suffer from production of the enormous query Packets by broadcasting in order to setup routes, that is, a flooding scheme. The flooding scheme is very costly and results in serious problem, which we refer as the broadcast storm problem. In this paper, we propose a Dynamic Adaptation Query flooding Using Neighbor Topology (NT-DAQ) scheme, in order to resolve the broadcast storm Problem. When a route discovery is in progress, each mobile node decides on the basis of neighbor topology information whether discovery process participates or not. Therefore, our proposed scheme enables to improve network performance in which minimize the number of query rackets. We evaluate the efficiency of our proposed scheme through simulation.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.586-601
• /
• 2001

We propose a mesh based multicast routing protocol referred to as HMMRP for ad-hoc networks. In HMMRP, a limited number of sources are selected as core sources, and the rest of the sources of a multicast group are connected to one of those core sources. The sources and the receivers of a multicast group are also connected through per source trees. In HMMRP, the data delivery mesh of a multicast group are composed of the nodes on these paths, and are reconfigured at regular intervals. Furthermore, each mesh member that lies on the paths between the sources and the core sources as well as be-tween the core sources and the receivers keeps checking if there is a symptom of mesh separation around itself. When a mesh member finds such symptom, it tries to patch itself to the mesh with a local flooding. As a result, the part of the data delivery mesh on those paths are kept connected with a lot higher probability than the rest of the data delivery mesh. That is, for a certain source receiver pair, it is very likely that at least there exists a data delivery path that route from the source to a core source and then to the receiver. Therefore, HMMRP may provide very high data delivery ratio without frequent entire data delivery mesh reconfiguration even when the nodal mobility is high. Simulation results show that HMMRP shows relatively little performance degradation with respect to mobility. Furthermore, the performance degradation with respect to mobility is even smaller when the size of the multicast group becomes larger.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4912-4933
• /
• 2015

Information Centric Networking (ICN) has recently attracted great attention. It names the content decoupling from the location and introduces network caching, making the content to be cached anywhere within the network. The benefits of such design are obvious, however, many challenges still need to be solved. Among them, the local caching policy is widely discussed and it can be further divided into two parts, namely the cache permission policy and the cache replacement policy. The former is used to decide whether an incoming content should be cached while the latter is used to evict a cached content if required. The Internet is a user-oriented network and popular contents always have much more requests than unpopular ones. Caching such popular contents closer to the user's location can improve the network performance, and consequently, the local caching policy is required to identify popular contents. However, considering the line speed requirement of ICN routers, the local caching policy whose complexity is larger than O(1) cannot be applied. In terms of the replacement policy, Least Recently Used (LRU) is selected as the default one for ICN because of its low complexity, although its ability to identify the popular content is poor. Hence, the identification of popular contents should be completed by the cache permission policy. In this paper, a cache permission policy called Cache-Filter, whose complexity is O(1), is proposed, aiming to store popular contents closer to users. Cache-Filter takes the content popularity into account and achieves the goal through the collaboration of on-path nodes. Extensive simulations are conducted to evaluate the performance of Cache-Filter. Leave Copy Down (LCD), Move Copy Down (MCD), Betw, ProbCache, ProbCache⁺, Prob(p) and Probabilistic Caching with Secondary List (PCSL) are also implemented for comparison. The results show that Cache-Filter performs well. For example, in terms of the distance to access to contents, compared with Leave Copy Everywhere (LCE) used by Named Data Networking (NDN) as the permission policy, Cache-Filter saves over 17% number of hops.