List records of an OAI-PMH from a data provider.

Usage

md_listrecords(provider = NULL, from = NULL, until = NULL, set = NULL, metadataPrefix = "oai_dc",
  token = NULL, fuzzy = FALSE)

Arguments

provider
The metadata provider.
from
Specifies that records returned must have been created/update/deleted on or after this date.
until
Specifies that records returned must have been created/update/deleted on or before this date.
set
Optional argument with a setSpec value, which specifies set criteria for selective harvesting.
metadataPrefix
Specifies the metadata format that the records will be returned in.
token
A token previously provided by the server to resume a request where it last left off.
fuzzy
Do fuzzy search or not (default FALSE). Fuzzy uses agrep.

Description

List records for the data sources from the OAI-PMH list, and others not on that list, including PMC, DataCite, Hindawi Journals, Dryad, and Pensoft Journals.

Examples

# Single source md_listrecords(provider = "datacite")
[[1]] .id identifier datestamp setSpec setSpec.1 1 record oai:oai.datacite.org:32153 2011-06-08T08:57:11Z TIB TIB.WDCC 2 record oai:oai.datacite.org:32200 2011-06-20T08:12:41Z TIB TIB.DAGST 3 record oai:oai.datacite.org:32220 2011-06-28T14:11:08Z TIB TIB.DAGST 4 record oai:oai.datacite.org:32241 2011-06-30T13:24:45Z TIB TIB.DAGST 5 record oai:oai.datacite.org:32255 2011-07-01T12:09:24Z TIB TIB.DAGST 6 record oai:oai.datacite.org:32282 2011-07-05T09:08:10Z TIB TIB.DAGST 7 record oai:oai.datacite.org:32309 2011-07-06T12:30:54Z TIB TIB.DAGST 8 record oai:oai.datacite.org:32310 2011-07-06T12:42:32Z TIB TIB.DAGST 9 record oai:oai.datacite.org:32325 2011-07-07T11:17:46Z TIB TIB.DAGST 10 record oai:oai.datacite.org:32326 2011-07-07T11:18:47Z TIB TIB.DAGST 11 record oai:oai.datacite.org:32327 2011-07-07T11:18:48Z TIB TIB.DAGST 12 record oai:oai.datacite.org:32328 2011-07-07T11:18:48Z TIB TIB.DAGST 13 record oai:oai.datacite.org:32329 2011-07-07T11:18:49Z TIB TIB.DAGST 14 record oai:oai.datacite.org:32330 2011-07-07T11:18:49Z TIB TIB.DAGST 15 record oai:oai.datacite.org:32331 2011-07-07T11:18:50Z TIB TIB.DAGST 16 record oai:oai.datacite.org:32332 2011-07-07T11:18:51Z TIB TIB.DAGST 17 record oai:oai.datacite.org:32333 2011-07-07T11:18:51Z TIB TIB.DAGST 18 record oai:oai.datacite.org:32334 2011-07-07T11:18:52Z TIB TIB.DAGST 19 record oai:oai.datacite.org:32335 2011-07-07T11:18:52Z TIB TIB.DAGST 20 record oai:oai.datacite.org:32336 2011-07-07T11:18:53Z TIB TIB.DAGST 21 record oai:oai.datacite.org:32337 2011-07-07T11:18:53Z TIB TIB.DAGST 22 record oai:oai.datacite.org:32338 2011-07-07T11:18:54Z TIB TIB.DAGST 23 record oai:oai.datacite.org:32339 2011-07-07T11:18:54Z TIB TIB.DAGST 24 record oai:oai.datacite.org:32340 2011-07-07T11:18:55Z TIB TIB.DAGST 25 record oai:oai.datacite.org:32341 2011-07-07T11:18:55Z TIB TIB.DAGST 26 record oai:oai.datacite.org:32342 2011-07-07T11:18:56Z TIB TIB.DAGST 27 record oai:oai.datacite.org:32343 2011-07-07T11:18:56Z TIB TIB.DAGST 28 record oai:oai.datacite.org:32344 2011-07-07T11:18:57Z TIB TIB.DAGST 29 record oai:oai.datacite.org:32345 2011-07-07T11:18:57Z TIB TIB.DAGST 30 record oai:oai.datacite.org:32346 2011-07-07T11:18:58Z TIB TIB.DAGST 31 record oai:oai.datacite.org:32347 2011-07-07T11:18:59Z TIB TIB.DAGST 32 record oai:oai.datacite.org:32348 2011-07-07T11:18:59Z TIB TIB.DAGST 33 record oai:oai.datacite.org:32349 2011-07-07T11:19:00Z TIB TIB.DAGST 34 record oai:oai.datacite.org:32350 2011-07-07T11:19:00Z TIB TIB.DAGST 35 record oai:oai.datacite.org:32351 2011-07-07T11:19:01Z TIB TIB.DAGST 36 record oai:oai.datacite.org:32352 2011-07-07T11:19:02Z TIB TIB.DAGST 37 record oai:oai.datacite.org:32353 2011-07-07T11:19:02Z TIB TIB.DAGST 38 record oai:oai.datacite.org:32354 2011-07-07T11:19:03Z TIB TIB.DAGST 39 record oai:oai.datacite.org:32355 2011-07-07T11:19:03Z TIB TIB.DAGST 40 record oai:oai.datacite.org:32356 2011-07-07T11:19:04Z TIB TIB.DAGST 41 record oai:oai.datacite.org:32357 2011-07-07T11:19:04Z TIB TIB.DAGST 42 record oai:oai.datacite.org:32378 2011-07-07T23:00:46Z CDL CDL.CDL 43 record oai:oai.datacite.org:32379 2011-07-07T23:05:38Z CDL CDL.CDL 44 record oai:oai.datacite.org:29737 2011-07-08T09:54:42Z DK DK.DTIC 45 record oai:oai.datacite.org:32385 2011-07-08T16:10:04Z CDL CDL.CDL 46 record oai:oai.datacite.org:32426 2011-07-12T09:51:31Z TIB TIB.HZB 47 record oai:oai.datacite.org:32152 2011-07-12T10:21:28Z TIB TIB.HZB 48 record oai:oai.datacite.org:25453 2011-07-12T10:25:31Z TIB TIB.HZB 49 record oai:oai.datacite.org:25452 2011-07-12T10:29:27Z TIB TIB.HZB 50 record oai:oai.datacite.org:25451 2011-07-12T10:34:53Z TIB TIB.HZB title 1 Climate Simulation with CLM, Climate of the 20th Century run no.3, Data Stream 3: European region MPI-M/MaD 2 Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) 3 Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071) 4 Self-Repairing Programs (Dagstuhl Seminar 11062) 5 Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) 6 Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) 7 Reasoning about Interaction: From Game Theory to Logic and Back (Dagstuhl Seminar 11101) 8 Dagstuhl Reports, Table of Contents, Volume 1, Issue 2, 2011 9 Frontmatter, Table of Contents, Preface, Conference Organization 10 Transaction Logic with Defaults and Argumentation Theories 11 BAAC: A Prolog System for Action Description and Agents Coordination 12 Multi-Criteria Optimization in Answer Set Programming 13 Declarative Processing of Semistructured Web Data 14 CDAOStore: A Phylogenetic Repository Using Logic Programming and Web Services 15 Bayesian Annotation Networks for Complex Sequence Analysis 16 Improving the Outcome of a Probabilistic Logic Music System Generator by Using Perlin Noise 17 Minimizing the overheads of dependent {AND}-parallelism 18 Yet Another Characterization of Strong Equivalence 19 Constraints in Non-Boolean Contexts 20 Abduction in Annotated Probabilistic Temporal Logic 21 Smart test data generators via logic programming 22 Static Type Checking for the Q Functional Language in Prolog 23 Modelling Grammar Constraints with Answer Set Programming 24 Multi-agent Confidential Abductive Reasoning 25 Evolution of Ontologies using ASP 26 An Inductive Approach for Modal Transition System Refinement 27 Compiling Prolog to Idiomatic Java 28 Declarative Output by Ordering Text Pieces 29 Representing the Language of the Causal Calculator in Answer Set Programming 30 Hybrid ASP 31 Canonical Regular Types 32 Synthesis of Logic Programs from Object-Oriented Formal Specifications 33 Automatic Parallelism in Mercury 34 Consistency Techniques for Hybrid Simulations 35 Extensions of Answer Set Programming 36 A Semiring-based framework for fair resources allocation 37 Promoting Modular Nonmonotonic Logic Programs 38 Correct Reasoning about Logic Programs 39 Accepting the natural order of rules in a logic program with preferences 40 Implementation of Axiomatic Language 41 Two Phase Description Logic Reasoning for Efficient Information Retrieval 42 A Global Database of Soil Respiration Data, Version 1.0 43 A global database of soil respiration measurements 44 Advanced stormwater runoff characterization 45 Data from "Ultraconserved Elements Universally Anchor Thousands of Variable Genetic Markers" 46 Untersuchung von Werkstoffen für die Katalyse mit Elektronentomographie - Investigation of materials for catalysis with electron tomography 47 A study of charge transfer kinetics in dye-sensitized surface conductivity solar cells 48 The Role of Cd and Ga in the Cu(In,Ga)S2/CdS Heterojunction Studied with X-Ray Spectroscopic Methods 49 Hydrogen Passivation of Polycrystalline Si Thin Film Solar Cells 50 Nanochemische Zusammensetzungsanalyse mittels anomaler Röntgenkleinwinkelstreuung (ASAXS): Erbium und Ytterbium dotierte Oxyfluorid-Glaskeramiken creator creator.1 creator.2 creator.3 creator.4 1 Lautenschlager, Michael Keuler, Klaus Wunram, Claudia Keup-Thiel, Elke Schubert, Martina 2 Fischer-Hübner, Simone Hoofnagle, Chris Rannenberg, Kai Waidner, Michael Krontiris, Ioannis 3 Fedor V., Fomin Pierre, Fraigniaud Stephan, Kreutzer Dimitrios M., Thilikos 4 Mauro, Pezzé Martin C., Rinard Westley, Weimer Andreas, Zeller 5 Crochemore, Maxime Kari, Lila Mohri, Mehryar Nowotka, Dirk 6 Jansen, Klaus Matieu, Claire Shachnai, Hadas Young, Neal E. 7 Dix, Jürgen Jamroga, Wojtek Samet, Dov 8 Herbstritt, Marc 9 Gallagher, John P. Gelfond, Michael 10 Fodor, Paul Kifer, Michael 11 Dovier, Agostino Formisano, Andrea Pontelli, Enrico 12 Gebser, Martin Kaminski, Roland Kaufmann, Benjamin Schaub, Torsten 13 Hanus, Michael 14 Chisham, Brandon Pontelli, Enrico Son, Tran Cao Wright, Ben 15 Christiansen, Henning Theil Have, Christian Torp Lassen, Ole Petit, Matthieu 16 Nicholson, Colin J. De Schreye, Danny Sneyers, Jon 17 Wang, Peter Somogyi, Zoltan 18 Bochman, Alexander Lifschitz, Vladimir 19 De Koninck, Leslie Brand, Sebastian Stuckey, Peter J. 20 Molinaro, Cristian Sliva, Amy Subrahmanian, V. S. 21 Bulwahn, Lukas 22 Zombori, Zsolt Csorba, János Szeredi, Péter 23 Drescher, Christian Walsh, Toby 24 Ma, Jiefei Russo, Alessandra Broda, Krysia Lupu, Emil 25 Ostrowski, Max Flouris, Giorgos Schaub, Torsten Antoniou, Grigoris 26 Alrajeh, Dalal Kramer, Jeff Russo, Alessandra Uchitel, Sebastian 27 Eichberg, Michael 28 Brass, Stefan 29 Casolary, Michael Lee, Joohyung 30 Brik, Alex Remmel, Jeffrey B. 31 Jackson, Ethan K. Bjørner, Nikolaj Schulte, Wolfram 32 Herranz, Ángel Mariño, Julio 33 Bone, Paul 34 Bottalico, Marco 35 Brik, Alex 36 Campli, Paola 37 Krennwallner, Thomas 38 Kriener, Jael 39 \u008aimko, Alexander 40 Wilson, Walter W. 41 Zombori, Zsolt 42 Bond-Lamberty, B.P.; Thomson, A.M. 43 Bond-Lamberty, B.; Thomson, A.M. 44 Kayhanian, M. 45 Brant C. Faircloth 46 Grothausmann, Roman 47 Friedrich, Dennis 48 Johnson, Benjamin E. 49 Gorka, Benjamin 50 Haas, Sylvio creator.5 creator.6 creator.7 1 Will, Andreas Rockel, Burkhardt Boehm, Uwe 2 Marhöfer, Michael 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 publisher date 1 World Data Center for Climate (WDCC) 2011 2 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 3 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 4 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 5 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 6 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 7 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 8 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 9 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 10 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 11 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 12 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 13 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 14 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 15 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 16 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 17 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 18 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 19 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 20 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 21 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 22 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 23 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 24 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 25 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 26 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 27 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 28 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 29 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 30 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 31 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 32 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 33 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 34 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 35 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 36 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 37 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 38 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 39 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 40 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 41 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany 2011 42 Oak Ridge National Laboratory Distributed Active Archive Center 2010 43 Biogeosciences 2010 44 DTU Library, Technical University of Denmark (DTU) 2005 45 Brant C. Faircloth, John E. McCormack, Nicholas G. Crawford, Michael G. Harvey, Robb T. Brumfield, and Travis C. Glenn 2011 46 Helmholtz-Zentrum Berlin für Materialien und Energy 2011 47 Helmholtz-Zentrum Berlin für Materialien und Energy 2011 48 Helmholtz-Zentrum Berlin für Materialien und Energy 2010 49 Helmholtz-Zentrum Berlin für Materialien und Energy 2010 50 Helmholtz-Zentrum Berlin für Materialien und Energy 2010 identifier.1 subject description 1 urn:nbn:de:tib-10.1594/WDCC/CLM_C20_3_D36 Climate Abstract 2 Computer Science Other 3 Computer Science Other 4 Computer Science Other 5 Computer Science Other 6 Computer Science Other 7 Computer Science Other 8 Computer Science TableOfContents 9 Computer Science Other 10 Computer Science Other 11 Computer Science Other 12 Computer Science Other 13 Computer Science Other 14 Computer Science Other 15 Computer Science Other 16 Computer Science Other 17 Computer Science Other 18 Computer Science Other 19 Computer Science Other 20 Computer Science Other 21 Computer Science Other 22 Computer Science Other 23 Computer Science Other 24 Computer Science Other 25 Computer Science Other 26 Computer Science Other 27 Computer Science Other 28 Computer Science Other 29 Computer Science Other 30 Computer Science Other 31 Computer Science Other 32 Computer Science Other 33 Computer Science Other 34 Computer Science Other 35 Computer Science Other 36 Computer Science Other 37 Computer Science Other 38 Computer Science Other 39 Computer Science Other 40 Computer Science Other 41 Computer Science Other 42 43 44 Stormwater runoff characterization Abstract 45 46 issn:1868-5781 Applied physics 47 issn:1868-5781 Physics 48 issn:1868-5781 Physics 49 issn:1868-5781 Physics 50 issn:1868-5781 Chemistry description.1 1 Project: CLM regional climate model runs forced by the global IPCC scenario runs\nThese regional climate simulations have been funded by the BMBF and computed at DKRZ by the group "Model and Data" of MPI-M, Hamburg, in close cooperation with BTU Cottbus, GKSS Geesthacht and PIK Potsdam. Serving as community model, the climate version of the local model (CLM) of the DWD was used to simulate the regional climate of the 20th century (1960-2000) and 21st century (2001-2100) in Europe. The regional model runs are forced by the global IPCC scenario runs (http://www.grida.no/climate/ipcc/emission/index.htm ) to explore future developments in the European climate on a regional scale.\nCLM (see http://clm.gkss.de ) was run in non hydrostatic mode with 0.165 degree horizontal grid resolution and was forced 6 hourly by the output of the global climate model runs with ECHAM5/MPIOM. The climate of the 20th century was simulated by three 20th century realization runs, set off at different initialization times. The climate of the 21st century was modeled with respect to two IPCC-climate scenarios (A1B and B1) with different assumptions regarding the development of global greenhouse gas concentrations.\nFor storage in and download from this data base, the data has been transformed into time series of single model variables and is provided in two different data streams (referenced as "data stream 2" and "data stream 3"). Data stream 2 is given on a rotated grid with 0.165 deg. spatial resolution (rotated coordinates). Data stream 3 is projected onto a non-rotated grid with 0.2 deg. spatial resolution (usual geographical coordinates). For the data transformation between the respective grids the cdo-routines have been used.\nFor the original model output (referenced as "data stream 0" and "data stream 1") please contact model(at)dkrz.de for further information.\nSee http://sga.wdc-climate.de for more details on CLM simulations in the context of the BMBF funding priority "klimazwei", some useful information on handling climate model data and the data access regulations.\nSummary: The experiment CLM_C20_3_D3 contains European regional climate simulations of the years 1960-2000 on a regular geographical grid. The data are generated during post processing of the corresponding data stream 2 experiment (CLM_C20_3_D2) of regional climate model runs (CLM non hydrostatic, see http://clm.gkss.de ). The simulations of the 20th century (1960-2000) have been forced by the third (_3_) run of the global 20th century climate (EH5-T63L31_OM-GR1.5L40_20C_3_6H) with observed anthropogenic forcing.\nIn data stream 3 (_D3) the output variables of CLM data stream 2 and some additionally derived parameters are stored as time series on a regular grid with a horizontal spacing of 0.2 degree. The model parameters have been transformed onto the regular geographical grid by the CDO routines. Please note, that none of the variables has been corrected for topographical differences between the two grids. The model domain of data stream 3 covers the European region starting at 34.6/-10.6 (lat/lon, centre of lower left grid box) with an increment of 0.2 degree. The number of grid points is 177/238 (lat/lon).\nFor some model variables and additionally derived parameters some statistics on daily, monthly or yearly basis are available. See also http://sga.wdc-climate.de for a list of available parameters.\nPlease contact sga"at"dkrz.de for data request details.\nSee http://sga.wdc-climate.de for more details on CLM simulations in the context of the BMBF funding priority "klimazwei", some useful information on handling climate model data and the data access regulations.\nThe output format is netCDF\nExperiment with CLM 2.4.11 on NEC-SX6(hurrikan)\nraw data: hpss:/dxul/ut/k/k204095/prism/experiments/C20_3 2 \n\t\tThe Dagstuhl Perspectives Workshop "Online Privacy: Towards Informational Self-Determination on the Internet" (11061)\n has been held in February 6-11, 2011 at Schloss Dagstuhl. 30 participants from academia, public sector, and industry \n have identified the current status-of-the-art of and challenges for online privacy as well as derived recommendations \n for improving online privacy. Whereas the Dagstuhl Manifesto of this workshop concludes the results of the working \n groups and panel discussions, this article presents the talks of this workshop by their abstracts. \n\t\t 3 \n\tFrom February 14, 2012 to February 18, 2012, the Dagstuhl Seminar 11071 \n``Theory and Applications of Graph Searching Problems (GRASTA 2011)'' \nwas held in Schloss Dagstuhl~--~Leibniz Center for Informatics.\nDuring the seminar, participants presented their current\nresearch, and ongoing work and open problems were discussed. Abstracts of\nthe presentations given during the seminar as well as abstracts of\nseminar results and open problems are put together in this paper. The first section describes the seminar topics and goals in general.\nThe second section contains the abstracts of the talks and the third section\nincludes the open problems presented during the seminar.\n\t 4 \n\tDagstuhl seminar 11062 ``Self-Repairing Programs'' included 23\nparticipants and organizers from research and industrial communities. \nSelf-Repairing Programs are a new and emerging area, and many participants\nreported that they initially felt their first research home to be in another \narea, such as testing, program synthesis, debugging, self-healing systems, \nor security. Over the course of the seminar, the participants found \ncommon ground in discussions of concerns, challenges, and the state of the\nart. \n\t 5 \n\tSequences form the most basic and natural data\nstructure. They occur whenever information is electronically\ntransmitted (as bit streams), when natural language text is spoken or\nwritten down (as words over, for example, the latin alphabet), in the\nprocess of heredity transmission in living cells (as DNA sequence) or\nthe protein synthesis (as sequence of amino acids), and in many more\ndifferent contexts. Given this universal form of representing\ninformation, the need to process strings is apparent and actually a\ncore purpose of computer use. Algorithms to efficiently search\nthrough, analyze, (de-)compress, match, learn, and encode/decode strings\nare therefore of chief interest. Combinatorial problems about strings\nlie at the core of such algorithmic questions. Many such combinatorial\nproblems are common in the string processing efforts in the different\nfields of application.\n\nScientists working in the fields of Combinatorics on Words, Computational Biology, Stringology, Natural Computing, and Machine Learning were invited to consider the seminar's topic from a~wide range of perspectives. This report documents the program and the outcomes of Dagstuhl Seminar 11081\n``Combinatorial and Algorithmic Aspects of Sequence Processing''.\n\t 6 \n\tFrom 27.02.2011 to 4.03.2011, the Dagstuhl Seminar 11091 ``Packing and Scheduling Algorithms for Information and Communication Services'' was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and on-going work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.\n\t 7 \n\tThis report documents the program and the outcomes of Dagstuhl Seminar 11101 ``Reasoning about Interaction: From Game Theory to Logic and Back''.\n\nThe notion of interaction is crucial in several disciplines, including\nsocial science, operational research, and\neconomics. Two frameworks are most prominent in the formal treatment of\ninteraction: game theory and mathematical logic. Quantitative analysis is\nusually conducted using models and tools of game theory. At the same time,\nlogic provides vocabulary and methods to study interaction in a qualitative\nway.\n\nThe aim of the seminar was to bring together researchers who approach\ninteraction-related phenomena from different perspectives (and with\ndifferent conceptual tools). We hoped that, by synergy and exchange of\nexpertise, a more integrative view of interaction could be obtained. In particular, we focussed on how interaction between individual entities (be it humans, robots and/or virtual creatures) can lead to emergence of social structures, collective behavior, and teamwork - and, ultimately, help all involved parties benefit from cooperation.\n\t 8 \n Dagstuhl Reports, Volume 1, Issue 2, Table of Contents.\n\t\t 9 \n \tFrontmatter, Table of Contents, Preface, Conference Organization\n \t 10 \n \tTransaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many advanced applications, including modeling robot movements, actions specification, and planning in artificial intelligence. In a parallel development, much work has been devoted to various theories of defeasible reasoning. In this paper, we unify these two streams of research and develop Transaction Logic with Defaults and Argumentation Theories, an extension of both Transaction Logic and the recently proposed unifying framework for defeasible reasoning called Logic Programs with Defaults and Argumentation Theories. We show that this combination has a number of interesting applications, including specification of defaults in action theories and heuristics for directed search in artificial intelligence planning problems. We also demonstrate the usefulness of the approach by experimenting with a prototype of the logic and showing how heuristics expressed as defeasible actions can significantly reduce the search space as well as execution time and space requirements.\n \t 11 \n \tThe paper presents a system for knowledge representation and coordination, where autonomous agents reason and act in a shared environment. Agents autonomously pursue individual goals, but can interact through a shared knowledge repository. In their interactions, agents deal with problems of synchronization and concurrency, and have to realize coordination by developing proper strategies in order to ensure a consistent global execution of their autonomously derived plans. This kind of knowledge is modeled using an extension of the action description language B. A distributed planning problem is formalized by providing a number of declarative specifications of the portion of the problem pertaining a single agent. Each of these specifications is executable by a stand-alone CLP-based planner. The coordination platform, implemented in Prolog, is easily modifiable and extensible. New user-defined interaction protocols can be integrated.\n \t 12 \n \tWe elaborate upon new strategies and heuristics for solving multi-criteria optimization problems via Answer Set Programming (ASP). In particular, we conceive a new solving algorithm, based on conflictdriven learning, allowing for non-uniform descents during optimization. We apply these techniques to solve realistic Linux package configuration problems. To this end, we describe the Linux package configuration tool aspcud and compare its performance with systems pursuing alternative approaches.\n \t 13 \n \tIn order to give application programs access to data stored in the web in semistructured formats, in particular, in XML format, we propose a domain-specific language (DSL) for declarative processing such data. Our language is embedded in the functional logic programming language Curry and offers powerful matching constructs that enable a declarative description of accessing and transforming XML data. We exploit advanced features of functional logic programming to provide a high-level and maintainable implementation of our language. Actually, this paper contains the complete code of our implementation so that the source text of this paper is an executable implementation of our embedded DSL.\n \t 14 \n \tThe CDAOStore is a portal aimed at facilitating the storage and retrieval of data and metadata associated to studies in the field of evolutionary biology and phylogenetic analysis. The novelty of CDAOStore lies in the use of a semantic-based approach to the storage and querying of data. This enables CDAOStore to overcome the data format restrictions and complexities of other repositories (e.g., TreeBase) and to provide a domain-specific query interface, derived from studies of querying requirements for phylogenetic databases.\n CDAOStore represents the first full implementation of the EvoIO stack, an inter-operation stack composed of a formal ontology (the Comparative Data Analysis Ontology), an XML exchange format (NeXML), and a web services API (PhyloWS). CDAOStore has been implemented on top of an RDF triple store, using a combination of standard web technologies and logic programming technology. In particular, we employed Prolog to support some of the format transformation tasks and, more importantly, in the implementation of several of the domain-specific queries, whose structure is beyond the reach of standard RDF query languages (e.g., SPARQL). CDAOStore is operational and it already hosts over 90 million RDF triples, imported from TreeBase or submitted by other domain scientists.\n \t 15 \n \tProbabilistic models that associate annotations to sequential data are widely used in computational biology and a range of other applications. Models integrating with logic programs provide, furthermore, for sophistication and generality, at the cost of potentially very high computational complexity. A methodology is proposed for modularization of such models into sub-models, each representing a particular interpretation of the input data to be analysed. Their composition forms, in a natural way, a Bayesian network, and we show how standard methods for prediction and training can be adapted for such composite models in an iterative way, obtaining reasonable complexity results. Our methodology can be implemented using the probabilistic-logic PRISM system, developed by Sato et al, in a way that allows for practical applications.\n \t 16 \n \tAPOPCALEAPS is a logic-based music generation program that uses high level probabilistic rules. The music produced by APOPCALEAPS is controlled by parameters that can be customized by a user to create personalized songs. Perlin noise is a type of gradient noise algorithm which generates smooth and controllable variations of random numbers. This paper introduces the idea of using a Perlin noise algorithm on songs produced by APOPCALEAPS to alter their melody. The noise system modifies the song\u0092s melody with noise values that fluctuate as measures change in a song. Songs with more notes and more elaborate differences between the notes are modified by the system more than simpler songs. The output of the system is a different but similar song. This research can be used for generation of music with structure where one would need to generate variants on a theme.\n \t 17 \n \tParallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it adds overheads that aren't present in sequential programs. This is an important problem for parallel logic programming systems, because almost every action in such programs requires accessing variables, and the traditional approach of adding synchronization code to all such accesses is so prohibitively expensive that a parallel version of the program may run more slowly on four processors than a sequential version would run on one processor. We present a program transformation for implementing dependent AND-parallelism in logic programming languages that uses mode information to add synchronization code only to the variable accesses that actually need it.\n \t 18 \n \tStrong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas.\n \t 19 \n \tIn high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of constraints on local variables in non-Boolean expressions. Specifications using these facilities are often more succinct. However, these specifications are typically executed on solvers that only support questions of the form of existentially quantified conjunctions of constraints.\n We show how we can translate expressions with constraints appearing in non-Boolean contexts into conjunctions of ordinary constraints. The translation is clearly structured into constrained type elimination, local variable lifting and partial function elimination. We explain our approach in the context of the modelling language Zinc. An implementation of it is an integral part of our Zinc compiler.\n \t 20 \n \tAnnotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn)rules of the form ``formula G becomes true K time units after formula F became true with L to U% probability.''\n In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program Pi, a set of formulas H that can be ``added'' to Pi, and a goal G, is there a subset S of H such that Pi \\cup S is consistent and entails the goal G? In this paper, we study the complexity of the Basic APT Abduction Problem (BAAP). We then leverage a geometric characterization of BAAP to suggest a set of pruning strategies when solving BAAP and use these intuitions to develop a sound and complete algorithm.\n \t 21 \n \tWe present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programming languages (e.g. Standard ML, OCaml) from specifications in Isabelle. In contrast to naive type-based test data generators, the smart generators take the preconditions into account and only generate tests that fulfill the preconditions. The smart generators are constructed by a compiler that reformulates the preconditions as logic programs and analyzes them by an enriched mode inference. From this inference, the compiler can construct the desired generators in the functional programming language. These test data generators are applied to find errors in specifications, as we show in a case study of a hotel key card system.\n \t 22 \n \tWe describe an application of Prolog: a type checking tool for the Q functional language. Q is a terse vector processing language, a descendant of APL, which is getting more and more popular, especially in financial applications. Q is a dynamically typed language, much like Prolog. Extending Q with static typing improves both the readability of programs and programmer productivity, as type errors are discovered by the tool at compile time, rather than through\n debugging the program execution. We designed a type description syntax for Q and implemented a parser for both the Q language\n and its type extension. We then implemented a type checking algorithm using constraints. As most built-in function names of Q are overloaded, i.e. their meaning depends on the argument types, a quite complex system of constraints had to be implemented. Prolog proved to be an ideal implementation language for the task at hand. We used Definite Clause Grammars for parsing and Constraint Handling Rules for the type checking algorithm. In the paper we describe the main problems solved and the experiences gained in the development of the type checking tool.\n \t 23 \n \tRepresenting and solving constraint satisfaction problems is one of the challenges of artificial intelligence. In this paper, we present answer set programming (ASP) models for an important and very general class of constraints, including all constraints specified via grammars or automata that recognise some formal language. We argue that our techniques are effective and efficient, e.g., unit-propagation of an ASP solver can achieve domain consistency on the original constraint. Experiments demonstrate computational impact.\n \t 24 \n \tIn the context of multi-agent hypothetical reasoning, agents typically have partial knowledge about their environments, and the union of such knowledge is still incomplete to represent the whole world. Thus, given a global query they collaborate with each other to make correct inferences and hypothesis, whilst maintaining global constraints. Most collaborative reasoning systems operate on the assumption that agents can share or communicate any information they have. However, in application domains like multi-agent systems for healthcare or distributed software agents for security policies in coalition networks, confidentiality of knowledge is an additional\n primary concern. These agents are required to collaborately compute consistent answers for a query whilst preserving their own private information. This paper addresses this issue showing how this dichotomy between "open communication" in collaborative reasoning and protection of confidentiality can be accommodated. We present a general-purpose distributed abductive logic programming system for multi-agent hypothetical reasoning with confidentiality. Specifically, the system computes consistent conditional answers for a query over a set of distributed normal logic programs with possibly unbound domains and arithmetic constraints, preserving the private information within the logic programs. A case study on security policy analysis in distributed coalition networks is described, as an example of many applications of this system. \n \t 25 \n \tRDF/S ontologies are often used in e-science to express domain knowledge regarding the respective field of investigation (e.g., cultural informatics, bioinformatics etc). Such ontologies need to change often to reflect the latest scientific understanding on the domain at hand, and are usually associated with constraints expressed using various declarative formalisms to express domain-specific requirements, such as cardinality or acyclicity constraints. Addressing the evolution of ontologies in the presence of ontological constraints imposes extra difficulties, because it forces us to respect the associated constraints during evolution. While these issues were addressed in previous work, this is the first work to examine how ASP techniques can be applied to model and implement the evolution process. ASP was chosen for its advantages in terms of a principled, rather than ad hoc implementation, its modularity and flexibility, and for being a state-of-the-art technique to tackle hard combinatorial problems. In particular, our approach consists in providing a general translation of the problem into ASP, thereby reducing it to an instance of an ASP program that can be solved by an ASP solver. Our experiments are promising, even for large ontologies, and also show that the scalability of the approach depends on the morphology of the input.\n \t 26 \n \tModal Transition Systems (MTSs) provide an appropriate framework for modelling software behaviour when only a partial specification is available. A key characteristic of an MTS is that it explicitly models events that a system is required to provide and is proscribed from exhibiting, and those for which no specification is available, called maybe events. Incremental elaboration of maybe events into either required or proscribed events can be seen as a process of MTS refinement, resulting from extending a given partial specification with more information about the system behaviour. This paper focuses on providing automated support for computing strong refinements\n of an MTS with respect to event traces that describe required and proscribed behaviours using a non-monotonic inductive logic programming technique. A real case study is used to illustrate\n the practical application of the approach.\n \t 27 \n \tToday, Prolog is often used to solve well-defined, domain-specific problems that are part of larger applications. In such cases, a tight integration of the Prolog program and the rest of the application, which is commonly written in a different language, is necessary. One common approach is to compile the Prolog code to (native) code in the target language. In this case, the effort necessary to build, test and deploy the final application is reduced. However, most of the approaches that achieve reasonable performance compile Prolog to\n object-oriented code that relies on some kind of virtual machine (VM). These VMs are libraries implemented in the target language and implement Prolog's execution semantics. This adds a significant layer to the object-oriented program and results in code that does not look and feel native to developers of object-oriented programs. Further, if Prolog's execution semantics is implemented as a library the potential of modern runtime environments for object-oriented\n programs, such as the Java Virtual Machine, to effectively optimize the program is more limited. In this paper, we report on our approach to compile Prolog to high-level, idiomatic object-oriented\n Java code. The generated Java code closely resembles code written by Java developers and is effectively optimized by the Java Virtual Machine.\n \t 28 \n \tMost real-world programs must produce output. If a deductive database is used to implement database application programs, it should be possible to specify the output declaratively. There is no generally accepted, completely satisfying solution for this. In this paper we propose to specify an output document by defining the position of text pieces (building blocks of the document). These text pieces are then ordered by their position and concatenated. This way of specifying output fits well to the bottom-up way of thinking about rules (from right to left) which is common in deductive databases. Of course, when evaluating such programs, one wants to avoid sorting operations as far as possible. We show how rules involving ordering can be efficiently implemented.\n \t 29 \n \tAction language C+, a formalism based on nonmonotonic causal logic, was designed for describing properties of actions. The definite fragment of C+ was implemented in system the Causal Calculator (CCalc), based on a reduction of nonmonotonic causal logic to propositional logic. On the other hand, in this paper, we represent the language of CCalc in answer set programming (ASP), by translating nonmonotonic causal logic into formulas under the stable model semantics. We design a standard library which describes the constructs of the input language of CCalc in terms of ASP, allowing a simple modular method to represent CCalc input programs in the language of ASP. Using the combination of system f2lp and answer set solvers, our prototype implementation of this approach, which we call Cplus2ASP, achieves functionality close to CCalc while taking advantage of answer set solvers to yield efficient computation that is orders of magnitude faster than CCalc on several benchmark examples.\n \t 30 \n \tThis paper introduces an extension of Answer Set Programming (ASP) called Hybrid ASP which will allow the user to reason about dynamical systems that exhibit both discrete and continuous aspects. The unique feature of Hybrid ASP is that it allows the use of ASP type rules as controls for when to apply algorithms to advance the system to the next position. That is, if the prerequisites of a rule are satisfied and the constraints of the rule are not violated, then the algorithm associated with the rule is invoked.\n \t 31 \n \tRegular types represent sets of structured data, and have been used in logic programming (LP) for verification. However, first-class regular type systems are uncommon in LP languages. In this paper we present a new approach to regular types, based on type canonization, aimed at providing a practical first-class regular type system.\n \t 32 \n \tEarly validation of requirements is crucial for the rigorous development of software. Without it, even the most formal of the methodologies will produce the wrong outcome. One successful approach, popularised by some of the so-called lightweight formal methods, consists in generating (finite, small) models of the specifications. Another possibility is to build a running prototype from those specifications. In this paper we show how to obtain executable prototypes from formal specifications written in an object oriented notation by translating them into logic programs. This has some advantages over other lightweight methodologies. For instance, we recover the possibility of dealing with recursive data types as specifications that use them often lack finite models.\n \t 33 \n \tOur project is concerned with the automatic parallelization of Mercury programs. Mercury is a purely-declarative logic programming language, this makes it easy to determine whether a set of computations may be performed in parallel with one-anther. However, the problem of how to determine which computations should be executed in parallel in order to make the program perform optimally is unsolved. Therefore, our work concentrates on building a profiler-feedback automatic parallelization system for Mercury that creates programs with very good parallel performance with as little help from the programmer as possible.\n \t 34 \n \tThe goal of this paper is to show consistency techniques methods and hybrid stochastic/deterministic models to describe biochemical systems and their behaviour through the ordinary differential equations.\n \t 35 \n \tThis paper describes a doctoral research in three areas: Hybrid ASP - an extension of Answer Set Programming for reasoning about dynamical systems, an extension of Set Constraint atoms for reasoning about preferences, computing stable models of logic programs using Metropolis type algorithms. The paper discusses a possible application of all three areas to the problem of maximizing total expected reward.\n \t 36 \n \tIn this paper a general framework (based on soft constraints) to model and solve the fair allocation problem is proposed. Our formal approach allows to model different allocation problems, ranging from goods and resources allocation to task and chore division. Soft constraints are employed to find a fair solution by respecting the agent\u0092s preferences; indeed these can be modeled in a natural fashion by using the Semiring-based framework for soft constraints. The fairness property is considered following an economical point of view, that is, taking into account the notions of envy-freeness (each player likes its allocation at least as much as those that the other players receive, so it does not envy anybody else) and efficiency (there is no other division better for everybody, or better for some players and not worse for the others).\n \t 37 \n \tModularity in Logic Programming has gained much attention over the past years. To date, many formalisms have been proposed that feature various aspects of modularity. In this paper, we present our current work on Modular Nonmonotonic Logic Programs (MLPs), which are logic programs under answer set semantics with modules that have contextualized input provided by other modules. Moreover, they allow for (mutually) recursive module calls. We pinpoint issues that are present in such cyclic module systems and highlight how MLPs addresses them.\n \t 38 \n \tIn this PhD project, we present an approach to the problem of determinacy inference in logic programs with cut, which treats cut uniformly and contextually. The overall aim is to develop a theoretical analysis, abstract it to a suitable domain and prove both the concrete analysis and the abstraction correct in a formal theorem prover (Coq). A crucial advantage of this approach, besides the guarantee of correctness, is the possibility of automatically extracting an implementation of the analysis.\n \t 39 \n \tPreference is a natural part of common sense reasoning. It allows us to select preferred conclusions from broader range of alternative conclusions. It is typically specified on parts of conclusions or on rules. Different semantics have been proposed that deal with preference on rules. None fully meets our requirements.\n We are interested in a descriptive approach to preference handling in logic programs under answer set semantics that always selects preferred answer set when standard one exists. Existing semantics that meet this criterion also give non intuitive conclusions on some programs. We think this kind of problem is related to the problem of not accepting natural order of rules induced by underlying answer set semantics.\n Our goal is to define semantics that would always select preferred answer set when standard one exists, accept natural order on rules, and satisfy principles for preference handling.\n \t 40 \n \tThis report summarizes a PhD research effort to implement a type of logic programming language called "axiomatic language". Axiomatic language is intended as a specification language, so its implementation involves the transformation of specifications to efficient algorithms. The language is described and the implementation task is discussed.\n \t 41 \n \tDescription Logics are used more and more frequently for knowledge\n representation, creating an increasing demand for efficient automated\n DL reasoning. However, the existing implementations are inefficient in\n the presence of large amounts of data. This paper summarizes the\n results in transforming DL axioms to a set of function-free clauses of\n first-order logic which can be used for efficient, query oriented data\n reasoning. The described method has been implemented in a module of\n the DLog reasoner openly available on SourceForge to download.\n \t 42 43 44 During the past seven years the California Department of Transportation has developed an extensive stormwater characterization program to evaluate the physical, chemical and biological quality of the runoff from their representative facilities. Initially the program has utilized many laboratories and environmental consultants who may not have necessarily used the same method of sample collection, quality assurance and quality control, data reporting and data validation standards. Faced with this deficiency, a set of standard protocols and several software tools were developed to improve the consistency among all characterization studies and enhance the quality of water quality data. Software tools developed to deal with these problems include: 1) automated data validation, 2) hydrologic utility, 3) rational database, and 4) data analysis tool. The description and practical application of these software tools are discussed in this paper. 45 46 47 48 49 50 contributor language type type.1 1 Lautenschlager, Michael eng Dataset Digital 2 Herbstritt, Marc eng Text Article 3 Herbstritt, Marc eng Text Article 4 Herbstritt, Marc eng Text Article 5 Herbstritt, Marc eng Text Article 6 Herbstritt, Marc eng Text Article 7 Herbstritt, Marc eng Text Article 8 Herbstritt, Marc eng Text Article 9 Herbstritt, Marc eng Text ConferencePaper 10 Herbstritt, Marc eng Text ConferencePaper 11 Herbstritt, Marc eng Text ConferencePaper 12 Herbstritt, Marc eng Text ConferencePaper 13 Herbstritt, Marc eng Text ConferencePaper 14 Herbstritt, Marc eng Text ConferencePaper 15 Herbstritt, Marc eng Text ConferencePaper 16 Herbstritt, Marc eng Text ConferencePaper 17 Herbstritt, Marc eng Text ConferencePaper 18 Herbstritt, Marc eng Text ConferencePaper 19 Herbstritt, Marc eng Text ConferencePaper 20 Herbstritt, Marc eng Text ConferencePaper 21 Herbstritt, Marc eng Text ConferencePaper 22 Herbstritt, Marc eng Text ConferencePaper 23 Herbstritt, Marc eng Text ConferencePaper 24 Herbstritt, Marc eng Text ConferencePaper 25 Herbstritt, Marc eng Text ConferencePaper 26 Herbstritt, Marc eng Text ConferencePaper 27 Herbstritt, Marc eng Text ConferencePaper 28 Herbstritt, Marc eng Text ConferencePaper 29 Herbstritt, Marc eng Text ConferencePaper 30 Herbstritt, Marc eng Text ConferencePaper 31 Herbstritt, Marc eng Text ConferencePaper 32 Herbstritt, Marc eng Text ConferencePaper 33 Herbstritt, Marc eng Text ConferencePaper 34 Herbstritt, Marc eng Text ConferencePaper 35 Herbstritt, Marc eng Text ConferencePaper 36 Herbstritt, Marc eng Text ConferencePaper 37 Herbstritt, Marc eng Text ConferencePaper 38 Herbstritt, Marc eng Text ConferencePaper 39 Herbstritt, Marc eng Text ConferencePaper 40 Herbstritt, Marc eng Text ConferencePaper 41 Herbstritt, Marc eng Text ConferencePaper 42 43 44 University of California, Department of Civil and Environmental Engineering en Event Conference presentation 45 46 eng 47 eng 48 eng 49 eng 50 ger format format.1 rights 1 2302106804800 Bytes NetCDF Open access data at least for academic use. 2 15 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 3 17 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 4 14 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 5 20 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 6 27 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 7 18 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 8 2 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 9 9 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 10 13 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 11 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 12 10 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 13 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 14 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 15 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 16 9 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 17 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 18 5 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 19 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 20 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 21 12 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 22 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 23 12 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 24 12 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 25 12 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 26 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 27 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 28 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 29 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 30 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 31 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 32 11 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 33 4 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 34 6 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 35 7 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 36 6 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 37 6 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 38 4 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 39 6 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 40 6 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 41 5 pages application/pdf Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC-BY-NC-ND) 42 43 44 text/xml 45 46 76600 kb 161 pages 47 12760 kb 141 pages 48 27300 kb 142 pages 49 8170 kb 143 pages 50 6513 kb 167 pages .attrs 1 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 2 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 3 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 4 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 5 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 6 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 7 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 8 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 9 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 10 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 11 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 12 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 13 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 14 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 15 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 16 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 17 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 18 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 19 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 20 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 21 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 22 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 23 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 24 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 25 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 26 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 27 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 28 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 29 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 30 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 31 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 32 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 33 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 34 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 35 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 36 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 37 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 38 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 39 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 40 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 41 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 42 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 43 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 44 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 45 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 46 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 47 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 48 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 49 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd 50 http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd subject.1 relation subject.2 subject.3 subject.4 1 2 000 Computer science, knowledge, general works 3 000 Computer science, knowledge, general works 4 000 Computer science, knowledge, general works 5 000 Computer science, knowledge, general works 6 000 Computer science, knowledge, general works 7 000 Computer science, knowledge, general works 8 000 Computer science, knowledge, general works 9 000 Computer science, knowledge, general works 10 000 Computer science, knowledge, general works 11 000 Computer science, knowledge, general works 12 000 Computer science, knowledge, general works 13 000 Computer science, knowledge, general works 14 000 Computer science, knowledge, general works 15 000 Computer science, knowledge, general works 16 000 Computer science, knowledge, general works 17 000 Computer science, knowledge, general works 18 000 Computer science, knowledge, general works 19 000 Computer science, knowledge, general works 20 000 Computer science, knowledge, general works 21 000 Computer science, knowledge, general works 22 000 Computer science, knowledge, general works 23 000 Computer science, knowledge, general works 24 000 Computer science, knowledge, general works 25 000 Computer science, knowledge, general works 26 000 Computer science, knowledge, general works 27 000 Computer science, knowledge, general works 28 000 Computer science, knowledge, general works 29 000 Computer science, knowledge, general works 30 000 Computer science, knowledge, general works 31 000 Computer science, knowledge, general works 32 000 Computer science, knowledge, general works 33 000 Computer science, knowledge, general works 34 000 Computer science, knowledge, general works 35 000 Computer science, knowledge, general works 36 000 Computer science, knowledge, general works 37 000 Computer science, knowledge, general works 38 000 Computer science, knowledge, general works 39 000 Computer science, knowledge, general works 40 000 Computer science, knowledge, general works 41 000 Computer science, knowledge, general works 42 43 44 data validation doi:10.4122/1.1000001754 hydrologic utility data analysis tool rational database 45 46 621 Applied physics 47 537 Electricity & electronics Applied physics 621 Applied physics 48 537 Electricity & electronics Applied physics 621 Applied physics 49 537 Electricity & electronics Applied physics 621 Applied physics 50 543 Analytical chemistry Applied physics 621 Applied physics setSpec.2 setSpec.3 format.2 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 TIB.HZB.REFQUALITY TIB.REFQUALITY text/plain 47 TIB.HZB.REFQUALITY TIB.REFQUALITY text/plain 48 TIB.HZB.REFQUALITY TIB.REFQUALITY text/plain 49 TIB.HZB.REFQUALITY TIB.REFQUALITY text/plain 50 TIB.HZB.REFQUALITY TIB.REFQUALITY text/plain
# Fuzzy seaerch md_listrecords(provider = "biology", fuzzy=TRUE)
get_df.repo_name 1 AnimalPhysiology-LivestockSystems 2 Aphasiology 3 Archives of Clinical Microbiology 4 International Journal of Cell & Molecular Biology 5 Wildlife Biology Practice More than one match found for provider ' biology '! Enter row number of provider (other inputs will return 'NA'): Input accepted, took provider ' Aphasiology '.
Error in x$header: $ operator is invalid for atomic vectors