Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 43
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Passive-aggressive for on-line learning in statistical machine translation

  • Martínez Gómez, Pascual
  • Sanchis Trilles, Germán
  • Casacuberta Nolla, Francisco|||0000-0002-8497-5598
New variations on the application of the passive-aggressive algorithm to statistical machine translation are developed and compared to previously existing approaches. In online adaptation, the system needs to adapt to real-world changing scenarios, where training and tuning only take place when the system is set-up for the first time. Post-edit information, as described by a given quality measure, is used as valuable feedback within the passive-aggressive framework, adapting the statistical models on-line. First, by modifying the translation model parameters, and alternatively, by adapting the scaling factors present in stateof- the-art SMT systems. Experimental results show improvements in translation quality by allowing the system to learn on a sentence-by-sentence basis., This paper is based upon work supported by the EC (FEDER/FSE) and the Spanish MICINN under projects MIPRCV “Consolider Ingenio 2010” (CSD2007-00018) and iTrans2 (TIN2009-14511). Also supported by the Spanish MITyC under the erudito.com (TSI-020110-2009-439) project, by the Generalitat Valenciana under grant Prometeo/2009/014 and scholarship GV/2010/067 and by the UPV under grant 20091027.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Multimodal interactive transcription of ancient text images

  • Romero Gómez, Verónica
  • Sánchez Peiró, Joan Andreu|||0000-0003-0423-2020
  • Toselli, Alejandro Héctor|||0000-0001-6955-9249
  • Vidal, Enrique|||0000-0003-4579-5196
The amount of digitized legacy documents has been rising dramatically over the last years due mainly to the increasing number of on-line digital libraries publishing this kind of documents. On one hand, the vast majority of these documents remain waiting to be transcribed into a textual electronic format (such as ASCII or PDF) that would provide historians and other researchers new ways of indexing, consulting and querying these documents. On the other hand, in some cases, adequate transcriptions of the handwritten text images are already available. This drives an increasing need to align images and transcriptions in order to make it more comfortable the consulting of these documents. In this work two systems are presented to deal with these issues. The first one aims at transcribing these documents using a interactive-predictive approach, which integrates user corrective-feedback actions in the proper recognition process. The second one presents an alignment method based on the Viterbi algorithm to find mappings between word images of a given handwritten document and their respective (ASCII) words on its given transcription., Work supported by the Spanish Government (MICINN and “Plan E”) under the MITTRAL (TIN2009-14633-C03-01) research project and under the research programme Consolider Ingenio 2010: MIPRCV (CSD2007- 00018) and the Generalitat Valenciana under gran Prometeo/2009/14.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

La resolución de problemas con distintos actores: una actividad basada en la economía colaborativa

  • de-Miguel-Molina, María|||0000-0003-4264-8000
  • Catalá-Pérez, Daniel|||0000-0001-5042-0239
[EN] The collaborative economy presents new business models through digital platforms that sometimes fight with services that have traditionally been provided with strong regulation. This may be the case of the taxi sector, which requires to be reformulated in order to be competitive. In this activity, we analyze the need to raise these issues through a governance model where all stakeholders can express their opinions, trying to achieve solutions as consensual as possible. This requires an analysis of the regulations involved and the opinions of the users, without losing sight of the economic groups in conflict. In order to achieve this consensus, the public administration will play a crucial role in the future., [ES] La economía colaborativa presenta nuevos modelos de negocio a través de plataformas digitales que, en ocasiones, chocan con servicios que tradicionalmente se han prestado con una fuerte regulación. Este puede ser el caso del sector del taxi, que precisa de una reformulación para poder ser competitivo. En esta actividad, se analiza la necesidad de plantear estos temas a través de un modelo de gobernanza donde todos los grupos de interés puedan expresar su opinión y se intenten conseguir soluciones lo más consensuadas posible. Ello requiere un análisis de la normativa implicada y de la opinión de los usuarios, sin perder de vista los grupos económicos en conflicto. Para lograr este consenso, el papel que juegue la administración pública en el futuro será fundamental., Este trabajo parte del proyecto de investigación Prometeo en el que participa la profesora María De Miguel, “La regulación de la transformación digital y la economía colaborativa”, y que es dirigido por el profesor Lorenzo Cotino Hueso (PROMETEO/2017/064, Generalitat Valenciana). Así mismo, ha formado parte del Proyecto de Innovación y Mejora Educativa (PIME), “La resolución de problemas a través del diseño creativo y la visualización colaborativa” de la UPV, coordinado por la profesora V. Santamarina.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Novel Probes and Carriers to Target Senescent Cells

  • Lozano-Torres, Beatriz
  • Blandez, Juan F.
  • Sancenón Galarza, Félix|||0000-0002-5205-7135
  • Martínez-Máñez, Ramón|||0000-0001-5873-9674
Detecting senescent cells has become a task of increasing importance in recent years. The implication of cellular senescence in a variety of physiological processes as well as in various diseases is the main reason why potential diagnostic tools for senescent cells are sought. This chapter clearly and concisely addresses the discussion of the published tools (molecular based probes and nanocarriers) to carry out the diagnosis of senescent cells both in vitro and in vivo and in tissues. The comprehensive reading of this chapter will allow the reader to overview the advances in the area of the detection of cellular senescence using probes and carriers as diagnostic methods.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

The influence of students distribution on their grades

  • Herrero Cuco, Carlos|||0000-0001-9599-8544
  • Llorens Agost, María Luisa|||0000-0002-2790-0055
  • Oliver Villarroya, Javier|||0000-0002-1169-1260
  • Silva, Josep|||0000-0001-5096-0008
  • Tamarit Muñoz, Salvador
This position paper defends the opinion that the distance of students to the professor in the classroom is directly related to their grades. This opinion is based on the results obtained in a large experiment performed during two academic years in various degrees, courses and semesters of two engineering schools. The experiment collected and processed data about the distribution of students in lectures and their final grades. Our results quantitatively confirm that grades can vary up to 14% depending on the distance to the professor., This work has been partially supported by the Spanish MEC under grant TIN2008-06622-C03-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052. Salvador Tamarit was partially supported by the Spanish MICINN under FPI grant BES-2009-015019.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Active learning for dialogue act labelling

  • Ghigi, Fabrizio
  • Tamarit Ballester, Vicent
  • Benedí Ruiz, José Miguel
  • Martínez-Hinarejos, Carlos-D.|||0000-0002-6139-2891
Active learning is a useful technique that allows for a considerably reduction of the amount of data we need to manually label in order to reach a good performance of a statistical model. In order to apply active learning to a particular task we need to previously define an effective selection criteria, that picks out the most informative samples at each iteration of active learning process. This is still an open problem that we are going to face in this work, in the task of dialogue annotation at dialogue act level. We present two different criteria, weighted number of hypothesis and entropy, that we have applied to the Sample Selection Algorithm for the task of dialogue act labelling, that retrieved appreciably improvements in our experimental approach. © 2011 Springer-Verlag., Work supported by the EC (FEDER/FSE) and the Spanish MEC/MICINN under the MIPRCV “Consolider Ingenio 2010” program (CSD2007-00018), MITTRAL (TIN2009-14633-C03-01) projects and the FPI scholarship (BES-2009-028965). Also supported by the Generalitat Valenciana under grant Prometeo/2009/014 and GV/2010/067
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Slicing-Based Trace Analysis of Rewriting Logic Specifications with iJulienne

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Sapiña-Sanchis, Julia|||0000-0003-2994-6986
  • Ballis, Demis
  • Frechina, F.
We present iJulienne, a trace analyzer for conditional rewriting logic theories that can be used to compute abstract views of Maude executions that help users understand and debug programs. Given a Maude execution trace and a slicing criterion which consists of a set of target symbols occurring in a selected state of the trace, iJulienne is able to track back reverse dependences and causality along the trace in order to incrementally generate highly reduced program and trace slices that reconstruct all and only those pieces of information that are needed to deliver the symbols of interest. iJulienne is also endowed with a trace querying mechanism that increases flexibility and reduction power and allows program runs to be examined at the appropriate level of abstraction., This work has been partially supported by the EU (FEDER) and the Spanish MEC project ref. TIN2010-21062-C02-02, and Generalitat Valenciana ref. PROMETEO2011/052, and was carried out during the tenure of D. Ballis’ ERCIM ”Alain Bensoussan” Postdoctoral Fellowship. The research leading to these results has received funding from the EU 7th Framework Programme (FP7/2007-2013) under agreement n. 246016. F. Frechina is supported by FPU-ME grant AP2010-5681.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Towards Symbolic Execution in Erlang

  • Vidal, Germán|||0000-0002-1857-6951
The concurrent functional language Erlang [1] has a number of distinguishing features, like dynamic typing, concurrency via asynchronous message passing or hot code loading, that make it especially appropriate for distributed, faulttolerant, soft real-time applications. The success of Erlang is witnessed by the increasing number of its industrial applications. For instance, Erlang has been used to implement Facebook’s chat back-end, the mobile application Whatsapp or Twitterfall—a service to view trends and patterns from Twitter—, to name a few. The success of the language, however, also requires the development of powerful testing and verification techniques. Symbolic execution is at the core of many program analysis and transformation techniques, like partial evaluation, test-case generation or model checking. In this paper, we introduce a symbolic execution technique for Erlang. We discuss how both an overapproximation and an underapproximation of the concrete semantics can be obtained. We illustrate our approach through some examples. To the best of our knowledge, this is the first attempt to formalize symbolic execution in the context of this language, where previous approaches have only considered exploring different schedulings but have not dealt with symbolic data. More details can be found in the companion technical report, This work has been partially supported by the Spanish Ministerio de Economía y Competitividad (Secretaría de Estado de Investigación, Desarrollo e Innovación) under grant TIN2013-44742-C4-1-R and by the Generalitat Valenciana under grant PROMETEO/2011/052.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Enhancing declarative debugging with loop expansion and tree compression

  • Insa Cabrera, David
  • Tomás Franco, César
  • Silva, Josep|||0000-0001-5096-0008
This work has been partially supported by the Spanish Ministerio de Econom´ıa y Competitividad (Secretar´ıa de Estado de Investigaci´on, Desarrollo e Innovaci´on) under grant TIN2008-06622-C03-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052. David Insa was partially supported by the Spanish Ministerio de Eduaci´on under FPU grant AP2010-4415
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Concolic Execution and Test Case Generation in Prolog

  • Vidal, Germán|||0000-0002-1857-6951
Symbolic execution extends concrete execution by allowing symbolic input data and then exploring all feasible execution paths. It has been defined and used in the context of many different programming languages and paradigms. A symbolic execution engine is at the heart of many program analysis and transformation techniques, like partial evaluation, test case generation or model checking, to name a few. Despite its relevance, traditional symbolic execution also suffers from several drawbacks. For instance, the search space is usually huge (often infinite) even for the simplest programs. Also, symbolic execution generally computes an overapproximation of the concrete execution space, so that false positives may occur. In this paper, we propose the use of a variant of symbolic execution, called concolic execution, for test case generation in Prolog. Our technique aims at full statement coverage. We argue that this technique computes an underapproximation of the concrete execution space (thus avoiding false positives) and scales up better to medium and large Prolog applications., This work has been partially supported by the EU (FEDER) and the Spanish Ministerio de Economía y Competitividad (Secretaría de Estado de Investigación, Desarrollo e Innovación) under grant TIN2013-44742-C4-1-R and by the Generalitat Valenciana under grant PROMETEO/2011/052.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Automatic deployment of a consensus networks MAS

  • Gómez ., Yolanda
  • Palomares Chust, Alberto|||0000-0002-4583-467X
  • Carrascosa Casamayor, Carlos|||0000-0003-3649-6530
  • Rebollo Pedruelo, Miguel|||0000-0002-5115-8751
The main goal of the work here presented is the easy deployment in real multi-agent systems of consensus processes. MAGENTIX2 agent platform has been used to implement real agents that follow the consensus algorithm to reach agreements., This work is supported by TIN2012-36586-C03-01 and PROMETEO/2008/051 projects of the Spanish government, CONSOLIDER-INGENIO 2010 under grant CSD2007-00022, and PAID-06-11-2084
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Mixtures of independent component analyzers for EEG prediction

  • Safont Armero, Gonzalo
  • Salazar Afanador, Addisson|||0000-0001-5849-5104
  • Vergara Domínguez, Luís|||0000-0001-6803-4774
  • Gonzalez, Alberto|||0000-0002-6984-3212
  • Vidal Maciá, Antonio Manuel
This paper presents a new application of independent component analysis mixture modeling (ICAMM) for prediction of electroencephalographic (EEG) signals. Demonstrations in prediction of missing EEG data in a working memory task using classic methods and an ICAMM-based algorithm are included. The performance of the methods is measured by using four error indicators: signal-to-interference (SIR) ratio, Kullback-Leibler divergence, correlation at lag zero and mean structural similarity index. The results show that the ICAMM-based algorithm outperforms the classical spherical splines method which is commonly used in EEG signal processing. Hence, the potential of using mixtures of independent component analyzers (ICAs) to improve prediction, as opposed on estimating only one ICA is demonstrated., This work has been supported by Generalitat Valenciana under grants PROMETEO/2010/040 and ISIC/2012/006
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

System dependence graphs in sequential Erlang

  • Silva, Josep|||0000-0001-5096-0008
  • Tamarit Muñoz, Salvador
  • Tomás Franco, César
The system dependence graph (SDG) is a data structure used in the imperative paradigm for different static analysis, and particularly, for program slicing. Program slicing allows us to determine the part of a program (called slice) that influences a given variable of interest. Thanks to the SDG, we can produce precise slices for interprocedural programs. Unfortunately, the SDG cannot be used in the functional paradigm due to important features that are not considered in this formalism (e.g., pattern matching, higher-order, composite expressions, etc.). In this work we propose the first adaptation of the SDG to a functional language facing these problems. We take Erlang as the host language and we adapt the algorithms used to slice the SDG to produce precise slices of Erlang interprocedural programs. As a proof-of-concept, we have implemented a program slicer for Erlang based on our SDGs., This work has been partially supported by the Spanish Ministerio de Ciencia e Innovaci´on under grant TIN2008-06622-C03-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052. Salvador Tamarit was partially supported by the Spanish MICINN under FPI grant BES-2009-015019
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

A New Hybrid Debugging Architecture for Eclipse

  • González, Juan
  • Insa Cabrera, David
  • Silva, Josep|||0000-0001-5096-0008
[EN] During many years, print debugging has been the most used method for debugging. Nowadays, however, industrial languages come with a trace debugger that allows programmers to trace computations step by step using breakpoints and state viewers. Almost all modern programming environments include a trace debugger that allows us to inspect the state of a computation in any given point. Nevertheless, this debugging method has been criticized for being completely manual and time-consuming. Other debugging techniques have appeared to solve some of the problems of Trace Debugging, but they suffer from other problems such as scalability. In this work we present a new hybrid debugging technique. It is based on a combination of Trace Debugging, Algorithmic Debugging and Omniscient Debugging to produce a synergy that exploits the best properties and strong points of each technique. We describe the architecture of our hybrid debugger and our implementation that has been integrated into Eclipse as a plugin., This work has been partially supported by the Spanish Ministerio de Economía y Competitividad (Secretaria de Estado de Investigación, Desarrollo e Innovación) under grant TIN2008-06622-003-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052. David Insa was partially supported by the Spanish Ministerio de Educación under FPU grant AP2010-4415.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Escobar Román, Santiago|||0000-0002-3550-4781
  • Espert Real, Javier
  • Meseguer, José
Computing generalizers is relevant in a wide spectrum of automated reasoning areas where analogical reasoning and inductive inference are needed. The ACUOS system computes a complete and minimal set of semantic generalizers (also called “anti-unifiers”) of two structures in a typed language modulo a set of equational axioms. By supporting types and any (modular) combination of associativity (A), commutativity (C), and unity (U) algebraic axioms for function symbols, ACUOS allows reasoning about typed data structures, e.g. lists, trees, and (multi-)sets, and typical hierarchical/structural relations such as is a and part of. This paper discusses the modular ACU generalization tool ACUOS and illustrates its use in a classical artificial intelligence problem., This work has been partially supported by the EU (FEDER) and the Spanish MINECO under grants TIN 2010-21062-C02-02 and TIN 2013-45732-C4-1-P, by Generalitat Valenciana PROMETEO2011/052, and by NSF Grant CNS 13-10109. J. Espert has also been supported by the Spanish FPU grant FPU12/06223.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Models for logics and conditional constraints in automated proofs of termination

  • Lucas Alba, Salvador|||0000-0001-9923-2108
  • Meseguer, José
Reasoning about termination of declarative programs, which are described by means of a computational logic, requires the definition of appropriate abstractions as semantic models of the logic, and also handling the conditional constraints which are often obtained. The formal treatment of such constraints in automated proofs, often using numeric interpretations and (arithmetic) constraint solving can greatly benefit from appropriate techniques to deal with the conditional (in)equations at stake. Existing results from linear algebra or real algebraic geometry are useful to deal with them but have received only scant attention to date. We investigate the definition and use of numeric models for logics and the resolution of linear and algebraic conditional constraints as unifying techniques for proving termination of declarative programs., Developed during a sabbatical year at UIUC. Supported by projects NSF CNS13-19109, MINECO TIN2010-21062-C02-02 and TIN2013-45732-C4-1-P, and GV BEST/2014/026 and PROMETEO/2011/052.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis

  • Erbatur, Serdar
  • Kapur, Deepak
  • Liu, Zhiqiang
  • Lynch, Christopher A.
  • Meadows, Catherine
  • Meseguer, José
  • Narendran, Paliath
  • Santiago Pinazo, Sonia
  • Sasse, Ralf
  • Escobar Román, Santiago|||0000-0002-3550-4781
We present a new paradigm for unification arising out of a technique commonly used in cryptographic protocol analysis tools that employ unification modulo equational theories. This paradigm relies on: (i) a decomposition of an equational theory into (R,E) where R is confluent, terminating, and coherent modulo E, and (ii) on reducing unification problems to a set of problems s=?ts=?t under the constraint that t remains R/E-irreducible. We call this method asymmetric unification. We first present a general-purpose generic asymmetric unification algorithm. and then outline an approach for converting special-purpose conventional unification algorithms to asymmetric ones, demonstrating it for exclusive-or with uninterpreted function symbols. We demonstrate how asymmetric unification can improve performanceby running the algorithm on a set of benchmark problems. We also give results on the complexity and decidability of asymmetric unification., S. Escobar and S. Santiago were partially supported by EU (FEDER) and the Spanish MEC/MICINN under grant TIN 2010-21062-C02-02, and by Generalitat Valenciana PROMETEO2011/052. The following authors were partially supported by NSF: S. Escobar, J. Meseguer, and R. Sasse under CNS 09-04749 and CCF 09- 05584; D. Kapur under CNS 09-05222; C. Lynch, Z. Liu, and C. Meadows under CNS 09-05378, and P. Narendran and S. Erbatur under CNS 09-05286. Part of the S. Erbatur’s work was supported while with the Department of Computer Science, University at Albany, and part of R. Sasse’s work was supported while with the Department of Computer Science, University of Illinois at Urbana-Champaign.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Language identification for interactive handwriting transcription of multilingual documents

  • Del Agua Teba, Miguel Angel
  • Serrano Martinez Santos, Nicolas
  • Juan, Alfons|||0000-0002-9984-4072
An effective approach to handwriting transcription of (old) documents is to follow a sequential, line-by-line transcription of the whole document, in which a continuously retrained system interacts with the user. In the case of multilingual documents, however, a minor yet important issue for this interactive approach is to first identify the language of the current text line image to be transcribed. In this paper, we propose a probabilistic framework and three techniques for this purpose. Empirical results are reported on an entire 764-page multilingual document for which previous empirical tests were limited to its first 180 pages, written only in Spanish. © 2011 Springer-Verlag., Work supported by the EC (FEDER, FSE), the Spanish Government (MICINN, MITyC, “Plan E”, under grants MIPRCV “Consolider Ingenio 2010”, MITTRAL TIN2009- 14633-C03-01 and FPU AP2007-02867), the Generalitat Valenciana (grant Prometeo/2009/014 and ACOMP/2010/051) and the UPV (grant 20080033).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Analysis of the IBM CCA Security API Protocols in Maude-NPA

  • González Burgueño, Antonio
  • Santiago Pinazo, Sonia
  • Meadows, Catherine
  • Meseguer, Jose
  • Escobar Román, Santiago|||0000-0002-3550-4781
Standards for cryptographic protocols have long been attractive candidates for formal verification. It is important that such standards be correct, and cryptographic protocols are tricky to design and subject to non-intuitive attacks even when the underlying cryptosystems are secure. Thus a number of general-purpose cryptographic protocol analysis tools have been developed and applied to protocol standards. However, there is one class of standards, security application programming interfaces (security APIs), to which few of these tools have been applied. Instead, most work has concentrated on developing special-purpose tools and algorithms for specific classes of security APIs. However, there can be much advantage gained from having general-purpose tools that could be applied to a wide class of problems, including security APIs. One particular class of APIs that has proven difficult to analyze using general-purpose tools is that involving exclusive-or. In this paper we analyze the IBM 4758 Common Cryptographic Architecture (CCA) protocol using an advanced automated protocol verification tool with full exclusive-or capabilities, the Maude-NPA tool. This is the first time that API protocols have been satisfactorily specified and analyzed in the Maude-NPA, and the first time XOR-based APIs have been specified and analyzed using a general-purpose unbounded session cryptographic protocol verification tool that provides direct support for AC theories. We describe our results and indicate what further research needs to be done to make such protocol analysis generally effective., Antonio González-Burgueño, Sonia Santiago and Santiago Escobar have been partially supported by the EU (FEDER) and the Spanish MINECO under grants TIN 2010-21062-C02-02 and TIN 2013-45732-C4-1-P, and by Generalitat Valenciana PROMETEO2011/052. José Meseguer has been partially supported by NSF Grant CNS 13-10109.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Automatic inference of specifications using matching logic

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Villanueva, Alicia|||0000-0003-1090-5009
  • Feliú Gabaldón, Marco Antonio
Formal specifications can be used for various software engineering activities ranging from finding errors to documenting software and automatic test-case generation. Automatically discovering specifications for heap-manipulating programs is a challenging task. In this paper, we propose a technique for automatically inferring formal specifications from C code which is based on the symbolic execution and automated reasoning tandem "MATCHING LOGIC /K framework". We implemented our technique for a fragment of C, called KERNELC, in the automated tool KINDSPEC, which generates axioms that describe the precise input/output behavior of C routines that handle pointer-based structures, i.e., result values and state change. These specifications can be written either in MATCHING LOGIC itself, which is useful for further automated analysis within the K formal environment, or in sugared axiomatic form, which favors better human inspection. Since we rely on rewriting logic K semantics specification of programming languages, our approach can be easily extended to any language for which a formal semantics in K is given., This work has been partially supported by the EU (FEDER) and the Spanish MEC/MICINN, ref. TIN 2010-21062-C02-0, and by Generalitat Valenciana, ref. PROMETEO 2011/052.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Compression and intelligence: social environments and communication

  • Dowe, David L.
  • Das, Paramjit K,
  • Hernández-Orallo, José|||0000-0001-9746-7632
Compression has been advocated as one of the principles which pervades inductive inference and prediction - and, from there, it has also been recurrent in definitions and tests of intelligence. However, this connection is less explicit in new approaches to intelligence. In this paper, we advocate that the notion of compression can appear again in definitions and tests of intelligence through the concepts of `mind-reading¿ and `communication¿ in the context of multi-agent systems and social environments. Our main position is that two-part Minimum Message Length (MML) compression is not only more natural and effective for agents with limited resources, but it is also much more appropriate for agents in (co-operative) social environments than one-part compression schemes - particularly those using a posterior-weighted mixture of all available models following Solomonoff¿s theory of prediction. We think that the realisation of these differences is important to avoid a naive view of `intelligence as compression¿ in favour of a better understanding of how, why and where (one-part or two-part, lossless or lossy) compression is needed., We thank the anonymous reviewers for their helpful comments, and we thank Kurt Kleiner for some challenging and ultimately very helpful questions in the broad area of this work. We also acknowledge the funding from the Spanish MEC and MICINN for projects TIN2009-06078-E/TIN, Consolider-Ingenio CSD2007-00022 and TIN2010-21062-C02, and Generalitat Valenciana for Prometeo/2008/051.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Effective symbolic protocol analysis via equational irreducibility conditions

  • Erbatur, Serdar
  • Kapur, Deepak
  • Liu, Zhiqiang
  • Lynch, Christopher
  • Meadows, Catherine
  • Meseguer, José
  • Narendran, Paliath
  • Santiago Pinazo, Sonia
  • Sasse, Ralf
  • Escobar Román, Santiago|||0000-0002-3550-4781
We address a problem that arises in cryptographic protocol analysis when the equational properties of the cryptosystem are taken into account: in many situations it is necessary to guarantee that certain terms generated during a state exploration are in normal form with respect to the equational theory. We give a tool-independent methodology for state exploration, based on unification and narrowing, that generates states that obey these irreducibility constraints, called contextual symbolic reachability analysis, prove its soundness and completeness, and describe its implementation in the Maude-NPA protocol analysis tool. Contextual symbolic reachability analysis also introduces a new type of unification mechanism, which we call asymmetric unification, in which any solution must leave the right side of the solution irreducible. We also present experiments showing the effectiveness of our methodology., S. Escobar and S. Santiago have been partially supported by the EU (FEDER) and the Spanish MEC/MICINN under grant TIN 2010-21062-C02-02, and by Generalitat Valenciana PROMETEO2011/052. The following authors have been partially supported by NSF: S. Escobar, J. Meseguer and R. Sasse under grants CCF 09- 05584, CNS 09-04749, and CNS 09-05584; D. Kapur under grant CNS 09-05222; C. Lynch, Z. Liu, and C. Meadows under grant CNS 09-05378, and P. Narendran and S. Erbatur under grant CNS 09-05286.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

On more realistic environment distributions for defining, evaluating and developing intelligence

  • Hernández-Orallo, José|||0000-0001-9746-7632
  • Dowe, David L.
  • España Cubillo, Sergio
  • Hernández-Lloreda, M. Victoria
  • Insa Cabrera, Javier
One insightful view of the notion of intelligence is the ability to perform well in a diverse set of tasks, problems or environments. One of the key issues is therefore the choice of this set, which can be formalised as a `distribution¿. Formalising and properly defining this distribution is an important challenge to understand what intelligence is and to achieve artificial general intelligence (AGI). In this paper, we agree with previous criticisms that a universal distribution using a reference universal Turing machine (UTM) over tasks, environments, etc., is perhaps amuch too general distribution, since, e.g., the probability of other agents appearing on the scene or having some social interaction is almost 0 for many reference UTMs. Instead, we propose the notion of Darwin-Wallace distribution for environments, which is inspired by biological evolution, artificial life and evolutionary computation. However, although enlightening about where and how intelligence should excel, this distribution has so many options and is uncomputable in so many ways that we certainly need a more practical alternative. We propose the use of intelligence tests over multi-agent systems, in such a way that agents with a certified level of intelligence at a certain degree are used to construct the tests for the next degree. This constructive methodology can then be used as a more realistic intelligence test and also as a testbed for developing and evaluating AGI systems., We thank the anonymous reviewers for their helpful comments. We also thank the funding from the Spanish MEC and MICINN for projects TIN2009-06078-E/TIN, Consolider-Ingenio CSD2007-00022 and TIN2010-21062- C02, for MEC FPU grant AP2006-02323, and Generalitat Valenciana for Prometeo/2008/051
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Enhancing Trace Debugging with Algorithmic and Omniscient Debugging

  • González, Juan
  • Insa Cabrera, David
  • Silva, Josep|||0000-0001-5096-0008
During many years, Print Debugging has been the most used method for debugging. Nowadays, however, industrial languages come with a trace debugger that allows programmers to trace computations step by step using breakpoints and state viewers. Almost all modern programming environments include a trace debugger that allows us to inspect the state of a computation in any given point. Nevertheless, this debugging method has been criticized for being completely manual and time-consuming. Other debugging techniques have appeared to solve some of the problems of Trace Debugging, but they suffer from other problems such as scalability. In this work we present a new hybrid debugging technique. It is based on a combination of Trace Debugging, Algorithmic Debugging and Omniscient Debugging to produce a synergy that exploits the best properties and strong points of each technique. We describe the architecture of our hybrid debugger and our implementation that has been integrated into Eclipse as a plugin., This work has been partially supported by the Spanish Ministerio de Economía y Competitividad (Secretaría de Estado de Investigación, Desarrollo e Innovación) under grant TIN2008-06622-C03-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052. David Insa was partially supported by the Spanish Ministerio de Educación under FPU grant AP2010-4415.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Low temperature degradation behaviour of 10Ce-TZP/Al2O3 bioceramics obtained by microwave sintering technology

  • Gil-Flores, Lorena
  • Rosa, Roberto
  • Veronesi, Paolo
  • Leonelli, Cristina
  • Salvador Moya, Mª Dolores|||0000-0002-4242-478X
  • Penaranda-Foix, Felipe L.|||0000-0003-4012-0763
  • Borrell Tomás, María Amparo|||0000-0003-4292-4538
[EN] Zirconia is one of the most used ceramics, especially for biomedical applications, due to its exceptional mechanical properties. However, it is commonly known that its properties can be diminished owing to a low temperature degradation (LTD). This phenomenon consists on a spontaneous phase transformation, from tetragonal to monoclinic, under certain conditions, which is accelerated when the samples are exposed under high levels of humidity at a temperature range between 20-300 ºC. In addition to the fact that the monoclinic phase presents worse mechanical properties than the tetragonal one, there is a volume change of 4% between phases that gives rise to defects in the material as microcracks. Due to this reason, zirconia prostheses failed catastrophically inside the human body between 1999 and 20011. Previous researches reveal that Al2O3 addition suppress the propagation of phase transformation2. Thus, the aim of the present work is to study the hydrothermal ageing of zirconia doped with ceria and toughened with alumina (10Ce-TZP/Al2O3) composite, which has been sintered by microwave employing two different frequencies: 2.45 and 5.8 GHz. Microwave heating technology is based on the absorption of electromagnetic radiation by the material, which allows the sample to be heated. So far, most microwave heating equipments use 2.45 GHz; accordingly, the novelty of this study is to employ a frequency of 5.8 GHz and to investigate its effect on LTD. LTD is carried out in an autoclaved in steam at 120 ºC and 1.2 bar, because these conditions accelerate the hydrothermal aging process3. In order to characterize the degraded samples, micro-Raman spectroscopy, AFM, nanoindentation technique and electronic microscopy have been performed. References 1. Norton, M. R., Yarlagadda, R., Anderson, G. H. J. Bone Joint Surg. Br., 2002, 84–B, 631–635. 2. Fabbri, P., Piconi, C., Burresi, E., Magnani, G., Mazzanti, F., Mingazzini, C. Dent. Mater., 2014. 3. Presenda, Á., Salvador, M. D., Moreno, R., Borrell, A. J. Am. Ceram. Soc., 2015, 98, 3680–3689., The authors thank the Generalitat Valenciana for the financial support provided to the PROMETEU/2016/040 project. A. Borrell is grateful to the Spanish Ministry of Economy and Competitiveness for her RyC contract (RYC-2016-20915).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Learning with con gurable operators and RL-based heuristics

  • Martínez-Plumed, Fernando|||0000-0003-2902-6477
  • Ferri Ramírez, César|||0000-0002-8975-1120
  • Hernández-Orallo, José|||0000-0001-9746-7632
  • Ramírez Quintana, María José|||0000-0002-0559-3568
In this paper, we push forward the idea of machine learning systems for which the operators can be modi ed and netuned for each problem. This allows us to propose a learning paradigm where users can write (or adapt) their operators, according to the problem, data representation and the way the information should be navigated. To achieve this goal, data instances, background knowledge, rules, programs and operators are all written in the same functional language, Erlang. Since changing operators a ect how the search space needs to be explored, heuristics are learnt as a result of a decision process based on reinforcement learning where each action is de ned as a choice of operator and rule. As a result, the architecture can be seen as a `system for writing machine learning systems' or to explore new operators., This work was supported by the MEC projects CONSOLIDER-INGENIO 26706 and TIN 2010-21062-C02-02, GVA project PROMETEO/2008/051, and the REFRAME project granted by the European Coordinated Research on Long-term Challenges in Information and Communication Sciences & Technologies ERA-Net (CHIST-ERA), and funded by the Ministerio de Econom´ıa y Competitividad in Spain. Also, F. Mart´ınez-Plumed is supported by FPI-ME grant BES-2011-045099
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Inspecting rewriting logic computations (in a parametric and stepwise way)

  • Alpuente Frasnedo, María|||0000-0002-9268-1178
  • Sapiña-Sanchis, Julia|||0000-0003-2994-6986
  • Ballis, Demis
  • Frechina, F.
Trace inspection is concerned with techniques that allow the trace content to be searched for specific components. This paper presents a rich and highly dynamic, parameterized technique for the trace inspection of Rewriting Logic theories that allows the non-deterministic execution of a given unconditional rewrite theory to be followed up in different ways. Using this technique, an analyst can browse, slice, filter, or search the traces as they come to life during the program execution. Starting from a selected state in the computation tree, the navigation of the trace is driven by a user-defined, inspection criterion that specifies the required exploration mode. By selecting different inspection criteria, one can automatically derive a family of practical algorithms such as program steppers and more sophisticated dynamic trace slicers that facilitate the dynamic detection of control and data dependencies across the computation tree. Our methodology, which is implemented in the Anima graphical tool, allows users to capture the impact of a given criterion thereby facilitating the detection of improper program behaviors., This work has been partially supported by the EU (FEDER), the Spanish MEC project ref. TIN2010-21062-C02-02, the Spanish MICINN complementary action ref. TIN2009-07495-E, and by Generalitat Valenciana ref. PROMETEO2011/052. This work was carried out during the tenure of D. Ballis’ ERCIM “Alain Bensoussan ”Postdoctoral Fellowship. The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement n. 246016. F. Frechina was supported by FPU-ME grant AP2010-5681.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Strong and weak operational termination of order-sorted rewrite theories

  • Lucas Alba, Salvador|||0000-0001-9923-2108
  • Meseguer, José
This paper presents several new results on conditional term rewriting within the general framework of order-sorted rewrite theories (OSRTs) which contains the more restricted framework of conditional term rewriting systems (CTRSs) as a special case. The results uncover some subtle issues about conditional termination. We first of all generalize a previous known result characterizing the operational termination of a CTRS by the quasi-decreasing ordering notion to a similar result for OSRTs. Second, we point out that the notions of *irreducible* term and of *normal form*, which coincide for unsorted rewriting are *totally different* for conditional rewriting and formally characterize that difference. We then define the notion of a *weakly operationally terminating* (or *weakly normalizing*) OSRT, give several evaluation mechanisms to compute normal forms in such theories, and investigate general conditions under which the rewriting-based operational semantics and the initial algebra semantics of a confluent OSRT coincide thanks to a notion of *canonical term algebra*. Finally, we investigate appropriate conditions and proof methods to ensure good executability properties of an OSRT for computing normal forms., Research partially supported by NSF grant CNS 13-19109. Salvador Lucas’ research was developed during a sabbatical year at the CS Dept. of the UIUC and was also partially supported by Spanish MECD grant PRX12/00214, MINECO project TIN2010-21062-C02-02, and GV grant BEST/2014/026 and project PROMETEO/2011/052.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Explicit length modelling for statistical machine translation

  • Silvestre Cerdà, Joan Albert|||0000-0003-2291-8296
  • Civera Saiz, Jorge|||0000-0002-0963-0143
  • Andrés Ferrer, Jesús
Explicit length modelling has been previously explored in statistical pattern recognition with successful results. In this paper, two length models along with two parameter estimation methods for statistical machine translation (SMT) are presented. More precisely, we incorporate explicit length modelling in a state-of-the-art log-linear SMT system as an additional feature function in order to prove the contribution of length information. Finally, promising experimental results are reported on a reference SMT task. © 2011 Springer-Verlag., Work supported by the EC (FEDER/FSE) and the Spanish MEC/MICINN under the MIPRCV “Consolider Ingenio 2010” program (CSD2007-00018) and iTrans2 (TIN2009-14511) projects. Also supported by the Spanish MITyC under the erudito.com (TSI-020110-2009-439) project and by the Generalitat Valenciana under grant Prometeo/2009/014 and GV/2010/067, and by the “Vicerrectorado de Investigaci´on de la UPV” under grant 20091027.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

An empirical analysis of the influence of classmates on the academic performance

  • Herrero Cuco, Carlos|||0000-0001-9599-8544
  • Llorens Agost, María Luisa|||0000-0002-2790-0055
  • Oliver Villarroya, Javier|||0000-0002-1169-1260
  • Silva, Josep|||0000-0001-5096-0008
  • Tamarit Muñoz, Salvador
This poster presents ongoing work that studies the influence of classmates over students’ grades. We want to analyze different students habits and empirically quantify how they in- fluence their academic performance. In particular, we want to answer the following questions: Do best/worst students sit together? Do students who sit alone get better grades than those who sit in pairs?, This work has been partially supported by the Spanish MEC under grant TIN2008-06622-C03-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052. Salvador Tamarit was partially supported by the Spanish MICINN under FPI grant BES-2009-015019.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Optimal divide and query

  • Insa Cabrera, David
  • Silva, Josep|||0000-0001-5096-0008
Algorithmic debugging is a semi-automatic debugging technique that allows the programmer to precisely identify the location of bugs without the need to inspect the source code. The technique has been successfully adapted to all paradigms and mature implementations have been released for languages such as Haskell, Prolog or Java. During three decades, the algorithm introduced by Shapiro and later improved by Hirunkitti has been thought optimal. In this paper we first show that this algorithm is not optimal, and moreover, in some situations it is unable to find all possible solutions, thus it is incomplete. Then, we present a new version of the algorithm that is proven optimal, and we introduce some equations that allow the algorithm to identify all optimal solutions., This work has been partially supported by the Spanish Ministerio de Ciencia e Innovación under grant TIN2008-06622-C03-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Page Segmentation of Structured Documents Using 2D Stochastic Context-Free Grammars

  • Álvaro Muñoz, Francisco
  • Cruz Fernández, Francisco
  • Ramos Terrades, Oriol
  • Benedí Ruiz, José Miguel
  • Sánchez Peiró, Joan Andreu|||0000-0003-0423-2020
n this paper we define a bidimensional extension of Stochastic Context-Free Grammars for page segmentation of structured documents. Two sets of text classification features are used to perform an initial classification of each zone of the page. Then, the page segmentation is obtained as the most likely hypothesis according to a grammar. This approach is compared to Conditional Random Fields and results show significant improvements in several cases. Furthermore, grammars provide a detailed segmentation that allowed a semantic evaluation which also validates this model., Work partially supported by the Spanish MEC under the STraDA research project (TIN2012-37475-C02-01), the MITTRAL (TIN2009- 14633-C03-01) project, the Spanish projects TIN2009-14633-C03-01/03 and 2010- CONES-00029, the FPU grant (AP2009-4363), by the Generalitat Valenciana under the grant Prometeo/2009/014, and through the EU 7th Framework Programme grant tranScriptorium (Ref: 600707)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Comparing humans and AI agents

  • Insa Cabrera, Javier
  • Dowe, David L.
  • España Cubillo, Sergio
  • Henánez-Lloreda, M. Victoria
  • Hernández-Orallo, José|||0000-0001-9746-7632
Comparing humans and machines is one important source of information about both machine and human strengths and limitations. Most of these comparisons and competitions are performed in rather specific tasks such as calculus, speech recognition, translation, games, etc. The information conveyed by these experiments is limited, since it portrays that machines are much better than humans at some domains and worse at others. In fact, CAPTCHAs exploit this fact. However, there have only been a few proposals of general intelligence tests in the last two decades, and, to our knowledge, just a couple of implementations and evaluations. In this paper, we implement one of the most recent test proposals, devise an interface for humans and use it to compare the intelligence of humans and Q-learning, a popular reinforcement learning algorithm. The results are highly informative in many ways, raising many questions on the use of a (universal) distribution of environments, on the role of measuring knowledge acquisition, and other issues, such as speed, duration of the test, scalability, etc., We thank the anonymous reviewers for their helpful comments. We also thank José Antonio Martín H. for helping us with several issues about the RL competition, RL-Glue and reinforcement learning in general. We are also grateful to all the subjects who took the test. We also thank the funding from the Spanish MEC and MICINN for projects TIN2009-06078- E/TIN, Consolider-Ingenio CSD2007-00022 and TIN2010-21062-C02, for MEC FPU grant AP2006-02323, and Generalitat Valenciana for Prometeo/2008/051
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Character-level interaction in multimodal computer-assisted transcription of text images

  • Martín-Albo Simón, Daniel
  • Romero Gómez, Verónica
  • Toselli, Alejandro Héctor|||0000-0001-6955-9249
  • Vidal, Enrique|||0000-0003-4579-5196
To date, automatic handwriting text recognition systems are far from being perfect and heavy human intervention is often required to check and correct the results of such systems. As an alternative, an interactive framework that integrates the human knowledge into the transcription process has been presented in previous works. In this work, multimodal interaction at character-level is studied. Until now, multimodal interaction had been studied only at whole-word level. However, character-level pen-stroke interactions may lead to more ergonomic and friendly interfaces. Empirical tests show that this approach can save significant amounts of user effort with respect to both fully manual transcription and non-interactive post-editing correction., Work supported by the Spanish Government (MICINN and “Plan E”) under the MITTRAL (TIN2009-14633-C03-01) research project and under the research programme Consolider Ingenio 2010: MIPRCV (CSD2007-00018), and by the Generalitat Valenciana under grant Prometeo/2009/014.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Experiences on Using Intelligent Planning for Curriculum Personalization in Moodle

  • CAPUTI, VALENTINA
  • Garrido, Antonio|||0000-0002-8219-6777
In this paper we discuss our experiences on using artificial intelligence to plan customized learning paths in the Moodle platform. In particular, we found some limitations in defining students’ profiles, complex relationships between activities and personalized views of the learning contents. We show how we solved this kind of problems in order to create an integrated system for the application of our planning approach in Moodle, Valentina Caputi thanks the European Commission, the European Social Fund, and the Regione Calabria for financial support of her PhD fellowship and funding for her stay in Valencia. This paper is co-funded with support from the European Commission, the European Social Fund and the Regione Calabria. The paper was also partially funded by the Consolider AT project CSD2007- 0022 INGENIO 2010 of the Spanish Ministry of Science and Innovation, the MICINN project TIN2011- 27652-C03-01 and the Valencian Prometeo project 2008/051. The European Commission and the Regione Calabria disclaim any responsibility for the use that may be made of the information contained in this publication
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Partial least squares for word confidence estimation in machine translation

  • González Rubio, Jesús
  • Navarro Cerdan, José Ramón|||0000-0002-6692-5941
  • Casacuberta Nolla, Francisco|||0000-0002-8497-5598
We present a new technique to estimate the reliability of the words in automatically generated translations. Our approach addresses confidence estimation as a classification problem where a confidence score is to be predicted from a feature vector that represents each translated word. We describe a new set of prediction features designed to capture context information, and propose a model based on partial least squares to perform the classification. Good empirical results are reported in a large-domain news translation task., Work supported by the European Union Seventh Framework Program (FP7/2007-2013) under the CasMaCat project (grants agreement no 287576), by Spanish MICINN under TIASA (TIN2009-14205-C04-02) project, and by the Generalitat Valenciana under grant ALMPR (Prometeo/2009/014).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Online learning via dynamic reranking for Computer Assisted Translation

  • Martínez Gómez, Pascual
  • Sanchis Trilles, Germán
  • Casacuberta Nolla, Francisco|||0000-0002-8497-5598
New techniques for online adaptation in computer assisted translation are explored and compared to previously existing approaches. Under the online adaptation paradigm, the translation system needs to adapt itself to real-world changing scenarios, where training and tuning may only take place once, when the system is set-up for the first time. For this purpose, post-edit information, as described by a given quality measure, is used as valuable feedback within a dynamic reranking algorithm. Two possible approaches are presented and evaluated. The first one relies on the well-known perceptron algorithm, whereas the second one is a novel approach using the Ridge regression in order to compute the optimum scaling factors within a state-of-the-art SMT system. Experimental results show that such algorithms are able to improve translation quality by learning from the errors produced by the system on a sentence-by-sentence basis., This paper is based upon work supported by the EC (FEDER/FSE) and the Spanish MICINN under projects MIPRCV “Consolider Ingenio 2010” (CSD2007-00018) and iTrans2 (TIN2009-14511). Also supported by the Spanish MITyC under the erudito.com (TSI-020110-2009-439) project, by the Generalitat Valenciana under grant Prometeo/2009/014 and scholarship GV/2010/067 and by the UPV under grant 20091027
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

An Image-Based Measure for Evaluation of Mathematical Expression Recognition

  • Álvaro Muñoz, Francisco
  • Benedí Ruiz, José Miguel
  • Sánchez Peiró, Joan Andreu|||0000-0003-0423-2020
Mathematical expression recognition is an active research field that is related to document image analysis and typesetting. In this study, we present a novel global performance evaluation measure for mathematical expression recognition based on image matching. Using an image representation for evaluation tries to overcome the representation ambiguity as human beings do. The results of a recent competition were used to perform several experiments in order to analyze the benefits and drawbacks of this measure., This work was partially supported by the Spanish MEC under the STraDA research project (TIN2012-37475-C02-01), the MITTRAL (TIN2009-14633-C03-01) project, the FPU grant (AP2009-4363), by the Generalitat Valenciana under the grant Prometeo/2009/014, and through the EU 7th Framework Programme grant tranScriptorium (Ref: 600707)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Balance recovery through virtual stepping exercises using Kinect skeleton tracking: a follow-up study

  • Llorens Rodríguez, Roberto|||0000-0002-8677-8707
  • Alcañiz Raya, Mariano Luis|||0000-0001-9207-0636
  • Colomer Font, Carolina
  • Navarro, Maria Dolores
[EN] Stroke patients often suffer from hemiparesis, which affects their balance condition and consequently their self-dependency and quality of life. Balance rehabilitation can be a long and tedious process. Virtual rehabilitation systems have been reported to provide therapeutic benefits to the balance recovery of stroke patients while increasing their motivation. This paper presents a follow-up study involving chronic stroke patients to evaluate the clinical effectiveness of a virtual stepping exercise using skeleton tracking through a low-cost Kinect depth sensor., This study was funded in part by Ministerio de Educación y Ciencia Spain, Projects Consolider-C (SEJ2006-14301/PSIC), “CIBER of Physiopathology of Obesity and Nutrition, an initiative of ISCIII” and the Excellence Research Program PROMETEO (Generalitat Valenciana. Conselleria de Educación, 2008-157).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Improving the minimum description length inference of phrase-based translation models

  • Gonzalez Rubio, Jesus
  • Casacuberta Nolla, Francisco|||0000-0002-8497-5598
We study the application of minimum description length (MDL) inference to estimate pattern recognition models for machine translation. MDL is a theoretically-sound approach whose empirical results are however below those of the state-of-the-art pipeline of training heuristics. We identify potential limitations of current MDL procedures and provide a practical approach to overcome them. Empirical results support the soundness of the proposed approach., Work supported by the EU 7th Framework Programme (FP7/2007–2013) under the CasMaCat project (grant agreement no 287576), by Spanish MICINN under grant TIN2012-31723, and by the Generalitat Valenciana under grant ALMPR (Prometeo/2009/014).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Evaluating a reinforcement learning algorithm with a general intelligence test

  • Insa Cabrera, Javier
  • Dowe, David L.
  • Hernández-Orallo, José|||0000-0001-9746-7632
In this paper we apply the recent notion of anytime universal intelligence tests to the evaluation of a popular reinforcement learning algorithm, Q-learning. We show that a general approach to intelligence evaluation of AI algorithms is feasible. This top-down (theory-derived) approach is based on a generation of environments under a Solomonoff universal distribution instead of using a pre-defined set of specific tasks, such as mazes, problem repositories, etc. This first application of a general intelligence test to a reinforcement learning algorithm brings us to the issue of task-specific vs. general AI agents. This, in turn, suggests new avenues for AI agent evaluation and AI competitions, and also conveys some further insights about the performance of specific algorithms. © 2011 Springer-Verlag., We are grateful for the funding from the Spanish MEC and MICINN for projects TIN2009-06078-E/TIN, Consolider-Ingenio CSD2007-00022 and TIN2010-21062-C02, for MEC FPU grant AP2006-02323, and Generalitat Valenciana for Prometeo/2008/051.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

GameTeen: new tools for evaluating and training emotional regulation strategies

  • Rodriguez-Ortega, Alejandro|||0000-0003-4781-6368
  • Alcañiz Raya, Mariano Luis|||0000-0001-9207-0636
  • Guixeres Provinciale, Jaime
  • Rey, Beatriz
  • BAÑOS, R.
  • Wrzesien, Maja
  • Gómez Martínez, Mario
  • Pérez López, David Clemente
  • Rasal, Paloma
  • Parra Vargas, Elena
The aim of this paper is to describe GameTeen, a novel instrument for the assessment and training of Emotional Regulation (ER) strategies in adolescent population. These new tools are based on the use of 3D serious games that can be played under different settings. The evolution of ER strategies will be monitored in two ways depending on the setting where the tool is presented. Firstly, in the laboratory, physiological signals and facial expressions of participants will be recorded. Secondly, in real life settings, ecological momentary assessment tools will be used to obtain answers from the subjects using their mobile phone. The goal is to obtain more attractive and reliable tools to evaluate and train ER strategies., This study was funded by Ministerio de Educación y Ciencia Spain, Project Game Teen (TIN2010-20187) and partially by projects Consolider-C (SEJ2006-14301/PSIC), “CIBER of Physiopathology of Obesity and Nutrition, an initiative of ISCIII” and Excellence Research Program PROMETEO (Generalitat Valenciana. Consellería de Educación, 2008-157). The work of A. Rodríguez was supported by the Spanish MEC under an FPI Grant BES-2011-043316.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Integrating the goal and business process perspectives in information system analysis

  • Ruiz Carmona, Luz Marcela
  • Costal, Dolors
  • España Cubillo, Sergio
  • Franch, Xavier
  • Pastor López, Oscar|||0000-0002-1320-8471
There are several motivations to promote investment and scientific effort in the integration of intentional and operational perspectives: organisa- tional reengineering, continuous improvement of business processes, alignment among complementary analysis perspectives, information traceability, etc. In this paper we propose the integration of two modelling languages that support the creation of goal and business process models: the i* goal-oriented modelling method and Communication Analysis, a communication-oriented business process modelling method. We describe the methodological integration of the two modelling methods with the aim of fulfilling several criteria: i) to rely on appropriate theories; ii) to provide abstract and concrete syntaxes; iii) to provide scenarios of application; and iv) to develop tool support. We provide guidelines for using the two modelling methods in a top-down analysis scenario. We also present an illustrative case that demonstrates the feasibility of the approach., This work has been supported by the Spanish MICINN PROS-Req (TIN2010-19130-C02-01, TIN2010-19130-C02-02); the Generalitat Valenciana ORCA (PROMETEO/2009/015); the FPI-UPV pre-doctoral grant; the European Commission FP7 Project CaaS (611351); and the ERDF structural funds.