Universal Image Steganalytic Method

In the paper we introduce a new universal steganalytic method in JPEG file format that is detecting well-known and also newly developed steganographic methods. The steganalytic model is trained by MHF-DZ steganographic algorithm previously designed by the same authors. The calibration technique with the Feature Based Steganalysis (FBS) was employed in order to identify statistical changes caused by embedding a secret data into original image. The steganalyzer concept utilizes Support Vector Machine (SVM) classification for training a model that is later used by the same steganalyzer in order to identify between a clean (cover) and steganographic image. The aim of the paper was to analyze the variety in accuracy of detection results (ACR) while detecting testing steganographic algorithms as F5, Outguess, Model Based Steganography without deblocking, JP Hide&Seek which represent the generally used steganographic tools. The comparison of four feature vectors with different lengths FBS (22), FBS (66) FBS(274) and FBS(285) shows promising results of proposed universal steganalytic method comparing to binary methods

Mapping UML models incorporating OCL constraints into object-Z

Focusing on object-oriented designs, this paper proposes a mapping for translating systems modelled in the Unified Modelling Language (UML) incorporating Object Constraint Language (OCL) constraints into formal software specifications in Object-Z. Joint treatment of semi-formal model constructs and constraints within a single translation framework and conversion tool is novel, and leads to the generation of much richer formal specifications than is otherwise possible. This paper complements previous analyses by paying particular attention to the generation of complete Object-Z structures. Integration of proposals to extend the OCL to include action constraints also boosts the expressivity of the translated specifications. The main features of a tool support are described

A semantics for probabilistic answer set programs with incomplete stochastic knowledge

Some probabilistic answer set programs (PASP) semantics assign probabilities to sets of answer sets and implicitly assume these answer sets to be equiprobable. While this is a common choice in probability theory, it leads to unnatural behaviours with PASPs. We argue that the user should have a level of control over what assumption is used to obtain a probability distribution when the stochastic knowledge is incomplete. To this end, we introduce the Incomplete Knowledge Semantics (IKS) for probabilistic answer set programs. We take inspiration from the field of decision making under ignorance. Given a cost function, represented by a user-defined ordering over answer sets through weak constraints, we use the notion of Ordered Weighted Averaging (OWA) operator to distribute the probability over a set of answer sets accordingly to the user’s level of optimism. The more optimistic (or pessimistic) a user is, the more (or less) probability is assigned to the more optimal answer sets. We present an implementation and showcase the behaviour of this semantics on simple examples. We also highlight the impact that different OWA operators have on weight learning, showing that the equiprobability assumption is not always the best option

Hierarchies of reward machines

Reward machines (RMs) are a recent formalism for representing the reward function of a reinforcement learning task through a finite-state machine whose edges encode subgoals of the task using high-level events. The structure of RMs enables the decomposition of a task into simpler and independently solvable subtasks that help tackle longhorizon and/or sparse reward tasks. We propose a formalism for further abstracting the subtask structure by endowing an RM with the ability to call other RMs, thus composing a hierarchy of RMs (HRM). We exploit HRMs by treating each call to an RM as an independently solvable subtask using the options framework, and describe a curriculum-based method to learn HRMs from traces observed by the agent. Our experiments reveal that exploiting a handcrafted HRM leads to faster convergence than with a flat HRM, and that learning an HRM is feasible in cases where its equivalent flat representation is not

MIRU-VNTR genotyping of Mycobacterium tuberculosis strains using QIAxcel technology: a multicentre evaluation study

Molecular genotyping of M.tuberculosis is an important laboratory tool in the context of emerging drug resistant TB. The standard 24-loci MIRU-VNTR typing includes PCR amplification followed by the detection and sizing of PCR fragments using capillary electrophoresis on automated sequencers or using agarose gels. The QIAxcel Advanced system might offer a cost-effective medium-throughput alternative.Performance characteristics of the QIAxcel Advanced platform for the standard 24 VNTR loci panel was evaluated at two centres on a total of 140 DNA specimens using automated capillary electrophoresis as a reference method. Additionally 4 hypervariable MIRU-VNTR loci were evaluated on 53 crude DNA extracts. The sizing accuracy, interlaboratory reproducibility and overall instrument's performance were assessed during the study.An overall concordance with the reference method was high reaching 98.5% and 97.6% for diluted genomic and crude DNA extracts respectively. 91.4% of all discrepancies were observed in fragments longer than 700bp. The concordance for hypervariable loci was lower except for locus 4120 (96.2%). The interlaboratory reproducibility agreement rates were 98.9% and 91.3% for standard and hypervariable loci, respectively. Overall performance of the QIAxcel platform for M.tuberculosis genotyping using a panel of standard loci is comparable to that of established methods for PCR fragments up to 700bp. Inaccuracies in sizing of longer fragments could be resolved through using in-house size markers or introduction of offset values. To conclude, the QiaXcel system could be considered an effective alternative to existing methods in smaller reference and regional laboratories offering good performance and shorter turnaround times

Chern-Simons Field Theories with Non-semisimple Gauge Group of Symmetry

Subject of this work is a class of Chern-Simons field theories with non-semisimple gauge group, which may well be considered as the most straightforward generalization of an Abelian Chern-Simons field theory. As a matter of fact these theories, which are characterized by a non-semisimple group of gauge symmetry, have cubic interactions like those of non-abelian Chern-Simons field theories, but are free from radiative corrections. Moreover, at the tree level in the perturbative expansion,there are only two connected tree diagrams, corresponding to the propagator and to the three vertex originating from the cubic interaction terms. For such theories it is derived here a set of BRST invariant observables, which lead to metric independent amplitudes. The vacuum expectation values of these observables can be computed exactly. From their expressions it is possible to isolate the Gauss linking number and an invariant of the Milnor type, which describes the topological relations among three or more closed curves.Comment: 16 pages, 1 figure, plain LaTeX + psfig.st

Cross-shell excitation in two-proton knockout: Structure of 52^{52}Ca

The two-proton knockout reaction $^9$Be($^{54}$Ti,$^{52}$Ca$+ \gamma$) has been studied at 72 MeV/nucleon. Besides the strong feeding of the $^{52}$Ca ground state, the only other sizeable cross section proceeds to a 3$^-$ level at 3.9 MeV. There is no measurable direct yield to the first excited 2$^+$ state at 2.6 MeV. The results illustrate the potential of such direct reactions for exploring cross-shell proton excitations in neutron-rich nuclei and confirms the doubly-magic nature of $^{52}$Ca

Completeness and Incompleteness of Synchronous Kleene Algebra

Synchronous Kleene algebra (SKA), an extension of Kleene algebra (KA), was proposed by Prisacariu as a tool for reasoning about programs that may execute synchronously, i.e., in lock-step. We provide a countermodel witnessing that the axioms of SKA are incomplete w.r.t. its language semantics, by exploiting a lack of interaction between the synchronous product operator and the Kleene star. We then propose an alternative set of axioms for SKA, based on Salomaa's axiomatisation of regular languages, and show that these provide a sound and complete characterisation w.r.t. the original language semantics.Comment: Accepted at MPC 201