8 Search Results for "Pérez-Marco, Ricardo"

Document
DOI: 10.4230/OASIcs.SLATE.2022.4
Generation of Document Type Exercises for Automated Assessment

Authors: José Paulo Leal, Ricardo Queirós, and Marco Primo

Published in: OASIcs, Volume 104, 11th Symposium on Languages, Applications and Technologies (SLATE 2022)

Abstract
This paper describes ongoing research to develop a system to automatically generate exercises on document type validation. It aims to support multiple text-based document formalisms, currently including JSON and XML. Validation of JSON documents uses JSON Schema and validation of XML uses both XML Schema and DTD. The exercise generator receives as input a document type and produces two sets of documents: valid and invalid instances. Document types written by students must validate the former and invalidate the latter. Exercises produced by this generator can be automatically accessed in a state-of-the-art assessment system. This paper details the proposed approach and describes the design of the system currently being implemented.
Cite as

José Paulo Leal, Ricardo Queirós, and Marco Primo. Generation of Document Type Exercises for Automated Assessment. In 11th Symposium on Languages, Applications and Technologies (SLATE 2022). Open Access Series in Informatics (OASIcs), Volume 104, pp. 4:1-4:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{leal_et_al:OASIcs.SLATE.2022.4,
  author =	{Leal, Jos\'{e} Paulo and Queir\'{o}s, Ricardo and Primo, Marco},
  title =	{{Generation of Document Type Exercises for Automated Assessment}},
  booktitle =	{11th Symposium on Languages, Applications and Technologies (SLATE 2022)},
  pages =	{4:1--4:6},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-245-7},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{104},
  editor =	{Cordeiro, Jo\~{a}o and Pereira, Maria Jo\~{a}o and Rodrigues, Nuno F. and Pais, Sebasti\~{a}o},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2022.4},
  URN =		{urn:nbn:de:0030-drops-167506},
  doi =		{10.4230/OASIcs.SLATE.2022.4},
  annote =	{Keywords: exercise generation, automated assessment, document type assessment}
}
Document
DOI: 10.4230/OASIcs.ICPEC.2022.9
Integration of Computer Science Assessment into Learning Management Systems with JuezLTI

Authors: Juan V. Carrillo, Alberto Sierra, José Paulo Leal, Ricardo Queirós, Salvador Pellicer, and Marco Primo

Published in: OASIcs, Volume 102, Third International Computer Programming Education Conference (ICPEC 2022)

Abstract
Computer science is a skill that will continue to be in high demand in the foreseeable future. Despite this trend, automated assessment in computer science is often hampered by the lack of systems supporting a wide range of topics. While there is a number of open software systems and programming exercise collections supporting automated assessment, up to this date, there are few systems that offer a diversity of exercises ranging from computer programming exercises to markup and databases languages. At the same time, most of the best-of-breed solutions force teachers and students to alternate between the Learning Management System - a pivotal piece of the e-learning ecosystem - and the tool providing the exercises. This issue is addressed by JuezLTI, an international project whose goal is to create an innovative tool to allow the automatic assessment of exercises in a wide range of computer science topics. These topics include different languages used in computer science for programming, markup, and database management. JuezLTI borrows part of its name from the IMS Learning Tools Interoperability (IMS LTI) standard. With this standard, the tool will interoperate with reference systems such as Moodle, Sakai, Canvas, or Blackboard, among many others. Another contribution of JuezLTI will be a pool of exercises. Interoperability and content are expected to foster the adoption of JuezLTI by many institutions. This paper presents the JuezLTI project, its architecture, and its main components.
Cite as

Juan V. Carrillo, Alberto Sierra, José Paulo Leal, Ricardo Queirós, Salvador Pellicer, and Marco Primo. Integration of Computer Science Assessment into Learning Management Systems with JuezLTI. In Third International Computer Programming Education Conference (ICPEC 2022). Open Access Series in Informatics (OASIcs), Volume 102, pp. 9:1-9:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{carrillo_et_al:OASIcs.ICPEC.2022.9,
  author =	{Carrillo, Juan V. and Sierra, Alberto and Leal, Jos\'{e} Paulo and Queir\'{o}s, Ricardo and Pellicer, Salvador and Primo, Marco},
  title =	{{Integration of Computer Science Assessment into Learning Management Systems with JuezLTI}},
  booktitle =	{Third International Computer Programming Education Conference (ICPEC 2022)},
  pages =	{9:1--9:8},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-229-7},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{102},
  editor =	{Sim\~{o}es, Alberto and Silva, Jo\~{a}o Carlos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2022.9},
  URN =		{urn:nbn:de:0030-drops-166130},
  doi =		{10.4230/OASIcs.ICPEC.2022.9},
  annote =	{Keywords: programming, interoperability, automatic assessment, programming exercises}
}
Document
Short Paper
DOI: 10.4230/OASIcs.ICPEC.2021.7
Matching User Interfaces to Assess Simple Web Applications (Short Paper)

Authors: Marco Primo and José Paulo Leal

Published in: OASIcs, Volume 91, Second International Computer Programming Education Conference (ICPEC 2021)

Abstract
This paper presents ongoing research aiming at the automatic assessment of simple web applications, like those used in introductory web technologies courses. The distinctive feature of the proposed approach is a web interface matching procedure. This matching procedure verifies if the web interface being assessed corresponds to that of a reference application; otherwise, provides detailed feedback on the detected differences. Since web interfaces are event-driven, this matching is instrumental to assess the functionality. After mapping web interface elements from two applications, these can be targeted with events and property changes can be compared. This paper details the proposed matching algorithm and the current state of its implementation. It also discusses future work to embed this approach in a web environment for solving web application exercises with automatic assessment.
Cite as

Marco Primo and José Paulo Leal. Matching User Interfaces to Assess Simple Web Applications (Short Paper). In Second International Computer Programming Education Conference (ICPEC 2021). Open Access Series in Informatics (OASIcs), Volume 91, pp. 7:1-7:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{primo_et_al:OASIcs.ICPEC.2021.7,
  author =	{Primo, Marco and Leal, Jos\'{e} Paulo},
  title =	{{Matching User Interfaces to Assess Simple Web Applications}},
  booktitle =	{Second International Computer Programming Education Conference (ICPEC 2021)},
  pages =	{7:1--7:6},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-194-8},
  ISSN =	{2190-6807},
  year =	{2021},
  volume =	{91},
  editor =	{Henriques, Pedro Rangel and Portela, Filipe and Queir\'{o}s, Ricardo and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2021.7},
  URN =		{urn:nbn:de:0030-drops-142237},
  doi =		{10.4230/OASIcs.ICPEC.2021.7},
  annote =	{Keywords: automatic assessment, web interfaces, learning environments}
}
Document
DOI: 10.4230/OASIcs.ICPEC.2020.2
Challenges and Solutions from an Embedded Programming Bootcamp

Authors: J. Pedro Amaro, Jorge Barreiros, Fernanda Coutinho, João Durães, Frederico Santos, Ana Alves, Marco Silva, and João Cunha

Published in: OASIcs, Volume 81, First International Computer Programming Education Conference (ICPEC 2020)

Abstract
Due to the proliferation of IT companies developing web and mobile applications, computer programmers are in such high demand that universities can’t satisfy it with newly graduated students. In response, some organisations started to create coding bootcamps, providing intensive full-time courses focused on unemployed people or individuals seeking for a career change. There is, however, a different set of skills that is becoming increasingly required, but is not addressed by those courses: embedded programming. In fact, the Internet of Things is connecting every device to the internet, thus making knowledge on hardware and C/C++ programming very relevant skills. A group of computer science and electrical engineering university teachers, in collaboration with several industry stakeholders, have promoted an embedded systems programming course in C and C++. This course is based on an intensive project-based approach comprising 6 months of daylong classes followed by 9 months of paid internships. After two editions, thirty embedded programmers, with no relevant previous programming experience, have been placed with the partners’ working force. In this paper, the course organisation and pedagogical methodologies are described. Problems, challenges and adopted solutions are presented and analysed. We conclude that in spite of the intense rhythm and demanding nature of the subject matter, it is possible to find the structure and solutions that keep students engaged and motivated throughout the course, allowing them to gain the required competences and successfully transition into a new career path.
Cite as

J. Pedro Amaro, Jorge Barreiros, Fernanda Coutinho, João Durães, Frederico Santos, Ana Alves, Marco Silva, and João Cunha. Challenges and Solutions from an Embedded Programming Bootcamp. In First International Computer Programming Education Conference (ICPEC 2020). Open Access Series in Informatics (OASIcs), Volume 81, pp. 2:1-2:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{amaro_et_al:OASIcs.ICPEC.2020.2,
  author =	{Amaro, J. Pedro and Barreiros, Jorge and Coutinho, Fernanda and Dur\~{a}es, Jo\~{a}o and Santos, Frederico and Alves, Ana and Silva, Marco and Cunha, Jo\~{a}o},
  title =	{{Challenges and Solutions from an Embedded Programming Bootcamp}},
  booktitle =	{First International Computer Programming Education Conference (ICPEC 2020)},
  pages =	{2:1--2:11},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-153-5},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{81},
  editor =	{Queir\'{o}s, Ricardo and Portela, Filipe and Pinto, M\'{a}rio and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2020.2},
  URN =		{urn:nbn:de:0030-drops-122896},
  doi =		{10.4230/OASIcs.ICPEC.2020.2},
  annote =	{Keywords: Coding Bootcamp, Embedded Programming, Career Change}
}
Document
DOI: 10.4230/OASIcs.ICPEC.2020.3
An Experience of Game-Based Learning in Web Applications Development Courses

Authors: Míriam Antón-Rodríguez, María Ángeles Pérez-Juárez, Francisco Javier Díaz-Pernas, David González-Ortega, Mario Martínez-Zarzuela, and Javier Manuel Aguiar-Pérez

Published in: OASIcs, Volume 81, First International Computer Programming Education Conference (ICPEC 2020)

Abstract
Preparing graduates for working in the software engineering industry is challenging and requires effective learning frameworks and methodologies. More specifically, the challenge of teaching programming languages and paradigms is a very complex task that needs innovative educational tools. This paper presents a game-based educational tool named eLiza, developed and used to support the teaching and learning of programming languages and paradigms related to the development of web applications. eLiza was initially developed as a Moodle-based web application because Moodle is the educational eLearning platform used at the University of Valladolid, but as the use of mobile devices is constantly increasing, Android and iOS versions were created later in order to facilitate the access of the students to the games. This paper describes the main elements and the mechanics in playing eLiza. And it also describes an experience of its use in two engineering courses related to web programming applications development, offered to students in two different engineering study programs at the University of Valladolid, during the academic years 2017-2018 and 2018-2019. The great majority of the students, more than 75%, considered that the use of the eLiza game-based educational tool was positive to improve the teaching and learning process of the topics covered by the courses.
Cite as

Míriam Antón-Rodríguez, María Ángeles Pérez-Juárez, Francisco Javier Díaz-Pernas, David González-Ortega, Mario Martínez-Zarzuela, and Javier Manuel Aguiar-Pérez. An Experience of Game-Based Learning in Web Applications Development Courses. In First International Computer Programming Education Conference (ICPEC 2020). Open Access Series in Informatics (OASIcs), Volume 81, pp. 3:1-3:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{antonrodriguez_et_al:OASIcs.ICPEC.2020.3,
  author =	{Ant\'{o}n-Rodr{\'\i}guez, M{\'\i}riam and P\'{e}rez-Ju\'{a}rez, Mar{\'\i}a \'{A}ngeles and D{\'\i}az-Pernas, Francisco Javier and Gonz\'{a}lez-Ortega, David and Mart{\'\i}nez-Zarzuela, Mario and Aguiar-P\'{e}rez, Javier Manuel},
  title =	{{An Experience of Game-Based Learning in Web Applications Development Courses}},
  booktitle =	{First International Computer Programming Education Conference (ICPEC 2020)},
  pages =	{3:1--3:11},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-153-5},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{81},
  editor =	{Queir\'{o}s, Ricardo and Portela, Filipe and Pinto, M\'{a}rio and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2020.3},
  URN =		{urn:nbn:de:0030-drops-122901},
  doi =		{10.4230/OASIcs.ICPEC.2020.3},
  annote =	{Keywords: eLearning, mLearning, Game-based Learning, Programming Languages, Web Applications Development}
}
Document
DOI: 10.4230/OASIcs.Tokenomics.2019.11
Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks

Authors: Cyril Grunspan and Ricardo Pérez-Marco

Published in: OASIcs, Volume 71, International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)

Abstract
The main goal of this article is to present a direct approach for the formula giving the long-term apparent hashrates of Selfish Mining strategies using only elementary probabilities and combinatorics, more precisely, Dyck words. We can avoid computing stationary probabilities on Markov chain, nor stopping times for Poisson processes as in previous analysis. We do apply these techniques to other bockwithholding strategies in Bitcoin, and then, we consider also selfish mining in Ethereum.
Cite as

Cyril Grunspan and Ricardo Pérez-Marco. Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks. In International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019). Open Access Series in Informatics (OASIcs), Volume 71, pp. 11:1-11:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{grunspan_et_al:OASIcs.Tokenomics.2019.11,
  author =	{Grunspan, Cyril and P\'{e}rez-Marco, Ricardo},
  title =	{{Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks}},
  booktitle =	{International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)},
  pages =	{11:1--11:10},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-108-5},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{71},
  editor =	{Danos, Vincent and Herlihy, Maurice and Potop-Butucaru, Maria and Prat, Julien and Tucci-Piergiovanni, Sara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2019.11},
  URN =		{urn:nbn:de:0030-drops-119755},
  doi =		{10.4230/OASIcs.Tokenomics.2019.11},
  annote =	{Keywords: Bitcoin, Blockchain, Ethereum, Proof-of-Work, Selfish Mining, Stubborn Mining, Apparent Hashrate, Revenue Ratio, Catalan Distributions, Dyck Words, Random Walk}
}
Document
DOI: 10.4230/OASIcs.ICLP.2017.1
Entity set expansion from the Web via ASP

Authors: Weronika T. Adrian, Marco Manna, Nicola Leone, Giovanni Amendola, and Marek Adrian

Published in: OASIcs, Volume 58, Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)

Abstract
Knowledge on the Web in a large part is stored in various semantic resources that formalize, represent and organize it differently. Combining information from several sources can improve results of tasks such as recognizing similarities among objects. In this paper, we propose a logic-based method for the problem of entity set expansion (ESE), i.e. extending a list of named entities given a set of seeds. This problem has relevant applications in the Information Extraction domain, specifically in automatic lexicon generation for dictionary-based annotating tools. Contrary to typical approaches in natural languages processing, based on co-occurrence statistics of words, we determine the common category of the seeds by analyzing the semantic relations of the objects the words represent. To do it, we integrate information from selected Web resources. We introduce a notion of an entity network that uniformly represents the combined knowledge and allow to reason over it. We show how to use the network to disambiguate word senses by relying on a concept of optimal common ancestor and how to discover similarities between two entities. Finally, we show how to expand a set of entities, by using answer set programming with external predicates.
Cite as

Weronika T. Adrian, Marco Manna, Nicola Leone, Giovanni Amendola, and Marek Adrian. Entity set expansion from the Web via ASP. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 1:1-1:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{adrian_et_al:OASIcs.ICLP.2017.1,
  author =	{Adrian, Weronika T. and Manna, Marco and Leone, Nicola and Amendola, Giovanni and Adrian, Marek},
  title =	{{Entity set expansion from the Web via ASP}},
  booktitle =	{Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
  pages =	{1:1--1:5},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-058-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{58},
  editor =	{Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.1},
  URN =		{urn:nbn:de:0030-drops-84629},
  doi =		{10.4230/OASIcs.ICLP.2017.1},
  annote =	{Keywords: answer set programming, entity set expansion, information extraction, natural language processing, word sense disambiguation}
}
Document
DOI: 10.4230/OASIcs.ICLP.2017.3
Reasoning on anonymity in Datalog+/-

Authors: Giovanni Amendola, Nicola Leone, Marco Manna, and Pierfrancesco Veltri

Published in: OASIcs, Volume 58, Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)

Abstract
In this paper we empower the ontology-based query answering framework with the ability to reason on the properties of “known” (non-anonymous) and anonymous individuals. To this end, we extend Datalog+/- with epistemic variables that range over “known” individuals only. The resulting framework, called datalog^{\exists,K}, offers good and novel knowledge representation capabilities, allowing for reasoning even on the anonymity of individuals. To guarantee effective computability, we define shyK, a decidable subclass of datalog^{\exists,K}, that fully generalizes (plain) Datalog, enhancing its knowledge modeling features without any computational overhead: OBQA for shyK keeps exactly the same (data and combined) complexity as for Datalog. To measure the expressiveness of shyK, we borrow the notion of uniform equivalence from answer set programming, and show that shyK is strictly more expressive than the DL ELH. Interestingly, shyK keeps a lower complexity, compared to other Datalog+/- languages that can express this DL.
Cite as

Giovanni Amendola, Nicola Leone, Marco Manna, and Pierfrancesco Veltri. Reasoning on anonymity in Datalog+/-. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 3:1-3:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{amendola_et_al:OASIcs.ICLP.2017.3,
  author =	{Amendola, Giovanni and Leone, Nicola and Manna, Marco and Veltri, Pierfrancesco},
  title =	{{Reasoning on anonymity in Datalog+/-}},
  booktitle =	{Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
  pages =	{3:1--3:5},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-058-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{58},
  editor =	{Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.3},
  URN =		{urn:nbn:de:0030-drops-84587},
  doi =		{10.4230/OASIcs.ICLP.2017.3},
  annote =	{Keywords: Datalog, query answering, Datalog+/-, ontologies, expressiveness}
}
  • Refine by Author
  • 3 Leal, José Paulo
  • 3 Primo, Marco
  • 2 Amendola, Giovanni
  • 2 Leone, Nicola
  • 2 Manna, Marco
  • Show More...

  • Refine by Classification
  • 2 Applied computing → Computer-managed instruction
  • 1 Applied computing → Computer-assisted instruction
  • 1 Applied computing → E-learning
  • 1 Applied computing → Interactive learning environments
  • 1 Information systems → Extensible Markup Language (XML)
  • Show More...

  • Refine by Keyword
  • 2 automatic assessment
  • 1 Apparent Hashrate
  • 1 Bitcoin
  • 1 Blockchain
  • 1 Career Change
  • Show More...

  • Refine by Type
  • 8 document

  • Refine by Publication Year
  • 3 2020
  • 2 2018
  • 2 2022
  • 1 2021

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact