• Journal of Integrative Natural Science
• /
• v.13 no.1
• /
• pp.1-7
• /
• 2020

This paper proposes a novel fractional frequency reuse(FFR) based on dynamic user distribution. In the FFR, a macro cell is divided into two regions, i.e., the inner region(IR) and outer region(OR). The criterion for dividing the IR and OR is the distance ratio of the radius. However, these distance-based criteria are uncertain in measuring user performance. This is because there are various attenuation phenomena such as shadowing and wall penetration as well as path loss. Therefore, we propose a novel FFR based on dynamic user classification with signal to interference plus noise ratio(SINR) of macro users and classify the FFR into two regions newly. Simulation results show that the proposed scheme has better performance than the conventional FFR in terms of SINR and throughput of macro cell users.

• 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 KIISE:Software and Applications
• /
• v.37 no.5
• /
• pp.378-385
• /
• 2010

The explosive increase in the use of email has made to need email classification efficiently and accurately. Current work on the email classification method have mainly been focused on a binary classification that filters out spam-mails. This methods are based on Support Vector Machines, Bayesian classifiers, rule-based classifiers. Such supervised methods, in the sense that the user is required to manually describe the rules and keyword list that is used to recognize the relevant email. Other unsupervised method using clustering techniques for the multi-category classification is created a category labels from a set of incoming messages. In this paper, we propose a new automatic email multi-category classification method using NMF for automatic category label construction method and dynamic category hierarchy method for the reorganization of email messages in the category labels. The proposed method in this paper, a large number of emails are managed efficiently by classifying multi-category email automatically, email messages in their category are reorganized for enhancing accuracy whenever users want to classify all their email messages.

• Journal of Advanced Navigation Technology
• /
• v.13 no.3
• /
• pp.419-425
• /
• 2009

The amount of incoming e-mails is increasing rapidly due to the wide usage of Internet. Therefore, it is more required to classify incoming e-mails efficiently and accurately. Currently, the e-mail classification techniques are focused on two way classification to filter spam mails from normal ones based mainly on Bayesian and Rule. The clustering method has been used for the multi-way classification of e-mails. But it has a disadvantage of low accuracy of classification and no category labels. The classification methods have a disadvantage of training and setting of category labels by user. In this paper, we propose a novel multi-way e-mail hierarchy classification method that uses PCA for automatic category generation and dynamic category hierarchy for high accuracy of classification. It classifies a huge amount of incoming e-mails automatically, efficiently, and accurately.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.3
• /
• pp.165-170
• /
• 2007

Recommendation systems provide users with proper services using context information being input from many sensors occasionally under ubiquitous computing environment. But in case there isn't sufficient context information for service recommendation in spite of much context information, there can be problems of resulting in inexact result. In addition, in the quantification step to use context information, there are problems of classifying context information inexactly because of using an absolute classification course. In this paper, we solved the problem of lack of necessary context information for service recommendation by using dynamic profile information. We also improved the problem of absolute classification by using a relative classification of context information in quantification step. As the result of experiments, expectation preference degree was improved by 7.5% as compared with collaborative filtering methods using an absolute quantification method where context information of P2P mobile agent is used.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.657-668
• /
• 2001

It is difficult that web documents are classified with exact user intention because existing document classification systems are based on word frequency number using single keyword. To improve this defect, first, we use keyword, a query, domain knowledge. Like explanation based learning, first, query is analyzed with knowledge based information and then structured user intention information is extracted. We use this intention tree in the course of existing word frequency number based document classification as user information and constraints. Thus, we can classify web documents with more exact user intention. In classifying document, structured user intention information is helpful to keep more documents and information which can be lost in the system using single keyword information. Our hybrid approach integrating user intention information with existing statistics and probability method is more efficient to decide direction and range of document category than existing word frequency approach.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.165-178
• /
• 2005

A product classification scheme is the foundation on which product databases are designed, and plays a central role in almost all aspects of management and use of product information. It needs to meet diverse user views to support efficient and convenient use of product information. It needs to be changed and evolved very often without breaking consistency in the cases of introduction of new products, extinction of existing products, class reorganization, and class specialization. It also needs to be merged and mapped with other classification schemes without information loss when B2B transactions occur. For these requirements, a classification scheme should be so dynamic that it takes in them within right time and cost. The existing classification schemes widely used today such as UNSPSC and eCl@ss, however, have a lot of limitations to meet these requirements for dynamic features of classification. Product information implies a plenty of semantics such as class attributes like material, time, place, etc., and integrity constraints. In this Paper, we analyze the dynamic features of product databases and the limitation of existing code based classification schemes, and describe the semantic classification model proposed in [1], which satisfies the requirements for dynamic features of product databases. It provides a means to explicitly and formally express more semantics for product classes and organizes class relationships into a graph.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5877-5897
• /
• 2018

With the popularity of mobile networks and smartphones, geo-textual publish/subscribe messaging has attracted wide attention. Different from the traditional publish/subscribe format, geo-textual data is published and subscribed in the form of dynamic data flow in the mobile network. The difference creates more requirements for efficiency and flexibility. However, most of the existing Top-k geo-textual publish/subscribe schemes have the following deficiencies: (1) All publications have to be scored for each subscription, which is not efficient enough. (2) A user should take time to set a threshold for each subscription, which is not flexible enough. Therefore, we propose an efficient and flexible Top-k geo-textual publish/subscribe scheme. First, our scheme groups publish and subscribe based on text classification. Thus, only a few parts of related publications should be scored for each subscription, which significantly enhances efficiency. Second, our scheme proposes an adaptive publish/subscribe matching algorithm. The algorithm does not require the user to set a threshold. It can adaptively return Top-k results to the user for each subscription, which significantly enhances flexibility. Finally, theoretical analysis and experimental evaluation verify the efficiency and effectiveness of our scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.1
• /
• pp.15-28
• /
• 1999

In Multilevel Secure Database Management System(MLS/DBMS), we assume that system has a security clearance level for each user and a classification level for each data item in system and the objective of these systems is to protect secure information from unauthorized user. Many algorithms which have been researched have focus on removing covert channel by modifying conventional lock-based algorithm or timestamp-based algorithm. but there is high-level starvation problem that high level transaction is aborted by low level transaction repeatedly. In order to solve this problem, we propose an algorithm to reduce high-level starvation using dynamic adjustment of serialization order, which is basically using orange lock. Because our algorithm is based on a single version unlike conventional secure algorithms which are performed on multiversion, it can get high degree of concurrency control. we also show that it guarantees the serializability of concurrent execution, and satisfies secure properties of MLS/DBMS.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.465-470
• /
• 2004

Web Information Predictive Systems have the restriction such as they need users profiles and visible feedback information for obtaining the necessary information. For overcoming this restrict, this study designed and implemented Dynamic Web Information Predictive System using Ensemble Support Vector Machine to be able to predict the web information and provide the relevant information every user needs most by click stream data and user feedback information, which have some clues based on the data. The result of performance test using Dynamic Web Information Predictive System using Ensemble Support Vector Machine against the existing Web Information Predictive System has preyed that this study s method is an excellence solution.