36,654 research outputs found
Exploring Subexponential Parameterized Complexity of Completion Problems
Let be a family of graphs. In the -Completion problem,
we are given a graph and an integer as input, and asked whether at most
edges can be added to so that the resulting graph does not contain a
graph from as an induced subgraph. It appeared recently that special
cases of -Completion, the problem of completing into a chordal graph
known as Minimum Fill-in, corresponding to the case of , and the problem of completing into a split graph,
i.e., the case of , are solvable in parameterized
subexponential time . The exploration of this
phenomenon is the main motivation for our research on -Completion.
In this paper we prove that completions into several well studied classes of
graphs without long induced cycles also admit parameterized subexponential time
algorithms by showing that:
- The problem Trivially Perfect Completion is solvable in parameterized
subexponential time , that is -Completion for , a cycle and a path on four
vertices.
- The problems known in the literature as Pseudosplit Completion, the case
where , and Threshold Completion, where , are also solvable in time .
We complement our algorithms for -Completion with the following
lower bounds:
- For , , , and
, -Completion cannot be solved in time
unless the Exponential Time Hypothesis (ETH) fails.
Our upper and lower bounds provide a complete picture of the subexponential
parameterized complexity of -Completion problems for .Comment: 32 pages, 16 figures, A preliminary version of this paper appeared in
the proceedings of STACS'1
Dynamics, robustness and fragility of trust
Trust is often conveyed through delegation, or through recommendation. This
makes the trust authorities, who process and publish trust recommendations,
into an attractive target for attacks and spoofing. In some recent empiric
studies, this was shown to lead to a remarkable phenomenon of *adverse
selection*: a greater percentage of unreliable or malicious web merchants were
found among those with certain types of trust certificates, then among those
without. While such findings can be attributed to a lack of diligence in trust
authorities, or even to conflicts of interest, our analysis of trust dynamics
suggests that public trust networks would probably remain vulnerable even if
trust authorities were perfectly diligent. The reason is that the process of
trust building, if trust is not breached too often, naturally leads to
power-law distributions: the rich get richer, the trusted attract more trust.
The evolutionary processes with such distributions, ubiquitous in nature, are
known to be robust with respect to random failures, but vulnerable to adaptive
attacks. We recommend some ways to decrease the vulnerability of trust
building, and suggest some ideas for exploration.Comment: 17 pages; simplified the statement and the proof of the main theorem;
FAST 200
Reliability analysis of dynamic systems by translating temporal fault trees into Bayesian networks
Classical combinatorial fault trees can be used to assess combinations of failures but are unable to capture sequences of faults, which are important in complex dynamic systems. A number of proposed techniques extend fault tree analysis for dynamic systems. One of such technique, Pandora, introduces temporal gates to capture the sequencing of events and allows qualitative analysis of temporal fault trees. Pandora can be easily integrated in model-based design and analysis techniques. It is, therefore, useful to explore the possible avenues for quantitative analysis of Pandora temporal fault trees, and we identify Bayesian Networks as a possible framework for such analysis. We describe how Pandora fault trees can be translated to Bayesian Networks for dynamic dependability analysis and demonstrate the process on a simplified fuel system model. The conversion facilitates predictive reliability analysis of Pandora fault trees, but also opens the way for post-hoc diagnostic analysis of failures
The Stratigraphic Record of Pre-breakup Geodynamics: Evidence from the Barrow Delta, offshore Northwest Australia
The structural and stratigraphic evolution of rift basins and passive margins has been widely studied, with many analyses demonstrating that delta systems can provide important records of post-rift geodynamic processes. However, the apparent lack of ancient syn-breakup delta systems and the paucity of seismic imaging across continent-ocean boundaries means the transition from continental rifting to oceanic spreading remains poorly understood. The Early Cretaceous Barrow Group of the North Carnarvon Basin, offshore NW Australia was a major deltaic system that formed during the latter stages of continental rifting, and represents a rich sedimentary archive, documenting uplift, subsidence and erosion of the margin. We use a regional database of 2D and 3D seismic and well data to constrain the internal architecture of the Barrow Group. Our results highlight three major depocentres: the Exmouth and Barrow sub-basins, and southern Exmouth Plateau. Over-compaction of pre-Cretaceous sedimentary rocks in the South Carnarvon Basin, and pervasive reworking of Permian and Triassic palynomorphs in the offshore Barrow Group, suggests that the onshore South Carnarvon Basin originally contained a thicker sedimentary succession, which was uplifted and eroded prior to breakup. Backstripping of sedimentary successions encountered in wells in the Exmouth Plateau depocentre indicate anomalously rapid tectonic subsidence (≤0.24 mm yr-1) accommodated Barrow Group deposition, despite evidence for minimal, contemporaneous upper crustal extension. Our results suggest that classic models of uniform extension cannot account for the observations of uplift and subsidence in the North Carnarvon Basin, and may indicate a period of depth-dependent extension or dynamic topography preceding breakup
- …