• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.118-126
• /
• 1996

Memory hierarchy is a useful mechanism for improving the memory access speed and making the program space larger by layering the memories and separating program spaces from memory spaces. However, it needs at least two memory accesses for each data reference : a TLB(Translation Lookaside Buffer) access for the address translation and a data cache access for the desired data. If the cache size increases to the multiplication of page size and the cache associativity, it is difficult to access the TLB with the cache in parallel, thereby making longer the critical timing path in the processor. To achieve such parallel accesses, we present the hybrid mapped TLB which combines a direct mapped TLB with a very small fully-associative mapped TLB. The former can reduce the TLB access time. while the latter removes the conflict misses from the former. The trace-driven simulation shows that under given workloads the proposed TLB is effective even when a fully-associative mapped TLB with only four entries is added because the effects of its increased misses are offset by its speed benefits.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.83-90
• /
• 2018

In this paper, we propose an algorithm for analyzing personal health log information in android environment, providing personal health log information in android environment, providing personalized exercise information and monitoring the condition of pedestrians. Personal health log data collection is performed based on raw data of user using MPU6050 sensor based on Arduino. Noise was removed and age threshold was applied to distinguish movement information. In addition, to protect personal information, safety is enhanced by providing anti-compilation prevention and encryption/decryption of APK file, and the result of movement information collection is measured according to sensor location. Experimental results showed that the MPU6050 sensor mounted one the ankle wsa measured 98.97% more accurately then the wrist. In addition, the loading time of SEED 128 bit encryption based DEX file has the average time of 0.55ms, minimizing the overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.822-828
• /
• 2002

Optical flow estimation based on multi constraint approaches is frequently used for recognition of moving objects. However, the use have been confined because of OF estimation time as well as error problem. This paper shows a new method form effectively extracting movement information using the multi-constraint base approaches with sobel edge detection. The moving objects anr extraced in the input image sequence using edge detection and segmentation. Edge detection and difference of the two input image sequence gives us the moving objects in the images. The process of thresholding removes the moving objects detected due to noise. After thresholding the real moving objects, we applied the Combinatorial Hough Transform (CHT) and voting accumulation to find the optimal constraint lines for optical flow estimation. The moving objects found in the two consecutive images by using edge detection and segmentation greatly reduces the time for comutation of CHT. The voting based CHT avoids the errors associated with least squares methods. Calculation of a large number of points along the constraint line is also avoided by using the transformed slope-intercept parameter domain. The simulation results show that the proposed method is very effective for extracting optical flow vectors and hence recognizing moving objects in the images.

• Journal of Korean Society of Environmental Engineers
• /
• v.27 no.7
• /
• pp.746-752
• /
• 2005

In this study, the effect of reaction parameters including reaction temperature, time, and pressure on sludge degradation and conversion to intermediates such as organic acids were investigated at low critical wet air oxidation(LC-WAO) conditions. Degradation pathways and a modified kinetic model in LC-WAO were proposed and the kinetics model predictions were compared with experimental data under various conditions. Results in the batch experiments showed that reaction temperature directly affected the thermal hydrolysis reaction rather than oxidation reaction. The efficiencies of sludge degradation and organic acid formation increased with the increase of the reaction temperature and time. The removal of SS at $180^{\circ}C$, $200^{\circ}C$, $220^{\circ}C$ and $240^{\circ}C$ of reaction temperatures and 10 min of reaction time were 52.6%, 68.3%, 72.6%, and 74.4%, respectively, indicating that most organic suspended solids were liquified at early stage of reaction. At $180^{\circ}C$, $200^{\circ}C$, $220^{\circ}C$ and $240^{\circ}C$ of reaction temperatures and 40 min of reaction time, the amounts of organic acids formed from 1 g of sludge were 93.5 mg/g SS, 116.4 mg/g SS, 113.6 mg/g SS, and 123.8 mg/g SS, respectively, and the amounts of acetic acid from 1 g of sludge were 24.5 mg/g SS, 65.5 mg/g SS, 88.1 mg/g SS, and 121.5 mg/g SS, respectively. This suggested that the formation of sludge to organic acids as well as the conversion of organic acids to acetic acid increased with reaction temperature. Based on the experimental results, a modified kinetic model was suggested for the liquefaction reaction of sludge and the formation of organic acids. The kinetic model predicted an increase in kinetic parameters $k_1$ (liquefaction of organic compounds), $k_2$ (formation of organic acids to intermediate), $k_3$ (final degradation of intermediate), and $k_4$ (final degradation of organic acids) with reaction temperature. This indicated that the liquefaction of organic solid materials and the formation of organic acids increase according to reaction temperature. The calculated activation energy for reaction kinetic constants were 20.7 kJ/mol, 12.3 kJ/mol, 28.4 kJ/mol, and 54.4 kJ/mol, respectively, leading to a conclusion that not thermal hydrolysis but oxidation reaction is the rate-limiting step.

• Proceedings of the International Union of Geodesy And Geophysics Korea Journal of Geophysical Research Conference
• /
• 2003.05a
• /
• pp.17-17
• /
• 2003

한반도에 있어서의 지진의 영향을 분석하기 위해서는 강지진동 연구가 필수적이다. 강지진동 자료가 부족한 한반도의 특성상 모사를 통해 연구하고 있다. 강지진동 분석을 하기 위해서는 되도록 노이즈가 포함되어 있지 않은 지진파자료를 선택하여 그 지진자료의 스펙트럼 분석을 통해 감쇠상수 k, Q 등을 구한다. 이러한 감쇠상수 값을 통해 한반도의 진동 특성을 이해할 수 있다. 그러나 감쇠상수를 구하는 과정에서 감쇠상수 분석에 사용된 지진자료에 노이즈가 더해졌을 경우, 어떤 형태로 스펙트럼 영역에 영향을 미치고, 감쇠상수에는 어떤 영향을 미치는 지를 연구하여 노이즈효과를 제거할 수 있는 최적화된 분석에 관한 연구가 선행되어야 한다고 본다. 따라서 이번 연구에서는 강지진동 모사프로그램을 가지고 노이즈효과를 적용하면서 감쇠상수에 노이즈가 어떤 영향을 미치는 지에 대한 수치 해석적 연구를 실시하였다. 합성지진파에 이 합성지진파와 전혀 다른 주파수 형태를 보이는 노이즈를 강도를 달리하면서 합성해 본 결과, 노이즈효과를 고려할 수 있는 몇 가지 요소가 있음을 알 수 있었다. 감쇠상수 k값을 강지진동 모사프로그램으로부터 값을 달리하며 합성해 본 결과 노이즈효과를 보이는 것을 알 수 있었으며, 감쇠상수 k를 선형회귀를 통해 $k_{s}$ 와 $k_{q}$를 구할 때의 적용 주파수 범위를 변화시켰을 때도 일정한 양상의 노이즈 효과를 보였다. 또 지진자료와 노이즈를 중첩시킨 지진파 시계열 자료의 정부분만을 감쇠상수 k를 구하는 선형회귀에 이용했을 경우에도 노이즈 효과를 보였다. 또한 계산되어 나온 감쇠상수 값으로부터 특정지역의 지반운동의 특성을 이해할 수 있는 스펙트럼 가속도, 최대 가속도, 및 최대속도 값에 따른 감쇠식을 구하였다. 이것을 한반도와 같은 판 내부 환경인 ENA 값과 비교하였으며 기존의 연구와도 비교하였다.심으로부터 지오이드까지의 거리, 지오이드로부터 지표까지의 거리를 정의해주었으며, 각 격자점의 수직구조를 정의하기 위해 깊이에 따른 각 매질의 밀도, P파의 속도, S파의 속도, P파에 대한 Q값, S파에 대한 Q값을 정의 해주었다. S파의 속도를 구하기 위해서 지구 내부 물질을 포아송 매질이라는 가정 하에, 관계식을 $Vp{\;}={\;}SQRT(3){\;}{\times}{\;}Vs$ 이용하였다. 획득한 모델치들을 이용해 동해와 동해 인근 지역에 대한 초기모델을 구축하였다. 약 1 × 10/sup 6/ e/sup -//sec·n㎡ 의 전자선량에 해당되며 이를 기준으로 각각의 illumination angle에 대한 임계전자선량을 평가할 수 있었다. 실질적으로 Cibbsite와 같은 무기수화물의 직접가열실험 시 전자빔 조사에 의해 야기되는 상전이 영향을 배제하고 실험을 수행하려면 illumination angle 0.2mrad (Dose rate : 8000 e/sup -//sec·n㎡)이하로 관찰하고 기록되어야 함을 본 자료로부터 알 수 있었다.운동횟수에 의한 영향으로써 운동시간을 1일 6시간으로 설정하여, 운동횟수를 결정하기 위하여 오전, 오후에 각 3시간씩 운동시키는 방법과 오전부터 6시간동안 운동시키는 두 방법을 이용하여 품질을 비교하였다. 각 조건에 따라 운동시킨 참돔의 수분함량을 나타낸 것으로, 2회(오전 3시간, 오후 3시간)에 나누어서 운동시키기 위한 육의 수분함량은 73.37±2.02%를 나타냈으며, 1회(6시간 운동)운동시키기 위한 육은 71.74±1.66%을 나타내었다. 각각의 운동조건에서 양식된 참돔은 사육초기에는 큰 변화가 없었으나, 사육 5일 이후에는 수분함량이 증가하여 15일에는 76.40±0.14, 75.62±0.98%의 수분함량을 2회와 1회 운동시킨 참돔의 육에서 각각 나타났다. 운동횟수에 따른 지

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.3
• /
• pp.221-229
• /
• 2013

In this paper, the image formation by the motion compensation technique for Synthetic Aperture Radar system(SAR) were realized through the computer simulation. The motion compensation technique performed image data with the range compression, the compensation procedure, the azimuth compensation and the noise elimination procedure. The range compression procedure transform the SAR raw data into the frequency domain and correlate with the range reference function and then inversely transform into the time domain. The compensation procedure contain the aircraft fluctuations compensation and the radar image degrading effect elimination procedure which was caused by image formation algorithm itself. The aircraft fluctuations compensation procedure perform the first stage which correct the phase angle and the second stage which calculate the Doppler frequency and determine the coordinate of the received signal. The radar image degrading effect elimination procedure also perform range migration compensation and the image defocussing effect compensation. The azimuth compression procedure transform the compensation data to the frequency domain and correlate with the azimuth reference function. The azimuth correlated data are inversely transformed to the time domain which is called SAR image data. When the above procedure were completed, the image data contains the received signals mixed with noise. The threshold technique was applied to elimination the noise from the mixed image data.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.4
• /
• pp.33-41
• /
• 2006

RSA cryptosystem is of great use in systems such as IC card, mobile system, WPKI, electronic cash, SET, SSL and so on. RSA is performed through modular exponentiation. It is well known that the Montgomery multiplier is efficient in general. The critical path delay of the Montgomery multiplier depends on an addition of three operands, the problem that is taken over carry-propagation makes big influence at an efficiency of Montgomery Multiplier. Recently, the use of the Carry Save Adder(CSA) which has no carry propagation has worked McIvor et al. proposed a couple of Montgomery multiplication for an ideal exponentiation, the one and the other are made of 3 steps and 2 steps of CSA respectively. The latter one is more efficient than the first one in terms of the time complexity. In this paper, for faster operation than the latter one we use binary signed-digit(SD) number system which has no carry-propagation. We propose a new redundant binary adder(RBA) that performs the addition between two binary SD numbers and apply to Montgomery multiplier. Instead of the binary SD addition rule using in existing RBAs, we propose a new addition rule. And, we construct and simulate to the proposed adder using gates provided from SAMSUNG STD130 $0.18{\mu}m$ 1.8V CMOS Standard Cell Library. The result is faster by a minimum 12.46% in terms of the time complexity than McIvor's 2 method and existing RBAs.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.283-298
• /
• 2006

The TPR-tree is the time-parameterized indexing scheme that supports the querying of the current and projected future positions of such moving objects by representing the locations of the objects with their coordinates and velocity vectors. If this index is, however, used in environments that directions and velocities of moving objects, such as vehicles, are very often changed, it increases the communication cost between the server and moving objects because moving objects report their position to the server frequently when the direction and the velocity exceed a threshold value. To preserve the communication cost regularly, there can be used a manner that moving objects report their position to the server periodically. However, the periodical position report also has a problem that lineal time functions of the TPR-tree do not guarantee the accuracy of the object's positions if moving objects change their direction and velocity between position reports. To solve this problem, we propose the query processing scheme and the data structure using road networks for predicting uncertainty positions of moving objects, which is reported to the server periodically. To reduce an uncertainty of the query region, the proposed scheme restricts moving directions of the object to directions of road network's segments. To remove an uncertainty of changing the velocity of objects, it puts a maximum speed of road network segments. Experimental results show that the proposed scheme improves the accuracy for predicting positions of moving objects than other schemes based on the TPR-tree.

• Journal of Soil and Groundwater Environment
• /
• v.9 no.4
• /
• pp.52-61
• /
• 2004

In order to remediate soils contaminated with oxyanionic As and cationic Zn and Ni through the pilot-scale acid washing, the effectiveness of acid washing and the properties of contaminated soils, fine soil particle and dissolved contaminants were evaluated. $H_{2}SO_4\;and\;H_{3}PO_4$ washing at pH $2{\sim}3$ enhanced the removal of As by the presence of competitive oxyanions and HCl washing effectively removed simultaneously As, Zn and Ni. The effectiveness of soil washing was little enhanced above the critical reaction time, and the carbonate, Fe/Mn oxide and organic/sulfides associated fraction were dominantly removed. The washing of coarse soil particles was highly efficient, but that of fine soil particles($<74{\mu}m$) was recalcitrant due to the enrichment with contaminants. Moreover, the physical separation of fine particles($<149{\mu}m$) enhanced the overall efficiency of soil washing. Therefore, both chemical extraction and separation of fine soil particles showed the high effectiveness of soil washing in the intersection point to minimize the amount of fine soil particles and to maximize the chemical extraction of contaminants.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.1
• /
• pp.19-25
• /
• 2020

In frequent pattern mining, the uncertainty of each item is accompanied by a loss of information. AAlso, in real environment, the importance of patterns changes with time, so fuzzy logic must be applied to meet these requirements and the dynamic characteristics of the importance of patterns should be considered. In this paper, we propose a fuzzy utility mining technique for extracting frequent web page sets from web log databases through fuzzy utility-based web page set mining. Here, the downward closure characteristic of the fuzzy set is applied to remove a large space by the minimum fuzzy utility threshold (MFUT)and the user-defined percentile(UDP). Extensive performance analyses show that our algorithm is very efficient and scalable for Fuzzy Utility Mining using dynamic weights.