997 resultados para Visual Programming
Resumo:
Numerous psychophysical experiments have shown an important role for attentional modulations in vision. Behaviorally, allocation of attention can improve performance in object detection and recognition tasks. At the neural level, attention increases firing rates of neurons in visual cortex whose preferred stimulus is currently attended to. However, it is not yet known how these two phenomena are linked, i.e., how the visual system could be "tuned" in a task-dependent fashion to improve task performance. To answer this question, we performed simulations with the HMAX model of object recognition in cortex [45]. We modulated firing rates of model neurons in accordance with experimental results about effects of feature-based attention on single neurons and measured changes in the model's performance in a variety of object recognition tasks. It turned out that recognition performance could only be improved under very limited circumstances and that attentional influences on the process of object recognition per se tend to display a lack of specificity or raise false alarm rates. These observations lead us to postulate a new role for the observed attention-related neural response modulations.
Resumo:
This thesis presents there important results in visual object recognition based on shape. (1) A new algorithm (RAST; Recognition by Adaptive Sudivisions of Tranformation space) is presented that has lower average-case complexity than any known recognition algorithm. (2) It is shown, both theoretically and empirically, that representing 3D objects as collections of 2D views (the "View-Based Approximation") is feasible and affects the reliability of 3D recognition systems no more than other commonly made approximations. (3) The problem of recognition in cluttered scenes is considered from a Bayesian perspective; the commonly-used "bounded-error errorsmeasure" is demonstrated to correspond to an independence assumption. It is shown that by modeling the statistical properties of real-scenes better, objects can be recognized more reliably.
Resumo:
The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.
Resumo:
The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.
Resumo:
The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.
Resumo:
The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.
Resumo:
We study the preconditioning of symmetric indefinite linear systems of equations that arise in interior point solution of linear optimization problems. The preconditioning method that we study exploits the block structure of the augmented matrix to design a similar block structure preconditioner to improve the spectral properties of the resulting preconditioned matrix so as to improve the convergence rate of the iterative solution of the system. We also propose a two-phase algorithm that takes advantage of the spectral properties of the transformed matrix to solve for the Newton directions in the interior-point method. Numerical experiments have been performed on some LP test problems in the NETLIB suite to demonstrate the potential of the preconditioning method discussed.
Resumo:
Poesia visual guanyadora del concurs literari organitzat a la Facultat per celebrar la Diada de St. Jordi 2005 amb el lema "Sentir paraules"
Resumo:
Aquest llibre és el producte d'anys de cooperació entre equips de recerca de cinc països diferents, tot ells Key Institutions de la xarxa Childwatch International, en el marc d'un projecte plurinacional sobre adolescents i mitjans
Resumo:
In the eighties, John Aitchison (1986) developed a new methodological approach for the statistical analysis of compositional data. This new methodology was implemented in Basic routines grouped under the name CODA and later NEWCODA inMatlab (Aitchison, 1997). After that, several other authors have published extensions to this methodology: Marín-Fernández and others (2000), Barceló-Vidal and others (2001), Pawlowsky-Glahn and Egozcue (2001, 2002) and Egozcue and others (2003). (...)
Resumo:
We study four measures of problem instance behavior that might account for the observed differences in interior-point method (IPM) iterations when these methods are used to solve semidefinite programming (SDP) problem instances: (i) an aggregate geometry measure related to the primal and dual feasible regions (aspect ratios) and norms of the optimal solutions, (ii) the (Renegar-) condition measure C(d) of the data instance, (iii) a measure of the near-absence of strict complementarity of the optimal solution, and (iv) the level of degeneracy of the optimal solution. We compute these measures for the SDPLIB suite problem instances and measure the correlation between these measures and IPM iteration counts (solved using the software SDPT3) when the measures have finite values. Our conclusions are roughly as follows: the aggregate geometry measure is highly correlated with IPM iterations (CORR = 0.896), and is a very good predictor of IPM iterations, particularly for problem instances with solutions of small norm and aspect ratio. The condition measure C(d) is also correlated with IPM iterations, but less so than the aggregate geometry measure (CORR = 0.630). The near-absence of strict complementarity is weakly correlated with IPM iterations (CORR = 0.423). The level of degeneracy of the optimal solution is essentially uncorrelated with IPM iterations.
Resumo:
Las fotografías son de Paco Vega y la propia autora
Resumo:
Esta unidad didáctica utiliza la sidra como hilo conductor, una bebida típica de la región obtenida de la manzana, elegida por su cercanía al ambiente familiar y social de los alumnos, por dar a conocer un patrimonio cultural y artístico, cercano pero bastante desconocido y por ser tratado al mismo tiempo desde varias áreas: Ciencias Sociales, Música, Ciencias Naturales, Lengua Española, Lengua y Cultura Asturiana, etc...Se seleccionaron los elementos naturales y objetos relacionados con la fabricación de la sidra, así como en algunas de las obras artísticas inspiradas en ella. Sin olvidar su aspecto conceptual, se plantea con un carácter eminentemente práctico, evitando el planteamiento de ejercicios de solución única, procurando que cada actividad propuesta se pueda realizar con mayor o menor grado de dificultad, dependiendo de las características del alumnado. Alternan actividades individuales con otras colectivas. La evaluación se realiza a partir de unos criterios que tratan de medir la propia evaluación de los alumnos. Al final se presenta abundante material de apoyo: que va desde la explicación de los útiles de dibujo, a ejemplos de construcciones geométricas, pasando por la descripción de conceptos visuales, así como de las técnicas y materiales más comunes. Concluye el material con una selección de fotos e ilustraciones que servirán para el desarrollo de la unidad, así como una relación de pintores asturianos relacionados con el tópico.
Resumo:
Resumen basado en la publicaci??n
Resumo:
Comprobar si los cambios curriculares que se introducen en la investigación producen cambios en el desarrollo de los alumnos. Ofrecer la posibilidad de aplicación de estos resultados a pedagogos y profesionales de Educación Especial cuyos alumnos tengan características semenjantes. Fase de inmersión, exploración, diagnóstico y formulación de hipótesis; análisis de los recursos, elaboración del plan de intervención; intervención educativa, y evaluación del proceso. Memorandum análitico y anotaciones de investigación, entrevistas y cuestionarios, anotaciones de otros observadores, test y pruebas psicopedagógicas, documentación fotográfica y perfiles. Análisis de documentos. La aportación de actividades perceptivo-visuales y motrices previas y simultáneas a la enseñanza lectoescritora proporciona unas habilidades que ayudan al aprendizaje por varias razones: los programas suponen la adquisición de estrategias que se corresponden con las exigidas para cualquier tarea escolar; el plan de intervención comprende tres aspectos el desarrollo de la comunicación verbal, asimilación de términos referidos a conceptos básicos de espacio, tiempo y cantidad y potenciar el lenguaje como regulador de la acción y aprendizaje. Fecha finalización tomada del código del documento.