338 research outputs found
Two-Way Visibly Pushdown Automata and Transducers
Automata-logic connections are pillars of the theory of regular languages.
Such connections are harder to obtain for transducers, but important results
have been obtained recently for word-to-word transformations, showing that the
three following models are equivalent: deterministic two-way transducers,
monadic second-order (MSO) transducers, and deterministic one-way automata
equipped with a finite number of registers. Nested words are words with a
nesting structure, allowing to model unranked trees as their depth-first-search
linearisations. In this paper, we consider transformations from nested words to
words, allowing in particular to produce unranked trees if output words have a
nesting structure. The model of visibly pushdown transducers allows to describe
such transformations, and we propose a simple deterministic extension of this
model with two-way moves that has the following properties: i) it is a simple
computational model, that naturally has a good evaluation complexity; ii) it is
expressive: it subsumes nested word-to-word MSO transducers, and the exact
expressiveness of MSO transducers is recovered using a simple syntactic
restriction; iii) it has good algorithmic/closure properties: the model is
closed under composition with a unambiguous one-way letter-to-letter transducer
which gives closure under regular look-around, and has a decidable equivalence
problem
chi sequences switch the RecBCD helicase–nuclease complex from degradative to replicative modes during the completion of DNA replication
Accurately completing DNA replication when two forks converge is essential to genomic stability. The RecBCD helicase–nuclease complex plays a central role in completion by promoting resection and joining of the excess DNA created when replisomes converge. chi sequences alter RecBCD activity and localize with crossover hotspots during sexual events in bacteria, yet their functional role during chromosome replication remains unknown. Here, we use two-dimensional agarose gel analysis to show that chi induces replication on substrates containing convergent forks. The induced replication is processive but uncoupled with respect to leading and lagging strand synthesis and can be suppressed by ter sites which limit replisome progression. Our observations demonstrate that convergent replisomes create a substrate that is processed by RecBCD and that chi, when encountered, switches RecBCD from a degradative to replicative function. We propose that chi serves to functionally differentiate DNA ends created during completion, which require degradation, from those created by chromosomal double-strand breaks, which require resynthesis
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
We investigate a new width parameter, the fusion-width of a graph. It is a
natural generalization of the tree-width, yet strong enough that not only
graphs of bounded tree-width, but also graphs of bounded clique-width,
trivially have bounded fusion-width. In particular, there is no exponential
growth between tree-width and fusion-width, as is the case between tree-width
and clique-width. The new parameter gives a good intuition about the
relationship between tree-width and clique-width.Comment: To appear in the proceedings of Latin 2014. Springer LNCS 839
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit
sequences, of logarithmic length attached to vertices. We prove that there
exists such a labeling for checking a first-order formula with free set
variables in the graphs of every class that is \emph{nicely locally
cwd-decomposable}. This notion generalizes that of a \emph{nicely locally
tree-decomposable} class. The graphs of such classes can be covered by graphs
of bounded \emph{clique-width} with limited overlaps. We also consider such
labelings for \emph{bounded} first-order formulas on graph classes of
\emph{bounded expansion}. Some of these results are extended to counting
queries
NLC-2 graph recognition and isomorphism
NLC-width is a variant of clique-width with many application in graph
algorithmic. This paper is devoted to graphs of NLC-width two. After giving new
structural properties of the class, we propose a -time algorithm,
improving Johansson's algorithm \cite{Johansson00}. Moreover, our alogrithm is
simple to understand. The above properties and algorithm allow us to propose a
robust -time isomorphism algorithm for NLC-2 graphs. As far as we
know, it is the first polynomial-time algorithm.Comment: soumis \`{a} WG 2007; 12
EFFETS DES TRAITEMENTS THERMIQUES SUR LES PROPRIETES ELECTRIQUES DES CELLULES SOLAIRES A BASE DE SILICIUM POLYCRISTALLIN
On a étudié l'effet de recuits à haute température sur les caractéristiques électriques à l'obscurité et sous éclairement de cellules solaires à base de silicium polycristallin dont la jonction était préparée à froid par incrustation ionique et recuit par laser pulsé. Dans certains cas des dégradations notables sont observées pour des recuits à 900°C
Challenges for Efficient Query Evaluation on Structured Probabilistic Data
Query answering over probabilistic data is an important task but is generally
intractable. However, a new approach for this problem has recently been
proposed, based on structural decompositions of input databases, following,
e.g., tree decompositions. This paper presents a vision for a database
management system for probabilistic data built following this structural
approach. We review our existing and ongoing work on this topic and highlight
many theoretical and practical challenges that remain to be addressed.Comment: 9 pages, 1 figure, 23 references. Accepted for publication at SUM
201
PULSED AND CW LASER TREATMENTS OF IMPLANTED POLYSILICON SOLAR CELLS
Conventional ion implantation and unanalyzed ion bombardment have been used to elaborate the rectifying N+ contact of polycrystalline silicon (Wacker, HEM, CGE) solar cells. Two surface laser annealing in the liquid phase (Nd : YAG laser) and in the solid phase (CO2 laser) regimes have been used. The properties of the solar cells so processed have been investigated. For both doping procedures and both annealing techniques, the cells (conversion) efficiencies under AM1 illumination exceeded 11% for the various polysilicon substrates
On retracts, absolute retracts, and folds in cographs
Let G and H be two cographs. We show that the problem to determine whether H
is a retract of G is NP-complete. We show that this problem is fixed-parameter
tractable when parameterized by the size of H. When restricted to the class of
threshold graphs or to the class of trivially perfect graphs, the problem
becomes tractable in polynomial time. The problem is also soluble when one
cograph is given as an induced subgraph of the other. We characterize absolute
retracts of cographs.Comment: 15 page
Solving Problems on Graphs of High Rank-Width
A modulator of a graph G to a specified graph class H is a set of vertices
whose deletion puts G into H. The cardinality of a modulator to various
tractable graph classes has long been used as a structural parameter which can
be exploited to obtain FPT algorithms for a range of hard problems. Here we
investigate what happens when a graph contains a modulator which is large but
"well-structured" (in the sense of having bounded rank-width). Can such
modulators still be exploited to obtain efficient algorithms? And is it even
possible to find such modulators efficiently?
We first show that the parameters derived from such well-structured
modulators are strictly more general than the cardinality of modulators and
rank-width itself. Then, we develop an FPT algorithm for finding such
well-structured modulators to any graph class which can be characterized by a
finite set of forbidden induced subgraphs. We proceed by showing how
well-structured modulators can be used to obtain efficient parameterized
algorithms for Minimum Vertex Cover and Maximum Clique. Finally, we use
well-structured modulators to develop an algorithmic meta-theorem for deciding
problems expressible in Monadic Second Order (MSO) logic, and prove that this
result is tight in the sense that it cannot be generalized to LinEMSO problems.Comment: Accepted at WADS 201
- …