Model driven product line engineering : core asset and process implications

Reuse is at the heart of major improvements in productivity and quality in Software Engineering. Both Model Driven Engineering (MDE) and Software Product Line Engineering (SPLE) are software development paradigms that promote reuse. Specifically, they promote systematic reuse and a departure from craftsmanship towards an industrialization of the software development process. MDE and SPLE have established their benefits separately. Their combination, here called Model Driven Product Line Engineering (MDPLE), gathers together the advantages of both. Nevertheless, this blending requires MDE to be recasted in SPLE terms. This has implications on both the core assets and the software development process. The challenges are twofold: (i) models become central core assets from which products are obtained and (ii) the software development process needs to cater for the changes that SPLE and MDE introduce. This dissertation proposes a solution to the first challenge following a feature oriented approach, with an emphasis on reuse and early detection of inconsistencies. The second part is dedicated to assembly processes, a clear example of the complexity MDPLE introduces in software development processes. This work advocates for a new discipline inside the general software development process, i.e., the Assembly Plan Management, which raises the abstraction level and increases reuse in such processes. Different case studies illustrate the presented ideas.

Bilaketan oinarritutako mashup aplikazioa ingelesez idazteko

API bidez eskainitako web zerbitzu baten oinarritutako mashup aplikazioa da, ingelesez idatzitako testu batean okerrak antzeman ahal izateko. REST, JSON, AJAX, Javascript eta jQuery erabiliz garatu da web aplikazio hau.

Gestor de Datos de Banco de Pruebas para Generadores Síncronos

Castellano. En este proyecto se desarrolla una aplicación web que permite la gestión de datos obtenidos en las pruebas que se realizan a los generadores síncronos en Banco de Pruebas. El objetivo de este proyecto es almacenar estos datos en una base de datos de forma que se encuentren centralizados para su posterior explotación.Para llevar a cabo esta tarea, se han utilizado tecnologías como PHP, MySQL, JavaScript y Ajax.

Adaptación de una aplicación RIA desarrollada en Flex a una aplicación HTML5

Babelium Project (tambi en BP de aqu en adelante), es un proyecto de c odigo abierto cuyo principal objetivo es fomentar el aprendizaje de idiomas online. Para ello, haciendo uso de distintas tecnolog as, se cre o una aplicaci on web, Rich Internet Applications (RIA), que permite a los usuarios practicar idiomas por pr actica oral. La aplicaci on dispone de varios m odulos donde, gracias al streaming de v deo, los usuarios pueden grabar o evaluar ejercicios de forma colaborativa. Babelium Project empez o siendo una aplicaci on desarrollada bajo el conjunto de tecnolog as Flex, un conjunto de tecnolog as de Adobe cuya compilaci on resultante es un aplicaci on (web en este caso) basada en Flash. Sin embargo, con la reciente llegada de HTML5, todo parece indicar que Adobe abandonar a Flex en un futuro 1 2 para centrar sus esfuerzos en el desarrollo de soluciones para esta nueva tecnolog a. Por esa raz on, naci o este proyecto, con el n de migrar Babelium Project a HTML5, conjunto de tecnolog as con gran futuro y acogida en el mundo web. Mi trabajo en este proyecto ha consistido, principalmente, en analizar la factibilidad y proceso adecuado de la migraci on de un proyecto de dimensiones considerables desarrollado bajo Flex al conjunto de tecnolog as que forman HTML5, teniendo para ello el proyecto Babelium como caso de prueba. Las fases principales del proyecto han sido: an alisis del estado de HTML5, an alisis de factibilidad, elecci on de un conjunto de tecnolog as para la migraci on, desarrollo de patrones de migraci on y, por ultimo, migraci on de Babelium utilizando dichas tecnolog as y siguiendo dichos patrones.

Desarrollo de la herramienta Admintool usando tecnología .NET

Desarrollo de la herramienta ADMINTOOL para administración de la plataforma Microsoft (Active Directory , Permisos NTFS), en base a tecnologia .NET

SSI-Dijkstra+: Desarrollo de un sistema de resolución de la ambigüedad semántica basada en grafos

Este documento es la memoria de un Proyecto de Final de Carrera de la Ingeniería Técnica en Informática de Sistemas en la Facultad de Informática de San Sebastián que se encuadra en el procesamiento del lenguaje natural (PLN), el campo de la semántica y la desambiguación de palabras. El idioma del proyecto es el Español.

EmanTake: Aplicación Web para facilitar el contacto entre personas interesadas en el aprendizaje de idiomas

Este proyecto se basa en desarrollar una aplicación web llamada Emantake y su finalidad es facilitar la búsqueda de personas para el aprendizaje de idiomas.Para realizarlo se han utilizado diferentes lenguajes, entornos y tecnologías propios de este tipo de aplicaciones las cuales se han estudiado con detenimiento para la realización del proyecto.

WebDiagram3.0

En este proyecto de Fin de Carrera se ha creado una nueva versión de la herramienta WebDiagram, cuya función es facilitar el desarrollo de aplicaciones interactivas mediante la metodología InterMod. La nueva versión de la herramienta se basa en la versión anterior y se diferencia en que contiene un prototipo del Modelo de Diálogo completamente funcional. Además, WebDiagram 3.0 incorpora la concurrencia y mejora algunos aspectos del diagrama. En WebDiagram2.0 se detectaron diversos fallos en la ejecución del programa de prototipado, difíciles de solucionar, que venían arrastrándose a lo largo de las versiones efectuadas de esta herramienta. Con el objetivo de conseguir eliminar todos estos bugs se decidió partir de cero e incorporar el desarrollo guiado por pruebas, también conocido como Test-driven development. Este proceso de desarrollo facilita la corrección de errores, primero escribiendo las pruebas que fallan, y después implementando el código que hace que pase la prueba satisfactoriamente. Las pruebas han sido organizadas en base a Objetivos de Usuario. A lo largo de las iteraciones del proceso se han validado a nivel de requerimientos, presentación y funcionalidad, tal y como aconseja la metodología InterMod. Finalmente, cabe destacar que se ha intentado llevar a cabo el proyecto haciendo un seguimiento activo junto con la directora y otro miembro evaluador para, principalmente, fomentar el trabajo en equipo.

Ikasketa automatikoan oinarritutako gaztelaniako perpaus-identifikatzailea

Euskararako perpaus-identifikatzailearen sorkuntzaren ondoren, gaztelaniarako perpaus-identifikatzailea sortu nahi izan dugu, itzulpen automatikoan lagungarri izango delakoan. Gaztelaniarako perpaus-identifikatzailea sortzeko ikasketa automatikoko teknikak erabili ditugu.

Itzulpen automatikorako tresnen egokitzapena euskararako: post-edizioa, ebaluazioa eta aurre-edizioa

Proiektu honetan zehar Itzulpen Automatikoa eta horren inguruko tresnen inguruan jorratu da. Lengoaia Naturalaren Prozesamendua eta itzulpen automatikoa ikasi eta aztertu egin dira ikuspuntu zabal batetik. Itzulpen automatiko orokorraz eta horren aplikazio mota desberdinetatik gain, bestelako kontzeptuak ere tratatu dira, hala nola, itzulpenean laguntzeko tresnak, itzulpen automatikoaren ebaluazioa eta itzulpen automatikorako testuen aurre-edizioa eta post-edizioa. Ikasketa- eta aztertze-prozesu horretaz gain, erlazionatuta dauden tresnak erabili edota moldatu egin dira euskararako itzulpen automatikoan barne. Hiru atal nagusi nabarmendu daitezke: Lehenengo, OmegaT, itzulpenean laguntzeko softwarea, moldatu da Matxin euskararako itzultzaile automatikoa gehituz. Gainera, IXA Taldearen eta Euskal Wikipediaren arteko kolaborazio-lanean, Wikipediako artikuluak eskuratu, itzuli eta igotzeko aukera egokitu zaio OmegaT-ri eta horren erabilera sustatu da Euskal Wikipediako komunitatean eta UPV/EHUko Informatikako ikasle eta irakaslegoaren artean. Bestalde, lan honetaz baliatuz, OmegaT-k sortzen dituen itzulpen-memoriak, Matxin-en itzulpenen gaineko post-edizioan oinarrituak, eskuratzeko modu bat egin da, horiekin Matxin-en funtzionamendua hobetu ahal izateko. Ondoren, Asiya programan integratu egin da euskara. Asiya-k itzulpen automatikoaren ebaluazio eta meta-ebaluazioak egin ditzakeen aplikazioa da. Hainbat metrika aztertu dira euskara aztertzeko balio ote duten begiratzeko. Besteen artean, lau metrikari euskara gehitzeko saiakera egin nahi izan da IXA Taldeko euskarazko testuen analizatzaile batek eskainitako informazio sintaktikoa gehituz, baina bi metrika soilik egokitu ahal izan dira. Azkenik, DiSeg esaldi-segmentatzailea erabili egin da gaztelerazko corpus baten gainean esaldi luzeak banatzeko. Aurre-edizio hori eta gero itzuli egin dira eta Asiya erabiliz emaitzen ebaluazioa eta konparazioa egin dira, esaldi laburragoekin itzulpen automatiko eraginkorragoa lortzen oten den aztertzeko.

Escultura en los años 90 en el País Vasco: reconfigurando el pasado-presente

[ES] La creación escultórica en el País Vasco durante los años noventa se siguió nutriendo del entramado creativo de la década anterior, mientras se iban difuminando los últimos coletazos programáticos de la posmodernidad. Los jóvenes artistas de esta última década no plantean lenguajes originales, ni plantean la búsqueda de temáticas inéditas, simplemente se aboga por ubicarse en un marco espacial y temporal que les permita seguir creando en base a procesos anteriores, pero con perspectivas que les sirvan para analizar y experimentar las situaciones enclavadas en el presente.

Recursos educativos para la era de la información y comunicación

Ponencia leída en el Foro de Comunicaciones IkasArt II (BEC Barakaldo, 2010.06.18)

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Assisting blog publication: annotation, model transformation, and crossblogging techniques

Although blogs exist from the beginning of the Internet, their use has considerablybeen increased in the last decade. Nowadays, they are ready for being used bya broad range of people. From teenagers to multinationals, everyone can have aglobal communication space.Companies know blogs are a valuable publicity tool to share information withthe participants, and the importance of creating consumer communities aroundthem: participants come together to exchange ideas, review and recommend newproducts, and even support each other. Also, companies can use blogs for differentpurposes, such as a content management system to manage the content of websites,a bulletin board to support communication and document sharing in teams,an instrument in marketing to communicate with Internet users, or a KnowledgeManagement Tool. However, an increasing number of blog content do not findtheir source in the personal experiences of the writer. Thus, the information cancurrently be kept in the user¿s desktop documents, in the companies¿ catalogues,or in another blogs. Although the gap between blog and data source can be manuallytraversed in a manual coding, this is a cumbersome task that defeats the blog¿seasiness principle. Moreover, depending on the quantity of information and itscharacterisation (i.e., structured content, unstructured content, etc.), an automaticapproach can be more effective.Based on these observations, the aim of this dissertation is to assist blog publicationthrough annotation, model transformation and crossblogging techniques.These techniques have been implemented to give rise to Blogouse, Catablog, andBlogUnion. These tools strive to improve the publication process considering theaforementioned data sources.

Semi-automatic generation of learning domain modules for technology supported learning systems

In a time when Technology Supported Learning Systems are being widely used, there is a lack of tools that allows their development in an automatic or semi-automatic way. Technology Supported Learning Systems require an appropriate Domain Module, ie. the pedagogical representation of the domain to be mastered, in order to be effective. However, content authoring is a time and effort consuming task, therefore, efforts in automatising the Domain Module acquisition are necessary.Traditionally, textbooks have been used as the main mechanism to maintain and transmit the knowledge of a certain subject or domain. Textbooks have been authored by domain experts who have organised the contents in a means that facilitate understanding and learning, considering pedagogical issues.Given that textbooks are appropriate sources of information, they can be used to facilitate the development of the Domain Module allowing the identification of the topics to be mastered and the pedagogical relationships among them, as well as the extraction of Learning Objects, ie. meaningful fragments of the textbook with educational purpose.Consequently, in this work DOM-Sortze, a framework for the semi-automatic construction of Domain Modules from electronic textbooks, has been developed. DOM-Sortze uses NLP techniques, heuristic reasoning and ontologies to fulfill its work. DOM-Sortze has been designed and developed with the aim of automatising the development of the Domain Module, regardless of the subject, promoting the knowledge reuse and facilitating the collaboration of the users during the process.