• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.209-212
• /
• 2003

인터넷 서비스 서버들의 가용성과 확장성, 부하분산의 특성들을 가지는 클러스터 시스템에서 성능관리와 이상상황관리를 위해서 본 논문에서는 성능 모니터링을 통하여 클러스터 시스템으로부터 필요한 자료를 수집할 수 있는 구조와 성능 분석을 위한 수집해야하는 정보들의 분석과 수집된 데이터를 분석하기 위한 다양한 분석 방법론을 제시한다. 이러한 성능 분석을 통해 자원사용, 확장성 가용성, 부하분산, 서비스의질, 이상상황 추적 등을 고려하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.274-276
• /
• 2001

기존의 여러 동적 추천 시스템에서 사용자들의 브라우징 패턴을 반영하려고 노력하였다 .그러나 대부분의 동적 추천 시스템들은 웹 문서들의 형식이나 웹 문서들 간의 연관성을 고려하지 않고, 사용자들의 브라우징 패턴에만 근거하기 때문에 연관성이 없거나 의미 없는 웹 문서들에 대한 추천까지 제공하는 문제점을 지니고 있다. 본 논문에서는 웹 문서들 사이의 유사도와 로그 파일 안에 들어있는 사용자들이 패턴을 이용하여 웹 문서 자체의 형식에 따라 연관된 웹 문서뿐만 아니라 순차적인 특성을 가진 웹 문서를 추천 문서로 제공한다. 이때 추천 웹 문서의 형식이 탐색 페이지이면 사용자 브라우징 순차 패턴 DB 중에서 사용자들이 자주 항해하는 순차적인 특성을 갖는 웹 문서까지 제공하는 동적 추천 시스템을 제안한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.187-188
• /
• 2021

본 논문에서는 실시간으로 web-cam을 이용해, 후숙과일의 불량 여부를 판단, 분류하고 불량이 없는 후숙과일의 이미지 분석을 통하여 숙성도 예측하는 시스템을 소개한다. 실시간 다중 객체인식에 탁월한 yolo모델을 활용해, 과일의 불량여부 판단 후 분류하고, 이미지를 획득한 뒤, k-mean clustering 알고리즘을 이용해, 이미지를 segmentation 한다. segmentation된 이미지에 grabcut 알고리즘의 foreground-extraction을 사용해 배경 제거를 한 뒤, cluster의 중심색상값 색상값의 면적%, 전체 면적을 이용해 현재 숙성도를 계산하고 이를 이용해 과일의 후숙 시간 데이터와 비교, 숙성이 완료될 시간을 예측한다. 기존 수작업으로 이루어지고 있는 과일의 분류작업의 인력 감소 및 정확성을 높일 수 있는 알고리즘을 제안한다.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.5
• /
• pp.231-242
• /
• 2016

In order to meet rapid changes of Web information, it is necessary to extend the current Web technologies to represent both the valid time and location of each fact and knowledge, and reason their relationships. Until recently, many researches on qualitative temporal reasoning have been conducted in laboratory-scale, dealing with small knowledge bases. However, in this paper, we propose the design and implementation of a parallel qualitative temporal reasoner, MRQUTER, which can make reasoning over Web-scale large knowledge bases. This parallel temporal reasoner was built on a Hadoop cluster system using the MapReduce parallel programming framework. It decomposes the entire qualitative temporal reasoning process into several MapReduce jobs such as the encoding and decoding job, the inverse and equal reasoning job, the transitive reasoning job, the refining job, and applies some optimization techniques into each component reasoning job implemented with a pair of Map and Reduce functions. Through experiments using large benchmarking temporal knowledge bases, MRQUTER shows high reasoning performance and scalability.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.615-622
• /
• 2006

Caching in a Wireless Internet Proxy Server Cluster Environment has an effect that minimizes the time on the request and response of Internet traffic and Web user As a way to increase the hit ratio of cache, we can use a hash function to make the same request URLs to be assigned to the same cache server. The disadvantage of the hashing scheme is that client requests cannot be well-distributed to all cache servers so that the performance of the whole system can depend on only a few busy servers. In this paper, we propose an improved load balancing scheme using hashing and Round Robin scheme that distributes client requests evenly to cache servers. In the existing hashing scheme, if a hashing value for a request URL is calculated, the server number is statically fixed at compile time while in the proposed scheme it is dynamically fixed at run time using round robin method. We implemented the proposed scheme in a Wireless Internet Proxy Server Cluster Environment and performed experiments using 16 PCs. Experimental results show the even distribution of client requests and the 52% to 112% performance improvement compared to the existing hashing method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.5
• /
• pp.385-392
• /
• 2002

Collaborative filtering method for personalization can suggest new items and information which a user hasn t expected. But there are some problems. Not only the steps for calculating similarity value between each user is complex but also it doesn t reflect user s interest dynamically when a user input a query. In this paper, classifying users by their interest makes calculating similarity simple. We propose the a1gorithm for readjusting user s interest dynamically using the profile and Bayesian learning. When a user input a keyword searching for a item, his new interest is readjusted. And the user s profile that consists of used key words and the presence frequency of key words is designed and used to reflect the recent interest of users. Our methods of adjusting user s interest using the profile and Bayesian learning can improve the real satisfaction of users through the experiment with data set, collected in University s library. It recommends a user items which he would be interested in.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.19-29
• /
• 2010

A marketing model is changed from a customer acquisition to customer retention and it is being moved to a way that enhances the quality of customer interaction to add value to our customers. Such personalization is emerging from this background. The Web site is accelerate the adoption of a personalization, and in contrast to the rapid growth of data, quantitative analytical experience is required. For the automated analysis of large amounts of data and the results must be passed in real time of personalization has been interested in technical problems. A recommendation algorithm is an algorithm for the implementation of personalization, which predict whether the customer preferences and purchasing using the database with new customers interested or likely to purchase. As recommended number of users increases, the algorithm increases recommendation time is the problem. In this paper, to solve this problem, a recommendation system based on clustering and dimensionality reduction is proposed. First, clusters customers with such an orientation, then shrink the dimensions of the relationship between customers to low dimensional space. Because finding neighbors for recommendations is performed at low dimensional space, the computation time is greatly reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4933-4956
• /
• 2016

Use-After-Free (UAF) is a common lethal form of software vulnerability. By using tools such as Web Browser Fuzzing, a large amount of samples containing UAF vulnerabilities can be generated. To evaluate the threat level of vulnerability or to patch the vulnerabilities, automatic deduplication and exploitability determination should be carried out for these samples. There are some problems existing in current methods, including inadequate pertinence, lack of depth and precision of analysis, high time cost, and low accuracy. In this paper, in terms of key dangling pointer and crash context, we analyze four properties of similar samples of UAF vulnerability, explore the method of extracting and calculate clustering eigenvalues from these samples, perform clustering by fast search and find of density peaks on a large number of vulnerability samples. Samples were divided into different UAF vulnerability categories according to the clustering results, and the exploitability of these UAF vulnerabilities was determined by observing the shape of class cluster. Experimental results showed that the approach was applicable to the deduplication and exploitability determination of a large amount of UAF vulnerability samples, with high accuracy and low performance cost.

• The Journal of Information Systems
• /
• v.28 no.3
• /
• pp.39-58
• /
• 2019

Purpose A digital twin is a digital replication of a physical system. Gartner identified the digital twin as one of the Gartner Top 10 Strategic Technology Trend for three years from 2017. The rapid development of the digital twin market is expected to bring about innovation and change throughout society, and much research has been done recently in academia. In this research, we tried to explore the main research trends for digital twin research. Design/methodology/approach We collected the digital twin research from Web of Science, and analyzed 804 articles that was published during time span of 2010-2018. A total of 41 key authors were selected based on the frequency of citation. We created a co-citation matrix for the core authors, and performed multivariate analysis such as cluster analysis and multidimensional scaling. We also conducted social network analysis to find the influential researchers in digital twin research. Findings We identified four major sub- areas of digital twin research: "Infrastructure", "Prospects and Challenges", "Security", and "Smart Manufacturing". We also identified the most influential researchers in digital twin research: Lee EA, Rajkumar R, Wan J, Karnouskos S, Kim K, and Cardenas AA. Limitation and further research suggestion were also discussed as a concluding remarks.

• The Korean Journal of Malacology
• /
• v.26 no.2
• /
• pp.185-188
• /
• 2010

The Web-based the genus Haliotis SNP database was constructed on the basis of Intel Server Platform ZSS130 dual Xeon 3.2 GHz cpu and Linux-based (Cent OS) operating system. Haliotis related sequences (2,830 nucleotide sequences, 9,102 EST sequences) were downloaded through NCBI taxonomy browser. In order to eliminate vector sequences, we conducted vector masking step using cross match software with vector sequence database. In addition, poly-A tails were removed using Trimmest software from EMBOSS package. The processed sequences were clustered and assembled by TGICL package (TIGR tools) equipped with CAP3 software. A web-based interface (Haliotis SNP Database, http://www.haliotis.or.kr) was developed to enable optimal use of the clustered assemblies. The Clustering Res. menu shows the contig sequences from the clustering, the alignment results and sequences from each cluster. And also we can compare any sequences with Haliotis related sequences in BLAST menu. The search menu is equipped with its own search engine so that it is possible to search all of the information in the database using the name of a gene, accession number and/or species name. Taken together, the Web-based SNP database for Haliotis will be valuable to develop SNPs of Haliotis in the future.