نتایج جستجو برای: at least

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

Journal: :Eur. J. Comb. 2012
Sandra R. Kingan Manoel Lemos

For a matroid M , an element e such that both M \ e and M/e are regular is called a regular element of M . We determine completely the structure of non-regular matroids with at least two regular elements. Besides four small size matroids, all 3-connected matroids in the class can be pieced together from F7 or S8 and a regular matroid using 3-sums. This result takes a step toward solving a probl...

2007
Andrew Trotman Nils Pharo Dylan Jenkinson

During a session of the INEX 2006 workshop in Schloss Dagstuhl the first at-INEX experiment was run. Participants were asked to assess topics in order to increase the number of multiple assessed topics available for analysis (and in order to increase the number of assessors per topic). This contribution presents the experimental set-up, the experiment, and an analysis of the results. When exami...

2015
Jeff Langford

Enterprise security involves people, process and technology. The principle of least privilege can and should be applied to all of those areas An expansion of the topic of 'least privilege' has some importance because, those responsible for information security, have had some past difficulty explaining it or gaining acceptance for this important principle. It is often referenced and occasionally...

Journal: :The Ulster Medical Journal 1971
A. G. Signy

LOOKING BACK over the years it is fairly obvious that there has been little or no career guidance in medicine. Apart from the odd chat with a senior often not much senior to the young graduate himself nothing was readily available to the newly qualified doctor about future prospects in the great variety of medical fields prospects, that is, of training needs facilities or vacancies. Yet little ...

Journal: :Formalized Mathematics 2008
Michal Trybulec

This is the second article on regular expression quantifiers. [4] introduced the quantifiers m to n occurrences and optional occurrence. In the sequel, the quantifiers: at least m occurrences and positive closure (at least 1 occurrence) are introduced. Notation and terminology were taken from [8], several properties of regular expressions from [7]. The notation and terminology used here are int...

1999
Manfred Krifka

One of the success stories in formal semantics is the analysis of NPs as generalized quantifiers, which can be traced back from Barwise & Cooper (1981) via Montague to Frege. The great attraction of this analysis is that it allows for a compositional analysis of the meaning of noun phrases that is consistent with independently motivated assumptions about their syntax. For example, Barwise and C...

Journal: :Electronic Notes in Theoretical Computer Science 2019

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

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