• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1601-1611
• /
• 2008

Let X, $X_1$, $X_2$, ... be i.i.d. random variables with zero means, variance one, and set $S_n\;=\;{\sum}^n_{i=1}\;X_i$, $n\;{\geq}\;1$. Gut and $Sp{\check{a}}taru$ [3] established the precise asymptotics in the law of the iterated logarithm and Li, Nguyen and Rosalsky [7] generalized their result under minimal conditions. If P($|S_n|\;{\geq}\;{\varepsilon}{\sqrt{2n\;{\log}\;{\log}\;n}}$) is replaced by E{$|S_n|/{\sqrt{n}}-{\varepsilon}{\sqrt{2\;{\log}\;{\log}\;n}$}+ in their results, the new one is called the moment version of precise asymptotics in the law of the iterated logarithm. We establish such a result for self-normalized sums, when X belongs to the domain of attraction of the normal law.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.338-344
• /
• 1994

Price`s theorem is generalized for general zero memory nonlinear function when input are drawn from a sum, called the constrained non-Gaussian, of two or more mutually independent processes of which the first is the Gaussian. An example is given to illustrate the applicability of the generalization.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.9
• /
• pp.460-466
• /
• 2002

A reliable fault phase selection algorithm plays a very important role in transmission line protection, Particularly in Extra High Voltage (EHV) networks. The conventional fault phase selection algorithm used the phase difference between positive and negative sequence current excluding load current. But, it is difficult to pick out only fault current since we can not know when a fault occurs and select the fault phase in weak-infeed conditions that dominate zero-sequence current in phase current. The proposed algorithm can select the accurately fault phase using the sum of unit vectors which are calculated by positive-sequence voltage and negative-sequence voltage.

• Kyungpook Mathematical Journal
• /
• v.50 no.1
• /
• pp.101-107
• /
• 2010

A module M is said to satisfy the $EC_{11}$ condition if every ec-submodule of M has a complement which is a direct summand. We show that for a multiplication module over a commutative ring the $EC_{11}$ and P-extending conditions are equivalent. It is shown that the $EC_{11}$ property is not inherited by direct summands. Moreover, we prove that if M is an $EC_{11}$-module where SocM is an ec-submodule, then it is a direct sum of a module with essential socle and a module with zero socle. An example is given to show that the reverse of the last result does not hold.

• Journal of the military operations research society of Korea
• /
• v.31 no.1
• /
• pp.1-13
• /
• 2005

Due to the rapid developments in information and computer technology, the warfare paradigm is being transformed into information-centric and knowledge-based warfare. This atmosphere may have significant impact on the ROK armed forces' Force Improvement Plans (FIP) which is documented in 'Defense White Paper 2004'. We focus here on the relationship of information-centric force and deterrence of invasion. Particularly, we are interested in understanding the level of information superiority that might be required to deter the invasion. In order to solve this problem, we employed two-sided, zero-sum strategic game to simulate the outcome with six hypothetical cases devised by varying the level of information superiority.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.3
• /
• pp.159-163
• /
• 2001

An input constrained receding horizon predictive control algorithm for uncertain systems with nonzero set points is proposed. for constant nonzero set points, models with uncertainty can be converted into an augmented incremental system through the use of integrators and the problem is transformed into a zero-state regulation problem for the incremental system. But the original constraints on inputs are converted into constraints on the sum of control inputs at each time instants, which have not been dealt in earlier constrained robust receding horizon control problems. Recursive state bounding technique and worst case minimizing strategy developed in earlier works are applied to the augmented incremental system to yield an offset error free controller. The resulting algorithm is formulated so that it can be solved using LP.

• Journal of Global Scholars of Marketing Science
• /
• v.17 no.4
• /
• pp.91-111
• /
• 2007

Marketing is said to be a zero sum game i.e. each gain of customer for a firm is always at the expense of some other firm's customers. Therefore in a marketplace churn is a natural occurrence. Churn in Indian telecom market is among the highest in growing telecom markets. By using binary logistics regression analysis based models based covering a sample of 822 Indian telecom subscribers; this paper attempts to examine the determinants of churn. The future churn is found to be dependent on satisfaction level of the customer with the service provider, attitude and loyalty of the customer variables, intended churn (i.e. intention to churn) and current loyalty (defined as intention to recommend) and distraction (i.e. intention to experiment).

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2005.11a
• /
• pp.57-58
• /
• 2005

Recently the telematics system is used widely. Users want to high quality communications. Since the primary advantage of using an array is to enhance a desired signal and reject jamming interferences, array signal processing is essential to satisfy unmet demand of user. In general, beamforming is a spatial filtering operation performed on the data received by an array of sensors. So we propose the beamformer design that use FPGA for real time processing. And we use zero-padding interpolation for high resolution data.

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

Let {$X_{ni}$, $i{\geq}1$, $n{\geq}1$} be an array of rowwise and pairwise negatively quadrant dependent random variables with mean zero, {$a_{ni}$, $i{\geq}1$, $n{\geq}1$} an array of weights and {$b_n$, $n{\geq}1$} an increasing sequence of positive integers. In this paper we consider some results concerning complete convergence of ${\sum}_{i=1}^{bn}a_{ni}X_{ni}$.

• Journal of the Korean Society for Railway
• /
• v.8 no.2
• /
• pp.137-144
• /
• 2005

The possibility of resonance exists always in railway bridges unlike highway bridges because railway bridges are loaded repeatedly by specific trains which has equidistant wheel loads. Resonance phenomenon of the bridge can be broken out when exciting frequencies by tram determined from the speed and effective beating internal coincides with natural frequencies of the bridge Excessive fluctuations of dynamic displacements and accelerations by resonance cause unpleasant passenger comfort and instability of railway structures. On the other hand, resonance suppression phenomenon that all the previous loads which pass through the bridge sum to zero can be occurred. In case we apply this resonance suppression properly, design of stable railway bridge from dynamics point of view can be made. In the present study, most dominant beating internal of conventional trams will be find. A(ter that. specific span length of the bridge which derives resonance suppression can be selected for railway bridges which accomplishes superior dynamic behavior.