Practical internet development experience, tech sharing, knowledge consolidation, and forward-thinking insights.
The article explains how to use a circular doubly‑linked list together with a Union‑Find (disjoint‑set) structure to merge electrically equivalent points, split a circuit graph into connected sub‑graphs, and provides a full TypeScript implementation with practical considerations.
This article explains how single‑page applications use router mechanisms, compares hash and history routing modes, and demonstrates the required server‑side (Node) and Nginx configurations to make history mode work without page reloads, including code examples and best‑practice tips.
The article compares an adjacency‑list approach and a circular doubly linked list for representing circuit connections, showing that the linked‑list method achieves O(1) connect/disconnect operations with linear space, making it the most efficient and simple solution for graph‑based circuit modeling.
This article explains the concept and common use cases of delayed messages and compares five practical implementation methods—using Redis sorted sets, RabbitMQ delayed‑message exchange plugin, ActiveMQ scheduled messages, RocketMQ fixed delay levels, and a custom RocketMQ solution—detailing their workflows, advantages, and drawbacks.
This article presents a deep‑learning Seq2Seq model that converts images of mathematical formulas—including matrices, equations, fractions, and radicals—into LaTeX sequences with over 95% accuracy, detailing data preparation, LaTeX normalization, model architecture, training, inference, and post‑processing techniques.
This article explores the challenges and solutions for implementing double-tap zoom functionality in touch-enabled devices, addressing common problems with existing methods and proposing a mathematical approach to achieve accurate scaling and panning.
This article introduces the fundamentals of object detection, explains the latest YOLOv4 and YOLOv5 architectures, and details the essential components—including data preparation, regularization, backbone, neck, and prediction innovations—along with label smoothing and advanced loss functions for improved detection performance.
This article explains how the Douglas‑Peucker algorithm can be applied to reduce the number of points in mouse‑drawn wires for electrical simulations, improving rendering efficiency and editability, and provides a complete TypeScript implementation with supporting geometric utilities.
This article provides an in-depth overview of Nginx, covering its introduction, architecture, and various modules, including real IP and rewrite modules, with practical examples and configuration details.
This article explains the fundamentals of distributed systems, covering the CAP and BASE theorems, caching strategies, message queues, database choices, JVM optimization, and practical architectural improvements applied to New Oriental's mobile app to enhance availability and performance.
