Digital libraries are widely used for organizing and presenting large collections of artifacts. However, as the digital libraries grow in size, it is becoming increasingly difficult for the user to find all the resources related to his topic of interest. It is labor intensive, time consuming and error prone to identify and link related materials manually. Thus it is important to develop automatic techniques to help the user discover and view the related resources that are available in the digital library. We have implemented an automatic interlinking mechanism for a music digital library system that spans across batch, online and on-demand phases. Since the task of generating the related links is resource and time intensive, distributing the whole process across these three phases significantly reduces the runtime overhead and improves the response time. This mechanism allows the system to display very large texts, with keywords identified and hyperlinked, with no perceivable delay to the user. Storing the artifacts in a structured manner and using the structural metadata to generate interlinkages allows us to create these links across diverse media like images, audio files, music scores, texts, etc. The implemented interlinking technique also scales well with a rapidly changing collection. The related links are displayed on demand, using AJAX technology. This allows the user to view these links without leaving the text, thus ensuring minimum disruption and continuity of action. We also have developed a generic interlinking framework which abstracts the domain independent logic for generating and displaying related links. This generic interlinking framework can be used by domain specific digital libraries to support interlinking of related resources.

Digital libraries are widely used for organizing and presenting large collections of artifacts. However, as the digital libraries grow in size, it is becoming increasingly difficult for the user to find all the resources related to his topic of interest. It is labor intensive, time consuming and error prone to identify and link related materials manually. Thus it is important to develop automatic techniques to help the user discover and view the related resources that are available in the digital library. We have implemented an automatic interlinking mechanism for a music digital library system that spans across batch, online and on-demand phases. Since the task of generating the related links is resource and time intensive, distributing the whole process across these three phases significantly reduces the runtime overhead and improves the response time. This mechanism allows the system to display very large texts, with keywords identified and hyperlinked, with no perceivable delay to the user. Storing the artifacts in a structured manner and using the structural metadata to generate interlinkages allows us to create these links across diverse media like images, audio files, music scores, texts, etc. The implemented interlinking technique also scales well with a rapidly changing collection. The related links are displayed on demand, using AJAX technology. This allows the user to view these links without leaving the text, thus ensuring minimum disruption and continuity of action. We also have developed a generic interlinking framework which abstracts the domain independent logic for generating and displaying related links. This generic interlinking framework can be used by domain specific digital libraries to support interlinking of related resources.

This thesis explores interfaces for locating and comprehending patterns among time-based materials in digital libraries. Time-based digital library materials are like other digital library materials in that they are comprised of data and metadata. In addition, they have a time or period of time attached to each data item. The specific focus of this thesis is on fine-granularity items-items that have relatively little data and cover brief periods of time. In such a context, people often are left to discern patterns of activity by retrospectively making sense of the collection or parts thereof. The specific domain chosen for the implementation is the daily diary of President George Bush, the 41st president of the USA. This project developed a searching and browsing interface, which allows people to study the relationship between activities and people in the library data. As part of this thesis, a corpus of the Presidential daily diary was digitized. Two interfaces were provided to this corpus, one based on a standard information retrieval engine (Greenstone) and another presenting time-based visualizations of data items. An evaluation was conducted to explore the relative strengths and weaknesses of these two interfaces.

Softwares now-a-days have become the life line of modern day organizations. Organizations cannot think of doing their tasks effectively and efficiently without softwares. The extremely competitive environment, zero deficiency and enhanced productivity has made it mandatory for the organizations to carefully choose the appropriate software after comprehensive needs assessment. Softwares simply their tasks and saves a lot of precious time which can be utilized in managing other important issues. Libraries also need softwares if they want to create a parallel digital library with features which we may not find in a traditional library. There are several open source softwares available to create a digital library. For this, firstly the library professionals should be aware of the advantages of open source software and should involve in their development. They should have basic knowledge about the selection, installation and maintenance. Open source software requires a greater degree of computing responsibility than commercial software. Digitization involves huge money to create and maintain and the OSS appears to be a means to reduce it. Among these, DSpace and Greenstone are becoming more popular in India and abroad. This paper deals with the comparison of these two popular OSS from various points of view. The comparative table may help the professionals who are planning to create a digital library.

No description available.

caT, a Petri net-based hypertext system, supports the modeling of user characteristics, contextual information, as well as the policies that govern the operation of a digital library within the infrastructure that presents its contents. Traditionally, users have created caT networks from scratch, thus limiting their use to small collections. In this research, we introduce TcAT, a new authoring tool that supports features for component-based authoring, with a view to enable the creation of large caT nets that can represent complex, real-life spaces such as libraries and museums. TcAT supports graphical, template-based creation of nets as well as a textual language for easy manipulation of large structures. It implements composition operations from Petri net theory to select, categorize, and modify existing net fragments as building blocks for composing larger networks. Authors may switch modes between visual and textual authoring at will, thus combining the strengths of expressing large nets textually and selecting net fragments via point-and-click interaction. A user evaluation of the new authoring mechanisms suggests that this is a promising tool for improving the efficiency of experienced users as well as that of novice users, who are unfamiliar with the Petri net formalism.

Because of the flourishing growth of Internet and IT there are too much information surround us today. We have limited attention but unlimited information. So almost all people today face a novel problem¡X Information Overload. It means our precious resource¡X attention, which is not enough to be used to digest any information that we touch. This problem also exists in Literature Digital Libraries. In today, any Literature Digital Library may collect over one million literatures and documents. Hence a well searching or recommendation mechanism is needful for users. But the traditional ones are not good enough for users. Their searching results may need users to spend more effort to select for users¡¦ true requirement. So this study tries to propose a new personal document recommendation mechanism to solve this problem. This mechanism use keyword-based association rule mining method to find association rules between documents. Then according to these rules and user¡¦s history preference, the mechanism recommend documents for user that they really want. After some evaluations, we prove this study¡¦s mechanism actually solve partial information overload problem. And it has good performance on both ¡§Precision¡¨ and ¡§Recall¡¨ indices.

Literature digital libraries is perhaps one of the most important resources to research as the preserved literature data is vital to any researchers and practitioners who need to now what people have done previously in a particular area. The emergence of World Wide Web (www) further boosts the circulation power of literature digital libraries, and people who are interested in a particular topic may easily find related articles by searching a literature digital library that provides a www interface. However, it is quite often that a given search condition will yield a large number of articles, among which only a small subset will indeed interest the user. To provide more effective and efficient information search, many literature digital libraries are equipped with a recommendation subsystem that recommend articles to a user based on his past or current interest. In this thesis, we adapt the existing approaches for web page recommendation to the recommendation of literature digital libraries. We have investigated issues for article recommendation of a literature digital library. We have developed a recommendation framework in this context that makes use of web log of a literature digital library. This framework consists of three sequential steps: data preparation of the web log, association discovery, and article recommendations. We proposed three alternatives in identifying transactions from a web log, adapted the MSApriori algorithm for discovery large itemsets, and discussed two approaches, namely hypergraph and association based recommendations, for making recommendation. These alternatives and approaches were evaluated using the web log of an operational electronic thesis system at NSYSU. It has been found that query-chosen and session-chosen are better methods for transaction identification, and hypergraph based approach yields better quality of article recommendation and has stable running time.

Thesis (Ph. D.)--University of North Texas, Dec., 2008. / Title from title page display. Includes bibliographical references.

Last year at the ECDL 2004 conference, we reported some initial progress and experiences developing DSpace as an open source community-driven project [8], particularly as seen from an institutional manager’s viewpoint. We also described some challenges and issues. This paper describes the progress in addressing some of those issues, and developments in the DSpace open source community. We go into detail about the processes and infrastructure we have developed around the DSpace code base, in the hope that this will be useful to other projects and organisations exploring the possibilities of becoming involved in or transitioning to open source development of digital library software. Some new challenges the DSpace community faces, particularly in the area of addressing required system architecture changes, are introduced. We also describe some exciting new possibilities that open source development brings to our community.