Problems associated with #nding strings that are within a speci#ed Hamming distance of a given set of strings occur in several disciplines. In this paper, we use techniques from parameterized complexity to assess non-polynomial time algorithmic options and complexity for the COMMON APPROXIMATE SUBSTRING (CAS) problem. Our analyses indicate under which parameter restrictions useful algorithms ar...

Proof systems with sequents of the form U ` for proving validity of a propositional modal-calculus formula over a set U of states in a given model usually handle xed-point formulae through unfolding, thus allowing such formulae to reappear in a proof. Tagging is a technique originated by Winskel for annotating xed-point formulae with information about the proof states at which these are unfolde...

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

In this paper, we prove some …xed point theorems for two hybrid pairs of mappings in 2-metric spaces by using some weaker conditions. Mathematics subject classi…cation: 47H10, 54H25. Key words and phrases: Coincidence point, common …xed point, compatible maps, weak commutativity of type (KB) :

Existence of critical renormalization group trajectory for a hierarchical Ising model in 4 dimensions is shown. After 70 iterations of renormalization group transformations, the critical Ising model is mapped into a vicinity of the Gaussian xed point. Convergence of the subsequent trajectory to the Gaussian xed point is shown by power decay of the eeective coupling constant. The analysis in the...

In this paper we give a numerical description of the neighbourhood of a xed point of a symplectic map undergoing a transition from linear stability to complex instability i e the so called Hamiltonian Hopf bifurcation We have considered both the direct and inverse cases The study is based on the numerical computation of the Lyapunov families of invariant curves near the xed point We show how th...

We de ne a value-based modal -calculus, built from rst-order formulas, modalities, and xed point operators parameterized by data variables, which allows to express temporal properties involving data. We interpret this logic over CRL terms de ned by linear process equations. The satisfaction of a temporal formula by a CRL term is translated to the satisfaction of a rst-order formula containing p...

It is critical to have an induction method for reasoning about re-cursive programs expressed as xed points, for otherwise our reasoning ability is severely impaired. The xed point induction rule developed by deBakker and Scott is one such well known principle. Here we propose a new induction method, computational induction , which is an induction on the computation process. Computational induct...

We address the approximate analysis of large, open networks of general nite-buuer queues. We start from the analysis of large, open innnite-buuer queueing networks (QNs), as proposed by K uhn and later extended by Whitt, in which large QNs are decomposed into a number of individual GIjGj1 queues, characterized by the rst and second moment of the service and interarrival time distribution. We re...

For nearly incompressible elasticity, volumetric locking is a well-known phenomenon with low-order (cubic or lower) fi nite element method methods, of which continuous extended fi nite element methods (XFEMs) are no exception. We will present an XFEM that is simultaneously lock-free and optimally convergent. Based on our earlier work of an optimally convergent discontinuous-Galerkin-based XFEM,...