878 resultados para Religious freedom
Resumo:
We describe our work on tight confinement of light using plasmonic structures. Polarization and modal degrees of freedom are shown to have a crucial effect on the nanoscale focusing properties of the optical field. © 2010 Optical Society of America.
Resumo:
In this paper, we study a problem of geometric inequalities for a Multi-degree of Freedom Neurons. Some new geometric inequalities for a Multi-degree of Freedom Neurons are established. As special cases, some known inequalities are deduced.
Resumo:
In this paper, we redefine the sample points set in the feature space from the point of view of weighted graph and propose a new covering model - Multi-Degree-of-Freedorn Neurons (MDFN). Base on this model, we describe a geometric learning algorithm with 3-degree-of-freedom neurons. It identifies the sample points secs topological character in the feature space, which is different from the traditional "separation" method. Experiment results demonstrates the general superiority of this algorithm over the traditional PCA+NN algorithm in terms of efficiency and accuracy.
Resumo:
An algorithm of PCA face recognition based on Multi-degree of Freedom Neurons theory is proposed, which based on the sample sets' topological character in the feature space which is different from "classification". Compare with the traditional PCA+NN algorithm, experiments prove its efficiency.
Resumo:
In this paper, we redefine the sample points set in the feature space from the point of view of weighted graph and propose a new covering model - Multi-Degree-of-Freedorn Neurons (MDFN). Base on this model, we describe a geometric learning algorithm with 3-degree-of-freedom neurons. It identifies the sample points secs topological character in the feature space, which is different from the traditional "separation" method. Experiment results demonstrates the general superiority of this algorithm over the traditional PCA+NN algorithm in terms of efficiency and accuracy.
Resumo:
The motion planning problem is of central importance to the fields of robotics, spatial planning, and automated design. In robotics we are interested in the automatic synthesis of robot motions, given high-level specifications of tasks and geometric models of the robot and obstacles. The Mover's problem is to find a continuous, collision-free path for a moving object through an environment containing obstacles. We present an implemented algorithm for the classical formulation of the three-dimensional Mover's problem: given an arbitrary rigid polyhedral moving object P with three translational and three rotational degrees of freedom, find a continuous, collision-free path taking P from some initial configuration to a desired goal configuration. This thesis describes the first known implementation of a complete algorithm (at a given resolution) for the full six degree of freedom Movers' problem. The algorithm transforms the six degree of freedom planning problem into a point navigation problem in a six-dimensional configuration space (called C-Space). The C-Space obstacles, which characterize the physically unachievable configurations, are directly represented by six-dimensional manifolds whose boundaries are five dimensional C-surfaces. By characterizing these surfaces and their intersections, collision-free paths may be found by the closure of three operators which (i) slide along 5-dimensional intersections of level C-Space obstacles; (ii) slide along 1- to 4-dimensional intersections of level C-surfaces; and (iii) jump between 6 dimensional obstacles. Implementing the point navigation operators requires solving fundamental representational and algorithmic questions: we will derive new structural properties of the C-Space constraints and shoe how to construct and represent C-Surfaces and their intersection manifolds. A definition and new theoretical results are presented for a six-dimensional C-Space extension of the generalized Voronoi diagram, called the C-Voronoi diagram, whose structure we relate to the C-surface intersection manifolds. The representations and algorithms we develop impact many geometric planning problems, and extend to Cartesian manipulators with six degrees of freedom.
Resumo:
Higher education has progressed fairly steadily to a common pedagogical approach which centres on the idea of alignment. In this arrangement, intended learning outcomes are identified and declared; learning activities which will enable the desired learning and development to be achieved are conceived and undertaken with the support of appropriate and effective teaching; and assessment which calls for these outcomes is (ideally) carefully designed and implemented. All three elements are aligned in advance. The same principles and practices underpinned by notions of alignment have been applied to date in most of the purposeful schemes for personal development planning. In this chapter I argue that lifewide learning, wherein learning and development often occur incidentally in multiple and varied real-world situations throughout an individual’s life course, calls for a different approach, and a different pedagogy. Higher education should therefore visualise lifewide learning as an emergent phenomenon wherein the outcomes of learning emerge later on, and are often unintended. Consequently, they cannot be defined in advance of the activities through which they are formed. The main purpose of this chapter is to offer some practical ideas to support the development of pedagogies that would enable programme designers to embed in their programmes the principle and practice of lifewide education.