• Journal of applied mathematics & informatics
• /
• v.15 no.1_2
• /
• pp.457-466
• /
• 2004

Let{$X_{ni}$\mid$\;1\;{\leq}\;i\;{\leq}\;k_n,\;n\;{\geq}\;1$} be an array of rowwise negatively associated random variables such that $P$\mid$X_{ni}$\mid$\;>\;x)\;=\;O(1)P($\mid$X$\mid$\;>\;x)$ for all $x\;{\geq}\;0,\;and\; \{k_n\}\;and\;\{r_n\}$ be two sequences such that $r_n\;{\geq}\;b_1n^r,\;k_n\;{\leq}\;b_2n^k$ for some $b_1,\;b_2,\;r,\;k\;>\;0$. Then it is shown that $\frac{1}{r_n}\;max_1$\mid${\Sigma_{i=1}}^j\;X_{ni}$\mid$\;{\rightarrow}\;0$ completely convergence and the strong convergence for weighted sums of N A arrays is also considered.

• Journal of the Korea Convergence Society
• /
• v.10 no.5
• /
• pp.341-349
• /
• 2019

The purpose of this study is to analyze the problems facing the youth soccer league(i-league) and present their development directions. The study method used focus group interviews. The results of the study are summarized into three: First, promotion and regional league operation were highlighted as problems of i-League and the solution was the unification system of the Korean Olympic Committee(KOC) and the Korea Football Association(KFA), and the operation of each region by itself. Second, issues resulting from the integration of youth club league and i-league were revealed as level differences by teams and leak of the motivation for winning. Operation of the elevating system was proposed as a solution, and such as fare play team award, voluntary activity team award will derive important virtues for youth. Third, KOC and KFA need additional support for various environments and administrative areas such as facility security, training for leaders and officials, and registration of players.

• Fashion Information and Technology
• /
• v.5
• /
• pp.54-63
• /
• 2008

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.28 no.7
• /
• pp.70-78
• /
• 2010

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.12
• /
• pp.1067-1074
• /
• 2007

A temperature preconditioning that modulates the derivative of density with respect to temperature is proposed to improve the convergence characteristics of the preconditioned Euler equations. Flows in a two-dimensional channel with a 10% circular bump in the middle of the channel were calculated at different speeds. The numerical dissipation terms of the Roe’s FDS scheme according to the temperature preconditioning are derived. It is shown that the temperature preconditioning accelerates convergence of the preconditioned Euler equations.

• Communications for Statistical Applications and Methods
• /
• v.16 no.3
• /
• pp.549-556
• /
• 2009

Let $\{(X_{ni}|1{\leq}i{\leq}n,\;n{\geq}1)\}$ be an array of rowwise negatively associated random variables. In this paper we discuss $n^{{\alpha}p-2}h(n)max_{1{\leq}k{\leq}n}|{\sum}_{i=1}^kX_{ni}|/n^{\alpha}{\rightarrow}0$ completely as $n{\rightarrow}{\infty}$ under not necessarily identically distributed with suitable conditions for ${\alpha}$>1/2, 0${\alpha}p{\geq}1$ and a slowly varying function h(x)>0 as $x{\rightarrow}{\infty}$. In addition, we obtain the complete convergence of moving average process based on negative association random variables which extends the result of Zhang (1996).

• Journal of the Korean Statistical Society
• /
• v.33 no.3
• /
• pp.271-282
• /
• 2004

We discuss complete convergence of weighted sums for arrays of ø-mixing random variables. As application, we obtain the complete convergence of moving average processes for ø-mixing random variables. The result of Baum and Katz (1965) as well as the result of Li et al. (1992) on iid case are extended to ø-mixing setting.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.3
• /
• pp.467-482
• /
• 2010

For a double array of random elements {$V_{mn};m{\geq}1,\;n{\geq}1$} in a real separable Banach space, some mean convergence theorems and weak laws of large numbers are established. For the mean convergence results, conditions are provided under which $k_{mn}^{-\frac{1}{r}}\sum{{u_m}\atop{i=1}}\sum{{u_n}\atop{i=1}}(V_{ij}-E(V_{ij}|F_{ij})){\rightarrow}0$ in $L_r$ (0 < r < 2). The weak law results provide conditions for $k_{mn}^{-\frac{1}{r}}\sum{{T_m}\atop{i=1}}\sum{{\tau}_n\atop{j=1}}(V_{ij}-E(V_{ij}|F_{ij})){\rightarrow}0$ in probability where {$T_m;m\;{\geq}1$} and {${\tau}_n;n\;{\geq}1$} are sequences of positive integer-valued random variables, {$k_{mn};m{{\geq}}1,\;n{\geq}1$} is an array of positive integers. The sharpness of the results is illustrated by examples.

• Journal of Digital Convergence
• /
• v.13 no.7
• /
• pp.177-182
• /
• 2015

In a MPC(Multi-Pulse Coding) using excitation source of voiced and unvoiced, it would be a distortion of voice waveform. This is caused by normalization of synthesis speech waveform of voiced in the process of restoration. To solve this problem, this paper present APC-MPC of amplitude-position compensation in a multi-pulses each pitch interval in order to reduce distortion of synthesis waveform. Also, I was implemented that the APC-MPC in coding system. And I evaluate the SNRseg of APC-MPC in 8kbps coding condition of convergence system. As a result, SNRseg of APC-MPC was 13.9dB for female voice and 14.3dB for male voice respectively. And so, I expect to be able to this method for cellular phone and smart phone using excitation source of low bit rate.

• Journal of Korea Multimedia Society
• /
• v.25 no.11
• /
• pp.1643-1652
• /
• 2022

Most of the existing machine reading research has used Recurrent Neural Network (RNN) and Convolutional Neural Network (CNN) algorithms as networks. Among them, RNN was slow in training, and Question Answering Network (QANet) was announced to improve training speed. QANet is a model composed of CNN and self-attention. CNN extracts semantic and syntactic information well from the local corpus, but there is a limit to extracting the corresponding information from the global corpus. Graph Convolutional Networks (GCN) extracts semantic and syntactic information relatively well from the global corpus. In this paper, to take advantage of this strength of GCN, we propose I-QANet, which changed the CNN of QANet to GCN. The proposed model performed 1.2 times faster than the baseline in the Stanford Question Answering Dataset (SQuAD) dataset and showed 0.2% higher performance in Exact Match (EM) and 0.7% higher in F1. Furthermore, in the Korean Question Answering Dataset (KorQuAD) dataset consisting only of Korean, the learning time was 1.1 times faster than the baseline, and the EM and F1 performance were also 0.9% and 0.7% higher, respectively.