• Journal of the Korea Society of Computer and Information
• /
• v.19 no.5
• /
• pp.61-69
• /
• 2014

Collaborative filtering recommendation creates similar item subset or similar user subset based on user preference about items and predict user preference to particular item by using them. Thus, if preference matrix has low density, reliability of recommendation will be sharply decreased. To solve these problems we suggest Hybrid Preference Prediction Technique Using Weighting based Data Reliability. Preference prediction is carried out by creating similar item subset and similar user subset and predicting user preference by each subset and merging each predictive value by weighting point applying model condition. According to this technique, we can increase accuracy of user preference prediction and implement recommendation system which can provide highly reliable recommendation when density of preference matrix is low. Efficiency of this system is verified by Mean Absolute Error. Proposed technique shows average 21.7% improvement than Hao Ji's technique when preference matrix sparsity is more than 84% through experiment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.8
• /
• pp.528-537
• /
• 2014

Wireless Sensor Network(WSN) is a network which consists of sensor nodes(SNs) in data collection area. It is hard for the SNs to replace battery. Thus energy and transfer efficiency is important because the energy is limited. In this paper, we propose energy-efficient data collection algorithm for wireless sensor networks by using mobile agent in distance-based cluster structure. For avoid collisions and guarantee low latency, make distance-based topology and build cluster by the topology. For performance comparison of the proposed algorithm, compare with existing mobile agent algorithm. When network constructed by 300 nodes, proposed algorithm has performance increase than existing algorithm(GCF, LCF, TBID) in network lifetime 194, 124.6, 1.46 times each and data merging energy efficiency 87.5%, 85%, 45% each.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2003.05a
• /
• pp.192-197
• /
• 2003

A virtual vessel traffic control system is introduced to contribute to prevent a marine accident, e.g. ship collision or stranding. from happening. The system that comes from VTS limitaions, consists of both data acquisition by satellite remote sensing and a simulation of traffic environment stress (here, INOUE model used) based on the satellite data. Remotely sensed data cab be used to provide timely and detailed information about the marine safety, including the location, speed and direction of ships, and help us operate vessels safely and efficiently. If in the future, e.g. 5-minute after, environmental stress values that a ship may encounter on a voyage can be available, proper actions can be taken to prevent accidents. It lastly can be shown that JERS satellite data are used to track ships and extract their information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.268-275
• /
• 2002

This paper proposes a region-based segmentation algorithm fur extracting a video object by using the cost of potential of frame-difference energies. In the first step of a region-based segmentation using spatial intensity, each frame is segmented into a partition of homogeneous regions finely so that each region does not contain the contour of a video object. The fine partition is used as an initial partition for the second step of spatio-temporal segmentation. In spatio-temporal segmentation, the homogeneity cost for each pair of adjacent regions is computed which reflects the potential between the frame-difference energy on the common contour and the frame-difference energy of the lower potential region of the two. The pair of adjacent regions whose cost is minimal then is searched. The two regions of minimum cost ale merged, which result in updating the partition. The merging is recursively performed until only the contours remain which have Same difference energies of high potential. In the fecal step of post-processing, the video object is extracted removing the contours inside the object.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1317-1327
• /
• 2016

The baggage handling system (BHS) is one of the most complex system in the airport. A highly economical operating system is required to ensure its performance in consideration of its enormous cost on the extension. Furthermore, the inefficient operation deteriorates not only the system performance but the imbalance among the check-in counters because of a bottleneck on the conveyors downstream. The objective of this research is to improve the performance of both the BHS and the check-in area by efficiently controlling the flow in the merging area on the conveyors. Thus, we suggest a control logic of which the concept is borrowed from data networks. The simulation is used to analyze impacts of the conveyors bottleneck on the check-in area and optimize some parameters used in the suggested logic. We also discuss some observations from the simulation results into several aspects of performance measures.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

• Journal of Korean Society of Transportation
• /
• v.34 no.4
• /
• pp.354-372
• /
• 2016

This study identified factors affecting the crash severity at freeway work zones. A nice feature of this study was to take into account the characteristics of work zone traffic management in analyzing traffic safety concerns. In addition to crash records, vehicle detection systems (VDS) data and work zone historical data were used for establishing a dataset to be used for statistical analyses based on an ordered probit model. A total of six safety improvement strategies for freeway work zones, including traffic merging method, guidance information provision, speed management, warning information systems, traffic safety facility, and monitoring of effectiveness for countermeasures, were also proposed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.296-301
• /
• 2007

본 논문은 낸드 플래쉬 디바이스의 고질적인 문제인 마운트 지연시간을 바이트 접근성을 가지는 비휘발성 저장소자를 이용하여 해결하는 기법을 다룬다. 낸드 플래쉬 디바이스를 사용하기 위해서는, 마운트시에 낸드 플래쉬 디바이스의 전 영역에 걸쳐 분산되어 저장되어 있는 메타 데이터를 스캔하여, 해당 파일 시스템 파티션의 사용-구성정보 자료를 주기억장치에 생성해야 한다. 이러한 과정은 대용량 낸드 플래쉬 디바이스를 사용하는 경우 매우 긴 시간을 필요로 하게 되어 실제 환경에서는 낸드 플래쉬 디바이스를 채용하기가 어렵다. 본 논문에서는 차세대 비휘발성 저장장치의 바이트 단위의 접근 가능성을 활용한다. 낸드 플래쉬 디바이스 마운트시에 생성되는 최종 자료구조를 직접 NVRAM에 저장함으로써 낸드 플래실 디바이스의 메타 데이터를 스캔 하는 절차를 완전히 제거하였다. 즉, 낸드 플래처 디바이스의 마운트에 필요한 메타 데이터의 In-memory Data Structure를 NVRAM상에 저장하여 두면 이 후 NVRAM상에는 그 정보가 계속 유지되어 있기 때문에 낸드 플래쉬 디바이스의 마운트 동작은 단순히 Memory Pointer Mapping 정도의 간단하고 빠른 동작만으로도 충분하다. 본 논문에서는 비휘발성 메모리 소자가 블록 디바이스와 메모리 영역에 동시에 사상되어 있는 융합 파일 시스템을 성공적으로 개발하였다. 마운트 시간의 측정결과 효율적인 기존의 낸드 플래쉬 파일 시스템인 YAFFS에 비해 파티션의 크기나 파티션내 File의 개수에 관계없이 그 값이 매우 작고 고정적인 수치를 갖는다는 것을 확인하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.971-978
• /
• 2008

This paper designs a service-oriented wireless sensor network ontology model which can be used as a knowledge base in future ubiquitous computing. In contrast to legacy approaches, this paper defines the new service classes (ServiceProperty, LocationProperty, and PhysicalProperty), as well as their properties and constraints that enable the service-oriented service based on service items. The service item merging between the proposed model and the legacy ontology was processed using the "equivalentClass" object property of OWL. The Protege 3.3.1 and RACER 1.9.0 inference tools were used for the validation and consistency check of the proposed ontology model, respectively, and the results of service query was applied to the newly defined property in SPARQL language without reference to the properties of legacy ontology.

• Korean Journal of Remote Sensing
• /
• v.19 no.2
• /
• pp.135-147
• /
• 2003

This study used the multistage hierarchical clustering image classification to analyze the satellite images for the land-cover types of an area in the Korean peninsula. The multistage algorithm consists of two stages. The first stage performs region-growing segmentation by employing a hierarchical clustering procedure with the restriction that pixels in a cluster must be spatially contiguous, and finally the whole image space is segmented into sub-regions where adjacent regions have different physical properties. Without spatial constraints for merging, the second stage clusters the segments resulting from the previous stage. The image classification of hierarchical clustering, which merges step-by step two small groups into one large one based on the hierarchical structure of digital imagery, generates a hierarchical tree of the relation between the classified regions. The experimental results show that the hierarchical tree has the detailed information on the hierarchical structure of land-use and more detailed spectral information is required for the correct analysis of land-cover types.