• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.497-500
• /
• 2002

When one is interested in the dynamics of a mechanical system with electric motors, the force generated by the motor is generally considered as only an applied torque or force independent of mechanical state variables such as velocity. For a system operated in non-steady dynamic conditions, however, the usual analysis approach may fail to predict some characteristics in the dynamic behaviors because of electromechanical coupling effects. In this paper, we propose dynamics analysis model in which dc motor dynamics with the electromechanical coupling effects are embedded to mechanical dynamics models. The do motor is modeled based on its equivalent circuit model and included in the dynamics solving algorithm which we developed before, called generalized recursive dynamics formula. The developed dynamic analysis model is effective and realistic for analysis of electromechanical dynamics of a system with do motors. The developed model is evaluated by constructing and simulating the flexible antennas of an artificial satellite driven by do motors.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1788-1796
• /
• 1997

In this paper, we propose a new connection admission control(CAC) algorithm for traffic control in ATM network in which traffic estimation is performed based on user-specified parameters at every moment of connection request or connection release by recursive formula which makes real-time calculation possible. And traffic estimation using cell flow measurement is carried out when the number of connectioned calls does not change during a measurement reflection period. Performance analysis of the proposed method is carried out using several aspects for homogeneous and heterogeneous bursty traffic. The results showed that the proposed CAC method revealed better performance, than conventional CAC method for burst model in both utilization and QoS point of view.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.3
• /
• pp.94-98
• /
• 1997

The most commonly used method to generate sonar transmitting beam is extracting digital samples out of memory, which are to excite transducers of the phased array respectively. As several types of signals have been used in sonar to enhance the performance of sonar in various environments, a large amount of memory is required to store them. In this paper, we adopt recursive algorithm to synthesize every different time-delayed signal for transmitting beams with small amount of memory and simple arithmetic operations. The error due to recursive calculation is also analyzed.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.4
• /
• pp.456-465
• /
• 2006

The problem of recursive filtering far linear discrete-time systems with uncertainties is considered. A new suboptimal filtering algorithm is herein proposed. It is based on the fusion formula, which represents an optimal mean-square linear combination of local Kalman estimates with weights depending on cross-covariances between local filtering errors. In contrast to the optimal weights, the suboptimal weights do not depend on current measurements, and thus the proposed algorithm can easily be implemented in real-time. High accuracy and efficiency of the suboptimal filtering algorithm are demonstrated on the following examples: damper harmonic oscillator motion and vehicle motion constrained to a plane.

• Structural Engineering and Mechanics
• /
• v.17 no.5
• /
• pp.727-734
• /
• 2004

An uncoupled computational model for analyzing the hygrothermal dynamic response of composite laminates has been developed. The constitutive equations, expressed in an integral form, and involving relaxation moduli are adopted, to describe the non-aging hygrothermorheologically simple materials. A Prony series represents the relaxation moduli is exploited in order to derive a recursive relationship, and thereby eliminate the storage problem that arises when dealing with material possessing memory. The problem is formulated in a descritized variational form. Mindlin and higher order finite elements are employed for spatial descretization, while the Newmark average acceleration scheme is exploited for temporal descritization. The adopted recursive formula uses only the details of the previous event to compute the details of the current one. Numerical results of the displacement fields of both thin and thick viscoelastic laminates problems are discussed to show up the effectiveness of Mindlin and higher-order shear theories.

• The KIPS Transactions:PartA
• /
• v.14A no.4
• /
• pp.245-248
• /
• 2007

This paper provides some simple recursive formulas generation transition functions of finite cellular automata with triplet local transition functions under two states (0 and 1) and four different boundary conditions (0-0,0-1,1-0,1-1), and classify transition functions into several classes.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.2
• /
• pp.106-112
• /
• 2007

This paper proposes a hybrid architecture algorithm for fast computation of DCT and DFT via recursive factorization. Recursive factorization of DCT-II and DFT transform matrix leads to a similar architectural structure so that common architectural base may be used by simply adding a switching device. Linking between two transforms was derived based on matrix recursion formula. Hybrid acrchitectural design for DCT and DFT matrix decomposition were derived using the generation matrix and the trigonometric identities and relations. Data flow diagram for high-speed architecture of Cooley-Tukey type was drawn to accommodate DCT/DFT hybrid architecture. From this data flow diagram computational complexity is comparable to that of the fast DCT algorithms for moderate size of N. Further investigation is needed for multi-mode operation use of FFT architecture in other orthogonal transform computation.

• Journal of the Korean Mathematical Society
• /
• v.38 no.5
• /
• pp.1061-1068
• /
• 2001

We write down explicity a recursive formula of one-pointed gravitational Gromov-Witten invariants and reduce the computation of them to a combinatoric problem which is not solved yet. The one-pointed invariants were played important role in Givental’s program in mirror symmetry. In section 3, we describe the combinatoric problem which can be read independently.

• Honam Mathematical Journal
• /
• v.38 no.1
• /
• pp.71-84
• /
• 2016

The aim of this work is to compute the volume of the graph polytope associated with various type of finite simple graphs composed of paths and stars. Recurrence relations are obtained using the recursive volume formula (RVF) which was introduced in Lee and Ju ([3]). We also discussed the relationship between the volume of the graph polytopes and the number of linear extensions of the associated posets for given bipartite graphs.

• Journal of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.1075-1088
• /
• 2014

We consider random fractal sets with random recursive constructions in which the contracting vectors have different distributions at different stages. We prove that the random fractal associated with such construction has a constant packing dimension almost surely and give an explicit formula to determine it.