• The KIPS Transactions:PartA
• /
• v.19A no.1
• /
• pp.51-60
• /
• 2012

IC(Integrated circuits)card, generally be named smard card, embedded MPU(Micro Processor Unit) of small-size, memory, EEPROM, Card Operating System(COS) and security algorithm. The IC card is used in almost all industry such as a finance(credit, bank, stock etc.), a traffic, a communication, a medical, a electronic passport, a membership management and etc. Recently, a application field of IC card is on the increase by method for payments of T-commerce, as T-commerce is becoming a new growth engine of the broadcating industry by trend of broadcasting and telecommunication convergence, smart mechanization of TV. For example, we can pay in IC credit card(or IC cash card) on T-Commerce. or we can be provided TV banking service in IC cash card such as ATM. However, so far, T-commerce payment services have weakness in security such as storage and disclosure of card information as well as dropping sharply about custom ease because of taking advantage of card information input method using remote control. To solve this problem, This paper developed processing payment module for implementing TV electronic payment system using IC credit card payment standard, EMV.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.151-164
• /
• 2009

The importance of sensor networks as a base of ubiquitous computing realization is being highlighted, and espicially the security is recognized as an important research isuue, because of their characteristics.Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop security Intrusion Detection System (IDS) that can survive malicious attacks from "insiders" who have access to keying materials or the full control of some nodes, taking their charateristics into consideration. In this perper, we design a distributed and adaptive IDS architecture on sensor networks, respecting both of energy efficiency and IDS efficiency. Utilizing a modified HEED algorithm, a clustering algorithm, distributed IDS nodes (dIDS) are selected according to node's residual energy and degree. Then the monitoring results of dIDSswith detection codes are transferred to dIDSs in next round, in order to perform consecutive and integrated IDS process and urgent report are sent through high priority messages. With the simulation we show that the superiorities of our architecture in the the efficiency, overhead, and detection capability view, in comparison with a recent existent research, adaptive IDS.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.2
• /
• pp.67-74
• /
• 2013

Approximate string matching problems have been studied in diverse fields. Recently, fast approximate string matching algorithms are being used to reduce the time and costs for the next generation sequencing. To measure the amounts of errors between two strings, we use a distance function such as the edit distance. Given two strings X(|X| = m) and Y(|Y| = n) over an alphabet ${\Sigma}$, the edit distance between X and Y is the minimum number of edit operations to convert X into Y. The edit distance between X and Y can be computed using the well-known dynamic programming technique in O(mn) time and space. The edit distance also can be computed using the Four-Russians' algorithm whose preprocessing step runs in $O((3{\mid}{\Sigma}{\mid})^{2t}t^2)$ time and $O((3{\mid}{\Sigma}{\mid})^{2t}t)$ space and the computation step runs in O(mn/t) time and O(mn) space where t represents the size of the block. In this paper, we present a parallelized version of the computation step of the Four-Russians' algorithm. Our algorithm computes the edit distance between X and Y in O(m+n) time using m/t threads. Then we implemented both the sequential version and our parallelized version of the Four-Russians' algorithm using CUDA to compare the execution times. When t = 1 and t = 2, our algorithm runs about 10 times and 3 times faster than the sequential algorithm, respectively.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.219-226
• /
• 2018

One of the systematic ways to generate the number of all cases is a combination to construct a combination tree, and its time complexity is O($2^n$). A combination tree is used for various purposes such as the graph homogeneity problem, the initial model for calculating frequent item sets, and so on. However, algorithms that must search the number of all cases of a combination are difficult to use realistically due to high time complexity. Nevertheless, as the amount of data becomes large and various studies are being carried out to utilize the data, the number of cases of searching all cases is increasing. Recently, as the GPU environment becomes popular and can be easily accessed, various attempts have been made to reduce time by parallelizing algorithms having high time complexity in a serial environment. Because the method of generating the number of all cases in combination is sequential and the size of sub-task is biased, it is not suitable for parallel implementation. The efficiency of parallel algorithms can be maximized when all threads have tasks with similar size. In this paper, we propose a method to efficiently collaborate between CPU and GPU to parallelize the problem of finding the number of all cases. In order to evaluate the performance of the proposed algorithm, we analyze the time complexity in the theoretical aspect, and compare the experimental time of the proposed algorithm with other algorithms in CPU and GPU environment. Experimental results show that the proposed CPU and GPU collaboration algorithm maintains a balance between the execution time of the CPU and GPU compared to the previous algorithms, and the execution time is improved remarkable as the number of elements increases.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.821-830
• /
• 2006

As internet worms are spread out worldwide, the detection and filtering of worms becomes one of hot issues in the internet security. As one of implementation methods to detect worms, the Linux Netfilter kernel module can be used. Its basic operation for worm detection is a string matching where coming packet(s) on the network is/are compared with predefined worm signatures(patterns). A worm can appear in a packet or in two (or more) succeeding packets where some part of worm is in the first packet and its remaining part is in its succeeding packet(s). Assuming that the maximum length of a worm pattern is less than 1024 bytes, we need to perform a string matching up to two succeeding packets of 2048 bytes. To do so, Linux Netfilter keeps the previous packet in buffer and performs matching with a combined 2048 byte string of the buffered packet and current packet. As the number of concurrent connections to be handled in the worm detection system increases, the total size of buffer (memory) increases and string matching speed becomes low In this paper, to reduce the memory buffer size and get higher speed of string matching, we propose a string matching scheme without using buffer. The proposed scheme keeps the partial matching result of the previous packet with signatures and has no buffering for previous packet. The partial matching information is used to detect a worm in the two succeeding packets. We implemented the proposed scheme by modifying the Linux Netfilter. Then we compared the modified Linux Netfilter module with the original Linux Netfilter module. Experimental results show that the proposed scheme has 25% lower memory usage and 54% higher speed compared to the original scheme.

• Journal of Sensor Science and Technology
• /
• v.17 no.5
• /
• pp.350-360
• /
• 2008

In every large hospital, nurses must perform simple repetitive tasks such as measuring body temperature. Such tedious work reduces nurses' motivation to provide quality medical care, which is an important element of the medical services provided by a hospital. If a device were available to measure body temperature, nurses could focus on the more important aspects of providing quality medical care to the patients. However, body temperature is generally measured from the throat, anus, tympanum or armpit, where it is difficult to affix a patch type device. In addition, general body temperature measuring points shows moving artifact error; therefore, it is not good point to continually measure the temperature. In this paper, a patch type skin temperature measuring system was developed. To appropriately measure the skin temperature, a thermal transducer was implemented with a thin (0.5 mm) temperature sensor. The system is small and thin ($H6.6{\sim}5.3{\times}L35{\times}W24\;mm$), and weighs only 5 g including a battery, case and circuit; therefore, it is small and light enough to function as a patch type device. Moreover, the system worked for 5 days. To investigate differences between the experimental and conventional thermometer, simple clinical experiments were performed with 17 volunteers, and the result showed some correlation between the implemented system and conventional thermometer (Correlation coefficient = 0.647, P<0.1).

• Journal of Energy Engineering
• /
• v.24 no.1
• /
• pp.97-103
• /
• 2015

Natural convection heat transfer rates in vertical pipes were measured varying the diameter, length, and roughness of vertical cylinder. To achieve high Rayleigh number with relatively small test rig, mass transfer experiments instead of heat transfer were performed based on the analogy. Prandtl number was 2,014. The length of vertical cylinder was 0.1m, 0.3m, and 0.5m, which correspond to GrL $4.2{\times}10^7$, $1.1{\times}10^9$, and $5.5{\times}10^9$. To each length of vertical cylinder, the heat transfer rates were measured varying the iameter 0.005m, 0.01m, and 0.03m. The heat transfer rate for a short length pipe(0.1m) agreed with the prediction from Le Fevre correlation developed for a vertical plate for all diameter. The heat transfer rate decreases as the diameter and the length of the pipe increases. The heat transfer rate inside of vertical cylinder is affected by roughness only for a laminar flow regime.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.46 no.9
• /
• pp.712-722
• /
• 2018

This paper conducts parametric studies on flapping wing design, one of the most important design parameters of insect-mimicking aerial vehicles. Experimental study on wing shape was done through comparison and analysis of thrust, pitching moment, power consumption, and thrust-to-power ratio. A two-axis balance and hall sensor measure force and moment, and flapping frequency, respectively. Wing configuration is biplane configuration which can develop clap and fling effect. A reference wing shape is a simplified dragonfly's wing and studies on aspect ratio and wing area were implemented. As a result, thrust, pitching moment, and power consumption tend to increase as aspect ratio and area increase. Also, it is found that the flapping mechanism was not normally operated when the main wing has an aspect ratio or area more than each certain value. Finally, the wing shape is determined by comparing thrust-to-power ratio of all wings satisfying the required minimum thrust. However, the stability is not secured due to moment generated by disaccord between thrust line and center of gravity. To cope with this, aerodynamic dampers are used at the top and bottom of the fuselage; then, indoor flight test was attempted for indirect performance verification of the parametric study of the main wing.

• Journal of Korea Technology Innovation Society
• /
• v.15 no.4
• /
• pp.881-915
• /
• 2012

These days, according as the role and function of science and technology become a important solving means of various national and social problems caused in knowledge information society as well as the development of national economy, the national target and mission of science and technology have been newly illuminated. The task of science and technology has embodied into national policies, and these policies acquired institutional foundation through the legal system related to science and technology. Recently, the discussions about the operating system of present science and technology legislation are often happened, if or not the legal system is optimal and appropriate itself under the changed environment. In special, some issues are raised continuously, for example, about the improvement of coordination system on S&T policies, and the governance system on national R&D programs, etc. This paper aims to research and suggest the reorganization method of science and technology law. For this purpose, the development and existing state of S&T legislation was investigated, the government role and policy driving direction were reviewed under the recent changed environment, and the problems of S&T law in structure and content were analyzed in variety of perspectives. On this basis, the reorganization methods of science and technology law are suggested.

• Journal of Korean Society for Geospatial Information Science
• /
• v.11 no.4 s.27
• /
• pp.35-43
• /
• 2003

Currently, the government has been driving numerous projects to build the e-government which can enable limitless access and utilization of the information through the accomplishment of the real time based various administrative services. In water resource field, a project to generate digital river thematic maps has been undergoing as a part of the computerization projects. As a partial results, the RIMGIS project has been completed and generation of the various river thematic maps has been required to fully utilize the DB built from RIMGIS project. For the effective generation of the thematic maps, a data model needs to be developed. A data model has been developed in this study to provide more efficient method to generate the thematic maps utilizing existing DB. The data model proposed from this study has defined the relationships between core feature data and framework Data along with relationships among data elements to represent the rivers in the real world more accurately. The core feature data and framework layers have been defined based on the survey of the domestic and foreign case studies along with requirement analysis of the users in the water resource field. The proposed core feature data has been defined based on the minimum unit of 'class', and the relationship between classes has been established based on the ArcGIS Hydro Data Model for the integrated processing of the river information. The proposed spatial data model can be judged to contribute establishing more efficient generation methodology of the river thematic maps.