Self-reconfiguring modular robotModular self-reconfiguring robotic systems or self-reconfigurable modular robots are autonomous kinematic machines with variable morphology. Beyond conventional actuation, sensing and control typically found in fixed-morphology robots, self-reconfiguring robots are also able to deliberately change their own shape by rearranging the connectivity of their parts, in order to adapt to new circumstances, perform new tasks, or recover from damage.
Connection (principal bundle)In mathematics, and especially differential geometry and gauge theory, a connection is a device that defines a notion of parallel transport on the bundle; that is, a way to "connect" or identify fibers over nearby points. A principal G-connection on a principal G-bundle P over a smooth manifold M is a particular type of connection which is compatible with the action of the group G. A principal connection can be viewed as a special case of the notion of an Ehresmann connection, and is sometimes called a principal Ehresmann connection.
Joint replacementReplacement arthroplasty (from Greek arthron, joint, limb, articulate, + plassein, to form, mould, forge, feign, make an image of), or joint replacement surgery, is a procedure of orthopedic surgery in which an arthritic or dysfunctional joint surface is replaced with an orthopedic prosthesis. Joint replacement is considered as a treatment when severe joint pain or dysfunction is not alleviated by less-invasive therapies. It is a form of arthroplasty, and is often indicated from various joint diseases, including osteoarthritis and rheumatoid arthritis.
Theory of computationIn theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones). The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental capabilities and limitations of computers?".
Conservative vector fieldIn vector calculus, a conservative vector field is a vector field that is the gradient of some function. A conservative vector field has the property that its line integral is path independent; the choice of any path between two points does not change the value of the line integral. Path independence of the line integral is equivalent to the vector field under the line integral being conservative. A conservative vector field is also irrotational; in three dimensions, this means that it has vanishing curl.
Three-dimensional spaceIn geometry, a three-dimensional space (3D space, 3-space or, rarely, tri-dimensional space) is a mathematical space in which three values (coordinates) are required to determine the position of a point. Most commonly, it is the three-dimensional Euclidean space, the Euclidean n-space of dimension n=3 that models physical space. More general three-dimensional spaces are called 3-manifolds. Technically, a tuple of n numbers can be understood as the Cartesian coordinates of a location in a n-dimensional Euclidean space.
Vector calculusVector calculus, or vector analysis, is concerned with differentiation and integration of vector fields, primarily in 3-dimensional Euclidean space The term "vector calculus" is sometimes used as a synonym for the broader subject of multivariable calculus, which spans vector calculus as well as partial differentiation and multiple integration. Vector calculus plays an important role in differential geometry and in the study of partial differential equations.
Model of computationIn computer science, and more specifically in computability theory and computational complexity theory, a model of computation is a model which describes how an output of a mathematical function is computed given an input. A model describes how units of computations, memories, and communications are organized. The computational complexity of an algorithm can be measured given a model of computation. Using a model allows studying the performance of algorithms independently of the variations that are specific to particular implementations and specific technology.
Periodic trendsIn chemistry, periodic trends are specific patterns that are present in the Periodic table that illustrate different aspects of certain elements when grouped by period and/or group. They were discovered by the Russian chemist Dmitri Mendeleev in the year 1863. Major periodic trends include atomic radius, ionization energy, electron affinity, electronegativity, valency and metallic character. These trends exist because of the similar electron configurations of the elements within their respective groups or periods; they reflect the periodic nature of the elements.
Complex lamellar vector fieldIn vector calculus, a complex lamellar vector field is a vector field which is orthogonal to a family of surfaces. In the broader context of differential geometry, complex lamellar vector fields are more often called hypersurface-orthogonal vector fields. They can be characterized in a number of different ways, many of which involve the curl. A lamellar vector field is a special case given by vector fields with zero curl. The adjective "lamellar" derives from the noun "lamella", which means a thin layer.
