3,482 research outputs found
DeepPermNet: Visual Permutation Learning
We present a principled approach to uncover the structure of visual data by
solving a novel deep learning task coined visual permutation learning. The goal
of this task is to find the permutation that recovers the structure of data
from shuffled versions of it. In the case of natural images, this task boils
down to recovering the original image from patches shuffled by an unknown
permutation matrix. Unfortunately, permutation matrices are discrete, thereby
posing difficulties for gradient-based methods. To this end, we resort to a
continuous approximation of these matrices using doubly-stochastic matrices
which we generate from standard CNN predictions using Sinkhorn iterations.
Unrolling these iterations in a Sinkhorn network layer, we propose DeepPermNet,
an end-to-end CNN model for this task. The utility of DeepPermNet is
demonstrated on two challenging computer vision problems, namely, (i) relative
attributes learning and (ii) self-supervised representation learning. Our
results show state-of-the-art performance on the Public Figures and OSR
benchmarks for (i) and on the classification and segmentation tasks on the
PASCAL VOC dataset for (ii).Comment: Accepted in IEEE International Conference on Computer Vision and
Pattern Recognition CVPR 201
Analysis of Petri Nets and Transition Systems
This paper describes a stand-alone, no-frills tool supporting the analysis of
(labelled) place/transition Petri nets and the synthesis of labelled transition
systems into Petri nets. It is implemented as a collection of independent,
dedicated algorithms which have been designed to operate modularly, portably,
extensibly, and efficiently.Comment: In Proceedings ICE 2015, arXiv:1508.0459
Complexity of Problems of Commutative Grammars
We consider commutative regular and context-free grammars, or, in other
words, Parikh images of regular and context-free languages. By using linear
algebra and a branching analog of the classic Euler theorem, we show that,
under an assumption that the terminal alphabet is fixed, the membership problem
for regular grammars (given v in binary and a regular commutative grammar G,
does G generate v?) is P, and that the equivalence problem for context free
grammars (do G_1 and G_2 generate the same language?) is in
Revisiting Reachability in Timed Automata
We revisit a fundamental result in real-time verification, namely that the
binary reachability relation between configurations of a given timed automaton
is definable in linear arithmetic over the integers and reals. In this paper we
give a new and simpler proof of this result, building on the well-known
reachability analysis of timed automata involving difference bound matrices.
Using this new proof, we give an exponential-space procedure for model checking
the reachability fragment of the logic parametric TCTL. Finally we show that
the latter problem is NEXPTIME-hard
Corrections to the thermodynamics of Schwarzschild-Tangherlini black hole and the generalized uncertainty principle
We investigate the thermodynamics of Schwarzschild-Tangherlini black hole in
the context of the generalized uncertainty principle. The corrections to the
Hawking temperature, entropy and the heat capacity are obtained via the
modified Hamilton-Jacobi equation. These modifications show that the GUP
changes the evolution of Schwarzschild-Tangherlini black hole. Specially, the
GUP effect becomes susceptible when the radius or mass of black hole approach
to the order of Planck scale, it stops radiating and leads to black hole
remnant. Meanwhile, the Planck scale remnant can be confirmed through the
analysis of the heat capacity. Those phenomenons imply that the GUP may give a
way to solve the information paradox. Besides, we also investigate the
possibilities to observe the black hole at LHC, the results demonstrate that
the black hole can not be produced in the recent LHC.Comment: 12 pages, 6 figure
- …