• Proceedings of the Korea Contents Association Conference
• /
• 2017.05a
• /
• pp.453-454
• /
• 2017

The travellers using social media leave their location history in the form of trajectories. These trajectories can be bridged for acquiring information, required for future recommendation for the future travelers, who are new to that location, providing all sort of information. In this paper, we propose a personalized travel path recommendation scheme based on social life log. By taking advantage of two kinds of social media such as travelogue and community contributed photos, the proposed scheme can not only be personalized to user's travel interest but also be able to recommend a travel path rather than individual Points of Interest (POIs). It also maps both user's and routes' textual descriptions to the topical package space to get user topical package model and route topical package model (i.e., topical interest, cost, time and season).

• ETRI Journal
• /
• v.21 no.2
• /
• pp.31-39
• /
• 1999

Given two sorted lists A=(a0, a1, ${\cdots}$,a${\ell}$-1}) and B=(b0, b1, ${\cdots}$, bm-1), we are to merge these two lists into a sorted list C=(c0,c1, ${\cdots}$, cn-1), where n=${\ell}$+m. Since this is a fundamental problem useful to solve many problems such as sorting and graph problems, there have been many efficient parallel algorithms for this problem. But these algorithms cannot be performed efficiently in the postal model since the communication latency ${\lambda}$, which is of prime importance in this model, is not needed to be considered for those algorithms. Hence, in this paper we propose an efficient merge algorithm in this model that runs in $$2{\lambda}{\frac{{\log}n}{{\log}({\lambda}+1)}}+{\lambda}-1$$ time by using a new property of the bitonic sequence which is crucial to our algorithm. We also show that our algorithm is near-optimal by proving that the lower bound of this problem in the postal model is $f_{\lambda}({\frac{n}{2}})$, where $${\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}{\le}f_{\lambda}({\frac{n}{2}}){\le}2{\lambda}+2{\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}}$$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.331-338
• /
• 2011

Objectives of shipboard integration networks are to exchange and manage integrated information. Shipboard integration networks use UDP(User Datagram Protocol) multicast for the exchange of information. However, such information can be missed or damaged because UDP can't guarantee reliability. The standard of shipboard integration networks defines error log functions for the missed or damaged information. In this paper, we analyze internal and external log functions. The internal log function records errors internally, and the external log function sends error messages to a log server and records them in a database. We also develop a log processing module and log server for the external log function.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.6 no.1
• /
• pp.37-44
• /
• 2013

In this paper, we propose the pulmonary nodule detection system based on voxel classification. The proposed system consists of three main steps. In the first step, we segment lung volume. In the second step, the lung structures are initially segmented. In the last step, we classify the nodules using voxel classification. To describe characteristics of each voxel, we extract the log-polar sampling based features. Support Vector Machine is applied to the extracted features to classify into nodules and non-nodules.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.175-185
• /
• 2009

In this paper, performance of OFDM systems with turbo code is analyzed and simulated in a satellite broadcasting channel. The performance is evaluated in terms of bit error probability. The satellite channel is modeled as a combination of Rayleigh fading with shadowing and Rician fading channels. As turbo decoding algorithms, MAP (maximum a posteriori), Max-Log-MAP, and SOVA (soft decision Viterbi output) algorithms are chosen and their performances are compared. From simulation results, it is demonstrated that Max-Log-MAP algorithm is promising in terms of performance and complexity. It is shown that performance is substantially improved by increasing the number of iterations and interleaver length of a turbo encoder. The results in this paper can be applied to OFDM-based satellite broadcasting systems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.177-182
• /
• 2021

Generally, the linear programming (LP) with O(n⁴) time complexity is applied to mixture optimization problem that can be produce the given ingredients grade product with minimum cost from mixture of various raw materials. This paper suggests heuristic algorithm with O(n log n) time complexity to obtain the solution of this problem. The proposed algorithm meets the content range of the components required by the alloy steel plate while obtaining the minimum raw material cost, decides the quantity of raw material that is satisfied with ingredients grade for ascending order of unit cost. Although the proposed algorithm applies simple decision technique with O(n log n) time complexity, it can be obtains same solution as or more than optimization technique of linear programing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.2
• /
• pp.430-435
• /
• 2007

In this paper, we propose an intelligent deployment of sensor network for reliable communication. The proposed method determines optimal transmission range based on the wireless channel characteristics, and searches the optimal number of sensor nodes, and optimal locations with SOFM. We calculate PRR against a distance uses the log-normal path loss model, and decide the communication range of sensor node from PRR. In order to verify the effectiveness of the proposed method, we performed simulations on the searching for intelligent deployment and checking for link condition of sensor network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.2
• /
• pp.382-389
• /
• 2018

Recently cyber attacks can cause serious damage on various information systems. Log data analysis would be able to resolve this problem. Security log analysis system allows to cope with security risk properly by collecting, storing, and analyzing log data information. In this paper, a security log analysis system is designed and implemented in order to analyze security log data using the Logstash in the Elasticsearch, a distributed search engine which enables to collect and process various types of log data. The Kibana, an open source data visualization plugin for Elasticsearch, is used to generate log statistics and search report, and visualize the results. The performance of Elasticsearch-based security log analysis system is compared to the existing log analysis system which uses the Flume log collector, Flume HDFS sink and HBase. The experimental results show that the proposed system tremendously reduces both database query processing time and log data analysis time compared to the existing Hadoop-based log analysis system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.1-8
• /
• 2019

Among the methods for extracting the most appropriate information from a large amount of log data, there is a method using inductive inference. In this paper, we use SVM (Support Vector Machine), which is an excellent classification method for inductive inference, in order to determine the ranking of intrusion logs in digital forensic analysis. For this purpose, the logs of the training log set are classified into intrusion logs and normal logs. The associated words are extracted from each classified set to generate a related word dictionary, and each log is expressed as a vector based on the generated dictionary. Next, the logs are learned using the SVM. We classify test logs into normal logs and intrusion logs by using the log set extracted through learning. Finally, the recommendation orders of intrusion logs are determined to recommend intrusion logs to the forensic analyst.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.11
• /
• pp.2381-2390
• /
• 2011

This paper presents the effective and detailed secure monitoring method being used based on Secure OS. For this, the detailed secure log of process, object, user's command and database query in task server are collected by 3 kinds of log collecting module. The log collecting modules are developed by ourselves and contained as constituents of security system. Secure OS module collects process and system secure log of objective unit, Backtracker module collects user's command session log, SQLtracker module collects database query in details. When a system auditor monitors and traces the behaviour of specified user or individual user, the mutual connection method between the secure logs can support detailed auditing and monitering effectively.