@inproceedings{32509,
  abstract     = {{ We consider fact-checking approaches that aim to predict the veracity of assertions in knowledge graphs. Five main categories of fact-checking approaches for knowledge graphs have been proposed in the recent literature, of
which each is subject to partially overlapping limitations. In particular, current text-based approaches are limited by manual feature engineering. Path-based and rule-based approaches are limited by their exclusive use of knowledge graphs as background knowledge, and embedding-based approaches suffer from low accuracy scores on current fact-checking tasks. We propose a hybrid approach—dubbed HybridFC—that exploits the diversity of existing categories of fact-checking approaches within an ensemble learning setting to achieve a significantly better prediction performance. In particular, our approach outperforms the state of the art by 0.14 to 0.27 in terms of Area Under the Receiver Operating Characteristic curve on the FactBench dataset. Our code is open-source and can be found at https://github.com/dice-group/HybridFC.}},
  author       = {{Qudus, Umair and Röder, Michael and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web -- ISWC 2022}},
  editor       = {{Sattler, Ulrike and Hogan, Aidan and Keet, Maria and Presutti, Valentina}},
  isbn         = {{978-3-031-19433-7}},
  keywords     = {{fact checking · ensemble learning · knowledge graph veracit}},
  location     = {{Hanghzou, China}},
  pages        = {{462----480}},
  publisher    = {{Springer International Publishing}},
  title        = {{{HybridFC: A Hybrid Fact-Checking Approach for Knowledge Graphs}}},
  doi          = {{10.1007/978-3-031-19433-7_27}},
  year         = {{2022}},
}

@article{34230,
  abstract     = {{We present the design and experimental characterization of a silicon nitride pulse interleaver based on coupled resonator optical waveguide filters. In order to achieve a targeted free spectral range of 1.44 THz, which is large given the reduced optical confinement of the silicon nitride platform, individual ring resonators are designed with tapered waveguides. Its application to time-interleaved photonically-assisted ADCs is analyzed by combining experimental characterization of the photonic integrated circuit with a comprehensive model of the entire ADC. The impact of fundamental signal distortion and noise sources affecting the converter is investigated and suitable equalization techniques at the digital signal processing level are evaluated. The novel application of a simple but powerful equalization filter in the DSP domain allows for a significant improvement of the digitized signal SNR. An ENOB of 5 over a 75 GHz bandwidth (150 GS/s) and an ENOB of 4.3 over a 100 GHz bandwidth (200 GS/s) are expected to be achievable with compact and off-the-shelf single-section semiconductor mode locked lasers, that can be further improved with lower noise light sources.}},
  author       = {{Zazzi, Andrea and Müller, Juliana and Ghannam, Ibrahim and Battermann, Moritz and Rajeswari, Gayatri Vasudevan and Weizel, Maxim and Scheytt, J. Christoph and Witzens, Jeremy}},
  issn         = {{1094-4087}},
  journal      = {{Optics Express}},
  number       = {{3}},
  publisher    = {{Optica Publishing Group}},
  title        = {{{Wideband SiN pulse interleaver for optically-enabled analog-to-digital conversion: a device-to-system analysis with cyclic equalization}}},
  doi          = {{10.1364/oe.441406}},
  volume       = {{30}},
  year         = {{2022}},
}

@article{34239,
  author       = {{Bahmanian, Meysam and Scheytt, J. Christoph}},
  issn         = {{0018-9480}},
  journal      = {{IEEE Transactions on Microwave Theory and Techniques}},
  number       = {{10}},
  pages        = {{4422--4435}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{Noise Processes and Nonlinear Mechanisms in Optoelectronic Phase-Locked Loop Using a Balanced Optical Microwave Phase Detector}}},
  doi          = {{10.1109/tmtt.2022.3197621}},
  volume       = {{70}},
  year         = {{2022}},
}

@article{30511,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Many critical codebases are written in C, and most of them use preprocessor directives to encode variability, effectively encoding software product lines. These preprocessor directives, however, challenge any static code analysis. SPLlift, a previously presented approach for analyzing software product lines, is limited to Java programs that use a rather simple feature encoding and to analysis problems with a finite and ideally small domain. Other approaches that allow the analysis of real-world C software product lines use special-purpose analyses, preventing the reuse of existing analysis infrastructures and ignoring the progress made by the static analysis community. This work presents <jats:sc>VarAlyzer</jats:sc>, a novel static analysis approach for software product lines. <jats:sc>VarAlyzer</jats:sc> first transforms preprocessor constructs to plain C while preserving their variability and semantics. It then solves any given distributive analysis problem on transformed product lines in a variability-aware manner. <jats:sc>VarAlyzer</jats:sc> ’s analysis results are annotated with feature constraints that encode in which configurations each result holds. Our experiments with 95 compilation units of OpenSSL show that applying <jats:sc>VarAlyzer</jats:sc> enables one to conduct inter-procedural, flow-, field- and context-sensitive data-flow analyses on entire product lines for the first time, outperforming the product-based approach for highly-configurable systems.</jats:p>}},
  author       = {{Schubert, Philipp and Gazzillo, Paul and Patterson, Zach and Braha, Julian and Schiebel, Fabian Benedikt and Hermann, Ben and Wei, Shiyi and Bodden, Eric}},
  issn         = {{0928-8910}},
  journal      = {{Automated Software Engineering}},
  keywords     = {{inter-procedural static analysis, software product lines, preprocessor, LLVM, C/C++}},
  number       = {{1}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Static data-flow analysis for software product lines in C}}},
  doi          = {{10.1007/s10515-022-00333-1}},
  volume       = {{29}},
  year         = {{2022}},
}

@article{30210,
  abstract     = {{Lithium niobate on insulator (LNOI) has a great potential for photonic integrated circuits, providing substantial versatility in design of various integrated components. To properly use these components in the implementation of different quantum protocols, photons with different properties are required. In this paper, we theoretically demonstrate a flexible source of correlated photons built on the LNOI waveguide of a special geometry. This source is based on the parametric down-conversion (PDC) process, in which the signal and idler photons are generated at the telecom wavelength and have different spatial profiles and polarizations, but the same group velocities. Distinguishability in polarizations and spatial profiles facilitates the routing and manipulating individual photons, while the equality of their group velocities leads to the absence of temporal walk-off between photons. We show how the spectral properties of the generated photons and the number of their frequency modes can be controlled depending on the pump characteristics and the waveguide length. Finally, we discuss special regimes, in which narrowband light with strong frequency correlations and polarization-entangled Bell states are generated at the telecom wavelength.}},
  author       = {{Ebers, Lena and Ferreri, Alessandro and Hammer, Manfred and Albert, Maximilian and Meier, Cedrik and Förstner, Jens and Sharapova, Polina R.}},
  issn         = {{2515-7647}},
  journal      = {{Journal of Physics: Photonics}},
  keywords     = {{tet_topic_waveguide}},
  pages        = {{025001}},
  publisher    = {{IOP Publishing}},
  title        = {{{Flexible source of correlated photons based on LNOI rib waveguides}}},
  doi          = {{10.1088/2515-7647/ac5a5b}},
  volume       = {{4}},
  year         = {{2022}},
}

@inproceedings{40212,
  author       = {{Haucke-Korber, Barnabas and Schenke, Maximilian and Wallscheid, Oliver}},
  booktitle    = {{IKMT 2022; 13. GMM/ETG-Symposium}},
  pages        = {{1--6}},
  title        = {{{Reinforcement Learning-Based Deep Q Direct Torque Control with Adaptable Switching Frequency Towards Six-Step Operation of Permanent Magnet Synchronous Motors}}},
  year         = {{2022}},
}

@inproceedings{6553,
  author       = {{Claes, Leander and Feldmann, Nadine and Schulze, Veronika and Jurgelucks, Benjamin and Walther, Andrea and Henning, Bernd}},
  booktitle    = {{Fortschritte der Akustik - DAGA 2022}},
  location     = {{Stuttgart}},
  pages        = {{1326--1329}},
  title        = {{{Identification of piezoelectric material parameters using optimised multi-electrode specimens}}},
  year         = {{2022}},
}

@misc{6558,
  author       = {{Friesen, Olga and Claes, Leander and Feldmann, Nadine and Henning, Bernd}},
  title        = {{{Estimation of piezoelectric material parameters of ring-shaped specimens}}},
  year         = {{2022}},
}

@article{51385,
  author       = {{Hilgert, Joachim and Weich, Tobias and Bux, K.-U.}},
  journal      = {{J. of Spectral Theory}},
  pages        = {{659--681}},
  title        = {{{Poisson transforms for trees of bounded degree}}},
  volume       = {{12}},
  year         = {{2022}},
}

@inproceedings{27160,
  abstract     = {{We study the complexity of problems solvable in deterministic polynomial time
with access to an NP or Quantum Merlin-Arthur (QMA)-oracle, such as $P^{NP}$
and $P^{QMA}$, respectively. The former allows one to classify problems more
finely than the Polynomial-Time Hierarchy (PH), whereas the latter
characterizes physically motivated problems such as Approximate Simulation
(APX-SIM) [Ambainis, CCC 2014]. In this area, a central role has been played by
the classes $P^{NP[\log]}$ and $P^{QMA[\log]}$, defined identically to $P^{NP}$
and $P^{QMA}$, except that only logarithmically many oracle queries are
allowed. Here, [Gottlob, FOCS 1993] showed that if the adaptive queries made by
a $P^{NP}$ machine have a "query graph" which is a tree, then this computation
can be simulated in $P^{NP[\log]}$.
  In this work, we first show that for any verification class
$C\in\{NP,MA,QCMA,QMA,QMA(2),NEXP,QMA_{\exp}\}$, any $P^C$ machine with a query
graph of "separator number" $s$ can be simulated using deterministic time
$\exp(s\log n)$ and $s\log n$ queries to a $C$-oracle. When $s\in O(1)$ (which
includes the case of $O(1)$-treewidth, and thus also of trees), this gives an
upper bound of $P^{C[\log]}$, and when $s\in O(\log^k(n))$, this yields bound
$QP^{C[\log^{k+1}]}$ (QP meaning quasi-polynomial time). We next show how to
combine Gottlob's "admissible-weighting function" framework with the
"flag-qubit" framework of [Watson, Bausch, Gharibian, 2020], obtaining a
unified approach for embedding $P^C$ computations directly into APX-SIM
instances in a black-box fashion. Finally, we formalize a simple no-go
statement about polynomials (c.f. [Krentel, STOC 1986]): Given a multi-linear
polynomial $p$ specified via an arithmetic circuit, if one can "weakly
compress" $p$ so that its optimal value requires $m$ bits to represent, then
$P^{NP}$ can be decided with only $m$ queries to an NP-oracle.}},
  author       = {{Gharibian, Sevag and Rudolph, Dorian}},
  booktitle    = {{13th Innovations in Theoretical Computer Science (ITCS 2022)}},
  number       = {{75}},
  pages        = {{1--27}},
  title        = {{{On polynomially many queries to NP or QMA oracles}}},
  doi          = {{10.4230/LIPIcs.ITCS.2022.75}},
  volume       = {{215}},
  year         = {{2022}},
}

@article{24721,
  author       = {{Fathi Ahmed, Abdullah and Ahmed Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}},
  journal      = {{Data Knowl. Eng.}},
  pages        = {{101874}},
  title        = {{{Multilingual Verbalization and Summarization for Explainable Link Discovery}}},
  doi          = {{10.1016/j.datak.2021.101874}},
  volume       = {{133}},
  year         = {{2021}},
}

@inproceedings{24722,
  author       = {{Röder, Michael and Frerk, Philip and Conrads, Felix and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web - 18th International Conference, {ESWC} 2021, Virtual Event, June 6-10, 2021, Proceedings}},
  editor       = {{Verborgh, Ruben and Hose, Katja and Paulheim, Heiko and Champin, Pierre-Antoine and Maleshkova, Maria and Corcho, Oscar and Ristoski, Petar and Alam, Mehwish}},
  pages        = {{93--108}},
  publisher    = {{Springer}},
  title        = {{{Applying Grammar-Based Compression to RDF}}},
  doi          = {{10.1007/978-3-030-77385-4\_6}},
  volume       = {{12731}},
  year         = {{2021}},
}

@inproceedings{24723,
  author       = {{Ali, Manzoor and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers}},
  editor       = {{Verborgh, Ruben and Dimou, Anastasia and Hogan, Aidan and d'Amato, Claudia and Tiddi, Ilaria and Br{\"{o}}ring, Arne and Maier, Simon and Ongenae, Femke and Tommasini, Riccardo and Alam, Mehwish}},
  pages        = {{136--140}},
  publisher    = {{Springer}},
  title        = {{{Unsupervised Relation Extraction Using Sentence Encoding}}},
  doi          = {{10.1007/978-3-030-80418-3\_25}},
  volume       = {{12739}},
  year         = {{2021}},
}

@inproceedings{24724,
  author       = {{Ali, Manzoor and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers}},
  editor       = {{Verborgh, Ruben and Dimou, Anastasia and Hogan, Aidan and d'Amato, Claudia and Tiddi, Ilaria and Br{\"{o}}ring, Arne and Maier, Simon and Ongenae, Femke and Tommasini, Riccardo and Alam, Mehwish}},
  pages        = {{136--140}},
  publisher    = {{Springer}},
  title        = {{{Unsupervised Relation Extraction Using Sentence Encoding}}},
  doi          = {{10.1007/978-3-030-80418-3\_25}},
  volume       = {{12739}},
  year         = {{2021}},
}

@inproceedings{24725,
  author       = {{Shahzad, Moemmur and Amin, Ayesha and Esteves, Diego and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, North Miami Beach, Florida, USA, May 17-19, 2021}},
  editor       = {{Bell, Eric and Keshtkar, Fazel}},
  title        = {{{InferNER: an attentive model leveraging the sentence-level information for Named Entity Recognition in Microblogs}}},
  doi          = {{10.32473/flairs.v34i1.128538}},
  year         = {{2021}},
}

@inproceedings{24726,
  author       = {{Röder, Michael and Thuy Sy Nguyen, Pham and Conrads, Felix and Alexandra Morim da Silva, Ana and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}},
  pages        = {{62--69}},
  publisher    = {{{IEEE}}},
  title        = {{{Lemming - Example-based Mimicking of Knowledge Graphs}}},
  doi          = {{10.1109/ICSC50631.2021.00015}},
  year         = {{2021}},
}

@inproceedings{24727,
  author       = {{Amer Desouki, Abdelmoneim and Conrads, Felix and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}},
  pages        = {{76--79}},
  publisher    = {{{IEEE}}},
  title        = {{{SYNTHG: Mimicking RDF Graphs Using Tensor Factorization}}},
  doi          = {{10.1109/ICSC50631.2021.00017}},
  year         = {{2021}},
}

@inproceedings{24728,
  author       = {{Demir, Caglar and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}},
  pages        = {{179--182}},
  publisher    = {{{IEEE}}},
  title        = {{{A shallow neural model for relation prediction}}},
  doi          = {{10.1109/ICSC50631.2021.00038}},
  year         = {{2021}},
}

@inproceedings{24729,
  author       = {{G. Athreya, Ram and Kona Bansal, Srividya and Ngonga Ngomo, Axel-Cyrille and Usbeck, Ricardo}},
  booktitle    = {{15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}},
  pages        = {{195--198}},
  publisher    = {{{IEEE}}},
  title        = {{{Template-based Question Answering using Recursive Neural Networks}}},
  doi          = {{10.1109/ICSC50631.2021.00041}},
  year         = {{2021}},
}

@inproceedings{24730,
  author       = {{Jalota, Rricha and Vollmers, Daniel and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}},
  pages        = {{221--226}},
  publisher    = {{{IEEE}}},
  title        = {{{LAUREN - Knowledge Graph Summarization for Question Answering}}},
  doi          = {{10.1109/ICSC50631.2021.00047}},
  year         = {{2021}},
}