• Journal of the Korean Society for Nondestructive Testing
• /
• v.26 no.4
• /
• pp.246-254
• /
• 2006

A computation program has been developed for automatic data processing in the calibration process of gamma survey meter. The automatic processing program has been developed based on Visual Basic. The program has been coded according to steps of calibration procedure. The OLE(object linking an embedding) Excel automation method fur automatic data processing is used in this program, which is a kind of programming technique for the Excel control. The performance test on the basis of reference data has been carried out by using the developed program. In the results of performance test, the values of calibration factors and uncertainties by the developed program were equal to those obtained from the reference data. In addition, It was revealed that the efficiency and precision of working are significantly increased by using the developed program.

• Journal of Biomedical Engineering Research
• /
• v.19 no.2
• /
• pp.113-118
• /
• 1998

By their rapid and periodic actions, the cilia of the human respiratory tract play an important role in clearing inhaled noxious particles. Based on the automated image-processing technique, we studied the method analyzing ciliary beat frequency (CBF) objectively and quantitatively. Microscopic ciliary images were transformed into digitized gray ones through an image-grabber, and from these we extracted signals for CBF. By means of a FFT, maximum peak frequencies were detected as CBFs in each partitioned block for the entire digitized field. With these CBFs, we composed distribution maps visually showing the spatial distribution of CBFs. Through distribution maps of CBF, the whole aspects of CBF changes for cells and the difference of CBF of neighboring cells can be easily measured and detected. Histogram statistics calculated from the user-defined polygonal window can show the local dominant frequency presumed to be the CBF of a cell or a crust the region includes.

• Journal of Korea Multimedia Society
• /
• v.10 no.5
• /
• pp.583-593
• /
• 2007

We study the page replacement algorithms for demand paging, called CFLRU/C, CFLRU/E and DL-CFLRU/E, that reduce the number of erase operations and improve the wear-leveling degree of flash memory. Under the CFLRU/C and CFLRU/E algorithms, the victim page is the least recently used dean page within the pre-specified window. However, when there is not any dean page within the window, the CFLRU/C evicts the dirty page with the lowest frequency while the CFLRU/E evicts the dirty page with the highest number of erase operations. The DL-CFLRU/E algorithm maintains two page lists called the dean page list and the dirty page list, and first finds the page within the dean page list when it selects a victim. However, when it can not find any dean page within the dean page list, it evicts the dirty page with the highest number of erase operations within the window of the dirty page list. In this thesis, we show through simulation that the proposed schemes reduce the number of erase operations and improve the wear-leveling than the existing schemes like LRU.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.1
• /
• pp.65-70
• /
• 2013

Recently, the field of computer vision has been actively researched through digital image which can be easily generated as the development and expansion of digital camera technology. Especially, research that extracts and utilizes the feature in image has been actively carried out. The image stitching is a method that creates the high resolution image using features extract and match. Image stitching can be widely used in military and medical purposes as well as in variety fields of real life. In this paper, we have proposed efficient image stitching method using fast feature descriptor extraction and matching based on SURF algorithm. It can be accurately, and quickly found matching point by reduction of dimension of feature descriptor. The feature descriptor is generated by classifying of unnecessary minutiae in extracted features. To reduce the computational time and efficient match feature, we have reduced dimension of the descriptor and expanded orientation window. In our results, the processing time of feature matching and image stitching are faster than previous algorithms, and also that method can make natural-looking stitched image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.1
• /
• pp.139-149
• /
• 2007

Asynchronous OFCDM(Orthogonal Frequency and Code Division Multiplexing) systems must have a cell search process necessarily unlike synch개nous systems. this process is hewn initial synchronization and a three-step cell search algorithm is performed for the initial synchronization in the following three steps: OFCDM symbol timing, i.e., Fast Fourier Transform(FFT) window timing is estimated employing guard interval (GI) correlation in the first step, then the frame timing and CSSC(Cell Specific Scrambling Code) group is detected by taking the correlation of the CPICH(Common Pilot Channel) based on the property yielded by shifting the CSSC phase in the frequency domain. Finally, the CSSC phase within the group is identified in the third step. This paper proposes a modification group code with two or three block of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions. however, the effect of the reduction complexity leads to degradation of the performance therefore, look for combination to have the most minimum degradation. the proposed block type group code with suitable combinations is the nearly sane performance as conventional group code and has a complexity reduction that is to be compared and verified through the computer simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.687-695
• /
• 2007

There has been increasing of using Internet shopping mall like an e-business, and it means that the analysis technique of appetence for webpase visitors logging into the case of analyzing the degree of concern and using them in the personalization has been absolutely advanced. For heavy web pages, it is impossible to use click-stream based analysis in analyzing interest for each area by what kind of information the visitors are interested in to. A web browser of a limited size has difficulty in expressing on a screen information about what they want, or what hey are looking for. Pagescrolling is used to overcome such a limitation in expression. In this study, a analyzing system of degree of concern for Webpage is presented, designed and implemented using page scrolling to track the position of the scroll bar and movements of the window cursor regularly within a window browser for real-time transfer to analyze user's interest by using information received from the analysis of the visual perception area of the web page.

• Convergence Security Journal
• /
• v.18 no.5_1
• /
• pp.19-24
• /
• 2018

For a long time now, general-purpose processors have provided dedicated hardware / software tracing modules to provide developers with tools to fix bugs. A hardware tracer generates its enormous data into a log that is used for both performance analysis and debugging. Processor Trace (PT) is a new hardware-based tracing feature for Intel CPUs that traces branches executing on the CPU, which allows the reconstruction of the control flow of all executed code with minimal labor. Hardware tracer has been integrated into the operating system, which allows tight integration with its profiling and debugging mechanisms. However, in the Windows environment, existing studies related to PT focused on decoding only one flow in sequence. In this paper, we propose an extended PT decoder structure that provides basic data for real-time trace and malicious code detection using the functions provided by PT in Windows environment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.6
• /
• pp.125-134
• /
• 2004

When cryptosystem designers implement devices that computing power or memory is limited such as smart cards, PDAs and so on, not only he/she has to be careful side channel attacks(SCA) but also the cryptographic algorithms within the device has to be efficient using small memory. For this purpose, countermeasures such as Moiler's method, Okeya-Takagi's one and overlapping window method, based on window method to prevent SCA were proposed. However, Moiler's method and Okeya-Talngi's one require additional cost to prevent other SCA such as DPA, Second-Order DPA, Address-DPA, and so on since they are immune to only SPA. Also, overlapping window method has a drawback that requires big memory. In this paper, we analyze existing countermeasures and propose an efficient and secure countermeasure that is immune to all existing SCA using advantages of each countermeasure. Moreover, the proposed countermeasure can enhance the efficiency using mixed coordinate systems.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.6
• /
• pp.95-109
• /
• 2006

Elliptic Curve Cryptosystem (ECC) is suitable for resource-constrained devices such as smartcards, and sensor motes because of its short key size. This paper presents an efficient multi-scalar multiplication algorithm which is the main component of the verification procedure in Elliptic Curve Digital Signature Algorithm (ECDSA). The proposed algorithm can make use of a precomputed table of variable size and provides an optimal efficiency for that precomputed table. Furthermore, the given scalar is receded on-the-fly so that it can be merged with the main multiplication procedure. This can achieve more savings on memory than other receding algorithms. Through experiments, we have found that the optimal sizes of precomputed tables are 7 and 15 when uP+vQ is computed for u, v of 163 bits and 233 bits integers. This is shown by comparing the computation time taken by the proposed algorithm and other existing algorithms.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.4
• /
• pp.785-796
• /
• 2012

In this paper, we propose an effective Behavior-based detection technique using the frequency of system calls to detect malicious code, when the number of training data is fewer than the number of properties on system calls. In this study, we collect the Native APIs which are Windows kernel data generated by running program code. Then we adopt the normalized freqeuncy of Native APIs as the basic properties. In addition, the basic properties are transformed to new properties by GLDA(Generalized Linear Discriminant Analysis) that is an effective method to discriminate between malicious code and normal code, although the number of training data is fewer than the number of properties. To detect the malicious code, kNN(k-Nearest Neighbor) classification, one of the bayesian classification technique, was used in this paper. We compared the proposed detection method with the other methods on collected Native APIs to verify efficiency of proposed method. It is presented that proposed detection method has a lower false positive rate than other methods on the threshold value when detection rate is 100%.