• Bulletin of the Korean Mathematical Society
• /
• v.44 no.2
• /
• pp.259-263
• /
• 2007

Which spheres are shellable?[2]. We present one of them which is the k-tree with n-labeled vertices. We found that the number of ways to shell the k-dimensional trees on n-labeled vertices is $$\frac{n!}{(k+1)!}(nk-k^2-k+1)!k$$.

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

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1622-1624
• /
• 1987

In general, pseudo noise generator(PNG) used for PLR System consists of linear feedback shift register. Based on a W.F. representation of shift registers, a method for analyzing operational characters & sequence of PNG are studied. PNG is characterized by the time-recursive equation & PNG sequence is analyzed by the output state variable equation. Methods studied in this paper are illustrated by appropriate example.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.4
• /
• pp.380-385
• /
• 1990

This Paper presents a general algorithm for the parameter estimation of an antoregressive moving average process observed in additive white noise. The algorithm is based on the Gauss-Newton recursive prediction error method. For the parameter estimation, the output measurement is modelled as an innovation process using the spectral factorization, so that noise free RPE ARMA estimation can be used. Using apriori known properties leads to algorithm with smaller computation and better accuracy be the parsimony principle. Computer simulation examples show the effectiveness of the proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.274-275
• /
• 2000

This paper introduces new ordering algorithms using the graph of data structure and forward/backward substitution of LU decomposition using recursive function. The performance of the algorithm is compared with Tinney's algorithm using 14 bus systems. Test results show that the new fill-in element of Jacobian matrix using the proposed ordering algorithm is same as that of Tinner scheme 3 and the forward/backward substitution can reduce the computation time

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2543-2545
• /
• 2005

It is well known that the orthogonal function is a very useful to estimate an unknown inputs in the linear dynamic systems for its recursive algebraic algorithm. At this aspects, derivative operation(matrix) of orthogonal functions(walsh, block pulse and haar) are introduced and shown how it can useful to design an UIO(unknown inputs observer) design.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.324-326
• /
• 2006

This paper present backstepping control approach for controling chaotic Liu system. The proposed method is a systematic design approach and consists in a recursive procedure that interlaces the choice of a Lyapunov Function. Based on Lyapunov stability theory, control laws are derived. We used the same technique to enable stabilization of chaotic motion to a steady state as well as tracking of any desired trajectory to be achieved in a systematic way. Numerical solution are shown to verify the result.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.464-467
• /
• 2001

A good arithmetic random number generator should possess full period, uniformity and independence, etc. To obtain the excellent random number generator, many researchers have found good parameters. Also an initial seed is the important factor in random number generator. But, there is no theoretical guideline for using the initial seeds. Therefore, random number generator is usually used with the arbitrary initial seed. Through the empirical tests, we show that the choice of the initial values for the seed is important to generate good random numbers.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.8 no.1
• /
• pp.31-40
• /
• 1983

An uncertain dynamic evolving process has been a continuing challenge to decision problems. The dynamic random variable (drv) changes which characterize such a process are very important for the decision-maker in selecting a course of action in a world that is perceived as uncertain, complex, and dynamic. Using this subjective point prediction algorithm based on a modified recursive filter, the decision-maker becomes to have periodically changing plausible points with the passage of time.

• ETRI Journal
• /
• v.14 no.1
• /
• pp.118-125
• /
• 1992

다중 컴퓨터 연결망의 성능은 그 위상에 따라 크게 좌우되는데 현재까지 연구된 많은 연결망중에서 특히 하이퍼큐브 연결망은 노드수에 비해 비교적 적은 차수와 지름을 갖고 symmetric 하며 순환적 구성 (recursive decomposition structure) 특성을 갖고 있어 여러가지 알고리즘의 사상이 용이하여 많이 사용되고 있다. 여기서는 $Akers^2$ 등에 의해 제안되어 스타 그래프 (star graph) 에 대해 성능분석을 하였다. 분석 척도로는 노드간 평균거리를 사용하였으며 메시지 분포는 $Reed^(1)$가 사용한 분포를 사용하였다. 분석결과 스타 그래프 연결망은 하이퍼큐브와 비슷한 성능을 보였으며 노드 수가 많아질수록 더 나은 성능을 보였다.