نتایج جستجو برای: ve degree

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

Journal: :Computer-Aided Design 2002
Chih-Hsing Chu Carlo H. Séquin

Geometric design of quadratic and cubic developable Be Âzier patches from two boundary curves is studied in this paper. The conditions for developability are derived geometrically from the de Casteljau algorithm and expressed as a set of equations that must be ful®lled by the Be Âzier control points. This set of equations allows us to infer important properties of developable Be Âzier patches t...

2008
Frank Steinicke Gerd Bruder Timo Ropinski Klaus Hinrichs

Walking is the most natural way of moving within a virtual environment (VE). Mapping the user’s movement one-to-one to the real world clearly has the drawback that the limited range of the tracking sensors and a rather small working space in the real word restrict the users’ interaction. In this paper we introduce concepts for virtual locomotion interfaces that support exploration of large-scal...

2012
Adam Bohn Peter J. Cameron Peter Müller

The multivariate Tutte polynomial ẐM of a matroid M is a generalization of the standard two-variable version, obtained by assigning a separate variable ve to each element e of the ground set E. It encodes the full structure of M . Let v = {ve}e∈E , let K be an arbitrary field, and suppose M is connected. We show that ẐM is irreducible over K(v), and give three self-contained proofs that the Gal...

1996
Ken-ichi Magata Tomoki Hamagami Mitsuo Komura

This report describes a method for estimating the separation degree at the bunsetsu boundary (SD) for Japanese text-to-speech synthesis. Our method gives us the prosodic symbol without using complicated linguistic analysis. First we classify bunsetsus according to the nal morpheme. Each classi ed bunsetsu has a temporary separation degree in advance. We call this \the estimated separation degre...

2013
Ali Gürbüz Aysegül Kurt Merve Astekin Mustafa Sari Mehmet Sahinoglu

Özet. Yazılım proje yöneticileri hedefledikleri bütçe ve takvim içerisinde hatalardan arındırılmış ve kendisinden beklenen işlevleri yerine getiren yazılımlar geliştirmek isterler. Bir yazılımın hatalardan arındırılmış olduğunun ve beklenen işlevleri yerine getirdiğinin gösterilmesi doğrulama ve geçerleme faaliyetinin bir parçası olan yazılım testlerinin temel amacıdır. Ancak yazılım testleri p...

Journal: :Journal of applied physiology 2001
M J Jeng D Trevisanuto C M Weis W W Fox A B Cullen M R Wolfson T H Shaffer

To study the effect of ventilation strategy on perfluorochemical (PFC) elimination profile (evaporative loss profile; E(L)), 6 ml/kg of perflubron were instilled into anesthetized normal rabbits. The strategy was to maintain minute ventilation (VE, in ml/min) in three groups: VE(L) (low-range VE, 208 +/- 2), VE(M) (midrange VE, 250 +/- 9), and VE(H) (high-range VE, 293 +/- 1) over 4 h. In three...

2009
Vildan ERTEKİN Mukadder A. SELİMOĞLU Zeki BAKİR

Spondiloepifizyal displazya konjenitalı, karakteristik olarak normal eller ve ayaklar, paytak yürüyüş, pektus karinatus, kısa boyun ve yassı yüzlü 7 yaşında bir erkek vaka sunuldu. Radyolojik bulgular epifizler ve metafizlerde nokta kalsifikasyonlar, sklerotik ve radyolusent bölgelerle metafizin genişlemesiyle metafizyel disorganizasyon, generalize osteopeni ve geri kalmış kemik yaşını içerir. ...

1997
Gunnar Brinkmann Philippe Rolland

In this paper, we give a process to enumerate all maximal planar graphs with minimum degree ve, with a xed number of vertices. These graphs are called MPG5 [6]. We have used the algorithm [3] to generate these graphs. For the MPG5 enumeration we have used the general method due to Brenda McKay in [5]; i.e. by computing the orbits set of automorphism group and canonical forms.

1996
GUOLI DING BOGDAN OPOROWSKI DANIEL P. SANDERS

The paper presents several results on edge partitions and vertex partitions of graphs into graphs with bounded size components. We show that every graph of bounded tree-width and bounded maximum degree admits such partitions. We also show that an arbitrary graph of maximum degree three has a vertex partition into two graphs, each of which has components on at most two vertices, and an edge part...

2014
Oliver J Rider Mina Asaad Ntobeko Ntusi Emma Wainwright Genevieve Clutton Gemma Hancock Rajarshi Banerjee Alex Pitcher Katherine Samaras Kieran Clarke Stefan Neubauer Lucy Dorrell Cameron J Holloway

BACKGROUND Patients with treated Human Immunodeficiency Virus-1 (HIV) infection are at increased risk of cardiovascular events. Traditionally much of this risk has been attributed to metabolic and anthropometric abnormalities associated with HIV, which are similar to the metabolic syndrome (MS), an established risk factor for cardiovascular mortality. It remains unclear whether treated HIV infe...

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

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