• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.3
• /
• pp.81-89
• /
• 2007

This paper presents a parallel distributed implementation of the GHT (generalized Hough transform) for the fast processing on the MPI-based PC cluster. We tried to achieve the higher speedup mainly by alleviating the communication overhead through the pipelined broadcast and accumulator array partition strategy and by time overlapping of the communication and the computation over entire process. Experimental results show that nearly linear speedup is reachable by the proposed method on the MPI-based PC clusters connected through 100Mbps Ethernet switch.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.534-542
• /
• 2001

Recent content-based image retrieval systems make use of a local single server contained a limited number of images. So these systems are not satisfactory for the Web user's needs that make request for various images on the Web. A content-based image retrieval system that has regard for a great number of Web images has to stand on the basis of real-time first of all. Therefore, to implement the above system we have to resolve a problem of large waste time to take for an image collection and feature extractions. In recent, PC clusters with a load distribution are implemented for the purpose of high-performance data processing. In this paper, we decreased the whole retrieval time by distributing the tasks of image collection and feature extraction to take much time among the slave computers of the PC cluster, and so we found the possibility of the real-time processing in the retrieval of Web images.

• The Bulletin of The Korean Astronomical Society
• /
• v.39 no.2
• /
• pp.58.2-58.2
• /
• 2014

We present the results of the KVN observations of central galaxies in cool-core and non cool-core clusters. The goal is to study how cooling environments affect the AGN activities in the core where their host galaxies are embedded. From the HIghest FLUx Galaxy Cluster Sample (HIFLUGCS), we have selected 19 radio bright AGNs located in the center of clusters with various cooling timescale. In our pilot study, we have obtained 22 and 43 GHz fluxes and morphologies of the sample using the Korean VLBI network. We find that 22/43 GHz fluxes do not strongly depend on the presence of a cool gas flow. However, an intriguing fact is that most AGNs in the cool-core clusters show the hint of a pc-scale jet component while the ones in the non cool-core clusters do not. Based on these results, we discuss the role of cooling flows in the central cluster AGNs and their co-evolution.

• Journal of Food Hygiene and Safety
• /
• v.35 no.5
• /
• pp.430-437
• /
• 2020

This is an approach study on the sensory properties (taste and odor) of 15 types of Korean conventional soups and stews using electronic nose and tongue. The relative sensor intensity for the taste components of the samples using electronic tongue was demonstrated. By SRS (sourness) sensor, sogogi-baechuguk (beef and cabbage soup) had the highest rate of 9.0. The STS (saltiness) sensor showed the highest score of 8.2 for ojingeoguk (squid soup). For the UMS (umami) sensor, which identifies savoriness, the sogogi-baechuguk was the highest at 10.1. The SWS (sweetness) sensors showed relatively little difference, with sigeumchi-doenjangguk (spinach and bean paste soup) at the highest of 7.3. According to the BRS sensor, which tests for bitterness, the siraegi-doenjangguk (dried radish green and bean paste soup) was the highest at 7.8. By principal component analysis (PCA), we observed variances of 56.21% in principal component 1 (PC1) and 25.23% in PC2. For each flavor component, we observed -0.95 and -0.20 for factor loading of PC1 and PC2 for SRS sensors, 0.96 and 0.14 for STS sensors, and -0.94 and 0.22 for PC1 and PC2 for UMS sensors, and PC1 and 0.22 for PC1 and PC2 loading for SWS sensors. The similarity between the samples identified by clustering analysis was largely identified by 4 clusters. A total of 25 kinds of volatile compounds in 15 samples were identified, and the ones showing the highest relative content in all samples were identified as ethanol and 2-methylthiophhene. The main ingredient analysis confirmed variances of 28.54% in PC1 and 20.80% in PC2 as a result of the pattern for volatile compounds in 15 samples. In the cluster analysis, it was found to be largely classified into 3 clusters. The data in this study can be used for a sensory property database of conventional Korean soups and stews using electronic sensors.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.63 no.3
• /
• pp.175-185
• /
• 2018

The aim of this study was to evaluate the variation of growth and quality characteristics in colored rice from 178 accessions and to develop useful, basic rice breeding data by classifying these germplasm characteristics via principal component (PC) analysis. The coefficient of variation of the 178colored rice accessions were the highest for panicle length (PL) and protein contents, followed by length-width ratio (LWR), 1000-grain weight (TGW), culm length (CL), and amylose contents, whereas the lowest was for the number of panicles per hill (NP), which is a yield component. The results from the PC analysis exhibited eigenvalues and contributions respective to each PC as follows: PC1, 2.06 and 29.49%; PC2, 1.31 and 18.75%; PC3, 1.21 and 17.36%; PC4, 1.01 and 14.38%. The eigenvalues of four PCs were over 1.0, and their cumulative contributions were 79.98%, which completes the necessary condition for evaluation of the 178 colored rice accessions. Cluster analysis showed cluster I as the largest, which included 79 accessions, while clusters II, III, IV, V, VI, and VII comprised 46, 19, 13, 4, 8, and 9 accessions, respectively. Moreover, dark brown accessions were dispersed in clusters I and II, and many resources of purple seed coat color were found in clusters V, VI, and VII. Particularly, cluster V had resources of only black and purple seed coat colors. Resources of cluster VII were found to have a relatively small average CL, PL, and LWR; notably, cluster V had the smallest average TGW, and cluster IV the lowest NP but the highest TGW. Finally, considering the yield potential, growth characteristics, heading stage, and color during breeding of colored rice, we obtained the following conclusions: cluster VII is suitable for breeding of colored rice; cross breeding among clusters I, II, and VII has a high yield potential; and it is possible to produce a superior color by cross breeding plants from cluster V and VI.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1658-1666
• /
• 2009

This paper proposes an approach of Mult_HPSO based on the PC cluster system to reduce or remove the stagnation on an early convergence effect of PSO, reduce an execution time and improve a search ability on an optimal solution. Hybrid PSO(HPSO) is combines the PSO(Particle Swarm Optimization) with the mutation of conventional GA(Genetic Algorithm). The conventional PSO has operated a search process in a single swarm. However, Multi_PSO operates a search process through multiple swarms, which increments diversity of expected solutions and reduces the execution time. Multiple Swarms are composed of unsynchronized PC clusters. We apply to SCED(security constrained economic dispatch) problem, a nonlinear optimization problem, which considers line flow constraints and N-1 line contingency constraints. To consider N-1 line contingency in power system, we have chosen critical line contingency through a process of Screening and Selection based on PI(performace Index). We have applied to IEEE 118 bus system for verifying a usefulness of the proposed approaches.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.129-139
• /
• 2003

The PC cluster architecture is considered as a cost-effective alternative to the existing supercomputers for realizing a high-performance information retrieval (IR) system. To implement an efficient IR system on a PC cluster, it is essential to achieve maximum parallelism by having the data appropriately distributed to the local hard disks of the PCs in such a way that the disk I/O and the subsequent computation are distributed as evenly as possible to all the PCs. If the terms in the inverted index file can be classified to closely related clusters, the parallelism can be maximized by distributing them to the PCs in an interleaved manner. One of the goals of this research is the development of methods for automatically clustering the terms based on the likelihood of the terms' co-occurrence in the same query. Also, in this paper, we propose a method for duplicate distribution of inverted index records among the PCs to achieve fault-tolerance as well as dynamic load balancing. Experiments with a large corpus revealed the efficiency and effectiveness of our method.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.221-233
• /
• 2008

In general, we use a Parallel processing computer manufactured specially for the purpose of parallel processing to do high performance computings. But we can depoly and use a PC cluster composed of several common PCs instead of the very expensive parallel processing computer. A common way to get a PC cluster is to adopt the star topology network connected by a switch hub. But in this paper, we grope efficient implementations of hypercube networks based on TCP/IP to connect 8 PCs directly for more useful parallel processing environment, and make evaluations on functionality and efficiency of them using ping, netperf, MPICH. The two proposed methods of implementation are IP configuration based on link and IP configuration based on node. The results of comparison between them show that there is not obvious difference in performance but the latter is more efficient in simplicity of routing table. For verification of functionality, we compare the parallel processing results of an application in them with the same in a star network based PC cluster. These results also show that the proposed hypercube networks support a perfect parallel processing environment respectively.

• Parasites, Hosts and Diseases
• /
• v.60 no.5
• /
• pp.327-338
• /
• 2022

This study determined the recent status and trend of Pneumocystis jirovecii pneumonia (PcP) in the non-human immunodeficiency virus (HIV) (non-HIV-PcP) and HIV (HIV-PcP) infected populations using data from the Health Insurance Review & Assessment Service (HIRA) and the Korea Disease Control and Prevention Agency (KDCA). SaTScan and Join-point were used for statistical analyses. Non-HIV-PcP cases showed an upward trend during the study period from 2010 to 2021, with the largest number in 2021 (551 cases). The upward trend was similar until 2020 after adjusting for the population. Seoul had the highest number of cases (1,597) in the non-HIV-PcP group, which was the same after adjusting for the population (162 cases/1,000,000). It was followed by Jeju-do (89 cases/1,000,000). The most likely cluster (MLC) for the non-HIV-PCP group was Seoul (Relative Risk (RR)=4.59, Log Likelihood Ratio (LLR)=825.531), followed by Jeju-do (RR=1.59, LLR=5.431). An upward trend was observed among the non-HIV-PcP group in the Jeju-do/Jeollanam-do/Jeollabuk-do/Gyeongsangnam-do/Busan/Daejeon/Daegu/Ulsan joint cluster (29.02%, LLR=11.638, P<0.001) located in the southern part of Korea. Both women and men in the non-HIV groups showed an overall upward trend of PcP during the study period. Men in the 60-69 age group had the highest annual percentage change (APC 41.8) during 2014-2019. In contrast, the HIV groups showed a falling trend of PcP recently. Men in the 60-69 age group had the most decrease (APC -17.6) during 2018-2021. This study provides an analytic basis for health measures and a nationwide epidemiological surveillance system for the management of PcP.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.10
• /
• pp.582-588
• /
• 2002

Scalable displays generate large and high resolution images and provide an immersive environment. Recently, scalable displays are built on the networked clusters of PCs, each of which has a fast graphics accelerator, memory, CPU, and storage. However, the distributed rendering on clusters is a network bound work because of limited network bandwidth. In this paper, we present a new algorithm for reducing the network bandwidth and implement it with a conventional distributed rendering system. This paper describes the algorithm called geometry tracking that avoids the redundant geometry transmission by indexing geometry data. The experimental results show that our algorithm reduces the network bandwidth up to 42%.