IA Scholar Query: Angelic Verification: Precise Verification Modulo Unknowns.
https://scholar.archive.org/
Internet Archive Scholar query results feedeninfo@archive.orgMon, 08 Aug 2022 00:00:00 GMTfatcat-scholarhttps://scholar.archive.org/help1440On the Reinhardt Conjecture and Formal Foundations of Optimal Control
https://scholar.archive.org/work/rxdljdx5hnf7jmix4rh3hxse2u
We describe a reformulation (following Hales (2017)) of a 1934 conjecture of Reinhardt on pessimal packings of convex domains in the plane as a problem in optimal control theory. Several structural results of this problem including its Hamiltonian structure and Lax pair formalism are presented. General solutions of this problem for constant control are presented and are used to prove that the Pontryagin extremals of the control problem are constrained to lie in a compact domain of the state space. We further describe the structure of the control problem near its singular locus, and prove that we recover the Pontryagin system of the multi-dimensional Fuller optimal control problem (with two dimensional control) in this case. We show how this system admits logarithmic spiral trajectories when the control set is the circumscribing disk of the 2-simplex with the associated control performing an infinite number of rotations on the boundary of the disk in finite time. We also describe formalization projects in foundational optimal control viz., model-based and model-free Reinforcement Learning theory. Key ingredients which make these formalization novel viz., the Giry monad and contraction coinduction are considered and some applications are discussed.Koundinya Vajjhawork_rxdljdx5hnf7jmix4rh3hxse2uMon, 08 Aug 2022 00:00:00 GMTFrom Infinity to Choreographies: Extraction for Unbounded Systems
https://scholar.archive.org/work/na7scntfzzazdnmprvo7bkvx4e
Choreographies are formal descriptions of distributed systems, which focus on the way in which participants communicate. While they are useful for analysing protocols, in practice systems are written directly by specifying each participant's behaviour. This created the need for choreography extraction: the process of obtaining a choreography that faithfully describes the collective behaviour of all participants in a distributed protocol. Previous works have addressed this problem for systems with a predefined, finite number of participants. In this work, we show how to extract choreographies from system descriptions where the total number of participants is unknown and unbounded, due to the ability of spawning new processes at runtime. This extension is challenging, since previous algorithms relied heavily on the set of possible states of the network during execution being finite.Bjørn Angel Kjær and Luís Cruz-Filipe and Fabrizio Montesiwork_na7scntfzzazdnmprvo7bkvx4eMon, 18 Jul 2022 00:00:00 GMTAdvanced Computational Techniques in Structural Dynamics
https://scholar.archive.org/work/voqkh3in4bez7mncjglpswegma
(:Unkn) Unknown, National Technological University Of Athenswork_voqkh3in4bez7mncjglpswegmaFri, 08 Jul 2022 00:00:00 GMTLie algebroid connections, twisted Higgs bundles and motives of moduli spaces
https://scholar.archive.org/work/dbvshofdqrdijprgvmnemp7kku
Let ℒ=(L,[· ,·],δ) be an algebraic Lie algebroid over a smooth projective curve of genus g≥ 2 such that L is a line bundle whose degree is less than 2-2g. Let r and d be coprime numbers. We prove that the motivic class of the moduli space of ℒ-connections of rank r and degree d over X does not depend on the Lie algebroid structure [· ,·] and δ of ℒ and neither on the line bundle L itself, but only on the degree of L (and of course on r, d and X). In particular it is equal to the motivic class of the moduli space of K_X(D)-twisted Higgs bundles of rank r and degree d, for D any effective divisor with the appropriate degree. As a consequence, similar results (actually slightly stronger) are obtained for the corresponding E-polynomials. Some applications of these results are then deduced.David Alfaya, André Oliveirawork_dbvshofdqrdijprgvmnemp7kkuSun, 03 Jul 2022 00:00:00 GMTDagstuhl Reports, Volume 11, Issue 10, October 2021, Complete Issue
https://scholar.archive.org/work/3w5nqw2gangnrkuqgfzp32cw4u
Dagstuhl Reports, Volume 11, Issue 10, October 2021, Complete Issuework_3w5nqw2gangnrkuqgfzp32cw4uMon, 11 Apr 2022 00:00:00 GMTAdaptive Verifiable Coded Computing: Towards Fast, Secure and Private Distributed Machine Learning
https://scholar.archive.org/work/l4crfrlvjzcedd7w6dssio36fy
Stragglers, Byzantine workers, and data privacy are the main bottlenecks in distributed cloud computing. Some prior works proposed coded computing strategies to jointly address all three challenges. They require either a large number of workers, a significant communication cost or a significant computational complexity to tolerate Byzantine workers. Much of the overhead in prior schemes comes from the fact that they tightly couple coding for all three problems into a single framework. In this paper, we propose Adaptive Verifiable Coded Computing (AVCC) framework that decouples the Byzantine node detection challenge from the straggler tolerance. AVCC leverages coded computing just for handling stragglers and privacy, and then uses an orthogonal approach that leverages verifiable computing to mitigate Byzantine workers. Furthermore, AVCC dynamically adapts its coding scheme to trade-off straggler tolerance with Byzantine protection. We evaluate AVCC on a compute-intensive distributed logistic regression application. Our experiments show that AVCC achieves up to 4.2× speedup and up to 5.1% accuracy improvement over the state-of-the-art Lagrange coded computing approach (LCC). AVCC also speeds up the conventional uncoded implementation of distributed logistic regression by up to 7.6×, and improves the test accuracy by up to 12.1%.Tingting Tang, Ramy E. Ali, Hanieh Hashemi, Tynan Gangwani, Salman Avestimehr, Murali Annavaramwork_l4crfrlvjzcedd7w6dssio36fyTue, 22 Mar 2022 00:00:00 GMTGalaxy And Mass Assembly (GAMA): Data Release 4 and the z < 0.1 total and z < 0.08 morphological galaxy stellar mass functions
https://scholar.archive.org/work/zrgufmd6djdvlkaijz3jguoaum
In Galaxy And Mass Assembly Data Release 4 (GAMA DR4), we make available our full spectroscopic redshift sample. This includes 248682 galaxy spectra, and, in combination with earlier surveys, results in 330542 redshifts across five sky regions covering ~250deg^2. The redshift density, is the highest available over such a sustained area, has exceptionally high completeness (95 per cent to r_KIDS=19.65mag), and is well suited for the study of galaxy mergers, galaxy groups, and the low redshift (z<0.25) galaxy population. DR4 includes 32 value-added tables or Data Management Units (DMUs) that provide a number of measured and derived data products including GALEX, ESO KiDS, ESO VIKING, WISE and Herschel Space Observatory imaging. Within this release, we provide visual morphologies for 15330 galaxies to z<0.08, photometric redshift estimates for all 18million objects to r_KIDS~25mag, and stellar velocity dispersions for 111830 galaxies. We conclude by deriving the total galaxy stellar mass function (GSMF) and its sub-division by morphological class (elliptical, compact-bulge and disc, diffuse-bulge and disc, and disc only). This extends our previous measurement of the total GSMF down to 10^6.75 M_sol h^-2_70 and we find a total stellar mass density of rho_*=(2.97+/-0.04)x10^8 M_sol h_70 Mpc^-3 or Omega_*=(2.17+/-0.03)x10^-3 h^-1_70. We conclude that at z<0.1, the Universe has converted 4.9+/-0.1 per cent of the baryonic mass implied by Big Bang Nucleosynthesis into stars that are gravitationally bound within the galaxy population.Simon P. Driver, Sabine Bellstedt, Aaron S. G. Robotham, Ivan K. Baldry, Luke J. Davies, Jochen Liske, Danail Obreschkow, Edward N. Taylor, Angus H. Wright, Mehmet Alpaslan, Steven P. Bamford, Amanda E. Bauer, Joss Bland-Hawthorn, Maciej Bilicki, Matias Bravo, Sarah Brough, Sarah Casura, Michelle E. Cluver, Matthew Colless, Christopher J. Conselice, Scott M. Croom, Jelte de Jong, Franceso D'Eugenio, Roberto De Propris, Burak Dogruel, Michael J. Drinkwater, Andrej Dvornik, Daniel J. Farrow, Carlos S. Frenk, Benjamin Giblin, Alister W. Graham, Meiert W. Grootes, Madusha L.P. Gunawardhana, Abdolhosein Hashemizadeh, Boris Haussler, Catherine Heymans, Hendrik Hildebrandt, Benne W. Holwerda, Andrew M. Hopkins, Tom H. Jarrett, D. Heath Jones, Lee S. Kelvin, Soheil Koushan, Konrad Kuijken, Maritza A.Lara-Lopez, Rebecca Lange, Angel R.Lopez-Sanchez, Jon Loveday, Smriti Mahajan, Martin Meyer, Amanda J. Moffett, Nicola R. Napolitano, Peder Norberg, Matt S. Owers, Mario Radovich, Mojtaba Raouf, John A.Peacock, Steven Phillipps, Kevin A. Pimbblet, Cristina Popescu, Khaled Said, Anne E. Sansom, Mark Seibert, Will J. Sutherland, Jessica E. Thorne, Richard J. Tuffs, Ryan Turner, Arjen van der Wel, Eelco van Kampen, Steve M. Wilkinswork_zrgufmd6djdvlkaijz3jguoaumWed, 16 Mar 2022 00:00:00 GMTOn Higher-Order Reachability Games vs May Reachability
https://scholar.archive.org/work/ftmftbw565hynownxhre3z73pu
We consider the reachability problem for higher-order functional programs and study the relationship between reachability games (i.e., the reachability problem for programs with angelic and demonic nondeterminism) and may-reachability (i.e., the reachability problem for programs with only angelic nondeterminism). We show that reachability games for order-n programs can be reduced to may-reachability for order-(n+1) programs, and vice versa. We formalize the reductions by using higher-order fixpoint logic and prove their correctness. We also discuss applications of the reductions to higher-order program verification.Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashiwork_ftmftbw565hynownxhre3z73puWed, 16 Mar 2022 00:00:00 GMTFirst-Order Game Logic and Modal Mu-Calculus
https://scholar.archive.org/work/hcoxcgmf3bhyldxnfqbfaod5di
This paper investigates first-order game logic and first-order modal mu-calculus, which extend their propositional modal logic counterparts with first-order modalities of interpreted effects such as variable assignments. Unlike in the propositional case, both logics are shown to have the same expressive power and their proof calculi to have the same deductive power. Both calculi are also mutually relatively complete. In the presence of differential equations, corollaries obtain usable and complete translations between differential game logic, a logic for the deductive verification of hybrid games, and the differential mu-calculus, the modal mu-calculus for hybrid systems. The differential mu-calculus is complete with respect to first-order fixpoint logic and differential game logic is complete with respect to its ODE-free fragment.Noah Abou El Wafa, André Platzerwork_hcoxcgmf3bhyldxnfqbfaod5diFri, 11 Feb 2022 00:00:00 GMTParallel Logic Programming: A Sequel
https://scholar.archive.org/work/xjwvnvr6uvfnvewygrc2vz5zlu
Multi-core and highly-connected architectures have become ubiquitous, and this has brought renewed interest in language-based approaches to the exploitation of parallelism. Since its inception, logic programming has been recognized as a programming paradigm with great potential for automated exploitation of parallelism. The comprehensive survey of the first twenty years of research in parallel logic programming, published in 2001, has served since as a fundamental reference to researchers and developers. The contents are quite valid today, but at the same time the field has continued evolving at a fast pace in the years that have followed. Many of these achievements and ongoing research have been driven by the rapid pace of technological innovation, that has led to advances such as very large clusters, the wide diffusion of multi-core processors, the game-changing role of general-purpose graphic processing units, and the ubiquitous adoption of cloud computing. This has been paralleled by significant advances within logic programming, such as tabling, more powerful static analysis and verification, the rapid growth of Answer Set Programming, and in general, more mature implementations and systems. This survey provides a review of the research in parallel logic programming covering the period since 2001, thus providing a natural continuation of the previous survey. The goal of the survey is to serve not only as a reference for researchers and developers of logic programming systems, but also as engaging reading for anyone interested in logic and as a useful source for researchers in parallel systems outside logic programming. Under consideration in Theory and Practice of Logic Programming (TPLP).Agostino Dovier, Andrea Formisano, Gopal Gupta, Manuel V. Hermenegildo, Enrico Pontelli, Ricardo Rochawork_xjwvnvr6uvfnvewygrc2vz5zluMon, 24 Jan 2022 00:00:00 GMTFirst-Order Game Logic and Modal Mu-Calculus
https://scholar.archive.org/work/tgmw3rgvsbfjpfrqyxrgq3g6au
This paper investigates first-order game logic and first-order modal mu-calculus, which extend their propositional modal logic counterparts with first-order modalities of interpreted effects such as variable assignments. Unlike in the propositional case, both logics are shown to have the same expressive power and their proof calculi to have the same deductive power. Both calculi are also mutually relatively complete. In the presence of differential equations, corollaries obtain usable and complete translations between differential game logic, a logic for the deductive verification of hybrid games, and the differential mu-calculus, the modal mu-calculus for hybrid systems. The differential mu-calculus is complete with respect to first-order fixpoint logic and differential game logic is complete with respect to its ODE-free fragment.Noah Abou El Wafa, André Platzerwork_tgmw3rgvsbfjpfrqyxrgq3g6auSat, 01 Jan 2022 00:00:00 GMTVlatakisGkaragkounis_columbia_0054D_17419.pdf
https://scholar.archive.org/work/b7t2wwdek5durbpmlwlw76zexe
Dimitris I wouldn't have been able to sort out my feelings among university choices. For all that, I thank you dearly my good friend. Furthermore, a special thanks should be expressed to Father Panayotis, the community of Saint Gerasimos and Ioannis-Angelos Lagan's whose friendship during the Covid-19 pandemic was my only escape from this disease tragedy. At a more academic tone again, there are three Greek Professors that played a significant role in this journey, Georgios Piliouras, Panayotis Mertikopoulos and Ioannis Panageas. George, thanks for your continuous help and teaching me the self-confidence in an era and area of ML. Panayotis, thanks for never being bothered by my interminable list of questions and lending me to use your incredible Oxford style English phrases. Ioanni, thanks for teaching us that audacity sometimes serves science just as well as humility. A convex combination of yours consist the fondest researcher I have ever met; Without you, I certainly would have been a different scientist. I hope that the terminal station of the trip will "reimburse" all of us. Closing this section, I cannot avoid looking back confessing that the decision to leave Greece was, without a doubt, the hardest one that I have made in my entire life. Of course, this is hardly xv the place to get into the reasons behind this decision, except to mention that one of the most important ones had to do with the friends that I had made in Greece and who had remained an ocean and several time zones away. Thus, I can not forget to thank all my friends and professors from the lab where I completed my undergraduate degree in Greece: Thanasis, Natalia, Giorgos and Ilias, Manolis and Kostas, Fotis and Vasilis, Eleni and Chara, Makis and Kyriakos, Dimitris, Aris, Panaro, Nikolas, Stathis, I am grateful to all of you for never giving up in communicating with me and supporting me throughout the years of my PhD, despite the long distance. I might never have decided to embark upon a life of computer science research if I have not met you. Before addressing my ultimate thanks to my blood family, there is a larger and deeper family that have brought always smile to my face (even when there is nothing to smile about), along with your big always accepting hug.:unavwork_b7t2wwdek5durbpmlwlw76zexeNúmero 43 - 2022
https://scholar.archive.org/work/fy7c7m2zrzgejesj5owjzpfeky
ha estado sufriendo una serie de profundas transformaciones arquitectónicas, funcionales y sociales en las últimas décadas. Estos procesos no han sido analizados aún de forma sistemática, pese a que el estudio de los procesos urbanos como el de la gentrificación es un tema de máxima actualidad. Este trabajo pretende determinar si el Centro Histórico de Málaga ha presentado un proceso de gentrificación desde el último tercio del siglo XX hasta inicios del siglo XXI. Se ha procedido a la obtención de una serie de indicadores demográficos, socioeconómicos e inmobiliarios y al análisis de los mismos. Los resultados obtenidos indican la existencia de un proceso de gentrificación avanzado. Este estudio establece la base para una vía de investigación más amplia de este espacio urbano malagueño.REA REAwork_fy7c7m2zrzgejesj5owjzpfekyA short review on quantum identity authentication protocols: How would Bob know that he is talking with Alice?
https://scholar.archive.org/work/ch27j4rn6nfldeuarzvinach4a
Secure communication has achieved a new dimension with the advent of the schemes of quantum key distribution (QKD) as in contrast to classical cryptography, quantum cryptography can provide unconditional security. However, a successful implementation of a scheme of QKD requires identity authentication as a prerequisite. A security loophole in the identity authentication scheme may lead to the vulnerability of the entire secure communication scheme. Consequently, identity authentication is extremely important and in the last three decades several schemes for identity authentication, using quantum resources have been proposed. The chronological development of these protocols, which are now referred to as quantum identity authentication (QIA) protocols, are briefly reviewed here with specific attention to the causal connection involved in their development. The existing protocols are classified on the basis of the required quantum resources and their relative merits and demerits are analyzed. Further, in the process of the classification of the protocols for QIA, it's observed that the existing protocols can also be classified in a few groups based on the inherent computational tasks used to design the protocols. Realization of these symmetries has led to the possibility of designing a set of new protocols for quantum identity authentication, which are based on the existing schemes of the secure computational and communication tasks. The security of such protocols is also critically analyzed.Arindam Dutta, Anirban Pathakwork_ch27j4rn6nfldeuarzvinach4aWed, 08 Dec 2021 00:00:00 GMTSecure Computation Protocols for Privacy-Preserving Machine Learning
https://scholar.archive.org/work/ezm6r5vjlna7vcp3jsdtsevovy
Machine Learning (ML) profitiert erheblich von der Verfügbarkeit großer Mengen an Trainingsdaten, sowohl im Bezug auf die Anzahl an Datenpunkten, als auch auf die Anzahl an Features pro Datenpunkt. Es ist allerdings oft weder möglich, noch gewollt, mehr Daten unter zentraler Kontrolle zu aggregieren. Multi-Party-Computation (MPC)-Protokolle stellen eine Lösung dieses Dilemmas in Aussicht, indem sie es mehreren Parteien erlauben, ML-Modelle auf der Gesamtheit ihrer Daten zu trainieren, ohne die Eingabedaten preiszugeben. Generische MPC-Ansätze bringen allerdings erheblichen Mehraufwand in der Kommunikations- und Laufzeitkomplexität mit sich, wodurch sie sich nur beschränkt für den Einsatz in der Praxis eignen. Das Ziel dieser Arbeit ist es, Privatsphäreerhaltendes Machine Learning mittels MPC praxistauglich zu machen. Zuerst fokussieren wir uns auf zwei Anwendungen, lineare Regression und Klassifikation von Dokumenten. Hier zeigen wir, dass sich der Kommunikations- und Rechenaufwand erheblich reduzieren lässt, indem die aufwändigsten Teile der Berechnung durch Sub-Protokolle ersetzt werden, welche auf die Zusammensetzung der Parteien, die Verteilung der Daten, und die Zahlendarstellung zugeschnitten sind. Insbesondere das Ausnutzen dünnbesetzter Datenrepräsentationen kann die Effizienz der Protokolle deutlich verbessern. Diese Beobachtung verallgemeinern wir anschließend durch die Entwicklung einer Datenstruktur für solch dünnbesetzte Daten, sowie dazugehöriger Zugriffsprotokolle. Aufbauend auf dieser Datenstruktur implementieren wir verschiedene Operationen der Linearen Algebra, welche in einer Vielzahl von Anwendungen genutzt werden. Insgesamt zeigt die vorliegende Arbeit, dass MPC ein vielversprechendes Werkzeug auf dem Weg zu Privatsphäre-erhaltendem Machine Learning ist, und die von uns entwickelten Protokolle stellen einen wesentlichen Schritt in diese Richtung dar.Phillipp Schoppmann, Humboldt-Universität Zu Berlinwork_ezm6r5vjlna7vcp3jsdtsevovyFri, 08 Oct 2021 00:00:00 GMT