Posts

---

Business projects are not available online due to copyright and trade secrets.

---

Why does inserting or removing buffers help fix timing violations?

Software and Hardware vs Time by Grok

Club Elo

Technology Node vs Year

Symbolic Netlist to Innovus-friendly Netlist

---

Decentralized Optimal Control of Distributed Interdependent Automata With Priority Structure

---

Reinforcement Learning is Direct Adaptive Optimal Control

Neural-network-based decentralized control of continuous-time nonlinear interconnected systems with unknown dynamics

Decentralized Stabilization for a Class of Continuous-Time Nonlinear Interconnected Systems Using Online Learning Optimal Control Approach

---

KL Divergence

Randomized Linear Programming Solves the Discounted Markov Decision Problem In Nearly-Linear (Sometimes Sublinear) Run Time

The Asymptotic Convergence-Rate of Q-learning

Solving H-horizon, Stationary Markov Decision Problems In Time Proportional To Log(H) Solving h-horizon, stationary markov decision problems in time proportional to log (h)

Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms

Hierarchical Apprenticeship Learning, with Application to Quadruped Locomotion

Policy Gradient Methods

Meta Learning Shared Hierarchies

Hierarchical Deep Reinforcement Learning: Integrating Temporal Abstraction and Intrinsic Motivation

Actor-Critic Algorithms for Hierarchical Markov Decision Processes

Hierarchical Policy Gradient Algorithms

Hierarchical Actor-Critic

---

Actor-Critic Algorithms

Policy Gradient Methods for Reinforcement Learning with Function Approximation

Reinforcement Learning with Soft State Aggregation

---

Markov Decision Processes and Policy Gradient

Policy Gradient and Q-learning

---

IntSim: A CAD tool for Optimization of Multilevel Interconnect Networks

Fourier Transform and Matrix-vector Multiplication

---

Euler Angles Bunge vs Elastic

---

Why do we use backpropagation?

Derivative of Sigmoid Function

Derivative of Hyperbolic Tangent Function

Compute Backpropagation Derivatives

Radix Sort
Bucket Sort
Counting Sort
Shell Sort
Heap Sort
  Merge Sort
  Quick Sort
  Insertion Sort
  The running time of quicksort depends on whether the partitioning is balanced or unbalanced, 
  which in turn depends on which elements are used for partitioning. 
  If the partitioning is balanced, the algorithm runs asymptotically as fast as merge sort. 
  If the partitioning is unbalanced, however, it can run asymptotically as slowly as insertion sort. 
  -- <Introduction to Algorithms> 7.2 Performance of quicksort
Selection Sort
Bubble Sort

Sorting

OOF2 vs Abaqus

Remote access to the Linux Servers

Cadence Virtuoso

-lpthread

C++, SystemC

Elastic Tensor Analysis

Math Term Translate

Define Data Type in Matlab

OpenFOAM PDE Terms

OpenFOAM_Base_Units

OpenFOAM_transportProperties

Gradient MATLAB

Recalescence

Abnormal Login UESTC Alumni Email

The following blogs pertain to the field of circuit design. Please note that some figures from the aforementioned posts may not be accessible on the Columbia Blog platform, as each blog is subject to a 50MB limit for uploaded files, including images, with an individual file size limit of 8MB on the Columbia Blogs platform. To review these figures in their original context, I invite you to visit https://peizhenlin.wordpress.com/.

https://peizhenlin.wordpress.com/: home/ >ls

Configure STA environment

Timing verification

Crosstalk delay

Crosstalk delay on timing verification

Sequential cells timing models

Check clock gating

prepare files and check netlist

.lib

update clock latency

OCV

meet skew via constraint

set_disable_timing

Clock Tree Synthesis

Trace clock tree

Clock Tree Latency Skew Uncertainty

Clock divider and CTS

CTS Spec GlobalUnsyncPin RootPin based on Constraint and Netlist

Path delay in cross clock domain

Same source create_generated_clock -add

design flow

no margin

Linux/Unix file permissions

echo $DISPLAY

chgrp

FinFET and MOSFET

PN junction

Band theory

Modeling_Power_Terminology

---