25,681 research outputs found
On Sparsification for Computing Treewidth
We investigate whether an n-vertex instance (G,k) of Treewidth, asking
whether the graph G has treewidth at most k, can efficiently be made sparse
without changing its answer. By giving a special form of OR-cross-composition,
we prove that this is unlikely: if there is an e > 0 and a polynomial-time
algorithm that reduces n-vertex Treewidth instances to equivalent instances, of
an arbitrary problem, with O(n^{2-e}) bits, then NP is in coNP/poly and the
polynomial hierarchy collapses to its third level.
Our sparsification lower bound has implications for structural
parameterizations of Treewidth: parameterizations by measures that do not
exceed the vertex count, cannot have kernels with O(k^{2-e}) bits for any e >
0, unless NP is in coNP/poly. Motivated by the question of determining the
optimal kernel size for Treewidth parameterized by vertex cover, we improve the
O(k^3)-vertex kernel from Bodlaender et al. (STACS 2011) to a kernel with
O(k^2) vertices. Our improved kernel is based on a novel form of
treewidth-invariant set. We use the q-expansion lemma of Fomin et al. (STACS
2011) to find such sets efficiently in graphs whose vertex count is
superquadratic in their vertex cover number.Comment: 21 pages. Full version of the extended abstract presented at IPEC
201
Kernel Bounds for Structural Parameterizations of Pathwidth
Assuming the AND-distillation conjecture, the Pathwidth problem of
determining whether a given graph G has pathwidth at most k admits no
polynomial kernelization with respect to k. The present work studies the
existence of polynomial kernels for Pathwidth with respect to other,
structural, parameters. Our main result is that, unless NP is in coNP/poly,
Pathwidth admits no polynomial kernelization even when parameterized by the
vertex deletion distance to a clique, by giving a cross-composition from
Cutwidth. The cross-composition works also for Treewidth, improving over
previous lower bounds by the present authors. For Pathwidth, our result rules
out polynomial kernels with respect to the distance to various classes of
polynomial-time solvable inputs, like interval or cluster graphs. This leads to
the question whether there are nontrivial structural parameters for which
Pathwidth does admit a polynomial kernelization. To answer this, we give a
collection of graph reduction rules that are safe for Pathwidth. We analyze the
success of these results and obtain polynomial kernelizations with respect to
the following parameters: the size of a vertex cover of the graph, the vertex
deletion distance to a graph where each connected component is a star, and the
vertex deletion distance to a graph where each connected component has at most
c vertices.Comment: This paper contains the proofs omitted from the extended abstract
published in the proceedings of Algorithm Theory - SWAT 2012 - 13th
Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 201
Early Results from the Chandra X-ray Observatory
We present some early results on AGN from the Chandra X-ray Observatory,
highlighting high resolution spectroscopy using the High Energy Transmission
Grating Spectrometer (HETGS). The quasar PKS 0637-752 was found to have a very
bright X-ray jet whose shape is remarkably similar to that of the radio jet on
a size scale of 100 kpc, but the X-ray emission is still inexplicably bright.
Two BL Lac objects, PKS 2155-304 and Mrk 421, observed with the spectrometer
were found to have no strong absorption or emission features. Other radio loud
AGN observed with the HETGS show simple power law spectra without obvious
features.Comment: Contributed talk presented at the Joint MPE,AIP,ESO workshop on
NLS1s, Bad Honnef, Dec. 1999, to appear in New Astronomy Reviews; also
available at http://wave.xray.mpe.mpg.de/conferences/nls1-worksho
A volumetric Penrose inequality for conformally flat manifolds
We consider asymptotically flat Riemannian manifolds with nonnegative scalar
curvature that are conformal to , and so that
their boundary is a minimal hypersurface. (Here, is open
bounded with smooth mean-convex boundary.) We prove that the ADM mass of any
such manifold is bounded below by , where is the
Euclidean volume of and is the volume of the Euclidean
unit -ball. This gives a partial proof to a conjecture of Bray and Iga
\cite{brayiga}. Surprisingly, we do not require the boundary to be outermost.Comment: 7 page
Feature subset selection and ranking for data dimensionality reduction
A new unsupervised forward orthogonal search (FOS) algorithm is introduced for feature selection and ranking. In the new algorithm, features are selected in a stepwise way, one at a time, by estimating the capability of each specified candidate feature subset to represent the overall features in the measurement space. A squared correlation function is employed as the criterion to measure the dependency between features and this makes the new algorithm easy to implement. The forward orthogonalization strategy, which combines good effectiveness with high efficiency, enables the new algorithm to produce efficient feature subsets with a clear physical interpretation
An adaptive orthogonal search algorithm for model subset selection and non-linear system identification
A new adaptive orthogonal search (AOS) algorithm is proposed for model subset selection and non-linear system identification. Model structure detection is a key step in any system identification problem. This consists of selecting significant model terms from a redundant dictionary of candidate model terms, and determining the model complexity (model length or model size). The final objective is to produce a parsimonious model that can well capture the inherent dynamics of the underlying system. In the new AOS algorithm, a modified generalized cross-validation criterion, called the adjustable prediction error sum of squares (APRESS), is introduced and incorporated into a forward orthogonal search procedure. The main advantage of the new AOS algorithm is that the mechanism is simple and the implementation is direct and easy, and more importantly it can produce efficient model subsets for most non-linear identification problems
An efficient nonlinear cardinal B-spline model for high tide forecasts at the Venice Lagoon
An efficient class of nonlinear models, constructed using cardinal B-spline (CBS) basis functions, are proposed for high tide forecasts at the Venice lagoon. Accurate short term predictions of high tides in the lagoon can easily be calculated using the proposed CBS models
Sparse model identification using a forward orthogonal regression algorithm aided by mutual information
A sparse representation, with satisfactory approximation accuracy,
is usually desirable in any nonlinear system identification and signal
processing problem. A new forward orthogonal regression algorithm, with
mutual information interference, is proposed for sparse model selection and
parameter estimation. The new algorithm can be used to construct parsimonious
linear-in-the-parameters models
A new class of wavelet networks for nonlinear system identification
A new class of wavelet networks (WNs) is proposed for nonlinear system identification. In the new networks, the model structure for a high-dimensional system is chosen to be a superimposition of a number of functions with fewer variables. By expanding each function using truncated wavelet decompositions, the multivariate nonlinear networks can be converted into linear-in-the-parameter regressions, which can be solved using least-squares type methods. An efficient model term selection approach based upon a forward orthogonal least squares (OLS) algorithm and the error reduction ratio (ERR) is applied to solve the linear-in-the-parameters problem in the present study. The main advantage of the new WN is that it exploits the attractive features of multiscale wavelet decompositions and the capability of traditional neural networks. By adopting the analysis of variance (ANOVA) expansion, WNs can now handle nonlinear identification problems in high dimensions
A comparative study on global wavelet and polynomial models for nonlinear regime-switching systems
A comparative study of wavelet and polynomial models for non-linear Regime-Switching (RS) systems is carried out. RS systems, considered in this study, are a class of severely non-linear systems, which exhibit abrupt changes or dramatic breaks in behaviour, due to RS caused by associated events. Both wavelet and polynomial models are used to describe discontinuous dynamical systems, where it is assumed that no a priori information about the inherent model structure and the relative regime switches of the underlying dynamics is known, but only observed input-output data are available. An Orthogonal Least Squares (OLS) algorithm interfered with by an Error Reduction Ratio (ERR) index and regularised by an Approximate Minimum Description Length (AMDL) criterion, is used to construct parsimonious wavelet and polynomial models. The performance of the resultant wavelet models is compared with that of the relative polynomial models, by inspecting the predictive capability of the associated representations. It is shown from numerical results that wavelet models are superior to polynomial models, in respect of generalisation properties, for describing severely non-linear RS systems
- …