• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.256-268
• /
• 2000

Multi-way spatial join is a nested expression of two or more spatial joins. It costs much to process multi-way spatial join, but there have not still reported the scheme of parallel processing of multi-way spatial join. In this paper, parallel processing of multi-way spatial join consists of parallel multi-way spatial filter and parallel spatial refinement. Parallel spatial refinement is executed by the following two steps. The first is the generation of a graph used for reducing duplication of both spatial objects and spatial operations from pairs candidate object table that are the results of multi-way spatial filter. The second is the parallel spatial refinement using that graph. Refinement using the graph is proved to be more efficient than the others. In task creation for parallel refinement, minimum duplication partitioning of the Spatial_Obicct_On_Node graph shows best performance.

• 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.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.269-272
• /
• 2001

Since Multi-way Search Tree reduces the number of the memory access by increasing the branch factor, it is considered a method to archive the high-speed IP address lookup. Using the combination of initial 16 bit may and Multi-way Search Tree, it also reduces the search time of If address lookup. Multi-way Search Tree consists of K keys and K＋1 key pointers. This paper shows how the E update of Multi-way Search Tree which consists of the one pointer within a node can be performed. Using the one pointer within a node, it increases the number of keys within a node and reduces the search time of IP lookup. We also describes IP updating methods such as modification, Insertion and Deletion of address entries. Our update scheme performs better than the method which rebuilds the entire IP routing table when IP update processes.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.811-829
• /
• 2015

One-way authenticated key agreement protocols, aiming at solving the problems to establish secure communications over public insecure networks, can achieve one-way authentication of communicating entities for giving a specific user strong anonymity and confidentiality of transmitted data. Public Key Infrastructure can design one-way authenticated key agreement protocols, but it will consume a large amount of computation. Because one-way authenticated key agreement protocols mainly concern on authentication and key agreement, we adopt multi-server architecture to realize these goals. About multi-server architecture, which allow the user to register at the registration center (RC) once and can access all the permitted services provided by the eligible servers. The combination of above-mentioned ideas can lead to a high-practical scheme in the universal client/server architecture. Based on these motivations, the paper firstly proposed a new one-way authenticated key agreement scheme based on multi-server architecture. Compared with the related literatures recently, our proposed scheme can not only own high efficiency and unique functionality, but is also robust to various attacks and achieves perfect forward secrecy. Finally, we give the security proof and the efficiency analysis of our proposed scheme.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.05a
• /
• pp.19-24
• /
• 2002

The two-way balanced one-level rotation design has been discussed (Park, Kim and Choi, 2001), where the two-way balancing is done on interview time in monthly sample and rotation group. We extend it to three-way balanced multi-level design under the most general rotation system. The three-way balancing is accomplished on interview time not only in monthly sample and rotation group but also in recall time. We present the necessary condition and rotation algorithm which guarantee the three-way balancing. We propose multi-level composite estimators (MCE) from this design and derive their variances and mean squared errors (MSE), assuming the correlation from the measurements of the same sample unit and three types of biases in monthly sample.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.27 no.1
• /
• pp.101-109
• /
• 1999

The purpose of this study is to analyse types and forms of branch-road in traditional korean villages. To do this, this study has selected and measured 87 branch-road cases of five traditional villages. An analysis of the case study has revealed the following results : 1. Branch-roads have four formations : 3 way, 4 way, multi-way and others. 2. Branch-roads comprise 64 percent of 3 way, 18 percent of 4 way, 8 percent of multi-way and 9 percent of others, respectively. 3. Topographic conditions have mostly affected the formation of branch-roads. 3 way of branch - roads are easily found in flat village. 4 way are multi-way of branch-road are found in semi-hilly and hilly village 4. 3 way of branch-roads have three types: T-type, Y-type, and y-type. 5. T-types are easily found in flat village, but Y-type and y-type are found in semi-hilly and hilly village. 6. Each angle of T-type is 171,99,90, respectively. It has turned out 8 degree is slightly deviated form the square. 7. Y-type of branch-road has an asymmetric form, comprising 145, 128, 87 degree of the angle, compared to 150, 150, 60 degree of symmetric one. 8. Average angles of y-type that are mostly found in hilly village are 175, 113, 72. Angle differences from each spot are 62 and 41 degree. It is assumed that 39 degree is a slope of least effort to walk. 9. 4 way of branch-roads have not only "＋" type but various types of K, Y and Y, Y and y, T and y and a foot of bird. 10. It is assumed that multi-way of branch-roads, mostly found on the middle and bottom of the hilly slope, has naturally formed to connect up and down, left and right.and right.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.919-922
• /
• 2013

A MIMO multi-way relay channel with full data exchange in which K users exchange messages with each other via the help of a single relay is considered. For the case in which each link is quasi-static Rayleigh fading and the relay is full-duplex, the fundamental diversity-multiplexing tradeoff (DMT) is investigated, and we show that a compress-and-forward relay protocol can achieve the optimal DMT.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.11
• /
• pp.11-16
• /
• 1993

VLIW architecture capable of testing multiple conditions in a cycle must support an efficient mechanism for multi-way branches. This paper proposes a mechanism to speed up the execution of multi-way branches and an efficient memory packing method of instructions, which reduced the wasted memory space. Also, we develops a new compiler technique which can transform program segments that are not applied to multi-way branches into ones that are applied to multi-way branches. The benefits gained by the transformation are to reduce branch penalty and to increase instruction-level parallelism.

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

Winkler (1990, 2001), Sitter and Skinner (1994), Wilson and Sitter (2002) present a method which applies linear programing to designing surveys with multi-way stratification, primarily in situation where the desired sample size is less than or only slightly larger than the total number of stratification cells. A comparison is made with existing methods both by illustrating the sampling schemes generated for specific examples, by evaluating sample mean, variance estimation, and mean squared errors, and by simulating sample mean for all methods. The computations required can, however, increase rapidly as the number of cells in the multi-way classification increase. In this article their approach is applied to multi-way stratification using real data.