Presentation Simplex

Embed Size (px)

Citation preview

  • 7/23/2019 Presentation Simplex

    1/24

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 1 / 16

    Sample presentation using BeamerDelft University of Technology

    Maarten Abbink

    April 1, 2014

  • 7/23/2019 Presentation Simplex

    2/24

    Outline

    1 First SectionSection 1 - Subsection 1Section 1 - Subsection 2Section 1 - Subsection 3

    2 Second SectionSection 2 - Subsection 1Section 2 - Last Subsection

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 2 / 16

  • 7/23/2019 Presentation Simplex

    3/24

    Next Subsection

    1 First SectionSection 1 - Subsection 1Section 1 - Subsection 2Section 1 - Subsection 3

    2 Second SectionSection 2 - Subsection 1Section 2 - Last Subsection

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 3 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    4/24

    Section 1 - Subsection 1 - Page 1

    Example

    0 1 2 3 4 5 6 7 8n

    0123

    456u(n)

    u(n) = [3, 1, 4]n

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 4 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    5/24

    Section 1 - Subsection 1 - Page 2

    DefinitionLet n be a discrete variable, i.e. n Z. A 1-dimensional periodicnumber is a function that depends periodically on n.

    u(n) = [u0, u1, . . . , ud1]n =

    u0 ifn 0 (mod d)

    u1 ifn 1 (mod d)...

    ud1 ifn d 1 (mod d)

    d is called the period.

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 5 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    6/24

    Section 1 - Subsection 1 - Page 3

    Example

    f(n) =

    12 , 13nn2 + 3n [1, 2]n

    =

    13 n

    2 + 3n 2 ifn 0 (mod 2)

    12 n2 + 3n 1 ifn 1 (mod 2)

    0 1 2 3 4 5 6 7n

    3

    2

    1

    0

    1

    2

    3

    4

    5

    f(n)=

    1 2

    ,1 3

    n

    n2

    +

    3n

    [1,

    2]n

    1

    2n2 + 3n 1

    1

    3n2 + 3n 2

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 6 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    7/24

    Section 1 - Subsection 1 - Page 4

    Definition

    A polynomial in a variable xis a linear combination of powers ofx:

    f(x) =

    gi=0

    cixi

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 7 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    8/24

    Section 1 - Subsection 1 - Page 4

    Definition

    A polynomial in a variable xis a linear combination of powers ofx:

    f(x) =

    gi=0

    cixi

    DefinitionA quasi-polynomial in a variable x is a polynomial expression withperiodic numbers as coefficients:

    f(n) =

    g

    i=0 u

    i(n)n

    i

    with ui(n) periodic numbers.

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 7 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    9/24

    Next Subsection

    1 First SectionSection 1 - Subsection 1Section 1 - Subsection 2Section 1 - Subsection 3

    2 Second SectionSection 2 - Subsection 1Section 2 - Last Subsection

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 8 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    10/24

    Section 1 - Subsection 2 - Page 1

    Example

    0 1 2 3 4 5 6 7x

    0

    1

    2

    3

    4

    5

    6

    7

    y

    p =3

    x+yp

    p f(p)

    3 5

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 9 / 16

    http://find/http://goback/
  • 7/23/2019 Presentation Simplex

    11/24

    Section 1 - Subsection 2 - Page 1

    Example

    0 1 2 3 4 5 6 7x

    0

    1

    2

    3

    4

    5

    6

    7

    y

    p =4

    x+yp

    p f(p)

    3 54 8

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 9 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    12/24

    Section 1 - Subsection 2 - Page 1

    Example

    0 1 2 3 4 5 6 7x

    0

    1

    2

    3

    4

    5

    6

    7

    y

    p =5

    x+yp

    p f(p)

    3 54 85 10

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 9 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    13/24

    Section 1 - Subsection 2 - Page 1

    Example

    0 1 2 3 4 5 6 7x

    0

    1

    2

    3

    4

    5

    6

    7

    y

    p =6

    x+yp

    p f(p)

    3 54 85 106 13

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 9 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    14/24

    Section 1 - Subsection 2 - Page 1

    Example

    0 1 2 3 4 5 6 7x

    0

    1

    2

    3

    4

    5

    6

    7

    y

    p =6

    x+yp

    p f(p)

    3 54 85 106 13

    5

    2p+

    2,

    5

    2

    p

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 9 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    15/24

    Section 1 - Subsection 2 - Page 2

    The number of integer points in a parametric polytope Pp ofdimension n is expressed as a piecewise a quasi-polynomial ofdegree n in p(Clauss and Loechner).

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 10 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    16/24

    Section 1 - Subsection 2 - Page 2

    The number of integer points in a parametric polytope Pp ofdimension n is expressed as a piecewise a quasi-polynomial ofdegree n in p(Clauss and Loechner).

    More generalpolyhedral counting problems:

    Systems of linear inequalities combined with ,,,,or (Presburger formulas).

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 10 / 16

    http://find/
  • 7/23/2019 Presentation Simplex

    17/24

    Section 1 - Subsection 2 - Page 2

    The number of integer points in a parametric polytope Pp ofdimension n is expressed as a piecewise a quasi-polynomial ofdegree n in p(Clauss and Loechner).

    More generalpolyhedral counting problems:

    Systems of linear inequalities combined with ,,,,or (Presburger formulas).

    Many problems instatic program analysiscan be expressed aspolyhedral counting problems.

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 10 / 16

    S

    http://find/
  • 7/23/2019 Presentation Simplex

    18/24

    Next Subsection

    1 First SectionSection 1 - Subsection 1Section 1 - Subsection 2Section 1 - Subsection 3

    2 Second SectionSection 2 - Subsection 1Section 2 - Last Subsection

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 11 / 16

    S i 1 S b i 3 P 1

    http://find/
  • 7/23/2019 Presentation Simplex

    19/24

    Section 1 - Subsection 3 - Page 1A picture made with the package TiKz

    Example

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 12 / 16

    N t S b ti

    http://find/
  • 7/23/2019 Presentation Simplex

    20/24

    Next Subsection

    1 First SectionSection 1 - Subsection 1Section 1 - Subsection 2Section 1 - Subsection 3

    2 Second SectionSection 2 - Subsection 1Section 2 - Last Subsection

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 13 / 16

    S ti 2 b ti 1 1

    http://find/
  • 7/23/2019 Presentation Simplex

    21/24

    Section 2 - subsection 1 - page 1

    AlertblockThis page gives an example with numbered bullets (enumerate)in an Example window:

    Example

    Discrete domain evaluate in each pointNot possible for

    1 parametric domains

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 14 / 16

    S ti 2 b ti 1 1

    http://find/http://goback/
  • 7/23/2019 Presentation Simplex

    22/24

    Section 2 - subsection 1 - page 1

    AlertblockThis page gives an example with numbered bullets (enumerate)in an Example window:

    Example

    Discrete domain evaluate in each pointNot possible for

    1 parametric domains

    2 large domains (NP-complete)

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 14 / 16

    Ne t S b e ti

    http://find/
  • 7/23/2019 Presentation Simplex

    23/24

    Next Subsection

    1 First SectionSection 1 - Subsection 1Section 1 - Subsection 2Section 1 - Subsection 3

    2 Second SectionSection 2 - Subsection 1Section 2 - Last Subsection

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 15 / 16

    Last Page

    http://find/
  • 7/23/2019 Presentation Simplex

    24/24

    Last Page

    Summary

    End of the beamer demowith a tidyTU Delft lay-out.

    Thank you!

    Maarten Abbink (TU Delft) Beamer Sample April 1, 2014 16 / 16

    http://find/