Concurrency control algorithms
Dekker's algorithm is the first known correct solution to the mutual exclusion problem in concurrent programming where processes only communicate via shared memory. The solution is attributed to Dutch mathematician Th. J. Dekker by Edsger W. Dijkstra in an unpublished paper on sequential process descriptions and his manuscript on cooperating sequential processes. It allows two threads to share a single-use resource without conflict, using only shared memory for communication. It avoids the strict alternation of a naïve turn-taking algorithm, and was one of the first mutual exclusion algorithms to be invented. (Wikipedia).
Race Conditions and How to Prevent Them - A Look at Dekker's Algorithm
When two programs both need access to some shared data, how do we ensure that they don’t try to manipulate the data at the same time? This is the mutual exclusion problem, and it’s often solved with hardware. But even without any special hardware, Dekker’s Algorithm offers a way to ensure
From playlist Spanning Tree Favorites
Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm
This is the fourth in a series of computer science videos about the graph data structure. This is an explanation of Dijkstra’s algorithm for finding the shortest path between one vertex in a graph and another. Indeed, this explains how Dijkstra’s shortest path algorithm generates a set o
From playlist Path Finding Algorithms
Dijkstra Algorithm Explained | Network Routing Using Dijkstra’s Algorithm | Simplilearn
In this video on 'What Is Dijkstra's Algorithm?', we will look into the working and the functioning of Dijkstra's algorithm, which works on the principle of the greedy algorithm. This algorithm was designed to deduce the shortest path from the primary node to the target node and design the
From playlist Networking
Dekker's Method, Inverse Quadratic Interpolation, and Brent's Method including example, code, and discussion of order. GitHub https://github.com/osveliz/numerical-veliz Chapters 00:00 Intro 00:12 Secant Method Recap 00:37 Bisection Method Recap 00:54 Dekker's Method History 01:35 Dekker's
From playlist Root Finding
Code for Dijkstra - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
Graph Data Structure 5. Dijkstra’s Shortest Path Implementation in VB.NET
This is the fifth in a series of videos about the graph data structure. It explains how Dijkstra’s shortest path algorithm can be implemented for a weighted graph in VB.NET. This particular implementation involves coding up a Dijkstra class, whose constructor is passed a graph’s adjacenc
From playlist Path Finding Algorithms
Graph Theory: Dijkstra's Algorithm
This lesson explains how to apply Dijkstra's algorithm to find the shortest path from one vertex to another using a graph. Site: http://mathispower4u.com
From playlist Graph Theory
Hybrid minimization algorithm combining Golden-section Search and Successive Parabolic Interpolation (Jarratt's Method) that is guaranteed to locate minima with superlinear convergence order. Example code https://github.com/osveliz/numerical-veliz Chapters: 0:00 Intro 0:16 Scaffolding 0:3
From playlist Numerical Methods
How Accessibility Tools (Subs, Audio Descriptions) Help Computers "See" & Answer Questions [Lecture]
This is a single lecture from a course. If you you like the material and want more context (e.g., the lectures that came before), check out the whole course: https://boydgraber.org/teaching/CMSC_848/ (Including homeworks and reading.) Music: https://soundcloud.com/alvin-grissom-ii/review
From playlist Computational Linguistics I
Dijkstra's Shortest Path Algorithm - Intro to Algorithms
This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.
From playlist Introduction to Algorithms
The Vandermonde Matrix and Polynomial Interpolation
The Vandermonde matrix is a used in the calculation of interpolating polynomials but is more often encountered in the proof that such polynomial interpolates exist. It is also often encountered in the study of determinants since it has a really nice determinant formula. Chapters 0:00 - In
From playlist Interpolation
Supersymmetric lattice models by Kareljan Schoutens
PROGRAM: INTEGRABLE SYSTEMS IN MATHEMATICS, CONDENSED MATTER AND STATISTICAL PHYSICS ORGANIZERS: Alexander Abanov, Rukmini Dey, Fabian Essler, Manas Kulkarni, Joel Moore, Vishal Vasan and Paul Wiegmann DATE : 16 July 2018 to 10 August 2018 VENUE: Ramanujan Lecture Hall, ICTS Bangalore
From playlist Integrable systems in Mathematics, Condensed Matter and Statistical Physics
Generalized Bisection Method for Systems of Nonlinear Equations
Generalization of the Bisection Method for solving systems of equations. This lesson explains the algorithm for a 2 dimension example based on Harvey-Stenger's approach using bisecting triangles. It includes a visualization of the method in action on an example nonlinear system. Other meth
From playlist Solving Systems of Nonlinear Equations
A 16-Year-Old Girl’s Solo Sail Around the World | Short Film Showcase
When 14-year-old Laura Dekker set out in 2012 to become the youngest person to single-handedly circumnavigate the globe, filmmaker Jillian Schlesinger documented the remarkable 518-day journey. In this excerpt from the full-length documentary Maidentrip, Dekker follows the route her parent
From playlist Science and Exploration | National Geographic
Web application security: 10 things developers need to know
Security is an important topic for developers however security is often an afterthought in a project. This presentation will focus on practices which developers need to be aware of, and make security fun again. This is an in depth talk about 10 topics, not an overview for security best pra
From playlist Talks
Newton Bisection Hybrid (Newt-Safe)
Newton Bisection Hybrid Method for root finding. Example code available at https://www.github.com/osveliz/numerical-veliz Chapters 0:00 Intro 0:26 Viewer Request 0:49 Numerical Recipes 1:12 Numerical Methods That Work 1:54 Motivation Examples 3:04 Problems with Newton Recap 3:17 Newt-Safe
From playlist Root Finding
Understanding and computing the Riemann zeta function
In this video I explain Riemann's zeta function and the Riemann hypothesis. I also implement and algorithm to compute the return values - here's the Python script:https://gist.github.com/Nikolaj-K/996dba1ff1045d767b10d4d07b1b032f
From playlist Programming