Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "maximal cycle" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Families of smooth curves on surface singularities and wedges
Autorzy:
Gonzalez-Sprinberg, Gérard
Lejeune-Jalabert, Monique
Powiązania:
https://bibliotekanauki.pl/articles/1294669.pdf
Data publikacji:
1997
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
surface singularities
smooth curves
maximal cycle
wedges
Opis:
Following the study of the arc structure of singularities, initiated by J. Nash, we give criteria for the existence of smooth curves on a surface singularity (S,O) and of smooth branches of its generic hypersurface section. The main applications are the following: the existence of a natural partition of the set of smooth curves on (S,O) into families, a description of each of them by means of chains of infinitely near points and their associated maximal cycle and the existence of smooth curves on any sandwiched surface singularity. A wedge centered at a smooth curve on (S,O) is essentially a one-parameter deformation of the parametrization of the curve. We show that there is no wedge centered at smooth curves of two different families.
Źródło:
Annales Polonici Mathematici; 1997, 67, 2; 179-190
0066-2216
Pojawia się w:
Annales Polonici Mathematici
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Monitoring Plyometric Exercise Intensity Using Rating of Perceived Exertion Scale
Autorzy:
Asadi, Abbas
Powiązania:
https://bibliotekanauki.pl/articles/1031792.pdf
Data publikacji:
2014
Wydawca:
PPHU Projack Jacek Wąsik
Tematy:
maximal effort
perceived exertion
stretch-shortening cycle
Opis:
The aim of this investigation was to determine the effectiveness of rating of perceived exertion (RPE) scale to measure plyometric exercise intensity during low (L), moderate (M) and high (H) intensity. Fourteen physically active students (age; 21±1.1 y, height; 178.7±8.2 cm and body mass; 74.6±9.1 kg) volunteered to participate in this study and performed each intensity once separated with 24 h recovery. The H consisted of 1 set of 5 repetitions at 90% of the subject’s vertical jump height (VJH). The M consisted of 10 repetitions at 70% VJT, and the L consisted of 1 set of 15 repetitions at 50% VJH. RPE was measured following the completion each intensity using 0-10 Borg RPE scale. Data was analyzed using repeated measures ANOVA and the level of significant was set at p < 0.05. The results indicated increases in RPE following enhancing exercise intensity (p < 0.05). Performing fewer repetitions at a higher intensity was perceived to be more difficult than performing more repetitions at a lower intensity. The results of the current investigation revealed that the RPE method is effective in monitoring different plyometric exercise and training intensities and it can be recommend that strength and conditioning professionals and athletes use the RPE method based on the effectiveness tool for monitoring their plyometric exercise and training sessions at different intensities.
Źródło:
Physical Activity Review; 2014, 2; 10-15
2300-5076
Pojawia się w:
Physical Activity Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on maximal common subgraphs of the Diracs family of graphs
Autorzy:
Bucko, Jozef
Mihók, Peter
Saclé, Jean-François
Woźniak, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/744168.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
maximal common subgraph
Dirac's family
Hamiltonian cycle
Opis:
Let ⁿ be a given set of unlabeled simple graphs of order n. A maximal common subgraph of the graphs of the set ⁿ is a common subgraph F of order n of each member of ⁿ, that is not properly contained in any larger common subgraph of each member of ⁿ. By well-known Dirac's Theorem, the Dirac's family ⁿ of the graphs of order n and minimum degree δ ≥ [n/2] has a maximal common subgraph containing Cₙ. In this note we study the problem of determining all maximal common subgraphs of the Dirac's family $ ^{2n}$ for n ≥ 2.
Źródło:
Discussiones Mathematicae Graph Theory; 2005, 25, 3; 385-390
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies