• Research in Mathematical Education
• /
• v.7 no.4
• /
• pp.211-222
• /
• 2003

Recursive thinking is iterative, self-referential, and building on itself continuously. Moreover, it is becoming a more prominent feature of the mathematical scope because of the availability of computers and languages like Logo, Excel, and Pascal that support recursion. This study investigates the way to create students' recursive thinking in mathematics classroom and to use various methods to solve problems using a spreadsheet, the Excel program where technology could be accessible.

• Journal of the Korean Mathematical Society
• /
• v.39 no.3
• /
• pp.351-361
• /
• 2002

We extend the Holder-McCarthy inequality for a positive and an arbitrary operator, respectively. The powers of each inequality are given and the improved Reid's inequality by Halmos is generalized. We also give the bound of the Holder-McCarthy inequality by recursion.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.427-430
• /
• 1989

For on-line ARMA spectral estimation, the fast transversal filter algorithm of extended least squares method(ETS FTF) is presented. The projection operator, a key tool for geometric approach, is used in the derivation of the algorithm. ELS FTF is a fast time update recursion which is based on the fact that the correlation matrix of ARMA model satisfies the shift invariance property in each block, and thus it takes 10N+31 MADPR.

• Communications for Statistical Applications and Methods
• /
• v.2 no.2
• /
• pp.166-175
• /
• 1995

When a neutral particle beam(NPB) aimed at the object and receive a small number of neutron signals at the detector without any errors, it obeys Poisson law. Under the two assumptions that neutral particle scattering distribution and aiming errors have a circular Gaussian distributions that neutral particle scattering distribution and aiming errors have a circular Gaussian distribution respectively, an exact probability distribution of neutral particles vecomes a Poisson-power function distribution. We study and prove some properties, such as limiting distribution, unimodality, stochastical ordering, computational recursion fornula, of this distribution. We also prove monotone likelihood ratio(MLR) property of this distribution. Its MLR property can be used to find a criteria for the hypothesis testing problem.

• The Pure and Applied Mathematics
• /
• v.16 no.1
• /
• pp.147-154
• /
• 2009

Tamanoi proposed higher Schwarzian operators which include the classical Schwarzian derivative as the first nontrivial operator. In view of the relations between the classical Schwarzian derivative and the analogous differential operator defined in terms of Peschl's differential operators, we define the generating function of our generalized higher operators in terms of Peschl's differential operators and obtain recursion formulas for them. Our generalized higher operators include the analogous differential operator to the classical Schwarzian derivative. A special case of our generalized higher Schwarzian operators turns out to be the Tamanoi's operators as expected.

• Language and Information
• /
• v.20 no.1
• /
• pp.25-49
• /
• 2016

Honorific forms express the speaker's social attitude to others and also indicate the social ranks and level of intimacy of the participants in the discourse. In a cross-linguistic perspective of grammar engineering, modelling honorification has been regarded as a key strategy for improving language processing applications. Using the HPSG and MRS formalism, this article provides a multilingual grammar model of honorification. The present study incorporates the honorific information into the Meaning Representation System (MRS) via Individual Constraints (ICONS), and then conducts an evaluation to see if the model contributes to semantics-based language processing.

• Journal of the Korean Vacuum Society
• /
• v.2 no.3
• /
• pp.339-345
• /
• 1993

계면의 원자구조와 전자특성간의 상관성을 연구하기 위하여 GaAs-Ge(AlAs) 이종접합에서 전자의 국소상태밀도(LDOS)를 계산하였다. 본 연구에서는 tight-binding recursion 방법을 기초로 하여 계면의 국소상태밀도로부터 band-offsets, 계면형성에너지, 계면결합의 bond order 등을 연구하는 보다 편리한 방법을 제시하였다.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.04a
• /
• pp.133-140
• /
• 2002

This paper investigates the applicability of the modified Lanczos method using the power technique, which was developed in the field of quantum physics, to the eigenproblem in the field of engineering mechanics by introducing matrix-powered Lanczos recursion and numerically evaluating the suitable power value. The matrix-powered Lanczos method has better convergence and less operation count than the conventional Lanczos method. By analyzing four numerical examples, the effectiveness of the matrix-powered Lanczos method is verified and the appropriate matrix power is also recommended.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.14 no.4
• /
• pp.839-846
• /
• 1994

This paper presents a simultaneous solution algorithm for one-dimensional unsteady flow routing through a dendritic channel system. This simulations solution algorithm is based on the double-sweep method and utilizes separate recursion equations for continuity, momentum and energy equations for each of the individual components of a dendritic channel system. Through separate recursion equations for each of the components. the new algorithm converts a dendritic channel network problem into a single-channel problem. The new algorithm is utilized in conjunction with a linearized unsteady flow model using full dynamic flow equations. The required computer storage for the coefficient matrix of the whole system is reduced significantly from the $2N{\times}2N$ matrix to a $2N{\times}4$ matrix, where N is the number of cross sections used in the computation of flow variables in a dendritic channel system. The algorithm presented in this paper provides an efficient and accurate modeling of unsteady flow events through a dendritic channel system.

• International Journal of CAD/CAM
• /
• v.4 no.1
• /
• pp.47-53
• /
• 2004

The subdivision surface is the limit of recursively refined polyhedral mesh. It is quite intuitive that the multi-resolution feature can be utilized to simplify generation of NC (Numerical Control) tool paths for rough machining. In this paper, a new method of parallel NC tool path generation for subdivision surfaces is presented. The basic idea of the method includes two steps: first, extending G-Buffer to a strip buffer (called S-Buffer) by dividing the working area into strips to generate NC tool paths for objects of large size; second, generating NC tool paths by parallel implementation of S-Buffer based on MPI (Message Passing Interface). Moreover, the recursion depth of the surface can be estimated for a user-specified error tolerance, so we substitute the polyhedral mesh for the limit surface during rough machining. Furthermore, we exploit the locality of S-Buffer and develop a dynamic division and load-balanced strategy to effectively parallelize S-Buffer.