7 Search Results for "L�pez-Barrio, Carlos A."

Document
DOI: 10.4230/OASIcs.ICPEC.2023.3
LCSMAR, an AR Based Tool to Inspect Imperative Programs

Authors: Luis Carlos Martins, Lázaro Vinicius Lima, and Pedro Rangel Henriques

Published in: OASIcs, Volume 112, 4th International Computer Programming Education Conference (ICPEC 2023)

Abstract
LCSMAR is a Learning Resource that takes advantage of Augmented Reality in order to promote the development of Computational Thinking among students who are starting to dive in to the world of computer programming. Students can write code in a imperative programming language and, with the help of their mobile phone, they can visualize and analyze the execution of the code they developed, seeing how variable and data structures change over time with each instruction. Augmented Reality tools allow the visualization of abstract concepts that are often misunderstood and that cause misconception among students, which in term should help students develop the abilities to understand and use these abstract concepts, such as data structures, in other areas of application.
Cite as

Luis Carlos Martins, Lázaro Vinicius Lima, and Pedro Rangel Henriques. LCSMAR, an AR Based Tool to Inspect Imperative Programs. In 4th International Computer Programming Education Conference (ICPEC 2023). Open Access Series in Informatics (OASIcs), Volume 112, pp. 3:1-3:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{martins_et_al:OASIcs.ICPEC.2023.3,
  author =	{Martins, Luis Carlos and Lima, L\'{a}zaro Vinicius and Henriques, Pedro Rangel},
  title =	{{LCSMAR, an AR Based Tool to Inspect Imperative Programs}},
  booktitle =	{4th International Computer Programming Education Conference (ICPEC 2023)},
  pages =	{3:1--3:9},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-290-7},
  ISSN =	{2190-6807},
  year =	{2023},
  volume =	{112},
  editor =	{Peixoto de Queir\'{o}s, Ricardo Alexandre and Teixeira Pinto, M\'{a}rio Paulo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2023.3},
  URN =		{urn:nbn:de:0030-drops-184994},
  doi =		{10.4230/OASIcs.ICPEC.2023.3},
  annote =	{Keywords: Augmented Reality, Learning Resources, Computer Programming, Computational Thinking}
}
Document
DOI: 10.4230/OASIcs.ICPEC.2022.2
Sprinter: A Didactic Linter for Structured Programming

Authors: Francisco Alfredo, André L. Santos, and Nuno Garrido

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

Abstract
Code linters are tools for detecting improper uses of programming constructs and violations of style issues. Despite that professional linters are available for numerous languages, they are not targeted to introductory programming, given their prescriptive nature that does not take into consideration a didactic viewpoint of learning programming fundamentals. We present Sprinter, a didactic code linter for structured programming supporting Java whose novelty aspects are twofold: (a) providing formative feedback on code with comprehensive explanatory messages (rather then prescriptive); (b) capability of detecting some control-flow issues to a deeper extent than professional linters. We review Sprinter features against popular tools, namely IntelliJ IDEA and Sonarlint.
Cite as

Francisco Alfredo, André L. Santos, and Nuno Garrido. Sprinter: A Didactic Linter for Structured Programming. In Third International Computer Programming Education Conference (ICPEC 2022). Open Access Series in Informatics (OASIcs), Volume 102, pp. 2:1-2:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{alfredo_et_al:OASIcs.ICPEC.2022.2,
  author =	{Alfredo, Francisco and Santos, Andr\'{e} L. and Garrido, Nuno},
  title =	{{Sprinter: A Didactic Linter for Structured Programming}},
  booktitle =	{Third International Computer Programming Education Conference (ICPEC 2022)},
  pages =	{2:1--2: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.2},
  URN =		{urn:nbn:de:0030-drops-166063},
  doi =		{10.4230/OASIcs.ICPEC.2022.2},
  annote =	{Keywords: structured programming, code quality, code linter}
}
Document
DOI: 10.4230/OASIcs.ICPEC.2022.7
Python Programming Topics That Pose a Challenge for Students

Authors: Justyna Szydłowska, Filip Miernik, Marzena Sylwia Ignasiak, and Jakub Swacha

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

Abstract
Learning programming is often considered as difficult, but it would be wrong to assume that all programming topics are equally tough to learn. In this paper, we make use of a gamified programming learning environment submission repository containing records of over 9000 attempts of solving Python exercises to identify topics which pose the largest challenge for students. By comparing students' effort and progress among sets of exercises assigned to respective topics, two topics emerged as especially difficult (Object-oriented programming and Classic algorithms). Also interesting are the identified differences between genders (indicating female students to fare better than male at the initial topics, and the opposite for the most advanced topics), and the scale of effort some students put to succeed with the most difficult exercises (sometimes solved only after tens of failed attempts).
Cite as

Justyna Szydłowska, Filip Miernik, Marzena Sylwia Ignasiak, and Jakub Swacha. Python Programming Topics That Pose a Challenge for Students. In Third International Computer Programming Education Conference (ICPEC 2022). Open Access Series in Informatics (OASIcs), Volume 102, pp. 7:1-7:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{szydlowska_et_al:OASIcs.ICPEC.2022.7,
  author =	{Szyd{\l}owska, Justyna and Miernik, Filip and Ignasiak, Marzena Sylwia and Swacha, Jakub},
  title =	{{Python Programming Topics That Pose a Challenge for Students}},
  booktitle =	{Third International Computer Programming Education Conference (ICPEC 2022)},
  pages =	{7:1--7:9},
  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.7},
  URN =		{urn:nbn:de:0030-drops-166116},
  doi =		{10.4230/OASIcs.ICPEC.2022.7},
  annote =	{Keywords: learning programming, programming exercises, gamified learning environment, learning Python}
}
Document
DOI: 10.4230/LIPIcs.ISAAC.2021.11
Illuminating the x-Axis by α-Floodlights

Authors: Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, and Paweł Żyliński

Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)

Abstract
Given a set S of regions with piece-wise linear boundary and a positive angle α < 90°, we consider the problem of computing the locations and orientations of the minimum number of α-floodlights positioned at points in S which suffice to illuminate the entire x-axis. We show that the problem can be solved in O(n log n) time and O(n) space, where n is the number of vertices of the set S.
Cite as

Bengt J. Nilsson, David Orden, Leonidas Palios, Carlos Seara, and Paweł Żyliński. Illuminating the x-Axis by α-Floodlights. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 11:1-11:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{nilsson_et_al:LIPIcs.ISAAC.2021.11,
  author =	{Nilsson, Bengt J. and Orden, David and Palios, Leonidas and Seara, Carlos and \.{Z}yli\'{n}ski, Pawe{\l}},
  title =	{{Illuminating the x-Axis by \alpha-Floodlights}},
  booktitle =	{32nd International Symposium on Algorithms and Computation (ISAAC 2021)},
  pages =	{11:1--11:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-214-3},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{212},
  editor =	{Ahn, Hee-Kap and Sadakane, Kunihiko},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.11},
  URN =		{urn:nbn:de:0030-drops-154444},
  doi =		{10.4230/LIPIcs.ISAAC.2021.11},
  annote =	{Keywords: Computational Geometry, Visibility, Art Gallery Problems, Floodlights}
}
Document
DOI: 10.4230/LIPIcs.MFCS.2021.42
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances

Authors: Gabriel L. Duarte, Mateus de Oliveira Oliveira, and Uéverton S. Souza

Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)

Abstract
Clique-width and treewidth are two of the most important and useful graph parameters, and several problems can be solved efficiently when restricted to graphs of bounded clique-width or treewidth. Bounded treewidth implies bounded clique-width, but not vice versa. Problems like Longest Cycle, Longest Path, MaxCut, Edge Dominating Set, and Graph Coloring are fixed-parameter tractable when parameterized by the treewidth, but they cannot be solved in FPT time when parameterized by the clique-width unless FPT = W[1], as shown by Fomin, Golovach, Lokshtanov, and Saurabh [SIAM J. Comput. 2010, SIAM J. Comput. 2014]. For a given problem that is fixed-parameter tractable when parameterized by treewidth, but intractable when parameterized by clique-width, there may exist infinite families of instances of bounded clique-width and unbounded treewidth where the problem can be solved efficiently. In this work, we initiate a systematic study of the parameters co-treewidth (the treewidth of the complement of the input graph) and co-degeneracy (the degeneracy of the complement of the input graph). We show that Longest Cycle, Longest Path, and Edge Dominating Set are FPT when parameterized by co-degeneracy. On the other hand, Graph Coloring is para-NP-complete when parameterized by co-degeneracy but FPT when parameterized by the co-treewidth. Concerning MaxCut, we give an FPT algorithm parameterized by co-treewidth, while we leave open the complexity of the problem parameterized by co-degeneracy. Additionally, we show that Precoloring Extension is fixed-parameter tractable when parameterized by co-treewidth, while this problem is known to be W[1]-hard when parameterized by treewidth. These results give evidence that co-treewidth is a useful width parameter for handling dense instances of problems for which an FPT algorithm for clique-width is unlikely to exist. Finally, we develop an algorithmic framework for co-degeneracy based on the notion of Bondy-Chvátal closure.
Cite as

Gabriel L. Duarte, Mateus de Oliveira Oliveira, and Uéverton S. Souza. Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 42:1-42:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{duarte_et_al:LIPIcs.MFCS.2021.42,
  author =	{Duarte, Gabriel L. and de Oliveira Oliveira, Mateus and Souza, U\'{e}verton S.},
  title =	{{Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances}},
  booktitle =	{46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
  pages =	{42:1--42:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-201-3},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{202},
  editor =	{Bonchi, Filippo and Puglisi, Simon J.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.42},
  URN =		{urn:nbn:de:0030-drops-144828},
  doi =		{10.4230/LIPIcs.MFCS.2021.42},
  annote =	{Keywords: FPT, treewidth, degeneracy, complement graph, Bondy-Chv\'{a}tal closure}
}
Document
DOI: 10.4230/DagSemProc.07311.6
CodeVoting: protecting against malicious vote manipulation at the voter's PC

Authors: Rui Joaquim and Carlos Ribeiro

Published in: Dagstuhl Seminar Proceedings, Volume 7311, Frontiers of Electronic Voting (2008)

Abstract
Voting in uncontrolled environments, such as the Internet comes with a price, the price of having to trust in uncontrolled machines the collection of voter's vote. An uncontrolled machine, e.g. the voter's PC, may be infected with a virus or other malicious program that may try to change the voter's vote without her knowledge. Here we present CodeVoting, a technique to create a secure communication channel to a smart card that prevents vote manipulation by the voter's PC, while at the same time allows the use of any cryptographic voting protocol to cast the vote.
Cite as

Rui Joaquim and Carlos Ribeiro. CodeVoting: protecting against malicious vote manipulation at the voter's PC. In Frontiers of Electronic Voting. Dagstuhl Seminar Proceedings, Volume 7311, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{joaquim_et_al:DagSemProc.07311.6,
  author =	{Joaquim, Rui and Ribeiro, Carlos},
  title =	{{CodeVoting: protecting against malicious vote manipulation at the voter's PC}},
  booktitle =	{Frontiers of Electronic Voting},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7311},
  editor =	{David Chaum and Miroslaw Kutylowski and Ronald L. Rivest and Peter Y. A. Ryan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07311.6},
  URN =		{urn:nbn:de:0030-drops-12997},
  doi =		{10.4230/DagSemProc.07311.6},
  annote =	{Keywords: Internet voting, vote manipulation}
}
Document
DOI: 10.4230/DagSemProc.07041.11
Thermal Characterization and Thermal Management in Processor-Based Systems

Authors: José Luis Ayala, Anya Apavatjrut, David Atienza, Marisa López-Vallejo, and Carlos A. López-Barrio

Published in: Dagstuhl Seminar Proceedings, Volume 7041, Power-aware Computing Systems (2007)

Abstract
The register file is one of the hottest devices in processor-based systems. Leakage reduction techniques and DTM mechanisms require a thermal characterization of the hardware. This paper presents a thermal model to analyze the temperature evolution in the shared register files found on VLIW systems. The use of this model allows the analysis of several factors that have an strong impact on the heat transfer. The results obtained can be used in the design of temperature-aware compilers and place&route tools.
Cite as

José Luis Ayala, Anya Apavatjrut, David Atienza, Marisa López-Vallejo, and Carlos A. López-Barrio. Thermal Characterization and Thermal Management in Processor-Based Systems. In Power-aware Computing Systems. Dagstuhl Seminar Proceedings, Volume 7041, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{ayala_et_al:DagSemProc.07041.11,
  author =	{Ayala, Jos\'{e} Luis and Apavatjrut, Anya and Atienza, David and L\'{o}pez-Vallejo, Marisa and L\'{o}pez-Barrio, Carlos A.},
  title =	{{Thermal Characterization and Thermal Management in Processor-Based Systems}},
  booktitle =	{Power-aware Computing Systems},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7041},
  editor =	{Luca Benini and Naehyuck Chang and Ulrich Kremer and Christian W. Probst},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07041.11},
  URN =		{urn:nbn:de:0030-drops-11103},
  doi =		{10.4230/DagSemProc.07041.11},
  annote =	{Keywords: Thermal characterization, thermal model, register file}
}
  • Refine by Author
  • 1 Alfredo, Francisco
  • 1 Apavatjrut, Anya
  • 1 Atienza, David
  • 1 Ayala, José Luis
  • 1 Duarte, Gabriel L.
  • Show More...

  • Refine by Classification
  • 2 Applied computing → Interactive learning environments
  • 1 Applied computing → E-learning
  • 1 Computing methodologies → Mixed / augmented reality
  • 1 Social and professional topics → Computer science education
  • 1 Theory of computation → Computational geometry
  • Show More...

  • Refine by Keyword
  • 1 Art Gallery Problems
  • 1 Augmented Reality
  • 1 Bondy-Chvátal closure
  • 1 Computational Geometry
  • 1 Computational Thinking
  • Show More...

  • Refine by Type
  • 7 document

  • Refine by Publication Year
  • 2 2021
  • 2 2022
  • 1 2007
  • 1 2008
  • 1 2023

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