• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.95-106
• /
• 2016

In this paper, according to the classical LSQR algorithm forsolving least squares (LS) problem, an iterative method is proposed for finding the minimum-norm pure imaginary solution of the quaternionic least squares (QLS) problem. By means of real representation of quaternion matrix, the QLS's correspongding vector algorithm is rewrited back to the matrix-form algorthm without Kronecker product and long vectors. Finally, numerical examples are reported that show the favorable numerical properties of the method.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.131-134
• /
• 2003

In this paper, we consider the problem of finding the stability region in state space for uncertain linear systems with input saturation. For stability analysis, two Lyapunov functions are chosen. One is for the lineal region and the other is for the saturated legion. Piecewise Lyapunov functions are obtained by solving successive linear matrix inequalites(LMIs) relaxations. A sufficient condition for robust stability is derived in the form of stability region of initial conditions. A numerical example shows the effectiveness of the proposed method.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.195-200
• /
• 2003

Given a positive integer q, the ratio of the 2q-norm of a polynomial which its coefficients form a binary sequence and its 2-norm arose from telecommunication engineering consists of finding any type of such polynomials haying the ratio “small” In this paper we consider some special types of these polynomials, discuss the sharpest possible upper bound, and prove a result for the ratio.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.1-14
• /
• 2012

In this paper, the problem of determining the optimal car-deriving strategy has been examined. In order to find the optimal driving strategy, we have modified a method based on measure theory. Further, we demonstrate that the modified method is an efficient and practical algorithm for dealing with optimal control problems in a canonical formulation.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.500-503
• /
• 1999

In this paper, we analyze weight distributions of neural networks. If we construct a vector containing all weights of a neural network, then training process can be viewed as finding a solution point in the weight space. In order to obtain insight into the training process of neural networks, we investigate the distribution of the solution points in the weight space Experiments provide some interesting results, showing that solution points tend to form clusters in the weight space and the information may be used to speed up the training process.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.5
• /
• pp.1281-1289
• /
• 2016

Richard Stanley suggested the problem of finding combinatorial proofs of formulas for counting regions of certain hyperplane arrangements defined by hyperplanes of the form $x_i=0$, $x_i=x_j$, and $x_i=2x_j$ that were found using the finite field method. We give such proofs, using embroidered permutations and linear extensions of posets.

• The Korean Journal of Financial Management
• /
• v.12 no.2
• /
• pp.221-237
• /
• 1995

When we apply parametric models to the movement of stock prices, we don't know whether they are really correct specifications. In the paper, any prior conditional mean structure is not assumed. By applying the nonparametric model, we see if it better performs (than the random walk model) in terms of out-of-sample prediction. An interesting finding is that the random walk model is still the best. There doesn't seem to exist any form of nonlinearity (not to mention linearity) in stock prices that can be exploitable in terms of point prediction.

• Journal of the Korean Statistical Society
• /
• v.14 no.1
• /
• pp.18-28
• /
• 1985

Optimal screening procedures for improving outgoing product quality based on correlated normal variables are presented. The performance variable and the screening variables are assumed to be jointly normally distributed. These procedures do not require specialized tables, and closed-form solutions are obtained for the case of one-sided specification. Methods for finding optimal solutions for the case of two-sided specifications are also considered.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2000.11a
• /
• pp.25-35
• /
• 2000

A huge amount of financial information in large databases makes performance comparisons among organizations difficult or at least very time-consuming. This paper investigates whether neural networks in the form of self-organizing maps can be effectively employed to perform a competitive benchmarking in large databases. By using self-organizing maps, we expect to overcome problems associated with finding appropriate underlying distributions and functional forms of underlying data. The method also offers a way of visualizing the results. The database in this study consists of annual financial reports of 100 biggest Korean companies over the years 1998, 1999, and 2000.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2277-2279
• /
• 2003

This paper presents a new method for finding the Block Pulse series coefficients and deriving the Block Pulse integration operational matrices which are necessary for the control fields using the Block Pulse functions. This paper presents the method for improving the accuracy of the Block Pulse series coefficients and derives the related integration operational matrices by using the Lagrange second order interpolation polynomial and expands that matrix to general form.