• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.656-669
• /
• 2007

The RSS is a document format for syndicate a document maded by a WebSite. A document that made and syndicated to fit for this format is called a RSS feed or a feed. This paper presents the design of package for an RSS feed parser that analyzes an RSS feed and saves its informations. according to the RSS specification. This paper establishes an RSS grammar and an automata recognizing that grammar. Based on the automata, we design a package for classes that recognize elements of an RSS feed.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.391-399
• /
• 2008

RSS is the XML-based format for the syndication of web contents, and users aggregate RSS feeds with RSS feed aggregators. In order to effectively aggregate RSS feeds, an RSS aggregation policy is necessary. In this paper, we first propose an aggregation policy to minimize the number of postings being missed within an aggregation. Second, we analyze and compare our aggregation policy with existing aggregation policies. Our analysis reveals that our aggregation policy can reduce approximately 23% of the aggregation missing in comparison with the other aggregation policies while it increases only 6% of the aggregation delay.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2008

In the Web 2.0, besides more gaining information on the web, the number of web sites that take advantage of RSS increases explosively. Commonly each users search RSS channels through the web search engine before registering RSS channel's url to the RSS reader. Users judge whether the site is RSS channel or not and register an RSS channel's url through theirs interests. Because accomplished by users themselves, those processes conflict to user's convenience and quick consumption of information. Techniques of current search engines can't provide users with reliable RSS feed information as search results. In this paper, we analysis appropriateness of current search engines' techniques that offer users RSS feed search service and discuss their limitations. Also, we make up RSS feed database through classification of RSS tag being possible to search RSS feed information effectively and apply update rate of each RSS channel's feed to ranking algorithm providing more reliable search results.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.391-394
• /
• 2007

인터넷은 그 탄생 이후로 점점 더 많은 사용자들을 가지게 되었으며, 이러한 사용자들로 인하여 인터넷으로 흘러나오는 정보의 양은 갈수록 더 많아지고 있다. 특히, 인터넷 게시판은 수많은 사용자들의 생각과 그들이 가진 정보를 교환하기 위하여 주요한 방법으로 사용되고 있다. 본 연구에서는 웹 2.0을 활용하여 각각의 사용자에게 맞춤형 서비스를 제공하는 인터넷 게시판을 설계한다. 설계될 인터넷 게시판은 사용자에게 제공되는 정보는 동일하지만, 각 사용자마다 설정된 정보에 의하여 정보의 분류가 다르게 이루어지도록 하여 자신이 원하는 정보를 보다 빠르게 검색할 수 있도록 하였다. 또한, 각 사용자는 개인 게시판을 생성하여 모든 사용자가 공유하는 게시판에서 자신에게 필요한 정보만을 자동으로 수집하여 저장할 수 있으며, 외부 RSS 피드들을 필터링하여 개인 게시판에 연결하거나, 자신만의 정보를 개인 게시판에 등록할 수도 있다. 위와 같이 방법들은 사용자가 약간의 정보를 미리 등록해 주는 것만으로 여러 게시판과 RSS 피드들로부터 자기가 원하는 최신정보들을 실시간으로 수집하여 개인 게시판에 저장해주며, 간단한 클릭 몇 번으로 게시판의 형태가 변경되어 각각의 사용자가 원하는 정보를 빠른 시간에 찾을 수 있도록 해주게 될 것이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.199-200
• /
• 2008

• Journal of Service Research and Studies
• /
• v.5 no.2
• /
• pp.83-92
• /
• 2015

Many data on the web are present, put out by processing in the content in order to provide services by collecting the necessary data is not easy. One of the reasons is because there is no way to provide a standardized data. Therefore, it can be seen as a part or all of the contents of the site, the content distribution to be available for other services is very important. A syndication format that allows you to use a representative of some or all of the site's content for other services such as RSS and there are Atom, OPML-based XML. Throughout the links provided in this syndication format is called feed address. With a feed address to collect data faster than the conventional HTML parsing and data provider is the advantage of being able to easily provide the data to the outside. In this study, we feed the data obtained by collecting by implementing the web address based on the data acquisition system to propose a method for processing and utilizing the data as a background.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.773-779
• /
• 2007

Internet bulletin boards have been used to exchange their idea and information among Internet users. But the existing Internet bulletin boards can not satisfy user's personal view. In this raper, Web 2.0 based customized Internet bulletin board is to design. The proposed Internet bulletin board provides each user with personalized information which are established by user beforehand. So user can retrieve his interested information fast. Moreover user can generate his own personalized bulletin board to collect one's interested information automatically. The personalized bulletin board is connected to several Internet bulletin boards with RSS feeds.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1496-1506
• /
• 2007

The environment of web service has changed a great deal due to the progress of internet technology and positive participation of users. The established web service is static and passive, but the recent web service is becoming dynamic and active. Web 2.0 reflects current web service change well. The primary feature of web 2.0 is positive participation of users. Since the size of generated information is becoming larger, it is highly required to share the information fast and correctly. The technology to satisfy this need is web syndication and tagging in web 2.0. The web syndication makes feeds for another site or users to receive the content of web site. In addition, the tagging is the kernel of a information. Many internet users share rapidly the information through tag search. In this paper, we propose the efficient technique to improve the web 2.0 technology such as web syndication and tagging by using the data collection engine. Data collection engine has stored in a database, a user's Web site to use the information. and it has a user's Web site with access to updated data to collect. The experimental results show that our approach can improve the search speed up to 3.14 times better than the existing method and reduce the size of data up to 66% for building associated tags.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.1549-1550
• /
• 2011

현재의 다양한 메쉬업(Mashup) 기술은 웹에서 제공되는 데이터, 웹서비스, RSS/Atom 피드 등에만 사용이 국한되어 있기 때문에, 클라우드 환경에 적용하게 되면 SaaS(Software as a Service) 형태의 서비스로만 구성되게 된다. 하지만, 클라우드에서는 인프라 자원들도 서비스의 형태로 접근될 수 있으며, 이를 이용한 메쉬업이 가능하다. 이에 본 논문에서는 클라우드의 인프라 자원 및 SaaS 형태의 서비스를 메쉬업 할 수 있는 효율적인 미들웨어 구조를 제안하고자 한다.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.258-266
• /
• 2010

In this paper, we introduce a novel method to predict next update of blogs. The number of RSS feeds registered on meta-blogs is on the order of several million. Checking for updates is very time consuming and imposes a heavy burden on network resources. Since blog search engine has limited resources, there is a fix number of blogs that it can visit on a day. Nevertheless we need to maximize chances of getting new data, and the proposed method which predicts update probability on blogs could bring better chances for it. Also this work is important to avoid distributed denial-of-service attack for the owners of blogs. Furthermore, for the internet as whole this work is important, too, because our approach could minimize traffic. In this study, we assumed that there is a specific pattern to when a blogger is actively posting, in terms of days of the week and, more specifically, hours of the day. We analyzed 15,119 blogs to determine a blogger's posting preference. This paper proposes a method to predict the update probability based on a blogger's posting history and preferred days of the week. We applied proposed method to 12,115 blogs to check the precision of our predictions. The evaluation shows that the model has a precision of 0.5 for over 93.06% of the blogs examined.