Skip to content

Commit abe9843

Browse files
committed
UI improvements
1 parent 45cda4e commit abe9843

3 files changed

Lines changed: 14 additions & 13 deletions

File tree

css/blog.css

Lines changed: 3 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -85,8 +85,6 @@
8585
justify-content: space-between;
8686
margin-top: .5rem;
8787
margin-bottom: .5rem;
88-
/* space between entries */
89-
padding-bottom: .2rem;
9088
}
9189

9290
.dark-mode .post-entry {
@@ -95,7 +93,6 @@
9593

9694
.post-title {
9795
flex: 1;
98-
font-size: 1.2rem;
9996
color: var(--link-color, #0055aa);
10097
text-decoration: none;
10198
}
@@ -123,7 +120,7 @@
123120
font-size: 0.85rem;
124121
border: none;
125122
padding: 0.05rem 0.5rem;
126-
margin: 0.2rem 0.2rem 0.2rem 0.2rem;
123+
margin: 0.5rem 0.2rem 0.2rem 0.2rem;
127124
border-radius: 100px;
128125
}
129126

@@ -150,7 +147,8 @@
150147
background: #ffffff;
151148
color: #222;
152149
border-radius: 15px;
153-
transition: border 0.3s, box-shadow 0.3s;
150+
border: 1px;
151+
margin-bottom: 1rem;
154152
}
155153

156154
#search-box:focus {

posts/entries/random.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -11,19 +11,19 @@ While reading the Wikipedia article about metric spaces just now, it was talking
1111
These are not really on the topic, what I want to say today is about the essential part of a linear transformation, and I figured out the proof and purpose just after looking over it in terms of domains and codomains. What I understand here is that
1212

1313
$$
14-
A x = A(\proj{\ran A^{*}}x + ( x - \proj{\ran A^{*}}x ) ) = A \proj{\ran A^{*}} x
14+
A x = A(\proj{\ran A^*}x + ( x - \proj{\ran A^*}x ) ) = A \proj{\ran A^*} x
1515
$$
1616

1717
just like doing an orthogonal decomposition on $x$, that
1818

1919
$$
20-
x - \proj{\ran A^{*}}x \in (\ran A^{*})^{\perp} = \ker A
20+
x - \proj{\ran A^*}x \in (\ran A^*)^{\perp} = \ker A
2121
$$
2222

2323
so that
2424

2525
$$
26-
A(x - \proj{\ran A^{*}}x) = 0
26+
A(x - \proj{\ran A^*}x) = 0
2727
$$
2828

2929
thus it restricts the vectors in the transformation by removing the ones in $\ker A$, and changing $A$ to $\tilde{A}$ just further restricts the domain because now there's only input from $\ran A^*$.

projects/metadata.json

Lines changed: 8 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,17 +1,20 @@
11
[
22
{
3-
"title": "Personal Blog Site",
3+
"title": "Robin's Site",
44
"link": "https://github.com/localhost433/localhost433.github.io",
5-
"tech": "HTML, CSS, JavaScript"
5+
"tech": "HTML, CSS, JavaScript",
6+
"description": "This site!"
67
},
78
{
89
"title": "Semantic Search Engine",
910
"link": "https://github.com/localhost433/FAISS",
10-
"tech": "Python, FAISS, Sentence Transformers"
11+
"tech": "Python, FAISS, Sentence Transformers",
12+
"description": "A semantic search engine (with interface) that uses FAISS and Sentence Transformers to index and search through trained indices."
1113
},
1214
{
1315
"title": "Prime Factorization Game",
14-
"link": "https://github.com/localhost433/prime-factorization-game",
15-
"tech": "HTML, CSS, JavaScript"
16+
"link": "https://localhost433.github.io/Prime-Factorization-Game/",
17+
"tech": "HTML, CSS, JavaScript",
18+
"description": "A simple web game about prime factorization."
1619
}
1720
]

0 commit comments

Comments
 (0)