• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.139-155
• /
• 2011

In recent years, parents of students and government have been taking a growing interest in education for the gifted students and there are many research reports about the gifted education. Most of the reports, however, focuses on the conceptional feature of the gifted education program such as organization, operation, management, evaluation, etc,. In other words, there are very few researches on instructional materials for gifted students even though the materials is a critical factor for successful education programs. So, this paper introduces a lecture notes used in a personal education for gifted students to contribute in developing education contents in computer science area. The instructional materials titled as "The Necessity and Application of Matrix in Computer Science" is based on linear equation to usher the students into creative problem recognition and groping for solutions. Also, the instructional materials is useful for students to understand the tight mathematics-computer science relationship and the basic concept of liner algebra.

• Communications of Mathematical Education
• /
• v.37 no.1
• /
• pp.65-84
• /
• 2023

The method of Lagrange multipliers, one of the most fundamental algorithms for solving equality constrained optimization problems, has been widely used in basic mathematics for artificial intelligence (AI), linear algebra, optimization theory, and control theory. This method is an important tool that connects calculus and linear algebra. It is actively used in artificial intelligence algorithms including principal component analysis (PCA). Therefore, it is desired that instructors motivate students who first encounter this method in college calculus. In this paper, we provide an integrated perspective for instructors to teach the method of Lagrange multipliers effectively. First, we provide visualization materials and Python-based code, helping to understand the principle of this method. Second, we give a full explanation on the relation between Lagrange multiplier and eigenvalues of a matrix. Third, we give the proof of the first-order optimality condition, which is a fundamental of the method of Lagrange multipliers, and briefly introduce the generalized version of it in optimization. Finally, we give an example of PCA analysis on a real data. These materials can be utilized in class for teaching of the method of Lagrange multipliers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.830-841
• /
• 2000

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at iteration a upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RL algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the (B+1)times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

• Journal of the Korean School Mathematics Society
• /
• v.13 no.3
• /
• pp.357-379
• /
• 2010

There are many studies about the method of trying leveled class because we say the Excellence of Education after high school's Equalization Policy. After the leveled c1ass, Ministry of Education, Science and Tech. announced the induction of leveled classes' evaluation in 2008, it is called that students take classes adapted to their levels. This study illustrates criteria of forming evaluation, it composes leveled assessment tests referenced by Gibb's evaluation effects & Cotton's evaluation principles. Before anything else, this study induced contents of studies which is emphasized the structure rather than the arithmetic that is based on Foucault' s analysis of mathematics' class and examination & MacGregor's point of algebra. Since then we made leveled assessment tests which made by students' Question. And then, In this study, we modified evaluation tests appropriately by criteria of evaluation and analysing the result.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.8
• /
• pp.361-366
• /
• 2017

For two given logical expressions and, when expression contains the same part of the logical expression as expression, substituting for that part of expression is called a substituted logic expression. If a substituted relation is established between the logical expressions, there is an advantage in that the number of literals used in the whole logical expression can be greatly reduced. However, if the substituted relation is not established, there is no simplification effect obtained from the substituted expression. Previous methods proposed a way to find substituted relations between logical expressions for the given logical expressions themselves, and to calculate substituted expressions if only substitution is possible. In this paper, a new method for performing substitution with addition and revision of logic terms is proposed in order to perform substitution, even though there is no substituted relation between two logic expressions. The proposed method is efficiently implemented using a matrix that finds terms to be added. Then, by covering the matrix that has added terms, substituted logic expressions are found. Experiment results show that the proposed method for several benchmark circuits can reduce the number of literals, compared to existing synthesis tools.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10C
• /
• pp.614-620
• /
• 2011

RSA, the most commonly used public-key cryptosystem, is based on the difficulty of factoring very large integers. The fastest known factoring algorithm is the Number Field Sieve(NFS). NFS first chooses two polynomials having common root modulo N and consists of the following four major steps; 1. Polynomial Selection 2. Sieving 3. Matrix 4. Square Root, of which the most time consuming step is the Sieving step. However, in recent years, the importance of the Polynomial Selection step has been studied widely, because one can save a lot of time and memory in sieving and matrix step if one chooses optimal polynomial for NFS. One of the ideal ways of choosing sieving polynomial is to choose two polynomials with same degree. Montgomery proposed the method of selecting two (nonlinear) quadratic sieving polynomials. We proposed two cubic polynomials using 5-term geometric progression.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2008.05a
• /
• pp.2270-2275
• /
• 2008

수문학적 하도추적법의 하나인 Muskingum 모형은 미 육군공병단(U.S. Army Corps of Engineers)에 의해서 미국 Ohio 주의 Muskingum 유역에 홍수조절계획으로 처음 사용되었으며 모형의 구조 및 입력자료의 단순성에 비하여 비교적 우수한 결과를 모의할 수 있는 것으로 알려져 있다. 1938년 McCarthy에 의해서 개발되었고 구간내 총저류량은 prism 저류와 wedge 저류로 구분하여 prism 저류는 유출량에 wedge 저류는 유입량과 유출량의 차에 직접 비례한다는 가정하에 추적식을 개발하였다. 이후 지속적인 연구가 이뤄져 1985년 O'Donnel은 측방유입량(lateral inflow)을 상류단의 유입량에 비례하는 형태로 3-매개변수 muskingum 모형을 제안하여 추적계수의 결정을 선형대수(linear algebra)에서 동차(homogeneous)연립방정식 해를 구하는 Cramer 법칙인 matrix 기법을 적용하였다. 본 연구에서는 홍수사상으로부터 측방유입량이 고려되고 추적계수 결정에 있어서 직접 계산이 가능한 O'Donnel(1985)이 제안한 3-매개변수 muskingum 모형을 적용하였다. 추적계수들의 결정은 직접 matrix 기법을 적용하였고 적용대상은 낙동강 유역의 낙동 지점을 상류단으로 구미 지점을 하류단으로 선정하였다. 홍수사상은 낙동강 유량측정 조사사업 2005년${\sim}$2007년 보고서에 수록된 수문자료를 선정하여 관측치와 계산치를 비교하였고 홍수사상에 적용하여 수문곡선을 추정하였으며, 각각의 매개변수가 추적구간에 어떠한 영향을 미치는지 변수간의 관계를 분석하였다. 또한, 관측치와 계산치의 적합도 검증은 평균제곱근오차(root mean squar error; RMSE)와 모형 효율성 계수(model efficiency; ME)를 산정하여 분석하였으며, 하도 구간내 저류량은 대상구간에 대한 유입량과 유출량의 가중합에 비례한다는 선형모형을 적용하였다.

• Structural Engineering and Mechanics
• /
• v.27 no.6
• /
• pp.713-739
• /
• 2007

Nowadays computers can perform symbolic computations in addition to mere number crunching operations for which they were originally designed. Symbolic computation opens up exciting possibilities in Structural Mechanics and engineering. Classical areas have been increasingly neglected due to the advent of computers as well as general purpose finite element software. But now, classical analysis has reemerged as an attractive computer option due to the capabilities of symbolic computation. The repetitive cycles of simultaneous - equation sets required by the finite element technique can be eliminated by solving a single set in symbolic form, thus generating a truly closed-form solution. This consequently saves in data preparation, storage and execution time. The power of Symbolic computation is demonstrated by six examples by applying symbolic computation 1) to solve coupled shear wall 2) to generate beam element matrices 3) to find the natural frequency of a shear frame using transfer matrix method 4) to find the stresses of a plate subjected to in-plane loading using Levy's approach 5) to draw the influence surface for deflection of an isotropic plate simply supported on all sides 6) to get dynamic equilibrium equations from Lagrange equation. This paper also presents yet another computationally efficient and accurate numerical method which is based on the concept of derivative of a function expressed as a weighted linear sum of the function values at all the mesh points. Again this method is applied to solve the problems of 1) coupled shear wall 2) lateral buckling of thin-walled beams due to moment gradient 3) buckling of a column and 4) static and buckling analysis of circular plates of uniform or non-uniform thickness. The numerical results obtained are compared with those available in existing literature in order to verify their accuracy.

• Smart Structures and Systems
• /
• v.13 no.2
• /
• pp.257-280
• /
• 2014

In this paper, a novel PARAllel FACtor (PARAFAC) decomposition based Blind Source Separation (BSS) algorithm is proposed for modal identification of structures equipped with tuned mass dampers. Tuned mass dampers (TMDs) are extremely effective vibration absorbers in tall flexible structures, but prone to get de-tuned due to accidental changes in structural properties, alteration in operating conditions, and incorrect design forecasts. Presence of closely spaced modes in structures coupled with TMDs renders output-only modal identification difficult. Over the last decade, second-order BSS algorithms have shown significant promise in the area of ambient modal identification. These methods employ joint diagonalization of covariance matrices of measurements to estimate the mixing matrix (mode shape coefficients) and sources (modal responses). Recently, PARAFAC BSS model has evolved as a powerful multi-linear algebra tool for decomposing an $n^{th}$ order tensor into a number of rank-1 tensors. This method is utilized in the context of modal identification in the present study. Covariance matrices of measurements at several lags are used to form a $3^{rd}$ order tensor and then PARAFAC decomposition is employed to obtain the desired number of components, comprising of modal responses and the mixing matrix. The strong uniqueness properties of PARAFAC models enable direct source separation with fine spectral resolution even in cases where the number of sensor observations is less compared to the number of target modes, i.e., the underdetermined case. This capability is exploited to separate closely spaced modes of the TMDs using partial measurements, and subsequently to estimate modal parameters. The proposed method is validated using extensive numerical studies comprising of multi-degree-of-freedom simulation models equipped with TMDs, as well as with an experimental set-up.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.2
• /
• pp.27-38
• /
• 2002

A new self-consistent mathematical model for semiconductor quantum well device was developed. The model was based on the direct solution of the Boltzmann transport equation, coupled to the Schrodinger and Poisson equations. The solution yielded the distribution function for a two-dimensional electron gas(2DEG) in quantum well devices. To solve the Boltzmann equation, it was transformed into a tractable form using a Legendre polynomial expansion. The Legendre expansion facilitated analytical evaluation of the collision integral, and allowed for a reduction of the dimensionality of the problem. The transformed Boltzmann equation was then discretized and solved using sparce matrix algebra. The overall system was solved by iteration between Poisson, Schrodinger and Boltzmann equations until convergence was attained.