• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.11
• /
• pp.2039-2044
• /
• 2008

The problem of an efficient hardware implementation of multiple constant multiplication is frequently encountered in many digital signal processing applications such as FIR filter and linear transform (e.g., DCT and FFT). It is known that efficient solutions based on common subexpression elimination (CSE) algorithm can yield significant improvements with respect to the area and power consumption. In this paper, we present an efficient specialized adder design method for two common subexpressions ($10{\bar{1}}$, 101) in canonic signed digit (CSD) coefficients. By Synopsys simulations of a radix-24 FFT example, it is shown that the proposed method leads to about 21%, 11% and 12% reduction in the area, propagation delay time and power consumption compared with the conventional methods, respectively.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.11
• /
• pp.705-710
• /
• 2017

This paper proposes an estimation method of populations of Grapholita molestas using object segmentation and an SVM classifier in the moth images. Object segmentation and moth classification were performed on images of Grapholita molestas moth acquired on a pheromone trap equipped in an orchard. Object segmentation consisted of pre-processing, thresholding, morphological filtering, and object labeling process. The classification of Grapholita molestas in the moth images consisted of the training and classification of an SVM classifier and estimation of the moth populations. The object segmentation simplifies the moth classification process by segmenting the individual objects before passing an input image to the SVM classifier. The image blocks were extracted around the center point and principle axis of the segmented objects, and fed into the SVM classifier. In the experiments, the proposed method performed an estimation of the moth populations for 10 moth images and achieved an average estimation precision rate of 97%. Therefore, it showed an effective monitoring method of populations of Grapholita molestas in the orchard. In addition, the mean processing time of the proposed method and sliding window technique were 2.4 seconds and 5.7 seconds, respectively. Therefore, the proposed method has a 2.4 times faster processing time than the latter technique.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.7
• /
• pp.625-635
• /
• 2008

Portable multimedia players have some different properties compared to general multimedia file server. Some of those properties are single user ownership, relatively low hardware performance, I/O burst by user special functions, and short software development cycles. Though suitable for processing multiple user requests at a time, the general multimedia file systems are not efficient for special user functions such as fast forwards/backwards. Soml' methods has been proposed to improve the performance and functionality, which the application programs give prediction hints to the file system. Unfortunately, they require the modification of all applications and recompilation. In this paper, we present a file system that efficiently supports user special functions in embedded multimedia systems using file block allocation, buffer-cache, and prefetch. A prefetch algorithm, SPRA (SPeed-based PRefetch Algorithm) predicts the next block using I/O patterns instead of hints from applications and it is resident in the file system, so doesn't affect application development process. From the experimental file system implementation and comparison with Linux readahead-based algorithms, the proposed system shows $4.29%{\sim}52.63%$ turnaround time and 1.01 to 3,09 times throughput in average.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.1
• /
• pp.1-7
• /
• 2010

PAPR of the pilot symbols can be reduced down by the CAZAC sequence in the SC-FDMA communication system. However, it is very complicated and takes quite a long time to compute the interpolation between the OFDM information symbols for the channel estimation because the pilot data are trasmitted in the block type. Furthermore, situation will be much more serious in the severe fading channel. Actually the pilot insertion of the comb type is much efficient and convenient for the channel estimation since the calculation of the interpolation can be made in the frequency domain symbol by symbol. But, the PAPR will be regrown when the pilot data are inserted with the information data in the comb type. So, in this paper, we like to study the PAPR reduction and comb type pilot assignment for the efficient channel estimation. Unlike the conventional SLM(selected mapping) method requiring the side information, our improved SLM method is to use the phase rotation sequence into information data without rotating phase of pilot. We use different pilot data according to the different phase rotation sequence. From the simulation result, it can be confirmed that when SLM method of 4 phase rotation sequence is used, PAPR is almost same to the block type method without pilot.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.274-276
• /
• 2006

e-seal은 RFID(Radio Frequency IDentification) 기술을 사용하여 원격에서 자동으로 봉인상태를 확인할 수 있는 컨테이너 봉인 장치를 말한다. RFID의 특징상 반도체 칩에 기록된 정보를 제 삼자가 쉽게 판독 및 변조할 수 있다는 취약점으로 인하여 활성화되지 못하고 있는 실정이다. ISO에서는 RFID의 취약점을 보안하기 위한 표준작업(ISO 18185)을 진행 중이다. 이 중, ISO 18185-4는 e-seal에 저장되는 자료나 리더와의 RF통신에서 데이터 보호를 위한 표준이다. 이와 관련된 연구로는 인증 프로토콜과 ISO 18185-4를 위한 보고서로 제출된 보안 프로토콜이 있다. 제안된 e-seal 보안 프로토콜을 적용하기 위해서는 e-seal과 리더 간의 데이터를 암/복호화할 키가 필요하지만, 키 서버를 통해 전달받은 마스터 키를 데이터 암/복호화 키로 바로 사용하는 것은 보안 상의 문제점을 야기할 수 있기 때문에 PRF(Pseudo Random Function)을 이용하여 마스터 키로부터 MTK(Mutual Transient Key)를 유도하고, MTK를 암/복호화 키로 사용해야 한다. 기존의 PRF는 일방향 해시 함수(MD5, SHA 등)를 기반으로 하는 HMAC[2. 3]을 일반적으로 사용하였다. 그러나 일방향 해시 함수는 e-seal과 같은 제한된 자원을 갖는 환경에 적합하지 않다. 따라서, 본 논문에서는 e-seal 보안 프로토콜을 위한 효율적인 PRF을 제안한다. 기존의 일방향 해시 함수 기반이 아닌 블록 암호화 알고리즘을 기반으로 하는 MAC을 이용하여 PRF을 보다 효율적으로 구현하였고, 블록 암호화 알고리즘은 AES를 선택 합성체 $GF((2^4)^2)$을 통해 하드웨어 모듈을 최적화 하였다. AES를 기반으로 하는 MAC은 HMAC에 비해 면적 및 처리율에서 뛰어난 결과를 보여주었다.<0.01).이상의 연구 결과, cook-chill생산 시 녹차 추출물의 첨가가 미생물적 품질유지에 효과가 있다고 사료되는 바 본 연구결과를 기초로 급식소에서 음식 생산 시 녹차 추출물 및 천연 항균성 물질 첨가에 따른 미생물적 품질 및 관능적 품질검사를 통한 레시피 개발에 관한 지속적인 연구가 수행되어야 하겠다.다.다리다보니 점심시간을 활용할 수 없게 되는 문제점에 대한 재검토가 필요하다. 따라서 차후 학교급식의 안전성 확보를 위한 급식환경 개선의 일환으로 식당공간 확보 시 신속한 시간 내에 급식이 가능하도록 넓은 공간과 쾌적한 환경의 식당 조성에 대해 관심을 기울여야 할 것으로 사료된다. 이상 여부를 반영하는 임상증상의 빈도가 높은 청소년기 남녀 중학생의 경우 아침과 저녁의 결식빈도 및 외식과 간식의 빈도가 높았고, 아침식사의 질과 체형만족도가 낮은 것으로 나타나 청소년의 건강과 식습관 및 체형만족도가 상호 관련성이 높은 것으로 나타났다. 따라서 본 연구 결과는 성장기 청소년의 건강 유지를 위하여 바람직한 식습관의 중요성을 재인식할 수 있었으며, 올바른 식습관 확립을 위한 영양교육의 중요성이 재확인되었다.경제적일 것으로 판단된다.er 90 % of good relative dynamic modulus of elasticity due to fineness of formation caused by the increase of the unit powder content and the improvement of flowability, without regard to the replacement of crushed stone fines. Therefore, it can be said that the usage of crushed stone fines can control the strength of super flowing concrete by replacement and re

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.47-57
• /
• 2003

In this paper, we firstly evaluate the resistance of the reduced 5-round version of the block cipher CIKS-1 against linear cryptanalysis(LC) and show that we can attack full-round CIKS-1 with \ulcorner56-bit key through the canonical extension of our attack. A feature of the CIKS-1 is the use of both Data-Dependent permutations(DDP) and internal key scheduling which consist in data dependent transformation of the round subkeys. Taking into accout the structure of CIKS-1 we investigate linear approximation. That is, we consider 16 linear approximations with p=3/4 for 16 parallel modulo $2^2$ additions to construct one-round linear approximation and derive one-round linear approximation with the probability P=1/2+$2^{-17}$ by Piling-up lemma. Then we present 3-round linear approximation with 1/2+$2^{-17}$ using this one-round approximation and attack the reduced 5-round CIKS-1 with 64-bit block by LC. In conclusion we present that our attack requires $2^{38}$chosen plaintexts with a probability of success of 99.9% and about $2^{67-7}$encryption times to recover the last round key.(But, for the full-round CIKS-1, our attack requires about $2^{166}$encryption times)

• Journal of Korea Water Resources Association
• /
• v.56 no.spc1
• /
• pp.1059-1069
• /
• 2023

Dam-break flow occurs when an elevated dam suddenly collapses, resulting in the catastrophic release of rapid and uncontrolled impounded water. This study compares laminar and turbulent closure models for simulating three-dimensional dam-break flows using OpenFOAM. The Reynolds-Averaged Navier-Stokes (RANS) model, specifically the k-ε model, is employed to capture turbulent dissipation. Two scenarios are evaluated based on a laboratory experiment and a modified multi-layered block obstacle scenario. Both models effectively represent dam-break flows, with the turbulent closure model reducing oscillations. However, excessive dissipation in turbulent models can underestimate water surface profiles. Improving numerical schemes and grid resolution enhances flow recreation, particularly near structures and during turbulence. Model stability is more significantly influenced by numerical schemes and grid refinement than the use of turbulence closure. The k-ε model's reliance on time-averaging processes poses challenges in representing dam-break profiles with pronounced discontinuities and unsteadiness. While simulating turbulence models requires extensive computational efforts, the performance improvement compared to laminar models is marginal. To achieve better representation, more advanced turbulence models like Large Eddy Simulation (LES) and Direct Numerical Simulation (DNS) are recommended, necessitating small spatial and time scales. This research provides insights into the applicability of different modeling approaches for simulating dam-break flows, emphasizing the importance of accurate representation near structures and during turbulence.

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

Traditional technologies that are used to improve the performance of hard disk drives show many negative cases if they are applied to solid state drives (SSD). Access time and block sequence in hard disk drives that consist of mechanical components are very important performance factors. Meanwhile, SSD provides superior random read performance that is not affected by block address sequence due to the characteristics of flash memory. Practically, it is recommended to disable prefetching if a SSD is installed in a personal computer. However, this paper presents a combinational method of a prefetching scheme and a memory management that consider the internal structure of SSD and the characteristics of NAND flash memory. It is important that SSD must concurrently operate multiple flash memory chips. The I/O unit size of NAND flash memory tends to increase and it exceeded the block size of operating systems. Hence, the proposed prefetching scheme performs in an operating unit of SSD. To complement a weak point of the prefetching scheme, the proposed memory management scheme adaptively evicts uselessly prefetched data to maximize the sum of cache hit rate and prefetch hit rate. We implemented the proposed schemes as a Linux kernel module and evaluated them using a commercial SSD. The schemes improved the I/O performance up to 26% in a given experiment.

• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.797-806
• /
• 2005

The objective of the In-h(High Level Architecture) have recommended by DoD(Department of Defense) is to facilitate interoperability among simulations and to promote reuse of their components. There are many legacy simulation softwares developed before the HLA becomes simulation standard. The integration of legacy simulations into federations using the HLA is an important research topic in M&S(Modeling and Simulation) area. Legacy simulation softwares of the mission critical industry such as nuclear and aerospace are generally use Fortran language. However, the reuse of those is not easy because the HLA is not support Fortran language. This paper suggests a integration method which minimizes the modification of legacy simulation software and migrates the legacy simulation software to HLA federation. Each federate participating in federation have the separated executables that communicate via a shared memory created at run-time. Two types of shared memory blocks are used for publication and subscription. Declaration block for global variables used in legacy simulation software is separated for publication and subscription and then mapped as classes of objects and interactions for the HLA FOM design. To validate the suggested method, we approached the HLA integration of legacy nuclear simulation code being used in plant design and to observe the integration results, we used the FMT(Federation Management Tool). The diagnostic information which the FTM displays showed that our method can be successfully and effectively used for a HLA federation.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.11-18
• /
• 2000

In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.