نتایج جستجو برای: stating its conditions

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

2016
John O'Neill

Towards the end of March last a young man presented himself at the Shahpur Dispensary, stating his willingness to submit to an operation for the cure of a right scrotal hernia. He was 23 years of age, well made, in good condition, in excellent spirits, and suffering from no affection besides the hernia. The hernia was of six years' duration, and was not very large, being about eight inches in i...

2011
Teresa Podsiadly-Marczykowska Rafal Zawislak

The article presents assumptions, and results of a test of experimental verification of a hypothesis stating that the use of the MammoEdit a tool that uses its own ontology and the embedded knowledge of mammography – increase the diagnostic accuracy as well as the reproducibility of mammographic interpretation. The graphical user interface of the editor was similarly assessed, as well as the ru...

2008
Nicola Fanizzi Claudia d'Amato Floriana Esposito

In this paper we focus on learning concept descriptions expressed in Description Logics. After stating the learning problem in this context, a FOIL-like algorithm is presented that can be applied to general DL languages, discussing related theoretical aspects of learning with the inherent incompleteness underlying the semantics of this representation. Subsequently we present an experimental eva...

1997
Sony Akkarakaran P. P. Vaidyanathan

A nonuniform filter bank (FB) is one whose channel decimation rates need not all be equal. While the theory and design of uniform FBs is a very well developed subject, there are several interesting open issues in the area of nonuniform FBs. Most nonuniform FB designs either result in approximate or near–perfect reconstruction, or involve cascading uniform FBs in tree structures. This leaves una...

2011
J. K. PRAJAPAT R. K. RAINA

This paper presents a result relating to subordination of analytic function in the unit disk and provides an improved version of a result published recently in [Math. Slovaca 60 (4) (2010), 471-484]. Besides stating and proving here a corrected form of this result, we also consider its generalization. The concluding remarks indicate briefly other possibilities of extensions to some of the resul...

2000
Giampaolo Bella Fabio Massacci Lawrence C. Paulson Piero Tramontano

The first phase of the SET protocol, namely Cardholder Registration, has been modelled inductively. This phase is presented in outline and its formal model is described. A number of basic lemmas have been proved about the protocol using Isabelle/HOL, along with a theorem stating that a certification authority will certify a given key at most once. Many ambiguities, contradictions and omissions ...

1993
Thomas Y. C. Woo Simon S. Lam

We present a new approach to the analysis of authenti-cation protocols. The approach consists of several elements: a speciication language for formally specifying authentication protocols, a semantic model for characterizing protocol executions, an assertion language for stating secrecy and correspondence properties, and procedures for verifying these properties. The main emphasis of this paper...

Journal: :Fuzzy Sets and Systems 2012
Karel Chvalovský

We show by standard automated theorem proving methods and freely available automated theorem prover software that axiom (A2), stating that multiplicative conjunction implies its first member, is provable from other axioms in fuzzy logics BL and MTL without using axiom (A3), which is known to be provable from other axioms [1]. We also use freely available automated model generation software to s...

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

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