A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...
In this paper, we propose several methods to increase the difficulty of reverse engineering applications, with special emphasis on preventing the circumvention of copy protection ...
: This paper describes a novel solution for authenticated key agreement for wireless sensor networks (WSN) in logistics. The retrieved data may not be spoofed as it is used to gene...
We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto kno...
: The ubiquity and personalization of mobile phones makes them a promising platform for advertising. Currently, practices known from online advertisement can be adapted, e.g. conte...