نتایج جستجو برای: trivial extension

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

2009
Frieder Nake

In recent years, combinations of terms have become popular where one component is „computational“ or some relative of it, whereas the other is „aesthetics“ or „art“ or „creativity“, etc. The Dagstuhl seminar, to which this personal note owes its appearance, had the number 09291 and the title Computational Creativity: an Interdisciplinary Approach. Good old C. P. Snow would probably like such te...

2000
Hajime Tsuji

We develop an intersection theory for a singular hermitian line bundle with positive curvature current on a smooth projective variety and irreducible curves on the variety. And we prove the existence of a natural rational fibration structure associated with the singular hermitian line bundle. Also for any pseudoeffective line bundle on a smooth projective variety, we prove the existence of a na...

Journal: :international journal of agricultural management and development 2013
saeid fe'li gholamreza pezeshki rad hassan sadighi esmaeil shahbazi seyed javad ghoraishi abhari

the purpose of this study was to assess the process of extension program development in iranian agricultural extension system (iaes). the research instrument was a structural questionnaire with close-ended questions which its validity and reliability was confirmed by using expert panel and cranach’s alpha test, respectively. the target population of this research included all extension managers...

2014
Ringo Baumann Wolfgang Dvorák Thomas Linsbichler Hannes Strass Stefan Woltran

Abstract argumentation frameworks (AFs) are one of the most studied formalisms in AI. In this work, we introduce a certain subclass of AFs which we call compact. Given an extension-based semantics, the corresponding compact AFs are characterized by the feature that each argument of the AF occurs in at least one extension. This not only guarantees a certain notion of fairness; compact AFs are th...

2014
FRANZISKA JAHNKE

The authors have shown recently that the canonical p-henselian valuation is uniformly ∅-definable in the elementary class of fields which have characteristic p or contain a primitive pth root of unity ζp. In order to do this, we proved a classification of the canonical p-henselian valuation via case distinction. One of the cases discussed was previously not even known for algebraic extensions o...

2009
Mirela Çiperiani

Let E/Q be an elliptic curve and p a prime of supersingular reduction for E. Denote by K∞ the anticyclotomic Zp-extension of an imaginary quadratic field K which satisfies the Heegner hypothesis. Assuming that p splits in K/Q, we prove that X(K∞, E)p∞ has trivial Λ-corank and, in the process, also show that HSel(K∞, Ep∞) and E(K∞)⊗Qp/Zp both have Λ-corank two.

2009
LUKASZ KOSIŃSKI

The theorem showing that there are no non-trivial proper holomorphic self-mappings in the tetrablock is proved. We obtain also some general extension results for proper holomorphic mappings and we prove that the Shilov boundary is invariant under proper holomorphic mappings between some classes of domains containing among others (m1, . . . , mn)-balanced domains. It is also shown that the tetra...

2008
Tamás Antal

A coordinate system free definition of complex structure multidimensional item response theory (MIRT) for dichotomously scored items is presented. The point of view taken emphasizes the possibilities and subtleties of understanding MIRT as a multidimensional extension of the “classical” unidimensional item response theory models. The main theorem of the paper is that every monotonic MIRT model ...

Journal: :Advances in Complex Systems 2016
Tadas Telksnys Zenonas Navickas Martynas Vaidelys Minvydas Ragulskis

The concept of the order of a 2-sequence is introduced in this paper. The order of a 2-sequence is a natural but not trivial extension of the order of one-dimensional (1D) linear recurrent sequences. Necessary and sufficient conditions for the generation of 2-sequences with finite order from the minimal information subset are derived. It is demonstrated that the order of 2-sequences can be used...

Journal: :Electr. Notes Theor. Comput. Sci. 2010
Ranald Clouston

Many formal systems, particularly in computer science, may be expressed through equations modulated by assertions regarding the ‘freshness of names’. It is the presence of binding operators that make such structure non-trivial. Clouston and Pitts’s Nominal Equational Logic presented a formalism for this style of reasoning in which support for name binding was implicit. This paper extends this l...

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

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