Cognitive stimulation through task-oriented telerobotics

The project presented, iCognos, consists of a flexible platform to assist end-users in performing a series of mental tasks with a sensitized mobile telerobotic platform aimed at mitigating the problems associated to cognitive disorders with an ecological cognition approach.

A randomized concave programming method for choice network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

On the throughput-WIP trade-off in queueing systems, diminishing returns and the threshold property: A linear programming approach

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Principal curves and principal oriented points

Principal curves have been defined Hastie and Stuetzle (JASA, 1989) assmooth curves passing through the middle of a multidimensional dataset. They are nonlinear generalizations of the first principalcomponent, a characterization of which is the basis for the principalcurves definition.In this paper we propose an alternative approach based on a differentproperty of principal components. Consider a point in the space wherea multivariate normal is defined and, for each hyperplane containingthat point, compute the total variance of the normal distributionconditioned to belong to that hyperplane. Choose now the hyperplaneminimizing this conditional total variance and look for thecorresponding conditional mean. The first principal component of theoriginal distribution passes by this conditional mean and it isorthogonal to that hyperplane. This property is easily generalized todata sets with nonlinear structure. Repeating the search from differentstarting points, many points analogous to conditional means are found.We call them principal oriented points. When a one-dimensional curveruns the set of these special points it is called principal curve oforiented points. Successive principal curves are recursively definedfrom a generalization of the total variance.

Implementing TURF analysis through binary linear programming

This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.

Restless bandits, linear programming relaxations and a primal-dual index heuristic

We develop a mathematical programming approach for the classicalPSPACE - hard restless bandit problem in stochastic optimization.We introduce a hierarchy of n (where n is the number of bandits)increasingly stronger linear programming relaxations, the lastof which is exact and corresponds to the (exponential size)formulation of the problem as a Markov decision chain, while theother relaxations provide bounds and are efficiently computed. Wealso propose a priority-index heuristic scheduling policy fromthe solution to the first-order relaxation, where the indices aredefined in terms of optimal dual variables. In this way wepropose a policy and a suboptimality guarantee. We report resultsof computational experiments that suggest that the proposedheuristic policy is nearly optimal. Moreover, the second-orderrelaxation is found to provide strong bounds on the optimalvalue.

Visualitzador de molècules d'ADN per laboratori virtual

RESUM Com a continuació del treball de final de carrera “Desenvolupament d’un laboratori virtual per a les pràctiques de Biologia Molecular” de Jordi Romero, s’ha realitzat una eina complementaria per a la visualització de molècules integrada en el propi laboratori virtual. Es tracta d’una eina per a la visualització gràfica de gens, ORF, marques i seqüències de restricció de molècules reals o fictícies. El fet de poder treballar amb molècules fictícies és la gran avantatge respecte a les solucions com GENBANK que només permet treballar amb molècules pròpies. Treballar amb molècules fictícies fa que sigui una solució ideal per a l’ensenyament, ja que dóna la possibilitat als professors de realitzar exercicis o demostracions amb molècules reals o dissenyades expressament per a l’exercici a demostrar. A més, permet mostrar de forma visual les diferents parts simultàniament o per separat, de manera que ofereix una primera aproximació interpretació dels resultats. Per altra banda, permet marcar gens, crear marques, localitzar seqüències de restricció i generar els ORF de la molècula que nosaltres creem o modificar una ja existent. Per l’implementació, s’ha continuat amb l’idea de separar la part de codi i la part de disseny en les aplicacions Flash. Per fer-ho, s’ha utilitzat la plataforma de codi lliure Ariware ARPv2.02 que proposa un marc de desenvolupament d’aplicacions Flash orientades a objectes amb el codi (classes ActionScript 2.0) separats del movieclip. Per al processament de dades s’ha fet servir Perl per ser altament utilitzat en Bioinformàtica i per velocitat de càlcul. Les dades generades es guarden en una Base de Dades en MYSQL (de lliure distribució), de la que s’extreuen les dades per generar fitxers XML, fent servir tant PHP com la plataforma AMFPHP com a enllaç entre Flash i la resta de parts.

Programming and analysing measurement experiments using the PicoCricket system

The aim of this project is to get used to another kind of programming. Since now, I used very complex programming languages to develop applications or even to program microcontrollers, but PicoCricket system is the evidence that we don’t need so complex development tools to get functional devices. PicoCricket system is the clear example of simple programming to make devices work the way we programmed it. There’s an easy but effective way to program small, devices just saying what we want them to do. We cannot do complex algorithms and mathematical operations but we can program them in a short time. Nowadays, the easier and faster we produce, the more we earn. So the tendency is to develop fast, cheap and easy, and PicoCricket system can do it.

Structural and functional characterization of (110)-oriented epitaxial La2/3Ca1/3MnO3 electrodes and SrTiO3 tunnel barriers

La2/3Ca1/3MnO3 (LCMO) films have been deposited on (110)-oriented SrTiO3 (STO) substrates. X-ray diffraction and high-resolution electron microscopy reveal that the (110) LCMO films are epitaxial and anisotropically in-plane strained, with higher relaxation along the [1¿10] direction than along the [001] direction; x-ray absorption spectroscopy data signaled the existence of a single intermediate Mn3+/4+ 3d-state at the film surface. Their magnetic properties are compared to those of (001) LCMO films grown simultaneously on (001) STO substrates It is found that (110) LCMO films present a higher Curie temperature (TC) and a weaker decay of magnetization when approaching TC than their (001) LCMO counterparts. These improved films have been subsequently covered by nanometric STO layers. Conducting atomic-force experiments have shown that STO layers, as thin as 0.8 nm, grown on top of the (110) LCMO electrode, display good insulating properties. We will show that the electric conductance across (110) STO layers, exponentially depending on the barrier thickness, is tunnel-like. The barrier height in STO (110) is found to be similar to that of STO (001). These results show that the (110) LCMO electrodes can be better electrodes than (001) LCMO for magnetic tunnel junctions, and that (110) STO are suitable insulating barriers.

An agency-oriented model to explain vine-growing specialization in the province of Barcelona (Catalonia, Spain) in the mid-nineteenth century

[cat] En aquest treball presentem un model per explicar el procés d’especialització vitícola assolit als municipis de la província de Barcelona, a mitjans del s. XIX,que cerca entendre com va sorgir històricament un avantatge comparatiu fruit d’un procés que esdevindria un dels punts de partida del procés d’industrialització a Catalunya. Els resultats confirmen els papers jugats pel impuls “Boserupià” de la població en un context d’intensificació de l’ús de la terra, i d’un impuls del mercat “Smithià” en un context d’expansió de la demanda per part de les economies atlàntiques. També es posa de manifest la importància de les dotacions agro-ecològiques i les condicions socioinstitucionals relacionades amb la desigualtat d’ingrés. La difusió de la vinya donà com a resultat unes comunitats rurals menys desiguals fins al 1820, tot i que aquesta desigualtat augmentà de nou a partir d'aleshores.

Microstructure of highly oriented, hexagonal, boron nitride thin films grown on crystalline silicon by radio frequency plasma-assisted chemical vapor deposition

We present a high‐resolution electron microscopy study of the microstructure of boron nitride thin films grown on silicon (100) by radio‐frequency plasma‐assisted chemical vapor deposition using B2H6 (1% in H2) and NH3 gases. Well‐adhered boron nitride films grown on the grounded electrode show a highly oriented hexagonal structure with the c‐axis parallel to the substrate surface throughout the film, without any interfacial amorphous layer. We ascribed this textured growth to an etching effect of atomic hydrogen present in the gas discharge. In contrast, films grown on the powered electrode, with compressive stress induced by ion bombardment, show a multilayered structure as observed by other authors, composed of an amorphous layer, a hexagonal layer with the c‐axis parallel to the substrate surface and another layer oriented at random

Nonlinear filtering in object and Fourier space in a joint transform optical correlator: comparison and experimental realization

The use of different kinds of nonlinear filtering in a joint transform correlator are studied and compared. The study is divided into two parts, one corresponding to object space and the second to the Fourier domain of the joint power spectrum. In the first part, phase and inverse filters are computed; their inverse Fourier transforms are also computed, thereby becoming the reference in the object space. In the Fourier space, the binarization of the power spectrum is realized and compared with a new procedure for removing the spatial envelope. All cases are simulated and experimentally implemented by a compact joint transform correlator.

An agency-oriented model to explain vine-growing specialization in the province of Barcelona (Catalonia, Spain) in the mid-nineteenth century

[cat] En aquest treball presentem un model per explicar el procés d’especialització vitícola assolit als municipis de la província de Barcelona, a mitjans del s. XIX,que cerca entendre com va sorgir històricament un avantatge comparatiu fruit d’un procés que esdevindria un dels punts de partida del procés d’industrialització a Catalunya. Els resultats confirmen els papers jugats pel impuls “Boserupià” de la població en un context d’intensificació de l’ús de la terra, i d’un impuls del mercat “Smithià” en un context d’expansió de la demanda per part de les economies atlàntiques. També es posa de manifest la importància de les dotacions agro-ecològiques i les condicions socioinstitucionals relacionades amb la desigualtat d’ingrés. La difusió de la vinya donà com a resultat unes comunitats rurals menys desiguals fins al 1820, tot i que aquesta desigualtat augmentà de nou a partir d'aleshores.