• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.708-714
• /
• 2006

The World Wide Web has become an entrenched global medium for storing and searching information. Most people begin at a Web search engine to find information, but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is Web spamming as Google bombing that is based on the PageRank algorithm, one of the most famous Web structuring techniques. In this paper, we regard the Web as a directed labeled graph that Web pages represent nodes and the corresponding hyperlinks edges. In the present work, we define the label of an edge as having a link context and a similarity measure between link context and the target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. A motivating example is investigated in terms of the Singular Value Decomposition with which our algorithm can outperform to filter the Web spamming pages effectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.553-558
• /
• 2009

There have been various research efforts to support the fairness between uplink and downlink of TCP streams in IEEE 802.11 networks. Existing methods, which have been effective for the fairness, however could not provide the solution for the unfairness caused by the situation in which a station which is having multiple TCP uplink streams monopolizes the uplink bandwidth. This paper proposes a method that AP allocates token buckets for each uplink TCP station. The proposed method is also able to support the fairness between the uplink and downlink. To remedy the underutilization which may happen under token bucket-based schemes, it allows the movement of redundant tokens among the token buckets. By controlling the token movements, it can balance the fairness and the utilization. Simulation results show that the proposed method is able to support the fairness of the TCP uplink stations, as well as the fairness between the uplink and downlink.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2442-2450
• /
• 1999

The audit logging system is to write the details of systems use and access on networks. These details are used for trailing the route, when illegal access or using system resource is occurred on networks. The logging system therefore, might be the first target of intruder. We developed the logging system which writes the information of logging and command execution on UNIX system. And we prepared the self-protecting functions of blocking intruder's attack on the logging system. They are protecting the logging process and the log file. To protect the logging process, we made it keep changing the process ID to avoid the intruder's attack. To protect the log file, we use hard link and mandatory file locking, so it can make it impossible to delete or change log file.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.59-66
• /
• 2005

The organization of the web is progressively more being used to improve search and analysis of information on the web as a large collection of heterogeneous documents. Most people begin at a Web search engine to find information. but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is a intentionally biased web page like Google bombing that is based on the PageRank algorithm. one of many Web structuring techniques. In this thesis, we regard the World Wide Web as a directed labeled graph that Web pages represent nodes and link edges. In the Present work, we define the label of an edge as having a link context and a similarity measure between link context and target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. By suggesting a motivating example, it is explained how our proposed algorithm can filter the Web intentionally biased web Pages effective about $60\%% rather than the conventional PageRank.