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 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 .…

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 .…

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 .…

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 .…

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 .…

Feedback game on Eulerian graphs

In this paper, we introduce a two-player impartial game on graphs, called a feedback game, which is a variant of the generalized geography . We study the feedback game on Eulerian graphs . In particular, we show that thePSPACE-completeness of the game determines the winner .…

Ranking an Assortment of Products via Sequential Submodular Optimization

We study an optimization problem capturing a core operational question for online retailing platforms . We model theprobability that a user clicks on an element from a subset of products as amonotone submodular function of this set . We also assume that the patiencelevel of the users, or the number of items they are willing to observe beforeclicking on one or abandoning the search, is a given random variable .…

Green Security Game with Community Engagement

Study: Community members recruited by law enforcement as informants can assist patrols . We introduce novel two-stage security game model for community engagement . We also provide a novel algorithm to find the optimal defender strategy against level-$\kappa$ ($\infty$) attackers .…

GANs May Have No Nash Equilibria

Generative adversarial networks (GANs) represent a zero-sum game between twomachine players, a generator and a discriminator, designed to learn the distribution of data . While GANs have achieved state-of-the-art performance in benchmark learning tasks, GAN minimax optimization still poses greattheoretical and empirical challenges .…

Optimizing Vulnerability Driven Honey Traffic Using Game Theory

Enterprises are increasingly concerned about adversaries that slowly and deliberate exploit resources over the course of months or even years . New networking technology increases the possibility of passive network reconnaissance, which can be undetectable by defenders . In this paper, we propose Snaz, atechnique that uses deceptively crafted honey traffic to confound the knowledge gained through passive reconnaissance .…

Fine Grained Instance Level Sketch Based Video Retrieval

Existing sketch-analysis work studies sketches depicting static objects or scenes . In this work, we propose a novel cross-modal retrieval problem offine-grained instance-level sketch-based video retrieval (FG-SBVR) We show that this model significantly outperforms anumber of existing state-of-the-art models designed for video analysis.…

Blind Omnidirectional Image Quality Assessment with Viewport Oriented Graph Convolutional Networks

Quality assessment of omnidirectional images has become increasingly urgent due to the rapid growth of virtual reality applications . We propose a novel Viewportoriented Graph Convolution Network (VGCN) for blind omniddirectional imagequality assessment (IQA) The proposed graph is inspired by the characteristics of the human vision system (HVS) and theviewing process of Omnidirectionable contents .…

Exponential Automatic Amortized Resource Analysis

Automatic amortized resource analysis (AARA) is a type-based technique forinferring concrete (non-asymptotic) bounds on a program’s resource usage . The soundness of exponential AARA is proved with respect to anoperational cost semantics . A key idea is theuse of the Stirling numbers of the second kind as the basis of potentialfunctions, which play the same role as the binomial coefficients in polynomialAARA .…

Symbolic Execution Game Semantics

We present a framework for symbolically executing and model checkinghigher-order programs with external (open) methods . We combine traditional symbolic executiontechniques with operational game semantics to build a symbolic executionsemantics that captures arbitrary external behaviour . This yields a bounded technique by imposing bounds on the depth of recursion and callbacks .…

Total tessellation cover and quantum walk

We propose the total staggered quantum walk model and the total tessellationcover of a graph . We establish bounds on $T_t(G)$ which is thesmallest number of tesselations required . The $k$-total tessesellability problem aims to decide whether agiven graph $G$ has $K$ (K) = k) We establish hardness results for bipartite graphs, line graphs of triangle-free graphs, universal graphs, planar graphs, and$(2,1)$-chordal graphs .…

Cutting Corners

We define and study a class of subshifts of finite type (SFTs) defined by afamily of allowed patterns of the same shape . For such an SFT, a locally legal pattern of convex shape is globally legal, and there is a measure that samples uniformly on all convexsets .…

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$.…