Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Digital libraries (3)
- Arc (1)
- Archive content (1)
- Chordial graphs (1)
- Computer programs (1)
-
- Database management systems (1)
- Domination (1)
- Federated searching (1)
- Information objects (1)
- Information retrieval (1)
- Integrated library systems (1)
- Metadata records (1)
- Object-oriented constructs (1)
- Open Archive Initiative (OAI) (1)
- Open Archives Initiative (OAI) (1)
- Protocol (Computers) (1)
- Relational database (1)
- SODA model (1)
- Service provider (1)
- Software development tools (1)
- Sparse graphs (1)
- World Wide Web (1)
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Efficient Algorithms For Graphs With Few P-4’S, Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Kaiko Müller, Stephan Olariu
Efficient Algorithms For Graphs With Few P-4’S, Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Kaiko Müller, Stephan Olariu
Computer Science Faculty Publications
We show that a large variety of NP-complete problems can be solved efficiently for graphs with 'few' P4's. We consider domination problems (domination, total domination, independent domination. connected domination and dominating clique), the Steiner tree problem, the vertex ranking problem, the pathwidth problem, the path cover number problem, the hamiltonian circuit problem, the list coloring problem and the precoloring extension problem. We show that all these problems can be solved in linear time for the class of (q,q - 4)-graphs, for every fixed q. These are graphs for which no set of at most q. vertices induces more …
Arc - An Oai Service Provider For Digital Library Federation, Xiaoming Liu, Kurt Maly, Mohammad Zubair, Michael L. Nelson
Arc - An Oai Service Provider For Digital Library Federation, Xiaoming Liu, Kurt Maly, Mohammad Zubair, Michael L. Nelson
Computer Science Faculty Publications
The usefulness of the many on-line journals and scientific digital libraries that exist today is limited by the inability to federate these resources through a unified interface. The Open Archive Initiative (OAI) is one major effort to address technical interoperability among distributed archives. The objective of OAI is to develop a framework to facilitate the discovery of content in distributed archives. In this paper, we describe our experience and lessons learned in building Arc, the first federated searching service based on the OAI protocol. Arc harvests metadata from several OAI compliant archives, normalizes them, and stores them in a search …
Smart Objects And Open Archives, Michael L. Nelson, Kurt Maly
Smart Objects And Open Archives, Michael L. Nelson, Kurt Maly
Computer Science Faculty Publications
Within the context of digital libraries (DLs), we are making information objects "first-class citizens". We decouple information objects from the systems used for their storage and retrieval, allowing the technology for both DLs and information content to progress independently. We believe dismantling the stovepipe of "DL-archive-content" is the first step in building richer DL experiences for users and insuring the long-term survivability of digital information. To demonstrate this partitioning between DLs, archives and information content, we introduce "buckets": aggregative, intelligent, object-oriented constructs for publishing in digital libraries. Buckets exist within the "Smart Object, Dumb Archive" (SODA) DL model, which promotes …
Buckets: Smart Objects For Digital Libraries, Michael L. Nelson
Buckets: Smart Objects For Digital Libraries, Michael L. Nelson
Computer Science Faculty Publications
Current discussion of digital libraries (DLs) is often dominated by the merits of the respective storage, search and retrieval functionality of archives, repositories, search engines, search interfaces and database systems. While these technologies are necessary for information management, the information content is more important than the systems used for its storage and retrieval. Digital information should have the same long-term survivability prospects as traditional hardcopy information and should be protected to the extent possible from evolving search engine technologies and vendor vagaries in database management systems. Information content and information retrieval systems should progress on independent paths and make limited …