• Communications for Statistical Applications and Methods
• /
• v.8 no.3
• /
• pp.677-683
• /
• 2001

In this paper, optimal block designs for complete diallel crosses are proposed. These optimal block designs for estimating general combining abilities are constructed by using balanced incomplete block designs and nested balanced incomplete block designs. Also, the efficiency of the optimal block design obtained through this method is reported in table.

• Journal of the Korean Statistical Society
• /
• v.11 no.1
• /
• pp.1-11
• /
• 1982

Srivastava and Anderson(1970) illustrate a method of obtaining Balanced (but not orthogonal) Resolution $IV^*$ designs starting with a BIB design. The incidence matrix of a BIB design with parameters (v, b, r, k, and $\lambda$) is utilized to obtain Balanced Resolution $IV^*$ designs with m factors and n=2b runs, where $m \leq v$. In this paper, the same idea is extended to the case of PBIB designs to obtain Partially Balanced Resolution $IV^*$ designs. In the designs obtained here the variances are balanced and the covariances are partially balanced with respect to the main effects. A proof of this property of Partially Balanced Resoultion $IV^*$ designs is given. The efficiency of Partially Balanced Resolution $IV^*$ designs is also considered and examples of Partially Balanced Resoultion $IV^*$ designs are included.

• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.65-71
• /
• 2001

In this paper, optimal block designs for complete diallel crosses are proposed. These optimal block designs are constructed by using triangular partially balanced incomplete designs derived from symmetric balanced incomplete block designs. Also, it is shown that block designs for complete dialle crosses derived from complementary designs of triangular designs are optimal block designs.

• Journal of the Korean Statistical Society
• /
• v.22 no.2
• /
• pp.249-258
• /
• 1993

It is well known that design matrix X for any factorial design can be represented by a product $X = TX_o$ where T is replication matrix and $X_o$ is the corresponding balanced design matrix. Since $X_o$ consists of regular arrangement of 0's and 1's, we can easily find the spectral decomposition of $X_o',X_o$. Also using this we propose an efficient algorithm for computing the orthogonal projection matrix for a balanced factorial design.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.5
• /
• pp.1421-1444
• /
• 2012

Mobile devices such as Android devices are emerging as a convenient client computing device with mobility and context-sensing capability. However, the computing power and hardware resource of the devices are limited due to their small form-factor. Consequently, large-scaled applications could not be deployed on these devices. Nonetheless, if the large-scaled applications are deployed and executed on the devices, high performance of the applications cannot be guaranteed. To remedy the limitation in terms of performance, it is inevitable to let some heavy-weight functionality executed on the server side and let a client application invoke the functionality in the server. To realize this kind of mobile applications, we adopt well-defined architecture design principles; being thin-client, being layered with Model-View-Controller (MVC), and being balanced between client side and server side. By adopting the principles, we propose a unique, ideal and practical architecture for mobile applications, called balanced MVC architecture. By considering the principles, key design considerations of realizing balanced MVC architecture lie in functionality partitioning. Hence, we define key criteria of determining the degree of performance. And, we define a method to design a balanced MVC architecture which embodies functionality partitioning for high performance, and a simulation-based evaluation method of balanced MVC architectures.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1277-1285
• /
• 2003

In this paper, we present a conference key authentication mechanism by employing an algebraic method on IMT-2000 environment. To accomplish this, the symmetric balanced incomplete block design is applied for generating a conference key and then this key is distributed to participants. Through the technique for creation of a conference key and mutual authentications peformed based on identification information, a communication protocol is designed. The protocol proposed minimizes the communication complexity for generating a conference key. On a special case the complexity is O(equation omitted), where v is the number of participants. The security of the mechanism, which is a significant problem in construction of secure systems, can be assured since finding discrete logarithms is generally a hard problem.

• Journal of the Korean Statistical Society
• /
• v.35 no.4
• /
• pp.343-353
• /
• 2006

The two-way balanced one-level rotation design, $r_1^m-r_2^{m-1}$, and the three-way balanced multi-level rotation design, $r_1^m(\iota)-r_1^{m-1}$, were discussed (Park et al., 2001, 2003). Although these rotation designs enjoy balancing properties, they have a restriction of $r_2=c{\cdot}r_1$ (c should be a integer value) which interferes with applying these designs freely to various situations. To overcome this difficulty, we extend the $r_1^m(\iota)-r_1^{m-1}$ design to new one under the most general rotation system. The new multi-level rotation design also satisfies tree-way balancing which is done on interview time, rotation group and recall time. We present the rule and rotation algorithm which guarantee the three-way balancing. In particular, we specify the necessary condition for the extended three-way balanced multi-level rotation sampling design.

• Journal of Korean Society for Quality Management
• /
• v.26 no.4
• /
• pp.239-249
• /
• 1998

In balanced design of experiment sample size is determined to detect a certain standardized size of effect with power 1-$\beta$ at the level of significance $\alpha$. Tables (Marvin, et al (1970) and Lorenzen and Anderson(1993) and charts (Odeh and Fox(1991)) are available to determine the sample size in balanced design of experiments. To simplify those tables and charts simple MATLAB program is used to find the minimal standardized detectable difference $\delta$ when $\alpha , \beta$ and sample size are given.

• Proceedings of the KIEE Conference
• /
• 2007.04c
• /
• pp.129-131
• /
• 2007

In this paper, we research improvement in efficiency of single-phase induction motor by adapting the condition of the balanced and quasi-balanced operation. we maintain turns of auxiliary winding of the motor and adjust resistance and reactance. In this condition, resistance value and copper loss are much gloater. Namely, this is the condition only for balancing MMF without consideration of copper loss of stator winding. To make more practical design, therefore, we will perform winding design which is based on balanced operation condition and applies copper loss minimum. The problem of deterioration of starting torque is completed by rotor bar shape design.

• Journal of the Korean Statistical Society
• /
• v.32 no.3
• /
• pp.245-259
• /
• 2003

The 2-way balanced one-level rotation design has been discussed (Park et al., 2001), where the 2-way balancing is done on interview time in monthly sample and rotation group. We extend it to 3-way balanced multi-level design to obtain more information of the same sample unit for one or more previous months. The 3-way balancing is accomplished not only on interview time in monthly sample and rotation group but also on recall time as well. The 3-way balancing eliminates or reduces any bias arising from unbalanced interview time, rotation group and recall time, and all rotation groups are equally represented in the monthly sample. We present the rule and rotation algorithm which guarantee the 3-way balancing. In particular, we specify the necessary and sufficient condition for the 3-way balanced multi-level rotation design.