Programs

• Opera Show
• Google Docs
• Prezi
• W3C Slidy
• rslidy
• S3
• impress.js
• ...
• List of web-based slideshows

Purpose

Create multimedia presentations

• Available to a wide audience
• No "non-standard" software required
• Supports a very wide range of hardware platforms

Powers

• You can do anything you could do on a website
  • HTML 5
  • CSS 3
  • JavaScript
  • ...

• Allows for real version control
• Full control and flexibility of everything the web has to offer
• At the cost of requiring necessary skills

Various features

We can...

• Use bigger and smaller font and navigate the contents
• Show details only if required
  • Use incremental display
  • Additional information
• Provide print stylesheets for handouts
• Include (incremental images) and display videos
• Take advantage of HTML5 features like canvas
• Seamlessly link to external content
• Use the power of scripting languages like PHP or Python
• ...

Mathematical Formulas

• Use Latex syntax for simple mathematical typesetting
  • Parameters

    $N$

    set of customers ($n \in N$)

    $P_0$

    set of parking sites including the depot ($p \in P_0$)

    $M$

    set of customers and parking sites ($m \in M$), $M = N \bigcup P_0$

    $C$

    set of clusters ($c \in C$), $\vert C \vert$ = $\vert N \vert$

    $L$

    set of service workers in any cluster ($l \in L$)

    $Q$

    sufficiently large number to exclude certain combinations of customers, parking sites and service workers

    $wt_{pn}$

    walking time from parking site $p$ to customer $n$

    $\alpha_{pn}$

    earliest starting time of a customer minus $wt_{pn}$

    $\beta_{pn}$

    latest starting time of a customer minus $wt_{pn}$

    $st_{np}$

    service time of customer $n$ plus return time to parking site $p$

    $d_n$

    demand of customer $n$

    $\text{cap}$

    truck capacity

    $\eta \in \{1,0\}$

    parameter controlling emphasis on minimizing the number of clusters versus the makespan

• ... as well as for more complex stuff
  • Decision Variables
    • $x_{cp}=\begin{cases} 1, \text{if cluster }c\text{ uses parking site }p\\ 0, \text{otherwise} \end{cases}$
    • $y_{cpn}=\begin{cases} 1, \text{if customer }n\text{ is in cluster }c\text{ with parking site } p\\ 0, \text{otherwise} \end{cases}$
    • $v_{nn'}^{lc}=\begin{cases} 1, \text{if service worker }l\text{ walks from }n\text{ to }n'\text{ in cluster }c\\ 0, \text{otherwise} \end{cases}$

    $\delta_n$

    actual starting time at a customer $n$ which is a real number with a lower bound of zero

    $\overline{\xi_c}$

    actual finishing time of cluster $c$ (time when a truck leaves) which is a real number with a lower bound of zero

    $\underline{\xi_c}$

    actual starting time of cluster $c$ (time when truck arrives) which is a real number with a lower bound of zero

  • $$ \min z = \eta \sum_{c \in C} (\overline{\xi_c} - \underline{\xi_c}) + (1-\eta) \sum_{c \in C}\sum_{p \in P0}x_{cp} $$

    s.t.

    $$ \overline{\xi_c} - \underline{\xi_c} \geq 0\\ \sum_{p \in P_0} x_{cp} \leq 1, \forall c \in C\\ \sum_{n \in N} y_{cpn} \cdot d_n \leq \text{cap} \cdot x_{cp}, \forall p \in P_0, \forall c \in C\\ \sum_{c \in C}\sum_{p \in P0} y_{cpn} = 1, \forall n \in N\\ y_{cpn} \leq x_{cp}, \forall n \in N, p \in P_0, \forall c \in C\\ x_{cp} \leq \sum_{n \in N} y_{cpn}, \forall p \in P0, \forall c \in C\\ \sum_{l \in L} \sum_{\substack{n' \in M \\ n' \neq n}} v_{nn'}^{lc} \leq \sum_{p \in P_0} y_{cpn}, \forall c \in C, \forall n \in N\\ \sum_{n'' \in M} v_{n''n}^{lc} = \sum_{n' \in M} v_{nn'}^{lc}, \forall n \in N, \forall c \in C, \forall l \in L\\ \sum_{c \in C}\sum_{l \in L}\sum_{\substack{n' \in M \\ n' \neq n}} v_{nn'}^{lc} = 1, \forall n \in N\\ \delta_n \geq \alpha_{pn} \cdot y_{cpn} - Q \cdot (1-y_{cpn}),\forall n \in N, \forall p \in P0, \forall c \in C\\ \delta_n \leq \beta_{pn} \cdot y_{cpn} + Q \cdot (1-y_{cpn}),\forall n \in N, \forall p \in P0, \forall c \in C\\ \delta_n \geq \delta_{n'} + wt_{pn'} + st_{pn'} -Q \cdot (1-v_{n'n}^{lc}) - Q \cdot (1-y_{cpn}), \forall n \in N, \forall p \in P0, \forall l \in L, \forall n' \in M, \forall c \in C\\ \underline{\xi_c} \leq \delta_n + Q \cdot (1-y_{cpn}), \forall n \in N, p \in P_0, \forall c \in C\\ \overline{\xi_c} \geq \delta_n + (wt_{pn} + st_{pn}) \cdot y_{cpn} - Q \cdot (1-y_{cpn}), \forall n \in N, p \in P_0, \forall c \in C\\ $$

External Content

• Using prettify for source code

  def name(arg1, arg2, ..., argN):
      """
      Textual explanation of what the function is supposed to do.
      """
      # calculate result...
      return result
  

• Defining and using a function

• #!/usr/bin/env python3
  
  def interest(capital, rate, years=1):
      """
      Return the total interest of investing `capital` at `rate`.
      """
      value = capital * (1 + rate) ** years
      return value - capital
  
  print(interest(100, 0.03))
  result = interest(100, 0.03, 3)
  profit = interest(1300, 0.025, 5)
  

• Video tutorial

More External Content

• Python Anywhere

• Open Terminal

Data Driven Development (d3 FTW)

Product Demo

• Explain website step by step
• Github System Demo
• Notifications feature
• Pull Requests
• ...

Resources

• Read Dave Raggett's presentation about slidy
• Have a look at this presentation's source
• Check out the video tutorial
• Configure your text editor
• Download a template
• Go wild :)

Acknowledgements

• The W3C, the manufacturers of all decent web browsers and everybody else involved in making the web awesome
• Blender Foundation | www.blender.org for Big Buck BUNNY