-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.xml
250 lines (250 loc) · 19.5 KB
/
index.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0">
<channel>
<title>Aaron's notes</title>
<link>https://aarnphm.xyz</link>
<description>Les dernières 40 notes on Aaron's notes</description>
<generator>Quartz -- quartz.jzhao.xyz</generator>
<item>
<title>Bias and intercept</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4ml3/Bias-and-intercept</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4ml3/Bias-and-intercept</guid>
<description>See also: slides 3, slides 4, slides 5 X^{'}_{n \times (d+1)} = \begin{pmatrix} x_1^{1} & \cdots & x_1^{d} & 1 \\ \vdots & \ddots & \vdots & \vdots \\ ...</description>
<pubDate>Mon, 16 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>/squeel/</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3db3/t1</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3db3/t1</guid>
<description>TA: Jongjun Park db2 connect to se3db3 scp /path/to/.ddl [email protected]:/home/macid/workspace/.dll # on server db2 -tnf .ddl.</description>
<pubDate>Fri, 13 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Stakeholders</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3ra3/Stakeholders</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3ra3/Stakeholders</guid>
<description>stakeholders help to identify the problem Eliciting SSON to validate first hypothesis personas are V.A.R.I.E.D Vivid Actionable Real Identifiable Exact Detailed ex: Personal ...</description>
<pubDate>Fri, 13 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Fork and threads</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4aa4/w2</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4aa4/w2</guid>
<description>Q1: T Q2: T Q3: F Q4: User Q5: Save memory space Q6: Yes, but the modification can be only seen in child process, and value in parents process cannot be changed. ...</description>
<pubDate>Fri, 13 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>acme visits</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3ra3/acme-visits</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3ra3/acme-visits</guid>
<description>See also description.</description>
<pubDate>Thu, 12 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>requirements templates</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3ra3/acme/README</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3ra3/acme/README</guid>
<description>...</description>
<pubDate>Thu, 12 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>ENT chatbot surgery</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4g06ab/ENT-chatbot-surgery</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4g06ab/ENT-chatbot-surgery</guid>
<description>Train LoRA or even just fine-tuning Phi 3-5 Provide OpenAI-compatible endpoint for streaming.</description>
<pubDate>Thu, 12 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>w2</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/engineer-4a03/w2</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/engineer-4a03/w2</guid>
<description></description>
<pubDate>Wed, 11 Sep 2024 16:22:57 GMT</pubDate>
</item><item>
<title>Entity-Relationship Models</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3db3/Entity-Relationship-Models</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3db3/Entity-Relationship-Models</guid>
<description>E/R model sketch databse schemas including constraints. Entity set = rectangle Attribute = oval, with a line to the rectangle (representing its entity set) relationship connects two or more entity sets.</description>
<pubDate>Wed, 11 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>linalg review</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4ml3/tut1</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4ml3/tut1</guid>
<description>\begin{aligned} x_1 + x_2 + x_3 &= 5 \\ x_1 - 2x_2 - 3x_3 &= -1 \\ 2x_1 + x_2 - x_3 &= 3 \end{aligned} Equivalent matrix representation of A \times x = b \begin{aligned} A &= ...</description>
<pubDate>Wed, 11 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Linear regression</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4ml3/Linear-regression</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4ml3/Linear-regression</guid>
<description>See also slides for curve fitting, regression, colab link Transclude of thoughts/university/twenty-four-twenty-five/sfwr-4ml3/ols_and_kls.py curve fitting ...</description>
<pubDate>Tue, 10 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Introduction to Machine Learning</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4ml3/</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4ml3/</guid>
<description>See also machine learning and slides For annotated slides check out slides IMPORTANT Midterm: Mon Oct 28th Books: Pattern Recognition and Machine Learning” by Christopher M ...</description>
<pubDate>Tue, 10 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Foreign Keys and Relational Models</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3db3/Keys-and-Foreign-Keys</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3db3/Keys-and-Foreign-Keys</guid>
<description>See also slides A relation is a table Relations are unordered ⇒ relations are sets tuple and domain constraints tuple: expresses conditions on the values of each tuple domain constraint: ...</description>
<pubDate>Mon, 09 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Identifying Stakeholders</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3ra3/t2</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3ra3/t2</guid>
<description>See also instruction case study As people go green, there is an increased need for information on the facilities for cycling and pedestrian traffic in cities ...</description>
<pubDate>Mon, 09 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>vLLM</title>
<link>https://aarnphm.xyz/thoughts/vllm</link>
<guid>https://aarnphm.xyz/thoughts/vllm</guid>
<description>See also Paged Attention constrained decoding. speculative decoding See slides Speculative execution for LLMs is an excellent inference-time optimization.It hinges on the following unintuitive observation: forwarding an LLM on a single input token takes about as much time as forwarding an LLM on K input tokens in a batch (for larger K than you might… t.co/FiwTwqsfho— Andrej Karpathy (@karpathy) 31 août 2023 not all parameters are required for generations tokens constraints tokens with low information-density Ideas Uses a small cheap “draft model” to generate candidate K tokens ⇒ feed back to the large models in a batch have a sort of sampling logics to get the probability of the next token, then forward passing for all later tokens.</description>
<pubDate>Mon, 09 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Real-time system a la carte</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4aa4/</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4aa4/</guid>
<description> Soft RT system are those which do not : False A good scheduling algorithm for hard real time: False (continuous graph): B .</description>
<pubDate>Fri, 06 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>PageRank</title>
<link>https://aarnphm.xyz/thoughts/PageRank</link>
<guid>https://aarnphm.xyz/thoughts/PageRank</guid>
<description></description>
<pubDate>Wed, 04 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>DBMS</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3db3/DBMS</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3db3/DBMS</guid>
<description>Book: Database Management System ISBN-13:978-0072465631 Midterm Thurs Oct.24 2024 (during lecture time) Due at 2200, late penalty of 20% per 24h, max 5 days ...</description>
<pubDate>Wed, 04 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Software Requirements and Security Considerations</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3ra3/</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-3ra3/</guid>
<description>prof: Dr. Sébastien Mosser See also github.com/ace-lectures/cas-handbook-req-template requirements. functional vs. non-functional: IEEE 29148.</description>
<pubDate>Wed, 04 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Software Enginering Capstone a la carte.</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4g06ab/</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-four-twenty-five/sfwr-4g06ab/</guid>
<description>statement and goals. Administrative Details natural-language driven terminal Possible prof: Emil Sekerinski or Richard Paige warp as an example, but closed source So you can think it like Alacritty but with async command-runner voice-driven assistant: real-time transcribe ⇒ generate commands from language to shell commands voice → natural language natural language → commands Configuration, maybe in Lua stretch goal: new shell based on rust syntax and borrowing concept of variables.</description>
<pubDate>Wed, 04 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Progressive disclosure</title>
<link>https://aarnphm.xyz/thoughts/Progressive-disclosure</link>
<guid>https://aarnphm.xyz/thoughts/Progressive-disclosure</guid>
<description> make complexity easier to learn, but still enables power users to discover all workflows.</description>
<pubDate>Mon, 02 Sep 2024 00:00:00 GMT</pubDate>
</item><item>
<title>interact cohort 2024</title>
<link>https://aarnphm.xyz/thoughts/joininteract</link>
<guid>https://aarnphm.xyz/thoughts/joininteract</guid>
<description> Someone gives you 50,000 dollars for a project that explicitly can’t be a business. What’s the project you work on and why? I want to host dinner centered around intimacy and cultural curation in different cities.</description>
<pubDate>Fri, 23 Aug 2024 00:00:00 GMT</pubDate>
</item><item>
<title>friendship</title>
<link>https://aarnphm.xyz/thoughts/friendship</link>
<guid>https://aarnphm.xyz/thoughts/friendship</guid>
<description>of pleasure. or utility? the issue with a majority of San Francisco's culture of authentic relating, circling, cuddle parties, "deep convo" events, is that it’s intimacy without relationship.</description>
<pubDate>Sat, 22 Jun 2024 00:00:00 GMT</pubDate>
</item><item>
<title>being.</title>
<link>https://aarnphm.xyz/thoughts/being</link>
<guid>https://aarnphm.xyz/thoughts/being</guid>
<description>What is being as a part of epistemology? why do we practice art? Practice anything, no matter how well or how bad, we practice art as a act of becoming, for our soul to grow. ...</description>
<pubDate>Wed, 12 Jun 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Algebraic geometry</title>
<link>https://aarnphm.xyz/thoughts/algebraic-geometry</link>
<guid>https://aarnphm.xyz/thoughts/algebraic-geometry</guid>
<description>See also git source and web view.</description>
<pubDate>Wed, 22 May 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Crib.</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-2fa3/Finals</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-2fa3/Finals</guid>
<description>\begin{align*} \neg (\exists x \mid R:P(x)) &\equiv \forall x \mid R:\neg P(x) \\\ \neg (\forall x \mid R:P(x)) &\equiv \exists x \mid R:\neg P(x) \end{align*} regular ...</description>
<pubDate>Mon, 15 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Monte-Carlo methods</title>
<link>https://aarnphm.xyz/thoughts/Monte-Carlo</link>
<guid>https://aarnphm.xyz/thoughts/Monte-Carlo</guid>
<description>tree search. a search algorithm based on random sampling of the search space. Selection: root R and select successive child nodes until leaf L is reached.</description>
<pubDate>Fri, 12 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>The Prisoner's Dilemma</title>
<link>https://aarnphm.xyz/thoughts/The-Prisoner's-Dilemma</link>
<guid>https://aarnphm.xyz/thoughts/The-Prisoner's-Dilemma</guid>
<description>a game theory thought experiment involves two rational agents, each of whom can cooperate for mutual benefit or “defect” for individual reward.</description>
<pubDate>Fri, 12 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>game theory</title>
<link>https://aarnphm.xyz/thoughts/game-theory</link>
<guid>https://aarnphm.xyz/thoughts/game-theory</guid>
<description>emerged John von Neumann published the paper On the Theory of Games of Strategy, when Neumann’s original proff used Brower’s fixed-point theorem on continuous mappings into compact ...</description>
<pubDate>Fri, 12 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Economics for engineer, a guide.</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/eng-3px3/Finals</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/eng-3px3/Finals</guid>
<description>Economics for engineer, a guide.</description>
<pubDate>Fri, 12 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Non-linear Optimization</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/eng-3px3/Non-linear-optimization</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/eng-3px3/Non-linear-optimization</guid>
<description>See also slides.</description>
<pubDate>Fri, 12 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Context-free grammar and push-down Turing machine</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-2fa3/a3/A3</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-2fa3/a3/A3</guid>
<description>Problème 1. Give a context free grammar for the following language: L = \{a^nb^mc^k \mid k \neq n + m\} Solution The following CFG generates the language L: \begin{aligned} S &\rightarrow S_1 \mid S_2 \mid S_3 \\ S_1 &\rightarrow aS_1c \mid aS_1 \mid A \\ S_2 &\rightarrow bS_2c \mid bS_2 \mid B \\ S_3 &\rightarrow aS_3b \mid cS_3 \mid C \\ A &\rightarrow aAc \mid aA \mid a \mid \varepsilon \\ B &\rightarrow bBc \mid bB \mid b \mid \varepsilon \\ C &\rightarrow aCb \mid cC \mid c \mid \varepsilon \end{aligned} Problème 2.</description>
<pubDate>Wed, 10 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Observer and state-space model</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-3dx4/a5/A5</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-3dx4/a5/A5</guid>
<description>Problemè 1 Consider the following state-space model: \begin{aligned} \dot{x} &= \begin{bmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ -5 & -6 & 0 \\ \end{bmatrix} x ...</description>
<pubDate>Wed, 10 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>latent space</title>
<link>https://aarnphm.xyz/thoughts/latent-space</link>
<guid>https://aarnphm.xyz/thoughts/latent-space</guid>
<description></description>
<pubDate>Wed, 03 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Steady state error and PID controller</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-3dx4/lab5/prelab</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-3dx4/lab5/prelab</guid>
<description>See also problem Problemè 1 In Lab 4, We used a PD compensator to control our ball and beam apparatus. The transfer function of our PD compensator was as follows: G_C(s) = K_Ds + K_P However, we did not use the compensator in this form.</description>
<pubDate>Wed, 03 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>MST with shortest path optimisation</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-2c03/a10/A10</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-2c03/a10/A10</guid>
<description> Problème 1. Consider we want to build McMaster Maps, the best online route planning tool in existence. The developers of McMaster maps have decided to represent road information in terms of a a massive graph in which nodes are crossing and the edges are the roads between crossings.</description>
<pubDate>Mon, 01 Apr 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Joint-control open-loop system</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-3dx4/a4/A4</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-3dx4/a4/A4</guid>
<description>See also problem Problemè 1 A robot arm has a joint-control open-loop transfer function G(s) = \frac{300(s+100)}{s(s+10)(s+40)} 1.a Plot the asymptotic approximation of the Bode ...</description>
<pubDate>Thu, 28 Mar 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Attractor</title>
<link>https://aarnphm.xyz/thoughts/attractor</link>
<guid>https://aarnphm.xyz/thoughts/attractor</guid>
<description>A set of points described by a dynamical system. Some exhibits chaotic behaviour, see also Paul Bourke’s work Often create visually appealing patterns, but its applications range from physics to biology: how we understand weather patterns, bird migration patterns, quantum phenomena.</description>
<pubDate>Mon, 25 Mar 2024 00:00:00 GMT</pubDate>
</item><item>
<title>Shortest path and series-parallel graph</title>
<link>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-2c03/a9/A9</link>
<guid>https://aarnphm.xyz/thoughts/university/twenty-three-twenty-four/sfwr-2c03/a9/A9</guid>
<description> Problème 1. A regional government wants to improve their existing infrastructure between a collection of towns T. In specific, the government want to build a minimum number of roads such that there is a route from each town to each other town.</description>
<pubDate>Mon, 25 Mar 2024 00:00:00 GMT</pubDate>
</item><item>
<title>dundurn.</title>
<link>https://aarnphm.xyz/thoughts/atelier-with-friends/dundurn</link>
<guid>https://aarnphm.xyz/thoughts/atelier-with-friends/dundurn</guid>
<description>atelier with friends deux - orangeville.</description>
<pubDate>Sat, 23 Mar 2024 00:00:00 GMT</pubDate>
</item>
</channel>
</rss>