Real Time Visualization in Non Isotropic Geometries

Non-isotropic geometries are of interest to low-dimensional topologists,physicists and cosmologists . However, they are challenging to comprehend andvisualize . We present novel methods of computing real-time native geodesicrendering . Our methods can be applied not only tovisualization, but also are essential for potential applications in machinelearning and video games .…

A Bridge between Polynomial Optimization and Games with Imperfect Recall

We show that solving games with imperfect recall is as hard as solving certain problems of the firstorder theory of reals . We establish square root sum hardness even for the class of A-loss games . On the positive side, we find restrictions on games and strategies motivated by Bridge bidding that give polynomial-timecomplexity .…

My Fair Bandit Distributed Learning of Max Min Fairness with Multi player Bandits

N cooperative but non-communicating players where each plays one outof M arms for T turns . Players have different utilities for each arm,representable as an NxM matrix . These utilities are unknown to the players . In each turn players select an arm and receive a noisy observation of their utility for it .…

Online Stochastic Max Weight Matching prophet inequality for vertex and edge arrival models

We provide prophet inequality algorithms for online weighted matching ingeneral (non-bipartite) graphs . The weight of each edge is drawn independently from an a-priori known probability distribution . We introduce a novel unified framework of batched prophet inequalities that captures online settings where elements arrive in batches .…

Finite Time Last Iterate Convergence for Multi Agent Learning in Games

In this paper, we consider multi-agent learning via online gradient descent in a class of games called $lambda$-cocoercive games . We characterize the finite-time last-iterate convergence rate for joint OGD learning on these games . Further, we develop a fully adaptive algorithm that does not require any knowledge of problem parameter (e.g.…

A Formal Treatment of Contract Signature

The paper develops a logical understanding of processes for signature of legal contracts . It is motivated by applications to legal recognition of smartcontracts on blockchain platforms . A number of axioms and rules of inference are developed that can be used to justify a “meeting of the minds” precondition for contract formation from the fact that certain content has been signed .…

Quantized Decentralized Stochastic Learning over Directed Graphs

We consider a decentralized stochastic learning problem where data points are distributed among computing nodes communicating over a directed graph . As themodel size gets large, decentralized learning faces a major bottleneck that is the heavy communication load due to each node transmitting large messages to its neighbors .…

Toward dynamical crowd control to prevent hazardous situations

Large crowds are common for large crowds to gather to attend games, exhibitions, rallies, and other events . However, congestion created by large crowds has resulted in hazardous incidents across the world . Developments in information technology can provide new means to disseminate public information, thuschanging human behavior in situations of danger and duress .…

Optimizing Traffic Lights with Multi agent Deep Reinforcement Learning and V2X communication

We consider a system to optimize duration of traffic signals using multi-agent deep reinforcement learning and Vehicle-to-Everything (V2X) communication . A learning agent trafficlight gets information along its lanes within a circular V2X coverage . Weevaluate multi-agents through the Simulation of Urban MObility (SUMO)simulator .…

A Simulation Model Demonstrating the Impact of Social Aspects on Social Internet of Things

In addition to seamless connectivity and smartness, the objects in the Internet of Things (IoT) are expected to have the social capabilities . In this paper, an intuitive paradigmof social interactions between these objects are argued and modeled . The impact of social behavior on the interaction pattern of social objects is studied taking Peer-to-Peer (P2P) resource sharing as an example application .…

Verifying Array Manipulating Programs with Full Program Induction

We present a full-program induction technique for proving (a sub-class of)quantified as well as quantifier-free properties of programs manipulatingarrays of parametric size N . Instead of inducting over individual loops, ourtechnique inducts over the entire program (possibly containing multiple loops) Significantly, this does not requiregeneration or use of loop-specific invariants .…

A spatio temporalisation of ALC D and its translation into alternating automata augmented with spatial constraints

The aim of this work is to provide a family of theories for spatial change in general and for motion of spatial scenes in particular . We consider a spatio-temporalisation MTALC(Dx), of the well-knownALC family of Description Logics . The roles split into m+n immediate-successor(accessibility) relations, which are serial, irreflexive and antisymmetric .…

Buchi automata augmented with spatial constraints simulating an alternating with a nondeterministic and deciding the emptiness problem for the latter

The aim of this work is to thoroughly investigate Buchi automata augmentedwith spatial constraints . The input trees of such an automaton are infinitek-ary Sigma-trees, with the nodes standing for time points . Theconstraints, from an RCC8-like spatial Relation Algebra (RA) x, are used to impose spatial constraints on objects of the spatial scene .…

FMore An Incentive Scheme of Multi dimensional Auction for Federated Learning in MEC

Promising federated learning coupled with Mobile Edge Computing (MEC) is considered as one of the most promising solutions to the AI-driven serviceprovision . In MEC, edgenodes would not like to voluntarily participate in learning, and they differ inthe provision of multi-dimensional resources .…

A characterization of proportionally representative committees

A well-known axiom for proportional representation is Proportionality ofSolid Coalitions . We characterize committees satisfying PSC as possible outcomes of the Minimal Demand rule .…

Compactly Representing Uniform Interpolants for EUF using conditional DAGS

The concept of a uniform interpolant for a quantifier-free formula from agiven formula with a list of symbols, while well-known in the logic literature,has been unknown to the formal methods and automated reasoning community . The first algorithm is non-deterministic andgenerates a uniforminterpolant expressed as a disjunction of conjunction ofliterals .…

Concurrent Kleene Algebra with Observations from Hypotheses to Completeness

Concurrent Kleene Algebra (CKA) extends basic Kleene algebra with a parallelcomposition operator . However, CKA fundamentally misses tests, which are needed to model standardprogramming constructs such as conditionals and $\mathsf{while}$-loops . In this paper we provide a solution in the form of ConcurrentKleeneAlgebra with Observations .…

DECIBEL Improving Audio Chord Estimation for Popular Music by Alignment and Integration of Crowd Sourced Symbolic Representations

Automatic Chord Estimation (ACE) is a fundamental task in Music InformationRetrieval (MIR) The task consists of segmenting a music recording or score and assigning a chord label to each segment . DECIBEL improves all tested state-of-the-art ACEmethods by over 3 percent on average .…

Multi Representation Knowledge Distillation For Audio Classification

The framework takes multiple representations as the input to train themodels in parallel . The complementary information provided by different representations is shared by knowledge distillation . The proposed approach can improve the classificationperformance and achieve state-of-the-art results on both acoustic sceneclassification tasks and general audio tagging tasks .…

Modeling the Invariance of Virtual Pointers in LLVM

Devirtualization is a compiler optimization that replaces indirect (virtual)function calls with direct calls . It is particularly effective in languages such as Java or C++, in which virtual methods are abundant . We present a novel abstract model to express the lifetimes of C++ dynamicobjects and invariance of virtual table pointers in the LLVM intermediaterepresentation .…

Hyperbolic Minesweeper is in P

We show that, while Minesweeper is NP-complete, its hyperbolic variant is inP . Our proof does not rely on the rules of the game, but is valid for any puzzle based on satisfying local constraints .…

Geometric rank of tensors and subrank of matrix multiplication

The geometric rank is an upper bound on the subrank of tensors and the independence number of hypergraphs . We prove it is smaller than the slice rank of Tao, and relategeometric rank to the analytic rank of Gowers and Wolf in an asymptotic fashion .…

Temporal Constraint Satisfaction Problems in Fixed Point Logic

Finite-domain constraint satisfaction problems are either solvable by Datalog, or not even expressible in fixed-point logic with counting . For infinite-domain CSPs, the situation is more complicated even if the template structure of the CSP is model-theoretically tame . We prove that there is no Maltsev condition that characterizes Dalog already for theCSPs of first-order reducts of (Q; <) We also prove that many of the equivalent conditions in the finite fail to capture expressibility in Datalogs or fixed point logic . The border between the two regimes coincides with an important dichotomy in universalalgebra; in particular, the border can be described by a strong height-one …

Gowers norms for automatic sequences

We show that any automatic sequence can be separated into a structured part and a Gowers uniform part in a way that is considerably more efficient than the Arithmetic Regularity Lemma . For sequences produced bystrongly connected and prolongable automata, the structured part is rationallyalmost periodic, while for general sequences the description is marginally more complicated .…

Algorithms and Lower Bounds for de Morgan Formulas of Low Communication Leaf Gates

The class $FORMULA[s] \circ \mathcal{G}$ consists of Boolean functionscomputable by size-$s$ de Morgan formulas . We give lower bounds and (SAT, Learning,and PRG) algorithms . We show: (1) The Generalized Inner Product function $GIP^k_n$ cannot be computed in $formulA[n^{1.99}]\circ . (2) There is a PRG of seed length$n/2 + O\left(\sqrt{s} \cdotR^{(2)(\mathcal {G}))\right) The Minimum Circuit Size Problem is not in $FORMula[n\circ XOR$.…

The Complexity of Aggregates over Extractions by Regular Expressions

Regular expressions with capture variables, also known as “regex formulas,” extract relations of spans (intervals identified by their start and endindices) from text . Fagin et al. introduced regular documentspanners which are the closure of regex formulas under Relational Algebra .…

Combining Partial Specifications using Alternating Interface Automata

In interface theory and model-based testing withinputs and outputs, conjunctive operators have been introduced . In the theory of alternatingautomata, conjunction and non-determinism are core aspects . Alternating automata have not been considered in the context of inputs and outputs .…

From Stateless to Stateful Priorities Technical Report

We present the notion of stateful priorities for imposing preciserestrictions on system actions, in order to meet safety constraints . Given a system modeled as a network of discrete automata and anerror constraint, we present algorithms which use those inputs to synthesizestateful priorities .…