@inproceedings{40696, author = {{Smirnov, S. and Eguizabal, A.}}, booktitle = {{2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage}}, title = {{{DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS}}}, year = {{2018}}, } @inproceedings{40706, author = {{Lameiro, Christian and Santamaria, Ignacio and Schreier, Peter J.}}, booktitle = {{Proc. IEEE Wireless Comm. Networking Conf. (WCNC)}}, title = {{{Performance analysis of maximally improper signaling for multiple-antenna systems}}}, year = {{2018}}, } @article{42214, author = {{Mishra, P. K. and Chatterjee, D. and Quevedo, D. E.}}, journal = {{Automatica}}, number = {{1}}, pages = {{40–51}}, title = {{{Sparse and constrained stochastic predictive control for networked systems}}}, volume = {{87}}, year = {{2018}}, } @article{42216, author = {{L\’opez, A. M. and Quevedo, D. E. and Aguilera, R. P. and Geyer, T. and Oikonomou, N.}}, journal = {{Trans. Power Electron.}}, number = {{7}}, pages = {{6292–6303}}, title = {{{Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters}}}, volume = {{33}}, year = {{2018}}, } @article{42219, author = {{Demirel, B. and Ghadimi, E. and Quevedo, D. E. and Johansson, M.}}, journal = {{Trans. Contr. Network Syst.}}, number = {{3}}, pages = {{1275–1286}}, title = {{{Optimal control of linear systems with limited control actions: threshold-based event-triggered control}}}, volume = {{5}}, year = {{2018}}, } @article{42218, author = {{Demirel, B. and Ramaswamy, A. and Quevedo, D. E. and Karl, H.}}, journal = {{IEEE Contr. Syst. Lett.}}, number = {{4}}, pages = {{737–742}}, title = {{{DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling}}}, volume = {{2}}, year = {{2018}}, } @article{42217, author = {{Leong, A. and Dey, S. and Quevedo, D. E.}}, journal = {{Automatica}}, number = {{5}}, pages = {{54–60}}, title = {{{Transmission scheduling for remote state estimation and control with an energy harvesting sensor}}}, volume = {{91}}, year = {{2018}}, } @article{42215, author = {{Liu, S. and Xie, L. and Quevedo, D. E.}}, journal = {{Trans. Contr. Network Syst.}}, number = {{1}}, pages = {{167–178}}, title = {{{Event-Triggered Quantized Communication-Based Distributed Convex Optimization}}}, volume = {{5}}, year = {{2018}}, } @inproceedings{8162, abstract = {{The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we study the open problem of computing satisfying assignments to k-QSAT instances which have a "matching" or "dimer covering"; this is an NP problem whose decision variant is trivial, but whose search complexity remains open. Our results fall into three directions, all of which relate to the "matching" setting: (1) We give a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases by reducing the problem to solving for a single root of a single univariate polynomial. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a "matching". We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry; we hope these prove useful elsewhere.}}, author = {{Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}}, booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}}, editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}}, keywords = {{search complexity, local Hamiltonian, Quantum SAT, algebraic geometry}}, location = {{Liverpool, UK}}, pages = {{38:1--38:16}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}}, title = {{{On Efficiently Solvable Cases of Quantum k-SAT}}}, doi = {{10.4230/LIPIcs.MFCS.2018.38}}, volume = {{117}}, year = {{2018}}, } @inproceedings{8161, abstract = {{The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH does not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid Method for efficiently solving semidefinite programs. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs "equivalent"), then QMA(2) is in the Counting Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e., alternating quantifiers do not help in the presence of "unentanglement"), QMA(2) is strictly contained in NEXP.}}, author = {{Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}}, booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}}, editor = {{Potapov, Igor and Spirakis, Paul and Worrell, James}}, keywords = {{Complexity Theory, Quantum Computing, Polynomial Hierarchy, Semidefinite Programming, QMA(2), Quantum Complexity}}, location = {{Liverpool, UK}}, pages = {{58:1--58:16}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}}, title = {{{Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}}}, doi = {{10.4230/LIPIcs.MFCS.2018.58}}, volume = {{117}}, year = {{2018}}, } @inproceedings{8160, abstract = {{An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, Ambainis defined the complexity class P^QMA[log], and motivated its study by showing that the physical task of estimating the expectation value of a local observable against the ground state of a local Hamiltonian is P^QMA[log]-complete. In this paper, we continue the study of P^QMA[log], obtaining the following results. The P^QMA[log]-completeness result of Ambainis requires O(log n)-local observ- ables and Hamiltonians. We show that simulating even a single qubit measurement on ground states of 5-local Hamiltonians is P^QMA[log]-complete, resolving an open question of Ambainis. We formalize the complexity theoretic study of estimating two-point correlation functions against ground states, and show that this task is similarly P^QMA[log]-complete. P^QMA[log] is thought of as "slightly harder" than QMA. We justify this formally by exploiting the hierarchical voting technique of Beigel, Hemachandra, and Wechsung to show P^QMA[log] \subseteq PP. This improves the containment QMA \subseteq PP from Kitaev and Watrous. A central theme of this work is the subtlety involved in the study of oracle classes in which the oracle solves a promise problem. In this vein, we identify a flaw in Ambainis' prior work regarding a P^UQMA[log]-hardness proof for estimating spectral gaps of local Hamiltonians. By introducing a "query validation" technique, we build on his prior work to obtain P^UQMA[log]-hardness for estimating spectral gaps under polynomial-time Turing reductions.}}, author = {{Gharibian, Sevag and Yirka, Justin}}, booktitle = {{12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)}}, editor = {{Wilde, Mark}}, keywords = {{Complexity theory, Quantum Merlin Arthur (QMA), local Hamiltonian, local measurement, spectral gap}}, location = {{Paris, France}}, pages = {{2:1--2:17}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}}, title = {{{The Complexity of Simulating Local Measurements on Quantum Systems}}}, doi = {{10.4230/LIPIcs.TQC.2017.2}}, volume = {{73}}, year = {{2018}}, } @article{8167, author = {{Gharibian, Sevag and Sikora, Jamie}}, issn = {{1942-3454}}, journal = {{ACM Transactions on Computation Theory (TOCT)}}, keywords = {{Local Hamiltonian, ground state connectivity, quantum Hamiltonian complexity, reconfiguration problem}}, number = {{2}}, pages = {{8:1--8:28}}, publisher = {{ACM}}, title = {{{Ground State Connectivity of Local Hamiltonians}}}, doi = {{10.1145/3186587}}, volume = {{10}}, year = {{2018}}, } @article{34843, abstract = {{A polynomial time algorithm to find generators of the lattice of all subfields of a given number field was given in van Hoeij et al. (2013). This article reports on a massive speedup of this algorithm. This is primary achieved by our new concept of Galois-generating subfields. In general this is a very small set of subfields that determine all other subfields in a group-theoretic way. We compute them by targeted calls to the method from van Hoeij et al. (2013). For an early termination of these calls, we give a list of criteria that imply that further calls will not result in additional subfields. Finally, we explain how we use subfields to get a good starting group for the computation of Galois groups.}}, author = {{Elsenhans, Andreas-Stephan and Klüners, Jürgen}}, issn = {{0747-7171}}, journal = {{Journal of Symbolic Computation}}, keywords = {{Computational Mathematics, Algebra and Number Theory}}, pages = {{1--20}}, publisher = {{Elsevier BV}}, title = {{{Computing subfields of number fields and applications to Galois group computations}}}, doi = {{10.1016/j.jsc.2018.04.013}}, volume = {{93}}, year = {{2018}}, } @book{39898, author = {{Hilleringmann, Ulrich}}, isbn = {{9783658234430}}, publisher = {{Springer Fachmedien Wiesbaden}}, title = {{{Silizium-Halbleitertechnologie}}}, doi = {{10.1007/978-3-658-23444-7}}, year = {{2018}}, } @inbook{39428, author = {{Hilleringmann, Ulrich}}, booktitle = {{Silizium-Halbleitertechnologie}}, isbn = {{9783658234430}}, publisher = {{Springer Fachmedien Wiesbaden}}, title = {{{Ätztechnik}}}, doi = {{10.1007/978-3-658-23444-7_5}}, year = {{2018}}, } @inproceedings{39436, author = {{Becker, Thales E. and Vidor, Fabio F. and Wirth, Gilson I. and Meyers, Thorsten and Reker, Julia and Hilleringmann, Ulrich}}, booktitle = {{2018 IEEE 19th Latin-American Test Symposium (LATS)}}, publisher = {{IEEE}}, title = {{{Time domain electrical characterization in zinc oxide nanoparticle thin-film transistors}}}, doi = {{10.1109/latw.2018.8349695}}, year = {{2018}}, } @inproceedings{39437, author = {{Becker, Thales E. and Vidor, Fabio F. and Wirth, Gilson I. and Meyers, Thorsten and Reker, Julia and Hilleringmann, Ulrich}}, booktitle = {{2018 IEEE 19th Latin-American Test Symposium (LATS)}}, publisher = {{IEEE}}, title = {{{Time domain electrical characterization in zinc oxide nanoparticle thin-film transistors}}}, doi = {{10.1109/latw.2018.8349695}}, year = {{2018}}, } @inbook{39429, author = {{Hilleringmann, Ulrich}}, booktitle = {{Silizium-Halbleitertechnologie}}, isbn = {{9783658234430}}, publisher = {{Springer Fachmedien Wiesbaden}}, title = {{{Oxidation des Siliziums}}}, doi = {{10.1007/978-3-658-23444-7_3}}, year = {{2018}}, } @inbook{42788, abstract = {{We classify all one-class genera of admissible lattice chains of length at least 2 in hermitian spaces over number fields. If L is a lattice in the chain and p the prime ideal dividing the index of the lattices in the chain, then the {p}-arithmetic group Aut(L{p}) acts chamber transitively on the corresponding Bruhat-Tits building. So our classification provides a step forward to a complete classification of these chamber transitive groups which has been announced 1987 (without a detailed proof) by Kantor, Liebler and Tits. In fact we find all their groups over number fields and one additional building with a discrete chamber transitive group.}}, author = {{Kirschmer, Markus and Nebe, Gabriele}}, booktitle = {{Algorithmic and Experimental Methods in Algebra, Geometry, and Number Theory}}, isbn = {{9783319705651}}, publisher = {{Springer International Publishing}}, title = {{{One Class Genera of Lattice Chains Over Number Fields}}}, doi = {{10.1007/978-3-319-70566-8_22}}, year = {{2018}}, } @article{42790, abstract = {{We show that exceptional algebraic groups over number fields do not admit one-class genera of parahoric groups, except in the case G₂ . For the group G₂, we enumerate all such one-class genera for the usual seven-dimensional representation.}}, author = {{Kirschmer, Markus}}, issn = {{1246-7405}}, journal = {{Journal de Théorie des Nombres de Bordeaux}}, keywords = {{Algebra and Number Theory}}, number = {{3}}, pages = {{847--857}}, publisher = {{Cellule MathDoc/CEDRAM}}, title = {{{One-class genera of exceptional groups over number fields}}}, doi = {{10.5802/jtnb.1052}}, volume = {{30}}, year = {{2018}}, }