Merge remote-tracking branch 'origin/master'

.obsidian/graph.json

@@ -1,11 +1,11 @@
 {
-  "collapse-filter": true,
-  "search": "-\"Daily Note\" -\"Weekly Note\" -\"200 Library\" -path:\"900s Calendars\"  ",
+  "collapse-filter": false,
+  "search": "-\"Daily Note\" -\"Weekly Note\" -\"200 Library\" -path:\"900s Calendars\" ",
   "showTags": false,
   "showAttachments": false,
-  "hideUnresolved": true,
+  "hideUnresolved": false,
   "showOrphans": true,
-  "collapse-color-groups": false,
+  "collapse-color-groups": true,
   "colorGroups": [
     {
       "query": "path:\"4 Qualifying Exam\"  ",
@@ -48,6 +48,13 @@
         "a": 1,
         "rgb": 5419488
       }
+    },
+    {
+      "query": "path:\"9999 Personal/Z\"  ",
+      "color": {
+        "a": 1,
+        "rgb": 2653655
+      }
     }
   ],
   "collapse-display": true,
@@ -55,11 +62,11 @@
   "textFadeMultiplier": -1.5,
   "nodeSizeMultiplier": 1.98854166666667,
   "lineSizeMultiplier": 3.11145833333333,
-  "collapse-forces": false,
+  "collapse-forces": true,
   "centerStrength": 0.572916666666667,
   "repelStrength": 20,
   "linkStrength": 0.723958333333333,
   "linkDistance": 30,
-  "scale": 0.4228439030120897,
+  "scale": 0.05568314772175662,
   "close": true
 }

.obsidian/plugins/colored-tags/data.json

@@ -193,7 +193,20 @@
     "Haskell": 181,
     "Rust": 182,
     "LEAN": 183,
-    "Email": 184
+    "Email": 184,
+    "Z": 185,
+    "Engine": 186,
+    "Electrical": 187,
+    "Powertrain": 188,
+    "Powetrain": 189,
+    "Hands-On": 190,
+    "Susp": 191,
+    "Dynamics": 192,
+    "Drivetrain": 193,
+    "Ergonomics": 194,
+    "Bodywork": 195,
+    "Brakes": 196,
+    "Running-Car": 197
   },
   "_version": 3
 }

.obsidian/plugins/obsidian-full-calendar/data.json

@@ -39,6 +39,11 @@
       "type": "local",
       "color": "#b5b5b5",
       "directory": "900s Calendars/Personal"
+    },
+    {
+      "type": "local",
+      "color": "#3362f0",
+      "directory": "9999 Personal/Z/Calendar"
     }
   ],
   "defaultCalendar": 0,

0 Managerial Pages/1 Task Dashboard.md

@@ -8,6 +8,7 @@ sort by function task.created.format("dddd")
 # 😎 Tasks
 >[!danger] **Extreme Urgency Tasks**
 >```tasks
+>tags do not include #Z
 >not done
 >show urgency
 >filter by function task.urgency >16.999
@@ -17,17 +18,18 @@ sort by function task.created.format("dddd")
 
 >[!warning] **High Urgency Tasks**
 >```tasks
+>tags do not include #Z
 >not done
 >show urgency
 >filter by function task.urgency >12.999 && task.urgency<17.0
 >group by tags
 >sort by urgency
-
 > ```
 
 >[!todo] **Medium Urgency Tasks**
 >```tasks
 >not done
+>tags do not include #Z
 >show urgency
 >filter by function task.urgency >7.999 && task.urgency<13.0
 >sort by urgency
@@ -37,6 +39,7 @@ sort by function task.created.format("dddd")
 >[!done] **Low Urgency Tasks**
 >```tasks
 >not done
+>tags do not include #Z
 >show urgency
 >filter by function task.urgency <8.0
 >sort by urgency

1 Daily Notes/2025/2025-02-20.md

@@ -10,10 +10,10 @@ tags:
 # Summary
 ## What's the plan?
 - [x] TLA Learning Plan #TLA ⏫ ⏳ 2025-02-20 📅 2025-02-20 ✅ 2025-02-24
-- [ ] Do something with Robert's Email #Email 📅 2025-02-20 ⏳ 2025-02-20 
+- [ ] Do something with Robert's Email #Email 🔽 ⏳ 2025-02-20 📅 2025-02-20
 - [x] Join union discord #Union ⏳ 2025-02-21 📅 2025-02-21 ✅ 2025-02-21
-- [ ] Invite Yiyang to signal chat #Union ⏳ 2025-02-21 📅 2025-02-21
-- [ ] Set up union github repo #Union ⏳ 2025-02-21 📅 2025-02-21
+- [ ] Invite Yiyang to signal chat #Union 🔽 ⏳ 2025-02-21 📅 2025-02-21
+- [ ] Set up union github repo #Union 🔽 ⏳ 2025-02-21 📅 2025-02-21
 
 ## What's the results!
 ```tasks

1 Daily Notes/2025/2025-02-21.md

@@ -9,7 +9,7 @@ tags:
 [[ Weekly Note 2025-02-17]]
 # Summary
 ## What's the plan?
-- [ ] Chess Graduate Student Tournament Plan #GSA 
+- [ ] Chess Graduate Student Tournament Plan #GSA ⏳ 2025-02-26 📅 2025-02-28
 
 ## What's the results!
 ```tasks

1 Daily Notes/2025/2025-02-24.md

@@ -9,7 +9,7 @@ tags:
 [[ Weekly Note 2025-02-17]]
 # Summary
 ## What's the plan?
-- [ ] Investigate conference Robert mentioned "High Assurance Cyber Physical Something"
+- [ ] Investigate conference Robert mentioned "High Assurance Cyber Physical Something" #Thesis ⏳ 2025-02-24 📅 2025-02-28
 ## What's the results!
 ```tasks
 done 2025-02-24

200 Library Papers/ME2046_Sampled_Data_Analysis_Reading_Chapter_2pdf2254ME.md

@@ -10,7 +10,7 @@ citekey: "ME2046_Sampled_Data_Analysis_Reading_Chapter_2pdf2254ME"
 ## Tags:
 
 
-- ["] ME2046_Sampled_Data_Analysis_Reading_Chapter_2.pdf: 2254 ME 2046 SEC1000 DIGITAL CONTROL SYSTEMS #Reading 
+- [x] ME2046_Sampled_Data_Analysis_Reading_Chapter_2.pdf: 2254 ME 2046 SEC1000 DIGITAL CONTROL SYSTEMS #Reading ✅ 2025-02-24
 
 >[!seealso] Related Papers
 >

200 Library Papers/fromherzVerifiedEfficientEmbedding2019.md

@@ -28,7 +28,7 @@ pages: 63:1–63:30
 ## Tags:
 
 
-- ["] A verified, efficient embedding of a verifiable assembly language #Reading 
+- ["] A verified, efficient embedding of a verifiable assembly language #Reading ⏳ 2025-02-28 📅 2025-02-28
 
 >[!Abstract]
 >High-performance cryptographic libraries often mix code written in a high-level language with code written in assembly. To support formally verifying the correctness and security of such hybrid programs, this paper presents an embedding of a subset of x64 assembly language in F* that allows efficient verification of both assembly and its interoperation with C code generated from F*. The key idea is to use the computational power of a dependent type system's type checker to run a verified verification-condition generator during type checking. This allows the embedding to customize the verification condition sent by the type checker to an SMT solver. By combining our proof-by-reflection style with SMT solving, we demonstrate improved automation for proving the correctness of assembly-language code. This approach has allowed us to complete the first-ever proof of correctness of an optimized implementation of AES-GCM, a cryptographic routine used by 90% of secure Internet traffic.>[!seealso] Related Papers

3-99 Research/Haskell/Chapter 1 - Introduction.md

@@ -5,11 +5,11 @@ What does that mean? What isn't a functional programming language? Well, just ab
 
 If I want to compute a factorial, I'd probably say take this value, and multiply it a whole bunch of times until you get to an end condition. The computer may change state at this point, where your input variable gets overwritten with the result, or some thing inside the task list, such as an iterator, changes to a value that can create a different result if run again. 
 
-- [?] What is a 'state' for a computer really? #Follow-Up #Haskell
+- [?] What is a 'state' for a computer really? #Follow-Up #Haskell ⏳ 2025-02-28 📅 2025-02-28
 
 Functional programming languages do not do this. Instead of using iteratives like that or having the possiblity of functions changing variable states, everything is instead immutable. If I define a function for a factorial, I define *what a factorial is*, rather than explicit steps to compute one. Then, when I apply the 'function' to an input, the output is something new: the function applied to that variable that is fundamentally not an execution of the function or a wrought product of the original input. This is *maybe* what a monad is. 
 
-- [?] What is a 'monad' really? #Follow-Up #Haskell
+- [?] What is a 'monad' really? #Follow-Up #Haskell ⏳ 2025-02-28 📅 2025-02-28
 
 There's a special property about functions that can be called multiple times with the same parameters being guaranteed to return the same result: **Referential Transparency**. This property allows us to deduce and then even proved that a function does exactly what it is supposed to, every time. 
 

3-99 Research/Haskell/Chapter 2 - Starting Out.md

@@ -119,6 +119,46 @@ take 10 [2, 4..]
 -- will only yield even numbers greater than 12 in the first 10 elements of the set
 ```
 
-I made it to boomBangs and stopped. I'm outta gas :) 
+boomBangs is an interesting one. We can write code that does a function as the function, while also incorporating predicates.
 
+An easy way to remember: [Function | Set, Predicate, (predicate 2),...]
+Fucking Stupid Predicates
 
+We can also use multiple lists. If multiple lists are given (one for each variable), then all combinations of the two lists are used.
+
+Strings are just lists. We can apply list comprehensions to them!
+Here's a couple of useful examples:
+```haskell
+-- Now Writing our own custom list function
+length' xs = sum [1 | _ <- xs] 
+-- use dummy variable _, draw an element from a list and replace it with 1. Sum all of those.
+
+--- Strings are lists! We can use list comprehensions on them.
+removeNonUppercase st = [ c | c <- st, c `elem` ['A'..'Z']]
+```
+
+Finally, list comprehensions can be nested. So we can use a comprehension to extract a list from a set of lists, and then use another comprehension on that lsit itself.
+
+## Tuples
+Tuples are somewhat confused with lists, but they are not exactly the same.
+
+Tuples are useful in specific cases. Namely, when an explicit number of elements and their types are known. Tuples are designated by parentheses '()'
+
+Also interestingly, tuples can have a mish mash of types inside them. The specific combination of types inside a tuple makes the tuple itself a certain type:
+
+```haskell
+[(1,2), (3,4), (5,6)] -- is okay!
+[(1,2), (8,5,11), (5,6)] -- is NOT okay!
+[(1,2), ('Okay?', 2)] -- is NOT okay!
+```
+
+Tuples have special names for their sizes:
+(1,2) - Pair
+(3,4,5) - Triple
+(4,5,6,7) - 4-tuple
+(2,3,..,n) - n-tuple
+
+Here's some useful tuple functions:
+fst: takes a pair and returns first component
+snd: Suprise! gives the second component of a pair
+zip: Takes two lists and makes pairs of the elements. Stops at the shorter list's end.

3-99 Research/Haskell/Learning Plan.md

@@ -1,6 +1,6 @@
 https://learnyouahaskell.github.io/chapters.html
 - [x] Chapter 1: Introduction #Haskell ⏳ 2025-02-18 📅 2025-02-12 ✅ 2025-02-19
-- [/] Chapter 2: Starting Out #Haskell ⏳ 2025-02-19 📅 2025-02-25
+- [x] Chapter 2: Starting Out #Haskell ⏳ 2025-02-19 📅 2025-02-25 ✅ 2025-02-24
 - [ ] Chapter 3: Types and Typeclasses #Haskell ⏳ 2025-02-26 📅 2025-03-04
 - [ ] Chapter 4: Syntax in Functions #Haskell 📅 2025-03-05 ⏳ 2025-03-11
 - [ ] Chapter 5: Recursion #Haskell 📅 2025-03-12 ⏳ 2025-03-18

3-99 Research/Haskell/baby.hs

@@ -7,3 +7,26 @@ doubleSmallNumber x = if x > 100
                       else x*2
 
 doubleSmallNumber' x = (if x > 100 then x else x*2) + 1
+
+-- boom bangs, ya heard???
+boomBangs xs = [ if x< 10 then "BOOM!" else "BANG!" | x <- xs, odd x]
+-- remember, [function | set, predicate] 'fucking stupid predicate'
+
+schtankyList x = [ x*y | x <- [2,5,10], y <- [8,10,11]]
+
+-- Now Writing our own custom list function
+length' xs = sum [1 | _ <- xs] 
+-- use dummy variable _, draw an element from a list and replace it with 1. Sum all of those.
+
+--- Strings are lists! We can use list comprehensions on them.
+removeNonUppercase st = [ c | c <- st, c `elem` ['A'..'Z']]
+
+--------------Pythogoraus Problem----------------------
+--triangles with integer sides
+triangles x = [(a,b,c) | c <- [1..10], b <- [1..10], a <- [1..10]]
+
+--right triangles
+rightTriangles x = [(a,b,c) | c <- [1..10], b <- [1..10], a <- [1..10], a^2 + b^2 == c^2]
+
+-- Now only triangles with perimiter equal to 24
+rightTriangles' x = [(a,b,c) | c <- [1..10], b <- [1..10], a <- [1..10], a^2 + b^2 == c^2, a+b+c == 24]

3-99 Research/TLA/TLA - README.md

@@ -3,7 +3,6 @@
 ## Files
 - [[TLA Canvas.canvas]]
 - [[TLA+ Learning Plan.md]]
-- [[Untitled.md]]
 - [[What is TLA?.md]]
 - [[What the hell is liveness?.md]]
 

3-99 Research/TLA/Untitled.md

@@ -1,3 +0,0 @@
-# What is TLA good for?
-- Great for finding bugs in concurrent and distributed systems. 
- - Programs where a lot of shit is happening at different times, and where emergent behavior isn't clear.

300s School/ME 2150 - High Assurance Cyber-Physical Systems/2025-02-18 Boyd Talk.md

@@ -7,6 +7,6 @@ Engineering is a step on top of science. Engineering is *creating* with science'
 
 
 
-- [ ] Innovators dilemma. An interesting book that discusses, well, the innovators dilemma.
+- [ ] Innovators dilemma. An interesting book that discusses, well, the innovators dilemma. ⏳ 2025-02-24 📅 2025-02-28
 
-- [ ] Look up Pancake. Language that is good for drivers but also easy to distill proofs.
+- [ ] Look up Pancake. Language that is good for drivers but also easy to distill proofs. 🛫 2025-02-24 📅 2025-02-28

300s School/NUCE 2113 - Radiation Detection and Measurement/!Things That Need Done.md

@@ -4,4 +4,4 @@
 - [x] Lab Report 2 #NUCE2113 ⏫ ⏳ 2025-02-03 📅 2025-02-04 ✅ 2025-02-04
 - [x] Lab Report 3 #NUCE2113 ⏳ 2025-02-05 📅 2025-02-11 ✅ 2025-02-10
 - [x] Lab Report 4 #NUCE2113 ⏳ 2025-02-12 📅 2025-02-18 ✅ 2025-02-17
-- [/] Lab Report 5 #NUCE2113 ⏳ 2025-02-19 📅 2025-02-25
+- [/] Lab Report 5 #NUCE2113 🔼 ⏳ 2025-02-19 📅 2025-02-25

5 Thesis/Things to Do.md

@@ -1,7 +1,7 @@
 Follow up tasks:
 - [-] What is the state of the art for wireless control? #Thesis ❌ 2025-01-24
 - [/] What has happened so far with verifying assembly code? #Thesis 🔽 ⏳ 2025-01-29 📅 2025-02-06
-- [?] How does Rust compile into binary? #Thesis ⏳ 2025-01-28 📅 2025-02-11
+- [?] How does Rust compile into binary? #Thesis ⏬ ⏳ 2025-01-28 📅 2025-02-11
 ```dataview
 task 
 where contains(tags, "Thesis")

900s Calendars/Research/2025-02-24 Haskell Chapter 2.md

@@ -0,0 +1,9 @@
+---
+title: Haskell Chapter 2
+allDay: false
+startTime: 20:00
+endTime: 21:00
+date: 2025-02-24
+completed: null
+type: single
+---

900s Calendars/Research/2025-02-25 Rust Chapter 2.md

@@ -0,0 +1,9 @@
+---
+title: Rust Chapter 2
+allDay: false
+startTime: 10:30
+endTime: 11:00
+date: 2025-02-25
+completed: null
+type: single
+---

900s Calendars/Research/Research - README.md

@@ -4,8 +4,10 @@
 - [[2024-08-26 Fighting with the BeagleBone.md]]
 - [[2024-08-28 HAIS Journal Club.md]]
 - [[2024-09-10 Nuclear Engineering Steering Committee - Conf Room A UClub.md]]
+- [[2025-02-24 Haskell Chapter 2.md]]
 - [[2025-02-24 LEAN.md]]
 - [[2025-02-24 TLA Learning Plan and Notes.md]]
+- [[2025-02-25 Rust Chapter 2.md]]
 
 ## Summary
 

9999 Personal/9999 Personal - README.md

@@ -2,23 +2,11 @@
 
 ## Subdirectories
 - [[Journal/Journal - README]]
+- [[Z/Z - README]]
 
 ## Files
 - [[Italy Planning.md]]
 
 ## Summary
-# 9999 Personal
-
-This folder contains a collection of files related to the wedding planning for Jonathan and Ngoc's destination wedding in Florence, Italy.
-
-## Subdirectories
-- [[Journal/Journal - README]]
-
-## Files
-- [[Italy Planning.md]]
- 
-This file outlines the wedding itinerary, including transportation arrangements, accommodations, and estimated costs. It also includes information on traveling with pets to Sicily before or after the wedding. The breakdown of expenses is detailed, providing an estimate of total costs for attendees.
-
-Note: The description is concise and does not include any speculative content, sticking to a factual representation of the contents within the folder.
 
 Generated by llama3.2:latest

9999 Personal/Z/A Short List of Everything That's Wrong with the Z.md

@@ -0,0 +1,33 @@
+# To-Do List
+```tasks
+filter by function task.file.folder.includes("9999 Personal/Z")
+show urgency
+sort by urgency
+```
+
+# Current Projects
+#### #Powertrain
+[[Z31 LS Swap]]
+#### #Drivetrain
+[[What transmission will solve all my problems?]]
+#### #Electrical 
+[[Standalone LS Harness]]
+#### #Dynamics
+[[Coilover Options]]
+[[Wheels, Tires, and Spacers]]
+#### #Ergonomics
+[[Interior Carpet Replacement]]
+[[Dashboard Leather Replacement]]
+[[Seat Replacement]]
+[[Roll Bar / Harness Install]]
+#### #Bodywork 
+[[Widebody Kit]]
+[[New Paint Job]]
+#### #Brakes
+[[Aftermarket Brakes]]
+[[Repair OEM Brakes]]
+# Running Car List
+```tasks
+tags include #Running-Car
+sort by urgency
+```

9999 Personal/Z/Calendar/2025-02-24 Z Planning.md

@@ -0,0 +1,8 @@
+---
+title: Z Planning
+allDay: false
+startTime: 21:00
+endTime: 22:00
+date: 2025-02-24
+completed: null
+---

9999 Personal/Z/Calendar/Calendar - README.md

@@ -0,0 +1,8 @@
+# Table of Contents for Calendar
+
+## Files
+- [[2025-02-24 Z Planning.md]]
+
+## Summary
+
+Generated by llama3.2:latest

9999 Personal/Z/Coilover Options.md

@@ -0,0 +1,5 @@
+# February 24th, 2025
+The easiest option right now is to just get the car back to OEM spec. The current suspension dampers are absolutely fucked. Springs are probably okay. 
+
+- [ ] [[Replace OEM dampers front and rear]] #Dynamics #Hands-On 
+- [ ] [[Replace bushings]] #Dynamics #Hands-On 

9999 Personal/Z/Repair OEM Brakes.md

@@ -0,0 +1,3 @@
+Right now, OEM brakes have no brake pressure, and only parking brake will hold the car. This needs to be addressed and fixed before the car can run.
+
+- [ ] Find brake leak #Brakes #Running-Car 

9999 Personal/Z/Replace OEM dampers front and rear.md

@@ -0,0 +1 @@
+[RockAuto has some good options](https://www.rockauto.com/en/catalog/nissan,1986,300zx,3.0l+v6,1209563,suspension,shock+/+strut,7556)

9999 Personal/Z/Replace bushings.md

@@ -0,0 +1,3 @@
+Prothan has some good options
+https://www.prothanesuspensionparts.com/142004
+$200.77

9999 Personal/Z/What transmission will solve all my problems?.md

@@ -0,0 +1,11 @@
+- [ ] Aggregate transmission options #Drivetrain #Running-Car 
+- [ ] Decide on a transmission #Drivetrain #Running-Car 
+
+# Transmission Options
+## Tremec TKO / TKX
+
+## T56
+
+## AR5
+https://www.fabbotfab.com/products/fabbot-ar5-to-ls-nexgen-adapter-bundle?variant=42035111657718
+## Z32 Transmission?

9999 Personal/Z/Wheels, Tires, and Spacers.md

@@ -0,0 +1,5 @@
+I need to reestablish what wheels and tires are on the z right now, and figure out a more sustainable space solution. One thing that needs done is that longer wheel studs need put on the car. 
+
+- [ ] [[Longer Wheel Studs]] #Dynamics 
+- [ ] What are the current wheels and tires on the Z? #Dynamics 
+- [ ] Sell my old tires #Hands-On

9999 Personal/Z/Z - README.md

@@ -0,0 +1,19 @@
+# Table of Contents for Z
+
+## Subdirectories
+- [[Calendar/Calendar - README]]
+
+## Files
+- [[A Short List of Everything That's Wrong with the Z.md]]
+- [[Coilover Options.md]]
+- [[Repair OEM Brakes.md]]
+- [[Replace bushings.md]]
+- [[Replace OEM dampers front and rear.md]]
+- [[Untitled.md]]
+- [[What transmission will solve all my problems?.md]]
+- [[Wheels, Tires, and Spacers.md]]
+- [[Z31 LS Swap.md]]
+
+## Summary
+
+Generated by llama3.2:latest

9999 Personal/Z/Z31 LS Swap.md

@@ -0,0 +1,31 @@
+# Current Status (February 24, 2025)
+The old VG30e engine is out of the z, along with the transmission and 3/4 of the exhaust. Right now, i have the new engine mounts, and that's about it. This swap will be a big deal for this car, and hopefully it won't take too long to really get done. First, let's outline the goals and scope of this build.
+
+## Goals
+1. Get a Gen III or Gen IV small block Chevy engine in the Z's chassis, prefferably a 5.3L or even 4.8L. No need to over due power. This engine will be sourced from a junkyard.
+2. Find a matching transmission to pair with the LS engine
+3. Reuse stock differential and rear end. Custom driveshaft will be required
+4. Keep current electrical harness for car cabin
+5. Get working gauges in stock gauge cluster
+
+## In Scope
+A reliable junkyard LS engine will make the new heartbeat of this car.This engine will come from a Chevy truck from the Pittsburgh UPullNPay, as this will by far be the cheapest option. This engine will be paired with likely a TKX transmission and bellhousing. At the moment of writing this, I think an aftermarket ECU and harness might be the way to go. 
+
+Other critical supporting systems will also come up. Exhaust, cooling, and electrical just to name a few.
+## Out of Scope
+Any fancy turbo business.
+
+# What Needs Done
+## Planning
+- [ ] [[Which LS Engine should I target?]]  #Powertrain #Running-Car
+- [ ] [[Standalone LS Harness]]  #Powertrain #Electrical #Running-Car
+- [ ] [[What oil pan do I need?]] #Powertrain #Running-Car
+- [ ] [[How will the exhaust work?]] #Powertrain #Running-Car
+- [ ] [[How will cooling work?]] #Powertrain #Running-Car
+- [ ] [[How will fuel work?]] #Powertrain #Electrical #Running-Car
+- [ ] [[How will gauges work?]] #Powertrain #Electrical 
+
+## Work on the car
+- [ ] [[Clean up the engine bay]]. Remove junk that doesn't need to be there. #Powertrain #Hands-On #Running-Car
+- [ ] Sell the old engine #Hands-On 
+- [ ] Sell the old transmission #Hands-On