Search results for "Theoretical Computer Science"
showing 10 items of 1151 documents
On Diving in Trees Thomas Schwentick
2000
The paper is concerned with queries on tree-structured data. It defines fragments of first-order logic (FO) and FO extended by regular expressions along paths. These fragments have the same expressive power as the full logics themselves. On the other hand, they can be evaluated reasonably efficient, even if the formula which represents the query is considered as part of the input.
Some decisional problems on rational relations
1997
Abstract In this paper we prove that the problem of deciding whether a deterministic rational relation is star-free is recursively solvable, although the same problem for any rational relation is undecidable. We also prove that a rational relation is star-free if and only if it is aperiodic and deterministic.
Asynchronously switched control of discrete impulsive switched systems with time delays
2013
This paper is concerned with the stabilization problem for a class of uncertain discrete impulsive switched delay systems under asynchronous switching. The so-called asynchronous switching means that the switches between the candidate controllers and system modes are asynchronous. By using the average dwell time (ADT) approach, sufficient conditions for the existence of an asynchronously switched controller is derived such that the resulting closed-loop system is exponentially stable. The desired controller gains and the admissible switching signals are obtained in terms of a set of matrix inequalities. A numerical example is given to illustrate the effectiveness of the proposed method.
On the satisfiability problem for fragments of two-variable logic with one transitive relation
2019
Abstract We study the satisfiability problem for two-variable first-order logic over structures with one transitive relation. We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential quantifiers are guarded by transitive atoms. As this fragment enjoys neither the finite model property nor the tree model property, to show decidability we introduce a novel model construction technique based on the infinite Ramsey theorem. We also point out why the technique is not sufficient to obtain decidability for the full two-variable logic with one transitive relation; hence, contrary to our previous claim, [FO$^2$ with one transitive relation is deci…
Pairwise Learning to Rank by Neural Networks Revisited: Reconstruction, Theoretical Analysis and Practical Performance
2020
We present a pairwise learning to rank approach based on a neural net, called DirectRanker, that generalizes the RankNet architecture. We show mathematically that our model is reflexive, antisymmetric, and transitive allowing for simplified training and improved performance. Experimental results on the LETOR MSLR-WEB10K, MQ2007 and MQ2008 datasets show that our model outperforms numerous state-of-the-art methods, while being inherently simpler in structure and using a pairwise approach only.
Robust existence of nonhyperbolic ergodic measures with positive entropy and full support
2021
We prove that for some manifolds $M$ the set of robustly transitive partially hyperbolic diffeomorphisms of $M$ with one-dimensional nonhyperbolic centre direction contains a $C^1$-open and dense subset of diffeomorphisms with nonhyperbolic measures which are ergodic, fully supported and have positive entropy. To do so, we formulate abstract conditions sufficient for the construction of an ergodic, fully supported measure $\mu$ which has positive entropy and is such that for a continuous function $\phi\colon X\to\mathbb{R}$ the integral $\int\phi\,d\mu$ vanishes. The criterion is an extended version of the control at any scale with a long and sparse tail technique coming from the previous w…
Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
2011
Abstract: The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.
Right-arm rotation distance between binary trees
2003
We consider a transformation on binary trees, named right-arm rotation, which is a special instance of the well-known rotation transformation. Only rotations at nodes of the right arm of the trees are allowed. Using ordinal tools, we give an efficient algorithm for computing the right-arm rotation distance between two binary trees, i.e., the minimum number of rightarm rotations necessary to transform one tree into the other.
On solving separable block tridiagonal linear systems using a GPU implementation of radix-4 PSCR method
2018
Partial solution variant of the cyclic reduction (PSCR) method is a direct solver that can be applied to certain types of separable block tridiagonal linear systems. Such linear systems arise, e.g., from the Poisson and the Helmholtz equations discretized with bilinear finite-elements. Furthermore, the separability of the linear system entails that the discretization domain has to be rectangular and the discretization mesh orthogonal. A generalized graphics processing unit (GPU) implementation of the PSCR method is presented. The numerical results indicate up to 24-fold speedups when compared to an equivalent CPU implementation that utilizes a single CPU core. Attained floating point perfor…