نتایج جستجو برای: parameterized first order model transformation

تعداد نتایج: 3973614  

D. Behmardii S. Sedaghatiii Y. Ordokhaniii

In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اراک - دانشکده علوم پایه 1389

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان 1389

run-out-table (rot) is located between last finishing stand and down coiler in a hot strip mill. as the hot steel strip passes from rot, water jets impact on it from top and bottom and strip temperature decreases approximately from 800-950 °c to 500-750°c. the temperature history that strip experience while passing through rot affects significantly the metallurgical and mechanical properties, s...

2002
Markus Frick Martin Grohe

The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower bounds for fixed-parameter tractable model-checking problems for first-order and monadic second-order logic. We show that unless PTIME = NP, the model-checking problem for monadic second-order logic on finite words is...

2013
Hubie Chen Dániel Marx

We study the complexity of model checking in quantified conjunctive logic, that is, the fragment of first-order logic where both quantifiers may be used, but conjunction is the only permitted connective. In particular, we study block-sorted queries, which we define to be prenex sentences in multi-sorted relational first-order logic where two variables having the same sort must appear in the sam...

2017
Stephan Kreutzer

The model-checking problem for a logic L is the problem of decidig for a given formula φ ∈ L and structure A whether the formula is true in the structure, i.e. whether A |= φ. Model-checking for logics such as First-Order Logic (FO) or Monadic Second-Order Logic (MSO) has been studied intensively in the literature, especially in the context of algorithmic meta-theorems within the framework of p...

Journal: :Inf. Comput. 2012
Bingkai Lin Yijia Chen

We prove that finding a k-edge induced subgraph is fixedparameter tractable, thereby answering an open problem of Leizhen Cai [2]. Our algorithm is based on several combinatorial observations, Gauss’ famous Eureka theorem [1], and a generalization of the wellknown fpt-algorithm for the model-checking problem for first-order logic on graphs with locally bounded tree-width due to Frick and Grohe ...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2009
Stephan Kreutzer Anuj Dawar

We show that if C is a class of graphs which is nowhere dense then rst-order model-checking is xed-parameter tractable on C. As all graph classes which exclude a xed minor, or are of bounded local tree-width or locally exclude a minor are nowhere dense, this generalises algorithmic meta-theorems obtained for these classes in the past (see [11, 13, 4]). Conversely, if C is not nowhere dense and ...

Journal: :iranian journal of science and technology (sciences) 2013
e. allahbakhshi

in this paper, genetic algorithms (gas) are employed to control simultaneous linear systems in both state and output feedback. first, the similarity transformation is applied to obtain parameterized controllers. this requires solution of a system of equations and also some non-linear inequalities. gas are used to solve these equations and inequalities. therefore, the paper presents an analytica...

Journal: :CoRR 2017
Martin Grohe Nicole Schweikardt

We study an extension of first-order logic that allows to express cardinality conditions in a similar way as SQL’s COUNT operator. The corresponding logic FOC(P) was introduced by Kuske and Schweikardt [16], who showed that query evaluation for this logic is fixedparameter tractable on classes of databases of bounded degree. In the present paper, we first show that the fixed-parameter tractabil...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید