1,048 research outputs found
Classical and quantum algorithms for scaling problems
This thesis is concerned with scaling problems, which have a plethora of connections to different areas of mathematics, physics and computer science. Although many structural aspects of these problems are understood by now, we only know how to solve them efficiently in special cases.We give new algorithms for non-commutative scaling problems with complexity guarantees that match the prior state of the art. To this end, we extend the well-known (self-concordance based) interior-point method (IPM) framework to Riemannian manifolds, motivated by its success in the commutative setting. Moreover, the IPM framework does not obviously suffer from the same obstructions to efficiency as previous methods. It also yields the first high-precision algorithms for other natural geometric problems in non-positive curvature.For the (commutative) problems of matrix scaling and balancing, we show that quantum algorithms can outperform the (already very efficient) state-of-the-art classical algorithms. Their time complexity can be sublinear in the input size; in certain parameter regimes they are also optimal, whereas in others we show no quantum speedup over the classical methods is possible. Along the way, we provide improvements over the long-standing state of the art for searching for all marked elements in a list, and computing the sum of a list of numbers.We identify a new application in the context of tensor networks for quantum many-body physics. We define a computable canonical form for uniform projected entangled pair states (as the solution to a scaling problem), circumventing previously known undecidability results. We also show, by characterizing the invariant polynomials, that the canonical form is determined by evaluating the tensor network contractions on networks of bounded size
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
'Our land abounds in nature's gifts': Commodity frontiers, Australian capitalism, and socioecological crisis
This thesis presents a history of the origins of capitalism on the continent of Australia. It begins from a contemporary conjuncture riven with socioecological crises that demand theoretical and historical explanation – a conjuncture of mass extinction, of collapsing ecosystems, of accelerating climatic change. From this vantage-point we look to theorise and historicise capitalism in Australia. Animating this history is our central research question: how have ‘commodity frontiers’ shaped the socioecology of Australian capitalism? This question brings the tools of historical materialism – especially in its eco-socialist and world-ecological forms – to bear on the historical origins of Australian capitalism, enabling an understanding of the production of nature and socioecological crisis in Australia. The argument begins from a definition of capitalism as a historically specific totality of socioecological relations: internally related processes of cheap nature, state formation, racialization, and gendered difference driven forward by the structuring power of the value form. These relations violently displaced extant Indigenous socioecologies, spreading across the landscape of Australia via the vehicle of ‘commodity frontiers.’ The thesis traces empirically the process of invasion, and the production of cheap nature through an incorporated comparison of three frontiers – wool, coal, and sugar. In exploring the internal relations of these frontiers through space and time we find them bound within the same totality, defined by dialectics of appropriation and exploitation, of crisis and expansion, of cheapness and of great cost. Put simply, the thesis grapples with the political and analytical challenge of the Capitalocene, and looks to contribute to its undoing through a retelling of the history of the invasion of this continent, and an apprehension of the nature of capitalism
Proceedings XXIII Congresso SIAMOC 2023
Il congresso annuale della Società Italiana di Analisi del Movimento in Clinica (SIAMOC), giunto quest’anno alla sua ventitreesima edizione, approda nuovamente a Roma.
Il congresso SIAMOC, come ogni anno, è l’occasione per tutti i professionisti che operano nell’ambito dell’analisi del movimento di incontrarsi, presentare i risultati delle proprie ricerche e rimanere aggiornati sulle più recenti innovazioni riguardanti le procedure e le tecnologie per l’analisi del movimento nella pratica clinica.
Il congresso SIAMOC 2023 di Roma si propone l’obiettivo di fornire ulteriore impulso ad una già eccellente attività di ricerca italiana nel settore dell’analisi del movimento e di conferirle ulteriore respiro ed impatto internazionale.
Oltre ai qualificanti temi tradizionali che riguardano la ricerca di base e applicata in ambito clinico e sportivo, il congresso SIAMOC 2023 intende approfondire ulteriori tematiche di particolare interesse scientifico e di impatto sulla società . Tra questi temi anche quello dell’inserimento lavorativo di persone affette da disabilità anche grazie alla diffusione esponenziale in ambito clinico-occupazionale delle tecnologie robotiche collaborative e quello della protesica innovativa a supporto delle persone con amputazione. Verrà infine affrontato il tema dei nuovi algoritmi di intelligenza artificiale per l’ottimizzazione della classificazione in tempo reale dei pattern motori nei vari campi di applicazione
On Disperser/Lifting Properties of the Index and Inner-Product Functions
Query-to-communication lifting theorems, which connect the query complexity of a Boolean function to the communication complexity of an associated "lifted" function obtained by composing the function with many copies of another function known as a gadget, have been instrumental in resolving many open questions in computational complexity. A number of important complexity questions could be resolved if we could make substantial improvements in the input size required for lifting with the Index function, which is a universal gadget for lifting, from its current near-linear size down to polylogarithmic in the number of inputs N of the original function or, ideally, constant. The near-linear size bound was recently shown by Lovett, Meka, Mertz, Pitassi and Zhang [Shachar Lovett et al., 2022] using a recent breakthrough improvement on the Sunflower Lemma to show that a certain graph associated with an Index function of that size is a disperser. They also stated a conjecture about the Index function that is essential for further improvements in the size required for lifting with Index using current techniques. In this paper we prove the following;
- The conjecture of Lovett et al. is false when the size of the Index gadget is less than logarithmic in N.
- The same limitation applies to the Inner-Product function. More precisely, the Inner-Product function, which is known to satisfy the disperser property at size O(log N), also does not have this property when its size is less than log N.
- Notwithstanding the above, we prove a lifting theorem that applies to Index gadgets of any size at least 4 and yields lower bounds for a restricted class of communication protocols in which one of the players is limited to sending parities of its inputs.
- Using a modification of the same idea with improved lifting parameters we derive a strong lifting theorem from decision tree size to parity decision tree size. We use this, in turn, to derive a general lifting theorem in proof complexity from tree-resolution size to tree-like Res(?) refutation size, which yields many new exponential lower bounds on such proofs
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
Prognostic and health management of critical aircraft systems and components: an overview
This article belongs to the Special Issue Feature Papers in Fault Diagnosis & Sensors 2023Prognostic and health management (PHM) plays a vital role in ensuring the safety and reliability of aircraft systems. The process entails the proactive surveillance and evaluation of the state and functional effectiveness of crucial subsystems. The principal aim of PHM is to predict the remaining useful life (RUL) of subsystems and proactively mitigate future breakdowns in order to minimize consequences. The achievement of this objective is helped by employing predictive modeling techniques and doing real-time data analysis. The incorporation of prognostic methodologies is of utmost importance in the execution of condition-based maintenance (CBM), a strategic approach that emphasizes the prioritization of repairing components that have experienced quantifiable damage. Multiple methodologies are employed to support the advancement of prognostics for aviation systems, encompassing physics-based modeling, data-driven techniques, and hybrid prognosis. These methodologies enable the prediction and mitigation of failures by identifying relevant health indicators. Despite the promising outcomes in the aviation sector pertaining to the implementation of PHM, there exists a deficiency in the research concerning the efficient integration of hybrid PHM applications. The primary aim of this paper is to provide a thorough analysis of the current state of research advancements in prognostics for aircraft systems, with a specific focus on prominent algorithms and their practical applications and challenges. The paper concludes by providing a detailed analysis of prospective directions for future research within the field.European Union funding: 95568
CFD Modelling and Simulation of Water Turbines
The design and development of water turbines requires accurate methods for performance prediction. Numerical methods and modelling are becoming increasingly important tools to achieve better designs and more efficient turbines, reducing the time required in physical model testing. This book is focused on applying numerical simulations and models for water turbines to predict tool their performance. In this Special Issue, the different contributions of this book are classified into three state-of-the-art Topics: discussing the modelling of pump-turbines, the simulation of horizontal and vertical axis turbines for hydrokinetic applications and the modelling of hydropower plants. All the contributions to this book demonstrate the importance of the modelling and simulation of water turbines for hydropower energy. This new generation of models and simulations will play a major role in the global energy transition and energy crisis, and, of course, in the mitigation of climate change
The Complexity of Some Geometric Proof Systems
In this Thesis we investigate proof systems based on Integer Linear Programming. These methods inspect the solution space of an unsatisfiable propositional formula and prove that this space contains no integral points.
We begin by proving some size and depth lower bounds for a recent proof system, Stabbing Planes, and along the way introduce some novel methods for doing so.
We then turn to the complexity of propositional contradictions generated uniformly from first order sentences, in Stabbing Planes and Sum-Of-Squares.
We finish by investigating the complexity-theoretic impact of the choice of method of generating these propositional contradictions in Sherali-Adams
- …