SlideShare a Scribd company logo
1 of 122
RECURRENCE RELATIONS
       RECURRENCE RELATIONS
     RECURRENCE RELATIONS
   RECURRENCE RELATIONS
RECURRENCE RELATIONS
Keaton Brandt      2010 MST Gateway Project
What are Recurrence Relations?
• Functions   that Include Themselves
What are Recurrence Relations?
• Functions   that Include Themselves

                       f(n)=f(n-1)+2
What are Recurrence Relations?
• Functions   that Include Themselves

                       f(n)=f(n-1)+2
                           n            f(n)
                           0             1
                           1             3
                           2             5
                           3             7
                           4             9
                           5            11
                           6            13
What are Recurrence Relations?
• Functions   that Include Themselves

                       f(n)=f(n-1)+2
                           n            f(n)
                           0             1     Starting Point
                           1             3
                           2             5
                           3             7
                           4             9
                           5            11
                           6            13
What are Recurrence Relations?
• Functions   that Include Themselves

                       f(n)=f(n-1)+2
                           n            f(n)
                           0             1     Starting Point
                           1             3     Starting Point + 2
                           2             5
                           3             7
                           4             9
                           5            11
                           6            13
What are Recurrence Relations?
• Functions   that Include Themselves

                       f(n)=f(n-1)+2
                           n            f(n)
                           0             1     Starting Point
                           1             3     Starting Point + 2
                           2             5     (Starting Point + 2) + 2
                           3             7
                           4             9
                           5            11
                           6            13
What are Recurrence Relations?
• Functions   that Include Themselves

                       f(n)=f(n-1)+2
                           n            f(n)
                           0             1     f(0)
                           1             3     f(1-1)+ 2
                           2             5     f(2-1) + 2
                           3             7
                           4             9
                           5            11
                           6            13
What are Recurrence Relations?
• Functions   that Include Themselves

                 f(n)=7f(n-1)-12f(n-2)
                           n            f(n)
                           0             2
                           1             7
                           2             25
                           3             91
                           4            337
                           5            1267
                           6            4825
What are Recurrence Relations?
• Functions   that Include Themselves

                 f(n)=7f(n-1)-12f(n-2)
                           n            f(n)
                           0             2     Starting Point 1
                           1             7     Starting Point 2
                           2             25
                           3             91
                           4            337
                           5            1267
                           6            4825
What are Recurrence Relations?
• Functions   that Include Themselves

                 f(n)=7f(n-1)-12f(n-2)
                           n            f(n)
                           0             2     Starting Point 1
                           1             7     Starting Point 2
                           2             25    7(7)-12(2)
                           3             91
                           4            337
                           5            1267
                           6            4825
Closed Forms
  Closed Forms of Recursive Equations produce
the same values, but do not reference themselves.
Finding Closed Forms
        This is where it gets hard.
A Simple Example

b(n) =   {   1
             b(n-1)*2
                        if n = 0
                        if n > 0
A Simple Example

  b(n) =   {   1
               b(n-1)*2
                          if n = 0
                          if n > 0



1,2,4,8,16,32,64,128
A Simple Example

b(n) =      {   1
                b(n-1)*2
                                   if n = 0
                                   if n > 0


 150




112.5




  75




37.5




   0
        0   1    2   3     4   5      6   7
A Simple Example

b(n) =      {   1
                b(n-1)*2
                                   if n = 0
                                   if n > 0


 150




112.5




  75
                 Exponential
37.5




   0
        0   1    2   3     4   5      6   7
A Simple Example

b(n) =   {   1
             b(n-1)*2
                            if n = 0
                            if n > 0



              Exponential


         f(n) =         abn
A Simple Example



f(n) = f(n-1) * 2
A Simple Example



f(n) = 2 f(n-1)
A Simple Example


            n-1
 f(n) = 2
A Simple Example


             n-1
f(n) = a 2
A Simple Example


                   n-1
f(n) = a 2
     Exponential

   f(n) =    abn
A Simple Example


             n-1
f(n) = a 2

   What is a?
A Simple Example

             n-1
f(n) = a 2
A Simple Example

            n-1
f(n) = a 2
  f(0) = 1
A Simple Example

            n-1
f(n) = a 2
  f(0) = 1
  1 = a2 0-1
A Simple Example

  1=   a2 0-1
A Simple Example

  1=   a2 0-1

  1 = a2 -1
A Simple Example

  1=   a2 0-1

  1 = a2 -1

  1 = a*.5
A Simple Example

  1=   a2 0-1

   1 = a2 -1

   1 = a*.5
  .5 .5
A Simple Example

   1 = a*.5
  .5 .5
A Simple Example

   1 = a*.5
  .5 .5
    2=a
A Simple Example

   1 = a*.5
  .5 .5
    2=a
    a=2
A Simple Example



b(n) =   2*2n-1
A Simple Example

b(n) =   2*2n-1


  b(n) =   2n
A Simple Example

    b(n) =   2n


1,2,4,8,16,32,64,128
A Harder Example

b(n) =   {   2
             5
             5b(n-1)+-6b(n-2)
                                if n = 0
                                if n = 1
                                if n > 1
A Harder Example

b(n) =   {   2
             5
             5b(n-1)+-6b(n-2)
                                if n = 0
                                if n = 1
                                if n > 1



2,5,13,35,97,275,793
A Harder Example

b(n) =   {   2
             5
             5b(n-1)+-6b(n-2)
                                     if n = 0
                                     if n = 1
                                     if n > 1


         Exponential + Exponential


     f(n) =        abn+         cdn
A Harder Example



b(n ) = 5b(n-1)+-6b(n-2)
A Harder Example



b n=   5bn-1 -   6bn-2

bn-2   bn-2      bn-2
A Harder Example



 b 2=   5b1-6
A Harder Example



0 = 1b 2+-5b +6

    a      b       c
A Harder Example


 -b ±   √(b2-4(
                  a*c ))
         2a
A Harder Example


  5 ± √(25-4(1 *6 ))
        2 *1
A Harder Example


   5 ± √(25-24)
        2
A Harder Example


    5±√1
     2
A Harder Example


    5±1
     2
A Harder Example
      5±1
       2
  6         4
       &
  2         2
A Harder Example
     5±1
      2

Roots: (3,2)
A Harder Example



b(n) =   a*3n+   c*2 n
A Harder Example
b(n) =   a*3n+   c*2 n
A Harder Example
b(n) =   a*3n+   c*2 n


 2=   a*3 0+   c*2 0
A Harder Example
b(n) =   a*3n+   c*2 n


 2=   a*3 0+   c*2 0


    2 = a+ c
A Harder Example
  2 = a+ c

5=   a*3 1+   c*2 1
A Harder Example
  2 = a+ c

5=   a*3 1+   c*2 1


 5 = 3a + 2c
A Harder Example
 5 = 3a + 2c
  2 = a+ c
A Harder Example
 5 = 3a + 2c
  2 = a+ c
   *3   *3   *3
A Harder Example
 5 = 3a + 2c
  2 = a+ c
   *3   *3   *3


6 = 3a + 3c
A Harder Example
5 = 3a + 2c
6 = 3a + 3c
A Harder Example
5 = 3a + 2c
6 = 3a + 3c

1 = 0a + 1c
A Harder Example

   1 = 1c
A Harder Example

   1 = 1c

    c=1
A Harder Example
   c=1
  a+c=2
      -c   -c
A Harder Example
   c=1
  a+c=2
      -c   -c

  a=2-c
A Harder Example
   c=1
  a+c=2
      -c   -c
A Harder Example
   c=1
  a+c=2
      -c   -c

  a=2-1
A Harder Example
    c=1
A Harder Example
    c=1
    a=1
A Harder Example

a=1      c=1
b=3      d=2
A Harder Example

  a=1      c=1
 b=3       d=2

b(n) =   1*3n   +   1*2 n
A Harder Example


b(n) =   1*3 n   +   1*2 n
A Harder Example


b(n) =   1*3 n   +   1*2 n


2,5,13,35,97,275,793
The Fibonacci Sequence
    f(n)=f(n-1)+f(n-2)
     Starting Points: (0,1)
The Fibonacci Sequence
       f(n)=f(n-1)+f(n-2)
        Starting Points: (0,1)




0,1,1,2,3,5,8,13,21,34,55
The Fibonacci Sequence
1,1,2,3,5,8,13,21,34,55
The Fibonacci Sequence
1,1,2,3,5,8,13,21,34,55
An Aside
The golden ratio
The golden ratio

        1+
  ϕ=
         2
The fibonacci solution
                1+
    ϕ=
                 2
            n         n
           ϕ -(1-ϕ)
  F(n) =
The fibonacci solution
          n         n
         ϕ -(1-ϕ)
  F(n) =
           √(5
The fibonacci solution
            n         n
           ϕ -(1-ϕ)
    F(n) =
             √(5


0,1,1,2,3,5,8,13,21,34,55
Φ = 1.6180339887498
The Golden Ratio

       13


                   8
The Golden Ratio
   13/ 8 = 1.625
ϕ = 1.6180339887498
Calculating Loans
Calculating Loans
  The Total Cost, and monthly payments, of a
loan can calculated with a recurrence relation.
EXAMPLE
EXAMPLE

•A   car costs $10,000
EXAMPLE

•A   car costs $10,000

• The   buyer can pay a $1000 down payment
EXAMPLE

•A   car costs $10,000

• The   buyer can pay a $1000 down payment

• The   buyer can then pay $350 per month
EXAMPLE

•A   car costs $10,000

• The   buyer can pay a $1000 down payment

• The   buyer can then pay $350 per month

• The   yearly interest rate on the loan is 5%
EXAMPLE

•A   car costs $10,000

• The   buyer can pay a $1000 down payment

• The   buyer can then pay $350 per month

• The   yearly interest rate on the loan is 5%

• The   seller wants the loan paid off in 24 months
Remaining debt per month
     n = The number of months since the start of the loan
                  m = The monthly payment
             i = The yearly interest rate (decimal)




b(n,m,i) =   {   9000
                 (1+(i/12))*b(n-1,m,i)-m
                                                 if n = 0
                                                 if n > 0
Remaining debt per month
 n = The number of months since the start of the loan




b(n) =   {   9000                    if n = 0
             (1+(.05/12))*b(n-1)-350 if n > 0
Remaining debt per month
b(n) =   {    9000                    if n = 0
              (1+(.05/12))*b(n-1)-350 if n > 0

n          b(n)       n      b(n)     n      b(n)
 0       9,000.00    11    5,489.98   22   1,815.70
 1       8,687.50    12    5,162.86
                                      23   1,473.27
 2       8,373.70    13    4,834.37
                                      24   1,129.40
 3       8,058.59    14    4,504.51
                                      25   784.11
 4       7,742.17    15    4,173.28
                                      26   437.38
 5       7,424.42    16    3,840.67
 6       7,105.36    17    3,506.67   27    89.20
 7       6,784.97    18    3,171.28   28   -260.43
 8       6,463.24    19    2,834.50
 9       6,140.17    20    2,496.31
10       5,815.75    21    2,156.71
Remaining debt per month
Remaining debt per month
             It takes 28 months to pay off the loan

           The seller wants it payed off in 24 months

The total cost, down payment, and interest rate can’t be changed

           The monthly payment must be increased
How much greater?
How much greater?
  Need to Solve the Equation for m (Monthly Payment)



b(n,m,i) =   {   9000
                 (1+(i/12))*b(n-1,m,i)-m
                                           if n = 0
                                           if n > 0
Remaining debt per month
 n = The number of months since the start of the loan




b(n) =   {   9000                     if n = 0
             (1+(.05/12)) *b(n-1)-350 if n > 0
Remaining debt per month
 n = The number of months since the start of the loan



b(n) =   {   9000                    if n = 0
             (1+(.05/12))*b(n-1)-350 if n > 0
                  a                    c



                      Formula

                                    c-(1-a n)
  b(n) =          x*a n-1       -
                                        a-1
Remaining debt per month
     n = The number of months since the start of the loan




                                      350-(1-(1+(.05/12))n)
b(n) = x * (1+(.05/12))n-1 -
                                               .05/12
Remaining debt per month
      n = The number of months since the start of the loan




                                       350-(1-(1+(.05/12))0)
9000 = x * (1+(.05/12))0-1 -
                                                .05/12
Remaining debt per month
 n = The number of months since the start of the loan




                                           350-(1-1)
9000 = x * 1/(1+(.05/12)) -
                                            .05/12
Remaining debt per month
 n = The number of months since the start of the loan




     9000 = x * 0.99585 - 84000
     +84000                +84000
Remaining debt per month
 n = The number of months since the start of the loan




          93000 = x * 0.99585
         0.99585 0.99585
Remaining debt per month
 n = The number of months since the start of the loan




                93387 = x
Remaining debt per month
    n = The number of months since the start of the loan




                                   350-(1-(1+(.05/12))n)
bn = 93387 * (1+(.05/12))n-1 -
                                            .05/12
Remaining debt per month
    n = The number of months since the start of the loan




                                     m-(1-(1+(.05/12))24)
0 = 93387 * (1+(.05/12))24-1 -
                                            .05/12
Remaining debt per month
 n = The number of months since the start of the loan




                                      m+0.104941
 0 = 93387 * 1.100357 -
                                         .05/12
Remaining debt per month
 n = The number of months since the start of the loan




 0 = 102374.419 - (1/(.05/12))(m+0.104941)
Remaining debt per month
    n = The number of months since the start of the loan




102374.419 = (1/(.05/12))(m+0.104941)
 /(1/(.05/12))                    /(1/(.05/12))
Remaining debt per month
 n = The number of months since the start of the loan




        406.56 = (m+0.104941)
           -0.104941            -0.104941
Remaining debt per month
 n = The number of months since the start of the loan




              404.46 = m
Remaining debt per month
b(n) =   {   9000                       if n = 0
             (1+(.05/12))*b(n-1)-404.56 if n > 0

   n           b(n)     n      b(n)     n      b(n)
   0         9,000.00   11   4,854.70   22    515.39
   1         8,630.94   12   4,468.37
                                        23    110.98
   2         8,260.34   13   4,080.43
                                        24   -295.12
   3         7,888.20   14   3,690.87
                                        25   -702.91
   4         7,514.51   15   3,299.69
                                        26   -1,112.40
   5         7,139.26   16   2,906.88
   6         6,762.45   17   2,512.43   27   -1,523.59
   7         6,384.06   18   2,116.34   28   -1,936.50
   8         6,004.10   19   1,718.59
   9         5,622.56   20   1,319.19
   10        5,239.43   21   918.13
Loan Conclusion
The buyer will have to pay somewhere around $406.46 per
        month in order to pay of his loan in time.
Recurrence Relations Conclusion
 Any function that references itself.

 A common example is the fibonacci sequence.

 Can be solved for a non self-referential ‘closed form’

 Can be used to calculate loan payment schedules
RECURRENCE RELATIONS
     RECURRENCE RELATIONS
   RECURRENCE RELATIONS
 RECURRENCE RELATIONS
RECURRENCE RELATIONS
Keaton Brandt   2010 MST Gateway Project

More Related Content

What's hot

Discrete-Chapter 02 Functions and Sequences
Discrete-Chapter 02 Functions and SequencesDiscrete-Chapter 02 Functions and Sequences
Discrete-Chapter 02 Functions and Sequences
Wongyos Keardsri
 
Gwt presen alsip-20111201
Gwt presen alsip-20111201Gwt presen alsip-20111201
Gwt presen alsip-20111201
Yasuo Tabei
 
Algebra 1 chapter 2 notes
Algebra 1 chapter 2 notesAlgebra 1 chapter 2 notes
Algebra 1 chapter 2 notes
hhennigan
 
Chapter 1 functions
Chapter 1  functionsChapter 1  functions
Chapter 1 functions
Umair Pearl
 
F4 Answer Maths Ppsmi 2007 P2
F4 Answer Maths Ppsmi 2007 P2F4 Answer Maths Ppsmi 2007 P2
F4 Answer Maths Ppsmi 2007 P2
norainisaser
 
Concept map function
Concept map functionConcept map function
Concept map function
zabidah awang
 
04 structured prediction and energy minimization part 1
04 structured prediction and energy minimization part 104 structured prediction and energy minimization part 1
04 structured prediction and energy minimization part 1
zukun
 

What's hot (20)

Discrete-Chapter 02 Functions and Sequences
Discrete-Chapter 02 Functions and SequencesDiscrete-Chapter 02 Functions and Sequences
Discrete-Chapter 02 Functions and Sequences
 
Lectures4 8
Lectures4 8Lectures4 8
Lectures4 8
 
Gwt presen alsip-20111201
Gwt presen alsip-20111201Gwt presen alsip-20111201
Gwt presen alsip-20111201
 
Algebra 1 chapter 2 notes
Algebra 1 chapter 2 notesAlgebra 1 chapter 2 notes
Algebra 1 chapter 2 notes
 
Chapter 1 functions
Chapter 1  functionsChapter 1  functions
Chapter 1 functions
 
F4 Answer Maths Ppsmi 2007 P2
F4 Answer Maths Ppsmi 2007 P2F4 Answer Maths Ppsmi 2007 P2
F4 Answer Maths Ppsmi 2007 P2
 
Concept map function
Concept map functionConcept map function
Concept map function
 
04 structured prediction and energy minimization part 1
04 structured prediction and energy minimization part 104 structured prediction and energy minimization part 1
04 structured prediction and energy minimization part 1
 
Matrix Inverse, IMT
Matrix Inverse, IMTMatrix Inverse, IMT
Matrix Inverse, IMT
 
Gwt sdm public
Gwt sdm publicGwt sdm public
Gwt sdm public
 
2003 Ames.Models
2003 Ames.Models2003 Ames.Models
2003 Ames.Models
 
Session 20
Session 20Session 20
Session 20
 
Conditional neural processes
Conditional neural processesConditional neural processes
Conditional neural processes
 
Chapter 5 (maths 3)
Chapter 5 (maths 3)Chapter 5 (maths 3)
Chapter 5 (maths 3)
 
Funcion gamma
Funcion gammaFuncion gamma
Funcion gamma
 
Complex Eigenvalues
Complex EigenvaluesComplex Eigenvalues
Complex Eigenvalues
 
A new class of a stable implicit schemes for treatment of stiff
A new class of a stable implicit schemes for treatment of stiffA new class of a stable implicit schemes for treatment of stiff
A new class of a stable implicit schemes for treatment of stiff
 
09 trial johor_s2
09 trial johor_s209 trial johor_s2
09 trial johor_s2
 
10.1.1.115.1297
10.1.1.115.129710.1.1.115.1297
10.1.1.115.1297
 
Add Maths 2
Add Maths 2Add Maths 2
Add Maths 2
 

Viewers also liked (12)

Operator overloading
Operator overloadingOperator overloading
Operator overloading
 
Trees and graphs
Trees and graphsTrees and graphs
Trees and graphs
 
recurence solutions
recurence solutionsrecurence solutions
recurence solutions
 
recurrence relations
 recurrence relations recurrence relations
recurrence relations
 
Pigeon hole principle
Pigeon hole principlePigeon hole principle
Pigeon hole principle
 
Computer graphics basic transformation
Computer graphics basic transformationComputer graphics basic transformation
Computer graphics basic transformation
 
Operator overloading in C++
Operator overloading in C++Operator overloading in C++
Operator overloading in C++
 
Relations digraphs
Relations  digraphsRelations  digraphs
Relations digraphs
 
Operator Overloading
Operator OverloadingOperator Overloading
Operator Overloading
 
SET THEORY
SET THEORYSET THEORY
SET THEORY
 
Logic Ppt
Logic PptLogic Ppt
Logic Ppt
 
Memory management
Memory managementMemory management
Memory management
 

Similar to Presentation 3 (15)

CPSC 125 Ch 2 Sec 5
CPSC 125 Ch 2 Sec 5CPSC 125 Ch 2 Sec 5
CPSC 125 Ch 2 Sec 5
 
Recursion
RecursionRecursion
Recursion
 
Dsp lecture vol 2 dft & fft
Dsp lecture vol 2 dft & fftDsp lecture vol 2 dft & fft
Dsp lecture vol 2 dft & fft
 
Chapter 10
Chapter 10Chapter 10
Chapter 10
 
Dr hasany 2467_16649_1_lec-2-zabist
Dr hasany 2467_16649_1_lec-2-zabistDr hasany 2467_16649_1_lec-2-zabist
Dr hasany 2467_16649_1_lec-2-zabist
 
Statistical controls for qc
Statistical controls for qcStatistical controls for qc
Statistical controls for qc
 
Statistical Tools for the Quality Control Laboratory and Validation Studies
Statistical Tools for the Quality Control Laboratory and Validation StudiesStatistical Tools for the Quality Control Laboratory and Validation Studies
Statistical Tools for the Quality Control Laboratory and Validation Studies
 
Number theory lecture (part 1)
Number theory lecture (part 1)Number theory lecture (part 1)
Number theory lecture (part 1)
 
One way to see higher dimensional surface
One way to see higher dimensional surfaceOne way to see higher dimensional surface
One way to see higher dimensional surface
 
Den5200 ps1
Den5200 ps1Den5200 ps1
Den5200 ps1
 
CPSC 125 Ch 2 Sec 4
CPSC 125 Ch 2 Sec 4CPSC 125 Ch 2 Sec 4
CPSC 125 Ch 2 Sec 4
 
Mth3101 Advanced Calculus Chapter 2
Mth3101 Advanced Calculus Chapter 2Mth3101 Advanced Calculus Chapter 2
Mth3101 Advanced Calculus Chapter 2
 
Sect3 5
Sect3 5Sect3 5
Sect3 5
 
Fibonacci fast doubling : ARM assembly 實作
Fibonacci fast doubling : ARM assembly 實作Fibonacci fast doubling : ARM assembly 實作
Fibonacci fast doubling : ARM assembly 實作
 
Sienna 3 bruteforce
Sienna 3 bruteforceSienna 3 bruteforce
Sienna 3 bruteforce
 

Recently uploaded

Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers:  A Deep Dive into Serverless Spatial Data and FMECloud Frontiers:  A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Safe Software
 
Architecting Cloud Native Applications
Architecting Cloud Native ApplicationsArchitecting Cloud Native Applications
Architecting Cloud Native Applications
WSO2
 
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
?#DUbAI#??##{{(☎️+971_581248768%)**%*]'#abortion pills for sale in dubai@
 

Recently uploaded (20)

TrustArc Webinar - Unlock the Power of AI-Driven Data Discovery
TrustArc Webinar - Unlock the Power of AI-Driven Data DiscoveryTrustArc Webinar - Unlock the Power of AI-Driven Data Discovery
TrustArc Webinar - Unlock the Power of AI-Driven Data Discovery
 
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
 
Exploring the Future Potential of AI-Enabled Smartphone Processors
Exploring the Future Potential of AI-Enabled Smartphone ProcessorsExploring the Future Potential of AI-Enabled Smartphone Processors
Exploring the Future Potential of AI-Enabled Smartphone Processors
 
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
Apidays Singapore 2024 - Building Digital Trust in a Digital Economy by Veron...
 
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot TakeoffStrategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
 
MS Copilot expands with MS Graph connectors
MS Copilot expands with MS Graph connectorsMS Copilot expands with MS Graph connectors
MS Copilot expands with MS Graph connectors
 
Navi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot Model
Navi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot ModelNavi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot Model
Navi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot Model
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
 
Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...
 
Manulife - Insurer Transformation Award 2024
Manulife - Insurer Transformation Award 2024Manulife - Insurer Transformation Award 2024
Manulife - Insurer Transformation Award 2024
 
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024
 
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers:  A Deep Dive into Serverless Spatial Data and FMECloud Frontiers:  A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
 
Architecting Cloud Native Applications
Architecting Cloud Native ApplicationsArchitecting Cloud Native Applications
Architecting Cloud Native Applications
 
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost SavingRepurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
 
Real Time Object Detection Using Open CV
Real Time Object Detection Using Open CVReal Time Object Detection Using Open CV
Real Time Object Detection Using Open CV
 
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
 
"I see eyes in my soup": How Delivery Hero implemented the safety system for ...
"I see eyes in my soup": How Delivery Hero implemented the safety system for ..."I see eyes in my soup": How Delivery Hero implemented the safety system for ...
"I see eyes in my soup": How Delivery Hero implemented the safety system for ...
 
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin WoodPolkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
 
Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)Powerful Google developer tools for immediate impact! (2023-24 C)
Powerful Google developer tools for immediate impact! (2023-24 C)
 
Artificial Intelligence Chap.5 : Uncertainty
Artificial Intelligence Chap.5 : UncertaintyArtificial Intelligence Chap.5 : Uncertainty
Artificial Intelligence Chap.5 : Uncertainty
 

Presentation 3