@misc{2012:PNI:TY2,
  tipoactividad = {Otras publicaciones},
  internacional = {no},
  url = {http://blogs.elpais.com/turing/2013/06/},
  author = {Pablo Nogueira},
  title = {El problema de la parada de los programas y de las personas},
  howpublished = {Blog del {A{\~{n}}o Turing} 2012 del peri{\'{o}}dico {El
                  Pa{\'{i}}s}},
  month = {June 27},
  year = {2013}
}
@misc{2012:PNI:TY1,
  tipoactividad = {Otras publicaciones},
  internacional = {no},
  url = {http://blogs.elpais.com/turing/2013/06/},
  author = {Pablo Nogueira},
  title = {John tiene raz{\'{o}}n},
  howpublished = {Blog del {A{\~{n}}o Turing} 2012 del peri{\'{o}}dico {El
                  Pa{\'{i}}s}},
  month = {June 20},
  year = {2013}
}
@techreport{RFHM2013TR,
  author = {Ricardo J. Rodr\'{i}guez and L-{\AA}. Fredlund and A. Herranz and
	Julio Mari{\~{n}}o},
  title = {{{\tt UMErL}: Verification of UML Diagrams through Model Checking}},
  institution = {Universidad Polit{\'{e}}cnica de Madrid},
  year = {2013},
  type = {Unpublished},
  number = {UPM-BABEL-2013-001},
  note = {Submitted to ACM TECS. Available at \url{https://www.dropbox.com/s/kquuirvtstid1v0/RFHM-TR-01-13_unpublished.pdf}},
  owner = {death},
  timestamp = {2013.11.17},
  url = {https://www.dropbox.com/s/kquuirvtstid1v0/RFHM-TR-01-13_unpublished.pdf}
}
@inproceedings{marinno:2013:interpolationTPF,
  author = {Julio Mari{\~{n}}o},
  title = {Euclidean Interpolation: from Mathematical Structures to Types and Back},
  booktitle = {XII Jornadas sobre Programaci{\'{o}}n y Lenguajes PROLE
                  2013 y V Taller de Programaci{\'{o}}n Funcional TPF 2013},
  month = sep,
  year = {2013},
  editor = {Laura Castro and Lars-\AA ke Fredlund}
}
@inproceedings{marinno:2013:algorithmsTPF,
  author = {Julio Mari{\~{n}}o},
  title = {A Course in Algorithm Design Based on Higher-order Patterns},
  booktitle = {XII Jornadas sobre Programaci{\'{o}}n y Lenguajes PROLE
                  2013 y V Taller de Programaci{\'{o}}n Funcional TPF 2013},
  month = sep,
  year = {2013},
  editor = {Laura Castro and Lars-\AA ke Fredlund}
}
@inproceedings{susana:2013:D4D,
  tipoactividad = {Otras publicaciones},
  author = {Carlos Badenes Olmedo and Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {DAMMoPD: Data Analysis and Mining of Mobile Phone Dataset},
  booktitle = {Proceeding of NetMob 2013. Mayo 1, 2013, Boston, EEUU},
  note = {Poster at Special session of the Orange D4D challenge},
  year = {2013}
}
@unpublished{susana:2013:charla,
  tipoactividad = {Cursos, seminarios y tutoriales},
  internacional = {yes},
  author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {Comunicaci{\'{o}}n y relaci{\'{o}}n interpersonal: las claves del {\'{e}}xito profesional},
  note = {Conferencia organizada en el Instituto Cervantes de Fez},
  address = {Fez, Marruecos},
  month = dec,
  year = {2013}
}
@unpublished{susana:2013:charlaSummit,
  tipoactividad = {Cursos, seminarios y tutoriales},
  internacional = {yes},
  author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {Financing Projects, how to build a business model for Technology Enhanced Education},
  note = {Technology Enhanced Cities Summit},
  address = {Ciudad del Cabo, Sud{\'{a}}frica},
  month = nov,
  year = {2013}
}
@unpublished{susana:2013:charlaTryit,
  tipoactividad = {Cursos, seminarios y tutoriales},
  internacional = {yes},
  author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {Cooperaci{\'{o}}n internacional y justicia social en la Facultad de Inform{\'{a}}tica},
  note = {Jornadas Try it. Facultad de Inform{\'{a}}tica (UPM)},
  address = {Madrid, Spain},
  month = mar,
  year = {2013}
}
@unpublished{susana:2013:charlaitdUPM,
  tipoactividad = {Cursos, seminarios y tutoriales},
  internacional = {yes},
  author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {UBURYO (ofreciendo oportunidades) Un programa transparente de microcr{\'{e}}ditos universitarios},
  note = {Jornadas de Innovaci{\'{o}}n itdUPM - Ongawa},
  address = {Madrid, Spain},
  month = feb,
  year = {2013}
}
@unpublished{susana:2013:charlaAECID,
  tipoactividad = {Cursos, seminarios y tutoriales},
  internacional = {yes},
  author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {Conferenciante invitado en la Mesa redonda ``I+D en Cooperaci{\'{o}}n para el Desarrollo y Organizaciones no Gubernamentales'' },
  note = {celebraciones del 25 aniversario de la Agencia de Cooperaci{\'{o}}n Espa{\~{n}}ola al Desarrollo},
  address = {Madrid, Spain},
  month = nov,
  year = {2013}
}
@unpublished{susana:2013:charlaGNBS,
  tipoactividad = {Cursos, seminarios y tutoriales},
  internacional = {yes},
  author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {Moderadora del Panel ``Technological Innovations in Management and Entrepreneurship Education''},
  note = {2013 Annual Conference and 10th Anniversary Celebration ``Education, Employment and Enterpreneurship''},
  address = {Tunez, Tunez},
  month = jun,
  year = {2013}
}
@unpublished{susana:2013:charlaSEC,
  tipoactividad = {Cursos, seminarios y tutoriales},
  internacional = {yes},
  author = {Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {Conferenciante invitado y facilitador de la mesa redonda sobre Educaci{\'{o}}n},
  note = {Technology, Innovation and Social Change. http://sec2013.etsii.upm.es},
  address = {Madrid, Spain},
  month = apr,
  year = {2013}
}
@inproceedings{2013:MMH:SOTICS,
  author = {Mar{\'{i}}a Auxiliadora Montes and Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {Metodolog{\'{i}}a para Determinar la Distribuci{\'{o}}n de Puntos de
Acceso a Gobierno Electr{\'{o}}nico},
  booktitle = {Actas del VI Congreso Universidad y Cooperaci{\'{o}}n al Desarrollo, Junio 24-26, 2013, Valencia, Espa{\~{n}}a},
  year = {2013},
  isbn = {978-84-9048-035-9}
}
@inproceedings{2013:GPN:TPF,
  tipoactividad = {Ponencias en congresos},
  internacional = {no},
  revisores = {yes},
  author = {{{\'{A}}lvaro} {Garc{\'{i}}a-P{\'{e}}rez} and Pablo Nogueira},
  title = {Derivaci{\'{o}}n de int{\'{e}}rpretes del c{\'{a}}lculo lambda con tipos
                  graduales},
  booktitle = {Actas de las {XIII} {J}ornadas sobre {P}rogramaci{\'{o}}n y
                  {L}enguajes - {PROLE}'13, {IV} {C}ongreso {E}spa{\~{n}}ol de
                  {I}nform{\'{a}}tica - {CEDI}'13},
  url = {http://www.sistedes.es/ficheros/actas-conferencias/PROLE/2013.pdf},
  isbn = {978-84-695-8331-9},
  pages = {24--25},
  year = {2013},
  editor = {L.-\AA. Fredlund and L. Castro},
  address = {Madrid},
  month = sep,
  organization = {Sistedes},
  optpublisher = {}
}
@inproceedings{2013:GPNMN:PPDP,
  tipoactividad = {Ponencias en congresos},
  internacional = {yes},
  revisores = {yes},
  author = {{{\'{A}}lvaro} {Garc{\'{i}}a-P{\'{e}}rez} and Pablo Nogueira and Juan Jos{\'{e}}
                  {Moreno Navarro}},
  title = {Deriving the Full-reducing Krivine Machine from the
                  Small-step Operational Semantics of Normal Order},
  booktitle = {Proceedings of the 15th {I}nternational {S}ymposium on
                  {P}rinciples and {P}ractice of {D}eclarative {P}rogramming -
                  {PPDP'13}},
  year = {2013},
  isbn = {978-1-4503-2154-9},
  location = {Madrid, Spain},
  pages = {85--96},
  numpages = {12},
  url = {http://doi.acm.org/10.1145/2505879.2505887},
  doi = {10.1145/2505879.2505887},
  publisher = {ACM Press},
  address = {New York, NY, USA},
  abstract = {We derive by program transformation Pierre Cr{\'{e}}gut's
                  full-reducing Krivine machine KN from the structural
                  operational semantics of the normal order reduction strategy
                  in a closure-converted pure lambda calculus. We thus
                  establish the correspondence between the strategy and the
                  machine, and showcase our technique for deriving
                  full-reducing abstract machines.  Actually, the machine we
                  obtain is a slightly optimised version that can work with
                  open terms and may be used in implementations of proof
                  assistants.}
}
@inproceedings{fcta2013-pablos-munoz,
  author = {Pablos-Ceruelo, V{\'{i}}ctor and Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {Getting Answers to Fuzzy and Flexible Searches by Easy Modelling of Real-World Knowledge},
  booktitle = {IJCCI 2013 - Proceedings of the 5th International Joint Conference on Computational Intelligence},
  year = {2013},
  month = {September},
  day = {20-22},
  address = {Vilamoura, Algarve, Portugal},
  url = {http://dx.doi.org/10.5220/0004555302650272},
  doi = {10.5220/0004555302650272},
  ee = {},
  isbn = {978-989-8565-77-8},
  publisher = {SCITEPRESS Digital Library},
  opturl = {http://www.fcta.ijcci.org/Abstracts/2013/FCTA_2013_Abstracts.htm#Area0FullPapers},
  note = {Proceedings of the 5th International Conference on Fuzzy Computation Theory and Applications (FCTA'2013)}
}
@inproceedings{2013:BEGM:SEAA,
  author = {{Clara {Benac Earle}} and {Elena G\'{o}mez-Mart\'{\i}nez} and {Stefano Tonetta} and {Stefano Puri} and {Silvia Mazzini} and {{Jean~Louis} Gilbert} and {Olivier Hachet} and {{Ram\'{o}n} {Serna~Oliver}} and {Cecilia Ekelin} and {Katiusca Zedda}},
  title = {{Languages for Safety-Certification Related Properties}},
  booktitle = {Proc. Work in Progress Session at 39th Euromicro Conf. on Software Engineering and Advanced Applications (SEAA'13)},
  year = {2013},
  pdf = {http://babel.ls.fi.upm.es/~egomez/papers/CBE_et_al.pdf},
  isbn = {978-3-902457-38-7}
}
@unpublished{agp-aarhus:2013,
  tipoactividad = {Cursos, seminarios y tutoriales},
  internacional = {yes},
  author = {{{\'{A}}lvaro} {Garc{\'{i}}a-P{\'{e}}rez}},
  title = {A syntactic and functional correspondence between reduction
                  semantics and reduction-free full normalisers},
  note = {Talk at the weakly PL Entropy Meeting},
  descripcion = {Olivier Danvy and others have shown the syntactic
                  correspondence between reduction semantics (a small-step
                  semantics) and abstract machines, as well as the functional
                  correspondence between reduction-free normalisers (a
                  big-step semantics) and abstract machines. The
                  correspondences are established by program-transformation
                  (so-called interderivation) techniques. A reduction
                  semantics and a reduction-free normaliser are interderivable
                  when the abstract machine obtained from them is the
                  same. However, the correspondences fail when the underlying
                  reduction strategy is hybrid, i.e., relies on another
                  sub-strategy. Hybridisation is an essential structural
                  property of full-reducing and complete
                  strategies. Hybridisation is unproblematic in the functional
                  correspondence. But in the syntactic correspondence the
                  refocusing and inlining-of-iterate-function steps become
                  context sensitive, preventing the refunctionalisation of the
                  abstract machine. We show how to solve the problem and
                  showcase the interderivation of normalisers for normal
                  order, the standard, full-reducing and complete strategy of
                  the pure lambda calculus. Our solution makes it possible to
                  interderive, rather than contrive, full-reducing abstract
                  machines. As expected, the machine we obtain is a variant of
                  Pierre Cr{\'{e}}gut's full Krivine machine KN.},
  organization = {Faculty of Science, Aarhus University, {DK}},
  month = {February 7},
  year = {2013}
}
@article{Carro:2013:MAT:2414446.2414451,
  tipoactividad = {Art{\'{i}}culos en revistas},
  internacional = {yes},
  revisores = {yes},
  author = {Carro, Manuel and Herranz, {{\'{A}}ngel} and {Mari{\~{n}}o}, Julio},
  title = {A model-driven approach to teaching concurrency},
  journal = {Trans. Comput. Educ.},
  issue_date = {January 2013},
  volume = {13},
  number = {1},
  month = jan,
  year = {2013},
  issn = {1946-6226},
  pages = {5:1--5:19},
  articleno = {5},
  numpages = {19},
  url = {http://doi.acm.org/10.1145/2414446.2414451},
  doi = {10.1145/2414446.2414451},
  acmid = {2414451},
  publisher = {ACM},
  address = {New York, NY, USA},
  keywords = {Ada95, Java, Model-driven engineering, coding idiom, concurrency, correct-by-construction, formal specifications, teaching}
}
@inproceedings{2013:GPN:PEPM,
  tipoactividad = {Ponencias en congresos},
  internacional = {yes},
  revisores = {yes},
  author = {{{\'{A}}lvaro} {Garc{\'{i}}a-P{\'{e}}rez} and Pablo Nogueira},
  title = {A syntactic and functional correspondence between reduction
                  semantics and reduction-free full normalisers},
  booktitle = {Proceedings of the {ACM} {SIGPLAN} 2013 {S}ymposium on
                  {P}artial {E}valuation and {P}rogram {M}anipulation - {PEPM'13}},
  year = {2013},
  isbn = {978-1-4503-1842-6},
  location = {Rome, Italy},
  pages = {107--116},
  numpages = {10},
  url = {http://doi.acm.org/10.1145/2426890.2426911},
  doi = {10.1145/2426890.2426911},
  publisher = {ACM Press},
  address = {New York, NY, USA},
  abstract = {Olivier Danvy and others have shown the syntactic
                  correspondence between reduction semantics (a small-step
                  semantics) and abstract machines, as well as the functional
                  correspondence between reduction-free normalisers (a
                  big-step semantics) and abstract machines. The
                  correspondences are established by program transformation
                  (so-called interderivation) techniques. A reduction
                  semantics and a reduction-free normaliser are interderivable
                  when the abstract machine obtained from them is the
                  same. However, the correspondences fail when the underlying
                  reduction strategy is hybrid, i.e., relies on another
                  sub-strategy. Hybridisation is an essential structural
                  property of full-reducing and complete
                  strategies. Hybridisation is unproblematic in the functional
                  correspondence. But in the syntactic correspondence the
                  refocusing and inlining-of-iterate-function steps become
                  context sensitive, preventing the refunctionalisation of the
                  abstract machine. We show how to solve the problem and
                  showcase the interderivation of normalisers for normal
                  order, the standard, full-reducing and complete strategy of
                  the pure lambda calculus. Our solution makes it possible to
                  interderive, rather than contrive, full-reducing abstract
                  machines. As expected, the machine we obtain is a variant of
                  Pierre Cr{\'{e}}gut's full Krivine machine KN.}
}
@techreport{2013:gallego:relmac,
  author = {{Gallego Arias}, Emilio Jes{\'{u}}s and Lipton, James and Mari{\~{n}}o, Julio},
  title = {Constraint Logic Programming with a Relational Machine},
  institution = {University of Pennsylvannia, Wesleyan University, and Universidad Polit{\'{e}}cnica de Madrid},
  year = 2013,
  note = {In preparation}
}
@inproceedings{SusanaD4D2013,
  author = {Carlos Badenes and Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {DAMMoPD: Data Analysis and Mining of Mobile Phone Dataset},
  optcrossref = {},
  optkey = {},
  booktitle = {Mobile Phone Data for Development. Analysis of mobile phone datasets for the development of Ivory Coast},
  pages = {240-261},
  year = {2013},
  opteditor = {},
  optvolume = {},
  number = {},
  series = {},
  address = {Boston, EEUU},
  optmonth = {May},
  optorganization = {MIT},
  optpublisher = {},
  optnote = {arXiv:1210.0137v2 [cs.CY] 28 Jan 2013},
  abstract = {We analyze these four mobile phone datasets provided by Orange, along another information to discover
knowledge that contributing to the socio-economic development of the Ivory Coast population.
This analysis has focused on a development primarily descriptive, but a predictive model would be built to
complete a sustainable solution based on previous results.
So we start discovering different communication patterns and then we'll try to associate these patterns to
geographic locations with enough accuracy to be relevant. With these results we 'll analyze the specific situation on
these places to get a useful knowledge that explains why these patterns occur and find solutions to improve
communications.
Once it is completed, we would need to build a system able to learn of alarms or events that have been found in
that first study, and detect similar situations before that it occur. On that moment we will have built a complete system
to fix communication errors.},
  optannote = {1-3 May}
}
@inproceedings{SusanaCUCD2013,
  author = {Mariuxi {Montes Chunga} and Mu{\~{n}}oz-Hern{\'{a}}ndez, Susana},
  title = {Metodolog{\'{i}}a para Determinar la Distribuci{\'{o}}n de Puntos de
Acceso a Gobierno Electr{\'{o}}nico},
  optcrossref = {},
  optkey = {},
  booktitle = {VI Congreso Universidad y Cooperaci{\'{o}}n al Desarrollo},
  pages = {701-712},
  year = {2013},
  opteditor = {},
  optvolume = {},
  isbn = {978-84-9048-035-9},
  number = {},
  series = {},
  address = {Valencia, Espa{\~{n}}a},
  optmonth = {24-26 Abril},
  optorganization = {},
  optpublisher = {},
  optnote = {},
  abstract = {Este trabajo es de inter{\'{e}}s para territorios en pa{\'{i}}ses en v{\'{i}}as de desarrollo que tengan informaci{\'{o}}n
escasa o limitada sobre la cual planificar Puntos de Acceso a Servicios (PAS). Est{\'{a}} pensado para territorios
que actualmente no cuenten con ning{\'{u}}n o con escasos PAS y que est{\'{e}}n interesados en aplicar esta estrategia
para proveer de servicios a los ciudadanos de su territorio. Aqu{\'{i}} se dan claves para tener una respuesta
con base t{\'{e}}cnica para decidir cu{\'{a}}ntos PAS poner en el territorio y d{\'{o}}nde ubicarlos.
Ante la pregunta de {?`}c{\'{o}}mo realizar una distribuci{\'{o}}n de puntos de acceso a servicios de gobierno electr{\'{o}}nico
sobre un territorio determinado?, este trabajo toma en cuenta tres variables: tama{\~{n}}o de la poblaci{\'{o}}n, distancia
entre poblaciones y costo de implantaci{\'{o}}n de los puntos de acceso. Este proceso se basa en la teor{\'{i}}a
de localizaci{\'{o}}n de instalaciones y usa algoritmos gen{\'{e}}ticos como herramienta t{\'{e}}cnica.
Se ha hecho la aplicaci{\'{o}}n de esta metodolog{\'{i}}a en dos contextos: el Municipio de Santa Elena (Ecuador) y
en la provincia de Asturias (Espa{\~{n}}a). La selecci{\'{o}}n de estos dos territorios se ha planteado para resaltar las
diferencias de esfuerzos en la aplicaci{\'{o}}n de una misma metodolog{\'{i}}a en ambos contextos.},
  optannote = {}
}

This file was generated by bibtex2html 1.98.