نتایج جستجو برای: dependence polynomial
تعداد نتایج: 253488 فیلتر نتایج به سال:
The local Whittle (or Gaussian semiparametric) estimator of long range dependence, proposed by Künsch (1987) and analyzed by Robinson (1995a), has a relatively slow rate of convergence and a finite sample bias that can be large. In this paper, we generalize the local Whittle estimator to circumvent these problems. Instead of approximating the short-run component of the spectrum, φ(λ), by a cons...
A regression model whose regression function is the sum of a linear and a nonparametric component is presented. The design is random and the response and explanatory variables satisfy mixing conditions. A new local polynomial type estimator for the nonparametric component of the model is proposed and its asymptotic normality is obtained. Specifically, this estimator works on a prewhitening tran...
In this paper we study the expressive power of Horn-formulae in dependence logic and show that they can express NP-complete problems. Therefore we define an even smaller fragment D-Horn and show that over finite successor structures it captures the complexity class P of all sets decidable in polynomial time. Furthermore, we show that the open D-Horn-formulae correspond to the negative fragment ...
Retention behavior of molecules mostly depends on their chemical structure. Retention data of biologically active molecules could be an indirect relationship between their structure and biological or pharmacological activity, since the molecular structure affects their behavior in all pharmacokinetic stages. In the present paper, retention parameters (RM0) of biologically active 1,2-O-isopropyl...
Many problems from control theory can be stated as so-called robust LMI problems. In this paper, the theorem of Ehlich and Zeller, a powerful tool for analyzing polynomials and rational functions, will be presented and applied to the robust LMI problems which are used to analyze uncertain systems.
we find an explicit expression of the tutte polynomial of an $n$-fan. we also find a formula of the tutte polynomial of an $n$-wheel in terms of the tutte polynomial of $n$-fans. finally, we give an alternative expression of the tutte polynomial of an $n$-wheel and then prove the explicit formula for the tutte polynomial of an $n$-wheel.
We focus on how the choice of input-output representation has a crucial impact on the expressiveness of so-called “logics of polynomial time.” Our analysis illustrates this dependence in the context of Light Affine Logic (LAL), which is both a restricted version of Linear Logic, and a primitive functional programming language with restricted sharing of arguments. By slightly relaxing representa...
Modal dependence logic was introduced recently by Väänänen. It enhances the basic modal language by an operator =(). For propositional variables p1, . . . , pn, =(p1, . . . , pn−1, pn) intuitively states that the value of pn is determined by those of p1, . . . , pn−1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministi...
Gröbner bases are the computational method par excellence for studying polynomial systems. In the case of parametric polynomial systems one has to determine the reduced Gröbner basis in dependence of the values of the parameters. In this article, we present the algorithm GröbnerCover which has as inputs a finite set of parametric polynomials, and outputs a finite partition of the parameter spac...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید