• East Asian mathematical journal
• /
• v.25 no.3
• /
• pp.247-262
• /
• 2009

Permutation and combination are the part of mathematics which can be introduced the pliability and diversity of thought. In prior studies of permutation and combination, there treated difficulties of learning, strategy of problem solving, and errors that students might come up with. This paper provides the method so that meaningful teaching and learning might occur through the systematic approach of permutation and combination. But there were little prior studies treated counting numbers that basic of mathematics' action. Therefore this paper tries to help the understanding of permutation and combination with the process of changing from informal knowledge to formal knowledge.

• 한국상하수도협회지
• /
• s.13
• /
• pp.64-67
• /
• 2006

• 농업기술회보
• /
• v.42 no.1 s.495
• /
• pp.17-20
• /
• 2005

• 농업기술회보
• /
• v.45 no.3
• /
• pp.32-36
• /
• 2008

• 수도
• /
• v.24 no.6 s.87
• /
• pp.64-70
• /
• 1997

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.11
• /
• pp.581-588
• /
• 2007

In Digital Right Management, symmetric cipher is used for content encryption to reduce encryption cost, AES, advanced encryption standard is usually used to multimedia encryption under desktop environment because of its reasonable security level and computation cost. But mobile handheld device often uses slow speed processor and operates under battery-powered environment. Therefore it requires low computation cost and low energy consumption. This paper proposes new stream cipher scheme which combines pseudo random number generator(PRNG) and dynamically generated permutations. Proposed scheme activates PRNG and generates original key streams. Then it generates extended key streams by applying permutation to original sequence. These extended key streams are XORed with plaintext and generate ciphertext. Proposed scheme reduces the usage of PRNG. Therefore this scheme is fast and consumes less energy in comparison with normal stream cipher. Especially, this scheme shows great speed up (almost 2 times) than normal stream cipher scheme in random access.

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.1059-1072
• /
• 2009

In the analysis of microarray data with a small number of arrays, the most important task is the detection of differentially expressed genes by a significance test. For this purpose, one needs to construct a null distribution based on a large number of genes and one of the best way for constructing the null distribution for a small number of arrays is by means of permutation methods. In this paper we propose simple test statistics and permutation methods that are appropriate in constructing the null distribution. In a simulation study, we compare the null distributions generated by the proposed test statistics and permutation methods with the previous ones. With an example microarray data, differentially expressed genes are determined by applying these methods.

• Communications of Mathematical Education
• /
• v.25 no.3
• /
• pp.607-627
• /
• 2011

The purpose of this study is to analyse teaching and learning effects of the structural-mapping used instruction and to find out the characteristics of problem solving process in permutation and combination. For this study, two classes of 11th grade students(67 students) were randomly selected from S high school in D city. One of them was assigned to the experimental group and the other to the control group, respectively. Four lectures of the structural-mapping used instruction were carried out in the experimental group and same amount of lectures of the text book oriented instruction were carried out in the control group. The research findings are as follows. First, the structural-mapping used instruction is shown to be more effective in achievement than the traditional textbook-oriented instruction. Second, the ball-box model is found out to be easier and simpler than the selection-distribution model. Third, students who used the ball-box model are properly able to use both model.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3088-3098
• /
• 1998

The arrangement graph, which is a viable interconnection scheme for parallel and distributed systems, has been proposed as an attactive altemative to the n-cube. However, A fault tolerant design model which is well suitable for the arrangement graph doesn't has been proposd until recently, but fault tolerant design modelsfor many schemes have been proposed ina large number of paper. So, our paper presents a new fault tolerant design technique suited for the arrangement graph. To maintains the previous structures when it ocurs a fault in the current processing, the scheme properly sugbstitutes a fault-componnent into the existing structures by adding a spare component. the first of all, it converts arrangement graph into a circulant graph using the hamiltonian property and then uses automorphism of circulant graph to tolerate faults. Also, We optimize the cost of rate fault tolerant architectures by adding exactly k spare processor while tolerating up to k processor and minimizing the maximum number of limks per processor. Specially, we proposes a new techniue to minimize the maximum number of links.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.133-142
• /
• 2021

Travel pattern recognition is widely used in many aspects such as user trajectory query, user behavior prediction, interest recommendation based on user location, user privacy protection and municipal transportation planning. Because the current recognition accuracy cannot meet the application requirements, the study of travel pattern recognition is the focus of trajectory data research. With the popularization of GPS navigation technology and intelligent mobile devices, a large amount of user mobile data information can be obtained from it, and many meaningful researches can be carried out based on this information. In the current travel pattern research method, the feature extraction of trajectory is limited to the basic attributes of trajectory (speed, angle, acceleration, etc.). In this paper, permutation entropy was used as an eigenvalue of trajectory to participate in the research of trajectory classification, and also used as an attribute to measure the complexity of time series. Velocity permutation entropy and angle permutation entropy were used as characteristics of trajectory to participate in the classification of travel patterns, and the accuracy of attribute classification based on permutation entropy used in this paper reached 81.47%.