• Journal of the Korea Society of Computer and Information
• /
• v.14 no.12
• /
• pp.169-180
• /
• 2009

Generally home networks are based on wired network and wireless network. This makes customers be capable of using electric home appliances and full-duplex multimedia services and controlling the machines without any restrictions of place or time. Now that the scope of home security is being extended, the home networks can be formed with not only personal computer but also home automation, electric home appliances, and etc. But this causes many of attacks of invasion and damages. Therefore in this paper we suggest the SSIP(Secure Session Initiate protocol) model for solving those problems. The SSIP model is able to provide an efficient authentication and reduce the time of session re-establishment and set-up by adding ability of SIP authentication to Cluster-to-Cluster environment performed on home gateway.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.6
• /
• pp.619-625
• /
• 2009

FastSLAM which uses the Rao-Blackwellized particle filter is one of the famous solutions to SLAM (Simultaneous Localization and Mapping) problem that estimates concurrently a robot's pose and surrounding environment. However, the particle depletion problem arises from the loss of the particle diversity in the resampling process of FastSLAM. Then, the performance of FastSLAM degenerates over the time. In this work, DIR (Density Information-based Resampling) technique is proposed to solve the particle depletion problem. First, the cluster is constructed based on the density of each particle, and the density of each cluster is computed. After that, the number of particles to be reserved in each cluster is determined using a linear method based on the distance between the highest density cluster and each cluster. Finally, the resampling process is performed by rejecting the particles which are not selected to be reserved in each cluster. The performance of the DIR proposed to solve the particle depletion problem in FastSLAM was verified in computer simulations, which significantly reduced both the RMS position error and the feature error.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.331-338
• /
• 2003

Cluster is the cost-effective parallel processing environment, and consists of the off-the-shelf computers connected by the computer net works. The characteristics of cluster are the node heterogeneity, the variety of node load, and the variety of network load. Because these characteristics influence the performance of parallel program executions, the load sharing for cluster is important, and by using the proper load sharing strategy, we can reduce the execution time of parallel programs. In this paper, we propose modified GSS algorithm, αGSS. In the proposed load sharing algorithms α GSS, the size of tasks are decided using the BogoMIPS of node. From the result of out experiments, we conclude that the proposed αGSS algorithm is effective in the heterogeneous cluster.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.173-181
• /
• 2009

The growth of the World Wide Web and web-based applications is creating demand for high performance web servers to offer better throughput and shorter user-perceived latency. This demand leads to widely used cluster-based web servers in the Internet infrastructure. Load balancing algorithms play an important role in boosting the performance of cluster web servers. Previous load balancing algorithms suffer a significant performance drop under dynamic and database-driven workloads. We propose an estimation-based load balancing algorithm with admission control for cluster-based web servers. Because it is difficult to accurately determine the load of web servers, we propose an approximate policy. The algorithm classifies requests based on their service times and tracks the number of outstanding requests from each class in each web server node to dynamically estimate each web server load state. The available capacity of each web server is then computed and used for the load balancing and admission control decisions. The implementation results confirm that the proposed scheme improves both the mean response time and the throughput of clusters compared to rival load balancing algorithms and prevents clusters being overloaded even when request rates are beyond the cluster capacity.

• Journal of the military operations research society of Korea
• /
• v.6 no.2
• /
• pp.89-127
• /
• 1980

The multivariate analysis techniques of cluster analysis are examined in this article. The theory and applications of the techniques and computer software concerning these techniques are discussed and sample jobs are included. A hierarchical cluster analysis algorithm, available in the IMSL software package, is applied to a set of data extracted from a group of subjects for the purpose of partitioning a collection of 26 attributes of a weapon system into six clusters of superattributes. A nonhierarchical clustering procedure were applied to a collection of data of tanks considering of twenty-four observations of ten attributes of tanks. The cluster analysis shows that the tanks cluster somewhat naturally by nationality. The principal componant analysis and the discriminant analysis show that tank weight is the single most important discriminator among nationality although they are not shown in this article because of the space restriction. This is a part of thesis for master's degree in operations research.

• Journal of computational fluids engineering
• /
• v.6 no.2
• /
• pp.47-55
• /
• 2001

In recent years cluster systems using off-the-shelf processors and networks components have been increasing popular. Since actual performance of a cluster system varies significantly for different architectures, representative in-house codes from major application fields were executed to evaluate the actual performance of systems with different combination of CPU, network, and network topology. As an example of practical CFD(Computational Fluid Dynamics) simulations, the flow past an Onera-M6 wing and the flow past an infinite wing were simulated on clusters of Linux and several other hardware environments.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.3
• /
• pp.471-480
• /
• 2010

Cluster analysis is one of the useful methods to find out number of groups and member’s belongings. With the rapid development of computer application in statistics, variety of new methods in clustering analysis were studied such as EM algorism and Self organization maps. The goals of cluster analysis is finding the number of groupings that are meaningful to me. If data are analyzed perfectly with cluster analysis, we can get the same results from discernment analysis.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.252-257
• /
• 2001

With the help of newly arrived technology such as PC clustering, molecular dynamics (MD) seems to be promising for large-scale materials simulations. A cost-effective cluster is set up using commodity PCs connected over Ethernet with fast switching devices and free software Linux. Executing MD simulations in the parallel sessions makes it possible to carry out large-scale materials simulations at acceptable computation time and costs. In this study, the MD computer code for fracture simulation is modified to comply with MPI (Message Passing Interface) specification, and runs on the PC cluster in parallel mode flawlessly. It is noted that PC clusters can provide a rather inexpensive high-performance computing environment comparing to supercomputers, if properly arranged.

• Biomedical Science Letters
• /
• v.10 no.4
• /
• pp.523-528
• /
• 2004

The core factor of the study is integrated environment based PC-Cluster system and high speed access rate up to 155 Mbps, continuous collection system for bioinformatics information at home and abroad. The results of the study are establishment and stabilization of information and communication infrastructure, establishment and stabilization of high performance computer network up to 155 Mbps, development of PC-Cluster system with 32 nodes, a parallelized BLAST on Cluster system, which can provides scalable speedup in terms of response time, and development of collection and search system for bioinformatics information.

• Journal of information and communication convergence engineering
• /
• v.11 no.4
• /
• pp.241-246
• /
• 2013

A classic document clustering technique may incorrectly classify documents into different clusters when documents that should belong to the same cluster do not have any shared terms. Recently, to overcome this problem, internal and external knowledge-based approaches have been used for text document clustering. However, the clustering results of these approaches are influenced by the inherent structure and the topical composition of the documents. Further, the organization of knowledge into an ontology is expensive. In this paper, we propose a new enhanced text document clustering method using non-negative matrix factorization (NMF) and WordNet. The semantic terms extracted as cluster labels by NMF can represent the inherent structure of a document cluster well. The proposed method can also improve the quality of document clustering that uses cluster labels and term weights based on term mutual information of WordNet. The experimental results demonstrate that the proposed method achieves better performance than the other text clustering methods.