نتایج جستجو برای: constructing consistant

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

Journal: :Revue française de gestion 2021

Cet article présente une pédagogie oubliée, dite de la « démonstration », développée lors création du Conservatoire des arts et métiers à Paris en 1794 selon l’idée qu’il faut faire voir, montrer objets, machines mouvement plutôt que d’expliquer abstraitement. En quoi un format imaginé fin XVIII e siècle peut-il contribuer aujourd’hui formation management l’innovation ? L’objectif est présenter...

2008
R. B. Appleby

We calculate resummed perturbative predictions for gaps-between-jets processes and compare to HERA data. Our calculation of this non-global observable needs to include the effects of primary gluon emission (global logarithms) and secondary gluon emission (non-global logarithms) to be correct at the leading logarithm (LL) level. We include primary emission by calculating anomalous dimension matr...

Journal: :Nihon Hinyokika Gakkai zasshi. The japanese journal of urology 2003
Mitsuru Saito Hideaki Kakinuma Masahiro Iinuma Norihiko Tsuchiya Naotake Shimoda Chikara Ohyama Shigeru Satoh Kazunari Sato Tetsuro Kato

A 43-year-old woman with mental retardation, epilepsy, and urinary stone disease had a right renal tumor. Acne-like anthema around the nose and dental pits of the nine teeth were typical signs of tuberous sclerosis (TSC), and the biopsy finding of the facial anthema was consistant with TSC. The pathological diagnosis of laparoscopic nephrectomy was renal cell carcinoma in the hemorrhagic cyst. ...

Journal: :KAS African law study library 2021

Le devoir de sauvegarder les emplois a poussé pouvoirs publics à prendre certaines mesures consistant notamment interdire licenciements massifs pendant la période l’état d’urgence proclamé suite covid-19 en RDC. Par contre, il est droit pour entreprises confrontées aux difficultés économiques procéder leur réorganisation par réduction des effectifs leurs travailleurs. Cet article examine l’appl...

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

This paper mirrors an invited talk to ISCISC 2011. It is not a conventional paper so much as an essay summarizing thoughts on a little-talked-about subject. My goal is to intermix some introspection about definitions with examples of them, these examples drawn mostly from cryptography. Underpinning our discussion are two themes. The first is that definitions are constructed. They are i...

Journal: :bulletin of the iranian mathematical society 0
e. lashani department of mathematics‎, ‎science and research‎ ‎branch‎, ‎islamic azad university(iau)‎, ‎tehran‎, ‎iran. a. soleyman jahan department of mathematics‎, ‎university of kurdistan‎, ‎p.o‎. ‎box 66177-15175‎, ‎sanadaj‎, ‎iran‎.

‎recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎in this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎then we use this construction to generalize the result due to cook and nagel‎.

Journal: :journal of algorithms and computation 0
christian barrientos department of mathematics, clayton state university, morrow, georgia 30260, usa sarah minion department of mathematics, clayton state university, morrow, georgia 30260, usa

a graceful labeling of a graph g of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of g, such that when each edge of g has assigned a weight, given by the absolute di erence of the labels of its end vertices, the set of weights is {1, 2,..., n}. if a graceful labeling f of a bipartite graph g assigns the smaller labels to one of the two stable sets of g, then f...

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

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

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