• Communications for Statistical Applications and Methods
• /
• v.17 no.2
• /
• pp.165-181
• /
• 2010

This paper presents some chain ratio-type estimators for estimating finite population variance using two auxiliary variables in two phase sampling set up. The expressions for biases and mean squared errors of the suggested c1asses of estimators are given. Asymptotic optimum estimators(AOE's) in each class are identified with their approximate mean squared error formulae. The theoretical and empirical properties of the suggested classes of estimators are investigated. In the simulation study, we took a real dataset related to pulmonary disease available on the CD with the book by Rosner, (2005).

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.7
• /
• pp.734-743
• /
• 2010

In this paper, we analyzed the EMP coupling for the nonuniform transmission lines, such as twisted cables, using the chain matrix algorithm and the multi-conductor analysis. The BLT method is widely used for the EMP coupling analysis of the transmission line, however, it is difficult to apply to the nonuniform transmission lines. In order to analyze the EMP coupling of nonuniform transmission lines, the whole nonuniform transmission line is divided into incremental uniform line sections of the finite numbers, and the coupling in each small sections is now summed up to get the EMP coupling effect of the entire nonuniform transmission line. To verify the proposed EMP coupling analysis method, the result of the EMP coupling simulation is compared with the solution of BLT equations for a uniform transmission line case. The proposed method is applied to the twisted cable over ground in case of being illuminated by the HEMP in order to analyze the EMP coupling.

• Journal of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1257-1268
• /
• 2018

In this article we first investigate a sort of unit-IFP ring by which Antoine provides very useful information to ring theory in relation with the structure of coefficients of zero-dividing polynomials. Here we are concerned with the whole shape of units and nilpotent elements in such rings. Next we study the properties of unit-IFP rings through group actions of units on nonzero nilpotent elements. We prove that if R is a unit-IFP ring such that there are finite number of orbits under the left (resp., right) action of units on nonzero nilpotent elements, then R satisfies the descending chain condition for nil left (resp., right) ideals of R and the upper nilradical of R is nilpotent.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.153-162
• /
• 2010

The finite buffer GI/G/1/K system is set up by using an unconventional arrangement of the state space, in which the remaining interarrival time or service time is chosen as the level. The stationary distributions of resulting Markov chain can be explicitly determined, and the chain is positive recurrent without any restriction. This is an advantage of this method, compared with that using the elapsed time approach [2].

• IE interfaces
• /
• v.18 no.1
• /
• pp.63-72
• /
• 2005

In this paper, we present a distribution planning method for a supply chain. Like a typical distribution network of manufacturing firms, we have the form of arborescence. To consider more realistic situation, we investigated that an outside supplier has limited capacity. The customer demands are given in deterministic form in finite number of discrete time periods. In this environment, we attempt to minimize the total costs, which is the sum of inventory holding and backorder costs over the distribution network during the planning horizon. To make the best of the restricted capacity, we propose the look-ahead feature. For looking ahead, we convert this problem into a single machine scheduling problem and utilize tabu search approach to solve it. Numerous simulation tests have shown that the proposed algorithm performs quite well.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.171-177
• /
• 1995

Let P be a finite poset and let $\mid$P$\mid$ be the number of vertices in pp. A subposet of P is a subset of P with the induced order. A chain C in P is a subposet of P which is a linear order. The length of the chain C is $\mid$C$\mid$ - 1. A linear extension of a poset P is a linear order $L = x_1, x_2, \ldots, x_n$ of the elements of P such that $x_i < x_j$ is P implies i < j. Let L(P) be the set of all linear extensions of pp. E. Szpilrajn [5] showed that L(P) is not empty.

• Journal of the military operations research society of Korea
• /
• v.17 no.1
• /
• pp.1-24
• /
• 1991

This report concerns the study of deciding replacement requirements for 1/4ton truck in Korea. Two causes of replacement, accidental loss and wearout are considered in the replacement requirements model which was developed in Defence Logistics Agency. The model represents the state of 1/4 ton truck inventory over time as a finite Markov chain process. An accidental loss rate, yearly usage rates. wearout rates are used in conjuction with the current mileage distribution of the inventory to forecast replacement requirements in future time periods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2253-2258
• /
• 2008

To design micro flow sensor varying depending on temperature of driving heater in the detector of Oxide semiconductor, Markov chain MCM(MCMCM), which is a kind of stochastic and microscopic method, was introduced. The formulation for the thermal transfer equation based on the FDM to obtain the MCMCM solution was performed and investigated, in steady state case. MCMCM simulation was successfully applied, so that its application can be expanded to a three-dimensional model with inhomogeneous material and complicated boundary.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.135-138
• /
• 2023

In this paper, we study real-time error in the context of monitoring a binary information source through a delay system. To derive the average real-time error, we model the delay system as a discrete time Geo/D/1/1 queueing model. Using a discrete time three-dimensional Markov chain with finite state space, we analyze the queueing model. We also perform some numerical analysis on various system parameters: state transition probabilities of binary information source; transmission times; and transmission frequencies. When the state changes of the information source are positively correlated and negatively correlated, we investigate the relationship between transmission time and transmission frequency.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.673-689
• /
• 2009

We analyze $MAP_1,\;MAP_2$/G/1 finite queues with service scheduling function dependent upon queue lengths. The customers are classified into two types. The arrivals of customers are assumed to be the Markovian Arrival Processes (MAPs). The service order of customers in each buffer is determined by a service scheduling function dependent upon queue lengths. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, the performance measures such as loss probability and mean waiting time are derived. Some numerical examples also are given with applications in telecommunication networks.