Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Mathematics , 2011, Abstract: A Boolean function f over n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma of f, we can compute f_sigma(x) for any x in Z_2^n with good probability using q queries to g. We observe that any k-junta, that is, any function which depends only on k of its input variables, is O(2^k)-locally correctable. Moreover, we show that there are examples where this is essentially best possible, and locally correcting some k-juntas requires a number of queries which is exponential in k. These examples, however, are far from being typical, and indeed we prove that for almost every k-junta, O(k log k) queries suffice.
 Ciencia y Enfermería : Revista Iberoamericana de Investigacíon , 2012, Abstract: El propósito del artículo es presentar el coaching educativo como una estrategia pedagógica para desarrollar y fortalecer el liderazgo en enfermería. Enuncia los elementos que pueden facilitar o dificultar el liderazgo en enfermería y se destaca a la educación como el factor clave para la adquisición de competencias necesarias para su ejercicio. Finalmente, se proponen algunos lineamientos operacionales para fortalecer y potenciar el liderazgo en la formación de enfermeras/os a través del coaching educativo. The purpose of this article is to present the coaching education as a pedagogical strategy to develop and strengthen leadership in nursing. It states elements that may facilitate or hinder nursing leadership and education stands out as the key factor for the acquisition of necessary skills for their exercise. Finally, we propose some ways to strengthen and enhance leadership in the education of nurses through educative coaching.
 Manuel Ignacio Martínez Espinoza Revista de Investigaciones Políticas y Sociológicas (RIPS) , 2007, Abstract: en agosto de 2003, el Movimiento Zapatista creo a las Juntas de Buen Gobierno (JBG) en sus territorios, ubicados en el sureste de México, para fortalecer la aplicación de su autonomía. El texto analiza en profundidad la autonomía zapatista y concluye que, debido a que funciona como elemento orgánico del proyecto político zapatista, es una Autonomía de Resistencia . El argumento se expone en tres partes. En la primera, se revisan las líneas generales del Movimiento Zapatista y de las JBG. En la segunda, se establece el marco teórico para el estudio de la autonomía en las JBG. En la tercera, se analiza la autonomía de las JBG mediante el estudio de cuatro factores: el territorio, la autogestión, el autogobierno y la identidad. Finalmente, se adjunta un apartado de conclusiones que subraya las fortalezas y debilidades de la autonomía zapatista.
 Mathematics , 2011, Abstract: We present a generalization of the well-known problem of learning k-juntas in R^n, and a novel tensor algorithm for unraveling the structure of high-dimensional distributions. Our algorithm can be viewed as a higher-order extension of Principal Component Analysis (PCA). Our motivating problem is learning a labeling function in R^n, which is determined by an unknown k-dimensional subspace. This problem of learning a k-subspace junta is a common generalization of learning a k-junta (a function of k coordinates in R^n) and learning intersections of k halfspaces. In this context, we introduce an irrelevant noisy attributes model where the distribution over the "relevant" k-dimensional subspace is independent of the distribution over the (n-k)-dimensional "irrelevant" subspace orthogonal to it. We give a spectral tensor algorithm which identifies the relevant subspace, and thereby learns k-subspace juntas under some additional assumptions. We do this by exploiting the structure of local optima of higher moment tensors over the unit sphere; PCA finds the global optima of the second moment tensor (covariance matrix). Our main result is that when the distribution in the irrelevant (n-k)-dimensional subspace is any Gaussian, the complexity of our algorithm is T(k,\epsilon) + \poly(n), where T is the complexity of learning the concept in k dimensions, and the polynomial is a function of the k-dimensional concept class being learned. This substantially generalizes existing results on learning low-dimensional concepts.
 Polímeros , 2000, Abstract: Juntas unidas por ades o vêm sendo largamente empregadas em substitui o a pe as unidas por métodos convencionais de fixa o mecanica. A confiabilidade destas juntas deve considerar o efeito da presen a de defeitos na área colada sobre o comportamento mecanico da pe a. Neste trabalho analisou-se o comportamento mecanico de juntas sobrepostas simples em fun o da presen a de defeitos. Foi verificado, também, a adequa o para as juntas com defeitos dos principais modelos teóricos desenvolvidos para juntas sem defeitos.
 William Moreno Gómez ágora para la Educación Física y el Deporte , 2010, Abstract: RESUMEN.- El presente texto tiene como propósito la presentación del aparte temático “Educación corporal y Etnoeducación” de la Revista ágora para la Educación Física. Desde los procesos educativos, a través de rituales corporales formalizados o no formalizados (desde dentro o desde fuera), cada etnia, grupo, clase social, cada cultura, genera, produce, reproduce y constituye, diferentes modalidades etnoeducativas. Esta presentación plantea una discución sobre el sentido de reunir etnografías situadas que ayuden a documentar y comprender los estereotipos etno-corporales que dominan el panorama de la educación del cuerpo en este lugar del planeta.ABSTRACT.- This text is for purposes other than the presentation of thematic "physical education and ethno-education" of the Agora Journal of Physical Education. From the educational process, through ritual body formalized or not formalized (from inside or outside), each ethnic group, group, social class, every culture creates, produces, reproduces and is, different modes ethnic forms of education. This presentation presents a discussion on the meaning of collecting ethnographies located to help document and understand the body ethno stereotypes dominating the landscape of education of the body in this place on the planet.
 Argumentos (México, D.F.) , 2006, Abstract: this article presents a brief analysis of the indigenous autonomy organized by the zapatista communities around the juntas de buen gobierno since august 2003 and its relationship with the constitutional reform on indigenous rights approved by the mexican congress. comparing both autonomies, this article reflects on the constitutionality of the autonomy declared by the zapatista rebels.
 Computer Science , 2007, DOI: 10.1007/s11128-007-0061-6 Abstract: In this article we develop quantum algorithms for learning and testing juntas, i.e. Boolean functions which depend only on an unknown set of k out of n input variables. Our aim is to develop efficient algorithms: - whose sample complexity has no dependence on n, the dimension of the domain the Boolean functions are defined over; - with no access to any classical or quantum membership ("black-box") queries. Instead, our algorithms use only classical examples generated uniformly at random and fixed quantum superpositions of such classical examples; - which require only a few quantum examples but possibly many classical random examples (which are considered quite "cheap" relative to quantum examples). Our quantum algorithms are based on a subroutine FS which enables sampling according to the Fourier spectrum of f; the FS subroutine was used in earlier work of Bshouty and Jackson on quantum learning. Our results are as follows: - We give an algorithm for testing k-juntas to accuracy $\epsilon$ that uses $O(k/\epsilon)$ quantum examples. This improves on the number of examples used by the best known classical algorithm. - We establish the following lower bound: any FS-based k-junta testing algorithm requires $\Omega(\sqrt{k})$ queries. - We give an algorithm for learning $k$-juntas to accuracy $\epsilon$ that uses $O(\epsilon^{-1} k\log k)$ quantum examples and $O(2^k \log(1/\epsilon))$ random examples. We show that this learning algorithms is close to optimal by giving a related lower bound.