• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.5
• /
• pp.107-112
• /
• 2020

Ultra-lightweight password CHAM is an algorithm with efficient addition, rotation and XOR operations on resource constrained devices. CHAM shows high computational performance, especially on IoT platforms. However, lightweight block encryption algorithms used on the Internet of Things may be vulnerable to side channel analysis. In this paper, we demonstrate the vulnerability to side channel attack by attempting a first power analysis attack against CHAM. In addition, a safe algorithm was proposed and implemented by applying a masking technique to safely defend the attack. This implementation implements an efficient and secure CHAM block cipher using the instruction set of an 8-bit AVR processor.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1195-1206
• /
• 2015

For the management of a knowledge system, systems that automatically infer and manage scalable knowledge are required. Most of these systems use ontologies in order to exchange knowledge between machines and infer new knowledge. Therefore, approaches are needed that infer new knowledge for scalable ontology. In this paper, we propose an approach to perform rule based reasoning for scalable SHIF ontologies in a spark framework which works similarly to MapReduce in distributed memories on a cluster. For performing efficient reasoning in distributed memories, we focus on three areas. First, we define a data structure for splitting scalable ontology triples into small sets according to each reasoning rule and loading these triple sets in distributed memories. Second, a rule execution order and iteration conditions based on dependencies and correlations among the SHIF rules are defined. Finally, we explain the operations that are adapted to execute the rules, and these operations are based on reasoning algorithms. In order to evaluate the suggested methods in this paper, we perform an experiment with WebPie, which is a representative ontology reasoner based on a cluster using the LUBM set, which is formal data used to evaluate ontology inference and search speed. Consequently, the proposed approach shows that the throughput is improved by 28,400% (157k/sec) from WebPie(553/sec) with LUBM.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1225-1230
• /
• 2015

MAC protocol for WBAN performs CSMA/CA(:Carrier Sense Multiple Access with Collision Avoidance)algorithm that handles traffic which occurs in emergency with top priority in order to deal with variable data of sensor node for medicine. Emergency message that node sends undergoes collision and delay of transmission by retransmission of emergency message and waste of energy by retransmission. This paper suggests algorithm that minimizes loss of frame caused by collision and applies different backoff parameters by setting order of priority between MAC instruction frame and data frame in CSMA/CA algorithm case which applies order of priority queuing to improve aforementioned problem. According to performance evaluation, it has been found that using suggested MAC protocol showed lower collision probability, higher packet transmission processing ratio and lower packet loss compared with using IEEE 802.15.6.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.443-452
• /
• 2009

Although 32-bit architectures are becoming the norm for modern microprocessors, 16-bit ones are still employed by many low-end processors, for which small size and low power consumption are of high priority. However, 16-bit architectures have a critical disadvantage for embedded processors that they do not provide enough encoding space to add special instructions coined for certain applications. To overcome this, many existing architectures adopt non-orthogonal, irregular instruction sets to accommodate a variety of unusual addressing modes. In general, these non-orthogonal architectures are regarded compiler-unfriendly as they tend to requires extremely sophisticated compiler techniques for optimal code generation. To address this issue, we proposed a compiler-friendly processor with a new addressing mode, called the dynamic implied addressing mode(DIAM). In this paper, we will demonstrate that the DIAM provides more encoding space for our 16-bit processor so that we are able to support more instructions specially customized for our applications. And we will explain the advanced architecture which has improved performance. In our experiment, the proposed architecture shows 11.6% performance increase on average, as compared to the basic architecture.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.540-543
• /
• 2007

최근의 그리드 컴퓨팅 시스템 환경은 단일 환경에서 작게는 2~4CPU, 많게는 수백 CPU 이상의 시스템으로 구축되고 있고, 더욱이 지역적으로도 멀리 떨어져 있다. 따라서 이를 운용하는 기업에서는 시스템의 사용 현황을 신속하게 분석할 필요가 있다. 그러나 이렇게 혼재된 이 기종 및 컴퓨팅 환경하에서의 각 지역별 시스템 사용현황을 효과적으로 분석 한다는 것은 매우 어려운 일이다. 기존에 사용되어 온 그리드 컴퓨팅 시스템 환경에서의 사용율 관리 방법들은 Queueing 시스템이 가지고 있는 Accounting 분석 명령어로 text 형태의 Accounting raw data 의 결과를 추출하여 가공 처리하므로 데이터 증가 시 반응 속도가 현격하게 느려지는 상황이 발생한다. 또한 원격지 그리드 컴퓨팅 시스템 군의 사용율 분석은 데이터 분석 시 매번 원격지접근 절차를 사용하여 그리드 컴퓨팅 시스템 군에 접근한 후 해당 로컬 시스템 분석을 해야 하고 각 원격지시스템군별로 추출 된 데이터를 통합 관리해야 하는 문제점을 가지고 있다. 따라서 이러한 문제점을 해결하고자 하는 것이 본 논문에서 제안하는 3-tier 구조의 GSA(Grid System Account)이다. 제안한 GSA 는 각 원격지 별 데이터를 객체화하여 Database 에 저장 함으로써 데이터 분석 시 효과적으로 처리할 수 있으며, 다수의 원격지 그리드 컴퓨팅 시스템 군에 대한 복합적인 분석이 필요할 때 효율적으로 대처할 수 있다. 본 논문에서는 GSA 의 설계방법을 제안하고 구현하여 실 성능을 시험함으로써 보다 효율적인 그리드 컴퓨팅 시스템의 사용율 분석 관리가 가능함을 보였다.포는 감수성을 보이지 않았다. 따라서 위의 결과로부터 SLT-I에 감수성을 보이지 않은 Raw264.7세포를 대상으로 Gb3 발현 정도와 SLT-I의 세포독성의 관계를 규명하고자 Gb3의 발현을 증가시킨 후 SLT-I의 세포독성을 재차 평가하였다. 이 결과 $TNF-{\alpha}$의 처리에 의하여 6 hrs에 Gb3의 발현이 정점(43.5%)에 이르렀으며 36 hrs에 정상 수준(25.0%)으로 환원되었다. 그러나, Gb3의 발현이 증가함에도 불구하고 SLT-I의 세포독성에는 변화가 관찰되지 않았다. 따라서, SLT-I에 의한 세포독성은 세포의 종류에 따라서 다르며 또한, Gb3의 발현정도에만 의존적이지는 않을 것으로 생각된다. 이와 같은 결과는 E. coli 0157의 감염증 병인 연구에 있어 SLT-I과 Gb3의 발현의 상관관계에 대한 보다 심도 있는 연구가 필요함을 시사한다.만 분할률, 배반포 형성률 및 배반포의 세포수를 증가시키는 것으로 사료된다.수의 유출입 지점에 온도센서를 부착하여 냉각수의 온도를 측정하고 냉각수의 공급량과 대기의 온도 등을 측정하여 대사열의 발생을 추정할 수 있었다. 동시에 이를 이용하여 유가배양시 기질을 공급하는 공정변수로 사용하였다 [8]. 생물학적인 폐수처리장치인 활성 슬러지법에서 미생물의 활성을 측정하는 방법은 아직 그다지 개발되어있지 않다. 본 연구에서는 슬러지의 주 구성원이 미생물인 점에 착안하여 침전시 슬러지층과 상등액의 온도차를 측정하여 대사열량의 발생량을 측정하고 슬러지의 활성을 측정할 수 있는 방법을 개발하였다.enin과 Rhaponticin의 작용(作用)에 의(依)한 것이며, 이

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.1-12
• /
• 2014

This paper implements and improves the performance of high computational subtractive clustering algorithm using a single instruction, multiple data (SIMD) based many-core processor. In addition, this paper implements five different processing element (PE) architectures (PEs=16, 64, 256, 1,024, 4,096) to select an optimal PE architecture for the subtractive clustering algorithm by estimating execution time and energy efficiency. Experimental results using two different medical images and three different resolutions ($128{\times}128$, $256{\times}256$, $512{\times}512$) show that PEs=4,096 achieves the highest performance and energy efficiency for all the cases.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.12
• /
• pp.429-436
• /
• 2022

Temporary files are generated when the Hash Join is performed on tables larger than the memory. During the join process, each temporary file is deleted sequentially after it completes the I/O operations. This paper reveals for that the fallocate system call and file deletion-related trim options significantly impact the hash join performance when temporary files are managed on SSDs rather than hard disks. The experiment was conducted on various commercial and research SSDs using PostgreSQL, a representative open-source database. We find that it is possible to improve the join performance up to 3 to 5 times compared to the default combination depending on whether fallocate and trim options are used for temporary files. In addition, we investigate the write amplification and trim command overhead in the SSD according to the combination of the two options for temporary files.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.3
• /
• pp.339-349
• /
• 2017

This paper proposes a four-stage algorithm for detecting lanes on a driving car. In the first stage, it extracts region of interests in an image. In the second stage, it employs a median filter to remove noise. In the third stage, a binary algorithm is used to classify two classes of backgrond and foreground of an input image. Finally, an image erosion algorithm is utilized to obtain clear lanes by removing noises and edges remained after the binary process. However, the proposed lane detection algorithm requires high computational time. To address this issue, this paper presents a parallel implementation of a real-time line detection algorithm on a multi-core architecture. In addition, we implement and simulate 8 different processing element (PE) architectures to select an optimal PE architecture for the target application. Experimental results indicate that 40×40 PE architecture show the best performance, energy efficiency and area efficiency.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.3
• /
• pp.51-56
• /
• 2000

Is this paper, we studied on the automatic speech control system in real-time windows environment using voice recognition. The applied reference pattern is the variable DMS model which is proposed to fasten execution speed and the one-stage DP algorithm using this model is used for recognition algorithm. The recognition vocabulary set is composed of control command words which are frequently used in windows environment. In this paper, an automatic speech period detection algorithm which is for on-line voice processing in windows environment is implemented. The variable DMS model which applies variable number of section in consideration of duration of the input signal is proposed. Sometimes, unnecessary recognition target word are generated. therefore model is reconstructed in on-line to handle this efficiently. The Perceptual Linear Predictive analysis method which generate feature vector from extracted feature of voice is applied. According to the experiment result, but recognition speech is fastened in the proposed model because of small loud of calculation. The multi-speaker-independent recognition rate and the multi-speaker-dependent recognition rate is 99.08% and 99.39% respectively. In the noisy environment the recognition rate is 96.25%.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.3 no.1
• /
• pp.57-72
• /
• 2008

Serve and do so that graft together specialists' view application field of computer and developmental disability diagnosis estimation data to construct developmental disability diagnosis estimation system in this Paper and constructed developmental disability diagnosis estimation system. Developmental disability diagnosis estimation must supply information of specification area that specialists are having continuously. Developmental disability diagnosis estimation specialist system need multimedia data processing that is specialized little more for developmental disability classification diagnosis and decision-making and is atomized for this. Characteristic of developmental disability diagnosis estimation system that study in this paper can supply quick feedback about result, and can reduce mistake on recording and calculation as well as can shorten examination's enforcement time, and background of training is efficient system fairly in terms of nonprofessional who is not many can use easily. But, as well as when multimedia information that is essential data of system construction for developmental disability diagnosis estimation is having various kinds attribute and a person must achieve description about all developmental disability diagnosis estimation informations, great amount of work done is accompanied, technology about equal data can become different according to management. Because of these problems, applied search technology of contents base (Content-based) that search connection information by contents of edit target data for developmental disability diagnosis estimation data processing multimedia data processing technical development. In the meantime, typical access way for conversation style data processing to support fast image search, after draw special quality of data by N-dimension vector, store to database regarding this as value of N dimension and used data structure of Tree techniques to use index structure that search relevant data based on this costs. But, these are not coincided correctly in purpose of developmental disability diagnosis estimation because is developed focusing in application field that use data of low dimension such as original space DataBase or geography information system. Therefore, studied save structure and index mechanism of new way that support fast search to search bulky good physician data.