• Title/Summary/Keyword: Web Searches

Search Result 135, Processing Time 0.03 seconds

OWL Authoring System for building Web Ontology (웹 온톨로지 구축을 위한 OWL 저작 시스템)

  • Lee Moohun;Cho Hyunkyu;Cho Hyeonsung;Cho Sunghoon;Jang Changbok;Choi Euiin
    • The Journal of Society for e-Business Studies
    • /
    • v.10 no.3
    • /
    • pp.21-36
    • /
    • 2005
  • Current web search includes a lot of different results with information that user does not want, because it searches information using keyword mapping. Ontology can describe the correct meaning of web resource and relationships between web resources. And we can extract suitable information that user wants using Ontology Accordingly, we need the ontology to represent knowledge. W3C announced OWL(Web Ontology Language), meaning description technology for such web resource. However, the development of a special tool that can effectively compose and edit OWL is inactive. In this paper, we designed and developed an OWL authoring system that can effectively provide the generation and edit about OWL.

  • PDF

A Preliminary Examination on the Multimedia Information Needs and Web Searches of College Students in Korea

  • Chung, Eun-Kyung
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.44 no.4
    • /
    • pp.95-114
    • /
    • 2010
  • Multimedia searching is an important activity on the Web, especially among the younger generation. The purpose of this study aims to examine college students’ multimedia information needs and searching on the Internet. While there is a clear pattern among students with respect to their multimedia uses, searching sources, relevance criteria and searching barriers, some differences exist especially according to searching of different multimedia types such as image, audio and video. For multimedia uses, information/data-focused uses are frequently found in image and video, while the use of audio is mainly for object-focused searches. As multimedia searching sources, audio and video files present a similar pattern of being high in media specific searching sources and low in generic search engines. Browsing through related blogs and homepages is an important part of searching for media files accounting for approximately 20% of total search for each media. The relevance criteria used by study participants when search for image files was primarily concerned with topicality while the contextual and media quality in the audio and video types are also considered important. Searching barriers for audio and video files are categorized into three broad aspects, including access and search quality, preview limitations and collection limitations, while obstacles for image files searching include access difficulties and low qualities of various collection.

Design and Performance Evaluation of an Indexing Method for Partial String Searches (문자열 부분검색을 위한 색인기법의 설계 및 성능평가)

  • Gang, Seung-Heon;Yu, Jae-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.6
    • /
    • pp.1458-1467
    • /
    • 1999
  • Existing index structures such as extendable hashing and B+-tree do not support partial string searches perfectly. The inverted file method and the signature file method that are used in the web retrieval engine also have problems that they do not provide partial string searches and suffer from serious retrieval performance degradation respectively. In this paper, we propose an efficient index method that supports partial string searches and achieves good retrieval performance. The proposed index method is based on the Inverted file structure. It constructs the index file with patterns that result from dividing terms by two syllables to support partial string searches. We analyze the characteristics of our proposed method through simulation experiments using wide range of parameter values. We analyze the derive analytic performance evaluation models of the existing inverted file method, signature file method and the proposed index method in terms of retrieval time and storage overhead. We show through performance comparison based on analytic models that the proposed method significantly improves retrieval performance over the existing method.

  • PDF

Improved Web Service Publishing Method (웹 서비스 등록 절차의 개선 방안)

  • Choi, Yue-Soon;Shin, Hyun-Cheol;Park, Jong-Goo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.1-7
    • /
    • 2005
  • In present web service structure, the service begins when supplier register the information of its service to UDDI(Universal Description Discovery and Integration). When user searches service directory in UDDI, the position of service is transmitted to it. And then, user requests WSDL(Web Service Description Language) to the supplier. When WSDL is delivered to user, user requests the service according to WSDL. This thesis simplifies this web service process. This makes WSDL owned by supplier stored to WSDLBASE when supplier register its service. Also this makes it possible that user search the service and receives WSDL.

A Speed-Based Dijkstra Algorithm for the Line Tracer Control of a Robot (로봇 경로 제어를 위한 속도기반 Dijkstra 알고리즘)

  • Cheon, Seong-Kwon;Kim, Geun-Deok;Kim, Chong-Gun
    • Journal of Information Technology Services
    • /
    • v.10 no.4
    • /
    • pp.259-268
    • /
    • 2011
  • A robot education system by emulation based on Web can be efficiently used for understanding concept of robot assembly practice and control mechanism of robot by control programming. It is important to predict the path of the line tracer robot which has to be decided by the robot. Shortest Path Algorithm is a well known algorithm which searches the most efficient path between the start node and the end node. There are two related typical algorithms. Dijkstra Algorithm searches the shortest path tree from a node to the rest of the other nodes. $A^*$ Algorithm searches the shortest paths among all nodes. The delay time caused by turning the direction of navigation for the line tracer robot at the crossroads can give big differences to the travel time of the robot. So we need an efficient path determine algorithm which can solve this problem. Thus, It is necessary to analyze the overhead of changing direction of robot at multi-linked node to determine the next direction for efficient routings. In this paper, we reflect the real delay time of directional changing from the real robot. A speed based Dijkstra algorithm is proposed and compared with the previous ones to analyze the performance.

Web Service Method using WSDL Repository (웹서비스를 위한 WSDL 리포지토리 설계)

  • Choi, Yue-Soon;Park, Jong-Goo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.4
    • /
    • pp.745-753
    • /
    • 2007
  • Web service, the next generation of distributed computing, is a distributed solution that handles all businesses through standard techniques in the internet. Web service performs its function using web interface. The goal of this thesis is to reduce network overloading. to manage WSDL efficiently, and to provide convenience to service users by simplifying the web service procedure. Web service system proposed in this thesis is based on WSDL Repository that can include UDDI and store WSDL. WSDL Repository manages WSDL by file system and has UDDI Registry embedded within it. Because this system is based on WSDL Repository, Web service supplier must register WSDL when he registers services. Then, users can receive WSDL too when he searches for services.

Fast URL Lookup Using URL Prefix Hash Tree (URL Prefix 해시 트리를 이용한 URL 목록 검색 속도 향상)

  • Park, Chang-Wook;Hwang, Sun-Young
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.1
    • /
    • pp.67-75
    • /
    • 2008
  • In this paper, we propose an efficient URL lookup algorithm for URL list-based web contents filtering systems. Converting a URL list into URL prefix form and building a hash tree representation of them, the proposed algorithm performs tree searches for URL lookups. It eliminates redundant searches of hash table method. Experimental results show that proposed algorithm is $62%{\sim}210%$ faster, depending on the number of segment, than conventional hash table method.

A Study on the Establishment of Evaluation Criterion for the Housing Information Related Internet Web Sites (주거 관련 정보 사이트의 평가기준 설정에 관한 연구)

  • Park, Hyun-Ok
    • Korean Journal of Human Ecology
    • /
    • v.10 no.1
    • /
    • pp.83-91
    • /
    • 2001
  • Currently, obtaining information about the housing studies through the internet web sites is one of the outstanding mediums. Those are of the housings, architecture, interior design, furniture products, hotels and its journals, etc., and out of all those informations are the highly expected value of use. But. it may causes the public users to experience a negative effect, because many of those informations provided on the internet web sites related to the housing studies/informations are not providing an equal quality of information. And measuring the quality is also not easy. This study focuses on the establishment of evaluation criterion for the housing information-related internet web sites. In such a vein, it proposes a clear model to evaluate the information qualities with the 43 questionnaires / examining items. To test the questionnaires/rating items, the analysis has been implemented which has shown the reciprocal effect between the 2 major factors. One major factor with 4 variables on the information searches are (1) the accuracy/reliability of contents and techniques, (2) the design of a picture and communication, (3) the readability and security, and (4) the security of private information, and the other factor with 3variables on the additional services are (1) the diversities of contents and ease of orderings, (2) the abilities of search and e-mail, and (3) the events and after services. This study/rating model will provide the users with a fundamental material in evaluating the quality of housing information on the internet web sites.

  • PDF

Navigation Tool of Web Version Repository for Software Cooperation Development Environment (소프트웨어 공동 개발 환경을 위한 웹 버전 저장소의 항해 도구)

  • Kim, Soo-Yong;Choi, Dong-Oun
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.813-818
    • /
    • 2002
  • This paper describes how to convert the *.mdl design information generated from the UML editor into the corresponding XML data, which is arranged to be saved in the relational database system. Also, various design informations can be referred and modified to make teams collaborate with each other on the web through the web browser. In addition, we provide an environment in which all the project team members can share a lot of source codes and execution files as well as object files produced from a web-based collaborative development environment. This thesis is the study about a navigation tool system that aids software developers in managing their web-based searches for relationships of design information.

Web Interface Agent based on Learning using Information Extraction (정보추출을 이용한 학습기반의 웹 인터페이스 에이전트)

  • 이말례;배금표
    • Journal of the Korean Society for information Management
    • /
    • v.19 no.1
    • /
    • pp.5-22
    • /
    • 2002
  • Users usually search for the required information via search engines which contain locations of the information. However. as the amount of data gets large, the result of the search is often not the information that users actually want. In this paper a web guide is proposed in order to resolve this problem. The web guide uses case-based learning method which stores and utilizes cases based on the keywords of user's action and agent's visit. The proposed agent system learns the user's visiting actions following the input of the data to be searched, and then helps rapid searches of the data wanted.