• East Asian mathematical journal
• /
• v.24 no.4
• /
• pp.377-387
• /
• 2008

We consider associative ring R (not necessarily commutative). In this paper the concepts: zero square ring of type-1/type-2, zero square ideal of type-1/type-2, zero square dimension of a ring R were introduced and obtained several important results. Finally, some relations between the zero square dimension of the direct sum of finite number of rings; and the sum of the zero square dimension of individual rings; were obtained. Necessary examples were provided.

• Communications for Statistical Applications and Methods
• /
• v.13 no.2
• /
• pp.429-440
• /
• 2006

In statistical computing, it is often for researchers to need the distribution of a weighted sum of noncentral chi-square variables. In this case, it is very limited to know its exact distribution. There are many works to contribute to this topic, e.g. Imhof (1961) and Solomon-Stephens (1977). Imhof's method gives good approximation to the true distribution, but it is not easy to apply even though we consider the development of computer technology Solomon-Stephens's three moment chi-square approximation is relatively easy and accurate to apply. However, they skipped many details, and their simulation is limited to a weighed sum of central chi-square random variables. This paper gives details on Solomon-Stephens's method. We also extend their simulation to the weighted sum of non-central chi-square distribution. We evaluated approximated powers for homogeneous test and compared them with the true powers. Solomon-Stephens's method shows very good approximation for the case.

• Korean Journal of Mathematics
• /
• v.24 no.1
• /
• pp.71-79
• /
• 2016

In this paper, we determine all positive integers which cannot be represented by a sum of four squares at least 9, and prove that for each N, there are nitely many positive integers which cannot be represented by a sum of four squares at least $N^2$ except $2{\cdot}4^m$, $6{\cdot}4^m$ and $14{\cdot}4^m$ for $m{\geq}0$. As a consequence, we prove that for each $k{\geq} 5$ there are nitely many positive integers which cannot be represented by a sum of k squares at least $N^2$.

• The Mathematical Education
• /
• v.45 no.3 s.114
• /
• pp.315-318
• /
• 2006

In this paper we present the simple updating formulas for a sum of product and a sum of cross product when a new value is added on or a specific value is eliminated from the original data. The sample variance and correlation for the new data set are derived by new computing formulas. Any statistic which is a function of the sum of product and a sum of cross product also can be updated by proposed method even though the original data is not available.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.7
• /
• pp.560-570
• /
• 2013

In this paper, we propose transceiver design strategies for the two-cell multiple-input multiple-output (MIMO) interfering broadcast channel where inter-cell interference (ICI) exists in addition to inter-user interference (IUI). We first formulate the generalized zero-forcing interference alignment (ZF-IA) method based on the alignment of IUI and ICI in multi-dimensional subspace. We then devise a minimum weighted-mean-square-error (WMSE) method based on "regularizing" the precoders and decoders of the generalized ZF-IA scheme. In contrast to the existing weighted-sum-rate-maximizing transceiver, our method does not require an iterative calculation of the optimal weights. Because of this, the proposed scheme, while not designed specially to maximize the sum-rate, is computationally efficient and achieves a faster convergence compared to the known weighed-sum-rate maximizing scheme. Through analysis and simulation, we show the effectiveness of the proposed regularized ZF-IA scheme.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.5
• /
• pp.549-554
• /
• 2011

This paper presents the stabilization method for polynomial fuzzy large-scale system by using output feedback controller. Each sub system of the large-scale system is transformed into polynomial fuzzy model, and then output feedback controller is designed to stabilize the large-scale system. Stabilization condition is derived as sum-of-square (SOS) condition by applying the polynomial Lyapunov function. This condition can be easily solved by SOSTOOLS which is the third party of the MATLAB. From these solutions, output feedback controller gain can be obtained by SOS condition. Finally, a simulation example is presented to illustrate the effectiveness and the suitability of the proposed method.

• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.651-655
• /
• 1996

Lagrange's famous Four Square Theorem [L] says that every positive integer can be represented by the sum of four squares. This marvelous theorem was generalized by Mordell [M1] and Ko [K1] as follows : every positive definite integral quadratic form of two, three, four, and five variables is represented by the sum of five, six, seven, and eight squares, respectively. And they tried to extend this to positive definite integral quadratic forms of six or more variables.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.10 no.3
• /
• pp.1-6
• /
• 1990

The dynamic behaviour of a four-span continuous girder railway bridge subjected to multiple support excitations is investigated using the response spectrum method. Small-amplitude oscillations and linear-elastic material behaviour are assumed. Soil-structure interaction effects are disregarded and only the out-of-plane response of the bridge is considered. The results of the response spectrum analysis are compared with those from a time history analysis. Different combination rules for the superposition of modal maxima as well as supports are employed, such as square-root-of-sum-squares, double sum and p-norm methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2722-2742
• /
• 2014

We propose methods of linear transceiver design for two different power constraints, sum relay power constraint and per relay power constraint, which determine signal processing matrices such as base station (BS) transmitter, relay precoders and user receivers to minimize sum mean square error (SMSE) for multi-relay multi-user (MRMU) networks. However, since the formulated problem is non-convex one which is hard to be solved, we suboptimally solve the problems by defining convex subproblems with some fixed variables. We adopt iterative sequential designs of which each iteration stage corresponds to each subproblem. Karush-Kuhn-Tucker (KKT) theorem and SMSE duality are employed as specific methods to solve subproblems. The numerical results verify that the proposed methods provide comparable performance to that of a full relay cooperation bound (FRCB) method while outperforming the simple amplify-and-forward (SAF) and minimum mean square error (MMSE) relaying in terms of not only SMSE, but also the sum rate.

• Journal of the Korean Mathematical Society
• /
• v.59 no.3
• /
• pp.439-448
• /
• 2022

For a natural number n, let R(n) denote the number of representations of n as the sum of one square and five cubes of primes. In this paper, it is proved that the anticipated asymptotic formula for R(n) fails for at most $O(N^{{\frac{4}{9}+{\varepsilon}})$ positive integers not exceeding N.