vault backup: 2026-01-14 15:47:27

Zettelkasten/Fleeting Notes/Weekly/2026_03.md

@@ -0,0 +1,82 @@
+---
+id: 2026-03
+title: Weekly — 2026-01-14
+type: Weekly
+created: 2026-01-14T18:46:24Z
+modified: 2026-01-14T19:21:41Z
+tags: [weekly]
+---
+
+# Weekly - 2026 CW 03 (Wed 2026-01-14)
+
+## Accomplishments
+- Finished FRET tutorial I was working on. I've still got
+weird dependency things I need to figure out. Moving to a
+mac has caused some interesting quirks but I'm working them
+out.
+- Read Hybrid Automata: An Algorithmic Approach to
+Specification and Verification of Hybrid Systems
+- Did 2 interviews for chair search and read additional
+applicants stuff. 
+- Bob asked me for help for ENGR 1933. I completed my RAMP
+training to get recertified. 
+- Completed the review form.
+- Did maneuvering with Emerson to get them moving on an
+offer. INL sent me a formal offer letter.
+
+### Chair-Search
+- ✓ Read additional applican and provide scords
+- ✓ Read Clarks application and provide review scores
+- ✓ Read remaining two applicants and provide scores
+
+### Thesis
+- ✓ Do FRET tutorials
+
+## Pushed or Rescheduled
+
+### Thesis
+- The Algorithmic Analysis of Hybrid Systems (1995) — rescheduled
+- Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems (1993) — rescheduled
+- Hamilton-Jacobi Reachability: A Brief Overview and Recent Advances (2017) — rescheduled
+
+### Other
+- Investigate DICE conference — rescheduled
+
+## Cancelled or Deleted
+
+No tasks were cancelled or deleted this week.
+
+## To Do
+- Decide on an internship
+- Additional interviews this week
+- Review meeting is this week.
+- Re-outline research approach. Identify the holes
+- Plan out a prelim problem. Maybe a simple version of what
+  HARDENS did. Just initiating scram?
+- Follow up with IT about what the hell is sending packets
+from the ARCADE puter.
+
+
+### Due This Week
+
+No tasks are due in the next 7 days.
+
+### High Priority
+
+**Thesis (reading)**
+- The Algorithmic Analysis of Hybrid Systems (1995) — Urgency: 17.8 (overdue by 5 days)
+- Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems (1993) — Urgency: 13.8 (overdue by 5 days)
+- Hamilton-Jacobi Reachability: A Brief Overview and Recent Advances (2017) — Urgency: 13.8 (overdue by 5 days)
+- Hybrid Systems: Review and Recent Progress (2003) — Urgency: 2.45
+- Multiple Lyapunov Functions and Other Analysis Tools for Switched and Hybrid Systems (1998) — Urgency: 2.45
+
+**Other**
+- Investigate DICE conference — Urgency: 15.8
+
+**ERLM (editing/writing)**
+- Add research tasks to research approach section — Urgency: 2.51
+
+**Zettelkasten**
+- AIGER Circuits — Urgency: 3.25
+- Reactive Synthesis — Urgency: 3.25
+- Write about opp. chall. and res. needs for remote micro ope. — Urgency: 3.22

Zettelkasten/Permanent Notes/20260114132351-bayes-theorem.md

@@ -3,7 +3,7 @@ id: 20260114132351
 title: Bayes' Theorem
 type: permanent
 created: 2026-01-14T18:23:51Z
-modified: 2026-01-14T18:42:20Z
+modified: 2026-01-14T18:43:20Z
 tags: []
 ---
 
@@ -33,8 +33,9 @@ We can apply Bayes' Theorem to states in time too.
 $$ P(X_t|Y_t) = \frac{P(Y_t|X_t) P(X_t)}{P(Y_t)} $$
 
 where:
-- $ X_{t+1} = f(x_t, w_t) $
+- $X_{t+1} = f(x_t, w_t)$
-- $ Y_{t} = f(x_t) + v_t $
+- $Y_{t} = f(x_t) + v_t$
+
 $w_t$ is process noise, while $v_t$ is measurement noise.
 
 Bayes' Rule is great for simulation and data-based

Zettelkasten/Permanent Notes/20260114153529-random-number-generation.md

@@ -0,0 +1,39 @@
+---
+id: 20260114153529
+title: Random Number Generation
+type: permanent
+created: 2026-01-14T20:35:29Z
+modified: 2026-01-14T20:46:35Z
+tags: []
+---
+
+# Random Number Generation (RNG)
+Random number generation is all about getting random
+numbers, and is easily defined as picking a number from a
+uniform distribution. Generally, there's two types:
+
+## True RNG
+True RNG is systems that are truly random. Random systems
+are almost always derived from [[chaotic systems]], which
+technically are deterministic, but as so final state
+sensitive they're basically intractable and 'random' values
+can be extracted. Sometimes lava lamps (turbulence) is used,
+sometimes isotope decay is the thing.
+
+## Pseudo RNG
+Computers can't really do true RNG. They just can't handle
+non-deterministic outcomes. In addition, true RNG is *slow*. 
+
+As such computers build PRNG. 
+
+>[!definition] Pseudo Random Number Generator
+> 
+> $\text{Struct}(S, \mu, f, U, g)$
+>
+> Where:
+> - $S$ is a finite set of states 
+> - $\mu$ is a distribution on S for the initial state (seed!)
+> - $f:S \rightarrow S$, the state transition function
+> - $U$ is the output space [0,1), or perhaps {0,...,m-1}
+> - $g:S \rightarrow U$, the output function
+>