نتایج جستجو برای: simulation variables

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

2012
Sanfeng Chen Shuai Li Bo Liu Yuesheng Lou Yongsheng Liang

Variable structure strategy is widely used for the control of sensor-actuator systems modeled by Euler-Lagrange equations. However, accurate knowledge on the model structure and model parameters are often required for the control design. In this paper, we consider model-free variable structure control of a class of sensor-actuator systems, where only the online input and output of the system ar...

2005
V. Kisselev T. Heege S. Miksa N. Pinnel

The Modular Inversion Program (MIP) is a processing and development tool designed for retrieval and mapping of hydro-biological parameters obtained from multiand hyperspectral remote sensing measurements. The architecture of the program binds a set of general and transferable computational schemes in a chain, connecting bio-physical parameters with the measured reflected radiance. The radiative...

Journal: :Journal of Machine Learning Research 2016
Lei Yang Shaogao Lv Junhui Wang

Variable selection is popular in high-dimensional data analysis to identify the truly informative variables. Many variable selection methods have been developed under various model assumptions. Whereas success has been widely reported in literature, their performances largely depend on validity of the assumed models, such as the linear or additive models. This article introduces a model-free va...

Journal: :desert 2013
gh.r. zehtabian h. mohammad asgari m. tahmoures

our main objective in the present study was to assess the spatial variation of chemical and physical water properties. prior to the design of groundwater quality monitoring networks, it is essential to investigate the spatial structure of the groundwater quality variables. a case study is presented which used ground water quality observations from groundwater domestic wells in the dameghan, ira...

2008
Bernd Brassel Sebastian Fischer

Functional logic languages extend the setting of functional programming by non-deterministic choices, free variables and narrowing. Most existing approaches to simulate logic features in functional languages do not preserve laziness, i.e., they can only model strict logic programming like in Prolog. Lazy functional logic programming however, has interesting properties supporting a more declarat...

1999
Franz Edward Boas Michael Liang

We synthesized polymers displaying multiple copies of a peptide from the cystic fibrosis transmembrane conductance regulator (residues 108-117). This peptide is the minimal sequence needed for binding of Pseudomonas aeruginosa. Using an in vitro bacterial internalization assay, our preliminary results indicate that such a polyvalent ligand can prevent P. aeruginosa from attaching to (and being ...

2007
Holger Sturm Frank Wolter Michael Zakharyaschev

The paper consists of two parts. The rst one is a concise introduction to epistemic (both propositional and predicate) logic with common knowl-ege operator. As the full common knowledge predicate logics are not even recursively enumerable, in the second part we introduce and investigate the monodic fragment of these logics which allows applications of the epistemic operators to formulas with at...

Journal: :IJAC 2007
Wenhua Zhao

Let z = (z1, z2, · · · , zn) be noncommutative free variables and t a formal parameter which commutes with z. Let k be a unital commutative ring of any characteristic and Ft(z) = z−Ht(z) with Ht(z) ∈ k[[t]]〈〈z〉〉 ×n and o(Ht(z)) ≥ 2. Note that Ft(z) can be viewed as a deformation of the formal map F (z) := z−Ht=1(z) when it makes sense. The inverse map Gt(z) of Ft(z) can always be written as Gt(...

2002
SEBASTIAN BAUER

In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional , in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified , where the next-time operator can be applied only to formulas with at most one fre...

Journal: :CoRR 2017
Pierre Lescanne

Affine λ-terms are λ-terms in which each bound variable occurs at most once and linear λ-terms are λ-terms in which each bound variable occurs once. and only once. In this paper we count the number of closed affine λ-terms of size n, closed linear λ-terms of size n, affine β-normal forms of size n and linear β-normal forms of size n, for different ways of measuring the size of λ-terms. From the...

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

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