• Title/Summary/Keyword: web science

Search Result 4,998, Processing Time 0.04 seconds

A Study on the Application of Web 2.0 for Archival Information Services (기록정보서비스를 위한 Web 2.0 적용에 관한 연구)

  • Nam, Jae-Woo;Kim, Seong-Hee
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.43 no.2
    • /
    • pp.123-146
    • /
    • 2009
  • This study analyzed the usefulness of Web 2.0 techniques for improving archival information service. As a result, Web 2.0 was found to be useful for information service in National Archives of Korea(NAK). The results show that Open API is the most influential factor and RSS is the second-most useful factor for information services. These results can be used as a framework for developing Web 2.0-based information services in the NAK.

Hierarchical Web Structuring Using Integer Programming

  • Lee Wookey;Kim Seung;Kim Hando;Kang Suk-Ho
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.10a
    • /
    • pp.51-67
    • /
    • 2004
  • World Wide Web is nearly ubiquitous and the tremendous growing number of Web information strongly requires a structuring framework by which an overview visualization of Web sites has provided as a visual surrogate for the users. We have a viewpoint that the Web site is a directed graph with nodes and arcs where the nodes correspond to Web pages and the arcs correspond to hypertext links between the Web pages. In dealing with the WWW, the goal in this paper is not to derive a naive shortest path or a fast access method, but to generate an optimal structure based on the context centric weight. We modeled a Web site formally so that a integer programming model can be formulated. Even if changes such as modification of the query terms, the optimized Web site structure can be maintained in terms of sensitivity.

  • PDF

Heterogeneous Web Information Integration System based on Entity Identification

  • Shin, Hyung-Wook;Yang, Hyung-Jeong;Kim, Soo-Hyung;Lee, Guee-Sang;Kim, Kyoung-Yun;Kim, Sun-Hee;Ngoc, Do Luu
    • International Journal of Contents
    • /
    • v.8 no.4
    • /
    • pp.21-29
    • /
    • 2012
  • It is not easy for users to effectively have information that is semantically related but scattered on the Web. To obtain qualitatively improved information in web pages, it is necessary to integrate information that is heterogeneous but semantically related. In this study, we propose a method that provides XML-based metadata to users through integration of multiple heterogeneous Web pages. The metadata generated from the proposed system is obtained by integrating different heterogeneous information into a single page, using entity identification based on ontology. A wheelchair information integration system for disabled people is implemented to verify the efficiency of the proposed method. The implemented system provides an integrated web page from multiple web pages as a type of XML document.

Microservice Identification by Partitioning Monolithic Web Applications Based on Use-Cases

  • Si-Hyun Kim;Daeil Jung;Norhayati Mohd Ali;Abu Bakar Md Sultan;Jaewon Oh
    • Journal of information and communication convergence engineering
    • /
    • v.21 no.4
    • /
    • pp.268-280
    • /
    • 2023
  • Several companies have migrated their existing monolithic web applications to microservice architectures. Consequently, research on the identification of microservices from monolithic web applications has been conducted. Meanwhile, the use-case model plays a crucial role in outlining the system's functionalities at a high level of abstraction, and studies have been conducted to identify microservices by utilizing this model. However, previous studies on microservice identification utilizing use-cases did not consider the components executed in the presentation layer. Unlike existing approaches, this paper proposes a technique that considers all three layers of web applications (presentation, business logic, and data access layers). Initially, the components used in the three layers of a web application are extracted by executing all the scenarios that constitute its use-cases. Thereafter, the usage rate of each component is determined for each use-case and the component is allocated to the use-case with the highest rate. Then, each use-case is realized as a microservice. To verify the proposed approach, microservice identification is performed using open-source web applications.

A Divided Scope Web Cache Replacement Technique Based on Object Reference Characteristics (객체 참조 특성 기반의 분할된 영역 웹 캐시 대체 기법)

  • Ko, Il-Seok;Leem, Chun-Seong;Na, Yun-Ji;Cho, Dong-Wook
    • The KIPS Transactions:PartC
    • /
    • v.10C no.7
    • /
    • pp.879-884
    • /
    • 2003
  • Generally we use web cache in order to increase performance of web base system, and a replacement technique has a great influence on performance of web cache. A web cache replacement technique is different from a replacement technique of memory scope, and a unit substituted for is web object Also, as for the web object, a variation of user reference characteristics is very great. Therefore, a web cache replacement technique can reflect enough characteristics of this web object. But the existing web caching techniques were not able to reflect enough these object reference characteristics. A principal viewpoint of this study is reference characteristic analysis, an elevation of an object hit rate, an improvement of response time. First of all we analyzed a reference characteristics of an web object by log analysis. And we divide web cache storage scope using the result of reference characteristics analysis. In the experiment result, we can confirm that performance of an object-hit ratio and a response speed was improved than a conventional technique about a proposal technique.

Performance Impact of Large File Transfer on Web Proxy Caching: A Case Study in a High Bandwidth Campus Network Environment

  • Kim, Hyun-Chul;Lee, Dong-Man;Chon, Kil-Nam;Jang, Beak-Cheol;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • Journal of Communications and Networks
    • /
    • v.12 no.1
    • /
    • pp.52-66
    • /
    • 2010
  • Since large objects consume substantial resources, web proxy caching incurs a fundamental trade-off between performance (i.e., hit-ratio and latency) and overhead (i.e., resource usage), in terms of caching and relaying large objects to users. This paper investigates how and to what extent the current dedicated-server based web proxy caching scheme is affected by large file transfers in a high bandwidth campus network environment. We use a series of trace-based performance analyses and profiling of various resource components in our experimental squid proxy cache server. Large file transfers often overwhelm our cache server. This causes a bottleneck in a web network, by saturating the network bandwidth of the cache server. Due to the requests for large objects, response times required for delivery of concurrently requested small objects increase, by a factor as high as a few million, in the worst cases. We argue that this cache bandwidth bottleneck problem is due to the fundamental limitations of the current centralized web proxy caching model that scales poorly when there are a limited amount of dedicated resources. This is a serious threat to the viability of the current web proxy caching model, particularly in a high bandwidth access network, since it leads to sporadic disconnections of the downstream access network from the global web network. We propose a peer-to-peer cooperative web caching scheme to address the cache bandwidth bottleneck problem. We show that it performs the task of caching and delivery of large objects in an efficient and cost-effective manner, without generating significant overheads for participating peers.

Designing Summary Tables for Mining Web Log Data

  • Ahn, Jeong-Yong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.16 no.1
    • /
    • pp.157-163
    • /
    • 2005
  • In the Web, the data is generally gathered automatically by Web servers and collected in server or access logs. However, as users access larger and larger amounts of data, query response times to extract information inevitably get slower. A method to resolve this issue is the use of summary tables. In this short note, we design a prototype of summary tables that can efficiently extract information from Web log data. We also present the relative performance of the summary tables against a sampling technique and a method that uses raw data.

  • PDF

A Study on Exploring Web Services Issues and Their Solutions

  • Nasridinov, Aziz;Byun, Jeong-Yong;Park, Young-Ho
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.763-764
    • /
    • 2012
  • Web Services are considered to be a promising technology to add a new level of functionality to the existing World Wide Web. However, despite the growing use of Web Services by many organizations, there are several issues that are slowing their deployment such as service discovery, recovery from faults and security. In this paper, we give a detailed overview of issues surrounding Web Services, discuss existing solutions and describe their limitations.

A Study on the Practical Application Plans of a Library Information System through Web 2.0 Site Analysis (Web 2.0 기술 적용 사이트 분석을 통한 도서관 정보시스템의 활용방안에 관한 연구)

  • Park, Mi-Sung
    • Journal of Korean Library and Information Science Society
    • /
    • v.39 no.1
    • /
    • pp.139-168
    • /
    • 2008
  • With the advent of the Web 2.0 technology, its versatility has been experienced through various web sites. Consequently, many library users request to implement this technology into the library information system. Here this paper try to increase our understanding of the concept and technology of the Web 2.0, Library 2.0. and Catalog 2.0(OPAC 2.0) through literature survey. Also, this paper try to figure out the most applicable technology to the library information system by analyzing the representative web sites and libraries equipped with Web 2.0 technology. Finally, based on the analysis results, this study suggests an applicable practical plans in the field of catalog, retrieval and auxiliary services toward the user-friendly library information system. We also indicate several side effects expected with the implementation of the suggested plans.

  • PDF

Optimized Structures with Hop Constraints for Web Information Retrieval (Hop 제약조건이 고려된 최적화 웹정보검색)

  • Lee, Woo-Key;Kim, Ki-Baek;Lee, Hwa-Ki
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.4
    • /
    • pp.63-82
    • /
    • 2008
  • The explosively growing attractiveness of the Web is commencing significant demands for a structuring analysis on various web objects. The larger the substantial number of web objects are available, the more difficult for the clients(i.e. common web users and web robots) and the servers(i.e. Web search engine) to retrieve what they really want. We have in mind focusing on the structure of web objects by introducing optimization models for more convenient and effective information retrieval. For this purpose, we represent web objects and hyperlinks as a directed graph from which the optimal structures are derived in terms of rooted directed spanning trees and Top-k trees. Computational experiments are executed for synthetic data as well as for real web sites' domains so that the Lagrangian Relaxation approaches have exploited the Top-k trees and Hop constraint resolutions. In the experiments, our methods outperformed the conventional approaches so that the complex web graph can successfully be converted into optimal-structured ones within a reasonable amount of computation time.