• Title/Summary/Keyword: Data retrieval

Search Result 1,537, Processing Time 0.03 seconds

Information System Evaluation using IPA Method (IPA 기법을 활용한 정보시스템 평가)

  • Park, Minsoo
    • The Journal of the Convergence on Culture Technology
    • /
    • v.6 no.3
    • /
    • pp.431-436
    • /
    • 2020
  • Information service organizations that provide science and technology information with a relatively short information life cycle for free or paid are in need of reflecting rapidly changing user needs and behaviors and grafting the latest technologies. The purpose of this study is to derive improvements for each system by comparing and analyzing general recognition of science and technology information users' domestic and foreign science and technology information sites and importance by science and technology information attributes. A total of 816 users of science and technology information participated in the online survey, and the collected data were analyzed by quantitative methods including IPA (Importance Performance Analysis) technique. The importance was evaluated by the impact value calculated through regression analysis. As a result of data analysis, the general recognition of users on science and technology information sites was relatively high in national science and technology information services, and Google Scholar and Science Direct were also high. Google Scholar was found to have more strength than improvement. A better understanding of the user's preferred system is a good driving force for improving the lack of existing systems. It is necessary to improve the information retrieval of the science and technology information service system, that is, to improve the search speed and functions, and also to improve the user interface with improved convenience and usability.

The Development of Travel Demand Nowcasting Model Based on Travelers' Attention: Focusing on Web Search Traffic Information (여행자 관심 기반 스마트 여행 수요 예측 모형 개발: 웹검색 트래픽 정보를 중심으로)

  • Park, Do-Hyung
    • The Journal of Information Systems
    • /
    • v.26 no.3
    • /
    • pp.171-185
    • /
    • 2017
  • Purpose Recently, there has been an increase in attempts to analyze social phenomena, consumption trends, and consumption behavior through a vast amount of customer data such as web search traffic information and social buzz information in various fields such as flu prediction and real estate price prediction. Internet portal service providers such as google and naver are disclosing web search traffic information of online users as services such as google trends and naver trends. Academic and industry are paying attention to research on information search behavior and utilization of online users based on the web search traffic information. Although there are many studies predicting social phenomena, consumption trends, political polls, etc. based on web search traffic information, it is hard to find the research to explain and predict tourism demand and establish tourism policy using it. In this study, we try to use web search traffic information to explain the tourism demand for major cities in Gangwon-do, the representative tourist area in Korea, and to develop a nowcasting model for the demand. Design/methodology/approach In the first step, the literature review on travel demand and web search traffic was conducted in parallel in two directions. In the second stage, we conducted a qualitative research to confirm the information retrieval behavior of the traveler. In the next step, we extracted the representative tourist cities of Gangwon-do and confirmed which keywords were used for the search. In the fourth step, we collected tourist demand data to be used as a dependent variable and collected web search traffic information of each keyword to be used as an independent variable. In the fifth step, we set up a time series benchmark model, and added the web search traffic information to this model to confirm whether the prediction model improved. In the last stage, we analyze the prediction models that are finally selected as optimal and confirm whether the influence of the keywords on the prediction of travel demand. Findings This study has developed a tourism demand forecasting model of Gangwon-do, a representative tourist destination in Korea, by expanding and applying web search traffic information to tourism demand forecasting. We compared the existing time series model with the benchmarking model and confirmed the superiority of the proposed model. In addition, this study also confirms that web search traffic information has a positive correlation with travel demand and precedes it by one or two months, thereby asserting its suitability as a prediction model. Furthermore, by deriving search keywords that have a significant effect on tourism demand forecast for each city, representative characteristics of each region can be selected.

Vector Approximation Bitmap Indexing Method for High Dimensional Multimedia Database (고차원 멀티미디어 데이터 검색을 위한 벡터 근사 비트맵 색인 방법)

  • Park Joo-Hyoun;Son Dea-On;Nang Jong-Ho;Joo Bok-Gyu
    • The KIPS Transactions:PartD
    • /
    • v.13D no.4 s.107
    • /
    • pp.455-462
    • /
    • 2006
  • Recently, the filtering approach using vector approximation such as VA-file[1] or LPC-file[2] have been proposed to support similarity search in high dimensional data space. This approach filters out many irrelevant vectors by calculating the approximate distance from a query vector using the compact approximations of vectors in database. Accordingly, the total elapsed time for similarity search is reduced because the disk I/O time is eliminated by reading the compact approximations instead of original vectors. However, the search time of the VA-file or LPC-file is not much lessened compared to the brute-force search because it requires a lot of computations for calculating the approximate distance. This paper proposes a new bitmap index structure in order to minimize the calculating time. To improve the calculating speed, a specific value of an object is saved in a bit pattern that shows a spatial position of the feature vector on a data space, and the calculation for a distance between objects is performed by the XOR bit calculation that is much faster than the real vector calculation. According to the experiment, the method that this paper suggests has shortened the total searching time to the extent of about one fourth of the sequential searching time, and to the utmost two times of the existing methods by shortening the great deal of calculating time, although this method has a longer data reading time compared to the existing vector approximation based approach. Consequently, it can be confirmed that we can improve even more the searching performance by shortening the calculating time for filtering of the existing vector approximation methods when the database speed is fast enough.

VP Filtering for Efficient Query Processing in R-tree Variants Index Structures (R-tree 계열의 인덱싱 구조에서의 효율적 질의 처리를 위한 VP 필터링)

  • Kim, Byung-Gon;Lee, Jae-Ho;Lim, Hae-Chull
    • Journal of KIISE:Databases
    • /
    • v.29 no.6
    • /
    • pp.453-463
    • /
    • 2002
  • With the prevalence of multi-dimensional data such as images, content-based retrieval of data is becoming increasingly important. To handle multi-dimensional data, multi-dimensional index structures such as the R-tree, Rr-tree, TV-tree, and MVP-tree have been proposed. Numerous research results on how to effectively manipulate these structures have been presented during the last decade. Query processing strategies, which is important for reducing the processing time, is one such area of research. In this paper, we propose query processing algorithms for R-tree based structures. The novel aspect of these algorithms is that they make use of the notion of VP filtering, a concept borrowed from the MVP-tree. The filtering notion allows for delaying of computational overhead until absolutely necessary. By so doing, we attain considerable performance benefits while paying insignificant overhead during the construction of the index structure. We implemented our algorithms and carried out experiments to demonstrate the capability and usefulness of our method. Both for range query and incremental query, for all dimensional index trees, the response time using VP filtering was always shorter than without VP filtering. We quantitatively showed that VP filtering is closely related with the response time of the query.

Hypermedia, Multimedia and Hypertext: Definitions and Overview (하이퍼미디어.멀티미디어.하이퍼텍스트: 정의(定義)와 개관(槪觀))

  • Kim, Ji-Hee
    • Journal of Information Management
    • /
    • v.25 no.1
    • /
    • pp.24-46
    • /
    • 1994
  • In this paper I will discuss definitions of hypermedia, multimedia and hypertext. Hypertext is the grouping of relevant information in the form of nodes. These nodes are then connected together through links. In the case of hypertext the nodes contain text or graphics. Multimedia is the combining of different media types for example sound, animation, text, graphics and video for the presentation of information by making use of computers. Hypermedia can be viewed as an extension of hypertext and multimedia. It is based on the concept of hypertext that uses nodes and links in the structuring of information in the system. In this case the nodes consist of an the different data types that are mentioned in the multimedia definition above. The 'node-and-link' concept is used in organisation of the information in hypermedia systems. The 'book' metaphor is an example of the way these systems are implemented. This concept is explained and a few advantages and disadvantages of making use of hypermedia systems are discussed. A new approach for the development of hypermedia systems, namely the knowledge-based approach is now looked into. Joel Peing-Ling Loo proposed this approach because he thought that it is the most effective way for handling this kind of technology. A semantic-based hypermedia model is developed in this approach to formulate solutions for the restrictions in presenting information authoring, maintenance and retrieval. The knowledge-based presentation of information includes the use of conventional data structures. These data structures make use of frames(objects), slots and the inheritance theory that is also used in expert systems. Relations develop between the different objects as these objects are included in the database. Relations can also exist between frames by means of attributes that belong to the frames.

  • PDF

Conceptual Design of Metadata based Research Results Information Retrieval System (메타데이터 기반의 연구성과정보 검색시스템의 개념적 설계)

  • Park, Dong-Jin;Lee, Sang-Tae;Choi, Ki-Suk
    • Journal of Information Management
    • /
    • v.37 no.2
    • /
    • pp.1-20
    • /
    • 2006
  • It has lately been recognized that the sharing and exchanging of the research results information is the critical factor to improve the research productivity. So many institutions are planning or developing the information systems which provide the research information services for researcher. But it has very difficulty in integrating the research resources information due to the dispersion and heterogeneity in data sources, and semantic and structural difference in describing data. We propose the semantic web based methodology and conceptual framework for raising the interoperability of metadata about research results information, which will support the integration of the distributed research data for information services in the end. We first introduce the ontology which is developed based on Standard Metadata of Research Results Information published by STISC. Then to show the applicability in real-world environment, we express the metadata of research information in RDF/RDFS according to ontology. Finally we proposed the conceptual architecture of research information service system which shows the main components, the functional requirements, and the principal and design direction at implementing the system.

The Review of a Standardized Method in Retention-Enema: a Clinical Study (보류관장의 표준화된 방법을 위한 고찰: 임상논문을 중심으로)

  • Song, Eun-Young;Lee, Eui-Ju;Bu, Yong-Min;Shin, Seung-Won;Chai, Kwang-Min;Yoo, Jung-Hee;Kim, Hyo-Jin;Baek, Jong-Heon;Lee, Jun-Hee;Koh, Byung-Hee
    • Journal of Sasang Constitutional Medicine
    • /
    • v.25 no.2
    • /
    • pp.108-114
    • /
    • 2013
  • Objectives This study was aimed to review a standardized method of retention enema by extracting elements associated with methods of retention enema from papers involved. Methods 1) Data sources : Retrieval was made, using 'Enema' or 'Retention Enema' as search words in MEDLINE, The Cochrane Library, KISS, RISS, and NDSL DB. 2) Study selection : Two authors excluded irrelevant papers and chose qualified abstracts in the rest of the papers. The chosen studies were reviewed fully by the authors so that they could screen the significant papers based on the exclusion criteria. 3) Data extraction : Data on the total number of subjects, the target disease, the type, quality, length, diameter of catheter, the insertion length of catheter, the sample, the sample volume, the process of retention enema and the number of performing retention enema were extracted from the selected studies. Results & Conclusions The retention enema can be applied to gastrointestinal diseases, genitourinary diseases, metabolic diseases such as hypertension and diabetes, headaches and neurological disorders. The standardized treatment method is as following: 1) inserting a rental tube of 18-28 Fr that measures 20 to 30 cm into the patient's anus, 2) injecting herbal medicines which have purgative action or benefit on stomach and intestinal tract at the rate of 4 ml/min, and 3) holding them for 10 to 15 minutes.

A Case Study on Implementation of the Shipping Market Information Service System (해운시황정보서비스시스템 구현 사례연구)

  • Lee, Seokyong;Jeong, Myounghwan
    • Journal of Korea Port Economic Association
    • /
    • v.29 no.3
    • /
    • pp.73-94
    • /
    • 2013
  • The necessity of shipping market information services has been on the rise which emphasizes the relevance of transaction information and market information to parties both in and outside the shipping industry. However, previous related researches have been restricted to explorations limited by the offerings of existing shipping market information providers. Users today require effective information, an efficient contents management system, interfacing to help the information provider, graphing and spread sheets to facilitate and present the analyzed information through diverse formats, and reliable web and mobile services to provide information effectively with limited human resources. As a first step, service information has to be defined, so that it takes into account user utility, information retrieval and data development. Second, benchmark information and services must be provided from leading shipbrokers and research institutes. Third, a review of the latest technical trends is required to identify the most suitable technologies for servicing shipping market information. Finally, analysis is required on the implementation of a system with selected technologies, as well as the development of channels to post information which have been analyzed by users. Such a process would enable the continual redefinition of the shipping market information users actively need. The application of an X-Internet based WCMS, with a single-window dashboard providing user-customized information, and used to obtain and manage processes, add spread sheets to sustain calculations using the latest information, graph results, and to input additional information following predefined rules. Access to data and use of the system would require agreement that the system will incorporate user data and user-analyzed information into the market report, web portal, and hybrid app to provide current shipping market information appropriately and accurately to service users.

Mining Maximal Frequent Contiguous Sequences in Biological Data Sequences (생물학적 데이터 서열들에서 빈번한 최대길이 연속 서열 마이닝)

  • Kang, Tae-Ho;Yoo, Jae-Soo
    • The KIPS Transactions:PartD
    • /
    • v.15D no.2
    • /
    • pp.155-162
    • /
    • 2008
  • Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

An Interconnection Method for Streaming Framework and Multimedia Database (스트리밍 프레임워크와 멀티미디어 데이타베이스와의 연동기법)

  • Lee, Jae-Wook;Lee, Sung-Young;Lee, Jong-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.7
    • /
    • pp.436-449
    • /
    • 2002
  • This paper describes on our experience of developing the Database Connector as an interconnection method between multimedia database, and the streaming framework. It is possible to support diverse and mature multimedia database services such as retrieval and join operation during the streaming if an interconnection method is provided in between streaming system and multimedia databases. The currently available interconnection schemes, however have mainly used the file systems or the relational databases that are Implemented with separated form of meta data, which deafs with information of multimedia contents, and streaming data which deals with multimedia data itself. Consequently, existing interconnection mechanisms could not come up with many virtues of multimedia database services during the streaming operation. In order to resolve these drawbacks, we propose a novel scheme for an interconnection between streaming framework and multimedia database, called the Inter-Process Communication (IPC) based Database connector, under the assumption that two systems are located in a same host. We define four transaction primitives; Read, Write, Find, Play, as well as define the interface for transactions that are implemented based on the plug-in, which in consequence can extend to other multimedia databases that will come for some later years. Our simulation study show that performance of the proposed IPC based interconnection scheme is not much far behind compared with that of file systems.