نتایج جستجو برای: perfect complex

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

2016
Ann Marie Murray

In 1960 Berge came up with the concept of perfect graphs, and in doing so, conjectured some characteristics about them. A perfect graph is a graph in which the chromatic number of every induced subgraph equals the size of the largest clique of that subgraph [2]. Two conjectures are now known as the Perfect Graph Theorem and the Strong Perfect Graph Theorem. Both of these theorems make deteminin...

Journal: :IJPEDS 2016
Eddie Cheng Justin Kelm Roi Orzach Brian Xu

The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The burnt pancake graph is a more complex variant of the pancake graph. In this talk, we examine the properties ...

2007
Edmond J. Vanderperre

We consider a basic multiple cold standby system attended by a single repairman. The system satisfies the usual conditions (i.i.d. random variables, perfect repair, instantaneous and perfect switch, queueing). We analyse the long-run availability of the system based on a functional equation valid in the complex plane. The solution is constructed by means of a Cauchy-type integral. As an example...

Journal: :Journal of Physics A: Mathematical and General 2004

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده علوم انسانی 1390

this study investigated the effects of manipulating the cognitive complexity of tasks along +/- few elements and the time limits on l2 learners writing performance. to conduct the study, 60 iranian efl learners with two levels of proficiency, low and high intermediate, were selected and assigned to three groups based on the time devoted to task completion. the participants performed both a simp...

M. S. Sadeghipour and R. Razmi,

Using the highly recommended numerical techniques, a finite element computer code is developed to analyse the steady incompressible, laminar and turbulent flows in 2-D domains with complex geometry. The Petrov-Galerkin finite element formulation is adopted to avoid numerical oscillations. Turbulence is modeled using the two equation k-ω model. The discretized equations are written in the form o...

M. S. Sadeghipour and R. Razmi,

Using the highly recommended numerical techniques, a finite element computer code is developed to analyse the steady incompressible, laminar and turbulent flows in 2-D domains with complex geometry. The Petrov-Galerkin finite element formulation is adopted to avoid numerical oscillations. Turbulence is modeled using the two equation k-ω model. The discretized equations are written in the form o...

Journal: :Journal of Combinatorial Theory, Series B 1977

2011
Fey Parrill Benjamin Bergen Patricia Lichtenstein

Grammatical aspect is a pervasive linguistic device that, according to linguistic analyses, allows speakers to encode different ways of construing events. For instance, the progressive (I am writing a book) is thought to reflect increased focus on the internal details of an event, as contrasted with the perfect (I have written a book). However, there is to date no experimental evidence that spe...

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

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