• 통합자연과학논문집
• /
• 제4권2호
• /
• pp.121-129
• /
• 2011

The purpose of this paper is to estimate the fluctuation of an earning rate and risk management using the price index of Korea stocks. After an observation of conception of fluctuation, we can show volatility clustering and fluctuation phenomenon in the Korea stock price index using GARCH model with heteroscedasticity. In addition, the effects of fluctuation on the time-series was evaluated, which showed the heteroscedasticity. MCMC method and Winbugs as Bayesian computation were used for analysis.

• 통합자연과학논문집
• /
• 제5권2호
• /
• pp.120-126
• /
• 2012

This paper describes the algorithm that lowers the dimension, maintains the gesture recognition and significantly reduces the eigenspace configuration time by combining the higher correlation feature information and Principle Component Analysis. Since the suggested method doesn't require a lot of computation than the method using existing geometric information or stereo image, the fact that it is very suitable for building the real-time system has been proved through the experiment. In addition, since the existing point to point method which is a simple distance calculation has many errors, in this paper to improve recognition rate the recognition error could be reduced by using several successive input images as a unit of recognition with K-Nearest Neighbor which is the improved Class to Class method.

• 대한산업공학회지
• /
• 제19권4호
• /
• pp.3-11
• /
• 1993

We propose a new dual simplex method using a primal interior point. The dropping variable is chosen by utilizing the primal feasible interior point. For a given dual feasible basis, its corresponding primal infeasible basic vector and the interior point are used for obtaining a decreasing primal feasible point The computation time of moving on interior point in our method takes much less than that od Karmarker-type interior methods. Since any polynomial time interior methods can be applied to our method we conjectured that a slight modification of our method can give a polynomial time complexity.

• 대한산업공학회지
• /
• 제23권2호
• /
• pp.433-450
• /
• 1997

In this study, a heuristic algorithm is developed to solve a resource-constrained scheduling problem. The problem involves multiple projects and multiple resource categories, and allows flexible resource allocation to each activity. The objective is to minimize the maximum completion time. The algorithm takes advantage of the basic structure of a heuristic algorithm, called the exchange heuristic, but employs different strategies on some critical steps of the original algorithm which have significant effects on the algorithm performance. The original algorithm and the modified algorithm were compared through an experimental investigation. The modified algorithm produces significantly shorter schedules than the original algorithm, though it requires up to three times more computation time.

• 대한전기학회논문지
• /
• 제31권11호
• /
• pp.133-140
• /
• 1982

In recent years, a number of thyristor-controlled shunt compensators have been used in industrial and utility systems for phase balancing, power-factor correction and flicker reduction. This paper describes a simple and basic control scheme and circuits for shunt compensator with a fixed capacitor and thyristor-controlled reactor. Feedforward-control scheme is applied, and compensating currents are computed from the symmetrical components of the disturbed system. A 8 bit microprocessor is used for the computation of the compensating currents as well as for the measurements of the symmetric components. A 3-phase 1 KVA compensator is developed and a good reduction of the unbalance factor of the power source is achieved using it.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• pp.2296-2298
• /
• 1998

In this paper, an on-chip learning pulse-mode digital neural network with a massively parallel yet compact and flexible network architecture is suggested. Algebraic neural operations are replaced by stochastic processes using pseudo-random sequences and simple logic gates are used as basic computing elements. Using Back-propagation algorithm both feed-forward and learning phases are efficiently implemented with simple logical gates. RNG architecture using LFSR and barrel shifter are adopted to avoid some correlation between pulse trains. Suggested network is designed in digital circuit and its performance is verified by computer simulation.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2003년도 추계 학술대회논문집
• /
• pp.106-113
• /
• 2003

Smart UAV Development Program, one of the 21c Frontier R&D Program sponsored by MOST(Ministry of Science and Technology), was launched in 2002. As an air vehicle for the Smart UAV, CRW(Canard Rotor/Wing) concept was one of the candidates compared in trade-off study. The CRW concept has not only been proven completely but its aerodynamic characteristics not known in detail yet. Two calculation methods were adopted in this study to obtain aerodynamic data for the CRW. First method was the superpose DATCOM method which is capable of three lifting surfaces, and second one is the full Navier-Stokes computation around CRW configuration using overset grid method. Basic aerodynamic characteristics of the CRW configuration was analyzed and the minimum drag level with lift to drag ratio is presented. The peculiar flow characteristics around rotor/wing and hub were also examined and considered in the configuration design.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2002년도 추계학술대회 논문집
• /
• pp.241-249
• /
• 2002

In this paper, a self-organizing fuzzy controller(SOFC) for the industrial robot manipulator with a actuator located at the base is studied. A fuzzy login composed of linguistic conditional statements is employed by defining the relations of input-output variable of the controller, In the synthesis of a FLC, one of the most difficult problems is the determination of linguistic control rules from the human operators. To overcome this difficult SOFC is proposed for a hierarchical control structure consisting of basic level and high level that modify control rules. The proposed SOFC scheme is simple in structure, fast in computation, and suitable for implementation of real-time control. Performance of the SOFC is illustrated by simulation and experimental results for robot with tow joints.

• 한국컴퓨터정보학회논문지
• /
• 제23권2호
• /
• pp.53-61
• /
• 2018

In this paper, the author proposes an efficient group key agreement scheme in a mobile environment where group members frequently join and leave. This protocol consists of basic protocols and general ones and is expected to be suitable for communications between a mobile device with limited computing capability and a key distributing center (or base station) with sufficient computing capability. Compared with other schemes, the performance of the proposed protocol is a bit more efficient in the aspects of the overall cost for both communication and computation where the computational efficiency of the scheme is achieved by using exclusive or operations and a one-way hash function. Also, in the aspect of security, it guarantees both forward and backward secrecy based on the computational Diffie-Hellman (CDH) assumption so that secure group communication can be made possible. Furthermore, the author proves its security against a passive adversary in the random oracle model.

• International Journal of Automotive Technology
• /
• 제7권1호
• /
• pp.115-120
• /
• 2006

On a rotating contact surface of arbitrary shape, the relative velocity of the contact point sliding between the surfaces is computed with the basic geometries of the rotating surfaces, and the acceleration of the contact point between the contact surfaces is computed by using the relative velocity of the contact point. Thus the equation for the acceleration constraint between the contact surfaces in muitibody dynamics is not coupled with the parameters such as the relative velocity of the contact point. In case of the kinematic analysis, the acceleration of the contact point on any specific instant may also be efficiently computed by the present technique because the whole displacement of a full cycle need not be interpolated. Employing a cam-follower mechanism as a verification model, the acceleration of the contact point computed by the present technique is compared with that computed by differentiating the displacement interpolated with a large number of nodal points.