Suárez-Robles, Miguel Crespillo Andújar, Clara Chamorro-Tojeiro, Sandra Monge-Maillo, Begoña Norman, Francesca Peña, Ignacio Corral, Martina Arcas, Cristina Moreno, Santiago Pérez-Molina, Jose A
...
Published in
Enfermedades infecciosas y microbiologia clinica (English ed.)
HIV infection has become a chronic disease with a good long-term prognosis, necessitating a change in the care model. For this study, we applied a proposal for an Optimal Care Model (OCM) for people with HIV (PHIV), which includes tools for assessing patient complexity and their classification into profiles to optimize care provision. Observational...
Prunet, Thibault Absi, Nabil Cattaruzza, Diego
The Picker Routing Problem (PRP), which consists of finding a minimum-length tour between a set of storage locations in a warehouse, is one of the most important problems in the warehousing logistics literature. Despite its popularity, the tractability of the PRP in multi-block warehouses remains an open question. This technical note aims to fill t...
Bornes, Laetitia Magnaudet, Mathieu Conversy, Stéphane Poirier, Mathieu
Magnitude is a simulation tool prototype, designed by Laetitia Bornes, as part of her thesis, and developed by Laetitia Bornes, Mathieu Magnaudet, Stéphane Conversy, and Mathieu Poirier. This tool allows, among other things, the modelling of direct and indirect environmental impacts of digital products or services. It was designed to enable collabo...
Azevedo de Amorim, Arthur Zhang, Cheng Gaboardi, Marco
We prove that the equational theory of Kleene algebra with commutativity conditions on primitives (or atomic terms) is undecidable, thereby settling a longstanding open question in the theory of Kleene algebra. While this question has also been recently solved independently by Kuznetsov, our results hold even for weaker theories that do not support...
DiCicco, Mason Podolskii, Vladimir Reichman, Daniel
A nearest neighbor representation of a Boolean function f is a set of vectors (anchors) labeled by 0 or 1 such that f(x) = 1 if and only if the closest anchor to x is labeled by 1. This model was introduced by Hajnal, Liu and Turán [2022], who studied bounds on the minimum number of anchors required to represent Boolean functions under different ch...
Nakamura, Yoshiki
We study the equational theory of Kleene algebra (KA) w.r.t. languages (here, meaning the equational theory of regular expressions where each letter maps to any language) by extending the algebraic signature with the language complement. This extension significantly enhances the expressive power of KA. In this paper, we present a finite relational ...
Bögli, Stefan Yu Olakorede, Ihsane Beqiri, Erta Chen, Xuhang Ercole, Ari Hutchinson, Peter Smielewski, Peter
Published in
Critical care (London, England)
Entropy quantifies the level of disorder within a system. Low entropy reflects increased rigidity of homeostatic feedback systems possibly reflecting failure of protective physiological mechanisms like cerebral autoregulation. In traumatic brain injury (TBI), low entropy of heart rate and intracranial pressure (ICP) predict unfavorable outcome. Bas...
Bilel, Bensaid
The classical Armijo backtracking algorithm achieves the optimal complexity for smooth functions like gradient descent but without any hyperparameter tuning. However, the smoothness assumption is not suitable for Deep Learning optimization. In this work, we show that some variants of the Armijo optimizer achieves acceleration and optimal complexiti...
Kyle-Davidson, Cameron Solis, Oscar Robinson, Stephen Tan, Ryan Tze Wang Evans, Karla K
Published in
Vision research
Humans can remember a vast amount of scene images; an ability often attributed to encoding only low-fidelity gist traces of a scene. Instead, studies show a surprising amount of detail is retained for each scene image allowing them to be distinguished from highly similar in-category distractors. The gist trace for images can be relatively easily ca...
Ardevol Martinez, Virginia
Multiple interval graphs are a well-known generalization of interval graphs, where each vertex of a graph is represented by a d-interval (the union of d intervals) for some natural number d > 1, and there exists an edge between two vertices if and only if their corresponding d-intervals intersect. In particular, a d-interval graph is unit if all th...