• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.671-680
• /
• 1998

Network services, such as teleconferencing, remote diagnostics and education, and CSCW require multicasting. Multicast routing methods can be divided into two categories. One is the shortest path tree method and the other is the minimal Steiner tree method. The latter has an advantage over the former in that only one Steiner tree is needed for a group. However, finding a minimal Steiner tree is an NP-complete problem and it is necessary to find an efficient heuristic algorithm. In this paper, we present an evolutionary optimization method for finding minimal Steiner trees without sacrificing too much computational efforts. In particular, we describe a tree-based genetic encoding scheme which is in sharp constast with binary string representations usually adopted in convetional genetic algorithms. Experiments have been performed to show that the presented method can find optimal Steiner trees for given vetwork configurations. Comparitivie studies have shown that the evolutionary method finds on average a better solution than other conventional heustric algorithms.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.153-162
• /
• 1995

When vector quantization is used in low rate image coding (e.g., R<0.5), the primary problem is the tremendous computational complexity which is required to search the whole codebook to find the closest codevector to an input vector. Since the number of code vectors in a vector quantizer is given by an exponential function of the dimension. i.e., L=2$^{nR}$ where Rn. To alleviate this problem, a multiple shell structure of hypercube feature maps (MSSHFM) is proposed. A binary HFM of k-dimension is composed of nodes at hypercube vertices and a multiple shell architecture is constructed by surrounding the k-dimensional hfm with a (k+1)-dimensional HFM. Such a multiple shell construction of nodes inherently has a complete tree structure in it and an efficient partial search scheme can be applied with drastically reduced computational complexity, computer simulations of still image coding were conducted and the validity of the proposed method has been verified.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.341-350
• /
• 2002

As network environments have been improved and the use of internet has been increased, mobile agent technologies are widely used in the fields of information retrieval, network management, electronic commerce, and parallel/distributed processing. Recently, a lot of researchers have studied the concepts of parallel/distributed processing based on mobile agents. SPMD is the parallel processing method which transmits a program to all the computers participated in parallel environment, and performs a work with different data. Therefore, to transmit fast a program to all the computers is one of important factors to reduce total execution time. In this paper, we consider the parallel environment consisting of mobile agents system, and propose a new method which transmits fast a mobile agent code to all the computers using binomial trees in order to efficiently perform the SPMD parallel processing. The proposed method is compared with another ones through experimental evaluation on the IBM's Aglets, and gets greatly better performance. Also this paper deals with fault tolerances which can be occurred in transmitting a mobile agent using binomial trees.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1180-1192
• /
• 1996

On demand of many users, basic networks of a parallel computer system are required to have a property that can embed various topologies. Bisectional interconnection network is known to satisfy this property, and it can embed various topologies optimally. Nowadays one is very interested in the hypercube as a message pssing multicomputer system, so it is very important to implement a hypercube in bisectional network. In this paper, a hypercube is implemented in a versatile bisecional netork, and its routing and broadcasting algorithm are proposed. Conventional bisectional network can accomodata linear array, complete binary tree and mesh structure as its topology. Now hypercube is implemented to be utilized as a general purpose supercomputercommunication architecture. The proposed routing and broadcasting algorithm embedded in bisectional network are general purpose algorithms which satisfy property of conventional hypercube.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.5
• /
• pp.3-15
• /
• 2003

The secure group communication enables the members, which belong to the same group, to communicate each other in a secure and secret manner. To do so, it is the most important that a group key is securely distributed among them and also group membership is efficiently managed. In detail, the generation, the distribution and the refreshment of a group key would be highly regarded in terms of low communication and computation complexity. In this paper, we show you a new protocol to generate a group key which will be safely shared within a group, utilizing the 2-party Diffie-Hellman key exchange protocol and the complete binary tree. Our protocol has less complexity of computation per group member by substituting many parts of exponentiation computations for multiplications. Consequently, each group member needs constant computations of exponentiation and multiplication regardless of the group size in the protocol and then it has less complexity of the computation than that of any other protocols.

• Journal of Korean Society of Forest Science
• /
• v.47 no.1
• /
• pp.1-15
• /
• 1980

The occurrence of witches' broom of Rhus javanica was first noticed in Korea by the author in 1979. Subsequently, studies were made on the symptomatology, etiology, and transmission of the disease, as well as the effect of some antibiotics on the disease development. The results of these studies are summarized as follows: 1. Symptoms of the infected plant were characterized by dwarfing of the tree accompanied by yellowing and brooming of the foliage. 2. Electron microscopy of witches' broom diseased Rhus javanica plant revealed the occurrence of numerous mycoplasma-like organisms (MLO's) in the phloem tissue cells (sieve tube elements and phloem parenchyma cells) of the rachis and midribs of infected leaves. 3. The MLO's were bounded by a single unit membrane and contained ribosome-like granules and strands presumed to be DNA. It also appears that the MLO multiply possibly by budding as well as binary and plurinary fission. 4. In the midrib of healthy leaves, vascular bundles were collaterally discontinuous. In the diseased leaves, however, xylems were connected to each other and phloem cells showed an atrophy. Granules, which were prominent in the normal abaxial epidermis, were not observed in the peidermis of diseased leaves. 5. Electron microscopy revealed crystals or osmopholic granules in the phloem parenchyma cells, and that normal stacks of grana were not developed in the chloroplasts of infected levels. 6. The disease was experimentally transmitted by grafting. Budding was more effective than crown grafting for transmitting the disease. The disease has been transmitted by grafting even when complete union of stocks and scions has not taken place. The disease agent was not transmitted by sap inoculation. Insect transmission has not been confirmed. 7. Dipping the roots of infected plants into the 500 ppm and 1,000 solutions of either tetracycline HCI or oxytetracycline, HCI was more effective on temporary remision of the symptoms than spraying the 100 ppm and 200 ppm solutions of the same antibiotics. A greater effect was achieved through dipping into 1,000 ppm than into 500 ppm.