• Title/Summary/Keyword: Indexed pages

Search Result 7, Processing Time 0.023 seconds

Webometrics Ranking of Digital Libraries of Iranian Universities of Medical Sciences

  • Dastani, Meisam;Atarodi, Alireza;Panahi, Somayeh
    • International Journal of Knowledge Content Development & Technology
    • /
    • v.8 no.3
    • /
    • pp.41-52
    • /
    • 2018
  • Digital Library websites plays an important role in dissemination of information of the institution and library resources. It acts as a trustworthy mirror of the institute. To evaluate the library website performance webometrics tools and indicators are required. The aim of the present research is study the webometrics of Digital Libraries of Iranian Universities of Medical Sciences on the Web to determine the amount of the visibility a website and web pages. The URL and link of 42 digital library website is obtained directly by visiting the university's website. To extract the number of indexed web pages (size), rich files have used the Google search engine Also, to extract the number of scientific resources retrieved have used the Google Scholar search engine. To calculate and obtain the number of links received have used the MOZ search engine. Generally, the results indicated that the website of Iranian digital libraries did not have a good performance in term of webometric indexes, and none of them were not rated at all indexes, only some of the websites mentioned in one or two indicators.

A Study on an Efficient Solution to the Synonym Problem using Page Alignment (페이지 정렬을 이용한 효과적인 동의어 문제 해결 기법에 관한 연구)

  • 김제성;민상렬;전상훈;안병철;정덕균;김종상
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.2
    • /
    • pp.37-46
    • /
    • 1996
  • This paper proposes a cost-effective solution to the synonym problem of virtual caches. In the proposed solution, a minimal hardware addition guarantees the correctness whereas the software counterpart helps improve the performance. The key to this proposed solution is an addition of a small physically-indexed cache called U-cache. The U-cache maintains the reverse translation information of the cache blocks that belong to unaligned virtual pages only, where aligned measns that the lower bits of the virtual page number match those of the corresponding physical page number. The page alignment is a simple software optimization to improve the performance of the U-cche hardware. With the combination of both hardware and software, the proposed solution reduces the hardware costs and minimizes software modification and performance degradation. Performance evaluation base on ATUM traces shows that a U-cache, with only a few entries, performs almost as well as fully-configured hardware-based solution when more than 95% of the pages are aligned.

  • PDF

An Efficient Encryption/Decryption Approach to Improve the Performance of Cryptographic File System in Embedded System (내장형 시스템에서 암호화 파일 시스템을 위한 효율적인 암복호화 기법)

  • Heo, Jun-Young;Park, Jae-Min;Cho, Yoo-Kun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.2
    • /
    • pp.66-74
    • /
    • 2008
  • Since modem embedded systems need to access, manipulate or store sensitive information, it requires being equipped with cryptographic file systems. However, cryptographic file systems result in poor performance so that they have not been widely adapted to embedded systems. Most cryptographic file systems degrade the performance unnecessarily because of system architecture. This paper proposes ISEA (Indexed and Separated Encryption Approach) that supports for encryption/decryption in system architecture and removes redundant performance loss. ISEA carries out encryption and decryption at different layers according to page cache layer. Encryption is carried out at lower layer than page cache layer while decryption at upper layer. ISEA stores the decrypted data in page cache so that it can be reused in followed I/O request without decryption. ISEA provides page-indexing which divides page cache into cipher blocks and manages it by a block. It decrypts pages partially so that it can eliminate unnecessary decryption. In synthesized experiment of read/write with various cache hit rates, it gives results suggesting that ISEA has improved the performance of encryption file system efficiently.

A Scheme that Transcodes from Dynamic Object of PC Web Page to Mobile Web Contents with DOM (DOM을 이용하여 PC 웹 페이지의 다이나믹 오브젝트를 모바일 웹 컨텐츠로 변환하는 기법)

  • Kim, Jong-Keun;Ko, Hee-Ae;Sim, Kun-Ho;Kang, Eui-Sun;Lim, Young-Hwan
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.648-653
    • /
    • 2008
  • With development of mobile communications terminal and expansion of mobile Internet, a large number of users can use mobile web contents at anytime and anywhere and will demand service of greater contents. Due to such demand, many studies are being carried out on transcoding contents so that wired web contents can be used in mobile web. However, transcoding and creation of mobile web contents involve difficulties because specifications available from telecommunications companies and mobile terminals have not been standardized. Especially, in order for serving dynamic object of wired web page contents to dynamically change according to time or user, it is required not only to program scripts to suit each terminal, but also to transcode the resources used in advance. For solution to this problem, this study uses the hierarchy structure of DOM (document object model) to display structural characteristics of wired web page. In other words, this study proposes the following technique Wired web pages are analyzed and the results are established as data structure. Then, dynamic object is extracted and the domain is indexed so that, when serving mobile web page, information can be extracted at the indexed position to create mobile web contents for service on real-time basis.

  • PDF

A Scheme that Transcodes and Services from PC Web Page to Mobile Web Page of Dynamic Object with DOM (DOM을 이용한 PC 웹 페이지에서 모바일 웹 페이지로의 다이나믹 오브젝트 변환 및 서비스 기법)

  • Kim, Jong-Keun;Kang, Eui-Sun;Sim, Kun-Jung;Ko, Hee-Ae;Lim, Young-Hwan
    • The KIPS Transactions:PartD
    • /
    • v.14D no.3 s.113
    • /
    • pp.355-362
    • /
    • 2007
  • With development of mobile communications terminal and expansion of mobile Internet, a large number of users can use mobile web contents at anytime and anywhere and will demand service of greater contents. Due to such demand, many studies are being carried out on transcoding contents so that wired web contents can be used in mobile web. However, transcoding and creation of mobile web contents involve difficulties because specifications available from telecommunications companies and mobile terminals have not been standardized. Especially, in order for serving dynamic object of wired web page contents to dynamically change according to time or user, it is required not only to program scripts to suit each terminal, but also to transcode the resources used in advance. for solution to this problem, this study uses the hierarchy structure of DOM (document object model) to display structural characteristics of wired web page. In other words, this study proposes the following technique. Wired web pages are analyzed and the results are established as data structure. Then, dynamic object is extracted and the domain is indexed so that, when serving mobile web page, information can be extracted at the indexed position to create mobile web contents for service on real-time basis. Also, this study aims at developing an editing device to edit mobile web contents and mobile web service server to service the edited contents by applying the above technique.

XML based Dynamic Search Agent for the Internet Efficient Multicast (인터넷 정보 검색을 위한 XML 기반 동적 탐색 에이전트 개발연구)

  • 이양원
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.598-601
    • /
    • 2003
  • As the amount of information on the WWW is increasing at a very high speed, the role of search engines has become more necessary and important. Yet, current popular search engines have a limitation of scalability because the more information those engines gather, the more garbage hit search results are produced, thus, XML based metadata has recently been the issue of much focus. Metadata is information about information, which using a small potion of data can express the fundamental information about other information. XML enables data to be expressed better organized and well structured. Moreover, the information in those current efficiency and make them disappointed by dead links and obsolete pages. this is because the information was collected and indexed in advance before users do searching. therefore, a mechanism is required that cam search from current and up-to-date information resources dynamically in real time to avoid retrieving out of data information. In this study, a new concept search agent system for the WWW by using XML based technology is proposed. the implementation of the prototype of this proposed system, the comparison with traditional search engines, and the evaluation of the prototype system are also discussed.

  • PDF

Semantic Conceptual Relational Similarity Based Web Document Clustering for Efficient Information Retrieval Using Semantic Ontology

  • Selvalakshmi, B;Subramaniam, M;Sathiyasekar, K
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3102-3119
    • /
    • 2021
  • In the modern rapid growing web era, the scope of web publication is about accessing the web resources. Due to the increased size of web, the search engines face many challenges, in indexing the web pages as well as producing result to the user query. Methodologies discussed in literatures towards clustering web documents suffer in producing higher clustering accuracy. Problem is mitigated using, the proposed scheme, Semantic Conceptual Relational Similarity (SCRS) based clustering algorithm which, considers the relationship of any document in two ways, to measure the similarity. One is with the number of semantic relations of any document class covered by the input document and the second is the number of conceptual relation the input document covers towards any document class. With a given data set Ds, the method estimates the SCRS measure for each document Di towards available class of documents. As a result, a class with maximum SCRS is identified and the document is indexed on the selected class. The SCRS measure is measured according to the semantic relevancy of input document towards each document of any class. Similarly, the input query has been measured for Query Relational Semantic Score (QRSS) towards each class of documents. Based on the value of QRSS measure, the document class is identified, retrieved and ranked based on the QRSS measure to produce final population. In both the way, the semantic measures are estimated based on the concepts available in semantic ontology. The proposed method had risen efficient result in indexing as well as search efficiency also has been improved.