نتایج جستجو برای: alternate

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

Journal: :Ultrasound in Obstetrics and Gynecology 1992

2007
Jeroen Keijser Sheelagh Carpendale Mark Hancock

The desire to have intuitive, seamless 3D interaction fuels research into new 3D interaction approaches. However, research continues to rely on Brunelleschi’s perspective to provide a sense of visual depth to create a 3D graphical display. The interactive control space has been mapped directly into the 3D virtual display space without much thought about the effect that perspective distortion ha...

2013
Elizabeth N. Wesson

Models of evolutionary dynamics are often approached via the replicator equation, which in its standard form is given by ẋi = xi ( fi (x)−φ) , i = 1, . . . ,n, where xi is the frequency, or relative abundance, of strategy i, fi is its fitness, and φ = ∑i=1 xi fi is the average fitness. A game-theoretic aspect is introduced to the model via the payoff matrix A, where Ai, j is the expected payoff...

2017
Mosayeb Moradniani Zaker Salehi Zia Obeidavi

A 67-year-old woman presented to our clinic with 5 years history of intermittent dysphasia. She described dysphasia during the intake of solid food and sometimes with liquid food. She did not note abdominal pain, hematemesis, or melena, but in the past two years, she noted a weight loss of 5 kgs. Her medical history was significant only for hypertension, which was controlled by 100 mg daily dos...

Journal: :Medicina 1973
M S Halpern G J Nau R J Levi M B Rosenbaum M V Elizari J O Lazzari

Wenckebach periods of alternate beats (AW) can be described as a 2:1 atrioventricular (A-V) block in which the conducted P waves show progressive prolongation of the P-R interval of the Wenckebach type. However, while classical Wenckebach periods terminate with a single blocked P wave, AW necessarily ends with (or begins from) two consecutive blocked P waves. Five clinical cases and several exp...

A. Maheswari, M. Vijayalakshmi P. Jeyanthi,

Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...

Journal: :Proceedings of the Japan Academy 1954

Journal: :Journal of Approximation Theory 1987

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

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