Skip to content

Commit 8f12d1b

Browse files
committed
publication selection buttons
1 parent 35084c7 commit 8f12d1b

2 files changed

Lines changed: 31 additions & 23 deletions

File tree

_bibliography/papers.bib

Lines changed: 2 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -282,7 +282,7 @@ @inproceedings{guo2025castl
282282
abbr = {ICRA},
283283
preview = {castl.jpg}
284284
}
285-
@inproceedings{buynitsky2025wksp,
285+
@misc{buynitsky2025wksp,
286286
title = {Faster Behavior Cloning with Hardware-Accelerated Motion Planning},
287287
author = {Alexiy Buynitsky and Zachary Kingston},
288288
booktitle = {IEEE ICRA 2025 Workshop---RoboARCH: Robotics Acceleration with Computing Hardware and Systems},
@@ -292,19 +292,6 @@ @inproceedings{buynitsky2025wksp
292292
abbr = {WKSP},
293293
preview = {fast_bc.jpg}
294294
}
295-
@misc{coumar2025ascii,
296-
title = {Evaluating Machine Learning Approaches for {ASCII} Art Generation},
297-
author = {Sai Coumar and Zachary Kingston},
298-
abstract = {Generating structured ASCII art using computational techniques demands a careful interplay between aesthetic representation and computational precision, requiring models that can effectively translate visual information into symbolic text characters. Although Convolutional Neural Networks (CNNs) have shown promise in this domain, the comparative performance of deep learning architectures and classical machine learning methods remains unexplored. This paper explores the application of contemporary ML and DL methods to generate structured ASCII art, focusing on three key criteria: fidelity, character classification accuracy, and output quality. We investigate deep learning architectures, including Multilayer Perceptrons (MLPs), ResNet, and MobileNetV2, alongside classical approaches such as Random Forests, Support Vector Machines (SVMs) and k-Nearest Neighbors (k-NN), trained on an augmented synthetic dataset of ASCII characters. Our results show that complex neural network architectures often fall short in producing high-quality ASCII art, whereas classical machine learning classifiers, despite their simplicity, achieve performance similar to CNNs. Our findings highlight the strength of classical methods in bridging model simplicity with output quality, offering new insights into ASCII art synthesis and machine learning on image data with low dimensionality.},
299-
eprint = {2503.14375},
300-
archiveprefix = {arXiv},
301-
primaryclass = {cs.GR},
302-
year = 2025,
303-
pdf = {https://arxiv.org/abs/2503.14375},
304-
code = {https://github.com/saiccoumar/deep_ascii_converter},
305-
abbr = {ARXIV},
306-
preview = {ascii.jpg}
307-
}
308295
@inproceedings{liang2024ropras,
309296
title = {Scaling Long-Horizon Online {POMDP} Planning via Rapid State Space Sampling},
310297
author = {Yuanchu Liang* and Edward Kim* and Wil Thomason* and Zachary Kingston* and Hanna Kurniawati and Lydia E. Kavraki},
@@ -316,7 +303,7 @@ @inproceedings{liang2024ropras
316303
abbr = {ISRR},
317304
preview = {ropras_1.jpg}
318305
}
319-
@inproceedings{meng2024icra40,
306+
@misc{meng2024icra40,
320307
title = {Perception-aware Planning for Robotics: Challenges and Opportunities},
321308
author = {Qingxi Meng and Carlos Quintero-Peña and Zachary Kingston and Vaibhav Unhelkar and Lydia E. Kavraki},
322309
abstract = {In this work, we argue that new methods are needed to generate robot motion for navigation or manipulation while effectively achieving perception goals. We support our argument by conducting experiments with a simulated robot that must accomplish a primary task, such as manipulation or navigation, while concurrently monitoring an object in the environment. Our preliminary study demonstrates that a decoupled approach fails to achieve high success in either action-focused motion generation or perception goals, motivating further developments of approaches that holistically consider both goals.},

_pages/publications.md

Lines changed: 29 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -41,8 +41,8 @@ nav_order: 2
4141

4242
<div class="filter-buttons">
4343
<button class="filter-btn active" data-filter="all">All</button>
44-
<button class="filter-btn" data-filter="article">Journal Articles</button>
45-
<button class="filter-btn" data-filter="inproceedings">Conference Papers</button>
44+
<button class="filter-btn" data-filter="article">Journals</button>
45+
<button class="filter-btn" data-filter="inproceedings">Conferences</button>
4646
<button class="filter-btn" data-filter="misc">Preprints</button>
4747
</div>
4848

@@ -55,16 +55,13 @@ document.addEventListener('DOMContentLoaded', function() {
5555
const filterButtons = document.querySelectorAll('.filter-btn');
5656
const publicationEntries = document.querySelectorAll('.bibliography li');
5757

58-
// Extract entry type from BibTeX code block
5958
publicationEntries.forEach(function(entry) {
6059
const bibtexDiv = entry.querySelector('.bibtex code');
6160
if (bibtexDiv) {
6261
const bibtexText = bibtexDiv.textContent;
63-
// Extract the entry type (e.g., @article, @inproceedings, @misc)
6462
const typeMatch = bibtexText.match(/@(\w+)\s*\{/);
6563
if (typeMatch) {
6664
const entryType = typeMatch[1].toLowerCase();
67-
// Map entry types to filter categories
6865
if (entryType === 'article') {
6966
entry.setAttribute('data-type', 'article');
7067
} else if (entryType === 'inproceedings' || entryType === 'incollection' || entryType === 'inbook') {
@@ -78,18 +75,38 @@ document.addEventListener('DOMContentLoaded', function() {
7875
}
7976
});
8077

81-
// Handle filter button clicks
78+
function updateYearSections() {
79+
const yearHeaders = document.querySelectorAll('.publications h2.bibliography');
80+
yearHeaders.forEach(function(yearHeader) {
81+
let nextElement = yearHeader.nextElementSibling;
82+
let hasVisiblePublications = false;
83+
84+
if (nextElement && nextElement.tagName === 'OL' && nextElement.classList.contains('bibliography')) {
85+
const items = nextElement.querySelectorAll('li');
86+
items.forEach(function(item) {
87+
if (item.style.display !== 'none') {
88+
hasVisiblePublications = true;
89+
}
90+
});
91+
}
92+
93+
if (hasVisiblePublications) {
94+
yearHeader.style.display = '';
95+
} else {
96+
yearHeader.style.display = 'none';
97+
}
98+
});
99+
}
100+
82101
filterButtons.forEach(function(button) {
83102
button.addEventListener('click', function() {
84103
const filter = this.getAttribute('data-filter');
85104

86-
// Update active button
87105
filterButtons.forEach(function(btn) {
88106
btn.classList.remove('active');
89107
});
90108
this.classList.add('active');
91109

92-
// Filter entries
93110
publicationEntries.forEach(function(entry) {
94111
const entryType = entry.getAttribute('data-type');
95112
if (filter === 'all' || entryType === filter) {
@@ -98,7 +115,11 @@ document.addEventListener('DOMContentLoaded', function() {
98115
entry.style.display = 'none';
99116
}
100117
});
118+
119+
updateYearSections();
101120
});
102121
});
122+
123+
updateYearSections();
103124
});
104125
</script>

0 commit comments

Comments
 (0)