-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
593 lines (491 loc) · 32.3 KB
/
index.html
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
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
<!DOCTYPE html>
<html lang="en">
<head>
<link rel="icon" sizes="16x16 32x32 64x64" href="./imgs/GlaucusProfile.png">
<script async src="https://www.googletagmanager.com/gtag/js?id=G-J8RSL65KCL"></script>
<script>
window.dataLayer = window.dataLayer || [];
function gtag(){dataLayer.push(arguments);}
gtag('js', new Date());
gtag('config', 'G-J8RSL65KCL');
</script>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Alx - About Me</title>
<link rel="stylesheet" href="style.css">
</head>
<body>
<header>
<h1>Alexander Chen</h1>
<h3>AlxV07</h3>
<div id="pfp-image-container">
<img id="img0" src="imgs/BeeProfile.png" alt="BeePfp" class="transition_image">
<img id="img1" src="imgs/MantisProfile.jpg" alt="MantisPfp" class="transition_image">
<img id="img2" src="imgs/GlaucusProfile.png" alt="GlaucusPfp" class="transition_image">
</div>
</header>
<nav>
<br>
<a href="#about" >About</a>
<a href="#accomplishments">Accomplishments</a>
<a href="#activities">Activities</a>
<a href="#connect">Connect</a>
<a href="#blog">Blog</a>
<br>
</nav>
<button id="toggle-theme">Disable Dynamic Theme</button>
<section id="about">
<h2>About:</h2>
Hello! My name is Alexander Chen; I'm <code id="age-code-block"></code> years old and am passionately studying Computer Science.
I've been programming for ~<code id="prog-age-code-block"></code> years, mainly in the languages of
Python, Lisp, Prolog, Java, and C++. I've been studying in a variety of fields including
algorithms and data structures, software development, and AI (ML, NLP, XAI).
<br><br>
I live in Dallas, Texas, and homeschool with Mother of Divine Grace School.
I do competitive programming (USACO) as well as speech and debate (NCFCA).
In my free time, I enjoy playing chess and studying Latin.
I have a little sister who plays AAA Ice Hockey on the Dallas Stars Elite
(<a href="https://www.youtube.com/@minachenhockeyplayer/shorts">Her YouTube Channel</a>).
</section>
<section id="accomplishments">
<h2>Accomplishments:</h2>
<ul>
<li>I accepted the offer for my first summer internship in Oct. 2024 as an Enterprise Technology Software Engineer @ State Farm for Summer 2025. </li>
<li>I promoted to the USACO Gold Division in Feb. 2025 during my high school sophomore year, placing 579 out of 2451 pre-college competitors worldwide;
The previous year I had competed in my first ever USACO contest in my high school freshman year and promoted to Silver in Dec. 2023, placing 1022 out of 9707 pre-college competitors worldwide
(<a href="https://www.linkedin.com/posts/alexander-chen-504893267_on-december-16-2023-my-highschool-freshman-self-activity-7144801466925367296-HFE4?utm_source=share">LinkedIn Post</a>). </li>
<li>I competed in my first NCFCA Debate Tournament in Jan. 2024 and went to Quarterfinals w/ my partner William Kuykendall, placing 8th out of ~42 overall.
The following year I went on to place as the 2nd Team Policy Speaker overall at the first National Mixer tournament of the 2024-2025 season.</li>
<li>In 8th-9th grade while reading <a href="https://mitpress.mit.edu/9780262510875/structure-and-interpretation-of-computer-programs/">MIT's SICP</a>,
I wrote my own Lisp interpreter from scratch <a href="https://github.com/AlxV07/PyLispSICP/tree/main">(PyLisp GitHub)</a>.</li>
<li>I took my first AP test (APCSA) in 8th grade and scored a 5.</li>
<li>I built the ActionAutomator in 2023, a Java application which enables the user to create keyboard-shortcuts for mouse and keyboard automation anywhere onscreen.
(<a href="https://github.com/AlxV07/ActionAutomator">ActionAutomator GitHub</a>, <a href="https://youtu.be/poQeJenrsMs">Showcase YouTube Video</a>)</li>
<li>I developed my FRC robotics team's scouting software which went to the World Championships in 2024.</li>
<li>I co-taught the programming section in a STEM summer camp for underprivileged youths in 2023.</li>
<li>I built a web application to automatically format evidence for my debate club.
(<a href="https://alxv07.github.io/NCFCAAutoEvidencer/">NCFCAAutoEvidencer</a>)</li>
</ul>
</section>
<section id="activities">
<h2>Activities:</h2>
<ul>
<li><a href="https://www.usaco.org/index.php"> USACO</a>: USA Computing Olympiad - (2023-Present)</li>
<li><a href="https://ncfca.org/">NCFCA Christian Speech & Debate</a>: National Christian Forensics and Communications Association - (2023-Present)</li>
<li><a href="https://www.firstinspires.org/robotics/ftc">FTC</a>: FIRST Tech Competition - (2021-2022)</li>
<li><a href="https://www.firstinspires.org/robotics/frc">FRC</a>: FIRST Robotics Competition - (2022-2023)</li>
<li>CAHA Competitive Travel Ice Hockey: Anaheim Ice Dogs 14u AA - (2021-2022)</li>
<li>JVarsity Ice Hockey: Highland Park - (2023-2024)</li>
</ul>
</section>
<section id="connect">
<h2>Connect:</h2>
<ul>
<li>Email: alexander.kai.chen@gmail.com</li>
<li><a href="https://www.linkedin.com/in/alexander-chen-504893267" target="_blank">LinkedIn: https://www.linkedin.com/in/alexander-chen-504893267</a></li>
<li><a href="https://github.com/AlxV07" target="_blank">GitHub: https://github.com/AlxV07</a></li>
<li><a href="https://www.youtube.com/@alxv07" target="_blank">YouTube: https://www.youtube.com/@alxv07</a></li>
<li><a href="https://docs.google.com/forms/d/e/1FAIpQLSeCp0pHn4PBhSSaxS0olWIBtHkAVXpJC_5Br3N9dEqeZQi7Zw/viewform?usp=sf_link" target="_blank">Pass Me A Note! (Google Form)</a></li>
<li><a href="https://www.chess.com/member/alxv07u" target="_blank">chess.com: https://www.chess.com/member/alxv07u</a></li>
<li>Discord: @alxv07</li>
</ul>
</section>
<section id="blog">
<h2>Blog:</h2>
<section class="blog-post">
<h3>Posts come out irregularly; there might be one soon...</h3>
What's been posted so far:
<br><br>
<a href="#blog/usaco-gold-obtained">03/02/2025 - Promoting To USACO Gold Division</a><br><br>
<a href="#blog/flint-qualifier2025-tourney">01/22/2025 - Results @ Flint 2025 Qualifier</a><br><br>
<a href="#blog/ps-ftc1">01/09/2025 - Similarities Between Prefix Sums & The 1st Fundamental Theorem of Calculus</a><br><br>
<a href="#blog/onlinefall2024-tourney">12/31/2024 - Results @ Fall 2024 National Mixer</a><br><br>
<a href="#blog/first-internship">11/01/2024 - My First Internship</a><br><br>
<a href="#blog/utd-ml-vs-xai">09/15/2024 - Studying ML vs. XAI @ UTD ALPS Lab</a><br><br>
<a href="#blog/presummer-24-update">05/24/2024 - PreSummer Update</a><br><br>
<a href="#blog/ncfca-regionals-24">05/07/2024 - Strong Conclusion @ Farmers Branch Regional Championship</a><br><br>
<a href="#blog/ncfca-ft-worth-24">03/20/2024 - 17/61 @ Ft. Worth National Mixer</a><br><br>
<a href="#blog/rebranding-5-to-7">01/30/2024 - I Rebranded (5->7)</a><br><br>
<a href="#blog/first-post">01/29/2024 - First Blog Post :D</a><br><br>
</section>
<br>
<!-- Add here -->
<section class="blog-post" id="blog/usaco-gold-obtained">
<br><a class="blog-post-header" href="#blog/usaco-gold-obtained">03/02/2025 - Promoting To USACO Gold Division</a><br><br>
<div>
Last year I promoted to Silver in my first USACO contest as a high school freshman; this February, I promoted to Gold.
<br><br>
I scored 733/1000 in the Feb. 2025 USACO contest, placing 578 out of the 2451 pre-college competitors
world-wide competing in the silver division. I solved problems 1 and 2 completely and wrote a partial solution
for problem 3, pulling together enough points to advance.
<br><br>
This contest was quite a ride.
In preparation for competing in the Silver division, I started learning C++.
Previously, I had only used Python in CP, but as speed became more critical in higher divisions, Python needed to be replaced.
By the February contest I knew enough C++ to write full solutions, but I still stuck with Python to start the contest
(since it's much quicker to write, more readable, and I was more used to writing code in it).
<br><br>
In-contest... I solved problem 1 with a correct Python solution, and moved on to begin working on problem 2.
After brainstorming, pseudo-coding, and testing a solution, I implemented it in Python and submitted it to the grader.
Just a couple test cases were missed, due to time-limit-exceeded.
I was confused for a bit as I tried to figure out how I could optimize my solution; I had written one
that should have had a good enough time complexity to pass the test cases.
After struggling for a little more, I gave up and moved on to tackle problem 3, hoping to come back to it later.
<br><br>
Coming back after implementing my partial solution for problem 3, it finally clicked to me that perhaps
I had the right solution, but it was just Python which was too slow.
It was unlikely (this had only happened a few times in my practice before the official contests and the problems were
written to try to guarantee proper support for all languages), but I knew I might as well give the idea a shot.
Quickly, I translated my Python solution line-by-line into C++.
I submitted the program.
The same testcases solved by my Python solution turned green.
Then finally, I saw the rest of the test-cases pass successfully too.
These last couple test-cases gave me enough points to make the cutoff and advance.
<br><br>
USACO has been an extremely valuable part of my CS education, and I'm looking forward
to continuing my studies in more advanced topics while shooting for USACO Platinum!
<br><br>
Also, as a side-quest I reached 3000 in puzzle rating on chess.com :D
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/USACOFebruary2025Advancement.png" alt="USACO February 2025 Results" style="width: 75%">
</div>
</div>
</section>
<br>
<section class="blog-post" id="blog/flint-qualifier2025-tourney">
<br><a class="blog-post-header" href="#blog/flint-qualifier2025-tourney">01/22/2025 - Results @ Flint 2025 Qualifier</a><br><br>
<div>
Last week was amazing in Flint, TX, for our first region qualifier in NCFCA this year.
<br><br>
My partner and I advanced to semifinals, and placed 4th out of the 24 competing team policy teams.
I placed 7th overall Team Policy speaker.
I also placed 11th overall in the Persuasive speech category, and 16th in the Apologetics category;
it was my first time competing in both categories.
<br><br>
This tourney was a great experience, and we're excited to see how the year continues!
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/LiamAlexFlint.png" alt="Alex & Liam @ Flint" style="width: 75%">
</div>
</div>
</section>
<br>
<section class="blog-post" id="blog/ps-ftc1">
<br><a class="blog-post-header" href="#blog/ps-ftc1">01/09/2025 - Similarities Between Prefix Sums & The 1st Fundamental Theorem of Calculus</a><br><br>
<div>
I'm taking AP Calculus AB+BC this year, and recently I studied the 1st Fundamental Theorem of Calculus:
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ftc1-definition.png" alt="ftc1-definition" style="width: 75%">
</div>
<br><br>
This theorem felt surprisingly familiar to me when I first learned it. I realized it was because I had
studied the same idea in computer science, when I learned how to use prefix sum arrays.
<br><br>
The FTC-1 can be explained in words as: to find the area under a function's curve (i.e. sum of values) from
`a` to `b` is the area under the curve from `0` to `b` minus the area under the curve from `0` to `a`.
<br><br>
This idea of finding the sum of a range by computing the sum of a larger range and then
subtracting the "extra" range at the start is the same utilized by prefix sums. Here are two visualizations
to demonstrate the correlation between the FTC-1 & prefix sums (also explained below).
<br><br>
Say we have a function `f(x)`, graphed as such:
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ftc1-a.png" alt="ftc1-a" style="width: 65%">
</div>
<br><br>
And we wanted to find the area under the curve from `x = 1` to `x = 2`.
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ftc1-d.png" alt="ftc1-d" style="width: 65%">
</div>
<br><br>
We can find this area using the FTC-1. First, we find the area from `x = 0` to `x = b, i.e. 2`; this is `F(b)`
(`F(x)` is the anti-derivative of `f(x)`):
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ftc1-b.png" alt="ftc1-b" style="width: 65%">
</div>
<br><br>
Then we find the area from `x = 0` to `x = a i.e. 1`; this value is `F(a)`:
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ftc1-c.png" alt="ftc1-c" style="width: 65%">
</div>
<br><br>
We can now simply subtract these two areas (subtract blue from green, i.e. `F(b) - F(a)`) to achieve the desired area:
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ftc1-e.png" alt="ftc1-e" style="width: 65%">
</div>
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ftc1-d.png" alt="ftc1-d" style="width: 65%">
</div>
<br><br>
This concept is exactly the same as that used by prefix sums. Let's say we have 1-based index array defined below,
and wanted to, repeatedly, find the sum of values in a range. For example, let's say the values from
index 2 to index 5 (inclusive):
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ps-c.png" alt="ps-c" style="width: 55%">
</div>
<br><br>
We could, for every query, naively iterate through the target range and sum up all the values, but this
approach's runtime is `O(N * Q), where N = len(array) & Q = nof queries`. We can speed this up to `O(Q)` using
prefix arrays. Let's examine a formula to represent the sum of a range:
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ps-a.png" alt="ps-a" style="width: 55%">
</div>
<br><br>
Using this observation, and the same concept of the FTC-1, we can pre-compute what's called the "prefix array":
an array, where the value at index `i` is the sum of all the values from the start of the original array
to the value at `i` (inclusive). Here's what the prefix array of our example array would look like:
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ps-e.png" alt="ps-e" style="width: 55%">
</div>
<br><br>
Using this prefix array, we can easily perform a subtraction of the sum of the "overarching" range and the
"extra" range which isn't in our target range. From the above formula, we can now compute the sum of our target
range in `O(1)` time. Here's the formula, which is very similar to the one of FTC-1:
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ps-b.png" alt="ps-b" style="width: 55%">
</div>
<br><br>
Now, for example, for our range from index 2 to index 5, we can simply perform the following to find our desired sum:
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/ps-ftc/ps-d.png" alt="ps-d" style="width: 55%">
</div>
<br><br>
This is a cool cross-over I found and wanted to share while studying the two fields of computer science and mathematics,
showing how interconnected they are and the shared underlying concepts beneath them.
<br><br>
Acknowledgements:
<br>
Ms. Henderson (NCSSM); my Calculus teacher for teaching me the 1st Fundamental Theorem of Calculus.
<br>
Desmos; used to draw graphs for the FTC-1 visualization.
<br>
USACO Guide; for the prefix sum visualization.
</div>
</section>
<br>
<section class="blog-post" id="blog/onlinefall2024-tourney">
<br><a class="blog-post-header" href="#blog/onlinefall2024-tourney">12/31/2024 - Results @ Fall 2024 National Mixer</a><br><br>
<div>
Liam O'Connors (my partner this year) and I have gotten off to a strong start this year's team policy debate season.
At the first online tournament, we made it to elimination rounds, placing 21st out of ~80 teams.
I also placed as the second overall team policy speaker.
<br><br>
The debate resolution for this year focuses on U.S. foreign policy towards Central America, targeting
important issues like migration, smuggling, and corruption.
<br><br>
This'll be a fun second year in NCFCA for me, and I'm looking forward to competing more!
<div style="display: flex; justify-content: center; padding-top: 15px">
<img src="imgs/onlinefall2024_2ndtpspeaker.png" alt="2nd TP Speaker Certificate" style="width: 45%">
<img src="imgs/onlinefall2024_21sttpteam.png" alt="21st TP Team Certificate" style="width: 45%">
</div>
</div>
</section>
<br>
<section class="blog-post" id="blog/first-internship">
<br><a class="blog-post-header" href="#blog/first-internship">11/01/2024 - My First Internship</a><br><br>
<div>
I'm excited to announce I've accepted an internship offer as an
Enterprise Technology Software Engineer @ State Farm for the summer of 2025!
<br><br>
A huge thanks to the people who've helped me along the way: to Dr. Veerasamy &
Professor Gupta @ UTDallas for recommendations & guidance in my CS education,
and especially to my parents for the encouragement and advice.
<br><br>
This is the first summer internship I've taken, and I'm thrilled for this opportunity
to start my journey in the industry!
<br><br>
<div style="display: flex; justify-content: center; padding-top: 10px">
<img src="imgs/statefarm.png" alt="State Farm" style="width: 30%">
</div>
</div>
</section>
<br>
<section class="blog-post" id="blog/utd-ml-vs-xai">
<br><a class="blog-post-header" href="#blog/utd-ml-vs-xai">09/15/2024 - Studying ML vs. XAI @ UTD ALPS Lab</a><br><br>
<div>
“While at a conference a few weeks back, I spent an interesting evening with a grain of salt.”
This was one of many nonsensical phrases posted by the user “Mark V. Shaney” on Usenet in the 1980s.
Many readers thought Mark was a deranged person, but he was actually a program designed by Rob Pike.
Pike’s program was an early form of AI which “learned” to construct sentences by calculating which
words often went together in text. Decades later, more sophisticated AI programs like ChatGPT have emerged.
With exponentially larger datasets and more powerful computing resources, these programs are far more capable.
Today’s chatbots can easily fool readers with extremely human-like responses. However, AI programs still
make errors reminiscent of Mark V. Shaney. For example, when asked on September 11th about the date of the
Trump v. Harris presidential debate, ChatGPT responded, “The Trump vs. Harris debate you’re referring to
took place on September 17, 2024.” Why do such advanced programs like ChatGPT still make mistakes like
this? The reason is because they lack reasoning.
<br><br>
The flaw lies in the “machine learning” approach this type of AI follows. It attempts to build and adjust
mathematical functions to model training data and then apply these functions to the given task.
Conceptually, this approach is the same as that which Mark V. Shaney followed. Mark used a Markov chain
to model which words often went together in sentences and then generated new sentences from that information.
The process involves no reasoning; it is purely statistics and cannot be explained. We humans do not guess
at conclusions by using mathematical functions; we deduce conclusions using logic and reason. When we
reason, we understand why our conclusions are valid. Machine learning doesn’t reason, and this lack of
reason raises serious concerns about the reliability of its output. How can we trust a program if we’re
not able to explain what it produces?
<br><br>
A plausible solution lies in “explainable AI” (XAI) which, instead of relying on statistics, models
reasoning directly. This summer, I studied at the UT Dallas Applied Logic & Programming Systems (ALPS)
Lab where we explored how the human thought process could be formalized using the logic programming
language Prolog. By representing knowledge as programmatic facts and rules in Prolog, we could model
an explainable decision process. XAI utilizes this approach: instead of mathematical functions,
XAI uses logic to actually derive conclusions. With this AI, one can actually see the program’s
“thought process”, the facts and rules the program followed to derive its conclusion. XAI has the
potential to be utilized in the construction of much more powerful AI programs.
<br><br>
XAI is already used in practice together with machine learning. “Reliable chatbots” use LLMs to
extract facts which are then passed to an XAI to “understand”. The XAI backend keeps chatbots
in check from hallucinating while correctly answering requests. Professor Gopal Gupta, who leads
the UT Dallas ALPS Lab, presented the “FOLD-SE” algorithm which generates rule sets for XAI to perform
tabular classification tasks, offering an explainable alternative to pure machine learning classification.
Another ongoing project “Rules as Code”, by Jason Morris, aims to use XAI to automate law and legal
services. XAI overcomes the “black-box barrier” of machine learning, opening the door to reliable
automation of decision-making tasks. Prolog programs appeared around the same time as Markov chains,
and we’ve already seen how the latter has grown with modern advancement.
If Mark V. Shaney could grow into ChatGPT, what could advancement in XAI lead to?
<br><br>
Sources:
<br>
Mark V. Shaney: https://en.wikipedia.org/wiki/Mark_V._Shaney
<br>
General XAI: https://en.wikipedia.org/wiki/Explainable_artificial_intelligence
<br>
FOLD-SE: https://arxiv.org/abs/2208.07912
<br>
Rules As Code: https://law.mit.edu/pub/blawxrulesascodedemonstration/release/1
<br>
<br>
<div style="display: flex; justify-content: center;">
<img src="imgs/utd_alps_2024.png" alt="ALPS 2024 Completion Certificate" style="width: 70%">
</div>
</div>
</section>
<br>
<section class="blog-post" id="blog/presummer-24-update">
<br><a class="blog-post-header" href="#blog/presummer-24-update">05/24/2024 - PreSummer Update</a><br><br>
<div>
Just an update post for my upcoming summer plans! With AP testing done and school finishing up, I'll be moving into
a pretty busy break.
<br><br>
I'll be attending the Applied Logic programming intensive in-person at the University of Texas at Dallas next month,
and following that I'll also be partaking in InspiritAI online. I've started back up with my Coursera ed
and have also started training for the upcoming USACO season.
<br><br>
This year's debate season is over, but the resolutions for next year are already out; we'll be preparing for it
over the summer too. I'm also going to be taking Latin 1B over the summer in preparation for Latin 2 next school year.
I also recently broke 1600 rapid rating on chess.com. We'll be heading to Edmonton in July for the Brick Invitational Hockey Tournament,
where my sister will be playing for the Western Selects.
<br><br>
That's a little bit of what's going on with me for now; I'll probably update this page again later when something interesting happens ;)
</div>
</section>
<br>
<section class="blog-post" id="blog/ncfca-regionals-24">
<br><a class="blog-post-header" href="#blog/ncfca-regionals-24">05/07/2024 - Strong Conclusion @ Farmers Branch Regional Championship</a><br><br>
<div>
Last week I competed in the NCFCA Region 11 Regional Championship tournament, the last of my season.
Again, it was an amazing experience. We debated the best of the best this tournament, and it was really fun overall.
We finished with a record of 3-3 (we never had a losing record this year!), getting close to breaking into Regional elimination rounds.
<br><br>
This is my partner's last year in NCFCA, and I want to thank him for everything; literally couldn't have done it without him!
<br><br>
<div style="display: flex; justify-content: center;">
<img src="imgs/willi_alx_dbu.jpg" alt="William Kuykendall & Alexander Chen @ DBU 2024" style="width: 70%">
</div>
<br>
<div style="display: flex; justify-content: center;">
(William Kuykendall & Alexander Chen @ DBU 2024)
</div>
<br>
It's been a blessing to have such a fruitful first year, and I can't wait for what's to come!
</div>
</section>
<br>
<section class="blog-post" id="blog/ncfca-ft-worth-24">
<br><a class="blog-post-header" href="#blog/ncfca-ft-worth-24">03/20/2024 - 17/61 @ Ft. Worth National Mixer</a><br><br>
<div>
This past week I've been in Ft. Worth competing in the NCFCA National Mixer hosted there this year.
It was a great experience; my partner and I competed against some of the best teams in our region
whilst also getting to debate teams from other regions as well. We advanced to elimination rounds
again but were eliminated in Double-Octofinals.
<br><br>
Even still, it was a great tournament overall - I've developed a lot and have learned a ton since my
last tournament. Both my partner and I were awarded 30 speaker points in separate rounds (the maximum
number of points available) for the first time! It was such a great experience to debate against
everyone at Ft. Worth - we really enjoyed it, and we're looking forward to the tournaments in the future!
</div>
</section>
<br>
<section class="blog-post" id="blog/rebranding-5-to-7">
<br><a class="blog-post-header" href="#blog/rebranding-5-to-7">01/30/2024 - I Rebranded (5->7)</a><br><br>
<div>
Kind of note-worthy news! I changed one character in my username everywhere!
From "AlxV05" to "AlxV07", links & profiles which could be updated have been updated. Why?
It goes back to why I have my username in the first place.
<br><br>
I first found out I needed my own username ~5 years ago (10 yrs old) while making
some random account I don't have access to anymore. I came up with
"Alx" quick enough, decided I liked version numbers so added the "V0" soon after,
and finally I just had to choose the last character. 5 sounded cool ("al-ks-vee-oh-five").
Nothing special about 5; just sounded cool.
<br><br>
Well I'm mature now ;) and I'd prefer to have my markers have more meaning than just
it "sounding cool". So I looked at my username: Alx still fits; three-char compact
name-like tags are always nice to have around. Second part: the version identifier - I
think I'll keep it, I'm getting updated :D So that means I need to choose a number greater
than 5. 7's the only single-digit number greater than 0 that has two syllables (unique).
I'm also Catholic, and the number 7 symbolises some significant topics: perfection, the
7 days of creation, the 7 cardinal virtues, and many more references from the Bible.
<br><br>
After updating everything it feels kinda nice. It's always good to have a switch-up
every now and then (as long as it isn't too drastic nor does it cause any problems).
Well, I guess till next time. Bye!
</div>
</section>
<br>
<section class="blog-post" id="blog/first-post">
<br><a class="blog-post-header" href="#blog/first-post">01/29/2024 - First Blog Post :D</a><br><br>
<div>
Hello! This is my first blog post (Yay!) What does one do with a blog?
I'm not entirely sure, but I think I'm supposed to post about things that
have been happening. So here are some normal things I've been up to recently:
<ul>
<li>Training on USACO Silver division problems</li>
<li>Started Andrew Ng's Machine Learning Coursera course w/ DeepLearning.AI & Stanford Online</li>
<li>Had some fun with robotics friends developing their scouting application</li>
<li>Programmed a full-functional String Trie for my UCSD String Algorithms course I'm taking</li>
</ul>
I think another purpose of having a blog is so that one can share whatever one feels like
sharing at a moments notice with whoever would care to read that one person's blog. I think
every now and then people have that sort of inspiration, but I have yet to experience that.
<br><br>
Ah well, if anything interesting happens I might update this page with a post for that
(I also usually post note-worthy events on my LinkedIn page, so if this page doesn't change for a
while I might have just forgotten to post here as well (but if there isn't anything
new on my LinkedIn then I'm probably just not doing anything note-worthy ;-;)).
<br><br>
But that's it for now, bye!
</div>
</section>
<br>
</section>
<footer>
© 2025 Alexander Chen
</footer>
<script src="script.js"></script>
</body>
</html>