• Kyungpook Mathematical Journal
• /
• v.56 no.2
• /
• pp.473-506
• /
• 2016

This paper continues the study of recursion formulas of multivariable hypergeometric functions. Earlier, in [4], the authors have given the recursion formulas for three variable Lauricella functions, Srivastava's triple hypergeometric functions and k-variable Lauricella functions. Further, in [5], we have obtained recursion formulas for the general triple hypergeometric function. We present here the recursion formulas for Exton's triple hypergeometric functions.

• Communications of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.207-236
• /
• 2018

We obtain recursion formulas for q-hypergeometric and q-Appell series. We also find recursion formulas for the general double q-hypergeometric series. It is shown that these recursion relations can be expressed in terms of q-derivatives of the respective q-hypergeometric series.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.458-462
• /
• 2008

교육에서 수월성의 문제가 처음 제기된 문제는 아니지만 국가 간의 경쟁력이란 차원에서뿐만 아니라 교육환경의 개선이란 차원에서도 현대사회에서 창의적인 사고력을 지닌 학생의 교육이 무엇보다 강조되고 있다. 이 논문에서는 정보 영재의 교육 중에서 프로그래밍을 위한 사고력 신장에 적합한 교수-학습 모형 개발 및 적용에 목적을 두고 있다. 제안된 교수-학습 모형에서 자료구조로는 트리를 구성하고 제어구조로는 recursion 개념을 학습하도록 하고 있다. 정보 영재 지도에 도입할 수 있는 가능성을 모색하기 위해 교수-학습 모형을 현장에 적용하여 교육 프로그램 개발의 타당성을 검증한다. 예제로 선택한 하노이 타워를 트리로 구성하는 방법과 트리 탐색의 방법으로서 recursion 개념을 적용하는 교수-학습 활동으로 사고력 신장을 위한 교육 프로그램 개발의 타당성을 검증한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.73-82
• /
• 1993

Over the last decades, interest in the application of decision support systems(DSS) in organizations has increased rapidly. Desipte the growing number of investigations examining decision support system, relatively few empirical studies have evaluated the effects of DSS on problem-solving processes. This study examined, using a computer simulation technique, the effect of recursion in problem-solving processes about the problem-solving time. Results indicate that the recursion at the early stage of problem-solving processes scarcely influenced the problem-solving time, which is contrasted with the case of the recursion at the final stage.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.377-381
• /
• 2005

We present a convenient recursive formula for the sums of alternating harmonic series of odd order. The recursion is obtained by expanding in Fourier series certain elementary functions.

• Journal of the Korean Magnetics Society
• /
• v.5 no.5
• /
• pp.846-853
• /
• 1995

In order to study electronic structures for locally disordered systems, we have developed a first-principle self-con-sistent-spin-polarized real space band method (TB-LMTO-R), which combines the tight-binding(TB) linear-muffin-tin orbital(LMTO) band rrethod and the recursion(R) rrethod. The TB-LMTO-R rrethod has been applied to fer-romagnetic bec Fe, hcp Co, and fcc Ni. With varying cluster sizes, recursion coefficients, and the order of the TB-Hamiltonian, we have calculated the local density of states(LDOS) and magnetic moments. It is found that the calculation with 5,000 atoms cluster, 40 continued fractions, and the second-order TB-Hamiltonian yields a conver¬gent result in agreement with those from the conventional LMTO. In this way, we have demonstrated a physical transparency of the TB-LMTO-R method as a real space description.

• International Journal of CAD/CAM
• /
• v.4 no.1
• /
• pp.11-17
• /
• 2004

In this paper, an exponential bound of the distance between a Loop subdivision surface and its control mesh is derived based on the topological structure of the control mesh. The exponential bound is independent of the process of recursive subdivisions and can be evaluated without subdividing the control mesh actually. Using the exponential bound, we can predict the depth of recursion within a user-specified tolerance as well as the error bound after n steps of subdivision. The error-estimating approach can be used in many engineering applications such as surface/surface intersection, mesh generation, NC machining, surface rendering and the like.

• Journal of Computing Science and Engineering
• /
• v.1 no.2
• /
• pp.195-210
• /
• 2007

Dwarf is a highly compressed structure, which compresses the cube by eliminating the semantic redundancies while computing a data cube. Although it has high compression ratio, Dwarf is slower in querying and more difficult in updating due to its structure characteristics. We all know that the original intention of data cube is to speed up the query performance, so we propose two novel clustering methods for query optimization: the recursion clustering method which clusters the nodes in a recursive manner to speed up point queries and the hierarchical clustering method which clusters the nodes of the same dimension to speed up range queries. To facilitate the implementation, we design a partition strategy and a logical clustering mechanism. Experimental results show our methods can effectively improve the query performance on data cubes, and the recursion clustering method is suitable for both point queries and range queries.

• Kyungpook Mathematical Journal
• /
• v.16 no.1
• /
• pp.21-25
• /
• 1976

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.1000-1010
• /
• 2006

This paper proposes a new architecture for DCT-based motion estimation and compensation. Previous methods do riot take sufficient advantage of the sparseness of 2-D DCT coefficients to reduce execution time. We first derive a recursion equation to perform DCT domain motion estimation more efficiently; we then use it to develop a wavefront array processor (WAP) consisting of processing elements. In addition, we show that the recursion equation enables motion predicted images with different frequency bands, for example, from the images with low frequency components to the images with low and high frequency components. The wavefront way Processor can reconfigure to different motion estimation algorithms, such as logarithmic search and three step search, without architectural modifications. These properties can be effectively used to reduce the energy required for video encoding and decoding. The proposed WAP architecture achieves a significant reduction in computational complexity and processing time. It is also shown that the motion estimation algorithm in the transform domain using SAD (Sum of Absolute Differences) matching criterion maximizes PSNR and the compression ratio for the practical video coding applications when compared to tile motion estimation algorithm in the spatial domain using either SAD or SSD.