• The Mathematical Education
• /
• v.45 no.2 s.113
• /
• pp.165-176
• /
• 2006

In this paper, we consider changes of algebra strands around the world. And we suggest needs of designing new computer environment where we make and manipulate geometric recursive patterns. For this purpose, we first consider relations among symbols, meanings and patterns. And we also consider Logo environment and characterize algebraic features. Then we introduce L-system which is considered as action letters and subgroup of turtle group. There are needs to be improved since there exists some ambiguity between sign and action. Based on needs of improving the previous L-system, we suggest new commands in JavaMAL microworld. So we design a microworld for recursive patterns and consider meanings of letters in new environments. Finally, we consider the method to integrate L-system and other existing microworlds, such as Logo and DGS. Specially, combining Logo and DGS, we consider the movement of such tiles and folding nets by L-system commands. And we discuss possible benefits in this environment.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.12 no.6
• /
• pp.1265-1272
• /
• 1988

Kinematic and dynamic equations of open-loop mechanical systems are derived using the velocity transformation. The velocities of a link are defined by the velocities of the previous link and relative velocities between the links. The velocities and angular velocities are expressed with joint velocities and 6*1 velocity transformation vector. Using the velocity relations, recursive formula are derived and compared to the previous results. The derived recursive formula are modified and applied to the dynamic simulation of a vehicle. The computational efficiency of the vehicle simulation with the derived recursive formula is much enhanced.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.1B
• /
• pp.111-114
• /
• 2008

Explicit solutions of the wave dispersion equation are developed using the recursive relation in terms of the relative water depth. We use the solutions of Eckart (1951), Hunt (1979), and the deep-water and shallow-water solutions for initial values of the solution. All the recursive solutions converge to the exact one except that with the initial value of deep-water solution. The solution with the initial value by Hunt converged much faster than the others. The recursive solutions may be obtained quickly and simply by a hand calculator. For the transformation of linear water waves in whole water depth, the use of the recursive solutions will yield more accurate analytical solutions than use of previously developed explicit solutions.

• Journal of the Korean Statistical Society
• /
• v.28 no.3
• /
• pp.279-296
• /
• 1999

In this paper we establish some recurrence relations for both single and product moments of order statistics from a doubly truncated linear- exponential distribution with increasing hazard rate. These recurrence relations would enable one to compute all the higher order moments of order statistics for all sample sizes from those of the lower order in a simple recursive way. In addition, percentage points of order statistics are also discussed. These generalize the corresponding results for the linear- exponential distribution with increasing hazard rate derived by Balakrishnan and Malik(1986)

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.335-339
• /
• 1998

This paper presents a closed loop identification algorithm in time domain. This algorithm can be used for identification of unstable system and for model validation of system which is difficult to derive analytical model. In time domain, projection filter, which projects a finite number of input output data of a system into its current space, is used to relate the state space model with a finite difference model. Then recursive relations between the Markov parameters and the ARX model coefficients are derived to identify the system, controller and Kalman filter Markov parameters recursively, which are finally used to identify the system, controller and Kalman filter gains. The NASA LAMSTF is used to validate the algorithms developed.

• Publications of The Korean Astronomical Society
• /
• v.7 no.1
• /
• pp.1-7
• /
• 1992

We may consider the following three fundamental epistemological questions concerning cosmology. Can cosmology at last understand the origin of the universe? Can computers at last create? Can life be formed at last synthetically? These questions are in some sense related to the liar paradox containing the self-reference and, therefore. may not be answered by recursive processes in finite time. There are, however. various implications such that the chaos may break the trap of the self-reference paradox. In other words, Goedel's incompleteness theorem would not apply to chaos, even if the chaos can be generated by recursive processes. Internal relations among cosmology, epistemology and chaos must be investigated in greater detail.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3289-3295
• /
• 2010

In business material management, as the number of products and their parts increases, the employment of databases becomes inevitable. Many researchers have tried to incorporate semantics in traditional models using logic programming, resulting in the deductive method. However, since the designer of this method does not overcome the traditional design concept of relational method, there have been not much successful implementations in deductive method. Therefore, this paper propose the new way designing the retrieval methods for deductive databases and using those relations the query that makes recursive retrievals possible and hypotheses test in business material management.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.183-186
• /
• 1996

The relational database management systems sometimes require extremely long and complicated queries for a certain retreval. In this case, recursive retirevals are more efficient approach than the usual queries. Many researchers have tried to incorporate semantics in the traditional relational models using artificial intelligence techniques. This new concept becomes a deductive database and sometimes it is also called as a logic programming. However, the designer of a deductive database did not overcome the short of relational database. In this paper, we propose a new way of designing queries for the deductive database. We also provide relations for recursive retrieval in the deductive database. These approaches are applied for the material requirement planning.

• 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.

• East Asian mathematical journal
• /
• v.34 no.1
• /
• pp.59-67
• /
• 2018

We present new recurrence formulas for the raw and central moments of a compound binomial random variable. Our approach involves relating two compound binomial random variables that have parameters with a difference of 1 for the number of trials, but which have the same parameters for the success probability for each trial. As a consequence of our recursions, the raw and central moments of a binomial random variable are obtained in a recursive manner without the use of Stirling numbers.