Markup Test Reader: eina de creació i lectura de formularis de test

El projecte exposat en aquestes pàgines és un document d'estudi, anàlisi, disseny, programació i procés de proves en la confecció d'una aplicació de creació i lectura de formularis de test. Aquesta aplicació parteix de les possibilitats de millora de les prestacions, usabilitat i escalabilitat que poden oferir les tècniques de visió en computador en aquest camp. El projecte s'ha basat en un exemple en concret per tal d'oferir una eina vàlida per a la automatització de les tasques que en una empresa de recursos humans es poden donar a l'hora de gestionar la informació dels test psicotècnics que necessiten gestionar. El projecte parteix d'unes premisses bàsiques tals com: l'ús de tècniques en visió per computador, la modularitat, el compliment d'estàndards, la facilitat d'ús i la facilitat en la gestió de canvis.

ATiPAP : desenvolupament de materials docents amb suport multimedia pels continguts d'Atenció, Percepció Auditiva i de la Parla adaptats als crédits ECTS i a l'EEES dins l'ensenyament de Psicologia

El projecte ha permès finançar el suport tècnic necessari per a poder desenvolupar materials informatitzats corresponents a activitats teòrico-pràctiques de l’assignatura troncal de la llicenciatura de Psicologia (actualment també en el Grau) “Percepció i Atenció”. Els materials desenvolupats corresponen a diferents punts del programa de l’assignatura i són els següents: demostració de la tècnica d’ombrejat per l’anàlisi de l’atenció focalitzada; parpelleig atencional en sèries de presentacions ràpides d’informació visual (RSVP); canvis encoberts de l’atenció i el mecanisme d’inhibició de retorn; efectes dels filtrats sobre la percepció de la parla i la música; il·lusions auditives i els principis d’organització de la informació sonora complexa; la percepció categòrica dels sons de la parla i la naturalesa continua del processament lèxic (paradigma d’obertura successiva o gating). Per totes aquelles activitats amb continguts de llenguatge, s’han desenvolupat dues versions equivalents, catalana i castellana, per permetre que els estudiants fessin la pràctica en la seva llengua dominant. A la primera fase del projecte, al llarg del curs 2006-07, es van preparar els materials i la programació de les diferents pràctiques i es van poder identificar alguns problemes que es van solucionar posteriorment. En el curs 2007-08 totes les activitats de pràctiques ja es van fer accessibles als estudiants (Plataforma Moodle, Campus Virtual) i la valoració sobre el seu funcionament, feta pels estudiants mitjançant qüestionaris, va ser satisfactòria en més d’un 95% dels casos (els únics problemes detectats estaven relacionats amb les característiques dels ordinadors del usuaris i del navegador utilitzat per accedir als materials). La valoració de les activitats per part dels estudiants va ser globalment positiva i, en el seu ús continuat al llarg dels cursos 2008-09 i 2009-10, s’ha observat una participació creixent (accés voluntari a les activitats) i un aprofitament millor de la informació presentada, que es tradueix en millores en les puntuacions obtingudes en les avaluacions de l'assignatura.

Desenvolupament d'una tenda virtual amb J2EE

Aquest document descriu els passos necessaris per a desenvolupar una botiga virtual a Internet, per mitjà de les fases d'anàlisi, disseny i codificació. L'aplicació en qüestió ha de permetre als diferents tipus d'usuaris fer tasques de manteniment (altes, baixes i actualitzacions) i de consulta dels diversos elements del domini del problema.

MisListas : aplicació per a la creació de llistes

El projecte "MisListas" està dissenyat especialment per a usuaris domèstics, permetent a aquests construir llistes amb diferents continguts com: Llista de la compra, de tasques, cites, aniversaris, reunions, arbres genealògics i en definitiva qualsevol tipus de llista jeràrquica que desitgin guardar nostra aplicació.

AOP i Enginyeria inversa amb Objectes Distribuïts

L'objectiu d'aquest projecte és fer ús de la nova programació orientada a aspectes (AOP) per a fer tasques de reenginyeria. la finalitat seria que, amb l'ajut d'aquesta tecnologia, es pogués extreure informació de l'execució d'una aplicació, de manera que a partir d'aquesta informació es pogués obtenir el diagrama de cas d'ús.

Filtratge Web

L'objectiu del treball és realitzar un programari que realitzi tasques de filtratge de les planes web que pot explorar qualsevol explorador del sistema. A més, ha d'incloure la capacitat de mantenir un historial de navegació, que pot servir per millorar la tasca de filtratge.

Abstracting qualitative information for process supervision

Supervisory systems evolution makes the obtaining of significant information from processes more important in the way that the supervision systems' particular tasks are simplified. So, having signal treatment tools capable of obtaining elaborate information from the process data is important. In this paper, a tool that obtains qualitative data about the trends and oscillation of signals is presented. An application of this tool is presented as well. In this case, the tool, implemented in a computer-aided control systems design (CACSD) environment, is used in order to give to an expert system for fault detection in a laboratory plant

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

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

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.

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.