نتایج جستجو برای: induction time

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

2006
Miroslav Krbec Hans-Jürgen Schmeisser

Our concern in this paper lies with imbeddings of general spaces of Besov and Lizorkin-Triebel type with dominating mixed derivatives in the first critical case. We employ multivariate exponential Orlicz and Lorentz-Orlicz spaces in the role of targets. We study basic properties of the target spaces, in particular, we compare them with usual exponential spaces, showing that in this case the mul...

Journal: :J. Symb. Log. 2015
Graham Emil Leigh

We present a cut elimination argument that witnesses the conservativity of the compositional axioms for truth (without the extended induction axiom) over any theory interpreting a weak subsystem of arithmetic. In doing so we also fix a critical error in Halbach’s original presentation. Our methods show that the admission of these axioms determines a hyper-exponential reduction in the size of de...

Journal: :Discrete Mathematics & Theoretical Computer Science 2007
Ludger Rüschendorf Eva-Maria Schopp

Exponential bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise as parameters of divide and conquer type algorithms. We derive tail bounds from estimates of the Laplace transforms and of the moment sequences. For the proof we use some clas...

Journal: :Expert Syst. Appl. 2011
Noelia Sánchez-Maroño Amparo Alonso-Betanzos

In this paper, a new wrapper method for feature selection, namely IAFN-FS (Incremental ANalysis Of VAriance and Functional Networks for Feature Selection) is presented. The method uses as induction algorithm the AFN (ANOVA and Functional Networks) learning method; follows a backward non-sequential strategy from the complete set of features (thus allowing to discard several variables in one step...

Journal: :Groups Complexity Cryptology 2012
James B. Wilson

Direct products of finite groups are a simple method to construct new groups from old ones. A difficult problem by comparison is to prove a generic group G is indecomposable, or locate a proper nontrivial direct factor. To solve this problem it is shown that in most circumstances G has a proper nontrivial subgroup M such that every maximal direct product decomposition Q of G/M induces a unique ...

Journal: :anesthesiology and pain medicine 0
zahid hussain khan department of anaesthesiology and intensive care, faculty of medicine, tehran university of medical sciences, tehran, iran; department of anaesthesiology and intensive care institution, imam khomeini hospital complex, tehran university of medical sciences, keshavarz blv. tehran, iran. tel: +98-2161192828, fax: +98-2166581537 shahram samadi department of anaesthesiology and intensive care, faculty of medicine, tehran university of medical sciences, tehran, iran sanaz ameli department of anaesthesiology and intensive care, faculty of medicine, tehran university of medical sciences, tehran, iran cyrus emir alavi department of anaesthesiology and intensive care, anaesthesiology research center, faculty of medicine, guilan university of medical sciences, rasht, iran

conclusions although propofol remains a standard agent for such types of surgeries, lidocaine proved equally effective and coupled with its low cost, minimal side effects and omission of other hypnotic agents was a plausible induction agent and a maintenance drug in the selected cases. case presentation lidocaine was applied as the sole anaesthetic for induction and maintenance during aneurysm ...

2007
Horacio Arló-Costa Cristina Bicchieri Branden Fitelson C. Bicchieri

The paper provides a framework for representing belief-contravening hypotheses in games of perfect information. The resulting t-extended information structures are used to encode the notion that a player has the disposition to behave rationally at a node. We show that there are models where the condition of all players possessing this disposition at all nodes (under their control) is both a nec...

2012
Horacio Arlo-Costa Cristina Bicchieri Horacio Arló-Costa Branden Fitelson

The paper provides a framework for representing belief-contravening hypotheses in games of perfect information. The resulting t-extended information structures are used to encode the notion that a player has the disposition to behave rationally at a node. We show that there are models where the condition of all players possessing this disposition at all nodes (under their control) is both a nec...

2005
Noam Zeilberger

We present modal BI and show that the necessary propositions are exactly the “pure” propositions, in the sense of separation logic. We demonstrate the use of modal BI for reasoning with axioms and by induction, and also relate 2 to the exponential modality !.

2010
Maria Emilia Maietti Steven Vickers

Suppose in an arithmetic unverse we have two predicates φ and ψ for natural numbers, satisfying a base case φ(0) → ψ(0) and an induction step that, for generic n, the hypothesis φ(n) → ψ(n) allows one to deduce φ(n+ 1) → ψ(n+ 1). Then it is already true in that arithmetic universe that (∀n)(φ(n) → ψ(n)). This is substantially harder than in a topos, where cartesian closedness allows one to form...

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

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