• Title/Summary/Keyword: 재순위

Search Result 286, Processing Time 0.029 seconds

Technique and Implementation of Dynamic Global Load Balancing using Rank Table (순위 테이블을 이용한 동적 글로벌 로드벨런싱 기법 제안 및 구현)

  • 김성;김경훈;남지승
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04a
    • /
    • pp.517-519
    • /
    • 2001
  • 멀티미디어 서비스를 제공하는 서버의 부하분산을 위해 로드밸런싱 방식을 제안한다. 서버를 지역적으로 분산시키고 분산된 서버는 하나의 클러스터 같이 동작하면서 서버의 시스템 정보(CPU, M/M 사용량)를 체크하여 순위테이블을 작성한다. 작성된 순위테이블을 서버는 교환하면서 도일한 순위테이블을 서버는 갖고 있게 된다. 클라이언트의 연결요청이 있으면 서버는 클라이언트에게 에이전트를 배포하고 에이전트는 클라이언트로 전송되게 된다. 전송된 에이전트는 서버에서 클라이언트간의 전송속도, 유동적으로 변하는 트래픽, 순위테이블을 체크하여 서버를 결정한 후 결정된 서버로 연결을 설정하고 상황에 따라 연결을 재 설정한다. 그 결과 서버 부하를 균등하게 배분하고 그에 따른 서비스 질의 향상을 얻을 수 있다.

Performance Evaluation of Re-ranking and Query Expansion for Citation Metrics: Based on Citation Index Databases (인용 지표를 이용한 재순위화 및 질의 확장의 성능 평가 - 인용색인 데이터베이스를 기반으로 -)

  • HyeKyung Lee;Yong-Gu lee
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.57 no.3
    • /
    • pp.249-277
    • /
    • 2023
  • The purpose of this study is to explore the potential contribution of citation metrics to improving the search performance of citation index databases. To this end, the study generated ten queries in the field of library and information science and conducted experiments based on the relevance assessment using 3,467 documents retrieved from the Web of Science and 60,734 documents published in 85 SSCI journals in the field of library and information science from 2000 to 2021. The experiments included re-ranking of the top 100 search results using citation metrics and search methods, query expansion experiments using vector space model retrieval systems, and the construction of a citation-based re-ranking system. The results are as follows: 1) Re-ranking using citation metrics differed from Web of Science's performance, acting as independent metrics. 2) Combining query term frequencies and citation counts positively affected performance. 3) Query expansion generally improved performance compared to the vector space model baseline. 4) User-based query expansion outperformed system-based. 5) Combining citation counts with suitability documents affected ranking within top suitability documents.

A Reroute Method for the Reliable Transmission of the Highest Priority Data in MPLS Networks (MPLS 망에서 최우선순위 데이터의 신뢰성 있는 전송을 위한 경로 재설정 방법)

  • 최현정;박문화
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.384-386
    • /
    • 2000
  • 인터넷 사용자 수가 급격히 증가하고 사용자들의 요구도 다양해짐에 따라 네트워크 자원의 물리적 증가뿐만 아니라 자원의 제한이라는 상태에서 더 적은 자원으로 만족할 만한 서비스를 제공할 수 있는 트래픽 엔지니어링 기술이 부각되고 있다. 트래픽 엔지니어링은 자원의 효율성을 최적화 하는 동시에 네트워크의 성능을 최적화 시킬 수 있는 기술로 비용이 많이 드는 대규모 망일수록 중요한 기술이기 때문에 네트워크 관련 사업자들에게 필수 요구사항이 되었다. 본 논문에서는 MPLS 망에서 트래픽 엔지니어링 기술의 하나인 신뢰성 있는 데이터 전송을 위한 경로 재설정 방법에 대해 연구하였다. 최우선순위를 가진 트래픽에 대하여 1+1 경로 재설정 방법을 사용하여 전송 중 일어날 수 있는 에러 발생 시 지연시간을 최대한 줄였다.

  • PDF

A Search Efficiency Improvement Method using Internal Contiguity in Query Terms (질의 내부 단어 인접도를 이용한 검색 효율 향상 기법)

  • Yoon, Soung-Woong;Chae, Jin-Ki;Lee, Sang-Hoon
    • Journal of KIISE:Databases
    • /
    • v.35 no.2
    • /
    • pp.192-198
    • /
    • 2008
  • It is difficult to get relevant information on vast Web data. Search engines summarize and store Web information and show the ranked lists based on user queries affected by relative importance and user-adaptation. But these have limitation with showing user-intended information at the top priority. User intention is presented in general within query itself. In this paper, we propose the selective rankup methodology of user-intended search results based on weighting internal contiguity in query terms. With experimental results, we can find user-intended results with 75.8% probability using this simple method only, and efficiency of rerank proposed outperforms ordinary case by $13{\sim}20%$.

A Study on the Policy of Sustainable Domestic Timber Supply Using Delphi Technique and AHP (델파이 기법과 AHP를 이용한 국산재 공급 확대를 위한 정책방안)

  • Kim, Ki Dong;Choi, Kwan
    • Journal of Korean Society of Forest Science
    • /
    • v.101 no.3
    • /
    • pp.434-442
    • /
    • 2012
  • The purpose of this research is to propose policy of domestic timber supply expansion. To recommend polices and draw the priority orders, this study has used Delphi technique and Analytic Hierarchy Process. It has executed to recommend policies of domestic timber supply expand by dividing produce, distribution and consumption parts. As the result of Delphi technique and AHP, 'Infrastructure for domestic timber produce (.239)', 'regional domestic timber gathering complex construction (.202)' and 'a public institution domestic timber use obligation (.126)' policies are derived.

A Study on Cultivation of Stevia rebaudiana Bertoni M. as an Introduced Sweetness Resource Plant in Jeju-do (새로운 감미자원식물 Stevia (Stevia rebaudiana Bertoni M.)의 재배에 관한 연구)

  • 오현도
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.22 no.2
    • /
    • pp.112-120
    • /
    • 1977
  • In Korea. the cultivating standard of stevia is not established yet. Because stevia is across-fertilizing plant. planting a cutting is its available propagation method. This study was made to know the effective propagation growth and adaptability of stevia in Jeju-do, according to the wintering effect and the planting density.

  • PDF

8-heap* : A fast 8-ary implicit Priority queue (8-힢*: 빠른 8-원 묵시 우선순위 큐)

  • Jung, Hae-jae
    • The KIPS Transactions:PartA
    • /
    • v.11A no.3
    • /
    • pp.213-216
    • /
    • 2004
  • Proirity queues(PQ) can be used in applications such as scheduling or sorting. The data structures for PQ can be constructed with or without pointers. The implicit representation without pointers uses less memory space than pointer-based representation. It if shown that a 2-heap, a traditional Implicit PQ based on a binary tree, is slower than an f-heap based on a 8-ary tree. This is because 8-heap utilizes cache memory more efficiently This paper presents a novel fast implicit heap called 8-heap* which is easier to implement. Experimental results show that the 8-heap* is faster than 8-heap as well as 2-heap.

Personalized Bookmark Recommendation System Using Tag Network (태그 네트워크를 이용한 개인화 북마크 추천시스템)

  • Eom, Tae-Young;Kim, Woo-Ju;Park, Sang-Un
    • The Journal of Society for e-Business Studies
    • /
    • v.15 no.4
    • /
    • pp.181-195
    • /
    • 2010
  • The participation and share between personal users are the driving force of Web 2.0, and easily found in blog, social network, collective intelligence, social bookmarking and tagging. Among those applications, the social bookmarking lets Internet users to store bookmarks online and share them, and provides various services based on shared bookmarks which people think important.Delicious.com is the representative site of social bookmarking services, and provides a bookmark search service by using tags which users attach to the bookmarks. Our paper suggests a method re-ranking the ranks from Delicious.com based on user tags in order to provide personalized bookmark recommendations. Moreover, a method to consider bookmarks which have tags not directly related to the user query keywords is suggested by using tag network based on Jaccard similarity coefficient. The performance of suggested system is verified with experiments that compare the ranks by Delicious.com with new ranks of our system.