Gait Analysis for Classification

This thesis describes a representation of gait appearance for the purpose of person identification and classification. This gait representation is based on simple localized image features such as moments extracted from orthogonal view video silhouettes of human walking motion. A suite of time-integration methods, spanning a range of coarseness of time aggregation and modeling of feature distributions, are applied to these image features to create a suite of gait sequence representations. Despite their simplicity, the resulting feature vectors contain enough information to perform well on human identification and gender classification tasks. We demonstrate the accuracy of recognition on gait video sequences collected over different days and times and under varying lighting environments. Each of the integration methods are investigated for their advantages and disadvantages. An improved gait representation is built based on our experiences with the initial set of gait representations. In addition, we show gender classification results using our gait appearance features, the effect of our heuristic feature selection method, and the significance of individual features.

Triangulation by Continuous Embedding

When triangulating a belief network we aim to obtain a junction tree of minimum state space. Searching for the optimal triangulation can be cast as a search over all the permutations of the network's vaeriables. Our approach is to embed the discrete set of permutations in a convex continuous domain D. By suitably extending the cost function over D and solving the continous nonlinear optimization task we hope to obtain a good triangulation with respect to the aformentioned cost. In this paper we introduce an upper bound to the total junction tree weight as the cost function. The appropriatedness of this choice is discussed and explored by simulations. Then we present two ways of embedding the new objective function into continuous domains and show that they perform well compared to the best known heuristic.

A Formulation for Active Learning with Applications to Object Detection

We discuss a formulation for active example selection for function learning problems. This formulation is obtained by adapting Fedorov's optimal experiment design to the learning problem. We specifically show how to analytically derive example selection algorithms for certain well defined function classes. We then explore the behavior and sample complexity of such active learning algorithms. Finally, we view object detection as a special case of function learning and show how our formulation reduces to a useful heuristic to choose examples to reduce the generalization error.

Optimizing Product Line Designs: Efficient Methods and Comparisons

We compare a broad range of optimal product line design methods. The comparisons take advantage of recent advances that make it possible to identify the optimal solution to problems that are too large for complete enumeration. Several of the methods perform surprisingly well, including Simulated Annealing, Product-Swapping and Genetic Algorithms. The Product-Swapping heuristic is remarkable for its simplicity. The performance of this heuristic suggests that the optimal product line design problem may be far easier to solve in practice than indicated by complexity theory.

All-Optical Unicast/Multicast Routing in WDM Networks

Optical transport networks (OTN) must be prepared in terms of better resource utilization, for accommodating unicast and multicast traffic together. Light-trees have been proposed for supporting multicast connections in OTN. Nevertheless when traffic grooming is applied in light-trees, resources can be underutilized as traffic can be routed to undesirable destinations in order to avoid optical-electrical-optical (OEO) conversions. In this paper, a novel architecture named S/G light- tree for supporting unicast/multicast connections is proposed. The architecture allows traffic dropping and aggregation in different wavelengths without performing OEO conversions. A heuristic that routes traffic demands using less wavelengths by taking advantage of the proposed architecture is designed as well. Simulation results show that the architecture can minimize the number of used wavelengths and OEO conversions when compared to light-trees

G+: Enhanced Traffic Grooming in WDM Mesh Networks using Lighttours

In this article, a new technique for grooming low-speed traffic demands into high-speed optical routes is proposed. This enhancement allows a transparent wavelength-routing switch (WRS) to aggregate traffic en route over existing optical routes without incurring expensive optical-electrical-optical (OEO) conversions. This implies that: a) an optical route may be considered as having more than one ingress node (all inline) and, b) traffic demands can partially use optical routes to reach their destination. The proposed optical routes are named "lighttours" since the traffic originating from different sources can be forwarded together in a single optical route, i.e., as taking a "tour" over different sources towards the same destination. The possibility of creating lighttours is the consequence of a novel WRS architecture proposed in this article, named "enhanced grooming" (G+). The ability to groom more traffic in the middle of a lighttour is achieved with the support of a simple optical device named lambda-monitor (previously introduced in the RingO project). In this article, we present the new WRS architecture and its advantages. To compare the advantages of lighttours with respect to classical lightpaths, an integer linear programming (ILP) model is proposed for the well-known multilayer problem: traffic grooming, routing and wavelength assignment The ILP model may be used for several objectives. However, this article focuses on two objectives: maximizing the network throughput, and minimizing the number of optical-electro-optical conversions used. Experiments show that G+ can route all the traffic using only half of the total OEO conversions needed by classical grooming. An heuristic is also proposed, aiming at achieving near optimal results in polynomial time

Mapping sub-flows to p2mp LSPs

In previous work we proposed a multi-objective traffic engineering scheme (MHDB-S model) using different distribution trees to multicast several flows. In this paper, we propose a heuristic algorithm to create multiple point-to-multipoint (p2mp) LSPs based on the optimum sub-flow values obtained with our MHDB-S model. Moreover, a general problem for supporting multicasting in MPLS networks is the lack of labels. To reduce the number of labels used, a label space reduction algorithm solution is also considered

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more

Adaptive business intelligence for an open negotiation environment

Engineering of negotiation model allows to develop effective heuristic for business intelligence. Digital ecosystems demand open negotiation models. To define in advance effective heuristics is not compliant with the requirement of openness. The new challenge is to develop business intelligence in advance exploiting an adaptive approach. The idea is to learn business strategy once new negotiation model rise in the e-market arena. In this paper we present how recommendation technology may be deployed in an open negotiation environment where the interaction protocol models are not known in advance. The solution we propose is delivered as part of the ONE Platform, open source software that implements a fully distributed open environment for business negotiation

Anclajes estadísticos : construcciones experienciales en los grupos sociales

Estando plenamente definidos desde la PNL los conceptos de ancla y anclaje, este documento define las maneras en las que los mismos, ocurriendo de forma colectiva, alteran los comportamientos de los grupos sociales y la importancia de su estudio.

www.interfase32.com

Proyecto de investigación realizado en plataforma web con programación HTML5. Esta investigación es la reconstrucción de 7 años de actividades (2003-2010) generadas en un centro cultural ubicado en la calle 32 con carrera 13 en la ciudad de Bogotá. Este proyecto contiene textos periodísticos, académicos, entrevistas, archivos de audio y fotografías. Además de reconstruir la historia de lo ocurrido en este edificio, la investigación estudia las relaciones entre colectivos artísticos, políticos y juveniles en el contexto social bogotano.

El modelo integral y su aplicación en terapia

La presente monografía es una revisión de la literatura frente a los postulados fundamentales del modelo integral propuesto por Ken Wilber y la aplicación de dicho modelo a la psicoterapia. Se presentan cada una de los elementos que sostienen esta meta-perspectiva tales como cuadrantes, niveles, líneas, y estados, y la forma en que cada uno de ellos se relaciona con la psicoterapia integral. Se abordan a continuación temas como los diferentes niveles de terapia, las etapas del desarrollo de la identidad, las patologías típicas en cada una de ellas y las posibles intervenciones para manejarlas, el rol que posee el terapeuta y algunos otros campos de aplicación del modelo integral a terapias grupales y al asesoramiento.

Corporación Villa Jazz Festival: una organización inteligente

Este proyecto consiste en una consultoría para la transformación y fortalecimiento gerencial de la Corporación Villa Jazz Festival. Dicha consultoría apunta a convertir a la Corporación en una organización inteligente.

Elementos de reflexión sobre la resiliencia urbana: usos criticables y aportes potenciales

El propósito de este texto es discutir el concepto de resiliencia y buscar su interés heurístico para los análisis de vulnerabilidad urbana. El término resiliencia es omnipresente en la retórica de las declaraciones internacionales, de las políticas públicas y en las reflexiones académicas en el campo de los riesgos y desastres en ciudades. Se discute esta noción con el fin de entender sus raíces y desvelar sus presupuestos ideológicos. Al mismo tiempo, el término resiliencia presenta el interés de fomentar debates y cuestiones teóricas en el campo científico y en el sociopolítico de la formulación de nuevas políticas públicas. Más allá de los enfoques focalizados sobre el fortalecimiento delas capacidades locales, los aportes heurísticos del concepto de resiliencia para los análisis de riesgos en el medio urbano provienen de sus fundamentos en la teoría de los sistemas complejos. Así, se resaltan nuevos enfoques y soportes conceptuales que permiten entender mejor la vulnerabilidadde las grandes aglomeraciones urbanas.

La disonancia cognitiva y trampa de la memoria en decisiones de Inversión: caso colombiano

Este documento es el resultado de una investigación bajo el enfoque de Finanzas Corporativas del Comportamiento, disciplina relevante en el mundo financiero desde el 2002 y que hasta el momento poco se ha investigado en Colombia. Esta difiere del supuesto tradicional de la racionalidad de los individuos en la toma de decisiones financieras, ya que pueden ser influenciadas por sesgos cognitivos y emocionales que la teoría ortodoxa no tiene en cuenta en sus supuestos. Esta investigación busca indagar, desde el punto de vista conceptual y mediante el análisis de resultados de estudio de campo con operadores del mercado bursátil colombiano, sobre la posible presencia de elementos comportamentales en las decisiones de inversión. Los sesgos que se evaluaron fueron: disonancia cognitiva, heurístico de disponibilidad y sesgo de confirmación. Para la recolección de fuentes primarias, una encuesta fue enviada a los operadores Colombianos, categorizados en operadores con experiencia y operadores jóvenes. Después del filtro, 142 encuestas fueron seleccionadas para el análisis. Los principales hallazgos fueron que los jóvenes son más propensos a experimentar disonancia cognitiva y heurístico de disponibilidad y en ambas categorías, los sesgos analizados influencian medianamente la toma de decisiones de inversión.