• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.555-559
• /
• 2002

Internet users can input URL in Address window of browser or click address of site that is registered to Bookmark and sail the world of internet. But, need input of ID and password and mouse click action of 4-5 times to reach on target page that users want. This environment is very annoying work to users who approach specification page repeatedly every day. So, Homepage (first screen) of URL that want is not, Web Page Access Manager's development that can approach to target page that want by mouse click of short once. That may make web users can approach fast on target page, and minimise effort by web sailing.

• Journal of Aquaculture
• /
• v.10 no.3
• /
• pp.301-310
• /
• 1997

To investigate a possibility of the species genetic relationship for the soluble proteins analysis on the class Cephalopoda in the Yellow Sea, the isolate eye, muscle and liver proteins from five species (Sepia esculenta, Sepiella japonica, Loligo chinensis, Loligo beka and Octopus minor) were analysed using different electrophoretic techniques (Davis-polyacrylamide gel electrophoresis, SDS-PAGE, exponential gradient SDS-PAGE, thin-layer isoelectro-focusing and two-dimensional PAGE). The average molecular weight of the soluble eye and muscle proteins was estimated at 35-50 KDa, separated b the exponential gradient SDS-PAGE. It was corresponds to that of electrophoretic patterns by t재 dimensional PAGE. By which the thin layer IEF, the target proteins showed a reasonable specificity based on their isoelectric points (pI) 7.5-8.5.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.14-28
• /
• 2009

The PageRank algorithm is an important component for ranking Web pages in Google and other search engines. While many improvements for the original PageRank algorithm have been proposed, it is unclear which variations (and their combinations) provide the "best" ranked results. In this paper, we evaluate the ranking quality of the well-known variations of the original PageRank algorithm and their combinations. In order to do this, we first classify the variations into link-based approaches, which exploit the link structure of the Web, and knowledge-based approaches, which exploit the semantics of the Web. We then propose algorithms that combine the ranking algorithms in these two approaches and implement both the variations and their combinations. For our evaluation, we perform extensive experiments using a real data set of one million Web pages. Through the experiments, we find the algorithms that provide the best ranked results from either the variations or their combinations.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2002.06a
• /
• pp.35-47
• /
• 2002

2D-PAGE/MALDI-TOF는 프로-테옴 연구의 중요한 실험 기법중의 하나이다. 이는 단백질의 발현 분석을 위한 방법으로, 2D-PAGE 결과로 얻어진 영상 데이터의 분석에 대한 정확도가 단백질 발현에 대한 분석 결과의 질을 결정하는 중요한 요인으로 작용한다. 2D Electrophoresis에 의한 Gel Protein Database는 현재 많은 연구자들에 의해 생산되고 있으며, 대단히 많은 데이터들이 인터넷을 통하여 접근이 가능하다. 이러한 대량 정보의 Database 활용이 가능한 상황은 2D-PAGE에 의해 생산된 Gel Image의 상호 비교에 대한 요구를 도출하였다. 본 발표에서는 영상처리 및 형태인식 기술과 2D-PAGE 연구의 결합을 주제로 하여, 2D-PAGE Gel 영상 처리 및 비교에 관련되는 전처리 (preprocessing), spot detection, feature extraction, spot matching 및 image comparison 기술을 소개한다.

• Journal of Fashion Business
• /
• v.12 no.6
• /
• pp.138-151
• /
• 2008

This study aims at providing comprehensive data which would be helpful to establish a web shopping mall by analyzing the structure of web fashion star shops which have recently emerged as a result of advances in digital technology and communication. For the purpose of analyzing VMD strategy used in web fashion star shop, we adopt both of the documental and empirical research methods, based on which we examine the concept of E-commerce and current business situation of web fashion star shop industry, and then analyze the main page, product category page and product detail page in a star shop featured by a male pop star within a web shopping mall. According to our analysis of the structure of web fashion star shop, in case of open market, a banner with star's image on it leads to star shop when people click on the link of the banner, and in case of independent mall, they show each star's unique style in the main page. Product category page is linked to each product detail page which presents items of various fashion coordinates, satisfying needs of consumers to follow star's trendy fashion sense.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.268-274
• /
• 2005

Since introduction of the PageRank technique, it is known that it ranks web pages effectively In spite of its usefulness, we found a computational drawback, which we call norm-leak, that PageRank values become smaller than they should be in some cases. We present an improved PageRank algorithm that computes the PageRank values of the web pages correctly as well as its efficient implementation. Experimental results, in which over 67 million real web pages are used, are also presented.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.745-754
• /
• 2002

The Google search site (http://www.google.com), which was introduced in 1998, implemented the PageRank algorithm for the first time. PageRank is a ranking method based on the link structure of the Web pages. Even though PageRank has been implemented and being used in various commercial search engines, implementation details did not get documented well, primarily due to business reasons. Implementation techniques introduced in [4,8] are not sufficient to produce PageRank values of Web pages. This paper explains the techniques[4,8], and suggests major data structure and four implementation techniques in order to apply the PageRank algorithm. The paper helps understand the methods of applying PageRank algorithm by means of showing a real system that produces PageRank values of Web pages.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.4
• /
• pp.291-297
• /
• 2013

Recently, the amount of web pages, which include various information, has been drastically increased according to the explosive increase of WWW usage. Therefore, the need for web page classification arose in order to make it easier to access web pages and to make it possible to search the web pages through the grouping. Web page classification means the classification of various web pages that are scattered on the web according to the similarity of documents or the keywords contained in the documents. Web page classification method can be applied to various areas such as web page searching, group searching and e-mail filtering. However, it is impossible to handle the tremendous amount of web pages on the web by using the manual classification. Also, the automatic web page classification has the accuracy problem in that it fails to distinguish the different web pages written in different forms without classification errors. In this paper, we propose the automatic web page classification system using meta-tag that can be obtained from the web pages in order to solve the inaccurate web page retrieval problem.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.77-82
• /
• 2022

Due to the recent advent of fast storage media, the memory management system needs to reconsider the configuring of a page unit. In this paper, we analyze the effect of the page size on memory performance as fast storage is adopted. Specifically, we analyze the TLB hit ratio and the page fault ratio as the workload and the page size are varied in desktop and smartphone environments. Our analysis shows that the influence of the page size depends on the system and workload conditions in desktop systems. However, in smartphone systems, the effect of the page size on memory performance is not large, and is not also sensitive to workloads. We expect that the analysis of this paper will be helpful in configuring the page size of given workloads under the system with fast storage media.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.1
• /
• pp.65-70
• /
• 2022

As fast storage has become popular, the memory management system designed for hard disks needs to be reconsidered. In this paper, we observe that memory access latency is sensitive to the page size when fast storage is adopted. We find the reason from the TLB miss rate, which has the increased impact on the memory access latency in comparison with the page fault rate, and there is trade-off between the TLB miss rate and the page fault rate as the page size is varied. To handle such situations, we model the page fault rate and the TLB miss rate accurately as a function of the page size. Specifically, we show that the power fit and the exponential fit with two terms are appropriate for fitting the TLB miss rate and the page fault rate, respectively. We validate the effectiveness of our model by comparing the estimated values from the model and real values.