• Journal of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.181-193
• /
• 1997

The enumeration of various classes of paths in the real plane has an important implications in the area of combinatorics wit statistical applications. In 1887, D. Andre [3, pp. 21] first solved the famous ballot problem, formulated by Berttand [2], by using the well-known reflection principle which contributed tremendously to resolve the problems of enumeration of various classes of lattice paths in the plane. First, it is necessary to state the definition of NSEW-paths in the palne which will be employed throughout the paper. From [3, 10, 11], we can find results concerning many of the basics discussed in section 1 and 2.

• The Journal of the Acoustical Society of Korea
• /
• v.6 no.2
• /
• pp.15-18
• /
• 1987

Multiplication free adaptive digital filtering algorithms are discussed. The proposed. The proposed algorithm uses delta modulation digital filter and the relevant filter weights are updated using the SIGN algorithms to realize an adaptive digital filter without multiplication operations. It is shown that the resulting algorithm can be implemented using simple up/down counting operations. The convergence characteristics of the proposed adaptive digital filtering algorithm and .others are investigated for a system identification problem.

• Kyungpook Mathematical Journal
• /
• v.54 no.4
• /
• pp.607-617
• /
• 2014

Let S = C(r,m), the finite cyclic semigroup with index r and period m. Each subsemigroup of S is cyclic if and only if either r = 1; r = 2; or r = 3 with m odd. For $r{\neq}1$, the maximum value of the minimum number of elements in a (minimal) generating set of a subsemigroup of S is 1 if r = 3 and m is odd; 2 if r = 3 and m is even; (r-1)/2 if r is odd and unequal to 3; and r/2 if r is even. The number of cyclic subsemigroups of S is $r-1+{\tau}(m)$. Formulas are also given for the number of 2-generated subsemigroups of S and the total number of subsemigroups of S. The minimal generating sets of subsemigroups of S are characterized, and the problem of counting them is analyzed.

• Journal of the Korean Statistical Society
• /
• v.26 no.4
• /
• pp.429-443
• /
• 1997

We consider the problem of obtaining several types of simultaneous confidence bands for the survival curve under the additive risk model. The derivation uses the weak convergence of normalized cumulative hazard estimator to a mean zero Gaussian process whose distribution can be easily approxomated through simulation. The bands are illustrated by applying them from two well-known clinicla studies. Finally, simulation studies are carried outo to compare the performance of the proposed bands for the survival function under the additive risk model.

• Journal of Educational Research in Mathematics
• /
• v.8 no.2
• /
• pp.723-743
• /
• 1998

This study was designed for the purpose of finding some gender differences in the mathematical creative problem-solving ability. For this research, we selected two problems. One is "counting marbles" of algebra, and the other is "drawing figures" of geometry. And we examined and analyzed the written responses of the students with classifying the four categories; fluency, flexibility, originality, and elaboration. These are the factors of the creativity. There were no significant gender differences in the fluency, flexibility, and originality in both problems. but girls got significantly higher scores than boys in elaboration. In conclusion, boys tried unusual and special responses but gave many incorrect and many similiar answers, whereas girls had low scores in high originality but gave less incorrect and less overlapping answers than boys did.swers than boys did.

• Communications of Mathematical Education
• /
• v.24 no.1
• /
• pp.123-143
• /
• 2010

The Skeleton Tower problem is an example of a curriculum that integrates algebra and geometry. Finding the number of the cubes in the tower can be approached in more than one way, such as counting arithmetically, drawing geometric diagrams, enumerating various possibilities or rules, or using algebraic equations, which makes the tasks accessible to students with varied prior knowledge and experience. So, it will be a good topic which can be used in the elementary grades if we exclude the method of using algebraic equations. The purpose of this paper is to propose some points which can be considered with attention by gifted children education teachers by analyzing the 4th Skeleton Tower problem solutions made by 3rd and 4th graders in their selection test who applied for the education of gifted children in math at J University for the year of 2010.

• Journal of The Korean Association of Information Education
• /
• v.21 no.6
• /
• pp.629-638
• /
• 2017

This study investigated the definition and characteristics of computer science problem to be solved through computational thinking. It also explored types and cases of both computer science problems and teaching learning methods to solve computer science problems. Before studying computer science problems, I examined the definition, type, and the importance of problem solving in other subjects. Based on this research, We found that informatics can solve ill-structured problems through computational thinking and the power of computing. This includes counting, decision, retrieval, and optimization problems. Teachers can improve their students' skills in computational thinking, particularly as related to abstraction, automation, and generalization, by choosing the appropriate teaching and learning method or based on the characteristics of the problem.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.2
• /
• pp.293-300
• /
• 2018

We propose a moving object extraction and tracking method for improvement of animal identification and tracking technology. First, we propose a method of merging separated moving objects into a moving object by using FCM (Fuzzy C-Means) clustering algorithm to solve the problem of moving object loss caused by moving object extraction process. In addition, we propose a method of extracting data from a moving object and a method of counting moving objects to determine the number of clusters in order to satisfy the conditions for performing FCM clustering algorithm. Then, we propose a method to continuously track merged moving objects. In the proposed method, color histograms are extracted from feature information of each moving object, and the histograms are continuously accumulated so as not to react sensitively to noise or changes, and the average is obtained and stored. Thereafter, when a plurality of moving objects are overlapped and separated, the stored color histogram is compared with each other to correctly recognize each moving object. Finally, we demonstrate the feasibility and applicability of the proposed algorithms through some experiments.

• Wind and Structures
• /
• v.5 no.6
• /
• pp.527-542
• /
• 2002

Wind-excited vibrations of slender structures can induce fatigue damage and cause structural failure without exceeding ultimate limit state. Unfortunately, the growing importance of this problem is coupled with an evident lack of simple calculation criteria. This paper proposes a mathematical method for evaluating the crosswind fatigue of slender vertical structures, which represents the dual formulation of a parallel method that the authors recently developed with regard to alongwind vibrations. It takes into account the probability distribution of the mean wind velocity at the structural site. The aerodynamic crosswind actions on the stationary structure are caused by the vortex shedding and by the lateral turbulence, both schematised by spectral models. The structural response in the small displacement regime is expressed in closed form by considering only the contribution of the first vibration mode. The stress cycle counting is based on a probabilistic method for narrow-band processes and leads to analytical formulae of the stress cycles histogram, of the accumulated damage and of the fatigue life. The extension of this procedure to take into account aeroelastic vibrations due to lock-in is carried out by means of ESDU method. The examples point out the great importance of vortex shedding and especially of lock-in concerning fatigue.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.10
• /
• pp.615-619
• /
• 2005

Token coherence protocol has many good reasons against snooping/directory-based protocol in terms of latency, bandwidth, and complexity. Token counting easily maintains correctness of the protocol without global ordering of request which is basis of other dominant cache coherence protocols. But this lack of global ordering causes starvation which is not happening in snooping/directory-based protocols. Token coherence protocol solves this problem by providing an emergency mechanism called persistent request. It enforces other processors in the competition (or accessing same shared memory block, to give up their tokens to feed a starving processor. However, as the number of processors grows in a system, the frequency of starvation occurrence increases. In other words, the situation where persistent request occurs becomes too frequent to be emergent. As the frequency of persistent requests increases, not only the cost of each persistent matters since it is based on broadcasting to all processors, but also the increased traffic of persistent requests will saturate the bandwidth of multiprocessor interconnection network. This paper proposes a new request mechanism that defines order of requests to reduce occurrence of persistent requests. This ordering mechanism has been designed to be decentralized since centralized mechanism in both snooping-based protocol and directory-based protocol is one of primary reasons why token coherence protocol has advantage in terms of latency and bandwidth against these two dominant Protocols.