6,536 research outputs found
Drip and Mate Operations Acting in Test Tube Systems and Tissue-like P systems
The operations drip and mate considered in (mem)brane computing resemble the
operations cut and recombination well known from DNA computing. We here
consider sets of vesicles with multisets of objects on their outside membrane
interacting by drip and mate in two different setups: in test tube systems, the
vesicles may pass from one tube to another one provided they fulfill specific
constraints; in tissue-like P systems, the vesicles are immediately passed to
specified cells after having undergone a drip or mate operation. In both
variants, computational completeness can be obtained, yet with different
constraints for the drip and mate operations
Topological gravity on plumbed V-cobordisms
An ensemble of cosmological models based on generalized BF-theory is
constructed where the role of vacuum (zero-level) coupling constants is played
by topologically invariant rational intersection forms (cosmological-constant
matrices) of 4-dimensional plumbed V-cobordisms which are interpreted as
Euclidean spacetime regions. For these regions describing topology changes, the
rational and integer intersection matrices are calculated. A relation is found
between the hierarchy of certain elements of these matrices and the hierarchy
of coupling constants of the universal (low-energy) interactions.
PACS numbers: 0420G, 0240, 0460Comment: 29 page
Boosting Image Forgery Detection using Resampling Features and Copy-move analysis
Realistic image forgeries involve a combination of splicing, resampling,
cloning, region removal and other methods. While resampling detection
algorithms are effective in detecting splicing and resampling, copy-move
detection algorithms excel in detecting cloning and region removal. In this
paper, we combine these complementary approaches in a way that boosts the
overall accuracy of image manipulation detection. We use the copy-move
detection method as a pre-filtering step and pass those images that are
classified as untampered to a deep learning based resampling detection
framework. Experimental results on various datasets including the 2017 NIST
Nimble Challenge Evaluation dataset comprising nearly 10,000 pristine and
tampered images shows that there is a consistent increase of 8%-10% in
detection rates, when copy-move algorithm is combined with different resampling
detection algorithms
Recasting Residual-based Local Descriptors as Convolutional Neural Networks: an Application to Image Forgery Detection
Local descriptors based on the image noise residual have proven extremely
effective for a number of forensic applications, like forgery detection and
localization. Nonetheless, motivated by promising results in computer vision,
the focus of the research community is now shifting on deep learning. In this
paper we show that a class of residual-based descriptors can be actually
regarded as a simple constrained convolutional neural network (CNN). Then, by
relaxing the constraints, and fine-tuning the net on a relatively small
training set, we obtain a significant performance improvement with respect to
the conventional detector
Flexible RNA design under structure and sequence constraints using formal languages
The problem of RNA secondary structure design (also called inverse folding)
is the following: given a target secondary structure, one aims to create a
sequence that folds into, or is compatible with, a given structure. In several
practical applications in biology, additional constraints must be taken into
account, such as the presence/absence of regulatory motifs, either at a
specific location or anywhere in the sequence. In this study, we investigate
the design of RNA sequences from their targeted secondary structure, given
these additional sequence constraints. To this purpose, we develop a general
framework based on concepts of language theory, namely context-free grammars
and finite automata. We efficiently combine a comprehensive set of constraints
into a unifying context-free grammar of moderate size. From there, we use
generic generic algorithms to perform a (weighted) random generation, or an
exhaustive enumeration, of candidate sequences. The resulting method, whose
complexity scales linearly with the length of the RNA, was implemented as a
standalone program. The resulting software was embedded into a publicly
available dedicated web server. The applicability demonstrated of the method on
a concrete case study dedicated to Exon Splicing Enhancers, in which our
approach was successfully used in the design of \emph{in vitro} experiments.Comment: ACM BCB 2013 - ACM Conference on Bioinformatics, Computational
Biology and Biomedical Informatics (2013
Invariance of the Cuntz splice
We show that the Cuntz splice induces stably isomorphic graph -algebras.Comment: Our arguments to prove invariance of the Cuntz splice for unital
graph C*-algebras in arXiv:1505.06773 applied with only minor changes in the
general case. Since most of the results of that preprint have since been
superseded by other forthcoming work, we do not intend to publish it, whereas
this work is intended for publication. arXiv admin note: substantial text
overlap with arXiv:1505.0677
MOLECULAR COMPUTING WITH TEST TUBE SYSTEMS
In this paper a survey of various different theoretical models of test tube systems is given. In test tube systems specific operations are applied to the objects in their components (test tubes) in a distributed and parallel manner; the results of these computations are redistributed according to a given output/input relation using specific filters. A general theoretical framework for test tube systems is presented which is not only a theoretical basis of systems used for practical applications, but also covers the theoretical models of test tube systems based on the splicing operation as well as of test tube systems based on the operations of cutting and recombination. For test tube systems based on the operations of cutting and recombination we show that in one test tube from a finite set
of axioms and with a finite set of cutting and recombination rules only regular languages can evolve
- âŠ