• Title/Summary/Keyword: retrieval time

Search Result 841, Processing Time 0.033 seconds

The Influence of Information Activities on the Feeling of Happiness for the Elderly in Korea (고령층의 정보활동이 삶의 행복감에 미치는 영향 분석)

  • Lee, Misook;Moon, Jin-Hyun;Kim, Heesop
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.25 no.2
    • /
    • pp.25-40
    • /
    • 2014
  • The purpose of this study is to investigate the influences of the information activities (i.e., the ability of digital device use and the time spent of information retrieval) on the feeling of happiness for the elderly people in Korea. For this study, we conducted face-to-face interview with the elderly over 60 years old living in and around Daegu, Korea and analyzed 371 valid data for frequency, multiple regression and t-test using IBM SPSS version 21.0. The results showed that neither the ability of computer nor mobile phone use affect on the feeling of happiness, whereas both the ability of TV and telephone use influence positively (+) on it. In addition, the time spent of the business-related information retrieval influences negatively (-) on the feeling of happiness, but the time spent of the financial-related information retrieval influences positively (+) on it.

Efficient Storage Management Scheme for Graph Historical Retrieval (그래프 이력 데이터 접근을 위한 효과적인 저장 관리 기법)

  • Kim, Gihoon;Kim, Ina;Choi, Dojin;Kim, Minsoo;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.2
    • /
    • pp.438-449
    • /
    • 2018
  • Recently, various graph data have been utilized in various fields such as social networks and citation networks. As the graph changes dynamically over time, it is necessary to manage the graph historical data for tracking changes and retrieving point-in-time graphs. Most historical data changes partially according to time, so unchanged data is stored redundantly when data is stored in units of time. In this paper, we propose a graph history storage management method to minimize the redundant storage of time graphs. The proposed method continuously detects the change of the graph and stores the overlapping subgraph in intersection snapshot. Intersection snapshots are connected by a number of delta snapshots to maintain change data over time. It improves space efficiency by collectively managing overlapping data stored in intersection snapshots. We also linked intersection snapshots and delta snapshots to retrieval the graph at that point in time. Various performance evaluations are performed to show the superiority of the proposed scheme.

Construction of Theme Melody Index by Transforming Melody to Time-series Data for Content-based Music Information Retrieval (내용기반 음악정보 검색을 위한 선율의 시계열 데이터 변환을 이용한 주제선율색인 구성)

  • Ha, Jin-Seok;Ku, Kyong-I;Park, Jae-Hyun;Kim, Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.10D no.3
    • /
    • pp.547-558
    • /
    • 2003
  • From the viewpoint of that music melody has the similar features to time-series data, music melody is transformed to a time-series data with normalization and corrections and the similarity between melodies is defined as the Euclidean distance between the transformed time-series data. Then, based the similarity between melodies of a music object, melodies are clustered and the representative of each cluster is extracted as one of theme melodies for the music. To construct the theme melody index, a theme melody is represented as a point of the multidimensional metric space of M-tree. For retrieval of user's query melody, the query melody is also transformed into a time-series data by the same way of indexing phase. To retrieve the similar melodies to the query melody given by user from the theme melody index the range query search algorithm is used. By the implementation of the prototype system using the proposed theme melody index we show the effectiveness of the proposed methods.

Query by Visual Example: A Comparative Study of the Efficacy of Image Query Paradigms in Supporting Visual Information Retrieval (시각 예제에 의한 질의: 시각정보 검색지원을 위한 이미지 질의 패러다임의 유용성 비교 연구)

  • Venters, Colin C.
    • Journal of Information Management
    • /
    • v.42 no.3
    • /
    • pp.71-94
    • /
    • 2011
  • Query by visual example is the principal query paradigm for expressing queries in a content-based image retrieval environment. Query by image and query by sketch have long been purported as being viable methods of query formulation yet there is little empirical evidence to support their efficacy in facilitating query formulation. The ability of the searcher to express their information problem to an information retrieval system is fundamental to the retrieval process. The aim of this research was to investigate the query by image and query by sketch methods in supporting a range of information problems through a usability experiment in order to contribute to the gap in knowledge regarding the relationship between searchers' information problems and the query methods required to support efficient and effective visual query formulation. The results of the experiment suggest that query by image is a viable approach to visual query formulation. In contrast, the results strongly suggest that there is a significant mismatch between the searchers information problems and the expressive power of the query by sketch paradigm in supporting visual query formulation. The results of a usability experiment focusing on efficiency (time), effectiveness (errors) and user satisfaction show that there was a significant difference, p<0.001, between the two query methods on all three measures: time (Z=-3.597, p<0.001), errors (Z=-3.317, p<0.001), and satisfaction (Z=-10.223, p<0.001). The results also show that there was a significant difference in participants perceived usefulness of the query tools Z=-4.672, p<0.001.

Improving Real-Time Efficiency of Case Retrieving Process for Case-Based Reasoning

  • Park, Yoon-Joo
    • Asia pacific journal of information systems
    • /
    • v.25 no.4
    • /
    • pp.626-641
    • /
    • 2015
  • Conventional case-based reasoning (CBR) does not perform efficiently for high-volume datasets because of case retrieval time. To overcome this problem, previous research suggested clustering a case base into several small groups and retrieving neighbors within a corresponding group to a target case. However, this approach generally produces less accurate predictive performance than the conventional CBR. This paper proposes a new case-based reasoning method called the clustering-merging CBR (CM-CBR). The CM-CBR method dynamically indexes a search pool to retrieve neighbors considering the distance between a target case and the centroid of a corresponding cluster. This method is applied to three real-life medical datasets. Results show that the proposed CM-CBR method produces similar or better predictive performance than the conventional CBR and clustering-CBR methods in numerous cases with significantly less computational cost.

Real-time control & monitoring software of an AS/RS for CIM (CIM 구축을 위한 자동창고의 실시간 제어 및 모니터링 S/W)

  • 손경준;오구일;정무영;이현용
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10a
    • /
    • pp.826-831
    • /
    • 1991
  • Automated Storage and Retrieval System (AS/RS), which is an element of Computer Integrated Manufacturing (CIM), is a widely used material handling equipment with conveyors and Automatic Guided Vehicles (AGVs). Until now the evaluation of operational policies of AS/RS and control algorithms is done theoretically or by computer simulations. In this study, a real-time control and monitoring software of an AS/RS is also developed by making actually moving AS/RS miniature. A PC-based real-time monitoring program can control the AS/RS directly through the communication port. The monitoring program has additional functions such as storage/retrieval management, inventory management, and statistics management. The program can not only collect the necessary statistics but monitor the current action of the AS/RS concurrently.

  • PDF

Similarity based Rotation Invariant Image Retrieval (유사도를 이용한 회전 불변 영상검색)

  • 권동현;장정동;이태홍
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.581-584
    • /
    • 1999
  • In order to retrieve the rotated image within database by the content based image retrieval system, the algorithms with rotation robustness is usually applied in the procedure of the feature extraction. In that case, it requires much calculation time for feature extraction and much indexed data for feature indexing. Thus. in this paper. we propose the rotation robust algorithm using the block variance of the projected vector. The algorithm does not require additional calculation for feature extraction and is executed within query time by comparing the extracted data. Proposed method can be processed through database including various size of images with shape information and executed with fast response time in implementation.

  • PDF

Real-Time Retrieval of Multimedia Data from Flash Memory Storage Devices (플래시 메모리 저장 장치에서 멀티미디어 데이터의 실시간 재생)

  • Han, Lyong-Cheol;Yang, Hak-Mo;Ryu, Yeon-Seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.1705-1708
    • /
    • 2005
  • Recently, flash memory is becoming popular as storage system to store and retrieve multimedia files. However, there are few researches about multimedia file system for flash memory based storage devices. We have been designing and developing a novel multimedia file systems for flash memory. In this paper, we describe the semantics of real-time retrieval of multimedia data and present scheduling scheme to guarantee the real-time requirements in our multimedia file system.

  • PDF

Pricing the Storage of Inbound Containers with a Discrete Probability Distribution of Retrieval Times

  • Kim, Ki-Young;Kim, Kap-Hwan
    • Industrial Engineering and Management Systems
    • /
    • v.9 no.2
    • /
    • pp.165-177
    • /
    • 2010
  • This paper discusses a method for pricing the storage of inbound containers in a container yard. The pricing structure is characterized by a free-time-limit and a storage price for the storage time that extends beyond the free-time-limit. A cost model is developed from the viewpoint of a public terminal operator as well as a private terminal operator. Unlike a previous study on this issue, this study assumes that the retrieval times follow a discrete probability distribution, which is more realistic than the previous study. A solution procedure is suggested and illustrated by using numerical examples.

NEW RETRIEVAL METHOD FOR AEROSOL OPTICAL PARAMETERS USING DIRECTIONAL REFLECTANCE AND POLARIZATION DATA BY POLDER ON BOARD ADEOS

  • Kawata, Yoshiyuki;Izumiya, Toshiaki
    • Proceedings of the KSRS Conference
    • /
    • 1999.11a
    • /
    • pp.95-99
    • /
    • 1999
  • We proposed a new retrieval method for aerosol's real part of refractive index, optical thickness, and Angstrom exponent using POLDER's directional reflectance and polarization data. We showed that aerosol's real part of refractive index can be retrieved systematically using multi-directional PR(polarization and reflectance) diagrams in a single infrared band by our algorithm for the first time. We examined the retrieved results, by comparing with the simultaneously measured sky observation data at the study site and we obtained a reasonable agreement between them.

  • PDF