• Journal of Intelligence and Information Systems
• /
• v.18 no.2
• /
• pp.177-192
• /
• 2012

This is a study of match-making systems that considers the mutual satisfaction of matching partners. Recently, recommendation systems have been applied to people recommendation, such as recommending new friends, employees, or dating partners. One of the prominent domain areas is match-making systems that recommend suitable dating partners to customers. A match-making system, however, is different from a product recommender system. First, a match-making system needs to satisfy the recommended partners as well as the customer, whereas a product recommender system only needs to satisfy the customer. Second, match-making systems need to include as many participants in a matching pool as possible for their recommendation results, even with unpopular customers. In other words, recommendations should not be focused only on a limited number of popular people; unpopular people should also be listed on someone else's matching results. In product recommender systems, it is acceptable to recommend the same popular items to many customers, since these items can easily be additionally supplied. However, in match-making systems, there are only a few popular people, and they may become overburdened with too many recommendations. Also, a successful match could cause a customer to drop out of the matching pool. Thus, match-making systems should provide recommendation services equally to all customers without favoring popular customers. The suggested match-making system, called Mutually Beneficial Matching (MBM), considers the reciprocal satisfaction of both the customer and the matched partner and also considers the number of customers who are excluded in the matching. A brief outline of the MBM method is as follows: First, it collects a customer's profile information, his/her preferable dating partner's profile information and the weights that he/she considers important when selecting dating partners. Then, it calculates the preference score of a customer to certain potential dating partners on the basis of the difference between them. The preference score of a certain partner to a customer is also calculated in this way. After that, the mutual preference score is produced by the two preference values calculated in the previous step using the proposed formula in this study. The proposed formula reflects the symmetry of preferences as well as their quantities. Finally, the MBM method recommends the top N partners having high mutual preference scores to a customer. The prototype of the suggested MBM system is implemented by JAVA and applied to an artificial dataset that is based on real survey results from major match-making companies in Korea. The results of the MBM method are compared with those of the other two conventional methods: Preference-Based Matching (PBM), which only considers a customer's preferences, and Arithmetic Mean-Based Matching (AMM), which considers the preferences of both the customer and the partner (although it does not reflect their symmetry in the matching results). We perform the comparisons in terms of criteria such as average preference of the matching partners, average symmetry, and the number of people who are excluded from the matching results by changing the number of recommendations to 5, 10, 15, 20, and 25. The results show that in many cases, the suggested MBM method produces average preferences and symmetries that are significantly higher than those of the PBM and AMM methods. Moreover, in every case, MBM produces a smaller pool of excluded people than those of the PBM method.

• Journal of Intelligence and Information Systems
• /
• v.24 no.1
• /
• pp.183-203
• /
• 2018

News articles are the most suitable medium for examining the events occurring at home and abroad. Especially, as the development of information and communication technology has brought various kinds of online news media, the news about the events occurring in society has increased greatly. So automatically summarizing key events from massive amounts of news data will help users to look at many of the events at a glance. In addition, if we build and provide an event network based on the relevance of events, it will be able to greatly help the reader in understanding the current events. In this study, we propose a method for extracting event networks from large news text data. To this end, we first collected Korean political and social articles from March 2016 to March 2017, and integrated the synonyms by leaving only meaningful words through preprocessing using NPMI and Word2Vec. Latent Dirichlet allocation (LDA) topic modeling was used to calculate the subject distribution by date and to find the peak of the subject distribution and to detect the event. A total of 32 topics were extracted from the topic modeling, and the point of occurrence of the event was deduced by looking at the point at which each subject distribution surged. As a result, a total of 85 events were detected, but the final 16 events were filtered and presented using the Gaussian smoothing technique. We also calculated the relevance score between events detected to construct the event network. Using the cosine coefficient between the co-occurred events, we calculated the relevance between the events and connected the events to construct the event network. Finally, we set up the event network by setting each event to each vertex and the relevance score between events to the vertices connecting the vertices. The event network constructed in our methods helped us to sort out major events in the political and social fields in Korea that occurred in the last one year in chronological order and at the same time identify which events are related to certain events. Our approach differs from existing event detection methods in that LDA topic modeling makes it possible to easily analyze large amounts of data and to identify the relevance of events that were difficult to detect in existing event detection. We applied various text mining techniques and Word2vec technique in the text preprocessing to improve the accuracy of the extraction of proper nouns and synthetic nouns, which have been difficult in analyzing existing Korean texts, can be found. In this study, the detection and network configuration techniques of the event have the following advantages in practical application. First, LDA topic modeling, which is unsupervised learning, can easily analyze subject and topic words and distribution from huge amount of data. Also, by using the date information of the collected news articles, it is possible to express the distribution by topic in a time series. Second, we can find out the connection of events in the form of present and summarized form by calculating relevance score and constructing event network by using simultaneous occurrence of topics that are difficult to grasp in existing event detection. It can be seen from the fact that the inter-event relevance-based event network proposed in this study was actually constructed in order of occurrence time. It is also possible to identify what happened as a starting point for a series of events through the event network. The limitation of this study is that the characteristics of LDA topic modeling have different results according to the initial parameters and the number of subjects, and the subject and event name of the analysis result should be given by the subjective judgment of the researcher. Also, since each topic is assumed to be exclusive and independent, it does not take into account the relevance between themes. Subsequent studies need to calculate the relevance between events that are not covered in this study or those that belong to the same subject.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.11
• /
• pp.879-894
• /
• 2013

Recently, due to a explosive growth in the mobile Internet traffic, the problem of excessive data traffic handling on core network and thus scalability problem have been magnified in 3GPP LTE/SAE networks. Current LTE/SAE network based on the central P-GW (PDN Gateway) used as mobility anchor cannot deal with such demand for exponentially increasing mobile Internet traffic. In this paper, we propose a new LTE/SAE network architecture supporting distributed P-GWs and corresponding distributed mobility management to solve these problems. For this, in addition to the deployment of such distributed P-GWs, we propose a dynamic and distributed mobility management by distributing MMEs (Mobility Management Entities) which dynamically manages the location information of a UE's PDN connection, and also propose a handover procedure of such PDN connections by using the proposed distributed P-GWs and MMEs. The performance of the proposed dynamic and distributed LTE/SAE network system is compared with the current LTE/SAE network system in terms of handover latency and network throughput.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.33-49
• /
• 2003

Recently, there have been large storage demands for manipulating multimedia data. To solve the tremendous storage demands, one of the major researches is the SAN(Storage Area Network) that provides the local file requests directly from shared-disk storage and also eliminates the server bottlenecks to performance and availability. SAN also improve the network latency and bandwidth through new channel interface like FC(Fibre Channel). But to manipulate the efficient storage network like SAN, traditional local file system and distributed file system are not adaptable and also are lack of researches in terms of a metadata structure for large-scale inode object such as file and directory. In this paper, we describe the architecture and design issues of our shared-disk file system and provide the efficient bitmap for providing the well-formed block allocation in each host, extent-based semi flat structure for storing large-scale file data, and two-phase directory structure of using Extendible Hashing. Also we describe a detailed algorithm for implementing the file system's device driver in Linux Kernel and compare our file system with the general file system like EXT2 and shard disk file system like GFS in terms of file creation, directory creation and I/O rate.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.31-38
• /
• 2011

A RAM-based Neural Net is a weightless neural network based on binary neural network. 3-D neural network using this paper is binary neural network with multiful information bits and store counts of training. Recognition method by MRD technique is based on the supervised learning. Therefore neural network by itself can not distinguish between the categories and well-separated categories of training data can achieve only through the performance. In this paper, unsupervised learning algorithm is proposed which is trained existing 3-D neural network without distinction of data, to distinguish between categories depending on the only input training patterns. The training data for proposed unsupervised learning provided by the NIST handwritten digits of MNIST which is consist of 0 to 9 multi-pattern, a randomly materials are used as training patterns. Through experiments, neural network is to determine the number of discriminator which each have an idea of the handwritten digits that can be interpreted.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.84-91
• /
• 2011

Recently, WBAN(Wireless Body Area Network) which has progressed standardization based on IEEE 802.15.6 standardization is a network for the purpose of the short-range wireless communications within around 3 meters from the inner or outer human body. Effective QoS control technique and data efficient management in limited bandwidth such as audio and video are important elements in terms of users and loads in short-range wireless networks. In this paper, for high-speed WBAN IEEE 802.15.6 standard, the dynamic allocation to give an efficient bandwidth management and weighted fair queueing algorithm have been proposed through the adjustment of the super-frame about limited data and Quality of Service (QoS) based on the queuing algorithm. Weighted Fair Queueing(WFQ) Algorithm represents the robust performance about elements to qualitative aspects as well as maintaining fairness and maximization of system performance. The performance results show that the dynamic allocation expanded transmission bandwidth five times and the weighted fair queueing increased maximum 24.3 % throughput and also resolved delay bound problem.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.5
• /
• pp.495-503
• /
• 2014

In recent days, a study of the intrusion detection system collecting and analyzing network data, packet or logs, has been actively performed to response the network threats in computer security fields. In particular, Bayesian network has advantage of the inference functionality which can infer with only some of provided data, so studies of the intrusion system based on Bayesian network have been conducted in the prior. However, there were some limitations to calculate high detection performance because it didn't consider the problems as like complexity of the relation among network packets or continuos input data processing. Therefore, in this paper we proposed two methodologies based on K-menas clustering to improve detection rate by reforming the problems of prior models. At first, it can be improved by sophisticatedly setting interval range of nodes based on K-means clustering. And for the second, it can be improved by calculating robust CPT through applying weighted-leaning based on K-means clustering, too. We conducted the experiments to prove performance of our proposed methodologies by comparing K_WTAN_EM applied to proposed two methodologies with prior models. As the results of experiment, the detection rate of proposed model is higher about 7.78% than existing NBN(Naive Bayesian Network) IDS model, and is higher about 5.24% than TAN(Tree Augmented Bayesian Network) IDS mode and then we could prove excellence our proposing ideas.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2004.03a
• /
• pp.599-605
• /
• 2004

기존의 구축된 GIS 컴포넌트 혹은 개발 중이거나 향후개발을 목표로 설계단계에 있는 컴포넌트들의 최종 목표는 재사용성과 상호운용성의 가능성 여부이다. 하지만 컴포넌트 개발에 있어 시스템 개발환경의 다양성으로 인하여 그 재활용성은 생각만큼 쉬운 작업이 아니며, 특히 공간정보를 다루고 있는 GIS(Geographic Information System)분야에서의 GIS 컴포넌트 재활용은 전 세계의 산재한 각 데이터형의 포맷, 개발 환경, 운영환경을 고려하여 볼 때 시급한 일임에도 불구하고 그에 대한 노력이 상당히 미진한 실 정 이 다. 본 논문에서는 GIS 애플리케이션을 보다 효율적이고 유용하게 개발하기 위하여 GIS 컴포넌트의 개발과 관리에 이르는 전 과정을 관리 감독할 수 있는 COGIS(Component Oriented Geographic Information System)을 제안하고, COGIS 프로세스의 가이드라인이며 GIS 컴포넌트의 기능적인 면을 정의하기 위한 GCA(GIS based Component Architecture) 아키텍처를 제안하였다. 아울러 GIS 컴포넌트의 메타데이터를 분류 및 정의하여 GIS 컴포넌트의 비 기능적면을 제시하고 이를 이용하여 웹 기반 GIS 컴포넌트 등록/검색 에이전트 시스템을 개발하였으며 기존 GIS 컴포넌트 재사용 및 확장, 신규 컴포넌트의 등록, 검색이 가능하도록 한다. 사례연구로 웹 상에서 산불 발생 위험지수 표출을 위한 GIS 공간 분포도 작성이 쉽게 이루어지도록 2FDRV.avx와 2FDRC.exe 컴포넌트를 개발하였으며, COGIS 프로세스의 컴포넌트 관리방법을 통하여 여러 관련 컴포넌트를 조합함으로써 웹 기반 산불위험지수예보시스템을 구축하였다.입력 근거의 확보’, ‘갱신주체별 역할의 정의 및 유지관리 기준의 설정’, ‘분야별업무 특성을 고려한 관련 기준의 마련 및 타 시스템과 연계되는 항목을 고려한 절차 정의’ 등에 대한 다양한 접근을 시도하였다. 본 연구에서 제시하는 유지관리 모델을 기반으로 각 지자체별로 적절한 컨설팅이 진행되고 이에 따라 담당자의 실천이 이루어진다면 지자체 GIS의 투자대비 효과에 대한 기대는 이상이 아닌 현실로 다가오게 될 것이다.가오게 될 것이다. 동일하게 25%의 소유권을 가지고 있다. ？스굴 시추사업은 2008년까지 수행될 계획이며, 시추작업은 2005년까지 완료될 계획이다. 연구 진행과 관련하여, 공동연구의 명분을 높이고 분석의 효율성을 높이기 위해서 시료채취 및 기초자료 획득은 4개국의 연구원이 모여 공동으로 수행한 후의 결과물을 서로 공유하고, 자세한 전문분야 연구는 각 국의 대표기관이 독립적으로 수행하는 방식을 택하였다 ？스굴에 대한 제1차 시추작업은 2004년 3월 말에 실시하였다. 시추작업 결과, 약 80m의 시추 코아가 성공적으로 회수되어 현재 러시아 이르쿠츠크 지구화학연구소에 보관중이다. 이 시추코아는 2004년 8월 중순경에 4개국 연구팀원들에 의해 공동으로 기재된 후에 분할될 계획이다. 분할된 시료는 국내로 운반되어 다양한 전문분야별 연구에 이용될 것이다. 한편, 제2차 시추작업은 2004년 12월에서 2005년 2월 사이에 실시될 계획이다. 수백만년에 이르는 장기간에 걸쳐 지구환경변화 기록이 보존되어 있는 ？스굴호에 대한 시추사업은 후기 신생대 동안 유라시아 대륙 중부에서 일어난 지구환경 및 기후변화를 이해함과 동시에 이러한 변화가 육상생태계 및 지표지질환경에 미친 영향을 이해하는데 크게 기여할 것이다.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.99-112
• /
• 2015

Datum point for displaying location and altitude of point has being advantage usefully in various measurement parts. However, datum point has been increasing loss cases owing to weather changes and stratum changes and neglecting meaninglessly. In this paper, we design and implement a multi electronic measurement system monitoring software with functions such as include maximize utilization of existing measurement datum system as well as collected various environment data and detection stratum changes of surround area. Proposed software is implemented to support that reusability and extensibility of software using object oriented modeling method. Our software supports a GUI for electronic measurement datum point administrator as well as for web user and mobile user. Our system can support a graph GUI for various data analysis and reposition in realtime to database that measured location information and various sensing information to prevent loss of electronic measurement datum point and to detected stratum changes. In addition, we include a QR code and RFID recognition function. Finally, we suggest performance evaluation result to confirm stratum changes detection and GPS location error rate.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.5
• /
• pp.59-69
• /
• 2011

Since power analysis attack which uses a characteristic that power consumed by crypto device depends on processed data has been proposed, many logics that can block these correlation originally have been developed. DRP logic has been adopted by most of logics maintains power consumption balanced and reduces correlation between processed data and power consumption. However, semi-custom design is necessary because recently design circuits become more complex than before. This design method causes unbalanced design pattern that makes DRP logic consumes unbalanced power consumption which is vulnerable to power analysis attack. In this paper, we have developed new logic style which adds another discharge phase to discharge two output nodes at the same time based on DyCML to remove this unbalanced power consumption. Also, we simulated 1bit fulladder to compare proposed logic with other logics to prove improved performance. As a result, proposed logic is improved NED and NSD to 60% and power consumption reduces about 55% than any other logics.