• Convergence Security Journal
• /
• v.13 no.3
• /
• pp.63-69
• /
• 2013

This research analyze the current status pertaining to the sport industry's information system and information network in Korea to propose integrated information network of sport industry construction measures with the goal of optimizing vertical and horizontal network formation, and knowledge information sharing and dissemination. To construct integrated information network of sport industry, literature examination and meeting of experts to search for measures are utilized. This paper analyze the realities of the sport industry's information system and information network in Korea to propose the following when it comes to the measures to realize sport industry's information integration. First, DB for sport industry relate information that factored in the Ontology is being developed. In other words, it is necessary to design a DB that factors in the Semantic Web. Second, once the DB relate to the sport industry that factored in the Ontology is developed, it is necessary to build RSS/Atom based active network that enables exchange of organic information among them.

• 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.

• Annual Conference of KIPS
• /
• 2011.04a
• /
• pp.1549-1550
• /
• 2011

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

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.27-33
• /
• 2009

Content used in mashups is typically obtained from a third party source through a public interface or API (web services). Other methods of obtaining content for mashups include Web feeds (e.g. RSS or Atom), and screen scraping. A mashup or meshup Web application has two parts: A new service delivered through a Web page, using its own data and data from other sources. The blended data, made available across the Web through an API or other protocols such as HlTP, RSS, REST, etc. There are many types of mashups, such as consumer mashups, data mashups, and Business Mashups. The most common mashup is the consumer mashup, which are aimed at the general public. Examples include Google Maps, iGuide, and RadioClouds. 4D Wall-map display is data mashups combine similar types of media and information from multiple sources into a single representation. This technology focus data into a single presentation and allow for collaborative action among ITS-related information sources.

• The KIPS Transactions:PartD
• /
• v.16D no.6
• /
• pp.845-850
• /
• 2009

Use of XML data has been increased with growth of Web 2.0 environment. XML is recognized its advantages by using based technology of RSS or ATOM for transferring information from blogs and news feed. Bitmap clustering is a method to keep index in main memory based on Relational DBMS, and which performed better than the other XML indexing methods during the evaluation. Existing method generates too many clusters, and it causes deterioration of result of searching quality. This paper proposes k-Bitmap clustering method that can generate user defined k clusters to solve above-mentioned problem. The proposed method also keeps additional inverted index for searching excluded terms from representative bits of k-Bitmap. We performed evaluation and the result shows that the users can control the number of clusters. Also our method has high recall value in single term search, and it guarantees the searching result includes all related documents for its query with keeping two indices.