"The Good, The Bad And The Ugly": Evaluation of Wi-Fi Steganography

In this paper we propose a new method for the evaluation of network steganography algorithms based on the new concept of "the moving observer". We considered three levels of undetectability named: "good", "bad", and "ugly". To illustrate this method we chose Wi-Fi steganography as a solid family of information hiding protocols. We present the state of the art in this area covering well-known hiding techniques for 802.11 networks. "The moving observer" approach could help not only in the evaluation of steganographic algorithms, but also might be a starting point for a new detection system of network steganography. The concept of a new detection system, called MoveSteg, is explained in detail.Comment: 6 pages, 6 figures, to appear in Proc. of: ICNIT 2015 - 6th International Conference on Networking and Information Technology, Tokyo, Japan, November 5-6, 201

An O(M(n) log n) algorithm for the Jacobi symbol

The best known algorithm to compute the Jacobi symbol of two n-bit integers runs in time O(M(n) log n), using Sch\"onhage's fast continued fraction algorithm combined with an identity due to Gauss. We give a different O(M(n) log n) algorithm based on the binary recursive gcd algorithm of Stehl\'e and Zimmermann. Our implementation - which to our knowledge is the first to run in time O(M(n) log n) - is faster than GMP's quadratic implementation for inputs larger than about 10000 decimal digits.Comment: Submitted to ANTS IX (Nancy, July 2010

Tests of Seiberg-like Duality in Three Dimensions

We use localization techniques to study several duality proposals for supersymmetric gauge theories in three dimensions reminiscent of Seiberg duality. We compare the partition functions of dual theories deformed by real mass terms and FI parameters. We find that Seiberg-like duality for N=3 Chern-Simons gauge theories proposed by Giveon and Kutasov holds on the level of partition functions and is closely related to level-rank duality in pure Chern-Simons theory. We also clarify the relationship between the Giveon-Kutasov duality and a duality in theories of fractional M2 branes and propose a generalization of the latter. Our analysis also confirms previously known results concerning decoupled free sectors in N=4 gauge theories realized by monopole operators.Comment: 36 pages, 5 figure

The glocalised telenovela as a space for possible identifications for diaspora girls in Northern Belgium: an audience cum content analysis of Sara

Because research on glocalised telenovelas in Western Europe is absent in literature and telenovelas seem highly popular among diaspora girls from Moroccan descents living in Northern Belgium, this paper studies the embedded themes and identification possibilities of telenovelas and explores its thematic interest and meanings for diaspora girls. By means of an audience cum content analysis on the case study Sara, text and audience are combined. Sara is predominantly a ‘Cinderella story’ with a clear ‘love’ and ‘class and social mobility’ discourse where emotional identification is triggered through different parameters. Belgian girls from Moroccan descent mainly watch the Sara for reasons of entertainment and escapism. They negotiate between lived and telenovela-created experiences and consequently formulate aspirations and dreams for future partners, gender roles, careers and (family) life

Fingerprint Analysis with Marked Point Processes

We present a framework for fingerprint matching based on marked point process models. An efficient Monte Carlo algorithm is developed to calculate the marginal likelihood ratio for the hypothesis that two observed prints originate from the same finger against the hypothesis that they originate from different fingers. Our model achieves good performance on an NIST-FBI fingerprint database of 258 matched fingerprint pairs

Answering Subcognitive Turing Test Questions: A Reply to French

Robert French has argued that a disembodied computer is incapable of passing a Turing Test that includes subcognitive questions. Subcognitive questions are designed to probe the network of cultural and perceptual associations that humans naturally develop as we live, embodied and embedded in the world. In this paper, I show how it is possible for a disembodied computer to answer subcognitive questions appropriately, contrary to French’s claim. My approach to answering subcognitive questions is to use statistical information extracted from a very large collection of text. In particular, I show how it is possible to answer a sample of subcognitive questions taken from French, by issuing queries to a search engine that indexes about 350 million Web pages. This simple algorithm may shed light on the nature of human (sub-) cognition, but the scope of this paper is limited to demonstrating that French is mistaken: a disembodied computer can answer subcognitive questions