Physics and Python stuff. Most of the videos here are either adapted from class lectures or solving physics problems. I really like to use numerical calculations without all the fancy programming ...

Learn how to use a priority queue to implement Dijkstra's algorithm in Python, and find the shortest path in a weighted graph in an efficient and elegant way.

CircularDict is a high-performance Python data structure that blends the functionality of dictionaries and circular buffers. Inheriting the usage of traditional dictionaries, it allows you to define ...

Hardware queues are import in many applications, such as data transfer, synchronization of concurrent modules with the need of mutual exclusion constructs. State of the art bounded (of a fixed size) ...

An intelligent data acquisition algorithm based on time slot and circular queue is brought forward, which is achieved in identity recognition and auto-weight with nobody on duty. It utilizes the timer ...

Multi-sources data acquisition under unattended condition is a representative problem in data acquisition. An intelligent data acquisition algorithm based on time slot and circular queue is brought ...