@misc{31485, author = {{Kramer, Paul}}, title = {{{On Transforming Lattice-Based Cryptography to the Ring Setting}}}, year = {{2022}}, } @inproceedings{31806, abstract = {{The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds}}, author = {{Dreßler, Kevin and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia}}, keywords = {{2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba}}, location = {{Barcelona (Spain)}}, title = {{{ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning}}}, doi = {{10.1145/3511095.3531287}}, year = {{2022}}, } @article{32854, author = {{Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}}, journal = {{IFAC-PapersOnLine}}, number = {{13}}, pages = {{133–138}}, publisher = {{Elsevier}}, title = {{{Practical Network Conditions for the Convergence of Distributed Optimization}}}, volume = {{55}}, year = {{2022}}, } @inproceedings{33253, author = {{Hansmeier, Tim and Brede, Mathis and Platzner, Marco}}, booktitle = {{GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion}}, location = {{Boston, MA, USA}}, pages = {{2071--2079}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion}}}, doi = {{10.1145/3520304.3533977}}, year = {{2022}}, } @inproceedings{33274, author = {{Chen, Wei-Fan and Chen, Mei-Hua and Mudgal, Garima and Wachsmuth, Henning}}, booktitle = {{Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)}}, pages = {{51 -- 61}}, title = {{{Analyzing Culture-Specific Argument Structures in Learner Essays}}}, year = {{2022}}, } @inproceedings{33491, author = {{Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}}, booktitle = {{30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}}, editor = {{Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}}, pages = {{77:1–77:13}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}}, title = {{{(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}}}, doi = {{10.4230/LIPIcs.ESA.2022.77}}, volume = {{244}}, year = {{2022}}, } @techreport{32106, abstract = {{We study the consequences of modeling asymmetric bargaining power in two-person bargaining problems. Comparing application of an asymmetric version of a bargaining solution to an upfront modification of the disagreement point, the resulting distortion crucially depends on the bargaining solution concept. While for the Kalai-Smorodinsky solution weaker players benefit from modifying the disagreement point, the situation is reversed for the Nash bargaining solution. There, weaker players are better off in the asymmetric bargaining solution. When comparing application of the asymmetric versions of the Nash and the Kalai-Smorodinsky solutions, we demonstrate that there is an upper bound for the weight of a player, so that she is better off with the Nash bargaining solution. This threshold is ultimately determined by the relative utilitarian bargaining solution. From a mechanism design perspective, our results provide valuable information for a social planner, when implementing a bargaining solution for unequally powerful players.}}, author = {{Haake, Claus-Jochen and Streck, Thomas}}, keywords = {{Asymmetric bargaining power, Nash bargaining solution, Kalai-Smorodinsky bargaining solution}}, pages = {{17}}, title = {{{Distortion through modeling asymmetric bargaining power}}}, volume = {{148}}, year = {{2022}}, } @inproceedings{34136, author = {{Grynko, Yevgen and Shkuratov, Yuriy and Alhaddad, Samer and Förstner, Jens}}, keywords = {{tet_topic_scattering}}, location = {{Granada, Spain}}, publisher = {{Copernicus GmbH}}, title = {{{Light backscattering from numerical analog of planetary regoliths}}}, doi = {{ 10.5194/epsc2022-151}}, year = {{2022}}, } @article{34132, abstract = {{How can Knowledge In/Equity be addressed in qualitative research by taking the idea of Open Science into account? Two projects from the Open Science Fellows Programme by Wikimedia Deutschland will be used to illustrate how Open Science practices can succeed in qualitative research, thereby reducing In/Equity. In this context, In/Equity is considered as a fair and equal representation of people, their knowledge and insights and comprehends questions about how epistemic, structural, institutional and personal biases generate and shape knowledge as guidance. Three questions guide this approach: firstly, what do we understand by In/Equity in the context of knowledge production in these projects? Secondly, who will be involved in knowledge generation and to what extent will they be valued or unvalued? Thirdly, how can data be made accessible for re-use to enable true participation and sharing?}}, author = {{Steinhardt, Isabel and Kruschick, Felicitas}}, issn = {{2367-7163}}, journal = {{Research Ideas and Outcomes}}, keywords = {{Open Science, Knowledge Equity, Qualitative Methods}}, publisher = {{Pensoft Publishers}}, title = {{{Knowledge Equity and Open Science in qualitative research – Practical research considerations}}}, doi = {{10.3897/rio.8.e86387}}, volume = {{8}}, year = {{2022}}, } @article{32088, abstract = {{Subwavelength dielectric resonators assembled into metasurfaces have become a versatile tool for miniaturizing optical components approaching the nanoscale. An important class of metasurface functionalities is associated with asymmetry in both the generation and transmission of light with respect to reversals of the positions of emitters and receivers. The nonlinear light–matter interaction in metasurfaces offers a promising pathway towards miniaturization of the asymmetric control of light. Here we demonstrate asymmetric parametric generation of light in nonlinear metasurfaces. We assemble dissimilar nonlinear dielectric resonators into translucent metasurfaces that produce images in the visible spectral range on being illuminated by infrared radiation. By design, the metasurfaces produce different and completely independent images for the reversed direction of illumination, that is, when the positions of the infrared emitter and the visible light receiver are exchanged. Nonlinearity-enabled asymmetric control of light by subwavelength resonators paves the way towards novel nanophotonic components via dense integration of large quantities of nonlinear resonators into compact metasurface designs.}}, author = {{Kruk, Sergey S. and Wang, Lei and Sain, Basudeb and Dong, Zhaogang and Yang, Joel and Zentgraf, Thomas and Kivshar, Yuri}}, issn = {{1749-4885}}, journal = {{Nature Photonics}}, keywords = {{Atomic and Molecular Physics, and Optics, Electronic, Optical and Magnetic Materials}}, pages = {{561–565}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Asymmetric parametric generation of images with nonlinear dielectric metasurfaces}}}, doi = {{10.1038/s41566-022-01018-7}}, volume = {{16}}, year = {{2022}}, }