Rotordynamics Simulation and Nonlinear Contact Modeling in MATLAB
1. System Modeling: The Jeffcott Rotor
The Jeffcott rotor is a classic representation for analyzing rotor-bearing systems, treating the rotor as a concentrated mass on a flexible, massless shaft. The following MATLAB implementation defines the state-space equations considering viscous damping, stiffness, and unbalance forces.
% System paramete ...
Posted on Sat, 27 Jun 2026 16:23:26 +0000 by joshuamd3
Complete PID Controller Modeling and Simulation Project Based on Simulink
Fundamentals of PID Controller
1.1 Core Concepts and Mathematical Model of PID Control
PID control regulates the system error $ e(t) = r(t) - y(t) $ in real-time through three actions: Proportional (P), Integral (I), and Derivative (D). The control output is given by:
u(t) = K_p \left[ e(t) + \frac{1}{T_i} \int_0^t e(\tau)d\tau + T_d \frac{d ...
Posted on Thu, 25 Jun 2026 17:22:57 +0000 by bubblewrapped
Multi-Round Elimination Voting System Simulation
Problem Overview
In a competitive selection process, $n$ judges vote for $m$ available brands using a multi-round elimination system. The goal is to determine if a single brand can emerge as the winner or if the selection fails due to a tie in the final round.
Elimination Rules
The process follows these logic steps until a result is determined: ...
Posted on Mon, 22 Jun 2026 16:34:51 +0000 by oldtimer
Computing Score Bounds for a Transposed Answer Grid
A student takes a multiple-choice test with an n x n answer sheet. Each cell holds one of four options: A, B, C, or D. Unfortunately, the sheet was filled column by column instead of row by row, effectively transposing the intended answers. After the exam, the student comapres notes and marks each position with a comparison symbol: '+' means th ...
Posted on Sat, 20 Jun 2026 16:57:33 +0000 by adslworld.net
Understanding Simulation, DFS/BFS, Dynamic Programming, and Block Decomposition for Competitive Programming
Simulation problems, often labeled as "warm-up" or "signature" tasks in contests, require translating problem statements directly into code without relying on predefined algorithms. While they appear simple, their difficulty lies in accurately interpreting edge cases and constraints. A single oversight in boundary checks or ...
Posted on Sun, 14 Jun 2026 16:51:10 +0000 by ldougherty
Optimizing String Construction and GCD Generation for Competitive Programming
To maximizee the number of positive votes, we can separate reviews into two groups: one for negative ratings (value 2) and another for all others. Since negative reviews contribute nothing to the total, we simply count all non-negatvie ratings.
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
...
Posted on Sat, 06 Jun 2026 16:47:02 +0000 by plasmahba
Array Repetition: Efficient Query Resolution for Dynamic Expansion Operations
Problem Overview
Given an empty array a, perform n operations of two types:
Type 1: Append a number x (1 ≤ x ≤ n) to the array.
Type 2: Replicate the current array x times (1 ≤ x ≤ 10^9) and append the copies.
After all operations, q queries ask for the value at position k (1-indexed). Constraints: n, q ≤ 10^5, and 1 ≤ k ≤ min(10^18, final_ar ...
Posted on Wed, 03 Jun 2026 18:12:25 +0000 by mastercjb
Implementing a Positional PID Controller in Python
Proportional-Integral-Derivative (PID) controllers are widely used in industrial control systems to maintain a desired output value by adjusting a control input. A PID controller continuously calculates an error value as the difference between a desired setpoint and a measured process variable. It then applies a correction based on proportional ...
Posted on Fri, 29 May 2026 23:46:45 +0000 by scifo
Virtual Memory Page Replacement Simulation: LRU and Clock Algorithms
Virtual memory systems rely on efficient page replacement policies to handle situations where physical memmory frames are exhausted. When a page fault occurs and no free frames exist, the operating system must select a victim page to swap out. This simulation examines two common strategies: Least Recently Used (LRU) and the Clock algorithm.
Lea ...
Posted on Thu, 28 May 2026 21:49:57 +0000 by daveoliveruk
Simulation Problems: Network String Processing in C++
Overveiw
This article discusses several classic simulation problems that involve network string processing. Each problem requires parsing structured text, handling patterns, and implementing matching or replacement logic. The solution are written in C++ using standard libraries.
Template Generation System
The first problem involves a template e ...
Posted on Mon, 18 May 2026 22:27:11 +0000 by BobLennon