• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1239-1244
• /
• 2001

The Virtual Interface Architecture (VIA) is usually suggested as a new standard high-performance communication of the cluster systems. However the VIA specification aims for platform independence, the current Intel VI Provider Library (VIPL) design favors systems with Intel architecture processors running the Windows operating system (OS). This paper aims for clarifying the guesstion problem of VIA and VIPL in the newtrul time of CPU Architecture and OS further more, It suggests the solution aiming the communication in the other CPU or OS

• The Journal of the Korea Contents Association
• /
• v.5 no.5
• /
• pp.33-42
• /
• 2005

In this paper, we propose a new training algorithm for improving pattern classification performance of ART neural network. The proposed train algorithm restricts unnecessary cluster generation and transition, applies the location extraction algorithm, and operates the reset system based on the agreement between the present learning pattern and the initial pattern. As a result, repetitive input of a pattern does not generate a new cluster and mis-recognition rate decreases.

• Journal of the Korean Vacuum Society
• /
• v.2 no.2
• /
• pp.171-180
• /
• 1993

X-ray photoelectron diffraction (XPD) is used to characterize the crystallographically cleaved GaAs(110) surface. By using polar and azimuthal scans of the usual angle-resolved x-ray photoelectron spectroscopy, we get the reconstruction geometry of the clean GaAs(110) surface from the intensity ratio of Ga 3d core-level peaks. The reconstruction parameters are determined by fitting the diffraction pattern with the single scattering cluster (SSC) model, and the results show similar tendencies to those obtained by other techniques.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.04a
• /
• pp.61-68
• /
• 2001

A parallel nonlinear analysis program of prestressed concrete frame is migrated on a PC cluster system and a massively parallel processing system, CRAY T3E system, using MPI. The PC cluster system is configured with Pentium Ⅲ class PCs and fast ethernet. The CRAY T3E system is composed of a set of nodes each containing one Processing Element (PE), a memory subsystem and its distributed memory interconnect network. Parallel computing algorithms are implemented on element-wise processing parts including the calculation of stiffness matrix, element stresses and determination of material states, check of material failure and calculation of unbalanced loads. Parallel performance of the migrated program is evaluated through typical numerical examples.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2812-2821
• /
• 1997

In this paper, we presents performance analysis of a location registration protocol using cluster concept to minimize the number of location registrations caused by reduction of cell size and explosive increasement of wireless communication subscribers. We analyze the relationship between the size of cluster and the location registration rate, and finally we apply this analysis to the hexagonal cell structure for justification.

• Journal of Korean Society of Forest Science
• /
• v.86 no.2
• /
• pp.146-157
• /
• 1997

To investigate the structure and the conservation strategy of Korean native species, Abies koreana forest at Cheonwangbong-Deokpyungbong area in Chirisan National Park, 48 plots($10{\times}10m$) were set up with random sampling method. Three groups - Abies koreana community, Abies koreana-Quercus mongolica community, Picea jezoensis-Betula ermanii community - were classified by cluster analysis. High positive correlations were shown between Picea jezoensis and Sorbus commixta : Quercus mongodica and Fraxinus sieboldiana, Symplocos chinensis : Euonymus macroptera and Vaccinium koreanum, and high negative correlations were shown between Quereus mongolica and Sorbus commixta. Species diversity(H') of investigated area was calculated 0.7208-1.2074. Vigor of Abies koreana was depressed, 12.24 of total number of Abies koreana investigated were dead. DBH of dead individuals ranged mainly 10-30cm.

• Journal of the Korean Academic Society of Industrial Cluster
• /
• v.1 no.1
• /
• pp.16-28
• /
• 2007

This paper analyzes the effects of networking and competition on individual companies' R&D investment, focusing on pharmaceuticals, PCB (Printed Circuit Board), and auto parts sectors. Data were obtained through a survey on firms operating in Seoul, Incheon, and Gyung-gi metropolitan area. The estimation results suggest the networking with other actors in the clusters tends to increase R&D investments of individual firm's. But competition in a cluster tend to reduce individual firm's R&D investment. These results suggest the public policy promoting networking in a cluster could induce private firms' R&D investments and, therefore, should be maintained.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.779-788
• /
• 2002

There are many technically difficult issues in searching multimedia data such as image, video and audio because they are massive and more complex than simple text-based data. As a method of searching multimedia data, a similarity retrieval has been studied to retrieve automatically basic features of multimedia data and to make a search among data with retrieved features because exact match is not adaptable to a matrix of features of multimedia. In this paper, data clustering and its indexing are proposed as a speedy similarity-retrieval method of multimedia data. This approach clusters similar images on adjacent disk cylinders and then builds Indexes to access the clusters. To minimize the search cost, the hashing is adapted to index cluster. In addition, to reduce I/O time, the proposed searching takes just one I/O to look up the location of the cluster containing similar object and one sequential file I/O to read in this cluster. The proposed schema solves the problem of multi-dimension by using clustering and its indexing and has higher search efficiency than the content-based image retrieval that uses only clustering or indexing structure.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1458-1466
• /
• 2011

Recently the research on GPGPU has been carried out actively as the performance of GPUs has been increased rapidly. In this paper, we propose the system architecture by benchmarking the existing supercomputer architecture for a cost-effective system using GPUs in low-cost graphics devices and implement a GPU cluster system with eight GPUs. We also make the software development environment that is suitable for the GPU cluster system and use it for the performance evaluation by implementing the n-body problem. According to its result, we found that it is efficient to use multiple GPUs when the problem size is large due to its communication cost. In addition, we could calculate up to eight million celestial bodies by applying the method of calculating block by block to mitigate the problem size constraint due to the limited resource in GPUs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1514-1523
• /
• 2009

It is well known that the current wireless sensor networks addressing methods do not work efficiently in networks more than a few hundred nodes. A standard protocol in ZigBee-Standard feature in ZigBee 2007 gives balanced tree based address assignment method with distributed manner. However, it was limited to cover less than hundreds of sensor nodes due to the wasteful use of available address space, because composed sensor networks usually make an unbalanced tree topology in the real deployment. In this paper, we proposed the hierarchical cluster tree based address assignment method to support large and scalable networks. This method provides unique address for each node with distributed manner and supports hierarchical cluster tree on-demand. Simulation results show that the proposed method reduces orphan nodes due to the address exhaustion and supports larger network with limited address space compared with the ZigBee distributed address assignment method defined in ZigBee-Standard feature in ZigBee 2007.