2024
20
- ML-paper-QLora
- ML-paper-PD-quant ML-paper-SlimSAM
- ML-paper-SAM
- ML-paper-PTQ4SAM
- CUDA-note-summary
- computer-network-lab-note
- x86-construction
- deep-learning-model-brief
- CUDA-interview-note
- front-end-interview-preparation
- computer-network-note-8 computer-network-note-7 computer-network-note-6 computer-network-note-5 computer-network-note-4 computer-network-note-3 computer-network-note-2
- computer-network-note-1
- database-theory-summary
2023
230
- database-design-theory database-archievement-theory
- algorithm-buaa-note
- parallel_programming_theory
- optimisation theory
- SwiftUI-IOS-design-doc
- SwiftUI-basis
- ER-graph-tips
- ChatGPT-Plus-Accounts-Access
- SysY-compiler-design-doc
- MPI-note-2 MPI-note-1
- decision-tree
- logistic-model multiobjective-programming data-envelopment-analysis
- mermaid-note queuing-theory monte-carlo-simulation markov-prediction correlation-analysis principal-component-analysis fuzzy-comprehensive-evaluation regression-analysis-algorithm grey-prediction-model clustering-analysis
- TOPSIS-model analytical-hierarchy-process interpolation-and-fitting nonlinear-program integer-program linear-program
- anaconda-command-note
- vue2-note-4 vue3-note-1 JavaScript-note-10 JavaScript-note-9 JavaScript-note-8 css-note-3 css-note-2
- html-note-4 html-note-3 html-note-2 Latex_package_recommendation
- Red-black-tree
- Base-ring-tree String-Matching-Algorithm
- algorithm-basis-note
- Ajax-note-5 Ajax-note-4 Ajax-note-3
- Ajax-note-2
- Ajax-note-1
- CUDA_note_5 CUDA_note_cuFFT CUDA_note_4
- CUDA_note_3 CUDA_note_2
- Node-note-5 Node-note-4 Node-note-3
- Node-note-2 Node-note-1
- database-theory-9 database-theory-8 database-theory-7 database-theory-6 database-theory-5 database-theory-4 database-theory-3
- database-theory-2 compiler-theory-5 compiler-theory-4
- compiler-theory-3 database-theory-1
- compiler-theory-2 compiler-theory-1
- CUDA_note_1 Swift-note-26 Swift-note-25 Swift-note-24 Swift-note-23 Swift-note-22 Swift-note-21 Swift-note-20 Swift-note-19 Swift-note-18 Swift-note-17 Swift-note-16 Swift-note-15 Swift-note-14 Swift-note-13 Swift-note-12 Swift-note-11 Swift-note-10 Swift-note-9 Swift-note-8 Swift-note-7 Swift-note-6 Swift-note-5 Swift-note-4 Swift-note-3 Swift-note-2 Swift-note-1
- MySQL_note_3
- MySQL_note_2
- algorithm-extra-note
- MySQL_note_1
- yaml-note
- Review of Military Theory
- UML_note OO_summary_4.UML
- lab6-challenge-report
- OO_hw13_test
- lab6_report
- photoshop-note
- OO_summary_3.JML
- Vue2-note-3 Vue2-note-2 Vue2-note-1
- GXemul-note
- lab5-report
- OO_hw9_test
- JML-note
- lab4_report
- Turtle-soup-game-for-is-or-not
- OO_summary_2.Elevator_dispatch
- OS-quick-abbreviation
- lab3_report
- OO_multithreading_tips OO_hw5_test
- tensorflow-model-summary
- TinyML_for_frb lab_discussion_1
- lab2_report
- Tensorflow2.1-note tf.keras.layers.Dense()-introduction
- OO_summary_1.Expression
- lab1_report
- lab0_report
- CO_P4
- OO_hw1_test
- Bash-note-4 Bash-note-3 Bash-note-2 Bash-note-1
- Makefile-note
- Segment-tree-2 Diameter_of_tree
- windows-command-basis git-note linux-note-4 linux-note-3 linux-note-2 linux-note-1
- linux-note-efficient linux-software-install linux-note-summary
- matlab-note-10 matlab-note-9 matlab-note-8 matlab-note-7 matlab-note-6 matlab-note-5 matlab-note-4 matlab-note-3 matlab-note-2 matlab-note-1 matlab-note-origin
- Geatpy_basis Matplotlib_basis Scipy_basis Numpy_basis linux_basic_command JavaScript_note_7 JavaScript_note_6 JavaScript_note_5 JavaScript_note_4 JavaScript_note_3 JavaScript_note_2 JavaScript_note_1 Latex_note_5
- Latex_note_4 Latex_note_3 Latex_note_2 Latex_note_1
- Latex_download OS_theory_6 OO_pre_9 OO_pre_8 OO_pre_7 OO_pre_6 OO_pre_5 OO_pre_4 OO_pre_3 OO_pre_2 OO_pre_1
- Turtle-soup-game
- matlab-note-summary tensorflow-function-basis bfptr-algorithm
- game-theory-algorithm dynamic-programming-advance dynamic-programming-basis Longest Common Subsequence Cut-point-algorithm Shrink-point-algorithm
- Inverse pair
- Longest Increasing Subsequence Euler function high-precision-algorithm
- extended euclidean algorithm minimum spanning tree
- Barycenter of tree Least Common Ancestors algorithm
- Sparse Table Binary Indexed Tree Discretization-algorithm double-pointers-queue
- Monotone-queue prefix_sum_algorithm judge-prime-algorithm Cpp_note_4
- shortest-path-algorithm
- Topological-sorting prune-algorithm
- Adjacency list
- algorithm introduction Trie tree
- disjoint set
2022
47
- TinyML-note OS_theory_5 OS_theory_4
- OS_theory_3 OS_theory_2 OS_theory_1
- hexo_instruction Java_note_3 Java_note_2 Java_note_1 datastruct_7 datastruct_6 datastruct_5 datastruct_4 datastruct_3 datastruct_2 css-note-1 html-note-1 Segment-tree-1
- IDEA Shortcut key markdown-note regular expression git_command_basis datastruct_1 Cpp_note_3 Cpp_note_2 Cpp_note_1 Cpp_part8 Cpp_part7 Cpp_part6 Cpp_part5 Cpp_part4 Cpp_part3 Cpp_part2 Cpp_part1
- CO-Verilog CO-Mips
- P8 Design documents P7 Design documents P6 Design documents P5 Design documents P4 Design documents P3 Design documents CO_P5 CO_P7 p7 test data CO_Pre