“Eternal Ballet” In Plato’s Cave

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Overuse Injuries in Professional Ballet

Methods: This was a descriptive cross-sectional study performed between January 1, 2005, and October 10, 2010, on injuries occurring in professional dancers from leading Spanish dance companies who practiced disciplines such as classical, neoclassical, contemporary, and Spanish ballet. Data, including type of injury, were obtained from specialized medical services at the Trauma Service, Fremap,...

متن کامل

Ballet balance strategies

Animating physically realistic human characters is challenging, since human observers are highly tuned to recognize human cues such as emotion and gender from motion patterns. The main contribution of this paper is a new model firmly based on biomechanics. The model has been developed to animate balance and basic movements of a ballet dancers. It is supported by computer simulated experiments a...

متن کامل

Signalling ballet in four dimensions

The UCD community has made this article openly available. Please share how this access benefits you. Your story matters! (@ucd_oa) Some rights reserved. For more information, please see the item record link above.

متن کامل

Eternal m-security subdivision numbers in graphs

An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...

متن کامل

Eternal m- Security Subdivision Numbers in Graphs

Let  be a simple graph with vertex set  and edges set . A set  is a dominating set if every vertex in  is adjacent to at least one vertex  in . An eternal 1-secure set of a graph G is defined as a dominating set  such that for any positive integer k and any sequence  of vertices, there exists a sequence of guards   with  and either  or  and  is a dominating set. If we take a guard on every ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filozofija i drustvo

سال: 2018

ISSN: 0353-5738,2334-8577

DOI: 10.2298/fid1803441p