• Title/Summary/Keyword: Data Index Information

Search Result 2,735, Processing Time 0.036 seconds

Development of a Korea SCI System for Efficient Citation Analysis (효율적인 인용분석을 위한 한국 SCI 시스템의 개발)

  • 이계준;조현양;최재황;윤희준
    • Journal of KIISE:Databases
    • /
    • v.31 no.2
    • /
    • pp.174-182
    • /
    • 2004
  • In order to produce information the author usually reference other authors' work. A citation index leads users to papers by citations. Citations lead the user to desired information. In this paper, KSCI(Korea Science Citation Index) which defines the relationships between citing documents and cited documents has been constructed. KSCI System is to solve problems for recursive retrieval in ISI's SCI(Science Citation Index) Path Encoding Indexing technique was used to solve the problems. From the analysis of data, this system has efficiency about 8.98% in the aspect of data storage. In the aspect of retrieval, there was efficiency between citing documents and cited documents, especially there was over 40% of efficiency in the retrieval of cited documents. It is concluded that suggested KSCI system will provide efficient storage and retrieval system.

Design of an Efficient Parallel High-Dimensional Index Structure (효율적인 병렬 고차원 색인구조 설계)

  • Park, Chun-Seo;Song, Seok-Il;Sin, Jae-Ryong;Yu, Jae-Su
    • Journal of KIISE:Databases
    • /
    • v.29 no.1
    • /
    • pp.58-71
    • /
    • 2002
  • Generally, multi-dimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amount of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel high-dimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-n$\times$mD(disk) architecture which is the hybrid type of nP-nD and lP-nD. Its node structure increases fan-out and reduces the height of a index tree. Also, A range search algorithm that maximizes I/O parallelism is devised, and it is applied to K-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.

A Study on the Improvement Plan of Business District Information System

  • Song, Ha-Ryeong;Kim, Young-Ki;Kim, Seung-Hee
    • Journal of Distribution Science
    • /
    • v.14 no.6
    • /
    • pp.27-37
    • /
    • 2016
  • Purpose - This study aims to suggest a developmental direction to small enterprisers who start their business. The developmental direction makes the small enterprisers more stable with providing the Business District Information System service, which offers the location and business area's information aimed at pre-enterprisers after analyzing its overcrowded index's current state and problems. Research design, data, and methodology - This research proposes the developmental direction for helping the pre-small enterprisers to have more stability through examining the Business District Information System's-operated by Small Enterprise and Market Service-overcrowded index's current state and problems. Results - This system has drawbacks about giving the start-up overcrowded index as follows: ① non-accurate consultative group for sharing the DB ② providing analysis information, not evaluation information ③ not to anticipate the changes of business types & the flow of business district and perceive the symptom data with providing predictive information. Conclusions - This system should be more publicized through the mass media for making it approachable with collecting the user's opinion and investigating customer satisfaction & the level of awareness.

Analysis of Generalized Impact Factors and the Indices of Journals

  • Abbas, Ash Mohammad
    • Journal of Information Processing Systems
    • /
    • v.7 no.2
    • /
    • pp.341-354
    • /
    • 2011
  • Analyzing the relationships among the parameters for quantifying the quality of research published in journals is a challenging task. In this paper, we analyze the relationships between the impact factor, h-index, and g-index of a journal. To keep our analysis simple and easy to understand, we consider a generalized version of the impact factor where there is no time window. In the absence of the time window, the impact factor converges to the number of citations received per paper. This is not only justified for the impact factor, it also simplifies the analysis of the h-index and g-index as well because addition of a time window in the form of years complicates the computation of indices too. We derive the expressions for the relationships among impact factor, h index, and g-index and validate them using a given set of publication-citation data.

A Resource Discovery with Data Dissemination over Unstructured Mobile P2P Networks

  • Bok, Kyoung-Soo;Kwak, Dong-Won;Yoo, Jae-Soo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.3
    • /
    • pp.815-834
    • /
    • 2012
  • Recently, along with the innovative development of wireless communication techniques and mobile devices, mobile P2P services in mobile wireless networks have gained a lot of attention. In this paper, we propose a resource discovery scheme with data dissemination over mobile P2P networks. In the proposed scheme, each peer manages a local information table, a resource index table, and a routing table in a local database to enhance the accuracy and cost of resource discovery. The local information table stores the status of a mobile peer, and the resource index table stores the resource information of the neighbor peers via the ranking function. The routing table is used to communicate with the neighbor peers. We use a timestamp message to determine whether or not the resource index table will be changed before the resource information is exchanged. Our ranking function considers the interest and mobility of the mobile peer and prioritizes the resource information transmitted from the neighbor peers. It is shown via various experiments that the proposed scheme outperforms the existing scheme.

Determination of Moisture Index in Korea

  • Ra, Jong Bum
    • Journal of the Korean Wood Science and Technology
    • /
    • v.46 no.4
    • /
    • pp.301-308
    • /
    • 2018
  • This study aimed to obtain basic climate information for effective moisture control in wood in Korea. Two independent climate indexes, namely drying index (DI) and wetting index (WI), were determined using hourly weather data for 82 locations recorded from 2009 to 2017. These data were collected from the Korea Meteorological Administration (KMA). Hourly data had not been measured prior to 2009. DI and WI revealed that all regions were cold and wet except Baengnyeongdo, which was classified as a cold and dry region. DI and WI were normalized assuming that wetting and drying were equally important phenomena. Then, the normalized indexes were combined into moisture index (MI) to rank the moisture loading of the regions. The MIs showed that Seogwipo had the greatest moisture loading in Korea, followed by Seongsan, Namhae, and Geoje. The MIs suggested that Korea exhibited severe moisture loading. Further studies are required to investigate the relation between MI and moisture content on wood surfaces from a wood maintenance point of view.

Nationally-Funded R&D Projects Data Based Dynamic Convergence Index Development: Focused On Life Science & Public Health Area (국가 연구개발(R&D) 과제 데이터 기반 동적 융합지표에 관한 연구: 생명·보건의료 분야를 중심으로)

  • Lee, Doyeon;Kim, Keunhwan
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.25 no.2_2
    • /
    • pp.219-232
    • /
    • 2022
  • The aim of this study is to provide the dynamic convergence index that reflected the inherent characteristics of the convergence phenomenon and utilized the nationally-funded R&D projects data, thereby suggesting useful information about the direction of the national convergence R&D strategy. The dynamic convergence index that we suggested was made of two indicators: persistency and diversity. From a time-series perspective, the persistency index, which measures the degree of continuous convergence of multidisciplinary nationally-funded R&D projects, and the diversity index, which measures the degree of binding with heterogeneous research areas. We conducted the empirical experiment with 151,248 convergence R&D projects during the 2015~2021 time period. The results showed that convergence R&D projects in both public health and life sciences appeared the highest degree of persistency. It was presumed that the degree of persistency has increased again due to the COVID-19 pandemic. Meanwhile, the degree of diversity has risen with combining with disciplinary such as materials, chemical engineering, and brain science areas to solve social problems including mental health, depression, and aging. This study not only provides implications for improving the concept and definition of dynamic convergence in terms of persistency and diversity for national convergence R&D strategy but also presented dynamic convergence index and analysis methods that can be practically applied for directing public R&D programs.

Three-dimensional Information and Refractive Index Measurement Using a Dual-wavelength Digital Holographic

  • Shin, Sang-Hoon;Yu, Young-Hun
    • Journal of the Optical Society of Korea
    • /
    • v.13 no.2
    • /
    • pp.173-177
    • /
    • 2009
  • Digital holographic microscopy allows optical path difference measurement. Optical path difference depends on the both refractive index and morphology of sample. We developed a dual-wavelength in-line digital holographic microscope that can measure simultaneously the refractive index and morphology of a sample, providing highly precise three-dimensional information. Here we propose theoretical and experimental methods for dual-wavelength in-line digital holographic microscopy. The measured data were reasonable, although there was data error. By improving the experimental method, we could measure the refractive index more precisely and obtain more accurate three-dimensional information on samples.

GOOD 2.0 : a Geographical Data Manager using Spatial indices (GOOD 2.0 : 공간 인덱스를 사용한 지리 데이타 관리기)

  • Oh, Byoung-Woo;Han, Ki-Joon
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.3 no.2 s.6
    • /
    • pp.137-149
    • /
    • 1995
  • A spatial index is necessary to support an efficient search in a geographical information system (GIS) that is important in these days. In this paper, we design and implement a geographical data manager, called GOOD (Geo-object Oriented Data Manager) 2.0, by extending GOOD 1.0 with a spatial index processing module. That is, R-tree and R*-tree are used as a spatial index in this paper to make an efficient search possible. In addition, this paper conducts a performance evaluation to measure the improvement in search efficiency and analyzes the results of the performance evaluation. When the performance evaluation is carried out, we consider various environment factors to allow an GIS administrator to use the results as a basic data in selecting an appropriate spatial index.

  • PDF

Segment-Based Inverted Index for Querying Large XML Documents (대용량 XML 문서의 효율적인 질의 처리를 위한 세그먼트 기반 역 인덱스)

  • Jeong, Byeong-Soo;Lee, Hiye-Ja
    • Journal of Information Technology Services
    • /
    • v.7 no.3
    • /
    • pp.145-157
    • /
    • 2008
  • The existing XML storage methods which use relational data model, usually store path information for every node type including literal contents in order to keep the structural information of XML documents. Such path information is usually maintained by an inverted index to efficiently process XPath queries for large XML documents. In this study, We propose an improved approach that retrieve information from the large volume of XML documents stored in a relational database, while using a segment-based inverted index for path searches. Our new approach can reduce the number of searching an inverted index for getting target path information. We show the effectiveness of this approach through several experiments that compare XPath query performance with the existing methods.