• Proceedings of the Korea Society of Design Studies Conference
• /
• 2001.10a
• /
• pp.12.2-12
• /
• 2001

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.7
• /
• pp.623-628
• /
• 2016

Because the log information provides some critical clues for solving the problem of illegal system access, it is very important for a system administrator to gather and analyze the log data. In a Linux system, the syslog utility has been used to gather various kinds of log data. Unfortunately, there is a limitation that a system administrator should rely on the services only provided by the syslog utility. To overcome this limitation, this paper suggests a syslog agent that allows the system administrator to gather log information for file access that is not serviced by syslog utility. The basic concept of the suggested syslog agent is that after creating a FUSE, it stores the accessed information of the files under the directory on which FUSE has been mounted into the log file via syslog utility. To review its functional validity, a FUSE file system was implemented on Linux (Ubunt 14.04), and the log information of a file access was collected and confirmed.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.101-107
• /
• 2018

Visitors to a Web site leave access logs documenting their activity in the site. These access logs provide a valuable source of information about the visitors' access patterns in the Web site. In addition to the pages that the user visited, it is generally possible to discover the geographical locations of the visitors. Web servers also records other information such as the entry into the site, the URL, the used operating system and the browser, etc. There are several Web mining techniques to extract useful information from such information and visualization of a Web log is one of those techniques. This paper presents a technique as well as a case a study of visualizing a Web log.

• Journal of Advanced Marine Engineering and Technology
• /
• v.40 no.1
• /
• pp.62-68
• /
• 2016

The fingerprint, which is one of the methods of indoor localization using WiFi, has been frequently studied because of its ability to be implemented via wireless access points. This method has low positioning resolution and high computational complexity compared to other methods, caused by its dependence of reference points in the radio map. In order to compensate for these problems, this paper presents a radio map designed algorithm based on the log-distance path loss model fusing a WiFi and BLE fingerprint. The proposed algorithm designs a radio map with variable values using the log-distance path loss model and reduces distance errors using a median filter. The experimental results of the proposed algorithm, compared with existing fingerprinting methods, show that the accuracy of positioning improved by from 2.747 m to 2.112 m, and the computational complexity reduced by a minimum of 33% according to the access points.

• Journal of Information Technology and Architecture
• /
• v.11 no.1
• /
• pp.25-32
• /
• 2014

Web mining techniques are often used to discover useful patterns from data log generated by Web servers for the purpose of web usage analysis. Yet traditional Web mining techniques do not reflect sufficiently sequential properties of Web log data. To address such weakness, we introduce a framework for analyzing Web access log data by using process mining techniques. To illustrate the proposed framework, we show the analysis of Web access log in a campus information system based on the framework and discuss the implication of the analysis result.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.1
• /
• pp.157-163
• /
• 2005

In the Web, the data is generally gathered automatically by Web servers and collected in server or access logs. However, as users access larger and larger amounts of data, query response times to extract information inevitably get slower. A method to resolve this issue is the use of summary tables. In this short note, we design a prototype of summary tables that can efficiently extract information from Web log data. We also present the relative performance of the summary tables against a sampling technique and a method that uses raw data.

• Journal of Computing Science and Engineering
• /
• v.3 no.1
• /
• pp.15-26
• /
• 2009

Given an n-length text T over a $\sigma$-size alphabet, we present a compressed representation of T which supports retrieving queries of rank/select/access and updating queries of insert/delete. For a measure of compression, we use the empirical entropy H(T), which defines a lower bound nH(T) bits for any algorithm to compress T of n log $\sigma$ bits. Our representation takes this entropy bound of T, i.e., nH(T) $\leq$ n log $\sigma$ bits, and an additional bits less than the text size, i.e., o(n log $\sigma$) + O(n) bits. In compressed space of nH(T) + o(n log $\sigma$) + O(n) bits, our representation supports O(log n) time queries for a log n-size alphabet and its extension provides O(($1+\frac{{\log}\;{\sigma}}{{\log}\;{\log}\;n}$) log n) time queries for a $\sigma$-size alphabet.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.2
• /
• pp.47-57
• /
• 2013

Today a lot of functional areas of a firm are operated on the Web. Online shopping malls analyze web log recording customers' activities on the web to connect them to business outcomes. Not only commercial websites, but online news sites also need to collect and analyze web logs to understand their news readers' interest. However, little research has been performed yet. In this research we mined the web access log of an online news website and conduct Market Basket Analysis to uncover the association rules among the categories of news articles. The research is composed of two stages: 1) Identifying the individual session of a visitor; 2) Mining association rule from news articles read by each session. We gather 7-day access logs two times. The results of log mining and meanings of association rules are suggested with managerial implications in conclusion section.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.195-196
• /
• 2014

This paper suggests that all history related to electronic financial transactions should be logged and kept. And, it should be considered to check the details of application access log and major information.

• Journal of the Korean Society for information Management
• /
• v.17 no.2
• /
• pp.139-153
• /
• 2000

This article focuses on a transaction log analysis of the DISCOVER online catalog user interface at Duksung Women's University Library. The results show that the most preferred access point is the title field with rate of 59.2%. The least used access point is the author field with rate of 11.6%. Keyword searching covers only about 16% of all access points used. General failure rate of searching is 13.9% with the highest failure rate of 19.8% in the subject field and the lowest failure rate of 10.9% in author field.