diff --git a/01-git/lab.qmd b/01-git/lab.qmd
index 3933608..957bf94 100644
--- a/01-git/lab.qmd
+++ b/01-git/lab.qmd
@@ -35,7 +35,7 @@ To start you just need to use the Fork button available on the project you would
[^githubmanualfork]: For more details, take a look at the [Forking Projects](https://guides.github.com/activities/forking/) article in GitHub guides.
+
+
+
+
](https://commons.wikimedia.org/wiki/File:Git-logo.svg)
+[
](https://commons.wikimedia.org/wiki/File:Git-logo.svg)
::: {.fragment .fade-in}
- Git is used by [most developers in the world](https://insights.stackoverflow.com/survey/2018#work-_-version-control).
diff --git a/02-essentials/slides.qmd b/02-essentials/slides.qmd
index a63de9e..89fa4e9 100644
--- a/02-essentials/slides.qmd
+++ b/02-essentials/slides.qmd
@@ -204,23 +204,23 @@ attributes(HairEyeColor)
* An Integrated Development Environment (IDE) to organize and facilitate common tasks coding in R
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
-
+
---
diff --git a/03-debugging-and-profiling/slides.qmd b/03-debugging-and-profiling/slides.qmd
index 25799c8..4d58014 100644
--- a/03-debugging-and-profiling/slides.qmd
+++ b/03-debugging-and-profiling/slides.qmd
@@ -103,7 +103,7 @@ With debugging start top-down. Assume lower-level functions are correct until f
An example from collaboration:
-
+
An example from an R package: [SeqSGPV](https://github.com/chipmanj/SeqSGPV/blob/master/R/SeqSGPV.R)
diff --git a/04-more-functions-and-datatable/slides.qmd b/04-more-functions-and-datatable/slides.qmd
index d7650e5..debc4d8 100755
--- a/04-more-functions-and-datatable/slides.qmd
+++ b/04-more-functions-and-datatable/slides.qmd
@@ -277,7 +277,7 @@ Before we continue, let's learn a bit more on `data.table` and `dtplyr`
square brackets. Here is common way to imagine DT:
+
-RcppArmadillo + OpenMP
=
+RcppArmadillo + OpenMP
=
+
## Single job
diff --git a/15-autoreport/README.md b/15-autoreport/README.md
index aa153d3..7da9559 100644
--- a/15-autoreport/README.md
+++ b/15-autoreport/README.md
@@ -1,7 +1,6 @@
-
+
# Latest papers on Agent-Based Modeling in PubMed
diff --git a/15-autoreport/slides.qmd b/15-autoreport/slides.qmd
index cd97c2c..f3aaf06 100644
--- a/15-autoreport/slides.qmd
+++ b/15-autoreport/slides.qmd
@@ -47,7 +47,7 @@ The resulting report can be viewed at [https://github.com/UofUEpiBio/PHS-7045-eg
We need to extract the information from [this website](https://pubmed.ncbi.nlm.nih.gov/?term=agent-based+model&sort=date){target="_blank"}:
-{width="70%" fig-align="center"}
+{width="70%" fig-align="center" fig-alt="Screenshot of PubMed search results page showing recent papers about agent-based models"}
::: {.fragment}
Let's start by looking into the Quarto document used to do so. You can download it from [here](https://github.com/UofUEpiBio/PHS-7045-egga){target="_blank"}.
diff --git a/projects/02-langtons-ant/README.md b/projects/02-langtons-ant/README.md
index 82f9a01..9489c5e 100644
--- a/projects/02-langtons-ant/README.md
+++ b/projects/02-langtons-ant/README.md
@@ -24,6 +24,6 @@ directions at each step it takes. The "ant" moves according to the rules below:
Here is an animation of the expected result.
-
+
\ No newline at end of file
diff --git a/projects/04-monopoly-game/README.md b/projects/04-monopoly-game/README.md
index a65003f..534762e 100644
--- a/projects/04-monopoly-game/README.md
+++ b/projects/04-monopoly-game/README.md
@@ -35,7 +35,7 @@ If everything goes as expected, you should be getting something like the followi
plot in which the distribution of the number of times an indivual steps into any
of the 40 locations of the board (excluding chance and community chest).
-
+
The simulation was carried out 50000, each time throwing the die 500 times.
@@ -47,7 +47,7 @@ To create the simulation, use the following description of the board and cards.
## Board
-
+
## Community Chest ([source](http://monopoly.wikia.com/wiki/Community_Chest))
diff --git a/projects/07-rejection/README.md b/projects/07-rejection/README.md
index 5cbe071..0eb1335 100644
--- a/projects/07-rejection/README.md
+++ b/projects/07-rejection/README.md
@@ -26,7 +26,7 @@ For i = 1 to n do:
The following plot shows the result of a simple implementation of the algorithm
(not very computationally efficient)
-
+
The figure on the left shows the distribution of 10,000 points distributed
uniformly distributed in a d=2 ball, and the figure on the right shows the