• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.1
• /
• pp.74-96
• /
• 2023

At present, the smart grid has become one of the indispensable infrastructures in people's lives. As a commonly used communication method, wireless communication is gradually, being widely used in smart grid systems due to its convenient deployment and wide range of serious challenges to security. For the insecurity of the schemes based on large integer factorization and discrete logarithm problem in the quantum environment, an identity-based key management scheme for smart grid over lattice is proposed. To assure the communication security, through constructing intra-cluster and inter-cluster multi-hop routing secure mechanism. The time parameter and identity information are introduced in the relying phase. Through using the symmetric cryptography algorithm to encrypt improve communication efficiency. Through output the authentication information with probability, the protocol makes the private key of the certification body no relation with the distribution of authentication information. Theoretic studies and figures show that the efficiency of keys can be authenticated, so the number of attacks, including masquerade, reply and message manipulation attacks can be resisted. The new scheme can not only increase the security, but also decrease the communication energy consumption.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.57.1-57.1
• /
• 2021

K-SIM (KASI-Simulation) research project is dedicated to develop new numerical techniques in order to theoretically study galaxy formation and evolution. As the first step of the K-SIM, to model tidal stripping of galaxies with a very high resolution in a fully cosmological context, we invented the Galaxy Replacement Technique (GRT) that is very efficient and fast. The high resolution allows us to accurately resolve the tidal stripping process and well describe the formation of ultra-low surface brightness features in the galaxy cluster (㎶ < 32 mag/arcsec^2), such as the intra-cluster light, shells and tidal streams. I'll introduce how the GRT is designed and which science topics in low-surface brightness regime can be visited using the GRT.

• International Journal of Industrial Entomology and Biomaterials
• /
• v.14 no.1
• /
• pp.23-32
• /
• 2007

The nature of genetic variation and diversity among the 65 multivoltine silkworm genotypes was evaluated for 16 post cocoon characters. The components of genetic variation revealed higher PCV (60.487%) and GCV (44.56%) for evenness (variation 1) followed by cohesion (PCV=55.38%, GCV=40.36%) and non-broken filament length (PCV=32.05%, GCV=31.28%). The higher heritability ($h^2$ in broad sense) was observed for boil-off loss (95.6%) followed by non-broken filament length (95.22%). The both genotypic and phenotypic correlation indicated significant positive correlation of filament length with non-broken filament length, silk recovery, raw silk, neatness, and low neatness; and negative correlation with denier, renditta and silk waste. The principal component analysis (PCA) revealed 75.381 % of total variance from the five principal components extracted. On the basis of Mahalonobis' $D^2$ values (Ward's minimum variance), the sixty-five multivoltine silkworm genotypes were classified in to 9 clusters with substantial inter and intra cluster distances. Number of genotypes included in different clusters varied from 3 to 17. The results indicated that the optimum distance obtained in cluster VII (15.059) along with higher cluster mean values especially for filament length, non broken filament length, renditta, silk recovery, silk waste, and raw silk emphasized the utilization of these genotypes in the conventional silkworm breeding programme for improvement of multivoltine silk fibre quality. The possibility of exploiting genetic variation in post cocoon traits for efficient breeding programme is discussed.

• Journal of Labour Economics
• /
• v.24 no.1
• /
• pp.149-176
• /
• 2001

This paper analyzes job sequences of men and women using optimal matching in order to find patterns of intra-generational mobility in Korean society. Men and women differ in their job careers: men show long-lasting job sequences with few gaps, while women either have short careers or have interrupted careers with long gaps. Long gaps in men's career are limited to those cases in which men move from agricultural to other job. The results from a combination of optimal matching and cluster analysis show that men's job sequences cluster around major occupations while women's cluster in terms of sequence length. The interrupted careers characteristic of women are considered to be consequent on the burdens of house keeping and child raising together with the discrimination against women pursuing careers.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.991-992
• /
• 2006

Multiprocessor system is efficient and high performance architecture to overcome a limitation of single core SoC. In this paper, we propose a multiprocessor SoC (MPSoC) architecture which provides the low complexity and the high performance. The dynamic routing scheme has a serious problem in which the complexity of routing increases exponentially. We solve this problem by making a cluster with several PEs (Processing Element). In inter-cluster network, we use deterministic routing scheme and in intra-cluster network, we use dynamic routing scheme. In order to control the hierarchical network, we propose efficient router architecture by using smart crossbar switch. We modeled 2-D mesh topology and used simulator based on C/C++. The results of this routing scheme show that our approach has less complexity and improved throughput as compared with the pure deterministic routing architecture and the pure dynamic routing architecture.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.17-25
• /
• 2018

Recently, with the development of ICT technology and the rapid spread of smart devices, a huge amount of information is being generated. The recommendation system has helped the informant to judge the information from the information overload, and it has become a solution for the information provider to increase the profit of the company and the publicity effect of the company. Recommendation systems can be implemented in various approaches, but social information is presented as a way to improve performance. However, no research has been done to utilize trust cluster information among users in the recommendation system. In this paper, we propose a method to improve the performance of the recommendation system by using the influence between the intra-cluster objects and the information between the trustor-trustee in the cluster generated in the online review. Experiments using the proposed method and real data have confirmed that the prediction accuracy is improved than the existing methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.792-795
• /
• 2012

애드 혹 네트워크(MANET: Mobile Ad hoc NETworks)는 기본적인 내부구조(infrastructure) 없이 노드들만으로 네트워크 망을 구성한다. 경로 탐색 정책으로 리액티브(reactive) 방식과 프로액티브(proactive) 방식이 있는데, 전통적으로 리액티브 방식의 성능이 더 좋은 것으로 평가된다. 그리고 두가지 방식의 장점을 취합한 하이브리드(hybrid) 방식의 클러스터 토폴로지(cluster topology) 도입에 관한 연구가 이루어지고 있다. 그 중, HCR(Hybrid Cluster Routing)이 제안되었는데, 이는 프로액티브 방식에 보다 중심을 둔 기법이다. HCR 은 리액티브 방식 경로 탐색 방법인 플라딩(flooding)의 탐색 지역을 한정된 범위로 제한할 수 있으나, 프로액티브 방식의 전체 네트워크 구성 정보 유지에 따른 막대한 오버헤드를 발생한다. 본 논문에서는 이러한 오버헤드를 줄이기 위해, 클러스터 내부 경로 탐색 기법인 MICF(Maginot path based Intra Cluster Flooding)를 제안한다. MICF 는 HCR 을 개선한 FSRS(First Search and Reverse Setting) 기반의 기법으로서, 클러스터 내부의 마지노 패스(maginot path)를 기준으로 경로 탐색 지역을 제한한다. MICF 는 게이트웨이(gateway) 간 최단 거리가 항상 클러스터 헤드(cluster head)를 중점으로 원의 내각 지역에 존재함을 바탕으로 하며, 최단 경로의 보장과 플라딩 지역 제한을 동시에 만족한다. 실험 결과, MICF 는 FSRS 기반의 기존 클러스터 내부 플라딩 방식보다 총 에너지의 7.79%만큼 더 에너지를 보존하였다. 결론적으로, MICF 역시 기존의 방식보다 에너지를 더 효율적으로 사용할 수 있으며, 마지노패스 설정과 이를 기반으로 한 제어 과정에 추가적인 오버헤드가 발생하지 않는다. 그리고 플라딩 면적이 작을수록 오버헤드가 줄어들게 됨을 알 수 있다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.1-8
• /
• 2018

K-means algorithm is one of the most popular and widely used clustering method because it is easy to implement and very efficient. However, this method has the limitation to be used with fixed number of clusters because of only considering the intra-cluster distance to evaluate the data clustering solutions. Silhouette is useful and stable valid index to decide the data clustering solution with number of clusters to consider the intra and inter cluster distance for unsupervised data. However, this valid index has high computational burden because of considering quality measure for each data object. The objective of this paper is to propose the fast and simple speed-up method to overcome this limitation to use silhouette for the effective large-scale data clustering. In the first step, the proposed method calculates and saves the distance for each data once. In the second step, this distance matrix is used to calculate the relative distance rate ($V_j$) of each data j and this rate is used to choose the suitable number of clusters without much computation time. In the third step, the proposed efficient heuristic algorithm (Group search optimization, GSO, in this paper) can search the global optimum with saving computational capacity with good initial solutions using $V_j$ probabilistically for the data clustering. The performance of our proposed method is validated to save significantly computation time against the original silhouette only using Ruspini, Iris, Wine and Breast cancer in UCI machine learning repository datasets by experiment and analysis. Especially, the performance of our proposed method is much better than previous method for the larger size of data.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1609-1622
• /
• 2009

In wireless sensor networks, a clustering protocol is an efficient method to prolong network lifetime. In general, it results in more energy consumption at the cluster-head node. Hence, such a protocol must changes the cluster formation and cluster-head node in each round to prolong the network lifetime. But, this method also causes large amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new clustering algorithm. In this algorithm, we exclude duplicated data of adjacent nodes and transmits the threshold value. We define a group as the sensor nodes within close proximity of each other. In a group, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, group is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(group). In the group with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of group size. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.433-441
• /
• 2003

We propose a new resource reservation scheme called MC-HMRSVP(Mobile clustering based-Hierarchical mobile ReSource reserVation Protcol) that is an extension of HMRSVP[3,4]. MC-HMRSVP always establishes a virtual cluster called Mobile Cluster, which includes its immediately adjacent MA(Mobile Agent) for passive reservation as well as the current MA for active reservation to which MH(Mobile Host) belongs. Our scheme also establishes the MC regardless of intra/inter region movement by GMA(Gateway Mobile Agent) function when a MH moves. To provide a general formulation on analyzing the performance in terms of reservation cost, we also model the resource reservation cost by using a simple recursive equation. Then, we show that our scheme decreases the reservation cost in comparison with the existing HMRSVP extentions.