Investigated correlations between 3D Zernike moments and protein pair RMSDs using molecular simulations.
+
+
+
+
+
+
Sustainable Computing Laboratory, University of Notre Dame
+
Notre Dame, IN
+
+
+
Undergraduate Research Assistant
+
Jun. 2023-Aug. 2023
+
+
+
+
+
Conducted literature review on pruning algorithms to improve neural network fairness.
+
+
Implemented pruning algorithms using PyTorch to improve convolutional neural network fairness.
+
+
+
+
+
+
Democracy in Plain Sight Lab, Purdue University
+
West Lafayette, IN
+
+
+
Undergraduate Research Assistant
+
May 2022-Aug. 2022
+
+
+
+
+
Implemented an automated data collection pipeline with the JavaScript Puppeteer library to collect over 80000 entries of Peru's voting data and ballot images.
+
+
+
+
+
+
+
Work Experience
+
+
+
+
Advanced Semiconductor Engineering
+
Chungli, TW
+
+
+
IT Intern
+
Jun. 2024-Aug.2024
+
+
+
+
+
+
+
+
+
Purdue University
+
West Lafayette, IN
+
+
+
Undergraduate Teaching Assistant
+
Oct. 2022-Dec. 2023
+
+
+
+
+
Department of Computer Science: C Programming; Systems Programming
+
+
The Data Mine/Ford Corporate Project: Project lead for researching the effect of a dataset's reliability coefficient and the performance of NLP models.
My name is Min Lu. I am currently a Masters student studying Computer Science at Georgia Tech. Previously I was a Bachelors student studying Computer Science at Purdue University. I can be contacted using the following channels.
+
+
+
+
+
\ No newline at end of file
diff --git a/public/index.xml b/public/index.xml
new file mode 100644
index 0000000..5571069
--- /dev/null
+++ b/public/index.xml
@@ -0,0 +1,26 @@
+
+
+
+ Home on Min Lu
+ //localhost:1313/
+ Recent content in Home on Min Lu
+ Hugo
+ en-us
+ Thu, 27 Jun 2024 07:56:53 +0800
+
+
+ LeetCode Daily Question: #1382
+ //localhost:1313/writeups/wr1/
+ Thu, 27 Jun 2024 07:56:53 +0800
+ //localhost:1313/writeups/wr1/
+ Problem Given the root of a BST, return a balanced BST with the same node values. If there is more than one answer, return any of them.
Key Takeaways An inorder traversal of a BST returns a list of sorted values. Whenever recursing using indices, make sure to check if the start index ever exceeds the end index as a base case. Calculate the midpoint between two indices as (start + (end - start) / 2).
+
+
+ Curriculum vitae
+ //localhost:1313/cv/
+ Tue, 25 Jun 2024 09:31:37 +0800
+ //localhost:1313/cv/
+
+
+
+
diff --git a/public/js/main.js b/public/js/main.js
new file mode 100644
index 0000000..dd7dc87
--- /dev/null
+++ b/public/js/main.js
@@ -0,0 +1,4 @@
+(() => {
+ //
+ console.log("This site was generated by Hugo.");
+})();
diff --git a/public/sitemap.xml b/public/sitemap.xml
new file mode 100644
index 0000000..0befb3a
--- /dev/null
+++ b/public/sitemap.xml
@@ -0,0 +1,25 @@
+
+
+
+ //localhost:1313/tags/bst/
+ 2024-06-27T07:56:53+08:00
+
+ //localhost:1313/
+ 2024-06-27T07:56:53+08:00
+
+ //localhost:1313/writeups/wr1/
+ 2024-06-27T07:56:53+08:00
+
+ //localhost:1313/tags/
+ 2024-06-27T07:56:53+08:00
+
+ //localhost:1313/writeups/
+ 2024-06-27T07:56:53+08:00
+
+ //localhost:1313/cv/
+ 2024-06-25T09:31:37+08:00
+
+ //localhost:1313/categories/
+
+
diff --git a/public/tags/bst/index.html b/public/tags/bst/index.html
new file mode 100644
index 0000000..eba024f
--- /dev/null
+++ b/public/tags/bst/index.html
@@ -0,0 +1,50 @@
+
+
+
+
+
+
+Bst | Min Lu
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/public/tags/bst/index.xml b/public/tags/bst/index.xml
new file mode 100644
index 0000000..ae63fbf
--- /dev/null
+++ b/public/tags/bst/index.xml
@@ -0,0 +1,19 @@
+
+
+
+ Bst on Min Lu
+ //localhost:1313/tags/bst/
+ Recent content in Bst on Min Lu
+ Hugo
+ en-us
+ Thu, 27 Jun 2024 07:56:53 +0800
+
+
+ LeetCode Daily Question: #1382
+ //localhost:1313/writeups/wr1/
+ Thu, 27 Jun 2024 07:56:53 +0800
+ //localhost:1313/writeups/wr1/
+ Problem Given the root of a BST, return a balanced BST with the same node values. If there is more than one answer, return any of them.
Key Takeaways An inorder traversal of a BST returns a list of sorted values. Whenever recursing using indices, make sure to check if the start index ever exceeds the end index as a base case. Calculate the midpoint between two indices as (start + (end - start) / 2).
+
+
+
diff --git a/public/tags/bst/page/1/index.html b/public/tags/bst/page/1/index.html
new file mode 100644
index 0000000..84e092c
--- /dev/null
+++ b/public/tags/bst/page/1/index.html
@@ -0,0 +1,10 @@
+
+
+
+ //localhost:1313/tags/bst/
+
+
+
+
+
+
diff --git a/public/tags/index.html b/public/tags/index.html
new file mode 100644
index 0000000..8ac8998
--- /dev/null
+++ b/public/tags/index.html
@@ -0,0 +1,50 @@
+
+
+
+
+
+
+Tags | Min Lu
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/public/writeups/index.xml b/public/writeups/index.xml
new file mode 100644
index 0000000..1e250b9
--- /dev/null
+++ b/public/writeups/index.xml
@@ -0,0 +1,19 @@
+
+
+
+ Writeups on Min Lu
+ //localhost:1313/writeups/
+ Recent content in Writeups on Min Lu
+ Hugo
+ en-us
+ Thu, 27 Jun 2024 07:56:53 +0800
+
+
+ LeetCode Daily Question: #1382
+ //localhost:1313/writeups/wr1/
+ Thu, 27 Jun 2024 07:56:53 +0800
+ //localhost:1313/writeups/wr1/
+ Problem Given the root of a BST, return a balanced BST with the same node values. If there is more than one answer, return any of them.
Key Takeaways An inorder traversal of a BST returns a list of sorted values. Whenever recursing using indices, make sure to check if the start index ever exceeds the end index as a base case. Calculate the midpoint between two indices as (start + (end - start) / 2).
+
+
+
diff --git a/public/writeups/page/1/index.html b/public/writeups/page/1/index.html
new file mode 100644
index 0000000..e3b6b1a
--- /dev/null
+++ b/public/writeups/page/1/index.html
@@ -0,0 +1,10 @@
+
+
+
+ //localhost:1313/writeups/
+
+
+
+
+
+
diff --git a/public/writeups/wr1/index.html b/public/writeups/wr1/index.html
new file mode 100644
index 0000000..cf0bb85
--- /dev/null
+++ b/public/writeups/wr1/index.html
@@ -0,0 +1,126 @@
+
+
+
+
+
+
+LeetCode Daily Question: #1382 | Min Lu
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Given the root of a BST, return a balanced BST with the same node values. If there is more than one answer, return any of them.
+
Key Takeaways
+
+
An inorder traversal of a BST returns a list of sorted values.
+
Whenever recursing using indices, make sure to check if the start index ever exceeds the end index as a base case.
+
Calculate the midpoint between two indices as (start + (end - start) / 2).
+
+
Algorithm
+
+
Do inorder traversal on the original BST and get a vector of sorted values in the BST.
+
Recurse on the vector to construct the balanced BST, keeping track of the start and index node at each step.
+
+
For each step in the recursion, set the midpoint as the root of that subtree, and then construct the left and right subtrees out of the two halves of the vector.