<?xml version="1.0" encoding="UTF-8"?>

<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd http://www.openarchives.org/OAI/2.0/oai-identifier">
  <responseDate>2020-04-06T16:58:26Z</responseDate>
  <request metadataPrefix="oai_dc" set="ec_fundedresources" verb="ListRecords">https://vbn.aau.dk/ws/oai</request>
  <ListRecords>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/e038a1e8-ae81-4d01-b6fa-96103ec5bc93</identifier>
        <datestamp>2018-10-30T09:44:16Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Transverse intrafascicular multichannel electrode (TIME) system for treatment of phantom limb pain in amputees</title>
          <creator>Jensen, Winnie</creator>
          <creator>Micera, S.</creator>
          <creator>Navarro, X.</creator>
          <creator>Stieglitz, T.</creator>
          <creator>Guiraud, D.</creator>
          <creator>Divoux, J.</creator>
          <creator>Rossini, P. M.</creator>
          <creator>Yoshida, Ken</creator>
          <publisher>Department of Health Science and Technology. Aalborg University</publisher>
          <contributor>Falla, Deborah</contributor>
          <contributor>Farina, Dario</contributor>
          <date>2010</date>
          <type>conferenceObject</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/e038a1e8-ae81-4d01-b6fa-96103ec5bc93</identifier>
          <identifier>https://vbn.aau.dk/ws/files/77428949/p507.pdf</identifier>
          <identifier>urn:ISBN:978-87-7094-047-4</identifier>
          <source>Jensen , W , Micera , S , Navarro , X , Stieglitz , T , Guiraud , D , Divoux , J , Rossini , P M &amp; Yoshida , K 2010 , Transverse intrafascicular multichannel electrode (TIME) system for treatment of phantom limb pain in amputees . in D Falla &amp; D Farina (eds) , Abstracts of the XVIII Congress of the International Society of Electrophysiology and Kinesiology, ISEK 2010, 16-19 June 2010, Aalborg, Denmark [CD-ROM] . Department of Health Science and Technology. Aalborg University , Aalborg , pp. No. P507 , Congress of the International Society of Electrophysiology and Kinesiology , Aalborg , Denmark , 16/06/2010 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/CT-2007.3.6 Nano/Micro priority, project number 224012</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/6b918478-d43c-4705-a08b-afd3971e5054</identifier>
        <datestamp>2018-12-12T10:45:39Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">The Self as tension of wholeness and emptiness</title>
          <creator>Tateo, Luca</creator>
          <creator>marsico, giuseppina</creator>
          <subject>Semiotic Self</subject>
          <subject>Evolutive tension</subject>
          <subject>Wholeness</subject>
          <subject>Holes</subject>
          <subject>Tensegrity</subject>
          <description xml:lang="dan">The article provides a framework of the Self, understood as a dynamic semiotic system in constant evolutive tension rather than a system in equilibrium adapting to the environmental changing conditions. The aim of the whole special issue is indeed to provide new hints for the reflection about the relationship between Self and semiosis, from both the theoretical and philosophical points of view. The articles of Salvatore, Luleci and Silva Filho &amp;amp; Dazzani, discuss the relationship between the Self and the ideas of context, agency, belief and action as co-constitutive of the subject. The Self, as high level semiotic instance, is the process that results of and regulates the uniqueness of the experience in irreversible time. The continuity of the stream of Self and the culturally codified ways of producing signs about the experience in the world are also discussed. The articles of de Souza, de Mattos &amp;amp; Chavez, Fivush, Simao &amp;amp; Sampaio, instead, discuss the process of semiosis in different periods of the lifespan. Guimaraes, questions the generalization of Self across cultures, presenting the notion of “multiple selves”.</description>
          <date>2013</date>
          <type>article</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/6b918478-d43c-4705-a08b-afd3971e5054</identifier>
          <identifier>https://vbn.aau.dk/ws/files/178708561/Luca_Tateo.pdf</identifier>
          <source>Tateo , L &amp; marsico , G 2013 , ' The Self as tension of wholeness and emptiness ' , Interaccoes , vol. 9 , no. 24 , pp. 1-19 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns2:isPartOf>urn:ISSN:1646-2335</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/dd746c2d-bae1-415a-b07b-cbe58a9f216d</identifier>
        <datestamp>2018-02-12T09:25:08Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Differently inside:political psychology and lay thinking</title>
          <creator>Tateo, Luca</creator>
          <publisher>Information Age Publishing</publisher>
          <contributor>Magioglu, Thalia</contributor>
          <contributor>Valsiner, Jaan</contributor>
          <date>2014</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/dd746c2d-bae1-415a-b07b-cbe58a9f216d</identifier>
          <identifier>http://www.infoagepub.com/products/Culture-and-Political-Psychology</identifier>
          <identifier>urn:ISBN:9781623963682</identifier>
          <identifier>urn:ISBN:9781623963675</identifier>
          <source>Tateo , L 2014 , Differently inside : political psychology and lay thinking . in T Magioglu &amp; J Valsiner (eds) , Culture and Political Psychology : a societal perspective . Information Age Publishing , Advances in cultural psychology , pp. 75-83 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/a72b19e8-661e-4f32-8145-b50d334c8bf9</identifier>
        <datestamp>2020-01-01T05:28:29Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Beyond the Self and the Environment:The Psychological Horizon</title>
          <creator>Tateo, Luca</creator>
          <publisher>Springer Science+Business Media</publisher>
          <contributor>Cabell, Kenneth R.</contributor>
          <contributor>Valsiner, Jaan</contributor>
          <date>2014</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/a72b19e8-661e-4f32-8145-b50d334c8bf9</identifier>
          <identifier>https://doi.org/10.1007/978-1-4614-8821-7_12</identifier>
          <identifier>urn:ISBN:978-1-4614-8820-0</identifier>
          <source>Tateo , L 2014 , Beyond the Self and the Environment : The Psychological Horizon . in K R Cabell &amp; J Valsiner (eds) , The Catalyzing Mind : Beyond Models of Causality . vol. 11 , Springer Science+Business Media , Annals of Theoretical Psychology , vol. 11 , pp. 223-237 . https://doi.org/10.1007/978-1-4614-8821-7_12</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/a66fa8d8-7480-44e2-90ea-e4c131cff11d</identifier>
        <datestamp>2018-02-12T09:28:34Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Externalizing Behaviour for Analysing System Models</title>
          <creator>Ivanova, Marieta Georgieva</creator>
          <creator>Probst, Christian W.</creator>
          <creator>Hansen, Rene Rydhof</creator>
          <creator>Kammüller, Florian</creator>
          <date>2013-11</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/a66fa8d8-7480-44e2-90ea-e4c131cff11d</identifier>
          <identifier>http://isyou.info/jisis/vol3/no34/jisis-2013-vol3-no34-05.pdf</identifier>
          <source>Ivanova , M G , Probst , C W , Hansen , R R &amp; Kammüller , F 2013 , ' Externalizing Behaviour for Analysing System Models ' , Journal of Internet Services and Information Security , vol. 3 , no. 3/4 , pp. 52-62 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/318003</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns2:isPartOf>urn:ISSN:2182-2069</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/cfcabc5c-24dc-43d6-b677-1a4b73b2bee2</identifier>
        <datestamp>2020-01-01T05:37:55Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Reachability-based Impact as a Measrue for Insiderness</title>
          <creator>Probst, Christian W.</creator>
          <creator>Hansen, Rene Rydhof</creator>
          <subject>Insider threats</subject>
          <subject>Insiderness</subject>
          <subject>System models</subject>
          <date>2013-12</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/cfcabc5c-24dc-43d6-b677-1a4b73b2bee2</identifier>
          <identifier>http://isyou.info/jowua/papers/jowua-v4n4-3.pdf</identifier>
          <source>Probst , C W &amp; Hansen , R R 2013 , ' Reachability-based Impact as a Measrue for Insiderness ' , Journal of Wireless Mobile Networks, Ubiquitous Computing and Dependable Applications , vol. 4 , no. 4 , pp. 38-48 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/318003</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns2:isPartOf>urn:ISSN:2093-5374</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/1428c1f3-e492-44f5-bfb8-8b2b93b0026b</identifier>
        <datestamp>2020-02-19T20:03:44Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">The Dialogical Dance:Self, Identity Construction, Positioning and Embodiment in Tango Dancers</title>
          <creator>Tateo, Luca</creator>
          <date>2014-09</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/1428c1f3-e492-44f5-bfb8-8b2b93b0026b</identifier>
          <identifier>https://doi.org/10.1007/s12124-014-9258-2</identifier>
          <source>Tateo , L 2014 , ' The Dialogical Dance : Self, Identity Construction, Positioning and Embodiment in Tango Dancers ' , Integrative Psychological &amp; Behavioral Science , vol. 48 , no. 3 , pp. 299-321 . https://doi.org/10.1007/s12124-014-9258-2</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:1932-4502</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/db639edf-a672-40be-818b-804351dcc72b</identifier>
        <datestamp>2018-12-12T10:45:39Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Open Complementarity in Cultural Psychology</title>
          <creator>Tateo, Luca</creator>
          <creator>Marsico, Giuseppina</creator>
          <publisher>Information Age Publishing</publisher>
          <contributor>Wagoner, Brady</contributor>
          <contributor>Chaudhary, Nandita</contributor>
          <contributor>Hviid, Pernille</contributor>
          <date>2014</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/db639edf-a672-40be-818b-804351dcc72b</identifier>
          <identifier>http://www.infoagepub.com/products/Cultural-Psychology-and-Its-Future</identifier>
          <identifier>urn:ISBN:978-1-62396-625-6</identifier>
          <identifier>urn:ISBN:978-1-62396-626-3</identifier>
          <source>Tateo , L &amp; Marsico , G 2014 , Open Complementarity in Cultural Psychology . in B Wagoner , N Chaudhary &amp; P Hviid (eds) , Culture Psychology and Its Future : Complementarity in a New Key . 1 edn , Information Age Publishing , Niels Bohr Professorship Lectures in Cultural Psychology , no. 1 , pp. 77-91 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/b7bc5e2a-a014-4c5c-a87f-648845581bbe</identifier>
        <datestamp>2018-02-12T09:30:42Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Using point-set compression to classify folk songs</title>
          <creator>Meredith, David</creator>
          <subject>normalized compression distance</subject>
          <subject>machine learning</subject>
          <subject>music analysis</subject>
          <subject>folk music</subject>
          <description xml:lang="eng">Thirteen different compression algorithms were used to calculate the normalized compression distances (NCDs) between pairs of tunes in the Annotated Corpus of 360 Dutch folk songs from the collection Onder de groene linde. These NCDs were then used in conjunction with the 1-nearest-neighbour algorithm and leave-one-out cross-validation to classify the 360 melodies into tune families. The classifications produced by the algorithms were compared with a ground-truth classification prepared by expert musicologists. Twelve of the thirteen compressors used in the experiment were based on the discovery of translational equivalence classes (TECs) of maximal translatable patterns (MTPs) in point-set representations of the melodies. The twelve algorithms consisted of four variants of each of three basic algorithms, COSIATEC, SIATECCompress and Forth’s algorithm. The main difference between these algorithms is that COSIATEC strictly partitions the input point set into TEC covered sets, whereas the TEC covered sets in the output of SIATECCompress and Forth’s algorithm may share points. The general-purpose compressor, bzip2, was used as a baseline against which the point-set compression algorithms were compared. The highest classification success rate of 77–84% was achieved by COSIATEC, followed by 60–64% for Forth’s algorithm and then 52–58% for SIATECCompress. When the NCDs were calculated using bzip2, the success rate was only 12.5%. The results demonstrate that the effectiveness of NCD for measuring similarity between folk-songs for classification purposes is highly dependent upon the&lt;br/&gt;actual compressor chosen. Furthermore, it seems that compressors based on finding maximal repeated patterns in point-set representations of music show more promise for NCD-based music classification than general-purpose compressors designed for compressing text strings.</description>
          <publisher>Computer Engineering Department, Bog ̆aziçi University</publisher>
          <contributor>Holzapfel, Andre</contributor>
          <date>2014</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/b7bc5e2a-a014-4c5c-a87f-648845581bbe</identifier>
          <identifier>https://vbn.aau.dk/ws/files/198266979/fma2014_submission_15.pdf</identifier>
          <identifier>http://www.cmpe.boun.edu.tr/fma2014/</identifier>
          <identifier>http://www.cmpe.boun.edu.tr/fma2014/fma2014_proceedings.pdf</identifier>
          <source>Meredith , D 2014 , Using point-set compression to classify folk songs . in A Holzapfel (ed.) , Proceedings of the Fourth International Workshop on Folk Music Analysis (FMA2014) . Computer Engineering Department, Bog ̆aziçi University , pp. 29-35 , International Workshop on Folk Music Analysis , Istanbul , Turkey , 12/06/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/ef8dcc2c-8bc6-47ce-985a-11daf97cc9df</identifier>
        <datestamp>2020-01-28T05:27:33Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Compression-based geometric pattern discovery in music</title>
          <creator>Meredith, David</creator>
          <subject>pattern discovery</subject>
          <subject>compression</subject>
          <subject>music information retrieval</subject>
          <subject>music analysis</subject>
          <subject>machine learning</subject>
          <description xml:lang="eng">The purpose of musical analysis is to find the best possible explanations for musical objects, where such objects may range from single chords or phrases to entire musical corpora. Kolmogorov complexity theory suggests that the best possible explanation for an object is represented by the shortest possible description of it. Two compression algorithms, COSIATEC and SIATECCompress, are described that take point-set representations of musical objects as input and generate compressed encodings of these point sets as output. The algorithms were evaluated on a task in which 360 folk songs were classified into tune families using normalized compression distance, a 1-nn classifier and leave-one-out cross-validation. COSIATEC achieved a success rate of 84% on this task, compared with a success rate of 13% for a general-purpose compressor. Variants of the algorithms incorporating modifications that have been suggested in the literature were also run on the task and the results were compared.</description>
          <publisher>IEEE Press</publisher>
          <date>2014</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <format>application/octet-stream</format>
          <identifier>https://vbn.aau.dk/da/publications/ef8dcc2c-8bc6-47ce-985a-11daf97cc9df</identifier>
          <identifier>https://doi.org/10.1109/CIP.2014.6844503</identifier>
          <identifier>https://vbn.aau.dk/ws/files/198267449/PID3175191.pdf</identifier>
          <identifier>https://vbn.aau.dk/ws/files/198267450/CIP2014.pptx</identifier>
          <identifier>http://cip2014.conwiz.dk</identifier>
          <identifier>urn:ISBN:978-1-4799-3696-0</identifier>
          <source>Meredith , D 2014 , Compression-based geometric pattern discovery in music . in 4th International Workshop on Cognitive Information Processing, CIP 2014 . IEEE Press , International Workshop on Cognitive Information Processing , Copenhagen , Denmark , 26/05/2014 . https://doi.org/10.1109/CIP.2014.6844503</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/8bb83354-c682-4b2f-90ba-88fb7a3898d8</identifier>
        <datestamp>2020-04-04T03:42:56Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Participatory systems mapping for sustainable consumption:Discussion of a method promoting systemic insights</title>
          <creator>Sedlacko, Michal</creator>
          <creator>Martinuzzi, Andre</creator>
          <creator>Røpke, Inge</creator>
          <creator>Videira, Nuno</creator>
          <creator>Antunes, Paula</creator>
          <description xml:lang="dan">The paper describes our usage of and experience with the method of participatory systems mapping. The method, developed for the purpose of facilitating knowledge brokerage, builds on participatory modelling approaches and applications and was used in several events involving both researchers and policy makers. The paper presents and discusses examples of how different types of participatory interaction with causal loop diagrams (‘system maps’) produced different insights on issues related to sustainable consumption and enabled participatory reflection and sharing of knowledge. Together, these insights support a systemic understanding of the issues and Thus the method provides instruments for coping with complexity when formulating policies for sustainable consumption. Furthermore the paper discusses the ability of the method—and its limits—to connect mental models of participants through structured discussion and thus bridge boundaries between different communities.</description>
          <date>2014-10</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/8bb83354-c682-4b2f-90ba-88fb7a3898d8</identifier>
          <identifier>https://doi.org/10.1016/j.ecolecon.2014.07.002</identifier>
          <source>Sedlacko , M , Martinuzzi , A , Røpke , I , Videira , N &amp; Antunes , P 2014 , ' Participatory systems mapping for sustainable consumption : Discussion of a method promoting systemic insights ' , Ecological Economics , vol. 106 , pp. 33-43 . https://doi.org/10.1016/j.ecolecon.2014.07.002</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/JA</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:0921-8009</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/7d107f27-2fd7-4343-a0ae-c03fe29ef6c2</identifier>
        <datestamp>2020-01-01T06:04:07Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">In-depth motivic analysis based on multiparametric closed pattern and cyclic sequence mining</title>
          <creator>Lartillot, Olivier</creator>
          <subject>Motivic analysis</subject>
          <subject>Pattern discovery</subject>
          <description xml:lang="eng">The paper describes a computational system for exhaustive but compact description of repeated motivic patterns in symbolic representations of music. The approach follows a method based on closed heterogeneous pattern mining in multiparametrical space with control of pattern cyclicity. This paper presents a much simpler description and justification of this general strategy, as well as significant simplifications of the model, in particular concerning the management of pattern cyclicity.&lt;br/&gt;A new method for automated bundling of patterns belonging to same motivic or thematic classes is also presented.&lt;br/&gt;&lt;br/&gt;The good performance of the method is shown through the analysis of a piece from the JKUPDD database. Ground-truth motives are detected, while additional relevant information completes the ground-truth musicological analysis.&lt;br/&gt;&lt;br/&gt;The system, implemented in Matlab, is made publicly available as part of MiningSuite, a new open-source framework for audio and music analysis.&lt;br/&gt;</description>
          <contributor>Wang, Hsin-Min</contributor>
          <contributor>Yang, Yi-Hsuan</contributor>
          <contributor>Lee, Jin Ha</contributor>
          <date>2014</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/7d107f27-2fd7-4343-a0ae-c03fe29ef6c2</identifier>
          <identifier>https://vbn.aau.dk/ws/files/204036937/final.pdf</identifier>
          <identifier>http://www.terasoft.com.tw/conf/ismir2014/ConferenceProgram.html#a3</identifier>
          <identifier>http://www.terasoft.com.tw/conf/ismir2014/proceedings/T065_308_Paper.pdf</identifier>
          <identifier>http://www.terasoft.com.tw/conf/ismir2014/Proceedings.html</identifier>
          <source>Lartillot , O 2014 , In-depth motivic analysis based on multiparametric closed pattern and cyclic sequence mining . in H-M Wang , Y-H Yang &amp; J H Lee (eds) , 15th International Society for Music Information Retrieval Conference . International Symposium on Music Information Retrieval , Taipei , Taiwan, Province of China , 27/10/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/9e5a9149-754e-49b8-8690-6de129c0a235</identifier>
        <datestamp>2018-02-12T09:35:34Z</datestamp>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">An integrative computational modelling of music structure apprehension</title>
          <creator>Lartillot, Olivier</creator>
          <subject>Music analysis</subject>
          <subject>musical structure</subject>
          <subject>complex systems</subject>
          <subject>segmentation</subject>
          <subject>Grouping</subject>
          <description xml:lang="eng">An objectivization of music analysis requires a detailed formalization of the underlying principles and methods. The formalization of the most elementary structural processes is hindered by the complexity of music, both in terms of profusions of entities (such as notes) and of tight interactions between a large number of dimensions. Computational modeling would enable systematic and exhaustive tests on sizeable pieces of music, yet current researches cover particular musical dimensions with limited success. The aim of this research is to conceive a computational modeling of music analysis encompassing the main core components and focusing on their interdependencies. The system should be as simple as possible, while producing relevant structural analyses on a large variety of music. This paper describes the general principles of a computational framework for music analysis currently under construction. The complex system of music structure is described as an interaction between modules focusing on formal operations that are conceived as general as possible. Each module addresses a core aspect of music analysis and offers some innovative breakthrough compared to the state of the art. In order to overcome the limitations of local segmentation, we propose an alternative paradigm based on hierarchical local grouping. Ornamentation reduction, and more generally the inference of deeper structures from the musical surface is carried out by selecting key elements from each local grouping structure, offering hence an implementation of “Time-Span Reduction”. Parallelism, i.e. sequential repetition, considered here as an essential aspect of music analysis, is applied to the search for motives, for mode-related patterns as well as metrical analysis. A new approach for modal analysis is based on a comparison of the local context (defined by the current and recent notes, and taking into account ornaments reduction) with all possible modes and key scales. Structural information inferred in each module is fed back into the other modules. Besides the practical application to automated music analysis, the computational model, by virtue of its generality, extensiveness and operationality, is suggested as a blueprint for the establishment of cognitively validated model of music structure apprehension. Available as a Matlab module, it can be used for practical musicological uses.&lt;br/&gt;</description>
          <publisher>Yonsei University</publisher>
          <contributor>Kyoung Song, Moo</contributor>
          <date>2014</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/9e5a9149-754e-49b8-8690-6de129c0a235</identifier>
          <identifier>https://vbn.aau.dk/ws/files/204037394/icmpc_apscom_2014_Proceedings_.pdf</identifier>
          <identifier>http://www.icmpc-apscom.org/file/icmpc-apscom_2014_(Proceedings).pdf</identifier>
          <source>Lartillot , O 2014 , An integrative computational modelling of music structure apprehension . in M Kyoung Song (ed.) , Proceedings, ICMPC-APSCOM 2014 Joint Conference : 13th International Conference on Music Perception and Cognition . Yonsei University , pp. 80-86 , ICMPC-APSCOM 2014 , Seoul , Korea, Republic of , 04/08/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/13622d6e-40d6-499f-8f67-72783e773590</identifier>
        <datestamp>2018-02-12T09:36:04Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Music analysis and point-set compression</title>
          <creator>Meredith, David</creator>
          <subject>music analysis</subject>
          <subject>pattern discovery</subject>
          <subject>computational geometry</subject>
          <subject>data compression</subject>
          <subject>Kolmogorov complexity</subject>
          <description xml:lang="eng">A musical analysis represents a particular way of understanding certain aspects of the structure of a piece of music. The quality of an analysis can be evaluated to some extent by the degree to which knowledge of it improves performance on tasks such as mistake spotting, memorising a piece, attributing authorship, completing an unfinished work and so on. A traditional principle in science is "Occam's razor", which states that, given two conflicting successful explanations for the same data, one should choose the simpler alternative. This principle has been formalized in information theory as the minimum description length principle and relates closely to certain ideas in the theory of Kolmogorov complexity. Inspired by this general principle, the hypothesis explored in this paper is that the best ways of understanding (or explanations for) a piece of music are those that are represented by the shortest possible descriptions of the piece. With this in mind, two compression algorithms are presented, COSIATEC and SIATECCompress. Each of these algorithms takes as input an in extenso description of a piece of music as a set of points in pitch-time space representing notes. Each algorithm then losslessly compresses this set of points, producing an encoding in terms of a sequence of sets of translationally related patterns. The patterns found by the algorithms often correspond closely to those identified by music analysts as being structurally important. The analyses generated by the algorithms for a selection of pieces will be presented and discussed.</description>
          <date>2014-09-19</date>
          <type>conferenceObject</type>
          <format>application/octet-stream</format>
          <identifier>https://vbn.aau.dk/da/publications/13622d6e-40d6-499f-8f67-72783e773590</identifier>
          <identifier>https://vbn.aau.dk/ws/files/208247528/EuroMAC2014_2.pptx</identifier>
          <identifier>http://www.titanmusic.com</identifier>
          <identifier>https://sites.google.com/site/euromac2014/programme/9a/david-meredith</identifier>
          <source>Meredith , D 2014 , ' Music analysis and point-set compression ' , European Music Analysis Conference , Leuven , Belgium , 17/09/2014 - 20/09/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/4b739d66-f1a1-44d4-b428-1952b347b354</identifier>
        <datestamp>2018-02-12T09:36:04Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Melodic pattern discovery by structural analysis via wavelets and clustering techniques</title>
          <creator>Velarde, Gissel</creator>
          <creator>Meredith, David</creator>
          <subject>wavelet analysis</subject>
          <subject>music analysis</subject>
          <subject>Pattern discovery</subject>
          <subject>classification</subject>
          <subject>clustering</subject>
          <subject>machine learning</subject>
          <description xml:lang="eng">&lt;p style="margin-bottom:0.0001pt;text-align:justify;line-height:normal"&gt;We present an automatic method to support melodic pattern discovery by structural analysis of symbolic representations by means of wavelet analysis and clustering techniques. In previous work, we used the method to recognize the parent works of melodic segments, or to classify tunes into tune families (Velarde, Weyde &amp;amp; Meredith, 2013), and in this study, we use it to discover melodic patterns. Wavelet analysis is a mathematical tool that compares time-series with an oscillation — the wavelet — at different positions and scales, returning similarity coefficients. We explore properties of the wavelet coefficients in relation to segmentation and similarity detection. For this purpose, we sample symbolic representations of monophonic pieces into one-dimensional (1D) pitch signals, which are contour like representations of those pieces, and apply the continuous wavelet transform (CWT) with the Haar wavelet. The returning wavelet coefficients are used to set local boundaries at different time-scales, considering the coefficients’ zero crossings, local maxima or local extrema. The wavelet coefficients are also used to represent segments in a transposition invariant manner. We use k-means to cluster melodic segments into groups of measured similarity and obtain a raking of the most prototypical melodic segments or patterns and their occurrences. We test the method on the JKU Patterns Development Database and evaluate it based on the ground truth defined by the MIREX 2013 Discovery of Repeated Themes &amp;amp; Sections task. We compare the results of our method to the output of geometric approaches. Finally, we discuss about the relevance of our wavelet-based analysis in relation to structure, pattern discovery, similarity and variation, and comment about the considerations of the method when used to support human or computer assisted music analysis and teaching.&lt;/p&gt;</description>
          <date>2014-09-19</date>
          <type>conferenceObject</type>
          <format>application/mspowerpoint</format>
          <identifier>https://vbn.aau.dk/da/publications/4b739d66-f1a1-44d4-b428-1952b347b354</identifier>
          <identifier>https://vbn.aau.dk/ws/files/210244872/Euromac_Velarde_Meredith_4.ppt</identifier>
          <identifier>http://issuu.com/europeanmusicanalysis/docs/programme_for_issuu</identifier>
          <source>Velarde , G &amp; Meredith , D 2014 , ' Melodic pattern discovery by structural analysis via wavelets and clustering techniques ' , Paper presented at European Music Analysis Conference , Leuven , Belgium , 17/09/2014 - 20/09/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/44f5f625-4f7d-4692-b7d0-bd3e65a9b771</identifier>
        <datestamp>2018-02-12T09:36:04Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">A wavelet-based approach to the discovery of themes and sections in monophonic melodies</title>
          <creator>Velarde, Gissel</creator>
          <creator>Meredith, David</creator>
          <subject>Pattern discovery</subject>
          <subject>continous wavelet transform</subject>
          <subject>Haar wavelet</subject>
          <subject>monophonic melodies</subject>
          <subject>clustering</subject>
          <description xml:lang="eng">We present the computational method submitted to the MIREX 2014 Discovery of Repeated Themes &amp;amp; Sections task, and the results on the monophonic version of the JKU Patterns Development Database. In the context of pattern discovery in monophonic music, the idea behind our method is that, with a good melodic structure in terms of segments, it should be possible to gather similar segments&lt;br/&gt;into clusters and rank their salience within the piece. We present an approach to this problem and how we address it. In general terms, we represent melodies&lt;br/&gt;either as raw 1D pitch signals or as these signals filtered with the continuous wavelet transform (CWT) using the Haar wavelet. We then segment the signal either into constant duration segments or at the resulting coefficients’ modulus local maxima. Segments are concatenated based on their contiguous city-block distance. The concatenated segments are compared using city-block distance and clustered using an agglomerative hierarchical cluster tree. Finally, clusters are ranked according the sum of the length of segments’ occurrences. We present&lt;br/&gt;the results of our method on the JKU Patterns Development Database.&lt;br/&gt;</description>
          <date>2014-10-22</date>
          <type>conferenceObject</type>
          <format>application/pdf</format>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/44f5f625-4f7d-4692-b7d0-bd3e65a9b771</identifier>
          <identifier>https://vbn.aau.dk/ws/files/205643557/VM.pdf</identifier>
          <identifier>https://vbn.aau.dk/ws/files/205516965/Poster_MIREX_VM2014.pdf</identifier>
          <identifier>http://www.music-ir.org/mirex/abstracts/2014/VM1.pdf</identifier>
          <identifier>http://www.terasoft.com.tw/conf/ismir2014/ConferenceProgram.html</identifier>
          <source>Velarde , G &amp; Meredith , D 2014 , ' A wavelet-based approach to the discovery of themes and sections in monophonic melodies ' , International Symposium on Music Information Retrieval , Taipei , Taiwan, Province of China , 27/10/2014 - 31/10/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/9b0e878b-cc5c-417c-8978-fdfb06467add</identifier>
        <datestamp>2018-02-12T09:36:23Z</datestamp>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">PatMinr:In-depth motivic analysis of symbolic monophonic sequences</title>
          <creator>Lartillot, Olivier</creator>
          <subject>Motivic analysis</subject>
          <subject>motivic repetition</subject>
          <subject>pattern mining</subject>
          <subject>symbolic music</subject>
          <description xml:lang="eng">A version of PatMinr has been submitted to the MIREX task on Discovery of Repeated Themes &amp;amp; Sections. PatMinr can find repetitions of sequential patterns from monophonic sequences represented in a symbolic format. This document presents the model in more details, and specifies the particular parameters used in the version submitted to the MIREX competition.</description>
          <date>2014</date>
          <type>conferenceObject</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/9b0e878b-cc5c-417c-8978-fdfb06467add</identifier>
          <identifier>https://vbn.aau.dk/ws/files/204825969/mirex.pdf</identifier>
          <identifier>http://www.music-ir.org/mirex/wiki/2014:MIREX2014_Results</identifier>
          <source>Lartillot , O 2014 , ' PatMinr : In-depth motivic analysis of symbolic monophonic sequences ' , Paper presented at Music Information Retrieval Evaluation eXchange , Taipei , Taiwan, Province of China , 31/10/2014 - 31/10/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/986d08b1-cbf3-4c41-9392-8bf0dbd0cd73</identifier>
        <datestamp>2020-01-01T06:15:25Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">The Providence of Associated Minds:Agency in the Thought of Giambattista Vico and the Origins of Social and Cultural Psychology</title>
          <creator>Tateo, Luca</creator>
          <description xml:lang="eng">Giambattista Vico (1668–1744) has been one of the most innovative and influential thinkers in the history of human and social sciences. Although psychology sometimes underestimates his contribution, Vico was the first scholar to develop a systematic view of the relationship between mind and culture. This chapter presents his ideas about the co-development of psychological and cultural processes and about the philosophical view of individual and collective agency. I show how Vico’s “new science” about human facts will directly influence the birth of social and cultural psychology, through his reception, for instance, by Wilhelm Wundt and Carlo Cattaneo. The intellectual project that Vico pursued all his life was to develop a specific theory and method to account for the history of human development of civilization as well as to the full range of human products, arts, law, customs, language, institutions, etc. Besides, he developed several concepts—such as imagination, common sense, verum factum principle, embodiment, poetic logic, imaginative universals, genetic principle, etc.—that directly questioned the mechanistic and reductionist view of mental processes. For these reasons, it is worth rediscovering today Giambattista Vico as a fundamental source of ideas that could contribute to the development of new reflections and directions in psychological science.</description>
          <publisher>Springer</publisher>
          <contributor>Gruber, Craig</contributor>
          <contributor>Clark, Matthew</contributor>
          <contributor>Klempe, Sven Hroar</contributor>
          <contributor>Valsiner, Jaan</contributor>
          <date>2015</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/986d08b1-cbf3-4c41-9392-8bf0dbd0cd73</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-10130-9_2</identifier>
          <identifier>urn:ISBN:978-3-319-10129-3</identifier>
          <source>Tateo , L 2015 , The Providence of Associated Minds : Agency in the Thought of Giambattista Vico and the Origins of Social and Cultural Psychology . in C Gruber , M Clark , S H Klempe &amp; J Valsiner (eds) , Constraints of Agency : Explorations of Theory in Everyday Life . Springer , Annals of Theoretical Psychology , vol. 12 , pp. 31-43 . https://doi.org/10.1007/978-3-319-10130-9_2</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/f2165ba1-001b-457c-96f9-01d9a1be3d77</identifier>
        <datestamp>2020-02-04T11:28:55Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Optimizing Bayesian Networks for Recognition of Driving Maneuvers to Meet the Automotive Requirements</title>
          <creator>Weidl, Galia</creator>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Dietmar, Kasper</creator>
          <creator>Breuel, Gabi</creator>
          <publisher>IEEE</publisher>
          <date>2014</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/f2165ba1-001b-457c-96f9-01d9a1be3d77</identifier>
          <identifier>https://doi.org/10.1109/ISIC.2014.6967630</identifier>
          <identifier>https://vbn.aau.dk/ws/files/206734562/BNopt_WeidlEtal_refMSC.pdf</identifier>
          <source>Weidl , G , Madsen , A L , Dietmar , K &amp; Breuel , G 2014 , Optimizing Bayesian Networks for Recognition of Driving Maneuvers to Meet the Automotive Requirements . in Intelligent Control (ISIC), 2014 IEEE International Symposium . IEEE , pp. 1626 -1631 , IEEE Multi-Conference on Systems and Control (MSC) , Nice/Antibes , France , 08/10/2014 . https://doi.org/10.1109/ISIC.2014.6967630</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/fd26ed73-5a56-483e-b515-6aa91973bb77</identifier>
        <datestamp>2018-02-12T09:37:30Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Requirement Engineering for a Small Project with Pre-Specified Scope</title>
          <creator>Nielsen, Thomas Dyhre</creator>
          <creator>Hovda, Sigve</creator>
          <creator>Antontio, Fernandez</creator>
          <creator>Langseth, Helge</creator>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Masegosa, Andres</creator>
          <creator>Salmerón, Antonio</creator>
          <date>2014</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/fd26ed73-5a56-483e-b515-6aa91973bb77</identifier>
          <identifier>https://vbn.aau.dk/ws/files/206734584/13_24_1_SM.pdf</identifier>
          <identifier>http://ojs.bibsys.no/index.php/NIK/article/view/13</identifier>
          <identifier>urn:ISBN:1892-0721</identifier>
          <source>Nielsen , T D , Hovda , S , Antontio , F , Langseth , H , Madsen , A L , Masegosa , A &amp; Salmerón , A 2014 , Requirement Engineering for a Small Project with Pre-Specified Scope . in NIK : Norsk Informatikkonferanse . Norsk Informatikkonferanse , Fredrikstad , Norway , 17/11/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/cf301bf8-5014-41ca-b072-b1bba312f57b</identifier>
        <datestamp>2020-01-11T07:13:59Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Giambattista Vico and the principles of cultural psychology: A programmatic retrospective</title>
          <creator>Tateo, Luca</creator>
          <subject>cultural psychology, epistemology of psychology, history of psychology, qualitative psychology, Giambattista Vico</subject>
          <description xml:lang="eng">The Italian philosopher Giambattista Vico developed a theoretical framework for the study of human sciences that exerted a strong influence on psychology and other human sciences. He backed the unity of the knowledge about human mind and culture, including history, linguistics, philosophy, philology, epistemology, psychology, and for the first time proposed a method for their study that he ambitiously called ‘new science’. The article presents an overview of Vico’s thought and discusses some of the main axioms of his theoretical system. His critique of Cartesianism as the alternative epistemology he outlined is put forward as a thoughtful tool for reflection on contemporary psychological science. This retrospective look at Vico’s idea would finally provide useful insights for a programmatic view on cultural psychology.</description>
          <date>2015-02</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/cf301bf8-5014-41ca-b072-b1bba312f57b</identifier>
          <identifier>https://doi.org/10.1177/0952695114564628</identifier>
          <source>Tateo , L 2015 , ' Giambattista Vico and the principles of cultural psychology : A programmatic retrospective ' , History of the Human Sciences , vol. 28 , no. 1 , pp. 44-65 . https://doi.org/10.1177/0952695114564628</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:0952-6951</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/429e2b5d-9ff3-470c-8f20-ff8d8470c0be</identifier>
        <datestamp>2018-02-12T09:37:51Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Temporality and Generalization in Psychology:Time as Context</title>
          <creator>Tateo, Luca</creator>
          <publisher>Information Age Publishing</publisher>
          <contributor>Simão, Livia</contributor>
          <contributor>Guimarães , Danilo</contributor>
          <contributor>Valsiner, Jaan</contributor>
          <date>2015</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/429e2b5d-9ff3-470c-8f20-ff8d8470c0be</identifier>
          <identifier>http://www.infoagepub.com/products/Temporality</identifier>
          <identifier>urn:ISBN:978-1-62396-967-7</identifier>
          <source>Tateo , L 2015 , Temporality and Generalization in Psychology : Time as Context . in L Simão , D Guimarães &amp; J Valsiner (eds) , Temporality : Culture in the Flow of Human Experience . Information Age Publishing , Advances in Cultural Psychology: Constructing Human Development , pp. 463-482 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/6501d3e1-a8bb-4dd4-9c65-718bd595da23</identifier>
        <datestamp>2018-08-10T09:58:36Z</datestamp>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Tackling the dual challenge of sustainable consumption and economic growth:A research agenda</title>
          <creator>Sedlacko, Michal</creator>
          <creator>Antunes, Paula</creator>
          <creator>Asara, Viviana</creator>
          <creator>Dobernig, Karin</creator>
          <creator>Filčák, Richard</creator>
          <creator>Hewett, Chris</creator>
          <creator>Jackson, Tim</creator>
          <creator>Jäger, Jill</creator>
          <creator>Lunda, Vivien</creator>
          <creator>Martinez-Alier, Joan</creator>
          <creator>Martinuzzi, André</creator>
          <creator>Røpke, Inge</creator>
          <creator>Rubik, Frieder</creator>
          <creator>Schneider, Francois</creator>
          <creator>Scholl, Gerd</creator>
          <creator>Stagl, Sigrid</creator>
          <creator>Videira, Nuno</creator>
          <subject>Sustainable consumption</subject>
          <subject>Systemic approaches</subject>
          <subject>Economic growth</subject>
          <description xml:lang="dan">There is overwhelming evidence that one of the most important challenges facing society today is the growing scale and unequal distribution of consumption of natural resources. Both the socio-economic implications of resource scarcities and the documented decline in provision of and rising threats to ecosystem services have spurred parts of the academic and policy communities into identification of problems and solutions. Some of the most fundamental debates, led by researchers from various disciplines, centre around economic growth and sustainable consumption. However, there is often a lack of knowledge exchange between these researchers as well as between researchers and policy makers. Together with other factors this results in slow policy progress. In this paper, we seek to contribute to the dialogue and understanding between sustainability science and policy by identifying a set of important research questions that link the challenges of sustainable consumption with economic growth debates and critiques. The research questions have been identified through an extensive participatory process involving leading researchers and policy makers responsible for sustainability policies throughout the whole EU and cover five areas (food, housing, mobility, information and communication technology, finance). The aim of the research questions is to orient researchers towards important research priorities as well as guide policy makers and public authorities in funding of research and use of sound scientific evidence and policy advice to inform decision making. We anticipate that addressing these questions will contribute to rethinking of societal institutions and forms of consumption in order to transition towards sustainability, while improving the synergy between policy and sustainability science. This paper presents some results of the RESPONDER project, Linking Research and Policy Making for Managing the Contradictions of Sustainable Consumption and Economic Growth, funded by the European Commission’s 7th Framework Programme, 2011–2014.</description>
          <date>2014</date>
          <type>conferenceObject</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/6501d3e1-a8bb-4dd4-9c65-718bd595da23</identifier>
          <identifier>https://vbn.aau.dk/ws/files/207218842/ISEE_2014_Research_agenda.pdf</identifier>
          <source>Sedlacko , M , Antunes , P , Asara , V , Dobernig , K , Filčák , R , Hewett , C , Jackson , T , Jäger , J , Lunda , V , Martinez-Alier , J , Martinuzzi , A , Røpke , I , Rubik , F , Schneider , F , Scholl , G , Stagl , S &amp; Videira , N 2014 , ' Tackling the dual challenge of sustainable consumption and economic growth : A research agenda ' , Paper presented at 13th Biennial Conference of the International Society for Ecological Economics , Reykjavik , Iceland , 13/08/2014 - 15/08/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/JA</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/4ded23d3-c0be-45e5-b802-065ed91a08cf</identifier>
        <datestamp>2020-01-01T06:20:20Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Arrowhead Compliant Virtual Market of Energy</title>
          <creator>Ferreira, Luis Lino</creator>
          <creator>Siksnys, Laurynas</creator>
          <creator>Pedersen, Per</creator>
          <creator>Stluka, Petr</creator>
          <creator>Chrysoulas, Christos</creator>
          <creator>Le Guilly, Thibaut</creator>
          <creator>Albano, Michele</creator>
          <creator>Skou, Arne</creator>
          <creator>Teixeira, César</creator>
          <creator>Pedersen, Torben Bach</creator>
          <description xml:lang="eng">Industrial processes use energy to transform raw materials and intermediate goods into final products. Many efforts have been done on the minimization of energy costs in industrial plants. Apart from working on “how” an industrial process is implemented, it is possible to reduce the energy costs by focusing on “when” it is performed. Although, some manufacturing plants (e.g. refining or petrochemical plants) can be inflexible with respect to time due to interdependencies in processes that must be respected for performance and safety reasons, there are other industrial segments, such as alumina plants or discrete manufacturing, with more degrees of flexibility. These manufacturing plants can consider a more flexible scheduling of the most energy-intensive processes in response to dynamic prices and overall condition of the electricity market. In this scenario, requests for energy can be encoded by means of a formal structure called flex-offers, then aggregated (joining several flex-offers into a bigger one) and sent to the market, scheduled, disaggregated and transformed into consumption plans, and eventually, into production schedules for given industrial plant. In this paper, we describe the flex-offer concept and how it can be applied to industrial and home automation scenarios. The architecture proposed in this paper aims to be adaptable to multiples scenarios (industrial, home and building automation, etc.), thus providing the foundations for different concept implementations using multiple technologies or supporting various kinds of devices.</description>
          <publisher>IEEE</publisher>
          <date>2014-09</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/4ded23d3-c0be-45e5-b802-065ed91a08cf</identifier>
          <identifier>https://doi.org/10.1109/ETFA.2014.7005193</identifier>
          <identifier>http://www.cister.isep.ipp.pt/docs/the_arrowhead_approach_for_soa_application_development_and_documentation_/993/view.pdf</identifier>
          <identifier>urn:ISBN:978-1-4799-4846-8</identifier>
          <source>Ferreira , L L , Siksnys , L , Pedersen , P , Stluka , P , Chrysoulas , C , Le Guilly , T , Albano , M , Skou , A , Teixeira , C &amp; Pedersen , T B 2014 , Arrowhead Compliant Virtual Market of Energy . in Emerging Technology and Factory Automation (ETFA), 2014 IEEE . IEEE , pp. 1-8 , Emerging Technology and Factory Automation (ETFA), 2014 , Barcelona , Spain , 16/09/2014 . https://doi.org/10.1109/ETFA.2014.7005193</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/Arrowhead</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">Artemis JU</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/8b3ba788-77b3-4706-b061-1df1efad99e3</identifier>
        <datestamp>2018-02-12T09:38:47Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">The Re-injection Loop concept:Economically efficient biogas production from manure fibres and straw</title>
          <creator>Holst Fischer, Christian</creator>
          <creator>Malmgren-Hansen, Bjørn</creator>
          <creator>Uellendahl, Hinrich</creator>
          <creator>Ruiz, Begoña</creator>
          <creator>Kragelund, Caroline</creator>
          <description xml:lang="eng">There is a huge unexploited biogas potential from manure and agricultural residues in Europe and worldwide. However, these substrates consist of a&lt;br/&gt;large fraction of fibres (range 5-80% of dry matter content) with a low methane potential and represent a marginal economy due to their low biogas&lt;br/&gt;yield per ton. Based on previous studies on using pretreatment for enhancing the biogas yield of these feedstocks, a new concept called Re-Injection&lt;br/&gt;Loop was developed by combining separation and recirculation of the digested fiber fraction with pretreatment of the recalcitrant lignocellulosic fiber&lt;br/&gt;fraction. The EU project BIOMAN is currently investigating different technologies for separation, mechanical pretreatment and enzymatic hydrolysis to&lt;br/&gt;establish an economically viable concept for manure-based biogas plants.</description>
          <date>2014</date>
          <type>conferenceObject</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/8b3ba788-77b3-4706-b061-1df1efad99e3</identifier>
          <identifier>https://vbn.aau.dk/ws/files/207823342/Poster_Bioman_NBC_Iceland_2014.pdf</identifier>
          <identifier>http://www.sorpa.is/nbc/program/</identifier>
          <source>Holst Fischer , C , Malmgren-Hansen , B , Uellendahl , H , Ruiz , B &amp; Kragelund , C 2014 , ' The Re-injection Loop concept : Economically efficient biogas production from manure fibres and straw ' , Nordic Biogas Conference , Reykjavik , Iceland , 27/08/2014 - 29/08/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7/2007-2013</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/0373864e-bfd8-45c5-87ce-5129b13e9c3a</identifier>
        <datestamp>2018-02-12T09:39:11Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">CriticalEd:A tool for assisting with the creation of critical commentaries</title>
          <creator>Kjellberg, Caspar Mølholt</creator>
          <creator>Geertinger, Axel</creator>
          <creator>Lundberg, Sigfrid</creator>
          <creator>Meredith, David</creator>
          <date>2015</date>
          <type>conferenceObject</type>
          <identifier>https://vbn.aau.dk/da/publications/0373864e-bfd8-45c5-87ce-5129b13e9c3a</identifier>
          <identifier>http://music-encoding.org/wp-content/uploads/2015/04/2014ConferenceProgram.pdf</identifier>
          <identifier>https://music-encoding.org/conference</identifier>
          <source>Kjellberg , C M , Geertinger , A , Lundberg , S &amp; Meredith , D 2015 , ' CriticalEd : A tool for assisting with the creation of critical commentaries ' , Paper presented at The Music Encoding Conference , Charlottesville, VA , United States , 20/05/2014 - 23/05/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/d63a0218-9153-4eb9-b543-9eb647517c06</identifier>
        <datestamp>2018-02-12T09:39:11Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Anatomy of the six-part all-partition array as used by Milton Babbitt:Preliminary efforts towards a computational method of automatic generation</title>
          <creator>Bemman, Brian</creator>
          <creator>Meredith, David</creator>
          <subject>all-partition array</subject>
          <subject>Milton Babbitt</subject>
          <subject>twelve-tone music</subject>
          <description xml:lang="eng">For Milton Babbitt (1916–2011), twelve-tone techniques were indispensable forms of musical composition because they are fundamentally derived from mathematical constructs. Perhaps his most complex form of composition is the all-partition array. Its large-scale structure is formed by concatenated permutations of 12-tone rows under the common class of musical equivalence&lt;br/&gt;relations, transposition, inversion, retrograde and retrograde inversion, and then organized into pairs of hexachordally combinatorial rows. The resultant pitch-class space is then partitioned into segment lengths of 12 integers or fewer distributed into a specified number of parts. Both its organization and number of parts are determined in part by the unique mathematical properties&lt;br/&gt;of all-combinatorial hexachords. Through analyses of two works representative of two types of six-part arrays, initial ground work is established for the automatic generation of the all-partition array structure. Preliminary concerns in the computational process are also addressed.</description>
          <date>2014-04-12</date>
          <type>conferenceObject</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/d63a0218-9153-4eb9-b543-9eb647517c06</identifier>
          <identifier>https://vbn.aau.dk/ws/files/208272883/Bemman_RMA_2014.pdf</identifier>
          <identifier>http://rmamusicandmaths.wordpress.com/</identifier>
          <source>Bemman , B &amp; Meredith , D 2014 , ' Anatomy of the six-part all-partition array as used by Milton Babbitt : Preliminary efforts towards a computational method of automatic generation ' , RMA Music and Mathematics Study Day , Leeds , United Kingdom , 12/04/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/a128dc49-bfb5-4f0a-b375-d01fd85105e4</identifier>
        <datestamp>2018-02-12T09:39:11Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">From analysis to surface:Generating the surface of Milton Babbitt's Sheer Pluck from a parsimonious encoding of an analysis of its pitch-class structure</title>
          <creator>Bemman, Brian</creator>
          <creator>Meredith, David</creator>
          <description xml:lang="eng">In recent years, a significant body of research has focused on developing algorithms for computing analyses of mu- sical works automatically from encodings of these works' surfaces [3,4,7,10,11]. The quality of the output of such analysis algorithms is typically evaluated by comparing it with a “ground truth” analysis of the same music pro- duced by a human expert (see, in particular, [5]).&lt;br/&gt;In this paper, we explore the problem of generating an encoding of the musical surface of a work automatically from a systematic encoding of an analysis. The ability to do this depends on one having an effective (i.e., comput- able), correct and complete description of some aspect of the structure of the music. Generating the surface struc- ture of a piece from an analysis in this manner serves as a proof of the analysis' correctness, effectiveness and com- pleteness.&lt;br/&gt;We present a reductive analysis of Sheer Pluck (1984), a twelve-tone composition for guitar by Milton Babbitt (1916–2011). This analysis focuses on the all-partition array structure on which the piece is based. Having pre- sented this analysis, we formalize some constraints on the structure of the piece and explore some computational difficulties in automating the generation of the all- partition array structure.</description>
          <date>2014</date>
          <type>conferenceObject</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/a128dc49-bfb5-4f0a-b375-d01fd85105e4</identifier>
          <identifier>https://vbn.aau.dk/ws/files/208274454/Bemman_2014_MEC_Update4.pdf</identifier>
          <identifier>http://music-encoding.org/conference</identifier>
          <source>Bemman , B &amp; Meredith , D 2014 , ' From analysis to surface : Generating the surface of Milton Babbitt's Sheer Pluck from a parsimonious encoding of an analysis of its pitch-class structure ' , Paper presented at The Music Encoding Conference , Charlottesville, VA , United States , 20/05/2014 - 23/05/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/374940ee-665e-44f9-9ab2-5ac3bd8937e2</identifier>
        <datestamp>2018-08-10T14:04:04Z</datestamp>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Testing the effect of different enzyme blends on increasing the biogas yield of straw and digested manure fibers</title>
          <creator>Njoku, Stephen Ikechukwu</creator>
          <creator>Jurado, Esperanza</creator>
          <creator>Malmgren-Hansen, Bjørn</creator>
          <creator>Kragelund, Caroline</creator>
          <creator>Ruiz, Begoña</creator>
          <creator>Uellendahl, Hinrich</creator>
          <description xml:lang="eng">In this study, enzymatic treatment was tested to increase the biogas yield of wheat straw (WS) and digested manure fibers (DMF) in the Re-Injection Loop Concept, which combines anaerobic digestion with solid separation to enhance the biogas yield per ton of manure by:&lt;br/&gt;1. Digestion of the easily degradable fraction of manure in the biogas process.&lt;br/&gt;2. Separation of the residual recalcitrant digested fiber fraction project.&lt;br/&gt;3. Ultrasound and/or enzymatic treatment of the digested fiber fraction.&lt;br/&gt;4. Recirculation of the treated fiber fraction into the reactor.</description>
          <date>2014-10-26</date>
          <type>conferenceObject</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/374940ee-665e-44f9-9ab2-5ac3bd8937e2</identifier>
          <identifier>https://vbn.aau.dk/ws/files/208630429/BiogasScience2014_Poster_HU_221014.pdf</identifier>
          <source>Njoku , S I , Jurado , E , Malmgren-Hansen , B , Kragelund , C , Ruiz , B &amp; Uellendahl , H 2014 , ' Testing the effect of different enzyme blends on increasing the biogas yield of straw and digested manure fibers ' , Biogas Science 2014 , Vienna , Austria , 26/10/2014 - 30/10/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7/2007-2013</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/c09b6ce0-a0af-4f76-8ec9-66e6dadd666d</identifier>
        <datestamp>2018-03-13T14:10:56Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Tensegrity as existential condition:the inherent ambivalence of development</title>
          <creator>Tateo, Luca</creator>
          <publisher>Information Age Publishing</publisher>
          <contributor>Albert, Isabelle</contributor>
          <contributor>Abbey, Emily</contributor>
          <contributor>Valsiner, Jaan</contributor>
          <date>2018</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/c09b6ce0-a0af-4f76-8ec9-66e6dadd666d</identifier>
          <identifier>http://www.infoagepub.com/products/Trans-Generational-Family-Relations</identifier>
          <identifier>urn:ISBN:978-1-64113-082-0</identifier>
          <source>Tateo , L 2018 , Tensegrity as existential condition : the inherent ambivalence of development . in I Albert , E Abbey &amp; J Valsiner (eds) , Trans-Generational Family Relations : Investigating Ambivalences . Information Age Publishing , Charlotte , Perspectives on Human Development , pp. 3-20 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/d659911d-1b42-4778-9d5a-b5e7233e515d</identifier>
        <datestamp>2020-01-17T20:23:24Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">The psychological imagination</title>
          <creator>Tateo, Luca</creator>
          <date>2016</date>
          <type>article</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/d659911d-1b42-4778-9d5a-b5e7233e515d</identifier>
          <identifier>https://doi.org/10.1590/0103-6564D20160008</identifier>
          <identifier>https://vbn.aau.dk/ws/files/239768835/1678_5177_pusp_27_02_00229.pdf</identifier>
          <identifier>http://www.scielo.br/pdf/pusp/v27n2/1678-5177-pusp-27-02-00229.pdf</identifier>
          <source>Tateo , L 2016 , ' The psychological imagination ' , U S P Psicologia , vol. 27 , no. 2 , pp. 229-233 . https://doi.org/10.1590/0103-6564D20160008</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns2:isPartOf>urn:ISSN:0103-6564</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/814d1c0e-f16b-4e67-945b-83e9ce8adf30</identifier>
        <datestamp>2018-02-12T09:39:31Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="fra">Représentations sociales et nouvelles technologies</title>
          <creator>Tateo, Luca</creator>
          <publisher>De Boeck</publisher>
          <contributor>Lo Monaco, G.</contributor>
          <contributor>Delouvée , S.</contributor>
          <contributor>Rateau , P.</contributor>
          <date>2016</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/814d1c0e-f16b-4e67-945b-83e9ce8adf30</identifier>
          <identifier>http://www.deboecksuperieur.com/ouvrage/9782807305465-les-representations-sociales</identifier>
          <identifier>urn:ISBN:9782807305465</identifier>
          <source>Tateo , L 2016 , Représentations sociales et nouvelles technologies . i G Lo Monaco , S Delouvée &amp; P Rateau (red) , Les représentations sociales : Théories, méthodes et applications . De Boeck , s. 399-408 .</source>
          <language>fra</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/60ffc7e2-6c2c-45aa-9bdc-68f02796be6e</identifier>
        <datestamp>2018-06-01T09:32:10Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Giambattista Vico and the New Psychological Science</title>
          <contributor>Tateo, Luca</contributor>
          <publisher>Transaction Publishers</publisher>
          <date>2016-11-30</date>
          <type>book</type>
          <identifier>https://vbn.aau.dk/da/publications/60ffc7e2-6c2c-45aa-9bdc-68f02796be6e</identifier>
          <identifier>https://www.routledge.com/Giambattista-Vico-and-the-New-Psychological-Science/Tateo-Valsiner/p/book/9781412864244</identifier>
          <identifier>urn:ISBN:9781412864244</identifier>
          <source>Tateo , L (ed.) 2016 , Giambattista Vico and the New Psychological Science . History and Theory of Psychology , Transaction Publishers .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/21936603-5caa-464c-a794-a0c22180df9a</identifier>
        <datestamp>2018-02-12T09:39:31Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Navigating the unknown river of development</title>
          <creator>Tateo, Luca</creator>
          <creator>Marsico, Giuseppina</creator>
          <publisher>Captus Press</publisher>
          <contributor>Cresswell, James</contributor>
          <contributor>Haye, Andrés</contributor>
          <contributor>Larrain, Antonia</contributor>
          <contributor>Morgan, Mandy</contributor>
          <contributor>Sullivan, Gavin</contributor>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/21936603-5caa-464c-a794-a0c22180df9a</identifier>
          <identifier>http://www.captus.com/information/catalogue/book.asp?Book+Number=1204#TOC</identifier>
          <identifier>urn:ISBN:978-1-55322-328-3</identifier>
          <source>Tateo , L &amp; Marsico , G 2015 , Navigating the unknown river of development . in J Cresswell , A Haye , A Larrain , M Morgan &amp; G Sullivan (eds) , Dialogue and Debate in the Making of Theoretical Psychology . , 3 , Captus Press , pp. 30-39 , 15th Conference of the International Society for Theoretical Psychology , Santiago , Chile , 03/05/2013 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/99030b15-1030-406e-b061-2230be9c95a1</identifier>
        <datestamp>2020-02-14T08:03:30Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Time Breath of Psychological Theories:A Meta-theoretical focus</title>
          <creator>Tateo, Luca</creator>
          <creator>Valsiner, Jaan</creator>
          <description xml:lang="eng">Psychology as a self-aspiring, ambitious, developmental science faces the crucial limit of time—both theoretically and practically. The issue of time in constructing psychology’s theories is a major unresolved metatheoretical task. This raises several questions about generalization of knowledge: which is the time length of breath of psychological theories? Which is the temporal dimension of psychological processes? In this article we discuss the role of different axiomatic assumptions about time in the construction of psychological theories. How could different theories include a concept of time—or fail to do that? How can they generalize with respect to time? The different conceptions of time often remain implicit, while shaping the concepts used in understanding psychological processes. Any preconception about time in human development will foster the generalizability of theory, as well as a different ontological status of its concepts. For instance, the assumption that the human being changes—or remains the same—over the life span, will lead to theory building of different length, or shortness, of breath. We advance a metatheoretical perspective that axiomatically requires the inclusion of time in all research designs. Psychology as science that is time-free is a science of dead, rather than living and moving, human experience.</description>
          <date>2015</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/99030b15-1030-406e-b061-2230be9c95a1</identifier>
          <identifier>https://doi.org/10.1037/gpr0000035</identifier>
          <source>Tateo , L &amp; Valsiner , J 2015 , ' Time Breath of Psychological Theories : A Meta-theoretical focus ' , Review of General Psychology , vol. 19 , no. 3 , pp. 357-364 . https://doi.org/10.1037/gpr0000035</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:1089-2680</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/c578ebcc-9a5a-425f-8aea-0b4d9ae122fa</identifier>
        <datestamp>2018-02-12T09:39:33Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">CriticalEd:A Tool for Assisting with the Creation of Critical Commentaries</title>
          <creator>Kjellberg, Caspar Mølholt</creator>
          <creator>Meredith, David</creator>
          <description xml:lang="eng">The best text method is commonly applied among music scholars engaged in producing critical editions. In this method, a comment list is compiled, consisting of variant readings and editorial emendations. This list is maintained by inserting the comments into a document as the changes are made. Since the comments are not input sequentially, with regard to position, but in arbitrary order, this list must be sorted by copy/pasting the rows into place—an error-prone and time-consuming process. Scholars who produce critical editions typically use off-the-shelf music notation software such as Sibelius or Finale. It was hypothesized that it would be possible to develop a Sibelius plug-in, written in Manuscript 6, that would improve the critical editing work flow, but it was found that the capabilities of this scripting language were insufficient. Instead, a 3-part system was designed and built, consisting of a Sibelius plug-in, a cross-platform application, called CriticalEd, and a REST-based solution, which handles data storage/retrieval. A prototype has been tested at the Danish Centre for Music Publication, and the results suggest that the system could greatly improve the efficiency of the critical editing work flow.</description>
          <publisher>The International Computer Music Association</publisher>
          <contributor>Georgaki, Anastasia</contributor>
          <contributor>Kouroupetroglou, Georgios</contributor>
          <date>2014</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/c578ebcc-9a5a-425f-8aea-0b4d9ae122fa</identifier>
          <identifier>https://vbn.aau.dk/ws/files/208683453/CriticalEd.pdf</identifier>
          <identifier>http://www.icmc14-smc14.net/</identifier>
          <identifier>http://www.titanmusic.com/papers/public/CriticalEd.pdf</identifier>
          <identifier>http://speech.di.uoa.gr/ICMC-SMC-2014/images/VOL_1/0643.pdf</identifier>
          <identifier>http://speech.di.uoa.gr/ICMC-SMC-2014/index.php</identifier>
          <identifier>urn:ISBN:978-0-9845274-3-4</identifier>
          <source>Kjellberg , C M &amp; Meredith , D 2014 , CriticalEd : A Tool for Assisting with the Creation of Critical Commentaries . in A Georgaki &amp; G Kouroupetroglou (eds) , Music Technology Meets Philosophy: From digital echos to virtual ethos : Proceedings of the ICMC | SMC |2014 40th International Computer Music Conference joint with the 11th Sound and Music Computing conference . The International Computer Music Association , pp. 643-647 , ICMC-SMC Conference 2014 , Athens , Greece , 14/09/2014 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/9377a128-b104-4ff7-bc7a-ef58dedc30af</identifier>
        <datestamp>2019-11-05T21:34:06Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">A new method for vertical parallelisation of TAN learning based on balanced incomplete block designs</title>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Jensen, Frank</creator>
          <creator>Salmerón, Antonio</creator>
          <creator>Karlsen, Martin</creator>
          <creator>Langseth, Helge</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <publisher>Springer Publishing Company</publisher>
          <date>2014</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/9377a128-b104-4ff7-bc7a-ef58dedc30af</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-11433-0_20</identifier>
          <identifier>urn:ISBN:978-3-319-11432-3</identifier>
          <source>Madsen , A L , Jensen , F , Salmerón , A , Karlsen , M , Langseth , H &amp; Nielsen , T D 2014 , A new method for vertical parallelisation of TAN learning based on balanced incomplete block designs . in Proceedings of the 7th European Workshop on Probabilistic Graphical Models . vol. 8754 , Springer Publishing Company , Lecture Notes in Computer Science , pp. 302-317 , The 7th European Workshop on Probabilistic Graphical Models , Utrecht , Netherlands , 17/09/2014 . https://doi.org/10.1007/978-3-319-11433-0_20</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/80178f1d-2afc-4e31-848c-642f4e632ccb</identifier>
        <datestamp>2020-02-20T13:39:53Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">A Tractable Model of the LTE Access Reservation Procedure for Machine-Type Communications</title>
          <creator>Nielsen, Jimmy Jessen</creator>
          <creator>Min Kim, Dong</creator>
          <creator>Madueño, Germán Corrales</creator>
          <creator>Kiilerich Pratas, Nuno</creator>
          <creator>Popovski, Petar</creator>
          <description xml:lang="eng">A canonical scenario in Machine-Type Communications (MTC) is the one featuring a large number of devices, each of them with sporadic traffic. Hence, the number of served devices in a single LTE cell is not determined by the available aggregate rate, but rather by the limitations of the LTE access reservation protocol. Specifically, the limited number of contention preambles and the limited amount of uplink grants per random access response are crucial to consider when dimensioning LTE networks for MTC. We propose a low-complexity model that encompasses these two limitations and allows us to evaluate the outage probability at click-speed. The model is based chiefly on closed-form expressions, except for the part with the feedback impact of retransmissions, which is determined by solving a fixed point equation. Our model overcomes the incompleteness of the existing models that are focusing solely on the preamble collisions. A comparison with the simulated LTE access reservation procedure that follows the 3GPP specifications, confirms that our model provides an accurate estimation of the system outage event and the number of supported MTC devices.</description>
          <publisher>IEEE Press</publisher>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/80178f1d-2afc-4e31-848c-642f4e632ccb</identifier>
          <identifier>https://doi.org/10.1109/GLOCOM.2014.7417529</identifier>
          <identifier>https://vbn.aau.dk/ws/files/218923195/Articlev2.02_bib.pdf</identifier>
          <identifier>http://arxiv.org/abs/1505.01713</identifier>
          <identifier>http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7417529</identifier>
          <identifier>urn:ISBN:978-1-4799-5952-5</identifier>
          <source>Nielsen , J J , Min Kim , D , Madueño , G C , Kiilerich Pratas , N &amp; Popovski , P 2015 , A Tractable Model of the LTE Access Reservation Procedure for Machine-Type Communications . in 2015 IEEE Global Communications Conference (GLOBECOM) . IEEE Press , Globecom. I E E E Conference and Exhibition , pp. 1-6 , IEEE GLOBECOM 2015 , San Diego, CA , United States , 06/12/2015 . https://doi.org/10.1109/GLOCOM.2014.7417529</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7 STREP</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/0189d381-a3c0-4b16-8e5a-67d244f9a224</identifier>
        <datestamp>2020-01-01T06:28:56Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Continuity and discontinuity of the educational context:Early Leavers’ in-Between Life Stories</title>
          <creator>Tateo, Luca</creator>
          <publisher>Springer</publisher>
          <contributor>Marsico, Giuseppina</contributor>
          <contributor>Dazzani, Virginia</contributor>
          <contributor>Ristum, Marilena</contributor>
          <contributor>de Souza Bastos, Ana Cecilia</contributor>
          <date>2015</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/0189d381-a3c0-4b16-8e5a-67d244f9a224</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-18765-5_3</identifier>
          <identifier>urn:ISBN:978-3-319-18764-8</identifier>
          <source>Tateo , L 2015 , Continuity and discontinuity of the educational context : Early Leavers’ in-Between Life Stories . in G Marsico , V Dazzani , M Ristum &amp; A C de Souza Bastos (eds) , Educational Contexts and Borders through a Cultural Lens : Looking Inside, Viewing Outside . Springer , Cultural Psychology of Education , pp. 29-54 . https://doi.org/10.1007/978-3-319-18765-5_3</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/e01ab25f-2c14-48b0-a439-ca676bfe20f7</identifier>
        <datestamp>2019-11-02T03:21:10Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Fear</title>
          <creator>Tateo, Luca</creator>
          <publisher>Palgrave Macmillan</publisher>
          <contributor>Glaveanu, Vlad Petre</contributor>
          <contributor>Tanggaard Pedersen, Lene</contributor>
          <contributor>Wegener, Charlotte</contributor>
          <date>2016-01</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/e01ab25f-2c14-48b0-a439-ca676bfe20f7</identifier>
          <identifier>https://doi.org/10.1057/9781137511805_6</identifier>
          <identifier>urn:ISBN:978-1-349-70246-6</identifier>
          <source>Tateo , L 2016 , Fear . in V P Glaveanu , L Tanggaard Pedersen &amp; C Wegener (eds) , Creativity: A new vocabulary . 1 edn , Palgrave Macmillan , Palgrave Studies in Creativity and Culture , pp. 43-51 . https://doi.org/10.1057/9781137511805_6</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/da332684-7bdc-4d75-bbec-eee09eb1b1e3</identifier>
        <datestamp>2020-01-01T06:32:11Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Mathematics and Computation in Music:5th International Conference, MCM 2015 London, UK, June 22–25, 2015 Proceedings</title>
          <contributor>Collins, Tom</contributor>
          <contributor>Meredith, David</contributor>
          <contributor>Volk, Anja</contributor>
          <subject>music theory</subject>
          <subject>music analysis</subject>
          <subject>mathematical music theory</subject>
          <subject>mathematics</subject>
          <subject>computer science</subject>
          <subject>computational musicology</subject>
          <subject>music information retrieval</subject>
          <description xml:lang="eng">The 5th Biennial International Conference for Mathematics and Computation in Music (MCM 2015) took place June 22–25, 2015, at Queen Mary University of London, UK, co-hosted by the School of Electronic Engineering and Computer Science (Centre for Digital Music) and the School of Mathematical Sciences. As the flagship conference of the Society for Mathematics and Computation in Music (SMCM), MCM 2015 provided a dedicated platform for the communication and exchange of ideas among researchers in mathematics, informatics, music theory, composition, musicology, and related disciplines. It brought together researchers from around the world who combine mathematics or computation with music theory, music analysis, composition, and performance.&lt;br/&gt;This year’s program – full details at http://mcm2015.qmul.ac.uk – featured a number of distinguished keynote speakers, including Andrée Ehresmann (who spoke on contemporary mathematical approaches to creative systems), Emilia Gómez (who spoke on music technologies in classical orchestral music concerts), Gareth Loy (who spoke on steps toward a theory of musical interest), and Ge Wang (who spoke on the art of designing computer music), and a film (From Circles to Hyperspheres, Part III) by Gilles Baroin and Hugues Seress.&lt;br/&gt;The program also emphasized performances of real music related to the theoretical discussions. A noontime concert, Blood and Tango, presented a new adaptation of Gareth Loy’s Blood from a Stone, composed in 1992 for Max Matthew’s electronic violin and performed at MCM 2015 by Laurel Pardue, followed by Susanne Beer and Ian Pressland’s divergent interpretations of Piazzolla’s Le Grand Tango for cello and piano, each accompanied by Elaine Chew. An evening concert, Geometries and Ges- tures (Gege), featured Tom Johnson’s Rational Melodies performed on flute by Carlos Vaquero, and musical illustrations of chord geometries in Italian popular music per- formed by Moreno Andreatta (SMCM Vice President), and of hypergestures in free jazz improvisations by Guerino Mazzola (SMCM President).&lt;br/&gt;The chapters in this book correspond to the papers and posters presented at the conference following a careful double-blind peer-review process. We received 64 submissions from 108 authors across 19 different countries. Each submission was assigned at least three reviewers for double-blind review. A paper was accepted only if a majority of its reviewers recommended it for acceptance. The format of each accepted paper (long or short paper) was also decided on the basis of the recommendations of the majority of the paper’s reviewers. Submissions were accepted in two categories: long papers (with a limit of 12 pages) for oral presentation at the conference and short papers (with a limit of six pages) for poster presentation at the conference. A total of 24 long papers and 14 short papers were accepted following review.</description>
          <publisher>Springer</publisher>
          <date>2015</date>
          <type>book</type>
          <identifier>https://vbn.aau.dk/da/publications/da332684-7bdc-4d75-bbec-eee09eb1b1e3</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-20603-5</identifier>
          <identifier>http://www.springer.com/en/book/9783319206028</identifier>
          <identifier>http://www.amazon.co.uk/Mathematics-Computation-Music-International-Proceedings/dp/3319206028</identifier>
          <identifier>urn:ISBN:978-3-319-20602-8</identifier>
          <source>Collins , T , Meredith , D &amp; Volk , A (eds) 2015 , Mathematics and Computation in Music : 5th International Conference, MCM 2015 London, UK, June 22–25, 2015 Proceedings . Lecture Notes in Computer Science , vol. 9110 , Springer . https://doi.org/10.1007/978-3-319-20603-5</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/51d0d08d-e84a-4e54-af27-ebabe3fefb3b</identifier>
        <datestamp>2020-01-01T06:32:14Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Exact Cover Problem in Milton Babbitt's All-partition Array</title>
          <creator>Bemman, Brian</creator>
          <creator>Meredith, David</creator>
          <subject>Exact cover</subject>
          <subject>Milton Babbitt</subject>
          <subject>music theory</subject>
          <subject>music analysis</subject>
          <subject>serial music</subject>
          <subject>12-tone music</subject>
          <subject>all-partition array</subject>
          <description xml:lang="eng">One aspect of analyzing Milton Babbitt’s (1916–2011) all- partition arrays requires finding a sequence of distinct, non-overlapping aggregate regions that completely and exactly covers an irregular matrix of pitch class integers. This is an example of the so-called exact cover problem. Given a set, A, and a collection of distinct subsets of this set, S, then a subset of S is an exact cover of A if it exhaustively and exclu- sively partitions A. We provide a backtracking algorithm for solving this problem in an all-partition array and compare the output of this algorithm with an analysis produced manually.</description>
          <publisher>Springer</publisher>
          <contributor>Collins, Tom</contributor>
          <contributor>Meredith, David</contributor>
          <contributor>Volk, Anja</contributor>
          <date>2015</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/51d0d08d-e84a-4e54-af27-ebabe3fefb3b</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-20603-5_25</identifier>
          <identifier>urn:ISBN: 978-3-319-20602-8</identifier>
          <source>Bemman , B &amp; Meredith , D 2015 , Exact Cover Problem in Milton Babbitt's All-partition Array . in T Collins , D Meredith &amp; A Volk (eds) , Mathematics and Computation in Music : 5th International Conference, MCM 2015, London, UK, June 22-25, 2015, Proceedings . Springer , Cham, Switzerland , Lecture Notes in Computer Science , vol. 9110 , pp. 237-242 , Fifth Biennial International Conference on Mathematics and Computation in Music , London , United Kingdom , 22/06/2015 . https://doi.org/10.1007/978-3-319-20603-5_25</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/7f46f850-4ea2-4a83-86c4-717885b6d213</identifier>
        <datestamp>2018-02-12T09:41:57Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Comparison of Heuristics for Generating All-partition Arrays in the Style of Milton Babbitt</title>
          <creator>Bemman, Brian</creator>
          <creator>Meredith, David</creator>
          <subject>Milton Babbitt</subject>
          <subject>all-partition array</subject>
          <subject>serial music</subject>
          <subject>12-tone music</subject>
          <subject>music theory</subject>
          <subject>music analysis</subject>
          <description xml:lang="eng">An all-partition array is a mathematical structure developed by Milton Babbitt (1916–2011) for organizing the pitch classes in many of his twelve-tone works. Constructing an all-partition array requires finding a sequence of l aggregate-forming subsets of a matrix of pitch classes called a PCMatrix. Each of these l subsets corresponds to a distinct in- teger partition and l is the total number of distinct integer partitions possible, given the number of rows in the PCMatrix. Collectively, the l subsets (or integer partitions) form a partition of the PCMatrix. In some types of all-partition arrays, where l = 58, the PCMatrix does not contain all 12l pitch classes. In these types, Babbitt developed a method for adding to the PCMatrix what we call outer-aggregate repeated pcs (OARPs). A self-contained sequence of integer partitions is one in which each integer partition either contains a complete aggregate or an incomplete one that can be made complete by adding OARPs. It is noteworthy that, when constructing an all-partition array, Babbitt started out with a non-self-contained sequence of partitions. In this paper, we use a known self-contained sequence as a basis for forming two heuristics that select integer partitions likely to have been chosen by Babbitt. We suggest these heuristics will select integer partitions more likely to produce a self-contained sequence and we present it as a means for efficiently searching the space of possible sequences. We apply our heuristics to both types of sequences and conclude with a simple method for evaluating the results.</description>
          <publisher>The Laboratory of Mechanics and Acoustics</publisher>
          <contributor>Aramaki, M.</contributor>
          <contributor>Kronland-Martinet, R.</contributor>
          <contributor>Ystad, S.</contributor>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/7f46f850-4ea2-4a83-86c4-717885b6d213</identifier>
          <identifier>https://vbn.aau.dk/ws/files/221241879/Bemman_Meredith_Babbitt_CMMR_2015.pdf</identifier>
          <identifier>http://cmr.soc.plymouth.ac.uk/cmmr2015/proceedings.pdf</identifier>
          <identifier>urn:ISBN:978-2-909669-24-3</identifier>
          <source>Bemman , B &amp; Meredith , D 2015 , Comparison of Heuristics for Generating All-partition Arrays in the Style of Milton Babbitt . in M Aramaki , R Kronland-Martinet &amp; S Ystad (eds) , Proceedings of the 11th International Symposium on Computer Music Multidisciplinary Research . The Laboratory of Mechanics and Acoustics , Plymouth, UK , L M A. Publications , pp. 770-777 , 11th International Symposium on Computer Music Multidisciplinary Research , Plymouth , United Kingdom , 16/06/2015 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/64f4fd46-8a4b-4ebe-8048-e0633451fe45</identifier>
        <datestamp>2020-03-19T03:26:26Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">What Can Wireless Cellular Technologies Do about the Upcoming Smart Metering Traffic?</title>
          <creator>Nielsen, Jimmy Jessen</creator>
          <creator>Madueño, Germán Corrales</creator>
          <creator>Pratas, Nuno</creator>
          <creator>Sørensen, René Brandborg</creator>
          <creator>Stefanovic, Cedomir</creator>
          <creator>Popovski, Petar</creator>
          <description xml:lang="eng">The introduction of smart electricity meters with cellular radio interface puts an additional load on the wireless cellular networks. Currently, these meters are designed for low duty cycle billing and occasional system check, which generates a low-rate sporadic traffic. &lt;br/&gt;As the number of distributed energy resources increases, the household power will become more variable and thus unpredictable from the viewpoint of the Distribution System Operator (DSO). It is therefore expected, in the near future, to have an increased number of Wide Area Measurement System (WAMS) devices with Phasor Measurement Unit (PMU)-like capabilities in the distribution grid, thus allowing the utilities to monitor the low voltage grid quality while providing information required for tighter grid control.&lt;br/&gt;From a communication standpoint, the traffic profile will change drastically towards higher data volumes and higher rates per device. In this paper, we characterize the current traffic generated by smart electricity meters and supplement it with the potential traffic requirements brought by introducing enhanced Smart Meters, i.e., meters with PMU-like capabilities. Our study shows how GSM/GPRS and LTE cellular system performance behaves with the current and next generation smart meters traffic, where it is clearly seen that the PMU data will seriously challenge these wireless systems. We conclude by highlighting the possible solutions for upgrading the cellular standards, in order to cope with the upcoming smart metering traffic.&lt;br/&gt;</description>
          <date>2015-09-16</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/64f4fd46-8a4b-4ebe-8048-e0633451fe45</identifier>
          <identifier>https://doi.org/10.1109/MCOM.2015.7263371</identifier>
          <source>Nielsen , J J , Madueño , G C , Pratas , N , Sørensen , R B , Stefanovic , C &amp; Popovski , P 2015 , ' What Can Wireless Cellular Technologies Do about the Upcoming Smart Metering Traffic? ' , I E E E Communications Magazine , vol. 53 , no. 9 , pp. 41 - 47 . https://doi.org/10.1109/MCOM.2015.7263371</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7 STREP</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:0163-6804</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/d12af0ea-3bfe-489d-9aa7-b6084da2e429</identifier>
        <datestamp>2020-02-05T23:27:35Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Early Recognition of Maneuvers in Highway Traffic</title>
          <creator>Weidl, Galia</creator>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Tereshchenko, Viacheslav</creator>
          <creator>Dietmar, Kasper</creator>
          <creator>Breuel, Gabi</creator>
          <publisher>Springer</publisher>
          <contributor>Destercke, Sébastien</contributor>
          <contributor>Denoeux, Thierry</contributor>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/d12af0ea-3bfe-489d-9aa7-b6084da2e429</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-20807-7_48</identifier>
          <identifier>urn:ISBN:978-3-319-20806-0</identifier>
          <source>Weidl , G , Madsen , A L , Tereshchenko , V , Dietmar , K &amp; Breuel , G 2015 , Early Recognition of Maneuvers in Highway Traffic . in S Destercke &amp; T Denoeux (eds) , Symbolic and Quantitative Approaches to Reasoning with Uncertainty : 13th European Conference, ECSQARU 2015, Compiègne, France, July 15-17, 2015. Proceedings . Springer , Lecture Notes in Computer Science , no. 9161 , pp. 529-540 , The 13th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty , Compiegne , France , 15/07/2015 . https://doi.org/10.1007/978-3-319-20807-7_48</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/e79a299c-4f5a-4df9-8b24-6a035472af30</identifier>
        <datestamp>2020-01-31T14:26:15Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Modeling concept drift:A probabilistic graphical model based approach</title>
          <creator>Borchani, Hanen</creator>
          <creator>Martinez, Ana Maria</creator>
          <creator>Masegosa, Andrés R.</creator>
          <creator>Langseth, Helge</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <creator>Salmerón, Antonio</creator>
          <creator>Fernández, Antonio</creator>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Sáez, Ramón</creator>
          <description xml:lang="eng">An often used approach for detecting and adapting to concept drift when doing classification is to treat the data as i.i.d. and use changes in classification accuracy as an indication of concept drift. In this paper, we take a different perspective and propose a framework, based on probabilistic graphical models, that explicitly represents concept drift using latent variables. To ensure efficient inference and learning, we re- sort to a variational Bayes inference scheme. As a proof of concept, we demonstrate and analyze the proposed framework using synthetic data sets as well as a real financial data set from a Spanish bank.</description>
          <publisher>Springer</publisher>
          <contributor>Fromont, Elisa</contributor>
          <contributor>De Bie, Tijl</contributor>
          <contributor>van Leeuwen, Matthijs</contributor>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/e79a299c-4f5a-4df9-8b24-6a035472af30</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-24465-5_7</identifier>
          <identifier>https://vbn.aau.dk/ws/files/217708739/ida_2015.pdf</identifier>
          <identifier>urn:ISBN:978-3-319-24464-8</identifier>
          <source>Borchani , H , Martinez , A M , Masegosa , A R , Langseth , H , Nielsen , T D , Salmerón , A , Fernández , A , Madsen , A L &amp; Sáez , R 2015 , Modeling concept drift : A probabilistic graphical model based approach . in E Fromont , T De Bie &amp; M van Leeuwen (eds) , Advances in Intelligent Data Analysis XIV : 14th International Symposium, IDA 2015, Saint Etienne. France, October 22 -24, 2015. Proceedings . Springer , Lecture Notes in Computer Science , no. 9385 , pp. 72-83 , International Symposium, IDA 2015 , Saint Etienne , France , 22/10/2015 . https://doi.org/10.1007/978-3-319-24465-5_7</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/05cf6c00-d86d-4122-bcb2-16eec6f22e59</identifier>
        <datestamp>2020-02-08T02:26:51Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Parallelisation of the PC Algorithm</title>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Jensen, Frank</creator>
          <creator>Salmerón, Antonio</creator>
          <creator>Langseth, Helge</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <publisher>Springer</publisher>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/05cf6c00-d86d-4122-bcb2-16eec6f22e59</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-24598-0_2</identifier>
          <identifier>https://vbn.aau.dk/ws/files/217708987/madsen_amidst_caepia.pdf</identifier>
          <identifier>http://www.idi.ntnu.no/~helgel/papers/MadsenJensenSalmeronLangsethNielsenCAEPIA15.pdf</identifier>
          <identifier>urn:ISBN:978-3-319-24597-3</identifier>
          <source>Madsen , A L , Jensen , F , Salmerón , A , Langseth , H &amp; Nielsen , T D 2015 , Parallelisation of the PC Algorithm . in Advances in Artificial Intelligence : 16th Conference of the Spanish Association for Artiﬁcial Intelligence, CAEPIA 2015 Albacete, Spain, November 9–12, 2015 Proceedings . Springer , Lecture Notes in Computer Science , vol. 9422 , pp. 14-24 , 16th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2015 , Albacete , Spain , 09/11/2015 . https://doi.org/10.1007/978-3-319-24598-0_2</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/8438e147-0d26-4015-90b1-73dd32942fb4</identifier>
        <datestamp>2020-02-05T02:28:25Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Parallel importance sampling in conditional linear Gaussian networks</title>
          <creator>Salmerón, Antonio</creator>
          <creator>Ramos-López, Darío</creator>
          <creator>Borchani, Hanen</creator>
          <creator>Martinez, Ana Maria</creator>
          <creator>Masegosa, Andres R.</creator>
          <creator>Fernández, Antonio</creator>
          <creator>Langseth, Helge</creator>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <description xml:lang="eng">In this paper we analyse the problem of probabilistic inference in CLG networks when evidence comes in streams. In such situations, fast and scalable algorithms, able to provide accurate responses in a short time are required. We consider the instantiation of variational inference and importance sampling, two well known tools for probabilistic inference, to the CLG case. The experimental results over synthetic networks show how a parallel version importance sampling, and more precisely evidence weighting, is a promising scheme, as it is accurate and scales up with respect to available computing resources.&lt;br/&gt;</description>
          <publisher>Springer</publisher>
          <contributor>Puerta, José M.</contributor>
          <contributor>Gámez, José A.</contributor>
          <contributor>Dorronsoro, Bernabe</contributor>
          <contributor>Barrenechea, Edurne</contributor>
          <contributor>Troncoso, Alicia</contributor>
          <contributor>Baruque, Bruno</contributor>
          <contributor>Galar, Mikel</contributor>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/8438e147-0d26-4015-90b1-73dd32942fb4</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-24598-0_4</identifier>
          <identifier>https://vbn.aau.dk/ws/files/217709184/salmeron_amidst_caepia.pdf</identifier>
          <identifier>urn:ISBN:978-3-319-24597-3</identifier>
          <source>Salmerón , A , Ramos-López , D , Borchani , H , Martinez , A M , Masegosa , A R , Fernández , A , Langseth , H , Madsen , A L &amp; Nielsen , T D 2015 , Parallel importance sampling in conditional linear Gaussian networks . in J M Puerta , J A Gámez , B Dorronsoro , E Barrenechea , A Troncoso , B Baruque &amp; M Galar (eds) , Advances in Artificial Intelligence : 16th Conference of the Spanish Association for Artiﬁcial Intelligence, CAEPIA 2015 Albacete, Spain, November 9–12, 2015 Proceedings . Springer , Lecture Notes in Computer Science , no. 9422 , pp. 36-46 , Conference of the Spanish Association for Artiﬁcial Intelligence, CAEPIA 2015 , Albacete , Spain , 09/11/2015 . https://doi.org/10.1007/978-3-319-24598-0_4</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/8c0fa017-d610-4ea3-8826-bfc29f3f94d4</identifier>
        <datestamp>2020-02-10T02:41:11Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">MPE inference in conditional linear gaussian networks</title>
          <creator>Salmerón, Antonio</creator>
          <creator>Rumí, Rafael</creator>
          <creator>Langseth, Helge</creator>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <description xml:lang="eng">Given evidence on a set of variables in a Bayesian network, the most probable explanation (MPE) is the problem of finding a configuration of the remaining variables with maximum posterior probability. This problem has previously been addressed for discrete Bayesian networks and can be solved using inference methods similar to those used for finding posterior probabilities. However, when dealing with hybrid Bayesian networks, such as conditional linear Gaussian (CLG) networks, the MPE problem has only received little attention. In this paper, we provide insights into the general problem of finding an MPE configuration in a CLG network. For solving this problem, we devise an algorithm based on bucket elimination and with the same computational complexity as that of calculating posterior marginals in a CLG network. We illustrate the workings of the algorithm using a detailed numerical example, and discuss possible extensions of the algorithm for handling the more general problem of finding a maximum a posteriori hypothesis (MAP).</description>
          <publisher>Springer</publisher>
          <contributor>Destercke, Sébastien</contributor>
          <contributor>Denoeux, Thierry</contributor>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/8c0fa017-d610-4ea3-8826-bfc29f3f94d4</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-20807-7_37</identifier>
          <identifier>https://vbn.aau.dk/ws/files/217709346/mpe_ecsqaru.pdf</identifier>
          <identifier>urn:ISBN:978-3-319-20806-0</identifier>
          <source>Salmerón , A , Rumí , R , Langseth , H , Madsen , A L &amp; Nielsen , T D 2015 , MPE inference in conditional linear gaussian networks . in S Destercke &amp; T Denoeux (eds) , Symbolic and Quantitative Approaches to Reasoning with Uncertainty : 13th European Conference, ECSQARU 2015, Compiègne, France, July 15-17, 2015. Proceedings . Springer , Lecture Notes in Computer Science , no. 9161 , pp. 407-416 , The 13th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty , Compiegne , France , 15/07/2015 . https://doi.org/10.1007/978-3-319-20807-7_37</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/daef8953-9922-4a5d-9c6a-b5b06236f441</identifier>
        <datestamp>2020-02-19T05:25:36Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">To Do and Not To Do:Constrained Scenarios for Safe Smart House</title>
          <creator>Le Guilly, Thibaut</creator>
          <creator>Smedegaard, Jacob Haubach</creator>
          <creator>Pedersen, Thomas</creator>
          <creator>Skou, Arne Joachim</creator>
          <subject>Formal methods</subject>
          <subject>Reliability</subject>
          <subject>Smart House</subject>
          <subject>Timed Automata</subject>
          <subject>User Interface</subject>
          <description xml:lang="eng">A smart house is a complex system, and configuring it to act as desired is difficult and error prone. In this paper we extend a previously developed framework based on timed automata for designing safe and reliable home automation scenarios to make it easier to use. To do so we abstract it with an Event-Condition-Action language to create intelligent scenarios, and constraints that prevent scenarios with undesirable behaviors to be applied. This language is itself abstracted by a graphical user interface that enables the creation of scenarios by manipulating graphical blocks representing elements of the language. We have designed and implemented a prototype system to test our approach, and we report on a qualitative user study that was conducted.</description>
          <publisher>IEEE</publisher>
          <date>2015-07</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/daef8953-9922-4a5d-9c6a-b5b06236f441</identifier>
          <identifier>https://doi.org/10.1109/IE.2015.11</identifier>
          <identifier>urn:ISBN:978-1-4673-6654-0</identifier>
          <source>Le Guilly , T , Smedegaard , J H , Pedersen , T &amp; Skou , A J 2015 , To Do and Not To Do : Constrained Scenarios for Safe Smart House . in International Conference on Intelligent Environments (IE), 2015 . IEEE , pp. 17-24 , 2015 International Conference on Intelligent Environments (IE 2015) , Prague , Czech Republic , 15/07/2015 . https://doi.org/10.1109/IE.2015.11</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/Arrowhead</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">FP7 STREP</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">Artemis JU</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">ForskEL</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/915c6d82-a953-4c0c-b368-fc9cea2b0845</identifier>
        <datestamp>2020-04-04T03:50:19Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Assessment of LTE Wireless Access for Monitoring of Energy Distribution in the Smart Grid</title>
          <creator>Madueño, Germán Corrales</creator>
          <creator>Nielsen, Jimmy Jessen</creator>
          <creator>Min Kim, Dong</creator>
          <creator>Pratas, Nuno</creator>
          <creator>Stefanovic, Cedomir</creator>
          <creator>Popovski, Petar</creator>
          <description xml:lang="eng">While LTE is becoming widely rolled out for human-type services, it is also a promising solution for cost-efficient connectivity of the smart grid monitoring equipment. This is a type of machine-to-machine (M2M) traffic that consists mainly of sporadic uplink transmissions. In such a setting, the amount of traffic that can be served in a cell is not constrained by the data capacity, but rather by the signaling constraints in the PRACH, PDCCH, and PUSCH channels. In this paper we explore these limitations using a detailed simulation of the LTE access reservation protocol (ARP). We find that 1) assigning RAOs more frequently sometimes worsens performance; and 2) the additional signaling that follows the ARP has very large impact on the capacity in terms of the number of supported devices; we observed a reduction in the capacity by almost a factor of 3. This suggests that a lightweight access method, with reduced number of signaling messages, needs to be considered in standardization for M2M applications. Additionally we propose a tractable analytical model that accurately evaluates the outage for a given scenario at click-speed. The model accounts for the features of the PRACH, PDCCH, PDSCH, and PUSCH, as well as retransmissions.</description>
          <date>2016-03</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/915c6d82-a953-4c0c-b368-fc9cea2b0845</identifier>
          <identifier>https://doi.org/10.1109/JSAC.2016.2525639</identifier>
          <source>Madueño , G C , Nielsen , J J , Min Kim , D , Pratas , N , Stefanovic , C &amp; Popovski , P 2016 , ' Assessment of LTE Wireless Access for Monitoring of Energy Distribution in the Smart Grid ' , I E E E Journal on Selected Areas in Communications , vol. 34 , no. 3 , pp. 675 - 688 . https://doi.org/10.1109/JSAC.2016.2525639</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7 STREP</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:0733-8716</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/ad895209-92bb-414f-bfb6-8926b27a3547</identifier>
        <datestamp>2020-02-05T17:27:37Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Dynamic Bayesian modeling for risk prediction in credit operations</title>
          <creator>Borchani, Hanen</creator>
          <creator>Martinez, Ana Maria</creator>
          <creator>Masegosa, Andres</creator>
          <creator>Langseth, Helge</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <creator>Salmerón, Antonio</creator>
          <creator>Fernández, Antonio</creator>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Sáez, Ramón</creator>
          <subject>Streaming data</subject>
          <subject>Dynamic Bayesian networks</subject>
          <subject>Variational Bayes</subject>
          <subject>Feature subset selection</subject>
          <subject>Credit operations</subject>
          <description xml:lang="eng">Our goal is to do risk prediction in credit operations, and as data is collected continuously and reported on a monthly basis, this gives rise to a streaming data classification problem. Our analysis reveals some practical problems that have not previously been thoroughly analyzed in the context of streaming data analysis: the class labels are not immediately available and the relevant predictive features and entities under study (in this case the set of customers) may vary over time. In order to address these problems, we propose to use a dynamic classifier with a wrapper feature subset selection to find relevant features at different time steps. The proposed model is a special case of a more general framework that can also accommodate more expressive models containing latent variables as well as more sophisticated feature selection schemes.</description>
          <publisher>IOS Press</publisher>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/ad895209-92bb-414f-bfb6-8926b27a3547</identifier>
          <identifier>https://doi.org/10.3233/978-1-61499-589-0-17</identifier>
          <identifier>https://vbn.aau.dk/ws/files/219045468/Scai2015.pdf</identifier>
          <identifier>urn:ISBN:978-1-61499-588-3</identifier>
          <source>Borchani , H , Martinez , A M , Masegosa , A , Langseth , H , Nielsen , T D , Salmerón , A , Fernández , A , Madsen , A L &amp; Sáez , R 2015 , Dynamic Bayesian modeling for risk prediction in credit operations . in The 13th Scandinavian Conference on Artificial Intelligence (SCAI'2015) . IOS Press , Frontiers in Artificial Intelligence and Applications , vol. 278 , pp. 17-26 , 13th Scandinavian Conference on Artificial Intelligence , Halmstad , Sweden , 04/11/2015 . https://doi.org/10.3233/978-1-61499-589-0-17</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/25b909ae-95a7-4cc4-a0f5-e6dd81feea50</identifier>
        <datestamp>2020-01-12T20:21:44Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Music analysis and point-set compression</title>
          <creator>Meredith, David</creator>
          <subject>music analysis</subject>
          <subject>machine learning</subject>
          <subject>information retrieval</subject>
          <subject>folk-song analysis</subject>
          <subject>compression</subject>
          <subject>pattern discovery</subject>
          <description xml:lang="eng">COSIATEC, SIATECCompress and Forth’s algorithm are point-set compression algorithms developed for discovering repeated patterns in music, such as themes and motives that would be of interest to a music analyst. To investigate their effectiveness and versatility, these algorithms were evaluated on three analytical tasks that depend on the discovery of repeated patterns: classifying folk song melodies into tune families, discovering themes and sections in polyphonic music, and discovering subject and countersubject entries in fugues. Each algorithm computes a compressed encoding of a point-set representation of a musical object in the form of a list of compact patterns, each pattern being given with a set of vectors indicating its occurrences. However, the algorithms adopt different strategies in their attempts to discover encodings that maximize compression.The best-performing algorithm on the folk-song classification task was COSIATEC, with a success rate of84%. On the other tasks, variants of SIATECCompress performed best, scoring 45% precision and 60% recall on the thematic analysis task, and 21% precision and 55% recall on the fugue analysis task.</description>
          <date>2015-09-17</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/25b909ae-95a7-4cc4-a0f5-e6dd81feea50</identifier>
          <identifier>https://doi.org/10.1080/09298215.2015.1045003</identifier>
          <source>Meredith , D 2015 , ' Music analysis and point-set compression ' , Journal of New Music Research , vol. 44 , no. 3 , pp. 245-270 . https://doi.org/10.1080/09298215.2015.1045003</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:0929-8215</ns2:isPartOf>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/8a81093d-5818-46da-8303-4ac8005a7bda</identifier>
        <datestamp>2020-01-01T06:41:27Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">A Wavelet-Based Approach to Pattern Discovery in Melodies</title>
          <creator>Velarde, Gissel</creator>
          <creator>Meredith, David</creator>
          <creator>Weyde, Tillman</creator>
          <subject>pattern discovery</subject>
          <subject>melody</subject>
          <subject>Haar wavelet</subject>
          <subject>paradigmatic analysis</subject>
          <description xml:lang="eng">We present a computational method for pattern discovery based on the application of the wavelet transform to symbolic representations of melodies or monophonic voices. We model the importance of a discovered pattern in terms of the compression ratio that can be achieved by using it to describe that part of the melody covered by its occurrences. The proposed method resembles that of paradigmatic analysis developed by Ruwet (1966) and Nattiez (1975). In our approach, melodies are represented either as ‘raw’ 1-dimensional pitch signals or as these signals filtered with the continuous wavelet transform (CWT) at a single scale using the Haar wavelet. These representations are segmented using various approaches and the segments are then concatenated based on their similarity. The concatenated segments are compared, clustered and ranked. The method was evaluated on two musicological tasks: discovering themes and sections in the JKU Patterns Development Database and determining the parent compositions of excerpts from J. S. Bach’s Two-Part Inventions (BWV 772–786). The results indicate that the new approach performs well at finding noticeable and/or important patterns in melodies and that filtering makes the method robust to melodic variation.</description>
          <publisher>Springer</publisher>
          <contributor>Meredith, David</contributor>
          <date>2016</date>
          <type>bookPart</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/8a81093d-5818-46da-8303-4ac8005a7bda</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-25931-4_12</identifier>
          <identifier>https://vbn.aau.dk/ws/files/221242112/VelardeEtAlCMA2016.pdf</identifier>
          <identifier>http://link.springer.com/chapter/10.1007/978-3-319-25931-4_12</identifier>
          <identifier>urn:ISBN:978-3-319-25929-1</identifier>
          <source>Velarde , G , Meredith , D &amp; Weyde , T 2016 , A Wavelet-Based Approach to Pattern Discovery in Melodies . in D Meredith (ed.) , Computational Music Analysis . Springer , Cham, Switzerland , pp. 303-333 . https://doi.org/10.1007/978-3-319-25931-4_12</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/097fa7fd-785c-42db-9b54-a743408a21b7</identifier>
        <datestamp>2020-02-23T09:26:36Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Computational Music Analysis</title>
          <contributor>Meredith, David</contributor>
          <subject>computational music analysis</subject>
          <subject>music analysis</subject>
          <subject>music information retrieval</subject>
          <subject>mathematical music theory</subject>
          <subject>music theory</subject>
          <description xml:lang="eng">This book provides an in-depth introduction and overview of current research in computational music analysis. Its seventeen chapters, written by leading researchers, collectively represent the diversity as well as the technical and philosophical sophistication of the work being done today in this intensely interdisciplinary field. A broad range of approaches are presented, employing techniques originating in disciplines such as linguistics, information theory, information retrieval, pattern recognition, machine learning, topology, algebra and signal processing. Many of the methods described draw on well-established theories in music theory and analysis, such as Forte's pitch-class set theory, Schenkerian analysis, the methods of semiotic analysis developed by Ruwet and Nattiez, and Lerdahl and Jackendoff's Generative Theory of Tonal Music.&lt;br/&gt;&lt;br/&gt;The book is divided into six parts, covering methodological issues, harmonic and pitch-class set analysis, form and voice-separation, grammars and hierarchical reduction, motivic analysis and pattern discovery and, finally, classification and the discovery of distinctive patterns.&lt;br/&gt;&lt;br/&gt;As a detailed and up-to-date picture of current research in computational music analysis, the book provides an invaluable resource for researchers, teachers and students in music theory and analysis, computer science, music information retrieval and related disciplines. It also provides a state-of-the-art reference for practitioners in the music technology industry.</description>
          <publisher>Springer</publisher>
          <date>2016</date>
          <type>book</type>
          <identifier>https://vbn.aau.dk/da/publications/097fa7fd-785c-42db-9b54-a743408a21b7</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-25931-4</identifier>
          <identifier>http://link.springer.com/book/10.1007/978-3-319-25931-4</identifier>
          <identifier>urn:ISBN:978-3-319-25929-1</identifier>
          <source>Meredith , D (ed.) 2016 , Computational Music Analysis . 1 edn , Springer , Cham, Switzerland . https://doi.org/10.1007/978-3-319-25931-4</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/105bd342-12f5-4eab-b75a-6bb7fa879fdd</identifier>
        <datestamp>2020-01-01T06:41:27Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Analysing Music with Point-Set Compression Algorithms</title>
          <creator>Meredith, David</creator>
          <subject>geometric pattern discovery</subject>
          <subject>music analysis</subject>
          <subject>compression</subject>
          <subject>algorithms</subject>
          <subject>point-set patterns</subject>
          <subject>pattern mining</subject>
          <description xml:lang="eng">Several point-set pattern-discovery and compression algorithms designed for analysing music are reviewed and evaluated. Each algorithm takes as input a point-set representation of a score in which each note is represented as a point in pitch-time space. Each algorithm computes the maximal translatable patterns (MTPs) in this input and the translational equivalence classes (TECs) of these MTPs, where each TEC contains all the occurrences of a given MTP. Each TEC is encoded as a ⟨pattern,vector set⟩ pair, in which the vector set gives all the vectors by which the pattern can be translated in pitch-time space to give other patterns in the input dataset. Encoding TECs in this way leads, in general, to compression, since each occurrence of a pattern within a TEC (apart from one) is encoded by a single vector, that has the same information content as one point. The algorithms reviewed here adopt different strategies aimed at selecting a set of MTP TECs that collectively cover (or almost cover) the input dataset in a way that maximizes compression. The algorithms are evaluated on two musicological tasks: classifying folk song melodies into tune families and discovering repeated themes and sections in pieces of classical music. On the first task, the best-performing algorithms achieved success rates of around 84%. In the second task, the best algorithms achieved mean F1 scores of around 0.49, with scores for individual pieces rising as high as 0.71.</description>
          <publisher>Springer</publisher>
          <contributor>Meredith, David</contributor>
          <date>2016</date>
          <type>bookPart</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/105bd342-12f5-4eab-b75a-6bb7fa879fdd</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-25931-4_13</identifier>
          <identifier>https://vbn.aau.dk/ws/files/221242362/MeredithCMA2016.pdf</identifier>
          <identifier>http://link.springer.com/chapter/10.1007/978-3-319-25931-4_13</identifier>
          <identifier>urn:ISBN:978-3-319-25929-1</identifier>
          <source>Meredith , D 2016 , Analysing Music with Point-Set Compression Algorithms . in D Meredith (ed.) , Computational Music Analysis . 1 edn , vol. Part V , Springer , Cham, Switzerland , pp. 335-366 . https://doi.org/10.1007/978-3-319-25931-4_13</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/2bb17ca4-ba24-4705-9492-6b976f3a7de5</identifier>
        <datestamp>2020-01-01T06:41:26Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Automated Motivic Analysis:An Exhaustive Approach Based on Closed and Cyclic Pattern Mining in Multidimensional Parametric Spaces</title>
          <creator>Lartillot, Olivier</creator>
          <subject>motivic analysis</subject>
          <subject>pattern mining</subject>
          <subject>closed pattern</subject>
          <subject>cyclic pattern</subject>
          <description xml:lang="eng">Motivic analysis provides very detailed understanding of musical composi- tions, but is also particularly difficult to formalize and systematize. A computational automation of the discovery of motivic patterns cannot be reduced to a mere extraction of all possible sequences of descriptions. The systematic approach inexorably leads to a proliferation of redundant structures that needs to be addressed properly. Global filtering techniques cause a drastic elimination of interesting structures that damages the quality of the analysis. On the other hand, a selection of closed patterns allows for lossless compression. The structural complexity resulting from successive repetitions of patterns can be controlled through a simple modelling of cycles. Generally, motivic patterns cannot always be defined solely as sequences of descriptions in a fixed set of dimensions: throughout the descriptions of the successive notes and intervals, various sets of musical parameters may be invoked. In this chapter, a method is presented that allows for these heterogeneous patterns to be discovered. Motivic repetition with local ornamentation is detected by reconstructing, on top of “surface-level” monodic voices, longer-term relations between non-adjacent notes related to deeper structures, and by tracking motives on the resulting syntagmatic network. These principles are integrated into a computational framework, the MiningSuite, developed in Matlab.</description>
          <publisher>Springer</publisher>
          <contributor>Meredith, David</contributor>
          <date>2016</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/2bb17ca4-ba24-4705-9492-6b976f3a7de5</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-25931-4_11</identifier>
          <identifier>http://link.springer.com/book/10.1007/978-3-319-25931-4</identifier>
          <identifier>urn:ISBN:978-3-319-25929-1</identifier>
          <source>Lartillot , O 2016 , Automated Motivic Analysis : An Exhaustive Approach Based on Closed and Cyclic Pattern Mining in Multidimensional Parametric Spaces . in D Meredith (ed.) , Computational Music Analysis . 1 edn , vol. Part V , Springer , Cham, Switzerland , pp. 273-302 . https://doi.org/10.1007/978-3-319-25931-4_11</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/e87f31bc-75da-435b-b24a-c8bfb134d885</identifier>
        <datestamp>2018-02-12T09:44:33Z</datestamp>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Analysis of massive data streams using R and AMIDST</title>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Salmerón, Antonio</creator>
          <description xml:lang="dan">Today, omnipresent sensors are continuously providing streaming&lt;br/&gt;data on the environments in which they operate. Sources of streaming data&lt;br/&gt;with even a modest updating frequency can produce extremely large volumes of&lt;br/&gt;data, thereby making efficient and accurate data analysis and prediction difficult.&lt;br/&gt;Probabilistic graphical models (PGMs) provide a well-founded and principled approach for performing inference and belief updating in complex domains endowed with uncertainty. The on-going EU-FP7 research project AMIDST (Analysis of MassIve Data STreams, http://www.amidst.eu) is aimed at producing scalable methods able to handle massive data streams based on Bayesian networks technology. All of the developed methods are available through the AMIDST toolbox, implemented in Java 8. We show how the functionality of the AMIDST toolbox can be accessed from R. Available AMIDST objects include variables, distributions and Bayesian networks, as well as those devoted to inference and learning. The interaction between both platforms relies on the rJava package.</description>
          <description xml:lang="eng">Today, omnipresent sensors are continuously providing streaming data on the environments in which they operate. Sources of streaming data with even a modest updating frequency can produce extremely large volumes of data, thereby making efficient and accurate data analysis and prediction difficult.&lt;br/&gt;Probabilistic graphical models (PGMs) provide a well-founded and principled approach for performing inference and belief updating in complex domains endowed with uncertainty. The on-going EU-FP7 research project AMIDST (Analysis of MassIve Data STreams, http://www.amidst.eu) is aimed at producing scalable methods able to handle massive data streams based on Bayesian networks technology. All of the developed methods are available through the AMIDST toolbox, implemented in Java 8. We show how the functionality of the AMIDST toolbox can be accessed from R. Available AMIDST objects include variables, distributions and Bayesian networks, as well as those devoted to inference and learning. The interaction between both platforms relies on the rJava package.</description>
          <date>2015</date>
          <type>conferenceObject</type>
          <identifier>https://vbn.aau.dk/da/publications/e87f31bc-75da-435b-b24a-c8bfb134d885</identifier>
          <identifier>http://user2015.math.aau.dk/docs/useR2015-BookOfAbstracts.pdf</identifier>
          <source>Madsen , A L &amp; Salmerón , A 2015 , ' Analysis of massive data streams using R and AMIDST ' , useR! 2015 , Aalborg , Denmark , 27/06/2015 - 30/06/2015 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/527553e8-b3ed-4d81-a86a-2645ff88e547</identifier>
        <datestamp>2018-02-12T09:44:34Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">AMIDST: Analysis of MassIve Data STreams</title>
          <creator>Masegosa, Andres</creator>
          <creator>Martinez, Ana Maria</creator>
          <creator>Borchani, Hanen</creator>
          <creator>Ramos-López, Darío</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <creator>Langseth, Helge</creator>
          <creator>Salmerón, Antonio</creator>
          <creator>Madsen, Anders Læsø</creator>
          <subject>Bayesian networks</subject>
          <subject>data streams</subject>
          <subject>machine learning</subject>
          <subject>open source</subject>
          <description xml:lang="eng">The Analysis of MassIve Data STreams (AMIDST) Java toolbox provides a collection of scalable and parallel algorithms for inference and learning of hybrid Bayesian networks from data streams. The toolbox, available at http://amidst.github.io/toolbox/ under the Apache Software License version 2.0, also efficiently leverages existing functionalities and algorithms by interfacing to software tools such as HUGIN and MOA.</description>
          <date>2015-10</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/527553e8-b3ed-4d81-a86a-2645ff88e547</identifier>
          <identifier>https://vbn.aau.dk/ws/files/221389883/BNAIC2015.pdf</identifier>
          <source>Masegosa , A , Martinez , A M , Borchani , H , Ramos-López , D , Nielsen , T D , Langseth , H , Salmerón , A &amp; Madsen , A L 2015 , AMIDST: Analysis of MassIve Data STreams . in The 27th Benelux Conference on Artificial Intelligence (BNAIC 2015) . Benelux Conference on Artificial Intelligence , Hasselt , Belgium , 05/11/2015 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/c8f74dbc-0632-477e-92ae-311382292638</identifier>
        <datestamp>2020-01-02T14:22:52Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Attack Tree Generation by Policy Invalidation</title>
          <creator>Ivanova, Marieta Georgieva</creator>
          <creator>Probst, Christian</creator>
          <creator>Hansen, Rene Rydhof</creator>
          <creator>Kammüller, Florian</creator>
          <publisher>Springer</publisher>
          <contributor>Akram, Raja Naeem</contributor>
          <contributor>Jajodia , Sushil</contributor>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/c8f74dbc-0632-477e-92ae-311382292638</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-24018-3_16</identifier>
          <identifier>urn:ISBN: 978-3-319-24017-6</identifier>
          <source>Ivanova , M G , Probst , C , Hansen , R R &amp; Kammüller , F 2015 , Attack Tree Generation by Policy Invalidation . in R N Akram &amp; S Jajodia (eds) , Information Security Theory and Practice : 9th IFIP WG 11.2 International Conference, WISTP 2015, Heraklion, Crete, Greece, August 24-25, 2015. Proceedings . Springer , Lecture Notes in Computer Science , no. 9311 , pp. 249-259 , WISTP 2015 , Heraklion, Crete , Greece , 24/08/2015 . https://doi.org/10.1007/978-3-319-24018-3_16</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/318003</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/cd98e377-4dbd-4974-94aa-36e3db34001e</identifier>
        <datestamp>2020-01-01T06:43:23Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">The Timed Decentralised Label Model</title>
          <creator>Pedersen, Martin Leth</creator>
          <creator>Sørensen, Michael Hedegaard</creator>
          <creator>Lux, Daniel</creator>
          <creator>Nyman, Ulrik Mathias</creator>
          <creator>Hansen, Rene Rydhof</creator>
          <publisher>Springer</publisher>
          <contributor>Buchegger, Sonja</contributor>
          <contributor>Dam, Mads</contributor>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/cd98e377-4dbd-4974-94aa-36e3db34001e</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-26502-5_3</identifier>
          <identifier>https://vbn.aau.dk/ws/files/226255058/tdlm.pdf</identifier>
          <identifier>urn:ISBN:978-3-319-26501-8</identifier>
          <source>Pedersen , M L , Sørensen , M H , Lux , D , Nyman , U M &amp; Hansen , R R 2015 , The Timed Decentralised Label Model . in S Buchegger &amp; M Dam (eds) , Secure IT Systems : 20th Nordic Conference on Secure IT-Systems (NordSec 2015) . Springer , Lecture Notes in Computer Science , no. 9417 , pp. 27-43 , 20th Nordic Conference on Secure IT-Systems (NordSec 2015) , Stockholm , Sweden , 19/10/2015 . https://doi.org/10.1007/978-3-319-26502-5_3</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/318003</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/056c1bc0-f89a-434b-85b0-4783516633e9</identifier>
        <datestamp>2020-03-05T03:26:10Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Modelling Socio-Technical Attacks with Timed Automata</title>
          <creator>David, Nicolas</creator>
          <creator>David, Alexandre</creator>
          <creator>Hansen, Rene Rydhof</creator>
          <creator>Larsen, Kim Guldstrand</creator>
          <creator>Legay, Axel</creator>
          <creator>Olesen, Mads Chr.</creator>
          <creator>Probst, Christian</creator>
          <publisher>Association for Computing Machinery</publisher>
          <date>2015</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/056c1bc0-f89a-434b-85b0-4783516633e9</identifier>
          <identifier>https://doi.org/10.1145/2808783.2808787</identifier>
          <identifier>urn:ISBN:978-1-4503-3832-5</identifier>
          <identifier>urn:ISBN:978-1-4503-3824-0</identifier>
          <source>David , N , David , A , Hansen , R R , Larsen , K G , Legay , A , Olesen , M C &amp; Probst , C 2015 , Modelling Socio-Technical Attacks with Timed Automata . in Proceedings of the 7th ACM CCS International Workshop on Managing Insider Security Threats . Association for Computing Machinery , pp. 21-28 , 7th ACM CCS International Workshop on Managing Insider Security Threats , Denver , United States , 12/10/2015 . https://doi.org/10.1145/2808783.2808787</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/318003</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/0f2db37e-2381-49f6-b79b-5073cb6f278f</identifier>
        <datestamp>2020-01-13T02:34:40Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Using general-purpose compression algorithms for music analysis</title>
          <creator>Louboutin, Corentin</creator>
          <creator>Meredith, David</creator>
          <subject>music analysis</subject>
          <subject>data compression</subject>
          <subject>lempel-ziv</subject>
          <subject>COSIATEC</subject>
          <subject>classification</subject>
          <subject>machine learning</subject>
          <subject>pattern discovery</subject>
          <subject>Kolmogorov complexity</subject>
          <subject>minimum description length</subject>
          <description xml:lang="eng">General-purpose compression algorithms encode files as dictionaries of substrings with the positions of these strings’ occurrences. We hypothesized that such algorithms could be used for pattern discovery in music. We compared LZ77, LZ78, Burrows–Wheeler and COSIATEC on classifying folk song melodies. A novel method was used, combining multiple viewpoints, the k-nearest-neighbour algorithm and a novel distance metric, corpus compression distance. Using single viewpoints, COSIATEC outperformed the general-purpose compressors, with a classification success rate of 85% on this task. However, by combining 8 of the 10 best-performing viewpoints, including seven that used LZ77, the classification success rate rose to over 94%. In a second experiment, we compared LZ77 with COSIATEC on the task of discovering subject and countersubject entries in fugues by J. S. Bach. When voice information was absent in the input data, COSIATEC outperformed LZ77 with a mean F1 score of 0.123, compared with 0.053 for LZ77. However, when the music was processed a voice at a time, the F1 score for LZ77 more than doubled to 0.124. We also discovered a significant correlation between compression factor and F1 score for all the algorithms, supporting the hypothesis that the best analyses are those represented by the shortest descriptions.</description>
          <date>2016</date>
          <type>article</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/0f2db37e-2381-49f6-b79b-5073cb6f278f</identifier>
          <identifier>https://doi.org/10.1080/09298215.2015.1133656</identifier>
          <identifier>https://vbn.aau.dk/ws/files/223712009/rapport.pdf</identifier>
          <source>Louboutin , C &amp; Meredith , D 2016 , ' Using general-purpose compression algorithms for music analysis ' , Journal of New Music Research , vol. 45 , no. 1 , pp. 1-16 . https://doi.org/10.1080/09298215.2015.1133656</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns2:isPartOf>urn:ISSN:0929-8215</ns2:isPartOf>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/4f245055-2468-4ba5-99ba-2e87fc90f446</identifier>
        <datestamp>2018-02-12T09:47:58Z</datestamp>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Preface:Why social sciences need Vico</title>
          <creator>Tateo, Luca</creator>
          <publisher>Transaction Publishers</publisher>
          <contributor>Tateo, Luca</contributor>
          <date>2016-11-30</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/4f245055-2468-4ba5-99ba-2e87fc90f446</identifier>
          <identifier>https://www.routledge.com/Giambattista-Vico-and-the-New-Psychological-Science/Tateo-Valsiner/p/book/9781412864244</identifier>
          <identifier>urn:ISBN:978-1-4128-6424-4</identifier>
          <source>Tateo , L 2016 , Preface : Why social sciences need Vico . in L Tateo (ed.) , Giambattista Vico and the New Psychological Science . Transaction Publishers , pp. xi-xiv .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/6d20ad54-2521-4218-b59d-c215087cb9fd</identifier>
        <datestamp>2018-02-12T09:47:58Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Towards a new (psychological) science</title>
          <creator>Tateo, Luca</creator>
          <publisher>Transaction Publishers</publisher>
          <contributor>tateo, luca</contributor>
          <date>2016-11-30</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/6d20ad54-2521-4218-b59d-c215087cb9fd</identifier>
          <identifier>http://www.transactionpub.com/title/Giambattista-Vico-and-the-New-Psychological-Science-978-1-4128-6424-4.html</identifier>
          <identifier>urn:ISBN:978-1-4128-6424-4</identifier>
          <source>Tateo , L 2016 , Towards a new (psychological) science . in L tateo (ed.) , Giambattista Vico and the New Psychological Science . Transaction Publishers , pp. 205-218 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/2494b789-d728-43b5-9b85-90423a4d2400</identifier>
        <datestamp>2020-01-11T13:34:38Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Generating Milton Babbitt's all-partition arrays</title>
          <creator>Bemman, Brian</creator>
          <creator>Meredith, David</creator>
          <subject>music analysis</subject>
          <subject>Milton Babbitt</subject>
          <subject>all-partition array</subject>
          <subject>pitch class set theory</subject>
          <subject>algorithms</subject>
          <subject>music theory</subject>
          <subject>12-tone music</subject>
          <description xml:lang="eng">In most of Milton Babbitt's (1916–2011) works written since the early 1960s, both the pitch and rhythmic content is organized according to a highly constrained structure known as the all-partition array. The all-partition array provides a framework that ensures that as many different forms of a tone row as possible (generated by any combination of transposition, inversion or reversal) are expressed 'horizontally' and that each integer partition of 12 whose cardinality is no greater than the number of lynes in a piece is expressed by exactly one 'vertical' aggregate. We present a greedy backtracking algorithm for generating a particular type of all-partition array found in Babbitt’s works, known as a Smalley array. Constructing such an array is a difficult task, and we present two heuristics for helping to generate this type of structure. We provide the parameter values required by this algorithm to generate the specific all-partition arrays used in three of Babbitt’s works. Finally, we evaluate the algorithm and the heuristics in terms of how well they predict the sequences of integer partitions used in two of Babbitt’s works. We also explore the effect of the heuristics on the performance of the algorithm when it is used in an attempt to generate a novel array.</description>
          <date>2016</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/2494b789-d728-43b5-9b85-90423a4d2400</identifier>
          <identifier>https://doi.org/10.1080/09298215.2016.1172646</identifier>
          <source>Bemman , B &amp; Meredith , D 2016 , ' Generating Milton Babbitt's all-partition arrays ' , Journal of New Music Research , vol. 45 , no. 2 , pp. 184-204 . https://doi.org/10.1080/09298215.2016.1172646</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:0929-8215</ns2:isPartOf>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/300c266b-46a4-4e68-a518-21e443743d83</identifier>
        <datestamp>2020-01-15T23:25:04Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Probabilistic Graphical Models on Multi-Core CPUs using Java 8</title>
          <creator>Masegosa, Andres</creator>
          <creator>Martinez, Ana Maria</creator>
          <creator>Borchani, Hanen</creator>
          <date>2016</date>
          <type>article</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/300c266b-46a4-4e68-a518-21e443743d83</identifier>
          <identifier>https://doi.org/10.1109/MCI.2016.2532267</identifier>
          <identifier>https://vbn.aau.dk/ws/files/249708040/1604.07990v1.pdf</identifier>
          <source>Masegosa , A , Martinez , A M &amp; Borchani , H 2016 , ' Probabilistic Graphical Models on Multi-Core CPUs using Java 8 ' , IEEE Computational Intelligence Magazine , vol. 11 , no. 2 , pp. 41-54 . https://doi.org/10.1109/MCI.2016.2532267</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:1556-603X</ns2:isPartOf>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/2775f75a-6296-43e5-8e89-560982b511e7</identifier>
        <datestamp>2020-04-01T04:24:57Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Latency Analysis of Systems with Multiple Interfaces for Ultra-Reliable M2M Communication</title>
          <creator>Nielsen, Jimmy Jessen</creator>
          <creator>Popovski, Petar</creator>
          <description xml:lang="eng">One of the ways to satisfy the requirements of ultra-reliable low latency communication for mission critical Machine-type Communications (MTC) applications is to integrate multiple communication interfaces. In order to estimate the performance in terms of latency and reliability of such an integrated communication system, we propose an analysis framework that combines traditional reliability models with technology-specific latency probability distributions. In our proposed model we demonstrate how failure correlation between technologies can be taken into account. We show for the considered scenario with fiber and different cellular technologies how up to 5-nines reliability can be achieved and how packet splitting can be used to reduce latency substantially while keeping 4-nines reliability. The model has been validated through simulation.</description>
          <publisher>IEEE</publisher>
          <date>2016-08-11</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/2775f75a-6296-43e5-8e89-560982b511e7</identifier>
          <identifier>https://doi.org/10.1109/SPAWC.2016.7536857</identifier>
          <identifier>urn:ISBN:978-1-5090-1750-8</identifier>
          <source>Nielsen , J J &amp; Popovski , P 2016 , Latency Analysis of Systems with Multiple Interfaces for Ultra-Reliable M2M Communication . in IEEE 17th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2016 . IEEE , The 17th IEEE International workshop on Signal Processing advances in Wireless Communications , Edinburgh , United Kingdom , 03/07/2016 . https://doi.org/10.1109/SPAWC.2016.7536857</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7 STREP</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/1039aba6-a38d-4f1e-bd97-cabeee9868ac</identifier>
        <datestamp>2018-02-12T09:48:36Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">The nature of generalization in psychology</title>
          <creator>Tateo, Luca</creator>
          <publisher>Information Age Publishing</publisher>
          <contributor>Marsico, Giuseppina</contributor>
          <contributor>Andrisano Ruggieri, Ruggero</contributor>
          <contributor>Salvatore, Sergio</contributor>
          <date>2015</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/1039aba6-a38d-4f1e-bd97-cabeee9868ac</identifier>
          <identifier>http://www.infoagepub.com/products/Reflexivity-and-Psychology</identifier>
          <identifier>urn:ISBN:978-1-68123-336-9</identifier>
          <source>Tateo , L 2015 , The nature of generalization in psychology . in G Marsico , R Andrisano Ruggieri &amp; S Salvatore (eds) , Reflexivity and Psychology . Information Age Publishing , Yearbook of Idiographic Science , vol. 4 , pp. 45-64 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/329121</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/a13e0f92-df7f-4776-8540-3e8b9441bb9f</identifier>
        <datestamp>2020-01-01T07:02:33Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Composer Recognition based on 2D-Filtered Piano-Rolls</title>
          <creator>Velarde, Gissel</creator>
          <creator>Weyde, Tillman</creator>
          <creator>Cancino Chacón, Carlos</creator>
          <creator>Meredith, David</creator>
          <creator>Grachten, Maarten</creator>
          <subject>Classification</subject>
          <subject>Filtering</subject>
          <subject>piano-roll</subject>
          <subject>Music information retrieval</subject>
          <subject>composer style</subject>
          <description xml:lang="eng">We propose a method for music classification based on the use of convolutional models on symbolic pitch-time representations (i.e. piano-rolls) which we apply to composer recognition. An excerpt of a piece to be classified is first sampled to a 2D pitch-time representation which is then subjected to various transformations, including convolution with predefined filters (Morlet or Gaussian) and classified by means of support vector machines. We combine classifiers based on different pitch representations (MIDI and morphetic pitch) and different filter types and configurations. The method does not require parsing of the music into separate voices, or extraction of any other predefined features prior to processing; instead it is based on the analysis of texture in a 2D pitch-time representation. We show that filtering significantly improves recognition and that the method proves robust to encoding, transposition and amount of information. On discriminating between Haydn and Mozart string quartet movements, our best classifier reaches state-of-the-art performance in&lt;br/&gt;leave-one-out cross validation.</description>
          <publisher>International Society for Music Information Retrieval</publisher>
          <date>2016-08-07</date>
          <type>contributionToPeriodical</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/a13e0f92-df7f-4776-8540-3e8b9441bb9f</identifier>
          <identifier>https://vbn.aau.dk/ws/files/239166270/Velarde_etalISMIR.pdf</identifier>
          <identifier>https://wp.nyu.edu/ismir2016/event/proceedings/</identifier>
          <identifier>urn:ISBN:978­0­692­75506­8</identifier>
          <identifier>urn:ISBN:0­692­75506­3</identifier>
          <source>Velarde , G , Weyde , T , Cancino Chacón , C , Meredith , D &amp; Grachten , M 2016 , Composer Recognition based on 2D-Filtered Piano-Rolls . in Proceedings of the 17th International Conference on Music Information Retrieval . 17 edn , International Society for Music Information Retrieval , pp. 115-121 , International Society for Music Information Retrieval Conference , New York , United States , 07/08/2016 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/f231355d-ba76-495c-9386-cfcd41d0abfa</identifier>
        <datestamp>2018-02-12T09:48:46Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">A Java Toolbox for Analysis of MassIve Data STreams using Probabilistic Graphical Models</title>
          <creator>Masegosa, Andres</creator>
          <creator>Martinez, Ana Maria</creator>
          <creator>Ramos-López, Darío</creator>
          <creator>Langseth, Helge</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <creator>Salmerón, Antonio</creator>
          <creator>Cabanas, Rafael</creator>
          <creator>Madsen, Anders Læsø</creator>
          <date>2016</date>
          <type>conferenceObject</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/f231355d-ba76-495c-9386-cfcd41d0abfa</identifier>
          <identifier>https://vbn.aau.dk/ws/files/249589092/EDFposter.pdf</identifier>
          <source>Masegosa , A , Martinez , A M , Ramos-López , D , Langseth , H , Nielsen , T D , Salmerón , A , Cabanas , R &amp; Madsen , A L 2016 , ' A Java Toolbox for Analysis of MassIve Data STreams using Probabilistic Graphical Models ' , European Data Forum 2016 , Eindhoven , Netherlands , 29/06/2016 - 30/06/2016 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/5c6c883a-bd62-4aa1-8b73-87b66cf52f64</identifier>
        <datestamp>2020-01-01T07:04:07Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Integer Programming Formulation of the Problem of Generating Milton Babbitt's All-partition Arrays</title>
          <creator>Tanaka, Tsubasa</creator>
          <creator>Bemman, Brian</creator>
          <creator>Meredith, David</creator>
          <subject>music analysis</subject>
          <subject>integer programming</subject>
          <subject>Milton Babbitt</subject>
          <subject>all-partition array</subject>
          <subject>music theory</subject>
          <subject>12-tone music</subject>
          <description xml:lang="eng">Milton Babbitt (1916–2011) was a composer of twelve-tone serial music noted for creating the all-partition array. The problem of generating an all-partition array involves finding a rectangular array of pitch-class integers that can be partitioned into regions, each of which represents a distinct integer partition of 12. Integer programming (IP) has proven to be effective for solving such combinatorial prob- lems, however, it has never before been applied to the problem addressed in this paper. We introduce a new way of viewing this problem as one in which restricted overlaps between integer partition regions are allowed. This permits us to describe the problem using a set of linear constraints necessary for IP. In particular, we show that this problem can be defined as a special case of the well-known problem of set-covering (SCP), modified with additional constraints. Due to the difficulty of the problem, we have yet to discover a solution. However, we assess the potential practicality of our method by running it on smaller similar problems.</description>
          <publisher>International Society for Music Information Retrieval</publisher>
          <date>2016</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/5c6c883a-bd62-4aa1-8b73-87b66cf52f64</identifier>
          <identifier>http://m.mr-pc.org/ismir16/website/articles/034_Paper.pdf</identifier>
          <identifier>urn:ISBN:978-84-606-8853-2</identifier>
          <source>Tanaka , T , Bemman , B &amp; Meredith , D 2016 , Integer Programming Formulation of the Problem of Generating Milton Babbitt's All-partition Arrays . in Proceedings of the 17th International Conference on Music Information Retrieval . International Society for Music Information Retrieval , New York, NY , pp. 171-177 , International Society for Music Information Retrieval Conference , New York , United States , 07/08/2016 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/04db3f45-0e7c-4ad5-b885-382824374363</identifier>
        <datestamp>2020-01-01T07:04:08Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Constraint Programming Approach to the Problem of Generating Milton Babbitt's All-partition Arrays</title>
          <creator>Tanaka, Tsubasa</creator>
          <creator>Bemman, Brian</creator>
          <creator>Meredith, David</creator>
          <subject>music analysis</subject>
          <subject>constraint programming</subject>
          <subject>Milton Babbitt</subject>
          <subject>all-partition array</subject>
          <subject>12-tone music</subject>
          <description xml:lang="eng">Milton Babbitt (1916–2011) was a composer of twelve-tone serial music noted for creating the all-partition array. One part of the problem in generating an all-partition array requires finding a covering of a pitch-class matrix by a collection of sets, each forming a region containing 12 distinct elements and corresponding to a distinct integer partition of 12. Constraint programming (CP) is a tool for solving such combinatorial and constraint satisfaction problems. In this paper, we use CP for the first time to formalize this problem in generating an all-partition array. Solving the whole of this problem is difficult and few known solutions exist. Therefore, we propose solving two sub-problems and joining these to form a complete solution. We conclude by presenting a solution found using this method. Our solution is the first we are aware of to be discovered automatically using a computer and differs from those found by composers.&lt;br/&gt;</description>
          <publisher>Springer</publisher>
          <date>2016</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/04db3f45-0e7c-4ad5-b885-382824374363</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-44953-1_50</identifier>
          <identifier>urn:ISBN:978-3-319-44952-4</identifier>
          <source>Tanaka , T , Bemman , B &amp; Meredith , D 2016 , Constraint Programming Approach to the Problem of Generating Milton Babbitt's All-partition Arrays . in Principles and Practice of Constraint Programming : 22nd International Conference, CP2016, Toulouse, France, Spetember 5-9, 2016, Proceedings . Springer , Toulouse, France , Lecture Notes in Computer Science , vol. 9892 , pp. 802-810 , International Conference on Principles and Practice of Constraint Programming , Toulouse , France , 05/09/2016 . https://doi.org/10.1007/978-3-319-44953-1_50</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/7ddf9ef0-cbd8-4b23-9df2-e781874a9032</identifier>
        <datestamp>2020-02-20T19:55:24Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">User constraints for reliable user-defined smart home scenarios</title>
          <creator>Le Guilly, Thibaut</creator>
          <creator>Nielsen, Michael Kvist</creator>
          <creator>Pedersen, Thomas</creator>
          <creator>Skou, Arne Joachim</creator>
          <creator>Kjeldskov, Jesper</creator>
          <creator>Skov, Mikael</creator>
          <subject>Smart Home</subject>
          <subject>User-defined scenarios</subject>
          <subject>Formal methods</subject>
          <subject>Reliability</subject>
          <subject>Safety</subject>
          <subject>Graphical User Interface</subject>
          <description xml:lang="eng">Defining control scenarios in a smart home is a difficult task for end users. In particular, one concern is that user-defined scenarios could lead to unsafe or undesired state of the system. To help them explore scenario specifications, we propose in this paper a system that enables specification of constraints restricting the control commands that can be used inside user-defined scenarios. The system is based on timed automata model checking abstracted by event condition action rules. A prototype was implemented, including a user interface to interact with the user. The usability of the system and interface was evaluated in a user study which results are reported here.&lt;br/&gt;</description>
          <date>2016-07</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/7ddf9ef0-cbd8-4b23-9df2-e781874a9032</identifier>
          <identifier>https://doi.org/10.1007/s40860-016-0020-z</identifier>
          <source>Le Guilly , T , Nielsen , M K , Pedersen , T , Skou , A J , Kjeldskov , J &amp; Skov , M 2016 , ' User constraints for reliable user-defined smart home scenarios ' , Journal of Reliable Intelligent Environments , vol. 2 , no. 2 , pp. 75-91 . https://doi.org/10.1007/s40860-016-0020-z</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/Arrowhead</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:2199-4668</ns2:isPartOf>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">ForskEL</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">Artemis JU</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/bb084e73-681c-4bb4-89c1-99e51949ea9e</identifier>
        <datestamp>2020-03-30T03:46:31Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Estimation of Received Signal Strength Distribution for Smart Meters with Biased Measurement Data Set</title>
          <creator>Kielgast, Mathias Rønholt</creator>
          <creator>Rasmussen, Anders Charly</creator>
          <creator>Laursen, Mathias Hjorth</creator>
          <creator>Nielsen, Jimmy Jessen</creator>
          <creator>Popovski, Petar</creator>
          <creator>Krigslund, Rasmus</creator>
          <description xml:lang="eng">This letter presents an experimental study and a novel modelling approach of the wireless channel of smart utility meters placed in basements or sculleries. The experimental data consist of signal strength measurements of consumption report packets. Since such packets are only registered if they can be decoded by the receiver, the part of the signal strength distribution that falls below the receiver sensitivity threshold is not observable. We combine a Rician fading model with a bias function that captures the cut-off in the observed signal strength measurements. Two sets of experimental data are analysed. It is shown that the proposed method offers an approximation of the distribution of the signal strength measurements that is better than a naïve Rician fitting.</description>
          <date>2017</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/bb084e73-681c-4bb4-89c1-99e51949ea9e</identifier>
          <identifier>https://doi.org/10.1109/LWC.2016.2619346</identifier>
          <identifier>https://arxiv.org/pdf/1610.05094.pdf</identifier>
          <source>Kielgast , M R , Rasmussen , A C , Laursen , M H , Nielsen , J J , Popovski , P &amp; Krigslund , R 2017 , ' Estimation of Received Signal Strength Distribution for Smart Meters with Biased Measurement Data Set ' , IEEE Wireless Communications Letters , vol. 6 , no. 1 , pp. 2-5 . https://doi.org/10.1109/LWC.2016.2619346</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7 STREP</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns2:isPartOf>urn:ISSN:2162-2337</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/d0398182-af9b-4ab5-b8ff-8bb519e58cfd</identifier>
        <datestamp>2020-03-25T03:34:53Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Secure Real-Time Monitoring and Management of Smart Distribution Grid using Shared Cellular Networks</title>
          <creator>Nielsen, Jimmy Jessen</creator>
          <creator>Ganem, Hervé</creator>
          <creator>Jorguseski, Ljupco</creator>
          <creator>Alic, Kemal</creator>
          <creator>Smolnikar, Miha</creator>
          <creator>Zhu, Ziming</creator>
          <creator>Pratas, Nuno</creator>
          <creator>Golinski, Michal</creator>
          <creator>Zhang, Haibin</creator>
          <creator>Kuhar, Urban</creator>
          <creator>Fan, Zhong</creator>
          <creator>Svigelj, Ales</creator>
          <description xml:lang="eng">The electricity production and distribution is facing two major changes. First, the production is shifting from classical energy sources such as coal and nuclear power towards renewable resources such as solar and wind. Secondly, the consumption in the low voltage grid is expected to grow significantly due to expected introduction of electrical vehicles. The first step towards more efficient operational capabilities is to introduce an observability of the distribution system and allow for lever- aging the flexibility of end connection points with manageable consumption, generation and storage capabilities. Thanks to the advanced measurement devices, management framework, and secure communication infrastructure developed in the FP7 SUNSEED project, the Distribution System Operator (DSO) now has full observability of the energy flows at the medium/low voltage grid. Furthermore, the prosumers are able to participate pro-actively and coordinate with the DSO and other stakeholders in the grid. The monitoring and management functionalities have strong requirements to the communication latency, reliability and security. This paper presents novel solutions and analyses of these aspects for the SUNSEED scenario, where the smart grid ICT solutions are provided through shared cellular LTE networks.</description>
          <date>2017-04-24</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/d0398182-af9b-4ab5-b8ff-8bb519e58cfd</identifier>
          <identifier>https://doi.org/10.1109/MWC.2017.1600252</identifier>
          <identifier>https://arxiv.org/pdf/1701.03666.pdf</identifier>
          <source>Nielsen , J J , Ganem , H , Jorguseski , L , Alic , K , Smolnikar , M , Zhu , Z , Pratas , N , Golinski , M , Zhang , H , Kuhar , U , Fan , Z &amp; Svigelj , A 2017 , ' Secure Real-Time Monitoring and Management of Smart Distribution Grid using Shared Cellular Networks ' , I E E E Wireless Communications Magazine , vol. 24 , no. 2 , pp. 10-17 . https://doi.org/10.1109/MWC.2017.1600252</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7 STREP</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:1536-1284</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/e204bdc2-66e5-44a0-8989-bb944243d41d</identifier>
        <datestamp>2018-02-12T09:50:51Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Using SIATECCompress to discover repeated themes and sections in polyphonic music</title>
          <creator>Meredith, David</creator>
          <description xml:lang="eng">Three variants of the SIATECCompress algorithm were submitted to the 2016 MIREX competition on Discovery of Repeated Themes and Sections. The three variants were those that performed best in terms of three-layer F1 score (TLF1), three-layer precision (TLP) and three-layer recall (TLR), respectively, when a large number of variants of SIATECCompress, COSIATEC and Forth’s algorithm&lt;br/&gt;were run on the polyphonic version of the JKU Patterns Development Database (JKU-PDD). The variant optimised for TLF1 achieved an average TLF1 score of 0.490 over the five pieces in the database. The variant optimised for TLP achieved an average TLP score of 0.561 over the JKU-PDD. The variant optimised for TLR achieved an average TLR score of 0.583 over the JKU-PDD. The three variants have been implemented in Java.</description>
          <date>2016</date>
          <type>conferenceObject</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/e204bdc2-66e5-44a0-8989-bb944243d41d</identifier>
          <identifier>https://vbn.aau.dk/ws/files/240878540/MeredithMIREX2016.pdf</identifier>
          <identifier>http://www.music-ir.org/mirex/wiki/2016:Discovery_of_Repeated_Themes_%26_Sections</identifier>
          <identifier>http://www.music-ir.org/mirex/wiki/2016:Discovery_of_Repeated_Themes_%26_Sections_Results</identifier>
          <identifier>http://www.music-ir.org/mirex/abstracts/2016/DM1.pdf</identifier>
          <identifier>http://www.titanmusic.com/papers/public/MeredithMIREX2016.pdf</identifier>
          <source>Meredith , D 2016 , ' Using SIATECCompress to discover repeated themes and sections in polyphonic music ' , Music Information Retrieval Evaluation Exchange , New York , United States , 07/08/2016 - 11/09/2016 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/05d2e76c-b635-4d8b-876a-6f9230ea7278</identifier>
        <datestamp>2020-02-04T20:28:19Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Parallel Filter-Based Feature Selection Based on Balanced Incomplete Block Designs</title>
          <creator>Salmerón, Antonio</creator>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Jensen, Frank</creator>
          <creator>Langseth, Helge</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <creator>Ramos-López, Darío</creator>
          <creator>Martinez, Ana M.</creator>
          <creator>Masegosa, Andres</creator>
          <publisher>IOS Press</publisher>
          <date>2016</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/05d2e76c-b635-4d8b-876a-6f9230ea7278</identifier>
          <identifier>https://doi.org/10.3233/978-1-61499-672-9-743</identifier>
          <identifier>urn:ISBN:978-1-61499-671-2</identifier>
          <source>Salmerón , A , Madsen , A L , Jensen , F , Langseth , H , Nielsen , T D , Ramos-López , D , Martinez , A M &amp; Masegosa , A 2016 , Parallel Filter-Based Feature Selection Based on Balanced Incomplete Block Designs . in ECAI 2016 : 22nd European Conference on Artificial Intelligence . IOS Press , Frontiers in Artificial Intelligence and Applications , vol. 285 , pp. 743-750 , European Conference on Artificial Intelligence , The Hague , Netherlands , 29/08/2016 . https://doi.org/10.3233/978-1-61499-672-9-743</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/af502715-dd16-482d-b3f5-2fc732f6f983</identifier>
        <datestamp>2018-02-12T09:51:27Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">d-VMP: Distributed Variational Message Passing</title>
          <creator>Masegosa, Andres</creator>
          <creator>Martinez, Ana M.</creator>
          <creator>Langseth, Helge</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <creator>Salmerón, Antonio</creator>
          <creator>Ramos-López, Darío</creator>
          <creator>Madsen, Anders Læsø</creator>
          <date>2016</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/af502715-dd16-482d-b3f5-2fc732f6f983</identifier>
          <identifier>http://www.jmlr.org/proceedings/papers/v52/masegosa16.pdf</identifier>
          <source>Masegosa , A , Martinez , A M , Langseth , H , Nielsen , T D , Salmerón , A , Ramos-López , D &amp; Madsen , A L 2016 , d-VMP: Distributed Variational Message Passing . in JMLR Workshop and Conference Proceedings : Volume 52: Proceedings of the Eighth International Conference on Probabilistic Graphical Models . JMLR Workshop and Conference Proceedings , vol. 52 , pp. 321-332 , Probabilistic Graphical Models , Switzerland , 06/09/2016 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/be63c2b7-1108-44ea-bce0-3779f40170b3</identifier>
        <datestamp>2018-02-12T09:51:27Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Scalable MAP inference in Bayesian networks based on a Map-Reduce approach</title>
          <creator>Ramos-López, Darío</creator>
          <creator>Salmerón, Antonio</creator>
          <creator>Rumí, Rafael</creator>
          <creator>Martinez, Ana M.</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <creator>Masegosa, Andres</creator>
          <creator>Langseth, Helge</creator>
          <creator>Madsen, Anders Læsø</creator>
          <date>2016</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/be63c2b7-1108-44ea-bce0-3779f40170b3</identifier>
          <identifier>http://www.jmlr.org/proceedings/papers/v52/ramos-lopez16.pdf</identifier>
          <source>Ramos-López , D , Salmerón , A , Rumí , R , Martinez , A M , Nielsen , T D , Masegosa , A , Langseth , H &amp; Madsen , A L 2016 , Scalable MAP inference in Bayesian networks based on a Map-Reduce approach . in JMLR Workshop and Conference Proceedings : Volume 52: Proceedings of the Eighth International Conference on Probabilistic Graphical Models . JMLR Workshop and Conference Proceedings , vol. 52 , pp. 415-425 , Probabilistic Graphical Models , Switzerland , 06/09/2016 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/b35df709-4d8a-4569-ba53-caee809724ff</identifier>
        <datestamp>2019-10-30T12:57:54Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">An Energy Flexibility Framework on the Internet of Things</title>
          <creator>Le Guilly, Thibaut</creator>
          <creator>Siksnys, Laurynas</creator>
          <creator>Albano, Michele</creator>
          <creator>Pedersen, Per D.</creator>
          <creator>Stluka, Petr</creator>
          <creator>Ferreira, Luis Lino</creator>
          <creator>Skou, Arne Joachim</creator>
          <creator>Pedersen, Torben Bach</creator>
          <creator>Olsen, Petur</creator>
          <subject>Smart Grid</subject>
          <subject>Flexible demand</subject>
          <description xml:lang="eng">This paper presents a framework for management of flexible energy loads in the context of the Internet of Things and the Smart Grid. The framework takes place in the European project Arrowhead, and aims at taking advantage of the flexibility (in time and power) of energy production and consumption offered by sets of devices, appliances or buildings, to help at solving the issue of fluctuating energy production of renewable energies. The underlying concepts are explained, the actors involved in the framework, their incentives and interactions are detailed, and a technical overview is provided. An implementation of the framework is presented, as well as the expected results of the pilots.</description>
          <publisher>SCITEPRESS Digital Library</publisher>
          <date>2015</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/b35df709-4d8a-4569-ba53-caee809724ff</identifier>
          <identifier>https://doi.org/10.5220/0006163400170037</identifier>
          <identifier>urn:ISBN:978-989-758-176-2</identifier>
          <source>Le Guilly , T , Siksnys , L , Albano , M , Pedersen , P D , Stluka , P , Ferreira , L L , Skou , A J , Pedersen , T B &amp; Olsen , P 2015 , An Energy Flexibility Framework on the Internet of Things . in The Success of European Projects using New Information and Communication Technologies . SCITEPRESS Digital Library , pp. 17-37 . https://doi.org/10.5220/0006163400170037</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/Arrowhead</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">ForskEL</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">Artemis JU</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/fb667837-d31f-4218-8923-15a0655b765d</identifier>
        <datestamp>2018-02-12T09:51:57Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Situation Awareness and Early Recognition of Traffic Maneuvers</title>
          <creator>Weidl, Galia</creator>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Tereshchenko, Viacheslav</creator>
          <creator>Zhang, Wei</creator>
          <creator>Wang, Stevens</creator>
          <creator>Dietmar, Kasper</creator>
          <publisher>IEEE</publisher>
          <date>2016</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/fb667837-d31f-4218-8923-15a0655b765d</identifier>
          <identifier>https://doi.org/10.1109/EUROSIM.2016.161</identifier>
          <identifier>http://amidst.eu/upload/dokumenter/Publications/EUROSIM2016.pdf</identifier>
          <identifier>urn:ISBN:978-1-5090-4119-0</identifier>
          <source>Weidl , G , Madsen , A L , Tereshchenko , V , Zhang , W , Wang , S &amp; Dietmar , K 2016 , Situation Awareness and Early Recognition of Traffic Maneuvers . in Proceedings of the 9th EUROSIM Congress on Modelling and Simulation . IEEE , pp. 7-16 , 9th EUROSIM Congress on Modelling and Simulation , Oulu , Finland , 12/09/2016 . https://doi.org/10.1109/EUROSIM.2016.161</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/dca9fe74-b7d6-4807-839a-50abfa77f6e9</identifier>
        <datestamp>2020-03-30T03:47:19Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">A parallel algorithm for Bayesian network structure learning from large data sets</title>
          <creator>Madsen, Anders Læsø</creator>
          <creator>Jensen, Frank</creator>
          <creator>Salmerón, Antonio</creator>
          <creator>Langseth, Helge</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <date>2017</date>
          <type>article</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/dca9fe74-b7d6-4807-839a-50abfa77f6e9</identifier>
          <identifier>https://doi.org/10.1016/j.knosys.2016.07.031</identifier>
          <identifier>https://vbn.aau.dk/ws/files/290935056/1_s2.0_S0950705116302465_main.pdf</identifier>
          <source>Madsen , A L , Jensen , F , Salmerón , A , Langseth , H &amp; Nielsen , T D 2017 , ' A parallel algorithm for Bayesian network structure learning from large data sets ' , Knowledge-Based Systems , vol. 117 , pp. 46-55 . https://doi.org/10.1016/j.knosys.2016.07.031</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns2:isPartOf>urn:ISSN:0950-7051</ns2:isPartOf>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/3d8af059-c41f-4d01-98e7-d77530f230d5</identifier>
        <datestamp>2020-03-13T11:44:56Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Skill Based Instruction of Collaborative Robots in Industrial Settings</title>
          <creator>Schou, Casper</creator>
          <creator>Andersen, Rasmus Skovgaard</creator>
          <creator>Chrysostomou, Dimitrios</creator>
          <creator>Bøgh, Simon</creator>
          <creator>Madsen, Ole</creator>
          <subject>Collaborative robots</subject>
          <subject>task-level programming</subject>
          <subject>robot skills</subject>
          <subject>intuitive robot instruction</subject>
          <subject>industrial assembly</subject>
          <subject>Industrial assembly</subject>
          <subject>Intuitive robot instruction</subject>
          <subject>Robot skills</subject>
          <subject>Task-level programming</subject>
          <description xml:lang="eng">&lt;p&gt;During the past decades, the increasing need for more flexible and agile manufacturing equipment has spawned a growing interest in collaborative robots. Contrary to traditional industrial robots, collaborative robots are intended for operating alongside the production personnel in dynamic or semi-structured human environments. To cope with the environment and workflow of humans, new programming and control methods are needed compared to those of traditional industrial robots. This paper presents a task-level programming software tool allowing robotic novices to program industrial tasks on a collaborative robot. The tool called Skill Based System (SBS) is founded on the concept of robot skills, which are parameterizable and task-related actions of the robot. Task programming is conducted by first sequencing skills followed by an online parameterization performed using kinesthetic teaching. Through several user studies, SBS is found to enable robotic novices to program industrial tasks. SBS has further been deployed and tested in two manufacturing settings demonstrating its applicability in real industrial scenarios.&lt;/p&gt;</description>
          <date>2018-10</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/3d8af059-c41f-4d01-98e7-d77530f230d5</identifier>
          <identifier>https://doi.org/10.1016/j.rcim.2018.03.008</identifier>
          <identifier>http://www.scopus.com/inward/record.url?scp=85044441207&amp;partnerID=8YFLogxK</identifier>
          <source>Schou , C , Andersen , R S , Chrysostomou , D , Bøgh , S &amp; Madsen , O 2018 , ' Skill Based Instruction of Collaborative Robots in Industrial Settings ' , Robotics and Computer-Integrated Manufacturing , vol. 53 , no. Oktober 2018 , pp. 72-80 . https://doi.org/10.1016/j.rcim.2018.03.008</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/600578</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:0736-5845</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/48115b29-2f7c-4d04-9e83-e54e271b2502</identifier>
        <datestamp>2019-04-22T10:04:08Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Compensating Pose Uncertainties Through Appropriate Gripper Finger Cutouts</title>
          <creator>Wolniakowski, Adam</creator>
          <creator>Gams, Andrej</creator>
          <creator>Kiforenko, Lilita</creator>
          <creator>Kramberger, Aljaž</creator>
          <creator>Chrysostomou, Dimitrios</creator>
          <creator>Madsen, Ole</creator>
          <creator>Miatliuk, Konstantsin</creator>
          <creator>Petersen, Henrik Gordon</creator>
          <creator>Hagelskjær, Frederik</creator>
          <creator>Buch, Anders Glent</creator>
          <creator>Ude, Ales</creator>
          <creator>Krüger, Norbert</creator>
          <description xml:lang="eng">The gripper finger design is a recurring problem in many robotic grasping platforms used in industry. The task of switching the gripper configuration to accommodate for a new batch of objects typically requires engineering expertise, and is a lengthy and costly iterative trial-and-error process. One of the open challenges is the need for the gripper to compensate for uncertainties inherent to the workcell, e.g. due to errors in calibration, inaccurate pose estimation from the vision system, or object deformation. In this paper, we present an analysis of gripper uncertainty compensating capabilities in a sample industrial object grasping scenario for a finger that was designed using an automated simulation-based geometry optimization method [1, 2]. We test the developed gripper with a set of grasps subjected to structured perturbation in a simulation environment and in the real-world setting. We provide a comparison of the data obtained by using both of these approaches. We argue that the strong correspondence observed in results validates the use of dynamic simulation for the gripper finger design and optimization.</description>
          <date>2018</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/48115b29-2f7c-4d04-9e83-e54e271b2502</identifier>
          <source>Wolniakowski , A , Gams , A , Kiforenko , L , Kramberger , A , Chrysostomou , D , Madsen , O , Miatliuk , K , Petersen , H G , Hagelskjær , F , Buch , A G , Ude , A &amp; Krüger , N 2018 , Compensating Pose Uncertainties Through Appropriate Gripper Finger Cutouts . in 12th International Conference Mechatronic Systems and Materials (MSM'16) . International Conference on Mechatronic Systems and Materials , Białystok , Poland , 03/07/2016 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/600578</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/61fb86af-ac54-46cd-9f3e-2d27bf1d159b</identifier>
        <datestamp>2020-01-01T07:14:20Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Optimizing Grippers for Compensating Pose Uncertainties by Dynamic Simulation</title>
          <creator>Wolniakowski, Adam</creator>
          <creator>Kramberger, Aljaž</creator>
          <creator>Gams, Andrej</creator>
          <creator>Chrysostomou, Dimitrios</creator>
          <creator>Hagelskjær, Frederik</creator>
          <creator>Thulesen, Thomas Nicky</creator>
          <creator>Kiforenko, Lilita</creator>
          <creator>Buch, Anders Glent</creator>
          <creator>Bodenhagen, Leon</creator>
          <creator>Petersen, Henrik Gordon</creator>
          <creator>Madsen, Ole</creator>
          <creator>Ude, Ales</creator>
          <creator>Krüger, Norbert</creator>
          <subject>gripper optimization</subject>
          <subject>pose uncertainties</subject>
          <subject>Dynamic Simulation</subject>
          <subject>industrial assembly</subject>
          <description xml:lang="eng">Gripper design process is one of the interesting challenges in the context of grasping within industry. Typically, simple parallel-finger grippers, which are easy to install and maintain, are used in platforms for robotic grasping. The context switches in these platforms require frequent exchange of gripper fingers to accommodate grasping of new products, while subjected to numerous constraints, such as workcell uncertainties due to the vision systems used. The design of these fingers consumes the man-hours of experienced engineers, and involves a lot of trial-and-error testing. In our previous work, we have presented a method to automatically compute the optimal finger shapes for defined task contexts in simulation. In this paper, we show the performance of our method in an industrial grasping scenario. We first analyze the uncertainties of the used vision system, which are the major source of grasping error. Then, we perform the experiments, both in simulation and in a real setting. The experiments confirmed the validity of our approach. The computed finger design was employed in a real industrial assembly scenario.</description>
          <publisher>IEEE</publisher>
          <date>2017-02-23</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/61fb86af-ac54-46cd-9f3e-2d27bf1d159b</identifier>
          <identifier>https://doi.org/10.1109/SIMPAR.2016.7862393</identifier>
          <identifier>http://ieeexplore.ieee.org/document/7862393/</identifier>
          <identifier>urn:ISBN:978-1-5090-4617-1</identifier>
          <source>Wolniakowski , A , Kramberger , A , Gams , A , Chrysostomou , D , Hagelskjær , F , Thulesen , T N , Kiforenko , L , Buch , A G , Bodenhagen , L , Petersen , H G , Madsen , O , Ude , A &amp; Krüger , N 2017 , Optimizing Grippers for Compensating Pose Uncertainties by Dynamic Simulation . in IEEE International Conference on Simulation, Modelling, and Programming for Autonomous Robots (SIMPAR) . IEEE , pp. 177-184 , IEEE International Conference on Simulation, Modeling, and Programming for Autonomous Robots , San Francisco , United States , 13/12/2016 . https://doi.org/10.1109/SIMPAR.2016.7862393</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/600578</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/277a8013-8801-4e9e-a169-342c8e168021</identifier>
        <datestamp>2020-01-01T07:16:54Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Fast setup and adaptation of industrial assembly tasks with force-based exception strategies</title>
          <creator>Kramberger, Aljaž</creator>
          <creator>Schou, Casper</creator>
          <creator>Chrysostomou, Dimitrios</creator>
          <creator>Gams, Andrej</creator>
          <creator>Madsen, Ole</creator>
          <creator>Ude, Aleš</creator>
          <subject>Assembly</subject>
          <subject>Learning by demonstration</subject>
          <subject>Skills</subject>
          <publisher>Springer</publisher>
          <date>2017</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/277a8013-8801-4e9e-a169-342c8e168021</identifier>
          <identifier>https://doi.org/10.1007/978-3-319-49058-8_46</identifier>
          <identifier>http://www.scopus.com/inward/record.url?scp=85007385861&amp;partnerID=8YFLogxK</identifier>
          <identifier>urn:ISBN:978-3-319-49057-1</identifier>
          <source>Kramberger , A , Schou , C , Chrysostomou , D , Gams , A , Madsen , O &amp; Ude , A 2017 , Fast setup and adaptation of industrial assembly tasks with force-based exception strategies . in Advances in Robot Design and Intelligent Control : Proceedings of the 25th Conference on Robotics in Alpe-Adria-Danube Region (RAAD16) . Springer , Advances in Intelligent Systems and Computing , vol. 540 , pp. 421-429 , 25th International Conference on Robotics in Alpe-Adria-Danube Region, RAAD 2016 , Belgrade , Serbia , 30/06/2016 . https://doi.org/10.1007/978-3-319-49058-8_46</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/600578</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/0d17733a-0c6b-4103-91e9-07a730851364</identifier>
        <datestamp>2020-03-30T03:48:24Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Ultra-reliable low latency communication using interface diversity</title>
          <creator>Nielsen, Jimmy Jessen</creator>
          <creator>Liu, Rongkuan</creator>
          <creator>Popovski, Petar</creator>
          <subject>Communication system reliability</subject>
          <subject>codes</subject>
          <subject>diversity methods</subject>
          <subject>real-time systems</subject>
          <subject>redundancy</subject>
          <description xml:lang="eng">&lt;p&gt;An important ingredient of the future 5G systems will be ultra-reliable low-latency communication (URLLC). A way to offer URLLC without intervention in the baseband/PHY layer design is to use interface diversity and integrate multiple communication interfaces, each interface based on a different technology. In this paper, we propose to use coding to seamlessly distribute coded payload and redundancy data across multiple available communication interfaces. We formulate an optimization problem to find the payload allocation weights that maximize the reliability at specific target latency values. In order to estimate the performance in terms of latency and reliability of such an integrated communication system, we propose an analysis framework that combines traditional reliability models with technology-specific latency probability distributions. Our model is capable to account for failure correlation among interfaces/technologies. By considering different scenarios, we find that the optimized strategies can in some cases significantly outperform strategies based on k-out-of- n erasure codes, where the latter do not account for the characteristics of the different interfaces. The model has been validated through simulation and is supported by experimental results.&lt;/p&gt;</description>
          <date>2018-03</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/0d17733a-0c6b-4103-91e9-07a730851364</identifier>
          <identifier>https://doi.org/10.1109/TCOMM.2017.2771478</identifier>
          <identifier>http://www.scopus.com/inward/record.url?scp=85033689666&amp;partnerID=8YFLogxK</identifier>
          <identifier>https://arxiv.org/pdf/1712.05148.pdf</identifier>
          <source>Nielsen , J J , Liu , R &amp; Popovski , P 2018 , ' Ultra-reliable low latency communication using interface diversity ' , I E E E Transactions on Communications , vol. 66 , no. 3 , pp. 1322-1334 . https://doi.org/10.1109/TCOMM.2017.2771478</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7 STREP</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:0090-6778</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/8e0ba70f-6eb8-4582-81ea-205141a00576</identifier>
        <datestamp>2020-03-25T03:36:53Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Transfer of contact skills to new environmental conditions</title>
          <creator>Kramberger, Aljaž</creator>
          <creator>Gams, Andrej</creator>
          <creator>Nemec, Bojan</creator>
          <creator>Schou, Casper</creator>
          <creator>Chrysostomou, Dimitrios</creator>
          <creator>Madsen, Ole</creator>
          <creator>Ude, Aleš</creator>
          <subject>libraries</subject>
          <subject>robot skill generalization</subject>
          <subject>Programming by Demonstration</subject>
          <subject>Manipulators</subject>
          <subject>Quaternions</subject>
          <subject>Robot Kinematics</subject>
          <subject>Service robots</subject>
          <subject>Trajectory</subject>
          <publisher>IEEE Computer Society Press</publisher>
          <date>2016-12-30</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/8e0ba70f-6eb8-4582-81ea-205141a00576</identifier>
          <identifier>https://doi.org/10.1109/HUMANOIDS.2016.7803346</identifier>
          <identifier>http://www.scopus.com/inward/record.url?scp=85010203055&amp;partnerID=8YFLogxK</identifier>
          <identifier>urn:ISBN:978-1-5090-4719-2</identifier>
          <source>Kramberger , A , Gams , A , Nemec , B , Schou , C , Chrysostomou , D , Madsen , O &amp; Ude , A 2016 , Transfer of contact skills to new environmental conditions . in Humanoids 2016 - IEEE-RAS International Conference on Humanoid Robots . , 7803346 , IEEE Computer Society Press , pp. 668-675 , 16th IEEE-RAS International Conference on Humanoid Robots, Humanoids 2016 , Cancun , Mexico , 15/11/2016 . https://doi.org/10.1109/HUMANOIDS.2016.7803346</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/600578</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/347f5fb8-a928-4136-8cd6-2aedce8d70f0</identifier>
        <datestamp>2020-02-17T17:22:07Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">MAP inference in dynamic hybrid Bayesian networks</title>
          <creator>Ramos-López, Darío</creator>
          <creator>Masegosa, Andres</creator>
          <creator>Martinez, Ana M.</creator>
          <creator>Salmerón, Antonio</creator>
          <creator>Nielsen, Thomas Dyhre</creator>
          <creator>Langseth, Helge</creator>
          <creator>Madsen, Anders Læsø</creator>
          <date>2017</date>
          <type>article</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/347f5fb8-a928-4136-8cd6-2aedce8d70f0</identifier>
          <identifier>https://doi.org/10.1007/s13748-017-0115-7</identifier>
          <identifier>https://vbn.aau.dk/ws/files/280034050/Map_Inference.pdf</identifier>
          <source>Ramos-López , D , Masegosa , A , Martinez , A M , Salmerón , A , Nielsen , T D , Langseth , H &amp; Madsen , A L 2017 , ' MAP inference in dynamic hybrid Bayesian networks ' , Progress in Artificial Intelligence , vol. 6 , no. 2 , pp. 133–144 . https://doi.org/10.1007/s13748-017-0115-7</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/619209</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns2:isPartOf>urn:ISSN:2192-6352</ns2:isPartOf>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">European Union’s Seventh Framework Programme for research, technological development and demonstration</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/95cf3846-92a1-4ffb-b589-4aa9a934b0d9</identifier>
        <datestamp>2020-03-30T03:49:26Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Optimized Interface Diversity for Ultra-Reliable Low Latency Communication (URLLC)</title>
          <creator>Nielsen, Jimmy Jessen</creator>
          <creator>Liu, Rongkuan</creator>
          <creator>Popovski, Petar</creator>
          <description xml:lang="eng">An important ingredient of the future 5G systems will be Ultra-Reliable Low-Latency Communication (URLLC). A way to offer URLLC without intervention in the baseband/PHY layer design is to use interface diversity and integrate multiple communication interfaces, each interface based on a different technology. Our approach is to use rateless codes to seamlessly distribute coded payload and redundancy data across multiple available communication interfaces. We formulate an optimization problem to find the payload allocation weights that maximize the reliability at specific target latency values. By considering different scenarios, we find that optimized strategies can significantly outperform k-out-of-n strategies, where the latter do not account for the characteristics of the different interfaces. Our approach is supported by experimental results.</description>
          <publisher>IEEE</publisher>
          <date>2017</date>
          <type>contributionToPeriodical</type>
          <identifier>https://vbn.aau.dk/da/publications/95cf3846-92a1-4ffb-b589-4aa9a934b0d9</identifier>
          <identifier>https://doi.org/10.1109/GLOCOM.2017.8254053</identifier>
          <identifier>http://globecom2017.ieee-globecom.org/program/symposia/thursday-symposia</identifier>
          <identifier>https://arxiv.org/pdf/1712.05148.pdf</identifier>
          <identifier>urn:ISBN:978-1-5090-5019-2</identifier>
          <source>Nielsen , J J , Liu , R &amp; Popovski , P 2017 , Optimized Interface Diversity for Ultra-Reliable Low Latency Communication (URLLC) . in GLOBECOM 2017 - 2017 IEEE Global Communications Conference . IEEE , GLOBECOM - conference record / IEEE Global Telecommunications Conference , IEEE GLOBECOM 2017 , Singapore , 04/12/2017 . https://doi.org/10.1109/GLOCOM.2017.8254053</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7 STREP</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/98518c8c-cc52-4a0b-ae28-fa8dcd8c323c</identifier>
        <datestamp>2019-04-05T13:22:14Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">5G and Cellular Networks in the Smart Grid</title>
          <creator>Nielsen, Jimmy Jessen</creator>
          <creator>Jorguseski, Ljupco</creator>
          <creator>Zhang, Haibin</creator>
          <creator>Ganem, Hervé</creator>
          <creator>Zhu, Ziming</creator>
          <creator>Popovski, Petar</creator>
          <description xml:lang="eng">Wireless cellular networks will help Distribution System Operators (DSOs) to achieve observability below the substation level, which is needed to ensure stable operation in the smart grid. Both existing and upcoming cellular technologies are considered as candidates for helping to enable the smart grid. In the present chapter, we present the main features of both the non-3GPP technologies, IEEE 802.11ah, SigFox and LoRa, and the main features of past, current and future 3GPP technologies, namely releases &amp;lt;12 (High rate), 12-14 (IoT extensions) and 15-16 (5G). Additionally, we present the challenges and possible solutions for ensuring end-to-end security in smart grid systems.</description>
          <publisher>Wiley</publisher>
          <date>2018-11</date>
          <type>bookPart</type>
          <identifier>https://vbn.aau.dk/da/publications/98518c8c-cc52-4a0b-ae28-fa8dcd8c323c</identifier>
          <identifier>https://www.wiley.com/en-us/Transportation+and+Power+Grid+in+Smart+Cities%3A+Communication+Networks+and+Services-p-9781119360087</identifier>
          <identifier>urn:ISBN:978-1-119-36008-7</identifier>
          <source>Nielsen , J J , Jorguseski , L , Zhang , H , Ganem , H , Zhu , Z &amp; Popovski , P 2018 , 5G and Cellular Networks in the Smart Grid . in Transportation and Power Grid in Smart Cities : Communication Networks and Services . Wiley , pp. 69-102 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/FP7 STREP</relation>
          <rights>info:eu-repo/semantics/restrictedAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/1a802e33-e291-4814-aeec-48e3884488bf</identifier>
        <datestamp>2020-03-19T03:34:53Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Transformative social innovation and (dis)empowerment</title>
          <creator>Avelino, Flor</creator>
          <creator>Wittmayer, Julia</creator>
          <creator>Pel, Bonno</creator>
          <creator>Weaver, Paul</creator>
          <creator>Dumitru, Adina</creator>
          <creator>Haxeltine, Alex</creator>
          <creator>Kemp, René</creator>
          <creator>Jørgensen, Michael Søgaard</creator>
          <creator>Bauler, Tom</creator>
          <creator>Ruijsink, Saskia</creator>
          <creator>O'Riordan, Tim</creator>
          <subject>Transformative social innovation</subject>
          <subject>Governance</subject>
          <subject>Empowerment</subject>
          <subject>Societal challanges</subject>
          <subject>Transformative change</subject>
          <description xml:lang="eng">This article responds to increasing public and academic discourses on social innovation, which often rest on the assumption that social innovation can drive societal change and empower actors to deal with societal challenges and a retreating welfare state. In order to scrutinise this assumption, this article proposes a set of concepts to study the dynamics of transformative social innovation and underlying processes of multi-actor (dis)empowerment.&lt;br/&gt;First, the concept of transformative social innovation is unpacked by proposing four foundational concepts to help distinguish between different pertinent ‘shades’ of change and innovation: 1) social innovation, (2) system innovation, (3) game-changers, and (4) narratives of change. These concepts, invoking insights from transitions studies and social innovations literature, are used to construct a conceptual account of how transformative social innovation emerges as a co-evolutionary interaction between diverse shades of change and&lt;br/&gt;innovation. Second, the paper critically discusses the dialectic nature of multi-actor (dis)empowerment that underlies such processes of change and innovation. The paper then demonstrates how the conceptualisations are&lt;br/&gt;applied to three empirical case-studies of transformative social innovation: Impact Hub, Time Banks and Credit Unions. In the conclusion we synthesise how the concepts and the empirical examples help to understand contemporary shifts in societal power relations and the changing role of the welfare state.</description>
          <date>2019-08</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/1a802e33-e291-4814-aeec-48e3884488bf</identifier>
          <identifier>https://doi.org/10.1016/j.techfore.2017.05.002</identifier>
          <source>Avelino , F , Wittmayer , J , Pel , B , Weaver , P , Dumitru , A , Haxeltine , A , Kemp , R , Jørgensen , M S , Bauler , T , Ruijsink , S &amp; O'Riordan , T 2019 , ' Transformative social innovation and (dis)empowerment ' , Technological Forecasting and Social Change , vol. 145 , pp. 195–206 . https://doi.org/10.1016/j.techfore.2017.05.002</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/613169</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
          <ns2:isPartOf>urn:ISSN:0040-1625</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/89431a07-1245-4e28-9fd8-3162e52a5767</identifier>
        <datestamp>2019-01-07T06:14:11Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Detecting Social Innovation agency:Methodological reflections on units of analysis in dispersed transformation processes</title>
          <creator>Pel, Bonno</creator>
          <creator>Dorland, Jens</creator>
          <creator>Wittmayer, Julia</creator>
          <creator>Jørgensen, Michael Søgaard</creator>
          <subject>Social Innovation</subject>
          <subject>Demarcation</subject>
          <subject>Networks</subject>
          <subject>Methodology</subject>
          <subject>Actor network theory</subject>
          <subject>Coproduction</subject>
          <subject>Transformation</subject>
          <description xml:lang="eng">Considering that it is important for the social innovation research field to&lt;br/&gt;confront its methodological challenges, this contribution addresses the&lt;br/&gt;challenge of choosing appropriate units of analysis. In processes of&lt;br/&gt;transformative social innovation, the agency is distributed and therefore&lt;br/&gt;fundamentally difficult to detect and ascribe. This contribution addresses the&lt;br/&gt;challenge to develop methodologies that are consistent with this relational&lt;br/&gt;ontology, critically evaluating the three main unit of analysis choices that&lt;br/&gt;guided an international comparison of 20 transnational SI networks and their&lt;br/&gt;local manifestations. Methodological lessons are drawn on the actors that SI&lt;br/&gt;can be ascribed to, on the transnational agency through which it spreads and on&lt;br/&gt;the relevant transformation contexts involved. This provides SI research with&lt;br/&gt;methodological tools to handle the elusiveness of SI agency, a methodological&lt;br/&gt;challenge that becomes particularly pressing in attempts towards systematic&lt;br/&gt;comparison of cases.</description>
          <date>2017</date>
          <type>article</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/89431a07-1245-4e28-9fd8-3162e52a5767</identifier>
          <identifier>https://vbn.aau.dk/ws/files/272422551/45_155_5_PB.pdf</identifier>
          <identifier>http://pub.sinnergiak.org/index.php/esir/article/view/45/26</identifier>
          <source>Pel , B , Dorland , J , Wittmayer , J &amp; Jørgensen , M S 2017 , ' Detecting Social Innovation agency : Methodological reflections on units of analysis in dispersed transformation processes ' , European Public &amp; Social Innovation Review , vol. 2 , no. 1 , pp. 110-126 .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/613169</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/62df0535-5ede-4f22-9b1b-6d23fedbf999</identifier>
        <datestamp>2020-02-21T02:22:54Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Vibrotactile and Vibroacoustic Communications:Pairs in Interaction and Play. An Interactive Structure and Bodies in an Urban Environment</title>
          <creator>Morrison, Ann</creator>
          <creator>Manresa, Cristina</creator>
          <creator>Knoche, Hendrik</creator>
          <creator>Jensen, Brian Walther Skovgaard</creator>
          <subject>Pairs interacting</subject>
          <subject>vibroacoustic</subject>
          <subject>play</subject>
          <subject>communication</subject>
          <subject>haptic patterns</subject>
          <subject>The Humming Wall</subject>
          <subject>wearable computing</subject>
          <subject>vibrotactile</subject>
          <subject>connection</subject>
          <subject>vibrotactile vest</subject>
          <description xml:lang="eng">We designed a vibrotactile vest and The Humming Wall, a vibroacoustic interactive furniture set in an urban environment to interact with each other. We developed the vibrotactile patterns in the vest as a form of vibrotactile language to convey information to the wearer. In addition, we designed a set of interactive movements on The Humming Wall that would trigger patterns on the vest and elicit sensations and encourage body movements onto the wearer’s body. We invited people to interact in pairs at The Humming Wall, with one at the wall and one wearing the vest (they later swapped roles). Actions by the one at the wall, such as swiping or knocking on the wall were repeated on the vest wearer’s body. In addition, participants could ‘feel’ (vibroacoustically) and hear their own heartbeats and breath rates at the wall. Methods: We conducted a field trial with 39 participants over a 5-week period. Participants wearing the vest (and their pair) completed a set of tasks. We logged use and responses, recorded all activities on video, and conducted post-experiment interviews and questionnaires. Results: The results depicted the participants’ experience, communication and connection while wearing the vibrotactile vest and interacting with the wall. The findings show convincing, strong and positive responses to novel interactions between the responsive vibroacoustic environment and the vibrotactile vest. Conclusions: This work constitutes the first field trial with people ‘working’ in pairs with a vibrotactile wearable responding to and driving vibroacoustic displays with an interactive vibroacoustic environment.</description>
          <date>2018-08-01</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/62df0535-5ede-4f22-9b1b-6d23fedbf999</identifier>
          <identifier>https://doi.org/10.1007/s10209-017-0598-9</identifier>
          <identifier>http://www.scopus.com/inward/record.url?scp=85035082931&amp;partnerID=8YFLogxK</identifier>
          <source>Morrison , A , Manresa , C , Knoche , H &amp; Jensen , B W S 2018 , ' Vibrotactile and Vibroacoustic Communications : Pairs in Interaction and Play. An Interactive Structure and Bodies in an Urban Environment ' , Universal Access in the Information Society , vol. 17 , no. 3 , pp. 585-605 . https://doi.org/10.1007/s10209-017-0598-9</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/ 601139</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:1615-5289</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/18757e81-028a-4105-93c4-bb557ee90ab1</identifier>
        <datestamp>2020-02-14T22:32:52Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Generating new musical works in the style of Milton Babbitt</title>
          <creator>Bemman, Brian</creator>
          <creator>Meredith, David</creator>
          <subject>music</subject>
          <subject>computer music</subject>
          <subject>Milton Babbitt</subject>
          <subject>12-tone music</subject>
          <subject>Music analysis</subject>
          <subject>Algorithmic composition</subject>
          <description xml:lang="eng">Milton Babbitt is noted for composing twelve-tone and serial music that is both complex and highly constrained. He has written extensively on a variety of topics in music and his writings have had a profound and lasting impact on musical composition. In this article, we first review in detail his compositional process and the techniques he developed, focusing in particular on the all-partition array, time-point system, and equal-note-value strings used in his later works. Next, we describe our proposed procedure for automating his compositional process using these techniques. We conclude by using our procedure to automatically generate an entirely new musical work that we argue is in the style of Babbitt.</description>
          <date>2018-04-01</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/18757e81-028a-4105-93c4-bb557ee90ab1</identifier>
          <identifier>https://doi.org/10.1162/comj_a_00451</identifier>
          <source>Bemman , B &amp; Meredith , D 2018 , ' Generating new musical works in the style of Milton Babbitt ' , Computer Music Journal , vol. 42 , no. 1 , pp. 60-79 . https://doi.org/10.1162/comj_a_00451</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/610859</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:0148-9267</ns2:isPartOf>
          <ns4:funder xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/">EU Seventh Framework Programme (FP7)</ns4:funder>
          <ns4:projectid xmlns:ns4="http://docs.rioxx.net/schema/v1.0/rioxxterms/"></ns4:projectid>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/6d000357-5a0a-415d-b908-59fc0ac3b5b2</identifier>
        <datestamp>2020-03-18T03:30:15Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Generalization of orientation trajectories and force-torque profiles for robotic assembly</title>
          <creator>Kramberger, Aljaž</creator>
          <creator>Gams, Andrej</creator>
          <creator>Nemec, Bojan</creator>
          <creator>Chrysostomou, Dimitrios</creator>
          <creator>Madsen, Ole</creator>
          <creator>Ude, Aleš</creator>
          <subject>Programming by demonstration</subject>
          <subject>Trajectory adaptation</subject>
          <subject>Trajectory generalization</subject>
          <date>2017-12-01</date>
          <type>article</type>
          <identifier>https://vbn.aau.dk/da/publications/6d000357-5a0a-415d-b908-59fc0ac3b5b2</identifier>
          <identifier>https://doi.org/10.1016/j.robot.2017.09.019</identifier>
          <identifier>http://www.scopus.com/inward/record.url?scp=85032262612&amp;partnerID=8YFLogxK</identifier>
          <source>Kramberger , A , Gams , A , Nemec , B , Chrysostomou , D , Madsen , O &amp; Ude , A 2017 , ' Generalization of orientation trajectories and force-torque profiles for robotic assembly ' , Robotics and Autonomous Systems , vol. 98 , pp. 333-346 . https://doi.org/10.1016/j.robot.2017.09.019</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/600578</relation>
          <rights>info:eu-repo/semantics/closedAccess</rights>
          <ns2:isPartOf>urn:ISSN:0921-8890</ns2:isPartOf>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/0ae5307e-3fce-422e-b4eb-96a7ef955efb</identifier>
        <datestamp>2019-01-07T06:13:45Z</datestamp>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">WP4 CASE STUDY Report: Living Knowledge</title>
          <creator>Dorland, Jens</creator>
          <creator>Jørgensen, Michael Søgaard</creator>
          <subject>Science shops</subject>
          <subject>Social innovation</subject>
          <subject>Transformation</subject>
          <subject>University</subject>
          <subject>Empowerment</subject>
          <subject>Civil society</subject>
          <subject>Research strategy</subject>
          <description xml:lang="eng">Science Shops can be regarded as a platform for bringing together scientific analytical principles on the one hand, and the lay persons’ (with or without scientific background) knowledge about the issue on the other, thus contributing theoretically based systemization of lay knowledge or problem conception and lay insights on perceived problems to science. Science shops are an interesting entity to study to see what kind of long-term impacts they have implied as an initiative which has been running since the 80’ties, and how CSO’s have been empowered through the relationship with the university.</description>
          <publisher>Bæredygtig Design og Omstilling, Institut for Planlægnng, AAU</publisher>
          <date>2016-11</date>
          <type>book</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/0ae5307e-3fce-422e-b4eb-96a7ef955efb</identifier>
          <identifier>https://vbn.aau.dk/ws/files/267436208/282_Case_study_report_Science_Shops_Batch1_final2.pdf</identifier>
          <identifier>http://www.transitsocialinnovation.eu/content/original/Book%20covers/Local%20PDFs/282%20Case%20study%20report%20Science%20Shops%20Batch1%20final2.pdf</identifier>
          <source>Dorland , J &amp; Jørgensen , M S 2016 , WP4 CASE STUDY Report: Living Knowledge . Bæredygtig Design og Omstilling, Institut for Planlægnng, AAU .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/613169</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/1a7cab4e-b7d5-4393-8ff6-b871171bf71d</identifier>
        <datestamp>2019-01-07T06:14:15Z</datestamp>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">WP4 Case study Report:INFORSE</title>
          <creator>Elle, Morten</creator>
          <creator>van Gameren, Valentine</creator>
          <creator>Pel, Bonno</creator>
          <creator>Aagaard, Henriette Kjær</creator>
          <creator>Jørgensen, Michael Søgaard</creator>
          <subject>Energy movement</subject>
          <subject>Social innovation</subject>
          <subject>Transformation</subject>
          <subject>Empowerment</subject>
          <subject>sustainable transition</subject>
          <subject>Renewable energy</subject>
          <description xml:lang="eng">The INFORSE case consists of an analysis of the transnational network INFORSE (International Network for Sustainable Energy), the Danish local initiative VE and the Belgian local initiative APERe. All three are dealing with renewable energy and energy savings. The link between INFORSE and VE is strong, whereas there is almost no contact between INFORSE and its Belgian member APERe. The three parts are summarised in the following. This is followed by a short summarising conclusion concering what we learn about how social innovation interacts with other forms of transformative change from the INFORSE case.&lt;br/&gt;</description>
          <publisher>Transformative social innovation theory</publisher>
          <date>2015</date>
          <type>book</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/1a7cab4e-b7d5-4393-8ff6-b871171bf71d</identifier>
          <identifier>https://vbn.aau.dk/ws/files/267437304/250_TRANSIT_Case_Report_INFORSE_Final.pdf</identifier>
          <identifier>http://www.transitsocialinnovation.eu/content/original/Book%20covers/Local%20PDFs/250%20TRANSIT%20Case%20Report%20-%20INFORSE%20-%20Final.pdf</identifier>
          <source>Elle , M , van Gameren , V , Pel , B , Aagaard , H K &amp; Jørgensen , M S 2015 , WP4 Case study Report : INFORSE . Transformative social innovation theory .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/613169</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <record>
      <header>
        <identifier>oai:pure.atira.dk:ec_fundedresources/ff87f80a-a9f1-4962-ab9e-2d529a40f2fc</identifier>
        <datestamp>2019-01-07T06:14:09Z</datestamp>
        <setSpec>ec_fundedresources</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:ns2="http://purl.org/dc/terms/">
          <title xml:lang="eng">Characterisation and comparison of case study findings – Batch 1 cases:Deliverable 4.2</title>
          <creator>Jørgensen, Michael Søgaard</creator>
          <creator>Dorland, Jens</creator>
          <creator>Pel, Bonno</creator>
          <creator>Wittmayer, Julia</creator>
          <subject>Social innovation</subject>
          <subject>Transformation</subject>
          <subject>Empowerment</subject>
          <subject>Coproduction</subject>
          <description xml:lang="eng">This report gives an overview and a comparative analysis of the findings from the 12 first case study reports in TRANSIT about aspects of transformative social innovation (TSI). Each of the 12 reports, on which the report is based, includes an analysis of a transnational social innovation network and at least two local social innovation initiatives.</description>
          <publisher>Transformative social innovation theory</publisher>
          <date>2015</date>
          <type>book</type>
          <format>application/pdf</format>
          <identifier>https://vbn.aau.dk/da/publications/ff87f80a-a9f1-4962-ab9e-2d529a40f2fc</identifier>
          <identifier>https://vbn.aau.dk/ws/files/267437968/157_D4_2_Comparative_analysis_17_04_2015.pdf</identifier>
          <identifier>http://www.transitsocialinnovation.eu/content/original/Book%20covers/Local%20PDFs/157%20D4%202%20Comparative%20analysis%2017%2004%202015.pdf</identifier>
          <source>Jørgensen , M S , Dorland , J , Pel , B &amp; Wittmayer , J 2015 , Characterisation and comparison of case study findings – Batch 1 cases : Deliverable 4.2 . Transformative social innovation theory .</source>
          <language>eng</language>
          <relation>info:eu-repo/grantAgreement/EC/FP7/613169</relation>
          <rights>info:eu-repo/semantics/openAccess</rights>
        </oai_dc:dc>
      </metadata>
    </record>
    <resumptionToken cursor="0" completeListSize="113">oai_dc/113/330595648/100/0/267437964/ec_fundedresources/x/x</resumptionToken>
  </ListRecords>
</OAI-PMH>
