• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.18 no.2
• /
• pp.141-159
• /
• 2007

The purpose of this study was to try to conceptualize the Folksonomy, so called collaborative taggng or bookmarking and suggest its application on the Web information services. This paper explores how folksonomies could be used in web information services to enable end users to manage personal information spaces, get helped existing controlled vocabularies, and create and share their interests in online communities. Traditional classification system and philosophical issues on Folksonomy were reviewed in this paper in the context of internet based information and its services. The benefits and shortcomings of folksonomies are discussed. Some of the customizable features in existing library catalogue systems are reviewed to suggest other applicable features for web information services.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.101-108
• /
• 1998

Recently, growing Internet traffic have come to mandate the speed-up of Internet links. Also, emerging real-time services generally require QoS (Quality of Service) guarantees in networks. ATM is considered to be the most promising subnetwork technology to meet these requirements efficiently. In this paper, we first analyze recent protocol standardization activities in IETF and ATM Forum for integrating Internet with ATM. This includes brief reviews of protocols such as IETF's IP/ATM, NHRP, RSVP and IS/ATM, as well as ATM Forum's LAN Emulation and MPOA. We then identify two types of integration methodologies, and suggest a classification of the integration. Our work might be helpful to outlook better the future direction of standardization in this field.

• Journal of KIISE:Information Networking
• /
• v.37 no.3
• /
• pp.175-186
• /
• 2010

Due to the emergence of new application programs and the fast growth of Internet users, Internet routers are required to provide the quality of services according to the class of input packets, which is identified by wire-speed packet classification. For a pre-defined rule set, by performing multi-dimensional search using various header fields of an input packet, packet classification determines the highest priority rule matching to the input packet. Efficient packet classification algorithms have been widely studied. Tuple pruning algorithm provides fast classification performance using hash-based search against the candidate tuples that may include matching rules. Bloom filter is an efficient data structure composed of a bit vector which represents the membership information of each element included in a given set. It is used as a pre-filter determining whether a specific input is a member of a set or not. This paper proposes new tuple pruning algorithms using Bloom filters, which effectively remove unnecessary tuples which do not include matching rules. Using the database known to be similar to actual rule sets used in Internet routers, simulation results show that the proposed tuple pruning algorithm provides faster packet classification as well as consumes smaller memory amount compared with the previous tuple pruning algorithm.

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.127-135
• /
• 2020

The purpose of this study is to develop a human activity recognition (HAR) system, which distinguishes 13 activities, including five activities commonly dealt with in conventional HAR researches and eight activities from the Eastern-Asian culture. The eight special activities include floor-sitting/standing, chair-sitting/standing, floor-lying/up, and bed-lying/up. We used a 3-axis accelerometer sensor on the wrist for data collection and designed a machine learning model for the activity classification. Data clustering through preprocessing and feature extraction/reduction is performed. We then tested six machine learning algorithms for recognition accuracy comparison. As a result, we have achieved an average accuracy of 99.7% for the 13 activities. This result is far better than the average accuracy of current HAR researches based on a smartwatch (89.4%). The superiority of the HAR system developed in this study is proven because we have achieved 98.7% accuracy with publically available 'pamap2' dataset of 12 activities, whose conventionally met the best accuracy is 96.6%.

• Journal of the Korea Convergence Society
• /
• v.8 no.2
• /
• pp.27-33
• /
• 2017

To efficiently provide cloud computing services to users over the Internet, IT resources must be configured in the data center based on virtualization and distributed computing technology. This paper focuses specifically on the problem that new training data can be added at any time in a wide range of fields, and new attributes can be added to training data at any time. In such a case, rule generated by the training data with the former attribute set can not be used. Moreover, the rule can not be combined with the new data set(with the newly added attributes). This paper proposes further development of the new inference engine that can handle the above case naturally. Rule generated from former data set can be combined with the new data set to form the refined rule.

• Journal of Internet Computing and Services
• /
• v.4 no.5
• /
• pp.69-76
• /
• 2003

In this paper we show a new learning algorithm for pattern classification. This algorithm considered a scheme to find a solution to a problem of incremental learning algorithm when the structure becomes too complex by noise patterns included in learning data set. Our approach for this problem uses a pruning method which terminates the learning process with a predefined criterion. In this process, an iterative model with 3 layer feedforward structure is derived from the incremental model by an appropriate manipulations. Notice that this network structure is not full-connected between upper and lower layers. To verify the effectiveness of pruning method, this network is retrained by EBP. From this results, we can find out that the proposed algorithm is effective, as an aspect of a system performence and the node number included in network structure.

• Journal of Internet Computing and Services
• /
• v.22 no.5
• /
• pp.1-8
• /
• 2021

Small-cells in heterogeneous networks are one of the important technologies to increase the coverage and capacity in 5G cellular networks. However, due to the randomly arranged small-cells, co-tier and cross-tier interference increase, deteriorating the system performance of the network. In order to manage the interference, some channel management methods use fractional frequency reuse(FFR) that divides the cell coverage into the inner region(IR) and outer region(OR) based on the distance from the macro base station(MBS). However, since it is impossible to properly measure the distance in the method with FFR, we propose a new interference aware FFR(IA-FFR) method to enhance the system performance. That is, the proposed IA-FFR method divides the MUEs and SBSs into the IR and OR groups based on the signal to interference plus noise ratio(SINR) of macro user equipments(MUEs) and received signals strength of small-cell base stations(SBSs) from the MBS, respectively, and then dynamically assigns subchannels to MUEs and small-cell user equipments. As a result, the proposed IA-FFR method outperforms other methods in terms of the system capacity and outage probability.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.27-35
• /
• 2018

This paper is a study to classify malicious applications in Android environment. And studying the threat and behavioral analysis of malicious Android applications. In addition, malicious apps classified by machine learning were performed as experiments. Android behavior analysis can use dynamic analysis tools. Through this tool, API Calls, Runtime Log, System Resource, and Network information for the application can be extracted. We redefined the properties extracted for machine learning and evaluated the results of machine learning classification by verifying between the overall features and the main features. The results show that key features have been improved by 1~4% over the full feature set. Especially, SVM classifier improved by 10%. From these results, we found that the application of the key features as a key feature was more effective in the performance of the classification algorithm than in the use of the overall features. It was also identified as important to select meaningful features from the data sets.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.238-246
• /
• 2021

The rapid rise of the Internet and social media has resulted in a large number of text-based reviews being placed on sites such as social media. In the age of social media, utilizing machine learning technologies to analyze the emotional context of comments aids in the understanding of QoS for any product or service. The classification and analysis of user reviews aids in the improvement of QoS. (Quality of Services). Machine Learning algorithms have evolved into a powerful tool for analyzing user sentiment. Unlike traditional categorization models, which are based on a set of rules. In sentiment categorization, Bidirectional Long Short-Term Memory (BiLSTM) has shown significant results, and Convolution Neural Network (CNN) has shown promising results. Using convolutions and pooling layers, CNN can successfully extract local information. BiLSTM uses dual LSTM orientations to increase the amount of background knowledge available to deep learning models. The suggested hybrid model combines the benefits of these two deep learning-based algorithms. The data source for analysis and classification was user reviews of Indian Railway Services on Twitter. The suggested hybrid model uses the Keras Embedding technique as an input source. The suggested model takes in data and generates lower-dimensional characteristics that result in a categorization result. The suggested hybrid model's performance was compared using Keras and Word2Vec, and the proposed model showed a significant improvement in response with an accuracy of 95.19 percent.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.543-550
• /
• 2005

Demand for better services in the Internet has been increasing due to the rapid growth of the Internet, and hence next generation routers are required to perform intelligent packet classification. For a given classifier defining packet attributes or contents, packet classification is the process of identifying the highest priority rule to which a packet conforms. A notable characteristic of real classifiers is that a packet matches only a small number of distinct source-destination prefix pairs. Therefore, a lot of schemes have been proposed to filter rules based on source and destination prefix pairs. However, most of the schemes are based on sequential one-dimensional searches using trio which requires huge memory. In this paper, we proposea memory-efficient two-dimensional search scheme using source and destination prefix pairs. By constructing binary prefix tree, source prefix search and destination prefix search are simultaneously performed in a binary tree. Moreover, the proposed two-dimensional binary prefix tree does not include any empty internal nodes, and hence memory waste of previous trio-based structures is completely eliminated.