text:
@inbook{delling2019,
  author = {Daniel Delling and Julian Dibbelt and Thomas Pajor},
  title = {Fast and Exact Public Transit Routing with Restricted Pareto Sets},
  booktitle = {2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)},
  pages = {54-65},
  doi = {10.1137/1.9781611975499.5},
  URL = {https://epubs.siam.org/doi/abs/10.1137/1.9781611975499.5},
  eprint = {https://epubs.siam.org/doi/pdf/10.1137/1.9781611975499.5}
}

@techreport{berry2018,
  title = {London Assembly - Future transport: How is London responding to technological innovation?},
  author = {Berry, Richard},
  year = {2018},
  institution = {Mayor of London - Transport Commitee},
  month = {02},
  url={https://www.london.gov.uk/sites/default/files/future_transport_report_-_final.pdf}
}

@inproceedings{dirk2018,
  title={Harnessing Mobility Data in Cities: A Case Study From the Bergen Region},
  author={Dirk Ahlers and Rajendra Akerkar and John Krogstie and Andreas L. Opdahl and Bj{\o}rnar Tessem and Weiqing Zhang},
  year={2018},
  url={https://ntnuopen.ntnu.no/ntnu-xmlui/handle/11250/2579413}
}

@techreport{rode2015,
  title = {Towards new urban mobility: the case of London and Berlin},
  author = {Rode, Philipp and Hoffmann, Christian and Kandt, Jens and Graff, Andreas and Smith, Duncan},
  year = {2015},
  institution = {LSE Cities - The London School of Economics and Political Science},
  url= {http://eprints.lse.ac.uk/id/eprint/68875}
}

@article{aifadopoulou2007,
  author = {Georgia Aifadopoulou and Athanasios Ziliaskopoulos and Evangelia Chrisohoou},
  title = {Multiobjective Optimum Path Algorithm for Passenger Pretrip Planning in Multimodal Transportation Networks},
  journal = {Transportation Research Record},
  volume = {2032},
  number = {1},
  pages = {26-34},
  year = {2007},
  doi = {10.3141/2032-04},
  URL = {https://doi.org/10.3141/2032-04},
  eprint = {https://doi.org/10.3141/2032-04}
}

@article{dibbelt2015,
  title={User-Constrained Multimodal Route Planning},
  author={Dibbelt, Julian and Pajor, Thomas and Wagner, Dorothea},
  journal={J. Exp. Algorithmics},
  volume={19},
  pages={1--19},
  year={2015},
  publisher={ACM},
  url={http://doi.acm.org/10.1145/2699886}
}

@inproceedings{delling2013,
  author="Delling, Daniel and Dibbelt, Julian and Pajor, Thomas and Wagner, Dorothea and Werneck, Renato F.",
  editor="Bonifaci, Vincenzo and Demetrescu, Camil and Marchetti-Spaccamela, Alberto",
  title="Computing Multimodal Journeys in Practice",
  booktitle="Experimental Algorithms",
  year="2013",
  publisher="Springer Berlin Heidelberg",
  address="Berlin, Heidelberg",
  pages="260--271"
}

@techreport{kelly2011,
  title = {Enabling Cost-Effective Multimodal Trip Planners through Open Transit Data},
  author = {Kelly, Thomas and Miller, Raymond and Datz, Amy and Hillsman, Edward and Barbeau, Sean},
  year = {2011},
  institution = {National Center for Transit Research},
  url= {https://www.nctr.usf.edu/wp-content/uploads/2011/06/77926.pdf}
}

@article{rehrl2007,
  author={K. {Rehrl} and S. {Bruntsch} and H. {Mentz}},
  journal={IEEE Transactions on Intelligent Transportation Systems},
  title={Assisting Multimodal Travelers: Design and Prototypical Implementation of a Personal Travel Companion},
  year={2007},
  volume={8},
  number={1},
  pages={31-42},
  keywords={computerised navigation;mobile communication;mobile computing;notebook computers;traffic information systems;multimodal travelers;digital personal travel companion;continuous on-trip assistance;information systems;personalized multimodal journey planning;mobile multimodal trip management;smart-phone-based pedestrian orientation;public transport transfer buildings;Prototypes;Navigation;Information systems;Personal digital assistants;Intelligent transportation systems;Management information systems;Roads;Intelligent systems;Energy management;Power system management;Digital assistants;multimodal transport;navigation systems;pedestrian guidance;public transport;travel information systems},
  doi={10.1109/TITS.2006.890077},
  ISSN={1524-9050},
  month={March}
}

@article{kujala2018,
  title = "Travel times and transfers in public transport: Comprehensive accessibility analysis based on Pareto-optimal journeys",
  journal = "Computers, Environment and Urban Systems",
  volume = "67",
  pages = "41 - 54",
  year = "2018",
  issn = "0198-9715",
  doi = "https://doi.org/10.1016/j.compenvurbsys.2017.08.012",
  url = "http://www.sciencedirect.com/science/article/pii/S0198971517300923",
  author = "Rainer Kujala and Christoffer Weckström and Miloš N. Mladenović and Jari Saramäki",
  keywords = "Transit, Routing, Temporal distance profile, Temporal network, GTFS, OpenStreetMap"
}

@inproceedings{noy2019,
  title	= {Google Dataset Search: Building a search engine for datasets in an open Web ecosystem},
  author	= {Natasha Noy and Matthew Burgess and Dan Brickley},
  year	= {2019},
  booktitle	= {28th Web Conference (WebConf 2019)}
}

@inproceedings{ding2014,
  author = {Ding, Chaohai and Wald, Mike and Wills, Gary},
  title = {A Survey of Open Accessibility Data},
  booktitle = {Proceedings of the 11th Web for All Conference},
  series = {W4A '14},
  year = {2014},
  isbn = {978-1-4503-2651-3},
  location = {Seoul, Korea},
  pages = {37:1--37:4},
  articleno = {37},
  numpages = {4},
  url = {http://doi.acm.org/10.1145/2596695.2596708},
  doi = {10.1145/2596695.2596708},
  acmid = {2596708},
  publisher = {ACM},
  address = {New York, NY, USA},
  keywords = {data interlinking, information retrieval, linked data, open accessibility data}
}

@inproceedings{dornhofer2014,
  title={Comparison of Open Source routing services with OpenStreetMap Data for blind pedestrians},
  author={Markus Dornhofer and Werner Bischof and Elmar Krajnc},
  year={2014}
}

@inproceedings{auer2007,
  author={Auer, S{\"o}ren and Bizer, Christian and Kobilarov, Georgi and Lehmann, Jens and Cyganiak, Richard and Ives, Zachary},
  title="DBpedia: A Nucleus for a Web of Open Data",
  booktitle="The Semantic Web",
  year="2007",
  URL = "https://link.springer.com/chapter/10.1007/978-3-540-76298-0_52",
  publisher="Springer Berlin Heidelberg",
  address="Berlin, Heidelberg",
  pages="722--735"
}

@article{vrandecic2014,
  title	= {Wikidata: A Free Collaborative Knowledge Base},
  author	= {Denny Vrandečić and Markus Krötzsch},
  year	= {2014},
  URL	= {http://cacm.acm.org/magazines/2014/10/178785-wikidata/fulltext},
  journal	= {Communications of the ACM},
  pages	= {78--85},
  volume	= {57}
}

@misc{gtfs,
  title = {General Transit Feed Specification},
  year = {2006},
  URL = {https://developers.google.com/transit/gtfs/}
}

@article{bernerslee2001,
  added-at = {2016-09-07T01:44:07.000+0200},
  author = {Berners-Lee, Tim and Hendler, James and Lassila, Ora},
  biburl = {https://www.bibsonomy.org/bibtex/2222934145a71a9d6cfbbb375d4d62c1d/nosebrain},
  journal = {Scientific American},
  lastname = {Berners-Lee},
  month = may,
  number = 5,
  pages = {34-43},
  title = {The Semantic Web},
  url = {http://www.sciam.com/article.cfm?articleID=00048144-10D2-1C70-84A9809EC588EF21},
  volume = 284,
  year = 2001
}

@article{heath2011,
	author = {Tom Heath and Christian Bizer},
	title = {Linked Data: Evolving the Web into a Global Data Space},
	publisher = {Morgan & Claypool},
	year = {2011},
	edition = {1st.},
  url = {http://linkeddatabook.com/editions/1.0/},
	editor = {James Hendler and Frank van Harmelen},
	series = {Synthesis Lectures on the Semantic Web: Theory and Technology}
}

@techreport{sparql,
  editor = {Prud'hommeaux, Eric and Harris, Steve and Seaborne, Andy},
  institution = {W3C},
  title = {{SPARQL 1.1 Query Language}},
  url = {http://www.w3.org/TR/sparql11-query},
  year = 2013
}

@techreport{cyganiak2014,
	author = {Richard Cyganiak and David Wood and Markus Lanthaler},
	title = {RDF 1.1 Concepts and Abstract Syntax},
	year = {2014},
	url = {http://www.w3.org/TR/rdf11-concepts/},
	publisher = {World Wide Web Consortium}
}

@techreport{w3c2014,
	author = {Bernadette Hyland and Ghislain Atemezing and Boris Villazón-Terrazas},
	title = {Best Practices for Publishing Linked Data},
	year = {2014},
	url = {https://www.w3.org/TR/ld-bp/},
	publisher = {World Wide Web Consortium}
}

@misc{netex,
  title = {Network and Timetable Exchange},
  year = {2014},
  URL = {http://netex-cen.eu/}
}

@techreport{ec2011,
	author = {European Comission},
	title = {Roadmap to a Single European Transport Area – Towards a competitive and resource efficient transport system},
	year = {2011},
	url = {https://eur-lex.europa.eu/legal-content/EN/ALL/?uri=CELEX:52011DC0144},
}

@inproceedings{verborgh2014,
  title = {Web-Scale Querying through {Linked Data Fragments}},
  author = {Verborgh, Ruben and Vander Sande, Miel and Colpaert, Pieter and Coppens, Sam and Mannens, Erik and Van de Walle, Rik},
  year = 2014,
  month = apr,
  series = {CEUR Workshop Proceedings},
  volume = 1184,
  issn = {1613-0073},
  booktitle = {Proceedings of the 7th Workshop on Linked Data on the Web},
  editor = {Bizer, Christian and Heath, Tom and Auer, S\"oren and Berners-Lee, Tim},
  url = {http://ceur-ws.org/Vol-1184/ldow2014_paper_04.pdf},
}

@inproceedings{colpaert2017,
  author="Colpaert, Pieter and Verborgh, Ruben and Mannens, Erik",
  editor="Cabot, Jordi and De Virgilio, Roberto and Torlone, Riccardo",
  title="Public Transit Route Planning Through Lightweight Linked Data Interfaces",
  booktitle="Web Engineering",
  year="2017",
  publisher="Springer International Publishing",
  pages="403--411",
  url = "https://link.springer.com/chapter/10.1007/978-3-319-60131-1_26"
}

@phdthesis{colpaertthesis,
  author       = {Colpaert, Pieter},
  title        = {Publishing Transport Data for Maximum Reuse},
  school       = {Ghent University},
  year         = 2017,
  url          = {https://phd.pietercolpaert.be}
}

@misc{osm,
  title = {OpenStreetMap},
  year = {2004},
  URL = {https://www.openstreetmap.org/}
}

@inproceedings{auer2009,
  author={Auer, S{\"o}ren and Lehmann, Jens and Hellmann, Sebastian},
  title={LinkedGeoData: Adding a Spatial Dimension to the Web of Data},
  booktitle={The Semantic Web - ISWC 2009},
  year={2009},
  publisher={Springer Berlin Heidelberg},
  pages={731--746},
  url={https://link.springer.com/chapter/10.1007/978-3-642-04930-9_46}
}

@misc{geonames,
  title = {GeoNames},
  URL = {https://www.geonames.org/},
}

@misc{dcat,
  title = {Data Catalog Vocabulary (DCAT)},
  author={Maali, Fadi and Erickson, John},
  year = {2014},
  URL = {https://www.w3.org/TR/vocab-dcat/},
  publisher = {World Wide Web Consortium}
}

@inproceedings{hartig2016,
  author={Hartig, Olaf and {\"O}zsu, M. Tamer},
  title="Walking Without a Map: Ranking-Based Traversal for Querying Linked Data",
  booktitle="The Semantic Web -- ISWC 2016",
  year="2016",
  publisher="Springer International Publishing",
  pages="305--324",
  isbn="978-3-319-46523-4",
  url="https://link.springer.com/chapter/10.1007/978-3-319-46523-4_19"
}

@article{vandersande2016,
  title = {Hypermedia-based Discovery for Source Selection using Low-Cost {Linked Data} Interfaces},
  author = {Vander Sande, Miel and Verborgh, Ruben and Dimou, Anastasia and Colpaert, Pieter and Mannens, Erik},
  journal = {International Journal on Semantic Web and Information Systems},
  volume = 12,
  number = 3,
  pages = {79--110},
  year = 2016,
  month = jul,
  issn = {1552-6283},
  url = {http://www.igi-global.com/article/hypermedia-based-discovery-for-source-selection-using-low-cost-linked-data-interfaces/160173},
  doi = {10.4018/IJSWIS.2016070103},
}

@inproceedings{taelman2017,
  title = {Declaratively Describing Responses of Hypermedia-Driven {Web} {APIs}},
  author = {Taelman, Ruben and Verborgh, Ruben},
  booktitle = {Proceedings of the 9th International Conference on Knowledge Capture},
  year = {2017},
  month = dec,
  url = {https://linkeddatafragments.github.io/Article-Declarative-Hypermedia-Responses/}
}

@misc{shacl,
  title = {Shapes Constraint Language (SHACL)},
  author = {Knublauch, Holger and Kontokostas Dimitris},
  year = {2017},
  URL = {https://www.w3.org/TR/2017/REC-shacl-20170720/}
}

@inproceedings{taelman2016,
  title = {Multidimensional Interfaces for Selecting Data within Ordinal Ranges},
  author = {Taelman, Ruben and Colpaert, Pieter and Verborgh, Ruben and Mannens, Erik},
  booktitle = {Proceedings of the 7th International Workshop on Consuming Linked Data},
  editor = {Hartig, Olaf and Sequeda, Juan and Hogan, Aidan},
  year = 2016,
  month = oct,
  series = {CEUR Workshop Proceedings},
  volume = 1666,
  issn = {1613-0073},
  url = {http://ceur-ws.org/Vol-1666/paper-03.pdf},
}

@article{geisberger2012,
  author = {Geisberger, Robert and Sanders, Peter and Schultes, Dominik and Vetter, Christian},
  title = {Exact Routing in Large Road Networks Using Contraction Hierarchies},
  journal = {Transportation Science},
  issue_date = {08 2012},
  volume = {46},
  number = {3},
  month = aug,
  year = {2012},
  issn = {1526-5447},
  pages = {388--404},
  numpages = {17},
  url = {http://dx.doi.org/10.1287/trsc.1110.0401},
  doi = {10.1287/trsc.1110.0401},
  acmid = {2351896},
  publisher = {INFORMS},
  address = {Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA},
  keywords = {algorithm engineering, route planning, shortest paths},
}

@article{hartigan1979,
  ISSN = {00359254, 14679876},
  URL = {http://www.jstor.org/stable/2346830},
  author = {J. A. Hartigan and M. A. Wong},
  journal = {Journal of the Royal Statistical Society. Series C (Applied Statistics)},
  number = {1},
  pages = {100--108},
  publisher = {[Wiley, Royal Statistical Society]},
  title = {Algorithm AS 136: A K-Means Clustering Algorithm},
  volume = {28},
  year = {1979}
}

@article{flinsenberg2004,
  author = {Flinsenberg, Ingrid and Van Der Horst, Martijn and Lukkien, Johan and Verriet, Jacques},
  year = {2004},
  journal = {WSEAS},
  pages = {569--574},
  volume = {3},
  title = {Creating graph partitions for fast optimum route planning}
}

@article{bast2015,
  author    = {Hannah Bast and
               Daniel Delling and
               Andrew V. Goldberg and
               Matthias M{\"{u}}ller{-}Hannemann and
               Thomas Pajor and
               Peter Sanders and
               Dorothea Wagner and
               Renato F. Werneck},
  title     = {Route Planning in Transportation Networks},
  journal   = {CoRR},
  volume    = {abs/1504.05140},
  year      = {2015},
  url       = {http://arxiv.org/abs/1504.05140},
  archivePrefix = {arXiv},
  eprint    = {1504.05140},
  timestamp = {Mon, 13 Aug 2018 16:48:31 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BastDGMPSWW15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{pajorthesis,
  title={Algorithm Engineering for Realistic Journey Planning in Transportation Networks},
  author={Thomas Pajor},
  school= {Karlsruhe Institute of Technology},
  year={2013},
  url={https://d-nb.info/1058165240/34}
}

@article{dijkstra1959,
  author="Dijkstra, E. W.",
  title="A note on two problems in connexion with graphs",
  journal="Numerische Mathematik",
  year="1959",
  month="Dec",
  day="01",
  volume="1",
  number="1",
  pages="269--271",
  issn="0945-3245",
  doi="10.1007/BF01386390",
  url="https://doi.org/10.1007/BF01386390"
}

@inproceedings{raptor2019,
  author    = {Daniel Delling and
               Julian Dibbelt and
               Thomas Pajor},
  title     = {Fast and Exact Public Transit Routing with Restricted Pareto Sets},
  booktitle = {Proceedings of the Twenty-First Workshop on Algorithm Engineering
               and Experiments, {ALENEX} 2019, San Diego, CA, USA, January 7-8, 2019.},
  pages     = {54--65},
  year      = {2019},
  crossref  = {DBLP:conf/alenex/2019},
  url       = {https://doi.org/10.1137/1.9781611975499.5},
  doi       = {10.1137/1.9781611975499.5},
  timestamp = {Mon, 18 Feb 2019 15:08:10 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/alenex/DellingDP19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{dibbelt2018,
  author = {Dibbelt, Julian and Pajor, Thomas and Strasser, Ben and Wagner, Dorothea},
  title = {Connection Scan Algorithm},
  journal = {J. Exp. Algorithmics},
  issue_date = {2018},
  volume = {23},
  month = oct,
  year = {2018},
  issn = {1084-6654},
  pages = {1.7:1--1.7:56},
  articleno = {1.7},
  numpages = {56},
  url = {http://doi.acm.org/10.1145/3274661},
  doi = {10.1145/3274661},
  acmid = {3274661},
  publisher = {ACM},
  address = {New York, NY, USA},
  keywords = {Pareto optimization, Shortest path, preprocessing, routing, stochastic, timetable, train delay}
}

@inbook{bast2016,
  author = {Hannah Bast and Matthias Hertel and Sabine Storandt},
  title = {Scalable Transfer Patterns},
  booktitle = {2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX)},
  chapter = {},
  pages = {15-29},
  doi = {10.1137/1.9781611974317.2},
  URL = {https://epubs.siam.org/doi/abs/10.1137/1.9781611974317.2},
  eprint = {https://epubs.siam.org/doi/pdf/10.1137/1.9781611974317.2}
}

@inproceedings{witt2016,
  title={Trip-Based Public Transit Routing Using Condensed Search Trees},
  author={Sascha Witt},
  booktitle={ATMOS},
  year={2016},
  url={https://arxiv.org/pdf/1607.01299.pdf}
}

@article{barret2000,
  author = {Barrett, C. and Jacob, R. and Marathe, M.},
  title = {Formal-Language-Constrained Path Problems},
  journal = {SIAM Journal on Computing},
  volume = {30},
  number = {3},
  pages = {809-837},
  year = {2000},
  doi = {10.1137/S0097539798337716},
  URL = {https://doi.org/10.1137/S0097539798337716},
  eprint = {https://doi.org/10.1137/S0097539798337716}
}

@inproceedings{savenkov2017,
  author = {Savenkov, Vadim and Mehmood, Qaiser and Umbrich, J\"{u}rgen and Polleres, Axel},
  title = {Counting to K or How SPARQL1.1 Property Paths Can Be Extended to Top-k Path Queries},
  booktitle = {Proceedings of the 13th International Conference on Semantic Systems},
  series = {Semantics2017},
  year = {2017},
  isbn = {978-1-4503-5296-3},
  location = {Amsterdam, Netherlands},
  pages = {97--103},
  numpages = {7},
  url = {http://doi.acm.org/10.1145/3132218.3132239},
  doi = {10.1145/3132218.3132239},
  acmid = {3132239},
  publisher = {ACM},
  address = {New York, NY, USA},
  keywords = {SPARQL, k shortest paths, querying RDF data, routing}
}

@inproceedings{hartig2015,
  author={Hartig, Olaf and Pirr{\`o}, Giuseppe},
  title="A Context-Based Semantics for SPARQL Property Paths Over the Web",
  booktitle="The Semantic Web. Latest Advances and New Domains",
  year="2015",
  publisher="Springer International Publishing",
  address="Cham",
  pages="71--87"
}

@article{ldql,
  title = "LDQL: A query language for the Web of Linked Data",
  journal = "Journal of Web Semantics",
  volume = "41",
  pages = "9 - 29",
  year = "2016",
  issn = "1570-8268",
  doi = "https://doi.org/10.1016/j.websem.2016.10.001",
  url = "http://www.sciencedirect.com/science/article/pii/S1570826816300476",
  author = "Olaf Hartig and Jorge Pérez",
  keywords = "Linked Data, Query language, Foundations, SPARQL, Queries"
}

@inproceedings{rutgers2016,
  author = {Rutgers, Peter and Martella, Claudio and Voulgaris, Spyros and Boncz, Peter},
  title = {Powerful and Efficient Bulk Shortest-path Queries: Cypher Language Extension \&\#38; Giraph Implementation},
  booktitle = {Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems},
  series = {GRADES '16},
  year = {2016},
  isbn = {978-1-4503-4780-8},
  location = {Redwood Shores, California},
  pages = {6:1--6:7},
  articleno = {6},
  numpages = {7},
  url = {http://doi.acm.org/10.1145/2960414.2960420},
  doi = {10.1145/2960414.2960420},
  acmid = {2960420},
  publisher = {ACM},
  address = {New York, NY, USA}
}

@inproceedings{comunica,
  author = {Taelman, Ruben and Van Herwegen, Joachim and Vander Sande, Miel and Verborgh, Ruben},
  title = {Comunica: a Modular SPARQL Query Engine for the Web},
  booktitle = {Proceedings of the 17th International Semantic Web Conference},
  year = {2018},
  month = oct,
  url = {https://comunica.github.io/Article-ISWC2018-Resource/}
}

@inproceedings{solid,
  title={A demonstration of the solid platform for social web applications},
  author={Mansour, Essam and Sambra, Andrei Vlad and Hawke, Sandro and Zereba, Maged and Capadisli, Sarven and Ghanem, Abdurrahman and Aboulnaga, Ashraf and Berners-Lee, Tim},
  booktitle={Proceedings of the 25th International Conference Companion on World Wide Web},
  pages.bak={223--226},
  year.bak={2016},
  organization.bak={International World Wide Web Conferences Steering Committee},
  url={https://ashraf.aboulnaga.me/pubs/www16soliddemo.pdf}
}

@inproceedings{bloomreachability,
  title={Sparqling kleene: fast property paths in RDF-3X},
  author={Gubichev, Andrey and Bedathur, Srikanta J and Seufert, Stephan},
  booktitle={First International Workshop on Graph Data Management Experiences and Systems},
  pages.bak={14},
  year={2013},
  organization.bak={ACM},
  url={https://event.cwi.nl/grades2013/14-gubichev.pdf}
}

@inproceedings{bloomdistributed,
  title={Fast SPARQL join processing between distributed streams and stored RDF graphs using bloom filters},
  author={Dia, Amadou Fall and Aoul, Zakia Kazi and Boly, Aliou and M{\'e}tais, Elisabeth},
  booktitle={12th International Conference on Research Challenges in Information Science},
  pages.bak={1--12},
  year={2018},
  organization.bak={IEEE},
  url={https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=8406674}
}


text:
@InProceedings{Jakubíček-EtAl:2010:PACLIC2010,
author    = {Miloš Jakubíček and Adam Kilgarriff and Diana McCarthy and Pavel Rychlý},
title     = {Fast Syntactic Searching in Very Large Corpora for Many Languages},
booktitle = {Proceedings of the 24th Pacific Asia Conference on Language, Information and Computation},
note      = {Workshop on Advanced Corpus Solutions},
year      = {2010},
month     = {November},
address   = {Tohoku University, Sendai, Japan},
publisher = {Institute of Digital Enhancement of Cognitive Processing, Waseda University},
pages     = {741--747},
url       = {http://www.aclweb.org/anthology/Y10-1086}
}

license: MIT

repository: chbrown/tex

license_type: permissive

repo_name: chbrown/tex

branch_name: refs/heads/master

extension: bib


text:
@article{smirnov1948,
author = "Smirnov, N.",
doi = "10.1214/aoms/1177730256",
fjournal = "The Annals of Mathematical Statistics",
journal = "Ann. Math. Statist.",
month = "06",
number = "2",
pages = "279--281",
publisher = "The Institute of Mathematical Statistics",
title = "Table for Estimating the Goodness of Fit of Empirical Distributions",
url = "https://doi.org/10.1214/aoms/1177730256",
volume = "19",
year = "1948"
}


text:
@inproceedings{ferrari2016centralization,
 address = {Philadelphia, Pennsylvania},
 author = {Ferrari, Diogo and Arretche, Marta and Schlegel, Rogerio},
 journal = {American Political Science Association Annual Meeting (APSA)},
 organization = {American Political Science Association Annual Meeting (APSA)},
 publisher = {APSA},
 tags = {ferrari},
 title = {The Conditional Direct and Unconditional Indirect Effect of Income on Preferences for Centralization of Authority},
 year = {2016}
}

repository: DiogoFerrari/academic-kickstart

repo_name: DiogoFerrari/academic-kickstart


text:
package types

import (
	"reflect"
	"testing"

	"github.com/stretchr/testify/assert"
)

func TestOrderKeygen(t *testing.T) {
	cuAddr, err := CUAddressFromBase58("HBCPoshPen4yTWCwCvCVuwbfSmrb3EzNbXTo")
	assert.Nil(t, err)
	oneOrderBase := OrderBase{
		ID:        "UUID9",
		OrderType: OrderTypeKeyGen,
		Status:    OrderStatusBegin,
		Symbol:    "btc",
		CUAddress: cuAddr,
	}

	keyNodes := []CUAddress{NewCUAddress(), NewCUAddress()}
	to := NewCUAddress()
	firstOrder := OrderKeyGen{
		OrderBase:        oneOrderBase,
		KeyNodes:         keyNodes,
		SignThreshold:    uint64(3),
		To:               to,
		OpenFee:          NewCoin(NativeToken, NewInt(10)),
		MultiSignAddress: "0x12321cae2b",
	}

	orderBase := OrderBase{}
	secondOrder := OrderKeyGen{}
	secondOrder.OrderBase = orderBase
	secondOrder.SetOrderType(OrderTypeKeyGen)
	secondOrder.SetOrderStatus(OrderStatusBegin)
	secondOrder.SetID("UUID9")
	secondOrder.Symbol = "btc"
	secondOrder.CUAddress = cuAddr
	secondOrder.KeyNodes = keyNodes
	secondOrder.SignThreshold = uint64(3)
	secondOrder.To = to
	secondOrder.OpenFee = NewCoin(NativeToken, NewInt(10))
	secondOrder.MultiSignAddress = "0x12321cae2b"

	b := reflect.DeepEqual(firstOrder, secondOrder)
	assert.True(t, b)
	copyOrder := firstOrder.DeepCopy()
	thirdOrder := (copyOrder).(*OrderKeyGen)
	b = reflect.DeepEqual(firstOrder, *thirdOrder)
	assert.True(t, b)

	// mod thirdOrder the firstOrder not changed
	thirdOrder.ID = "UUID10"
	b = reflect.DeepEqual(firstOrder, secondOrder)
	assert.True(t, b)
	b = reflect.DeepEqual(firstOrder, thirdOrder)
	assert.False(t, b)
	thirdOrder.ID = "UUID9"

	thirdOrder.KeyNodes = []CUAddress{NewCUAddress(), NewCUAddress()}
	b = reflect.DeepEqual(firstOrder, secondOrder)
	assert.True(t, b)
	b = reflect.DeepEqual(firstOrder, thirdOrder)
	assert.False(t, b)
	thirdOrder.KeyNodes = keyNodes

	thirdOrder.SignThreshold = uint64(7)
	b = reflect.DeepEqual(firstOrder, secondOrder)
	assert.True(t, b)
	b = reflect.DeepEqual(firstOrder, thirdOrder)
	assert.False(t, b)
	thirdOrder.SignThreshold = uint64(3)

	thirdOrder.Symbol = "changed symbol"
	b = reflect.DeepEqual(firstOrder, secondOrder)
	assert.True(t, b)
	b = reflect.DeepEqual(firstOrder, thirdOrder)
	assert.False(t, b)
	thirdOrder.Symbol = "btc"

	temp := thirdOrder.To
	thirdOrder.To = NewCUAddress()
	b = reflect.DeepEqual(firstOrder, secondOrder)
	assert.True(t, b)
	b = reflect.DeepEqual(firstOrder, thirdOrder)
	assert.False(t, b)
	thirdOrder.To = temp
}

func TestOrderSysTransfer(t *testing.T) {

}

func TestOrderWithdrawal(t *testing.T) {
	cuAddr, err := CUAddressFromBase58("HBCPoshPen4yTWCwCvCVuwbfSmrb3EzNbXTo")
	assert.Nil(t, err)
	oneOrderBase := OrderBase{
		ID:        "UUID9",
		OrderType: OrderTypeWithdrawal,
		Status:    OrderStatusBegin,
		Symbol:    "BHBTC",
		CUAddress: cuAddr,
	}

	firstOrder := OrderWithdrawal{
		OrderBase:         oneOrderBase,
		Amount:            NewInt(20),
		GasFee:            NewInt(3),
		WithdrawToAddress: "17tyo8fzvrkbSn4YoBn9TPeqqanMzfKbhy",
		OpCUaddress:       "opcuaddress1",
		Txhash:            "txhash1",
		RawData:           []byte("raw data"),
		SignedTx:          []byte("signed tx"),
	}

	orderBase := OrderBase{}
	secondOrder := OrderWithdrawal{}
	secondOrder.OrderBase = orderBase
	secondOrder.SetOrderType(OrderTypeWithdrawal)
	secondOrder.SetOrderStatus(OrderStatusBegin)
	secondOrder.SetID("UUID9")
	secondOrder.Symbol = "BHBTC"
	secondOrder.CUAddress = cuAddr
	secondOrder.Amount = NewInt(20)
	secondOrder.GasFee = NewInt(3)
	secondOrder.WithdrawToAddress = "17tyo8fzvrkbSn4YoBn9TPeqqanMzfKbhy"
	secondOrder.OpCUaddress = "opcuaddress1"
	secondOrder.Txhash = "txhash1"
	secondOrder.RawData = []byte("raw data")
	secondOrder.SignedTx = []byte("signed tx")

	b := reflect.DeepEqual(firstOrder, secondOrder)
	assert.True(t, b)
	copyOrder := firstOrder.DeepCopy()
	thirdOrder := (copyOrder).(*OrderWithdrawal)
	b = reflect.DeepEqual(firstOrder, *thirdOrder)
	assert.True(t, b)

	// mod thirdOrder the firstOrder not changed
	thirdOrder.ID = "UUID10"
	thirdOrder.SignedTx = []byte("changed SignedTx")
	thirdOrder.Amount = NewInt(1)
	thirdOrder.Symbol = "changed symbol"
	thirdOrder.WithdrawToAddress = "changed WithdrawToAddress"
	b = reflect.DeepEqual(firstOrder, secondOrder)
	assert.True(t, b)
	b = reflect.DeepEqual(firstOrder, thirdOrder)
	assert.False(t, b)
}

func TestOrderCollect(t *testing.T) {
	cuAddr, err := CUAddressFromBase58("HBCPoshPen4yTWCwCvCVuwbfSmrb3EzNbXTo")
	assert.Nil(t, err)
	cuAddr1, err := CUAddressFromBase58("HBCLmQcskpdQivEkRrh1gNPm7c9aVB8hh1fy")
	assert.Nil(t, err)
	oneOrderBase := OrderBase{
		ID:        "UUID9",
		OrderType: OrderTypeCollect,
		Status:    OrderStatusBegin,
		Symbol:    "BHBTC",
		CUAddress: cuAddr,
	}

	firstOrder := OrderCollect{
		OrderBase:          oneOrderBase,
		CollectFromCU:      cuAddr,
		CollectFromAddress: "38apd1KQmQcf3o2rkQD21WApSJAtMpdP9H",
		CollectToCU:        cuAddr1,
		Amount:             NewInt(20),
		GasPrice:           NewInt(2),
		GasLimit:           NewInt(1),
		Txhash:             "txhash1",
		RawData:            []byte("Raw data"),
		SignedTx:           []byte("Signed Tx"),
	}

	orderBase := OrderBase{}
	secondOrder := OrderCollect{}
	secondOrder.OrderBase = orderBase
	secondOrder.SetOrderType(OrderTypeCollect)
	secondOrder.SetOrderStatus(OrderStatusBegin)
	secondOrder.CUAddress = cuAddr
	secondOrder.SetID("UUID9")
	secondOrder.Symbol = "BHBTC"
	secondOrder.CollectFromCU = cuAddr
	secondOrder.CollectFromAddress = "38apd1KQmQcf3o2rkQD21WApSJAtMpdP9H"
	secondOrder.CollectToCU = cuAddr1
	secondOrder.Amount = NewInt(20)
	secondOrder.GasPrice = NewInt(2)
	secondOrder.GasLimit = NewInt(1)
	secondOrder.Txhash = "txhash1"
	secondOrder.RawData = []byte("Raw data")
	secondOrder.SignedTx = []byte("Signed Tx")

	b := reflect.DeepEqual(firstOrder, secondOrder)
	//	assert.True(t, b)
	copyOrder := firstOrder.DeepCopy()
	thirdOrder := (copyOrder).(*OrderCollect)
	b = reflect.DeepEqual(firstOrder, *thirdOrder)
	assert.True(t, b)

	// mod thirdOrder the firstOrder not changed
	thirdOrder.ID = "UUID10"
	thirdOrder.SignedTx = []byte("changed SignedTx")

	thirdOrder.Amount = NewInt(1)
	thirdOrder.Symbol = "changed symbol"
	thirdOrder.CollectFromAddress = "changed CollectFromAddress"
	b = reflect.DeepEqual(firstOrder, secondOrder)
	assert.True(t, b)
	b = reflect.DeepEqual(firstOrder, thirdOrder)
	assert.False(t, b)
}

repository: hbtc-chain/bhchain

repo_name: hbtc-chain/bhchain

branch_name: refs/heads/main

extension: go


text:
require vala.inc
PR = "${INC_PR}.0"

SRC_URI[archive.md5sum] = "ab9b4d59816a28e2a2118516e937d32e"
SRC_URI[archive.sha256sum] = "a641df1ee84c6ee70bf7a747b46aad12ffa24c6c4093e9a46c5ae0675f2b028f"

repository: overo/overo-oe-natty

repo_name: overo/overo-oe-natty

branch_name: HEAD

extension: bb