Search results for "abstract"
showing 10 items of 1959 documents
Abstraction of covariations in incidental learning and covariation bias
1997
Experiment 1 was devised to distinguish, in a given set of features composing drawn robots, those whose variations were related a priori for participants from those whose variations were a priori independent. In Expt 2, correlations were experimentally induced between a priori-related features for one group of participants (pre-primed group), and between a priori-independent features for another group {arbitrary group), in incidental learning conditions. A subsequent transfer phase revealed that participants' performances were sensitive to experimentally induced correlations in both groups. However, only the performances of the pre-primed group accurately matched the predictions of a statis…
Numerical decomposition of geometric constraints
2005
Geometric constraint solving is a key issue in CAD/CAM. Since Owen's seminal paper, solvers typically use graph based decomposition methods. However, these methods become difficult to implement in 3D and are misled by geometric theorems. We extend the Numerical Probabilistic Method (NPM), well known in rigidity theory, to more general kinds of constraints and show that NPM can also decompose a system into rigid subsystems. Classical NPM studies the structure of the Jacobian at a random (or generic) configuration. The variant we are proposing does not consider a random configuration, but a configuration similar to the unknown one. Similar means the configuration fulfills the same set of inci…
Contemporary Art as a Learning Experience
2012
Abstract Art has changed a lot during the last fifty years. In spite of that, the role of art in schools has remained the same. The aim of this paper is to show the many different ways contemporary art offers itself as an environment for learning. An idea of contemporary art as a learning experience presented here is based on teacher's views on the matter. The analysis of the material shows that by concretizing the properties of artworks and the experience produced by them, arguments for seeing contemporary art both as a credible and a necessary environment of learning can be found.
Memetic Algorithms in Continuous Optimization
2012
Intuitively, a set is considered to be discrete if it is composed of isolated elements, whereas it is considered to be continuous if it is composed of infinite and contiguous elements and does not contain “holes”.
On the Extension of the DIRECT Algorithm to Multiple Objectives
2020
AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…
A General Mathematical Formulation for Winding Layout Arrangement of Electrical Machines
2018
Winding design methods have been a subject of research for many years of the past century. Many methods have been developed, each one characterized by some advantages and drawbacks. Nowadays, the star of slots is the most widespread design tool for electrical machine windings. In this context, this paper presents a simple and effective procedure to determine the distribution of the slot EMFs over the phases and of the winding configuration in all possible typologies of electrical machines equipped with symmetrical windings. The result of this procedure gives a Winding Distribution Table (WDT), which can be used to define coils and coil groups connections and also to simply implement winding…
Heuristic algorithms for a storage location assignment problem in a chaotic warehouse
2014
The extensive application of emerging technologies is revolutionizing warehouse management. These technologies facilitate working with complex and powerful warehouse management models in which products do not have assigned fixed locations (random storage). Random storage allows the utilization of the available space to be optimized. In this context, and motivated by a real problem, this article presents a model that looks for the optimal allocation of goods in order to maximize the storage space availability within the restrictions of the warehouse. For the proposed model a construction method, a local search algorithm and different metaheuristics have been developed. The introduced algorit…
Reliable Planar Object Pose Estimation in Light Fields From Best Subaperture Camera Pairs
2018
International audience; A light-field camera can obtain richer information about a scene than a usual camera. This property offers a lot of potential for robot vision. In this paper, we present a method for pose estimation of a planar object with a light-field camera. The light-field camera can be regarded as a set of sub-aperture cameras. Although any combination of them can theoretically be used for the pose estimation, the accuracy depends on the combination. We show that the estimated pose error can be reduced by selecting the best pair of sub-aperture cameras. We have evaluated the accuracy of our approach with real experiments using a light-field camera in front of planar targets held…
On the numerical solution of some finite-dimensional bifurcation problems
1981
We consider numerical methods for solving finite-dimensional bifurcation problems. This paper includes the case of branching from the trivial solution at simple and multiple eigenvalues and perturbed bifurcation at simple eigenvalues. As a numerical example we treat a special rod buckling problem, where the boundary value problem is discretized by the shooting method.
Strict quasi-concavity and the differential barrier property of gauges in linear programming
2014
Concave gauge functions were introduced to give an analytical representation of cones. In particular, they give a simple and a practical representation of the positive orthant. There is a wide choice of concave gauge functions with interesting properties, representing the same cone. Besides the fact that a concave gauge cannot be identically zero on a cone(), it may be continuous, differentiable and even on its interior. The purpose of the present paper is to present another approach to penalizing the positivity constraints of a linear programme using an arbitrary strictly quasi-concave gauge representation. Throughout the paper, we generalize the concept of the central path and the analyti…