The uniform first-order theory of ground tree rewrite graphs is the set of all pairs consisting of a ground tree rewrite system and a first-order sentence that holds in the graph defined by the ground tree rewrite system. We prove that the complexity of the uniform first-order theory of ground tree rewrite graphs is in ATIME(2 poly(n) , O(n)). Providing a matching lower bound, we show that ther...

The continuous scaling down of technology, there is the exponential increase in leakage current. The MTCMOS is an attractive design to reduce the leakage current in idle state. Sleep-to-Active mode transition is an important concern in MTCMOS circuit because it produces ground bounce noise. In this paper, Threshold Voltage tuning method with MTCMOS circuit is used to reduce the ground bounce no...

This paper presents a practical methodology for optimization of concentrically braced steel frames subjected to forward directivity near-fault ground motions, based on the concept of uniform deformation theory. This is performed by gradually shifting inefficient material from strong parts of the structure to the weak areas until a state of uniform deformation is achieved. In this regard, to ove...

The study of ground spaces of local Hamiltonians is a fundamental task in condensed matter physics. In terms of computational complexity theory, a common focus has been to estimate a given Hamiltonian’s ground state energy. However, from a physics perspective, it is often more relevant to understand the structure of the ground space itself. In this paper, we pursue this latter direction by intr...

Concepts of greater and greater complexity can be constructed by building systems of entities, by relating other entities to that system with a figure-ground relation, by embedding concepts of figure-ground in the concept of change, by embedding that in causality, and by coarsening the granularity and beginning the process over again. This process can be called the Ontological Ascent. It pervad...

In this communication the ground handling fleet management problem at airports is considered with the aim of improving aircraft service at arrival and departure while the operational cost of the ground service fleets is taken into account. The complexity of the considered problem, as well as, operational considerations lead to propose an on-line decentralized management structure where the crit...

Considering a worldwide tendency, air transports are growing very fast and many changes have taken place in planning, management and decision making process. Given the complexity of airport operation, the best use of existing capacity is the key driver of efficiency and productivity. This paper deals with the evaluation framework for the ground access at airports, by using a set of mode choice ...

It is well known that the confluence property of ground term rewrite systems (ground TRSs) is decidable in polynomial time. For an efficient implementation, the degree of this polynomial is of great interest. The best complexity bound in the literature is given by Comon, Godoy and Nieuwenhuis (2001), who describe an O(n5) algorithm, where n is the size of the ground TRS. In this paper we improv...

We introduce a notion of a polynomial type complexity of a multivariate polynomial. We provide examples of polynomial type complexities, including the determinantal complexity. We present two algorithms (not very efficient) to construct test functions for lower bounds (or explicit obstructions) of a polynomial type complexity, one of them is based on Gröbner bases, the other uses the resultant ...

Abstract: A new framework is presented for saliency based object detection in naturally complex scenes. In this framework, the random distribution of the scale and chromatic aspects of image complexity are exploited for the multi-fractal articulation of scene image into the ground-object structure and object images, respectively. Due to the intrinsic coherence of the scale and chromatic aspects...