• 한국데이터정보과학회:학술대회논문집
• /
• 2005.04a
• /
• pp.155-163
• /
• 2005

This paper applies Support Vector Regression (SVR) to estimate and forecast nonlinear autoregressive integrated (ARI) model of the daily exchange rates of four currencies (Swiss Francs, Indian Rupees, South Korean Won and Philippines Pesos) against U.S. dollar. The forecasting abilities of SVR are compared with linear ARI model which is estimated by OLS. Sensitivity of SVR results are also examined to kernel type and other free parameters. Empirical findings are in favor of SVR. SVR method forecasts exchange rate level better than linear ARI model and also has superior ability in forecasting the exchange rates direction in short test phase but has similar performance with OLS when forecasting the turning points in long test phase.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.2
• /
• pp.1-9
• /
• 2020

Many cryptographic and error control coding algorithms rely on finite field GF(2m) arithmetic. Hardware implementation of these algorithms needs an efficient realization of finite field arithmetic operations. Finite field multiplication is complicated among the basic operations, and it is employed in field exponentiation and division operations. Various algorithms and architectures are proposed in the literature for hardware implementation of finite field multiplication to achieve a reduction in area and delay. In this paper, a low area and delay efficient semi-systolic multiplier over finite fields GF(2m) using the modified Montgomery modular multiplication (MMM) is presented. The least significant bit (LSB)-first multiplication and two-level parallel computing scheme are considered to improve the cell delay, latency, and area-time (AT) complexity. The proposed method has the features of regularity, modularity, and unidirectional data flow and offers a considerable improvement in AT complexity compared with related multipliers. The proposed multiplier can be used as a kernel circuit for exponentiation/division and multiplication.

• Journal of Mechanical Science and Technology
• /
• v.17 no.10
• /
• pp.1399-1410
• /
• 2003

In this paper, we develop a joystick manual driving algorithm for an electric vehicle called Cycab. Cycab is developed as a public transportation vehicle, which can be driven either by a manual joystick or an automated driving mode. The vehicle uses six motors for driving four wheels, and front/rear steerings. Cycab utilizes one industrial PC with a real time Linux kernel and four Motorola MPC555 micro controllers, and a CAN network for the communication among the five processors. The developed algorithm consists of two automatic vehicle speed control algorithms for normal and emergency situations that override the driver's joystick command and an open loop torque distribution algorithm for the traction motors. In this study, the algorithm is developed using SynDEx, which is a system level CAD software dedicated to rapid prototyping and optimizing the implementation of real-time embedded applications on distributed architectures. The experimental results verify the usefulness of the two automatic vehicle control algorithms.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.8
• /
• pp.136-142
• /
• 2004

This paper deals with the design and implementation of an open architecture CNC system for Wire-EDM, with a consideration of the difference between Wire-EDM and NC cutting machines. Recent open architecture controller(OAC) related research results could be applied to directly access Wire-EDM systems at the CNC level. However, previous research about OAC is mostly aimed at NC cutting machines such as milling or lathes, and hence these results are inadequate to apply to Wire-EDM. To close the gap between previous general research on OAC and Wire-EDM specific needs, an open architecture NC model for Wire-EDM composed of a synchronization kernel and a NC functional module is proposed. Based on the control information flow and Wire-EDM specific machining process, the conceptual CNC model and the detailed implementation model for Wire-EDM is suggested.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.228-232
• /
• 2006

최근 활발히 개발 중인 보안운영체제의 핵심인 보안커널(security kernel)은 참조모니터(reference monitor)에서 주체(subject)가 객체(object)에 대한 실행(action) 권한을 판단함으로써 접근 제어를 실행한다. 보안운영체제의 대표적인 접근제어모델에는 다중레벨접근제어(MLS: Multi Level Security)모델과 역할기반접근제어(RBAC: Role Based Access Control) 모델 등이 있다. 리눅스 시스템에서 이러한 접근제어모델을 적용하기 위해서 접근 대상이 되는 객체들의 효과적인 분류가 요구된다. 본 논문에서는 리눅스 환경에서 효과적인 접근제어모델을 적용하기 위하여 객체들을 객체 클래스(class)와 유형(type)을 기준으로 분류 하였다.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.4
• /
• pp.293-298
• /
• 2006

A factorization is an extremely important part of multi-level logic synthesis. The number of literals in a factored form is a good estimate of the complexity of a logic function, and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to identify two-cube Boolean subexpression pairs from given expression. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Bryton's co-kernel cube matrix.

• Journal of Communications and Networks
• /
• v.1 no.2
• /
• pp.134-142
• /
• 1999

We have developed fully functional Video Server and Client applications which can transmit, receive, decompress and display compressed video over various networks. Our video trans-port allows dynamic rate control feedback, loss detection, and repair requests from Clients to the Server. Our experiments show how feedvack-before-degradation scheme for rate adaptation maintains good display frame-rate for video playback. We show how the playback degradation(reduction in display frame-rate) oc-curs and what happens if corrective measures are not taken to im-prove the situation. The degradation is attributed to the increased internal kernel buffering which consumes scarce CPU resources. We demontrate with our experimental results that ServerNet, with improved hardware delivery guarantees, can significantly reduce host CPU resource consumption while serving video streams. We present the maximum number of streams which can be served for each of ATM and ServerNet interconnects. The appropriate user-level packet size for the video server are also determined for each case.

• Journal of the Korean Chemical Society
• /
• v.25 no.5
• /
• pp.291-299
• /
• 1981

A test particle kinetic theory for reaction dynamics in liquids is presented at the repeated ring collision level for the hard sphere model. A kinetic equation for the equilibrium time correlation function of the reactive test particle phase space density is derived and the rate kernel expression for the reversible chemical reaction of the type A +B ${\rightleftharpoons$ C + D in the presence of inert solvent S is obtained by the projection operator method.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.3
• /
• pp.145-153
• /
• 2013

Virtualization technology has been applied in IA-32 based server or desktop systems. Recently it has been applied in ARM based mobile systems. Virtualization technology provides many useful features that are not possible in operating system level such as isolation, interposition, encapsulation and portability. In this research, we implement an ARM based VMM(Virtual Machine Monitor) by using the following techniques. First, we use "emulation" to virtualize the processor. Second, we use "shadow page tables" to virtualize the memory. Finally, we use a simple "pass-through I/O" to virtualize the device. Currently the VMM runs ARM Linux kernel 3.4.4 on a BeagleBoard-xM, and we evaluated the performance of the VMM using lmbench and dhrystone. The result of the evaluation shows that our VMM is slower than Xen on ARM that is implemented using paravirtualization but has good performance among the VMMs using full-virtualization.

• ETRI Journal
• /
• v.38 no.3
• /
• pp.540-550
• /
• 2016

Spectral clustering is a powerful tool for exploratory data analysis. Many existing spectral clustering algorithms typically measure the similarity by using a Gaussian kernel function or an undirected k-nearest neighbor (kNN) graph, which cannot reveal the real clusters when the data are not well separated. In this paper, to improve the spectral clustering, we consider a robust similarity measure based on the shared nearest neighbors in a directed kNN graph. We propose two novel algorithms for spectral clustering: one based on the number of shared nearest neighbors, and one based on their closeness. The proposed algorithms are able to explore the underlying similarity relationships between data points, and are robust to datasets that are not well separated. Moreover, the proposed algorithms have only one parameter, k. We evaluated the proposed algorithms using synthetic and real-world datasets. The experimental results demonstrate that the proposed algorithms not only achieve a good level of performance, they also outperform the traditional spectral clustering algorithms.