Systematic Construction of Goal-Oriented COTS Taxonomies

Informe de investigación realizado a partir de una estancia en el Department of Computer and Information Science de la Norwegian University of Science and Technology (NTNU), Noruega, entre setiembre i diciembre de 2006. El uso de componentes de software llamados Commercial-Off-The-Shelf (COTS) en el desarrollo de sistemas basados en componentes implica varios retos. Uno de ellos es la falta de información disponible y adecuada para dar soporte al proceso de selección de componentes a ser integrados. Para lidiar con estos problemas, se esta desarrollando un trabajo de tesis que propone un método llamado GOThIC (Goal-Oriented Taxonomy and reuse Infrastructure Construction). El método está orientado a construir una infrastructura de reuse para facilitar la búsqueda y reuse de componentes COTS. La estancia en la NTNU, reportada en este documento, tuvo como objetivo primordial las mejora del método y la obtención de datos empíricos para darle soporte. Algunos de los principales resultados fueron la obtención de datos empíricos fundamentando la utilización del método en ámbitos industriales de selección de componentes COTS, así como una nueva estrategia para conseguir de forma factible e incremental, la federación y reuso de los diferentes esfuerzos existentes para encontrar, seleccionar y mantener componentes COTS y Open Source (OSS) -comúnmente llamados componentes Off-The-Shelf (OTS) - en forma estructurada.

Study of the influence of grain size and precipitates on the electromagnetic losses in different grades of non-oriented fully processed electrical steel

The study was performed in the installations of OCAS, a Steel Research Centre of ArcelorMittal. Taking M32 steel (3.25%Si+0.9%Al) as the basis chemical composition and three different thicknesses (0.35, 0.5 and 0.65mm), different annealing conditions (temperature and time) have been applied in the laboratory simulator at St. Chély, France. The aim was to link annealing parameters, grain size and energy loss. It was determined the optimum annealing parameters to reach the lowest power losses for three different grades of non-oriented fully processed electrical steel. In addition, M250-50 samples having different magnetic behaviour (high and low losses) but the same grain size and texture, have been analyzed in terms of TEM observations of their precipitates, in the University of Marseille. The results reveal that a high amount of medium and big precipitates (&10 nm) worsen the magnetic properties of the material. The small precipitates (&10nm) do not have a strong influence on the magnetic properties. The presence of precipitates can have a great influence on the power losses and further work is clearly necessary.

Link between microstructure and properties in new metallurgical concepts for very low loss non-oriented electrical steel

The influence of chemistry and soaking temperature (maximal temperature of the continuous annealing) on the final properties of non-oriented electrical steels has been studied. With this objective two different studies have been performed. First the Mn, Ni and Cr content of a low loss electrical steel composition has been modified. An intermediate content and a high content of each element has been added in order to study the influence of this components on the magnetic looses, grain size and texture. Secondly the influence of the soaking temperature on magnetic properties, grain size and oxidation in four grades of non-oriented electrical steels (Steel A, B, C and D) was studied.

Desenvolupament d'aplicacions per a dispositius mòbils

La finalitat d’aquest projecte és obtenir una visió global de la programació per dispositius mòbils i a més fer una avaluació del que podria costar (tant les eines com el reciclatge de programadors) a una empresa dedicada a TIC començar a implementar aplicacions per a dispositius mòbils. Amb un plantejament molt ampli al principi i reduït només a tres opcions (BlackBerry, Windows Mobile i Android), es desenvolupa una aplicació per aquests dispositius. Els resultats obtinguts mostren que a nivell econòmic les millors opcions són el desenvolupament per Android (gratuït) i per BlackBerry (20$). Però en canvi a nivell d’adaptació dels llenguatges de programació la opció de Windows Mobile és la que presenta menys obstacles per passar de coneixements de programació d’aplicacions de servidor o sobre taula (en entorn .NET) a dispositius mòbils.

Object recognition for autonomous objects: comparison of two approaches

Report for the scientific sojourn at the Swiss Federal Institute of Technology Zurich, Switzerland, between September and December 2007. In order to make robots useful assistants for our everyday life, the ability to learn and recognize objects is of essential importance. However, object recognition in real scenes is one of the most challenging problems in computer vision, as it is necessary to deal with difficulties. Furthermore, in mobile robotics a new challenge is added to the list: computational complexity. In a dynamic world, information about the objects in the scene can become obsolete before it is ready to be used if the detection algorithm is not fast enough. Two recent object recognition techniques have achieved notable results: the constellation approach proposed by Lowe and the bag of words approach proposed by Nistér and Stewénius. The Lowe constellation approach is the one currently being used in the robot localization project of the COGNIRON project. This report is divided in two main sections. The first section is devoted to briefly review the currently used object recognition system, the Lowe approach, and bring to light the drawbacks found for object recognition in the context of indoor mobile robot navigation. Additionally the proposed improvements for the algorithm are described. In the second section the alternative bag of words method is reviewed, as well as several experiments conducted to evaluate its performance with our own object databases. Furthermore, some modifications to the original algorithm to make it suitable for object detection in unsegmented images are proposed.

Fear assessment in pigs exposed to a novel object test

The experiment aimed to study approach and locomotive behaviour as indicators of fear in a novel object test carried out in pigs. Thirty post-weaning (30 kg) and 30 finishing (90 kg) pigs were exposed to visual, auditory and olfactory novel stimuli during 2 different experiments. The facilities consisted of a test pen in which a trough was located. The trough contained chopped apples. Once the animals were trained to enter the test pen individually they were subjected to 3 different fear stimuli. These stimuli were applied in the test pen and next to the trough. The variables studied were feeding behaviour, approach behaviour (the distance and position of the animal with respect to the trough) and locomotive behaviour (general activity, reluctance to move, turning back and retreat attempts). Two groups were studied: saline and midazolam treated group. Twenty minutes before the start of the sessions, 15 post-weaning and finishing pigs received an intramuscular injection of 0.20 and 0.15 mg/kg, respectively, midazolam (Dormicum1). The saline pigs (15 animals per group) were injected with saline. The administration of midazolam increased the feeding behaviour and approaching behaviour, and reduced the locomotive behaviour. In front of the visual and olfactory stimuli post-weaning pigs showed a higher general activity than finishing pigs, but the contrary was found when the auditory stimulus was applied. The olfactory stimulus was more related to the turning back behaviour, whereas the visual stimulus was more related to retreat attempts. Although it could be concluded that reluctant to move was the most common response to the different fear stimuli applied in our study regardless of the age of animals, the combination of reluctant to move and turning back would be a good criterion to assess fear in domestic pigs. The use of midazolam as anxiolytic for studies of fear in commercial conditions in pigs is recommended.

Interoperability issues between learning object repositories and metadata harvesters

In this paper we describe an open learning object repository on Statistics based on DSpace which contains true learning objects, that is, exercises, equations, data sets, etc. This repository is part of a large project intended to promote the use of learning object repositories as part of the learning process in virtual learning environments. This involves the creation of a new user interface that provides users with additional services such as resource rating, commenting and so. Both aspects make traditional metadata schemes such as Dublin Core to be inadequate, as there are resources with no title or author, for instance, as those fields are not used by learners to browse and search for learning resources in the repository. Therefore, exporting OAI-PMH compliant records using OAI-DC is not possible, thus limiting the visibility of the learning objects in the repository outside the institution. We propose an architecture based on ontologies and the use of extended metadata records for both storing and refactoring such descriptions.

Virtual Library Services for a Virtual University : User-Oriented Virtual Sites in an Open Library

La llegada de las tecnologías de la información, y su uso cada vez mayor y generalizado que se está haciendo de ellas, ha permitido para que una nueva situación aparezca que, a su vez, ha originado - de hecho, que ha precipitado - una serie de cambios de gran importancia en todos los niveles, pero especialmente en los niveles sociales, económicos y culturales. Este nueva escena ha tenido una gran influencia en el entorno pedagógico. De hecho, la aparición de nuevos modelos educativos como resultado de este cambio ha estado sucediendo de una manera continuada e ininterrumpida durante la década pasada. Estos cambios recientes en los sistemas actuales de enseñanza y de aprendizaje han significado un aumento y un cambio en el tipo de demandas hechas desde las bibliotecas y los centros de documentación.

A teaching/learning support tool for introductory programming courses

In This work we present a Web-based tool developed with the aim of reinforcing teaching and learning of introductory programming courses. This tool provides support for teaching and learning. From the teacher's perspective the system introduces important gains with respect to the classical teaching methodology. It reinforces lecture and laboratory sessions, makes it possible to give personalized attention to the student, assesses the degree of participation of the students and most importantly, performs a continuous assessment of the student's progress. From the student's perspective it provides a learning framework, consisting in a help environment and a correction environment, which facilitates their personal work. With this tool students are more motivated to do programming

Let's talk: public evaluation of large projects: variational inequialities, bilevel programming and complementarity. a survey

Large projects evaluation rises well known difficulties because -by definition- they modify the current price system; their public evaluation presents additional difficulties because they modify too existing shadow prices without the project. This paper analyzes -first- the basic methodologies applied until late 80s., based on the integration of projects in optimization models or, alternatively, based on iterative procedures with information exchange between two organizational levels. New methodologies applied afterwards are based on variational inequalities, bilevel programming and linear or nonlinear complementarity. Their foundations and different applications related with project evaluation are explored. As a matter of fact, these new tools are closely related among them and can treat more complex cases involving -for example- the reaction of agents to policies or the existence of multiple agents in an environment characterized by common functions representing demands or constraints on polluting emissions.

Intelligent task-level grasp mapping for robot control

In the future, robots will enter our everyday lives to help us with various tasks.For a complete integration and cooperation with humans, these robots needto be able to acquire new skills. Sensor capabilities for navigation in real humanenvironments and intelligent interaction with humans are some of the keychallenges.Learning by demonstration systems focus on the problem of human robotinteraction, and let the human teach the robot by demonstrating the task usinghis own hands. In this thesis, we present a solution to a subproblem within thelearning by demonstration field, namely human-robot grasp mapping. Robotgrasping of objects in a home or office environment is challenging problem.Programming by demonstration systems, can give important skills for aidingthe robot in the grasping task.The thesis presents two techniques for human-robot grasp mapping, directrobot imitation from human demonstrator and intelligent grasp imitation. Inintelligent grasp mapping, the robot takes the size and shape of the object intoconsideration, while for direct mapping, only the pose of the human hand isavailable.These are evaluated in a simulated environment on several robot platforms.The results show that knowing the object shape and size for a grasping taskimproves the robot precision and performance

Object and Scene Classification: what does a Supervised Approach Provide us?

Given a set of images of scenes containing different object categories (e.g. grass, roads) our objective is to discover these objects in each image, and to use this object occurrences to perform a scene classification (e.g. beach scene, mountain scene). We achieve this by using a supervised learning algorithm able to learn with few images to facilitate the user task. We use a probabilistic model to recognise the objects and further we classify the scene based on their object occurrences. Experimental results are shown and evaluated to prove the validity of our proposal. Object recognition performance is compared to the approaches of He et al. (2004) and Marti et al. (2001) using their own datasets. Furthermore an unsupervised method is implemented in order to evaluate the advantages and disadvantages of our supervised classification approach versus an unsupervised one

Comparison of Work Scheduling Using Constraint Programming or Auctions

Business processes designers take into account the resources that the processes would need, but, due to the variable cost of certain parameters (like energy) or other circumstances, this scheduling must be done when business process enactment. In this report we formalize the energy aware resource cost, including time and usage dependent rates. We also present a constraint programming approach and an auction-based approach to solve the mentioned problem including a comparison of them and a comparison of the proposed algorithms for solving them

Multi-scale label interaction to improve object detection and segmentation

The project aims at advancing the state of the art in the use of context information for classification of image and video data. The use of context in the classification of images has been showed of great importance to improve the performance of actual object recognition systems. In our project we proposed the concept of Multi-scale Feature Labels as a general and compact method to exploit the local and global context. The feature extraction from the discriminative probability or classification confidence label field is of great novelty. Moreover the use of a multi-scale representation of the feature labels lead to a compact and efficient description of the context. The goal of the project has been also to provide a general-purpose method and prove its suitability in different image/video analysis problem. The two-year project generated 5 journal publications (plus 2 under submission), 10 conference publications (plus 2 under submission) and one patent (plus 1 pending). Of these publications, a relevant number make use of the main result of this project to improve the results in detection and/or segmentation of objects.

Assembling genes from predicted exons in linear time with dynamic programming

In a number of programs for gene structure prediction in higher eukaryotic genomic sequences, exon prediction is decoupled from gene assembly: a large pool of candidate exons is predicted and scored from features located in the query DNA sequence, and candidate genes are assembled from such a pool as sequences of nonoverlapping frame-compatible exons. Genes are scored as a function of the scores of the assembled exons, and the highest scoring candidate gene is assumed to be the most likely gene encoded by the query DNA sequence. Considering additive gene scoring functions, currently available algorithms to determine such a highest scoring candidate gene run in time proportional to the square of the number of predicted exons. Here, we present an algorithm whose running time grows only linearly with the size of the set of predicted exons. Polynomial algorithms rely on the fact that, while scanning the set of predicted exons, the highest scoring gene ending in a given exon can be obtained by appending the exon to the highest scoring among the highest scoring genes ending at each compatible preceding exon. The algorithm here relies on the simple fact that such highest scoring gene can be stored and updated. This requires scanning the set of predicted exons simultaneously by increasing acceptor and donor position. On the other hand, the algorithm described here does not assume an underlying gene structure model. Indeed, the definition of valid gene structures is externally defined in the so-called Gene Model. The Gene Model specifies simply which gene features are allowed immediately upstream which other gene features in valid gene structures. This allows for great flexibility in formulating the gene identification problem. In particular it allows for multiple-gene two-strand predictions and for considering gene features other than coding exons (such as promoter elements) in valid gene structures.