@article{AbdelwahabLandwehr2022,
  author    = {Abdelwahab, Ahmed and Landwehr, Niels},
  title     = {Deep Distributional Sequence Embeddings Based on a Wasserstein Loss},
  series = {Neural processing letters},
  journal   = {Neural processing letters},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {1370-4621},
  doi       = {10.1007/s11063-022-10784-y},
  pages     = {21},
  year      = {2022},
  abstract  = {Deep metric learning employs deep neural networks to embed instances into a metric space such that distances between instances of the same class are small and distances between instances from different classes are large. In most existing deep metric learning techniques, the embedding of an instance is given by a feature vector produced by a deep neural network and Euclidean distance or cosine similarity defines distances between these vectors. This paper studies deep distributional embeddings of sequences, where the embedding of a sequence is given by the distribution of learned deep features across the sequence. The motivation for this is to better capture statistical information about the distribution of patterns within the sequence in the embedding. When embeddings are distributions rather than vectors, measuring distances between embeddings involves comparing their respective distributions. The paper therefore proposes a distance metric based on Wasserstein distances between the distributions and a corresponding loss function for metric learning, which leads to a novel end-to-end trainable embedding model. We empirically observe that distributional embeddings outperform standard vector embeddings and that training with the proposed Wasserstein metric outperforms training with other distance functions.},
  language  = {en}
}
@article{AbuJarour2010,
  author    = {AbuJarour, Mohammed},
  title     = {Information integration in services computing},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{AfantenosPeldszusStede2018,
  author    = {Afantenos, Stergos and Peldszus, Andreas and Stede, Manfred},
  title     = {Comparing decoding mechanisms for parsing argumentative structures},
  series = {Argument \& Computation},
  volume    = {9},
  journal   = {Argument \& Computation},
  number    = {3},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {1946-2166},
  doi       = {10.3233/AAC-180033},
  pages     = {177 -- 192},
  year      = {2018},
  abstract  = {Parsing of argumentative structures has become a very active line of research in recent years. Like discourse parsing or any other natural language task that requires prediction of linguistic structures, most approaches choose to learn a local model and then perform global decoding over the local probability distributions, often imposing constraints that are specific to the task at hand. Specifically for argumentation parsing, two decoding approaches have been recently proposed: Minimum Spanning Trees (MST) and Integer Linear Programming (ILP), following similar trends in discourse parsing. In contrast to discourse parsing though, where trees are not always used as underlying annotation schemes, argumentation structures so far have always been represented with trees. Using the 'argumentative microtext corpus' [in: Argumentation and Reasoned Action: Proceedings of the 1st European Conference on Argumentation, Lisbon 2015 / Vol. 2, College Publications, London, 2016, pp. 801-815] as underlying data and replicating three different decoding mechanisms, in this paper we propose a novel ILP decoder and an extension to our earlier MST work, and then thoroughly compare the approaches. The result is that our new decoder outperforms related work in important respects, and that in general, ILP and MST yield very similar performance.},
  language  = {en}
}
@article{AguadoCabalarFandinnoetal.2019,
  author    = {Aguado, Felicidad and Cabalar, Pedro and Fandinno, Jorge and Pearce, David and Perez, Gilberto and Vidal, Concepcion},
  title     = {Forgetting auxiliary atoms in forks},
  series = {Artificial intelligence},
  volume    = {275},
  journal   = {Artificial intelligence},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2019.07.005},
  pages     = {575 -- 601},
  year      = {2019},
  abstract  = {In this work we tackle the problem of checking strong equivalence of logic programs that may contain local auxiliary atoms, to be removed from their stable models and to be forbidden in any external context. We call this property projective strong equivalence (PSE). It has been recently proved that not any logic program containing auxiliary atoms can be reformulated, under PSE, as another logic program or formula without them - this is known as strongly persistent forgetting. In this paper, we introduce a conservative extension of Equilibrium Logic and its monotonic basis, the logic of Here-and-There, in which we deal with a new connective '|' we call fork. We provide a semantic characterisation of PSE for forks and use it to show that, in this extension, it is always possible to forget auxiliary atoms under strong persistence. We further define when the obtained fork is representable as a regular formula.},
  language  = {en}
}
@article{AguadoCabalarFandinoetal.2019,
  author    = {Aguado, Felicidad and Cabalar, Pedro and Fandi{\~n}o, Jorge and Pearce, David and Perez, Gilberto and Vidal-Peracho, Concepcion},
  title     = {Revisiting Explicit Negation in Answer Set Programming},
  series = {Theory and practice of logic programming},
  volume    = {19},
  journal   = {Theory and practice of logic programming},
  number    = {5-6},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068419000267},
  pages     = {908 -- 924},
  year      = {2019},
  language  = {en}
}
@article{AhmadShoaibPrinetto2015,
  author    = {Ahmad, Nadeem and Shoaib, Umar and Prinetto, Paolo},
  title     = {Usability of Online Assistance From Semiliterate Users' Perspective},
  series = {International journal of human computer interaction},
  volume    = {31},
  journal   = {International journal of human computer interaction},
  number    = {1},
  publisher = {Taylor \& Francis Group},
  address   = {Philadelphia},
  issn      = {1044-7318},
  doi       = {10.1080/10447318.2014.925772},
  pages     = {55 -- 64},
  year      = {2015},
  language  = {en}
}
@article{AlLabanRegerLucke2022,
  author    = {Al Laban, Firas and Reger, Martin and Lucke, Ulrike},
  title     = {Closing the Policy Gap in the Academic Bridge},
  series = {Education sciences},
  volume    = {12},
  journal   = {Education sciences},
  number    = {12},
  publisher = {MDPI},
  address   = {Basel},
  issn      = {2227-7102},
  doi       = {10.3390/educsci12120930},
  year      = {2022},
  abstract  = {The highly structured nature of the educational sector demands effective policy mechanisms close to the needs of the field. That is why evidence-based policy making, endorsed by the European Commission under Erasmus+ Key Action 3, aims to make an alignment between the domains of policy and practice. Against this background, this article addresses two issues: First, that there is a vertical gap in the translation of higher-level policies to local strategies and regulations. Second, that there is a horizontal gap between educational domains regarding the policy awareness of individual players. This was analyzed in quantitative and qualitative studies with domain experts from the fields of virtual mobility and teacher training. From our findings, we argue that the combination of both gaps puts the academic bridge from secondary to tertiary education at risk, including the associated knowledge proficiency levels. We discuss the role of digitalization in the academic bridge by asking the question: which value does the involved stakeholders expect from educational policies? As a theoretical basis, we rely on the model of value co-creation for and by stakeholders. We describe the used instruments along with the obtained results and proposed benefits. Moreover, we reflect on the methodology applied, and we finally derive recommendations for future academic bridge policies.},
  language  = {en}
}
@article{AlSaffar2013,
  author    = {Al-Saffar, Loay Talib Ahmed},
  title     = {Where girls take the role of boys in CS},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-65034},
  pages     = {149 -- 154},
  year      = {2013},
  abstract  = {A survey has been carried out in the Computer Science (CS) department at the University of Baghdad to investigate the attitudes of CS students in a female dominant environment, showing the differences between male and female students in different academic years. We also compare the attitudes of the freshman students of two different cultures (University of Baghdad, Iraq, and the University of Potsdam).},
  language  = {en}
}
@article{Alnemr2010,
  author    = {Alnemr, Rehab},
  title     = {Context-aware Reputation in SOA and future internet},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{AndjelkovicSimevskiChenetal.2022,
  author    = {Andjelkovic, Marko and Simevski, Aleksandar and Chen, Junchao and Schrape, Oliver and Stamenkovic, Zoran and Krstić, Miloš and Ilic, Stefan and Ristic, Goran and Jaksic, Aleksandar and Vasovic, Nikola and Duane, Russell and Palma, Alberto J. and Lallena, Antonio M. and Carvajal, Miguel A.},
  title     = {A design concept for radiation hardened RADFET readout system for space applications},
  series = {Microprocessors and microsystems},
  volume    = {90},
  journal   = {Microprocessors and microsystems},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0141-9331},
  doi       = {10.1016/j.micpro.2022.104486},
  pages     = {18},
  year      = {2022},
  abstract  = {Instruments for measuring the absorbed dose and dose rate under radiation exposure, known as radiation dosimeters, are indispensable in space missions. They are composed of radiation sensors that generate current or voltage response when exposed to ionizing radiation, and processing electronics for computing the absorbed dose and dose rate. Among a wide range of existing radiation sensors, the Radiation Sensitive Field Effect Transistors (RADFETs) have unique advantages for absorbed dose measurement, and a proven record of successful exploitation in space missions. It has been shown that the RADFETs may be also used for the dose rate monitoring. In that regard, we propose a unique design concept that supports the simultaneous operation of a single RADFET as absorbed dose and dose rate monitor. This enables to reduce the cost of implementation, since the need for other types of radiation sensors can be minimized or eliminated. For processing the RADFET's response we propose a readout system composed of analog signal conditioner (ASC) and a self-adaptive multiprocessing system-on-chip (MPSoC). The soft error rate of MPSoC is monitored in real time with embedded sensors, allowing the autonomous switching between three operating modes (high-performance, de-stress and fault-tolerant), according to the application requirements and radiation conditions.},
  language  = {en}
}