• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.1
• /
• pp.35-45
• /
• 2009

In an open environment such as Home Network, ZigBee Cluster comprising a plurality of Ato-cells is required to provide intense security over the movement of collected, measured data. Against this setting, various security issues are currently under discussion concerning master key control policies, Access Control List (ACL), and device sources, which all involve authentication between ZigBee devices. A variety of authentication methods including Hash Chain Method, token-key method, and public key infrastructure, have been previously studied, and some of them have been reflected in standard methods. In this context, this paper aims to explore whether a new method for searching for neighboring devices in order to detect device replications and Sybil attacks can be applied and extended to the field of security. The neighbor detection applied method is a method of authentication in which ACL information of new devices and that of neighbor devices are included and compared, using information on peripheral devices. Accordingly, this new method is designed to implement detection of malicious device attacks such as Sybil attacks and device replications as well as prevention of hacking. In addition, in reference to ITU-T SG17 and ZigBee Pro, the home network equipment, configured to classify the labels and rules into four categories including user's access rights, time, date, and day, is implemented. In closing, the results demonstrates that the proposed method performs significantly well compared to other existing methods in detecting malicious devices in terms of success rate and time taken.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1729-1735
• /
• 2009

The hierarchical routing could cause a lot of energy consumption for transferring data by assigning hierarchical routes although actual nodes could be located in physically near spots. Also, when Node Failure or Association Error occurs, the Hierarchical routing could waste more energy to deliver the control messages. This paper evaluate performance of SHP(Shortest Hop Routing) algorithm that suggests short-cut routing algorithm using NL(Neighbor List) and Redirect_ACK message to improve problem of hierarchical routing algorithm. We do a computer simulation by the size of network, deployment of sensor nodes, sink position and POS. As a result of simulation, SHP has better performance than Zigbee Hierarchical routing and HiLow.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.445-457
• /
• 2009

Recently, there are growing interests in femto-cell for providing indoor users with various broadband multimedia services more efficiently. The technical issues regarding femto-cell such as interference management, self-organization, and resource allocation are now being intensively studied and investigated by researchers worldwide. In this paper, two novel schemes of neighboring cell list(NCL) management are proposed for the IEEE 802.16e system where a macro-cell and huge number of femto-cells coexist. The proposed schemes, named MS location-based neighboring cell list management and BS type-based neighboring cell list management, enable a mobile station(MS) to perform fast scanning and efficient handover by means of preselecting the candidate target femto-cells with high possibility for handover. The simulation result shows that the proposed schemes improve the MS's handover-related performance in terms of scanning power and scanning time compared with the conventional managements scheme of IEEE 802.16e system.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.6
• /
• pp.609-616
• /
• 2016

This paper is proposed a customized market analysis method using SVM and collaborative filtering. The proposed customized market analysis scheme is consists of DC(Data Classification) module, ICF(Improved Collaborative Filtering) module, and CMA(Customized Market Analysis) module. DC module classifies the characteristics of on-line and off-line shopping mall and traditional markets into price, quality, and quantity using SVM. ICF module calculates the similarity by adding age weight and job weight, and generates network using the similarity of purchased item each users, and makes a recommendation list of neighbor nodes. And CMA module provides the result of customized market analysis using the data classification result of DC module and the recommendation list of ICF module. As a result of comparing the proposed customized recommendation list with the existing user based recommendation list, the case of recommendation list using the existing collaborative filtering scheme, precision is 0.53, recall is 0.56, and F-measure is 0.57. But the case of proposed customized recommendation list, precision is 0.78, recall is 0.85, and F-measure is 0.81. That is, the proposed customized recommendation list shows more precision.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.1303-1314
• /
• 2013

An injective coloring of a graph G is an assignment of colors to the vertices of G so that any two vertices with a common neighbor receive distinct colors. A graph G is said to be injectively $k$-choosable if any list $L(v)$ of size at least $k$ for every vertex $v$ allows an injective coloring ${\phi}(v)$ such that ${\phi}(v){\in}L(v)$ for every $v{\in}V(G)$. The least $k$ for which G is injectively $k$-choosable is the injective choosability number of G, denoted by ${\chi}^l_i(G)$. In this paper, we obtain new sufficient conditions to be ${\chi}^l_i(G)={\Delta}(G)$. Maximum average degree, mad(G), is defined by mad(G) = max{2e(H)/n(H) : H is a subgraph of G}. We prove that if mad(G) < $\frac{8k-3}{3k}$, then ${\chi}^l_i(G)={\Delta}(G)$ where $k={\Delta}(G)$ and ${\Delta}(G){\geq}6$. In addition, when ${\Delta}(G)=5$ we prove that ${\chi}^l_i(G)={\Delta}(G)$ if mad(G) < $\frac{17}{7}$, and when ${\Delta}(G)=4$ we prove that ${\chi}^l_i(G)={\Delta}(G)$ if mad(G) < $\frac{7}{3}$. These results generalize some of previous results in [1, 4].

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.3
• /
• pp.409-428
• /
• 1995

Job shop scheduling with m different machines and n different jobs is a NP-hard problem of combinatorial optimization. The purpose of the paper is to develop the heuristic method using tabu search for job shop scheduling to minimize makespan or mean flowtime. To apply tabu search to job shop scheduling problem, in this paper we propose the several move methods that employ insert moves in order to generate the neighbor solutions, and present the efficient rescheduling procedure that yields active schedule for a changed operation sequence by a move of operations. We also discuss the tabu search techniques of diversifying the search of solution space as well as the simple tabu search. By experiments, we find the appropriate tabu list size and tabu attributes, and analyze the proposed tabu search techniques with respect to the quality of solutions and the efforts of computation. The experimental results show that the proposed tabu search techniques using long-term memory function have the ability to search a good solution, and are more efficient in the mean flowtime minimization problem than in the makespan minimization.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.386-388
• /
• 2003

We are developing a web-based movie recommender system that catches and reasons with user profiles and ratings to recommend movies. In the paper, we outline the current status of our implementation with particular emphasis on the mechanisms used to provide effective recommendations. Social recommender systems collect ratings of items from many individuals and use nearest-neighbor techniques to make recommendations to a user. However, these methods only depend on the ratings and ignore other useful information. Our primary concern is to provide an approach that can recommend the movies based on not only the user ratings but also the significant amount of other information that is available about the nature of each items - such as cast list or movie genre. We experimentally evaluate our approach and compare them to conventional social filtering, which suggests merits to our approach.

• Genomics & Informatics
• /
• v.18 no.3
• /
• pp.26.1-26.6
• /
• 2020

Single-cell RNA sequencing (scRNA-seq) has been widely applied to provide insights into the cell-by-cell expression difference in a given bulk sample. Accordingly, numerous analysis methods have been developed. As it involves simultaneous analyses of many cell and genes, efficiency of the methods is crucial. The conventional cell type annotation method is laborious and subjective. Here we propose a semi-automatic method that calculates a normalized score for each cell type based on user-supplied cell type-specific marker gene list. The method was applied to a publicly available scRNA-seq data of mouse cardiac non-myocyte cell pool. Annotating the 35 t-stochastic neighbor embedding clusters into 12 cell types was straightforward, and its accuracy was evaluated by constructing co-expression network for each cell type. Gene Ontology analysis was congruent with the annotated cell type and the corollary regulatory network analysis showed upstream transcription factors that have well supported literature evidences. The source code is available as an R script upon request.

• Journal of Broadcast Engineering
• /
• v.25 no.3
• /
• pp.313-324
• /
• 2020

In this paper, we propose a motion vector prediction method that increases the coding efficiency at the boundary of an image by utilizing the 360 video characteristic. In the current VVC method, the location of a neighbor block is excluded from the candidate list for inter prediction in case that it is out of boundary. This can reduce coding efficiency as well as subject quality. To solve this problem, we construct new candidates adding the location of the neighbor block at the boundary of the picture from already decoded information based on the projection method for 360 video coding. To evaluate the performance of the proposed method, we compare with VTM6.0 and 360Lib9.1 under Random Access condition of JVET-360 CTC. As a result, the coding performance shows a BD-rate reduction of 0.02% on average in luma component and 0.05%, 0.06% on average in chroma components respectively, without additional computational complexity. The coding performance at the picture boundary shows a BD-rate reduction of 0.29% on average in luma component and 0.45%, 0.43% on average in chroma components, respectively. Furthermore, we perform subjective quality test with the DSCQS method and obtain MOS values. The MOS value is improved by 0.03 value, and we calculate BD-MOS using MOS value and bit-rate. As a result, the proposed method improved performance by up to 8.78% and 5.18% on average.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.12
• /
• pp.102-107
• /
• 2009

As technology gets developed, medical equipments are also modernized and leading-edge systems, such as PACS become popular. Many scientists noticed importance of medical image processing technology. Technique of region segmentation is the first step of digital medical image processing. Segmentation technique helps doctors to find out abnormal symptoms early, such as tumors, edema, and necrotic tissue, and helps to diagnoses correctly. Segmentation of white matter, gray matter and CSF of a brain image is very crucial part. However, the segmentation is not easy due to ambiguous boundaries and inhomogeneous physical characteristics. The rate of incorrect segmentation is high because of these difficulties. Fuzzy-based segmentation algorithms are robust to even ambiguous boundaries. In this paper a modified Fuzzy-based segmentation algorithm is proposed to handle the noise of MR scanners. A proposed algorithm requires minimal computations of mean and variance of neighbor pixels to adjust a new neighbor list. With the addition of minimal compuation, the modified FCM(mFCM) lowers the rate of incorrect clustering below 30% approximately compared the traditional FCM.