zotero/translators/Dagstuhl Research Online Pu...

272 lines
7.1 KiB
JavaScript
Raw Permalink Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

{
"translatorID": "0526c18d-8dc8-40c9-8314-399e0b743a4d",
"label": "Dagstuhl Research Online Publication Server",
"creator": "Philipp Zumstein",
"target": "^https?://(www\\.)?drops\\.dagstuhl\\.de/opus/",
"minVersion": "3.0",
"maxVersion": "",
"priority": 100,
"inRepository": true,
"translatorType": 4,
"browserSupport": "gcsibv",
"lastUpdated": "2016-08-23 06:54:08"
}
/*
***** BEGIN LICENSE BLOCK *****
Copyright © 2016 Philipp Zumstein
This file is part of Zotero.
Zotero is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Zotero is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with Zotero. If not, see <http://www.gnu.org/licenses/>.
***** END LICENSE BLOCK *****
*/
function detectWeb(doc, url) {
if (url.indexOf('source_opus')>-1 || url.indexOf('volltexte')>-1) {
var bibtexEntry = ZU.xpathText(doc, '//pre/tt');
if (bibtexEntry.indexOf("@InCollection")>-1) {
return "bookSection";
}
if (bibtexEntry.indexOf("@Article")>-1) {
return "journalArticle";
}
return "conferencePaper";
} else if (getSearchResults(doc, true)) {
return "multiple";
}
}
function getSearchResults(doc, checkOnly) {
var items = {};
var found = false;
var rows = ZU.xpath(doc, '//b/a[contains(@href, "source_opus")]|//td/a[contains(@href, "source_opus")]');//
for (var i=0; i<rows.length; i++) {
var href = rows[i].href;
var title = ZU.trimInternal(rows[i].textContent);
if (!href || !title) continue;
if (checkOnly) return true;
found = true;
items[href] = title;
}
return found ? items : false;
}
function doWeb(doc, url) {
if (detectWeb(doc, url) == "multiple") {
Zotero.selectItems(getSearchResults(doc, false), function (items) {
if (!items) {
return true;
}
var articles = [];
for (var i in items) {
articles.push(i);
}
ZU.processDocuments(articles, scrape);
});
} else {
scrape(doc, url);
}
}
function scrape(doc, url) {
var bibtexEntry = ZU.xpathText(doc, '//pre/tt');
//Z.debug(bibtexEntry);
var pdfurl = ZU.xpathText(doc, '//td//a[contains(@href, "pdf")]/@href');
var translator = Zotero.loadTranslator("import");
translator.setTranslator("9cb70025-a888-4a29-a210-93ec52da40d4");
translator.setString(bibtexEntry);
translator.setHandler("itemDone", function(obj, item) {
//if a note is just a list of keywords, then save them as tags
//and delete this note
for (var i=0; i<item.notes.length; i++) {
var note = item.notes[i].note;
if (note.indexOf('Keywords:')>-1) {
note = note.replace('<p>', '').replace('</p>', '').replace('Keywords:', '');
var keywords = note.split(',');
for (var j=0; j<keywords.length; j++) {
item.tags.push(keywords[j].trim());
}
item.notes.splice(i, 1);
}
}
item.attachments.push({
title: "Snapshot",
document: doc
});
if (pdfurl) {
item.attachments.push({
url: pdfurl,
title: "Full Text PDF",
mimeType: "application/pdf"
});
}
item.complete();
});
translator.translate();
}/** BEGIN TEST CASES **/
var testCases = [
{
"type": "web",
"url": "http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=4958",
"items": [
{
"itemType": "conferencePaper",
"title": "Overcoming Intractability in Unsupervised Learning (Invited Talk)",
"creators": [
{
"firstName": "Sanjeev",
"lastName": "Arora",
"creatorType": "author"
},
{
"firstName": "Ernst W.",
"lastName": "Mayr",
"creatorType": "editor"
},
{
"firstName": "Nicolas",
"lastName": "Ollinger",
"creatorType": "editor"
}
],
"date": "2015",
"DOI": "10.4230/LIPIcs.STACS.2015.1",
"ISBN": "9783939897781",
"itemID": "arora:LIPIcs:2015:4958",
"libraryCatalog": "Dagstuhl Research Online Publication Server",
"pages": "11",
"place": "Dagstuhl, Germany",
"proceedingsTitle": "32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)",
"publisher": "Schloss DagstuhlLeibniz-Zentrum fuer Informatik",
"series": "Leibniz International Proceedings in Informatics (LIPIcs)",
"url": "http://drops.dagstuhl.de/opus/volltexte/2015/4958",
"volume": "30",
"attachments": [
{
"title": "Snapshot"
},
{
"title": "Full Text PDF",
"mimeType": "application/pdf"
}
],
"tags": [
"NP-hardness",
"intractability",
"machine learning",
"unsupervised learning"
],
"notes": [],
"seeAlso": []
}
]
},
{
"type": "web",
"url": "http://drops.dagstuhl.de/opus/portals/lipics/index.php?semnr=15001",
"items": "multiple"
},
{
"type": "web",
"url": "http://drops.dagstuhl.de/opus/ergebnis.php?wer=opus&suchart=teil&Lines_Displayed=10&sort=o.date_year+DESC%2C+o.title&suchfeld1=freitext&suchwert1=&opt1=AND&opt2=AND&suchfeld3=date_year&suchwert3=&startindex=0&page=0&dir=2&suche=&suchfeld2=oa.person&suchwert2=Hauzar%2C%20David",
"items": "multiple"
},
{
"type": "web",
"url": "http://drops.dagstuhl.de/opus/volltexte/2016/5933/",
"items": [
{
"itemType": "conferencePaper",
"title": "The Planar Tree Packing Theorem",
"creators": [
{
"firstName": "Markus",
"lastName": "Geyer",
"creatorType": "author"
},
{
"firstName": "Michael",
"lastName": "Hoffmann",
"creatorType": "author"
},
{
"firstName": "Michael",
"lastName": "Kaufmann",
"creatorType": "author"
},
{
"firstName": "Vincent",
"lastName": "Kusters",
"creatorType": "author"
},
{
"firstName": "Csaba",
"lastName": "Tóth",
"creatorType": "author"
},
{
"firstName": "Sándor",
"lastName": "Fekete",
"creatorType": "editor"
},
{
"firstName": "Anna",
"lastName": "Lubiw",
"creatorType": "editor"
}
],
"date": "2016",
"DOI": "10.4230/LIPIcs.SoCG.2016.41",
"ISBN": "9783959770095",
"itemID": "geyer_et_al:LIPIcs:2016:5933",
"libraryCatalog": "Dagstuhl Research Online Publication Server",
"pages": "41:141:15",
"place": "Dagstuhl, Germany",
"proceedingsTitle": "32nd International Symposium on Computational Geometry (SoCG 2016)",
"publisher": "Schloss DagstuhlLeibniz-Zentrum fuer Informatik",
"series": "Leibniz International Proceedings in Informatics (LIPIcs)",
"url": "http://drops.dagstuhl.de/opus/volltexte/2016/5933",
"volume": "51",
"attachments": [
{
"title": "Snapshot"
},
{
"title": "Full Text PDF",
"mimeType": "application/pdf"
}
],
"tags": [
"graph drawing",
"graph packin",
"planar graph",
"simultaneous embedding"
],
"notes": [],
"seeAlso": []
}
]
}
]
/** END TEST CASES **/