• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.700-707
• /
• 2000

In this paper, we address vulnerabilities of legacy VOD system and implement secure-VOD system to protect security holes of it. Our secure-VOD system provide user authentication using one-time password, message authentication and encryption/decryption for video server information. To improve security of existing fixed password system, our secure-VOD system use one-time password. Also, our secure-VOD system provides integrity for video server information by generating and verifying message authentication code using HMAC-HAS 160 algorithm. Finally, our secure-VOD system uses RC5 encryption algorithm to guarantee confidentiality for video server information.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.6
• /
• pp.705-713
• /
• 2006

For the analysis of multiunit extracellular neural signals as multiple spike trains, neural spike sorting is essential. Existing algorithms for the spike sorting have been unsatisfactory when the signal-to-noise ratio(SNR) is low, especially for implementation of fully-automated systems. We present a novel method that shows satisfactory performance even under low SNR, and compare its performance with a recent method based on principal component analysis(PCA) and fuzzy c-means(FCM) clustering algorithm. Our system consists of a spike detector that shows high performance under low SNR, a feature extractor that utilizes projection pursuit based on negentropy maximization, and an unsupervised classifier based on Gaussian mixture model. It is shown that the proposed feature extractor gives better performance compared to the PCA, and the proposed combination of spike detector, feature extraction, and unsupervised classification yields much better performance than the PCA-FCM, in that the realization of fully-automated unsupervised spike sorting becomes more feasible.

• ETRI Journal
• /
• v.15 no.3
• /
• pp.1-26
• /
• 1994

Simulated annealing is an attractive, but expensive, heuristic method for approximating the solution to combinatorial optimization problems. Attempts to parallel simulated annealing, particularly on distributed memory multicomputers, are hampered by the algorithm's requirement of a globally consistent system state. In a multicomputer, maintaining the global state S involves explicit message traffic and is a critical performance bottleneck. To mitigate this bottleneck, it becomes necessary to amortize the overhead of these state updates over as many parallel state changes as possible. By using this technique, errors in the actual cost C(S) of a particular state S will be introduced into the annealing process. This paper places analytically derived bounds on this error in order to assure convergence to the correct optimal result. The resulting parallel simulated annealing algorithm dynamically changes the frequency of global updates as a function of the annealing control parameter, i.e. temperature. Implementation results on an Intel iPSC/2 are reported.

• Proceedings of the Korean Geotechical Society Conference
• /
• 1994.09a
• /
• pp.123-128
• /
• 1994

For the proper analysis of soil excavation problems through FEM, a constitutive model should be able to simulate the real soil behavior, especially around the excavated section. In this study, the nenlinear finite element analysis is performed using an anisotropic hardening constitutive model based on 'generalized isotropic hardening' rule. Furthermore, in order that the implementation of this constitutive model is performed consistently with the iterative algorithm for the numerical analysis, stresses are implicitly intergrated by the closest point projection algorithm, and a consistent tangent modulus is evaluated. An excavation example including various loading esquences is analyzed, and the results are compared with the Cam-clay model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4B
• /
• pp.397-402
• /
• 2002

The IFSAR technique using SAR data has various applications and is the only latest technology to produce high precision height information from the radar phase data. This paper describes the whole implementation algorithm of IFSAR technique. Also it suggests the algorithms for azimuth aliasing resolution and interferogram generation of SAR data. Those are proved through the experiment: azimuth aliasing is resolved and interferogram is generated properly. Therefore, it proposes the method for interferogram generation, an essential process in extracting high precision height data, and the development approach to principal modules of IFSAR algorithm.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• pp.365-368
• /
• 2005

This paper describes the implementation of autonomy in the motion of a small size human robot. Traditional modeling of environment and concept of moving planning have limitations to adapt the change of environment and to implement in real-time operation. To overcome these limitations, we designed a behavior-based control algorithm and applied to robot soccer. Based on experiment, we verify that the behavior-based control algorithm works well in the change of environment.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.59-65
• /
• 2013

This paper presents a novel calibration method for a base station system adopting an antenna array. The proposed technique utilizes Zadoff-Chu sequence, which is included in the LTE pilot signal periodically, in order to compute the phase characteristic of each antenna channel. As the Zadoff-Chu sequence exhibits an excellent autocorrelation characteristic, it is possible for the receiving base station to retrieve the Zadoff-Chu sequence transmitted from each mobile terminal. In addition, we can obtain the phase characteristic of each antenna channel, which is the ultimate goal of the calibration procedure. The proposed calibration algorithm has been implemented using an FPGA (Field Programmable Gate Array). We have applied the proposed algorithm to an array consisting of 2 antenna elements for simplicity. the phase value implied to the first and second antenna path is very accurately calculated from the proposed procedure. From the experimental test, the proposed method provides accurate calibration results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.1
• /
• pp.65-71
• /
• 2013

In this work, new smart phone based moving target detection is proposed. In order to implement the task, methods of real time image transmission from network camera, motion detecting algorithm and its effective implementation are also addressed. The network camera transfers image data by MJPEG format which contains various information such as data and IP address, and the smart phone separates the image data received through a WiFi module. Later, the image data is converted to a Bitmap image format, and with the help of the embedded OpenCV library on a smart phone and algorithm, it was found that the moving object was identified effectively in terms of real time monitoring and detection.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.17-26
• /
• 2014

In this paper, we present an algorithm for computing the number of points on the Jacobian varieties of genus 3 hyperelliptic curves of type $y^2=x^7+ax$ over finite prime fields. The problem of determining the group order of the Jacobian varieties of algebraic curves defined over finite fields is important not only arithmetic geometry but also curve-based cryptosystems in order to find a secure curve. Based on this, we provide the explicit formula of the characteristic polynomial of the Frobenius endomorphism of the Jacobian variety of hyperelliptic curve $y^2=x^7+ax$ over a finite field $\mathbb{F}_p$ with $p{\equiv}1$ modulo 12. Moreover, we also introduce some implementation results by using our algorithm.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.812-817
• /
• 2006

This paper presents an image-space algorithm to real-time collision detection, which is run completely by GPU. For a single object or for multiple objects with no collision, the front and back faces appear alternately along the view direction. However, such alternation is violated when objects collide. Based on these observations, the algorithm has been devised, and the implementation utilizes the state-of-the-art functionalities of GPU such as framebuffer objects(FBO), vertex buffer object(VBO) and occlusion query. The experimental results show the feasibility of GPU-intensive collision detection and its performance gain in real-time applications such as 3D games.