<link>https://pedram-ep.github.io/portfolio/</link></image><item><title>Solving College Admissions at Scale An Integer Programming Approach</h1> <article> <h1>Solving College Admissions at Scale An Integer Programming Approach</h1> <p>Sun, 12 Jul 2026 00:00:00 +0000</p> <p>A review and implementation on the paper “College admissions with ties and common quotas: Integer programming approach”. This project uses Pyomo framework to implement 9 different MILP formulations with College Admission problem, tested by generated data.</p> <p>Implementing mathematical optimization models to fairly assign students to colleges when traditional matching algorithms fail real-world complex scenatios like tied scores and shared capacity constraints.</p> <p><strong>Implementation of Sections 1-4</strong> from the paper <em>“College admissions with ties and common quotas: Integer programming approach”</em> by Kolos Csaba Ágoston, Péter Biró, Endre Kováts, Zsuzsanna Jankó.</p> <p><strong>Coursework for</strong>: Combinatorial Optimization and Network Analysis (Dr. Farnaz Hooshmand Khaligh)</p> <h2 id="problem-description">Problem Description</h2> <p>College admissions systems must match students to universities fairly while respecting preferences and constraints. The classic Gale-Shapley algorithm (1962) finds stable matchings efficiently—but it breaks down in real systems like Hungary’s, which have:</p> <ol> <li> <p><strong>Tied Scores</strong> (Ties): When multiple students have identical scores, how do you decide who gets admitted?</p> <ul> <li>Should all tied students be admitted, rejected, or decided by lottery?</li> <li>Different policies have different fairness properties</li> </ul> </li> <li> <p><strong>Shared Capacity Constraints</strong> (Common Quotas): Multiple universities may compete for shared resources (e.g., limited faculty or government-funded slots)</p> <ul> <li>Makes the problem NP-hard</li> <li>Cannot be solved by the greedy deferred-acceptance algorithm</li> </ul> </li> </ol> <p><strong>The Challenge</strong>: Design efficient integer programming (IP) formulations that handle these constraints and enable policy comparison.</p> <h2 id="implementations">Implementations</h2> <h3 id="dataset-generation">Dataset Generation</h3> <p>To test the later implemented models, we generate a random dataset of students, colleges, and applications. Students each have a score for each college, along with a list of preferences, and colleges have a upper quote for the number of students they can accept. The script <code>scripts/generate_datasets.py</code> uses the functions defined on <code>src/generator.py</code> to generates synthetic instances at three scales:</p> <ul> <li><strong>Small</strong>: 10 applicants, 5 colleges</li> <li><strong>Medium</strong>: 50 applicants, 20 colleges</li> <li><strong>Large</strong>: 1,000 applicants, 20 colleges</li> </ul> <p>There are two king of datasets, the strict datasets artificially avoids students having same rank for a college. The datasets are finally stored as <code>.json</code> files and they can be loaded using functions in <code>src/data_loaders.py</code>.</p> <p>The formulations are then compared based on:</p> <ul> <li>Solution quality (objective value)</li> <li>Computational time</li> <li>Stability guarantees</li> <li>Student satisfaction metrics</li> </ul> <h3 id="integer-programming-formulations">Integer Programming Formulations</h3> <p>Implemented twleve differen IP and MIP formulations with different constraints and objectives:</p> <ul> <li><strong>SO-BB</strong> (Student-Optimal Baïou-Balinski)</li> <li><strong>SO-NW-CUT</strong> and <strong>SO-NW-BIN-CUT</strong></li> <li><strong>MIN-CUT</strong> and <strong>MIN-BIN-CUT</strong></li> <li><strong>MSMR-CUT</strong> and <strong>MSMR-BIN-CUT</strong></li> <li><strong>MSMR-EF</strong></li> <li><strong>SO-H-NW-CUT</strong> and <strong>SO-H-NW-BIN-CUT</strong></li> <li><strong>SO-C-NW-CUT</strong> and <strong>SO-C-NW-BIN-CUT</strong></li> </ul> <p>These formulations are implemented as <code>pyomo</code> models, with a base function containing the basic variables, parameters, and constraints. Each formulation uses the base function and adds objective function, new variables and constraints to it. The full implementations are available in <code>src/models/</code> directory.</p> <p>Each formulation is solved using CPLEX (with fallback to open-source solvers).</p> <h2 id="results">Results</h2> <p>The final results show similar results as original paper. Since the dataset used for this project was much smaller due to computional limits, some values don’t have the exact proportions, but overall the solutions show similar results.</p> <p>The most important insights about policy trade-offs:</p> <ul> <li><strong>H-stability</strong> (Hungarian): Conservative acceptance, but guaranteed stability; fewer students matched</li> <li><strong>L-stability</strong> (Chilean): Maximizes admissions but violates capacity constraints; less stable</li> <li><strong>Lottery</strong> (Irish): Balances fairness and stability; randomness adds variance</li> </ul> <p>Computational times scale linearly for small/medium instances; large instances (1,000 applicants) remain solvable within reasonable timeframes using modern IP solvers, especially using binary models which have more variables and constraints, but need less time to find the solution.</p> <p>One other important result shows for finding a stable matching in large scale, even using student-pessimal methods will reach the same solutions, with possible little differents.</p> <h2 id="key-learnings">Key Learnings</h2> <p>Through this project, I developed deep understanding of:</p> <ol> <li> <p><strong>Combinatorial Optimization Theory</strong></p> <ul> <li>Matching algorithms and stability concepts</li> <li>NP-hard problem recognition and IP formulation strategies</li> <li>Trade-offs between solution quality and computational time</li> </ul> </li> <li> <p><strong>Integer Programming Modeling</strong></p> <ul> <li>Translating real constraints into mathematical formulations</li> <li>Model comparisons for the same problem with different objectives and constraints</li> <li>Using Pyomo and CPLEX in a large-scale project with multiple models</li> </ul> </li> <li> <p><strong>Software Engineering for Research</strong></p> <ul> <li>Designing modular programs for extensibility, instead of solely relying on Jupyter notebookes</li> <li>Writing a reproducubile dataset generation code using seed control and scripts</li> <li>Writing full documentation for both practitioners and researchers</li> </ul> </li> </ol> </article> <article> <h1>Advanced Programming Teaching Assistant Experience 2025 Spring</h1> <p>Wed, 13 Aug 2025 13:57:12 +0330</p> <p>Last semester, I had the honor of being present as one of the teaching assistants and supervisors of the “Advanced Programming” course of Dr. Qhatee and Dr. Behnam Yousefimehr.</p> <p>In this semester, we tried to improve the learning process of the students by making changes in the teaching structure of this course, including exercises, and preparing documents for all topics. We wrote more than 700 pages of documentation on working with Java and object-oriented programming, as well as some more advanced topics such as git, version control, data structures, and algorithms, so that the students both have a glimpse of their future lessons and are ready to program small but complete projects. In addition to these, we were able to prepare complete documentation and exercises for working with the MySQL database and Java ORM, Hibernate, so that we use these tools to the fullest in our end-of-semester project.</p> <p>In addition to the educational materials, we were able to hold 14 weekly and face-to-face workshops for 74 students of this course, and we were able to solve the problems of the taught topics and answer the students’ questions. The exercises were later corrected in an anatomical manner with the help of the teaching of the lesson assistants and were placed with textual feedback for the students. With the aim of reducing the cost of making mistakes in the learning process, we allowed children to learn from their mistakes and become better programmers as much as possible.</p> <p>We used a GitHub repository for the process of writing and polishing the documents, making the course material of this semester available, and ready to edit for anyone who needs it! You can access the repository through .</p> <p>Our goal is for the documents of this course to be reviewed and improved by the teaching assistants of that semester each year, and ultimately become a dynamic resource for the students of this course, and anyone who wants to learn Java and object-oriented programming.</p> <p>I would like to thank the professors of this course, Dr. Mehdi Ghatee and Dr. Behnam Yousefimehr, for giving us the opportunity to do all of these. I am also grateful to the last year’s teaching assistants for helping us with our planning, especially Parsa Khadem and Sina Moradi, who were always present and we could get advice from them wherever we had problems. But all of this would not have been possible without our team, and in the last semester, a team of 20 undergraduate students was involved in this process, and without their efforts, none of these tasks would have been done. I would like to thank Arman Hosseini, Amir Mohammad Zaker, Amin Rezaeimehr, Ilya Asadi, Parya Ashabi, Sam Ghorbani, Sania Ezzati, Shahabuddin Garevani, Saleh Mollazadeh, Ali Tofighi, Fatemeh Vaziri, Kiana Pahlavan, Kiana Razavi, Mohammad Hossein Hashemi, Mohammadreza Sheikholeslami, Mehdi Jafari, Nastaran Afsari, Hooman Hamidipour, and Younes Kazemi for all their hard work this semester.</p> </article> <article> <h1>DAI DAY 2025</h1> <p>Sun, 09 Feb 2025 05:24:12 +0330</p> <p>We proudly passed the second event of the Artificial Intelligence and Data Mining Day of Amirkabir University of Technology (DAI-DAY 2025)!</p> <p> <figure > <div class="flex justify-center "> <div class="w-full" > </div> </div></figure> </p> <p>This scientific gathering was a unique opportunity for interaction between students, professors, and experts in the field of artificial intelligence and data mining. As the secretary of the Student Scientific Association of Mathematics and Computer Science and one of head executive managers of this event, I sincerely thank all the dear ones who attended this event, gave speeches, shared their valuable experiences, and participated in scientific discussions. We are also grateful to the hardworking executive team and sponsor of the event, Datin Company, who were by our side to make this event the best possible event.</p> <p>Hoping for more scientific events and broader interaction between the university and industry!</p> <p> <figure > <div class="flex justify-center "> <div class="w-full" > </div> </div></figure> <figure > <div class="flex justify-center "> <div class="w-full" > </div> </div></figure> <figure > <div class="flex justify-center "> <div class="w-full" > </div> </div></figure> </p> </article> <article> <h1>Analysis and Classification of NF-ToN-IoT-V2 Dataset</h1> <p>Wed, 01 Jan 2025 00:00:00 +0000</p> </article> <article> <h1>Comparison of UMAP Variants for Dimension Reduction</h1> <p>Wed, 01 Jan 2025 00:00:00 +0000</p> </article> <article> <h1>Graph Clustering and Link Prediction</h1> <p>Wed, 01 Jan 2025 00:00:00 +0000</p> </article> <article> <h1>Learning Neural Networks</h1> <p>Wed, 01 Jan 2025 00:00:00 +0000</p> <p>A collection of all projects and mini-projects I’ve developed in the field of neural networks. These projects were done with the goal of gaining more knowledge in the neural networks field, starting from MLP and moving towards more complex neural networks, eventually focusing on deep learning models such as CNNs and GNNs.</p> </article> <article> <h1>Patch-based Image Denoising via Higher Order SVD</h1> <p>Wed, 01 Jan 2025 00:00:00 +0000</p> <p>A near complete implementation of the method in the paper “Image Denoising using the Higher Order Singular Value Decomposition”. This project uses the Python language and vast libraries to apply this algorithm for grayscale images, and evaluates it by applying the method on the dataset “CBSD68” and calculating different image-difference scores.</p> <hr> <p>This project a Python implementation of patch-based image denoising using Higher Order Singular Value Decomposition (HOSVD), based on the method introduced in:</p> <blockquote class="border-l-4 border-neutral-300 dark:border-neutral-600 pl-4 italic text-neutral-600 dark:text-neutral-400 my-6"> <p><strong>“Image Denoising using the Higher Order Singular Value Decomposition”</strong><br> Ajit Rajwade, Anand Rangarajan, and Arunava Banerjee.<br> <em>IEEE Transactions on Pattern Analysis and Machine Intelligence</em>, 2013.</p> </blockquote> <p align="center"> </p> <hr> <h2 id="methodology">Methodology</h2> <p>The algorithm works by:</p> <ol> <li>Partitioning images into overlapping 8×8 patches</li> <li>Grouping similar patches using spiral window search</li> <li>Constructing 3D tensors for each patch group</li> <li>Applying HOSVD decomposition</li> <li>Thresholding core tensor values (hard threshold at τ = σ√(s²K))</li> <li>Reconstructing denoised patches</li> <li>Aggregating patches with averaging</li> </ol> <p><em>Note: Implementation is optimized for grayscale images and omits the Wiener filtering step from the original paper</em></p> <h2 id="evaluation-metrics">Evaluation Metrics</h2> <p>We used seven metrics to evaluate denoising performance on the CBSD68 dataset:</p> <table> <thead> <tr> <th>Metric</th> <th>Formula</th> <th>Description</th> <th>Ideal Value</th> </tr> </thead> <tbody> <tr> <td><strong>MSE</strong></td> <td>$\frac{1}{MN}\sum_{i=0}^{M-1}\sum_{j=0}^{N-1}[I(i,j)-K(i,j)]^2$</td> <td>Mean Squared Error</td> <td>Lower is better</td> </tr> <tr> <td><strong>RMSE</strong></td> <td>$\sqrt{\text{MSE}}$</td> <td>Root Mean Squared Error</td> <td>Lower is better</td> </tr> <tr> <td><strong>MAE</strong></td> <td>$\frac{1}{MN}\sum_{i=0}^{M-1}\sum_{j=0}^{N-1}\|I(i,j)-K(i,j)\|$</td> <td>Mean Absolute Error</td> <td>Lower is better</td> </tr> <tr> <td><strong>PSNR</strong></td> <td>$10 \cdot \log_{10}\left(\frac{L^2_{\max}}{\text{MSE}}\right)$</td> <td>Peak Signal-to-Noise Ratio</td> <td>Higher is better</td> </tr> <tr> <td><strong>SSIM</strong></td> <td>$\frac{(2\mu_x\mu_y + c_1)(2\sigma_{xy} + c_2)}{(\mu_x^2 + \mu_y^2 + c_1)(\sigma_x^2 + \sigma_y^2 + c_2)}$</td> <td>Structural Similarity Index</td> <td>Closer to 1</td> </tr> <tr> <td><strong>NRMSE</strong></td> <td>$\frac{\sqrt{\frac{1}{N}\sum_{i=1}^N(x_i - y_i)^2}}{\text{median}(\|x\|)}$</td> <td>Normalized RMSE</td> <td>Lower is better</td> </tr> <tr> <td><strong>UQI</strong></td> <td>$\frac{4\sigma_{xy}\bar{x}\bar{y}}{(\sigma_x^2 + \sigma_y^2)(\bar{x}^2 + \bar{y}^2)}$</td> <td>Universal Quality Index</td> <td>Closer to 1</td> </tr> </tbody> </table> <h2 id="references">References</h2> <ol> <li>Rajwade, A., Rangarajan, A., & Banerjee, A. (2013). “<em>Image Denoising using the Higher Order Singular Value Decomposition</em>”.</li> <li>Feschet, F. (2019). “<em>Implementation of a denoising algorithm based on High‑Order Singular Value Decomposition of tensors</em>”</li> <li>Guo, J., Chen, H., Shen, Z., and Wang, Z. (2022). “<em>Image denoising based on global image similar patches searching and HOSVD to patches tensor</em>”</li> <li>Wang, Z., and Bovik, A. C. (2002). “<em>A universal image quality index</em>”</li> <li>Wang, Z., Bovik, A. C., Sheikh, H. R., and Simoncelli, E. P., “<em>Image quality assessment: From error visibility to structural similarity</em>”</li> <li>CBSD68‑dataset: Color BSD68 dataset for image denoising benchmarks. Available at: </li> </ol> </article> <article> <h1>Primal-Dual Calculator with GUI</h1> <p>Wed, 01 Jan 2025 00:00:00 +0000</p> </article> <article> <h1>Simple Clustering on News Articles Passage</h1> <p>Wed, 01 Jan 2025 00:00:00 +0000</p> </article> <article> <h1>Skip List Implementation</h1> <p>Wed, 01 Jan 2025 00:00:00 +0000</p> </article> <article> <h1>Khayyam Turing 1403</h1> <p>Fri, 20 Dec 2024 12:07:03 +0330</p> <p>Had the honor of serving as Co-Executive Head for Khayyam Turing 2024! 🎉 As the head of the 18th Student Scientific Chapter of AUT-MCS and one of two Co-Executive Heads of this event, I had the privilege of working with a team of over 50 passionate and dedicated students for several weeks. Bringing this annual event to life and witnessing more than 600 participants engage with the activities we organized was truly an unforgettable experience. A heartfelt thank you to everyone who participated, supported, or contributed to making this event a success. Your enthusiasm and engagement were the driving forces behind Khayyam Turing 2024’s success.</p> <p> <figure > <div class="flex justify-center "> <div class="w-full" > </div> </div></figure> <figure > <div class="flex justify-center "> <div class="w-full" > </div> </div></figure> </p> </article> <article> <h1>Example Talk: Recent Work</h1> <p>Mon, 01 Jan 2024 00:00:00 +0000</p>  <h1 id="example-talk">Example Talk</h1> <h3 id="dr-alex-johnson--meta-ai">Dr. Alex Johnson · Meta AI</h3> <hr> <h2 id="research-overview">Research Overview</h2> <ul> <li>Multimodal LLMs</li> <li>Efficient training</li> <li>Responsible AI</li> </ul> <hr> <h2 id="code--math">Code & Math</h2> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-python" data-lang="python"><span class="line"><span class="cl"><span class="k">def</span> <span class="nf">score</span><span class="p">(</span><span class="n">x</span><span class="p">:</span> <span class="nb">int</span><span class="p">)</span> <span class="o">-></span> <span class="nb">int</span><span class="p">:</span> </span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="n">x</span> <span class="o">*</span> <span class="n">x</span> </span></span></code></pre></div>$$ E = mc^2 $$<hr> <h2 id="dual-column-layout">Dual Column Layout</h2> <div class="r-hstack"> <div style="flex: 1; padding-right: 1rem;"> <h3 id="left-column">Left Column</h3> <ul> <li>Point A</li> <li>Point B</li> <li>Point C</li> </ul> </div> <div style="flex: 1; padding-left: 1rem;"> <h3 id="right-column">Right Column</h3> <ul> <li>Detail 1</li> <li>Detail 2</li> <li>Detail 3</li> </ul> </div> </div> <hr>  <div style="display: flex; gap: 2rem;"> <div style="flex: 2;"> <h3 id="main-content-23-width">Main Content (2/3 width)</h3> <p>This column takes up twice the space of the right column.</p> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-python" data-lang="python"><span class="line"><span class="cl"><span class="k">def</span> <span class="nf">example</span><span class="p">():</span> </span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="s2">"code works too"</span> </span></span></code></pre></div></div> <div style="flex: 1;"> <h3 id="sidebar-13-width">Sidebar (1/3 width)</h3> <blockquote class="border-l-4 border-neutral-300 dark:border-neutral-600 pl-4 italic text-neutral-600 dark:text-neutral-400 my-6"> <p><strong>Note</strong><br> Key points in smaller column</p> </blockquote> </div> </div> <hr> <h2 id="image--text-layout">Image + Text Layout</h2> <div class="r-hstack" style="align-items: center;"> <div style="flex: 1;"> <p> <figure > <div class="flex justify-center "> <div class="w-full" ></div> </div></figure> </p> </div> <div style="flex: 1; padding-left: 2rem;"> <h3 id="results">Results</h3> <ul> <li>95% accuracy</li> <li>10x faster inference</li> <li>Lower memory usage</li> </ul> <span class="fragment " > <strong>Breakthrough!</strong> </span> </div> </div> <hr> <h2 id="speaker-notes">Speaker Notes</h2> <p>Press <strong>S</strong> to open presenter view with notes!</p> <p>This slide has hidden speaker notes below.</p> <p>Note:</p> <ul> <li>This is a <strong>speaker note</strong> (only visible in presenter view)</li> <li>Press <code>S</code> key to open presenter console</li> <li>Perfect for remembering key talking points</li> <li>Can include reminders, timing, references</li> <li>Supports <strong>Markdown</strong> formatting too!</li> </ul> <hr> <h2 id="progressive-reveals">Progressive Reveals</h2> <p>Content appears step-by-step:</p> <span class="fragment " > First point appears </span> <span class="fragment " > Then the second point </span> <span class="fragment " > Finally the conclusion </span> <span class="fragment highlight-red" > This one can be <strong>highlighted</strong>! </span> <p>Note: Use fragments to control pacing and maintain audience attention. Each fragment appears on click.</p> <hr> <h2 id="diagrams-with-mermaid">Diagrams with Mermaid</h2> <div class="mermaid">graph LR A[Research Question] --> B{Hypothesis} B -->|Valid| C[Experiment] B -->|Invalid| D[Revise] C --> E[Analyze Data] E --> F{Significant?} F -->|Yes| G[Publish] F -->|No| D </div> <p>Perfect for: Workflows, architectures, processes</p> <p>Note: Mermaid diagrams are created from simple text. They’re version-controllable and edit anywhere!</p> <hr> <h2 id="research-results">Research Results</h2> <table> <thead> <tr> <th>Model</th> <th>Accuracy</th> <th>Speed</th> <th>Memory</th> </tr> </thead> <tbody> <tr> <td>Baseline</td> <td>87.3%</td> <td>1.0x</td> <td>2GB</td> </tr> <tr> <td>Ours (v1)</td> <td>92.1%</td> <td>1.5x</td> <td>1.8GB</td> </tr> <tr> <td><strong>Ours (v2)</strong></td> <td><strong>95.8%</strong></td> <td><strong>2.3x</strong></td> <td><strong>1.2GB</strong></td> </tr> </tbody> </table> <blockquote class="border-l-4 border-neutral-300 dark:border-neutral-600 pl-4 italic text-neutral-600 dark:text-neutral-400 my-6"> <p><strong>Key Finding:</strong> 8.5% improvement over baseline with 40% memory reduction</p> </blockquote> <p>Note: Tables are perfect for comparative results. Markdown tables are simple and version-control friendly.</p> <hr> <section data-noprocess data-shortcode-slide data-background-color="#1e3a8a" > <h2 id="custom-backgrounds">Custom Backgrounds</h2> <p>This slide has a <strong>blue background</strong>!</p> <p>You can customize:</p> <ul> <li>Background colors</li> <li>Background images</li> <li>Gradients</li> <li>Videos (yes, really!)</li> </ul> <p>Use <code>{{< slide background-color="#hex" >}}</code></p> <hr> <h2 id="vertical-navigation">Vertical Navigation</h2> <p><strong>There’s more content below! ⬇️</strong></p> <p>Press the <strong>Down Arrow</strong> to see substeps.</p> <p>Note: This demonstrates Reveal.js’s vertical slide feature. Great for optional details or deep dives.</p> <hr> <section data-noprocess data-shortcode-slide id="substep-1" > <h3 id="substep-1-details">Substep 1: Details</h3> <p>This is additional content in a vertical stack.</p> <p>Navigate down for more, or right to skip to next topic →</p> <hr> <section data-noprocess data-shortcode-slide id="substep-2" > <h3 id="substep-2-more-details">Substep 2: More Details</h3> <p>Even more detailed information.</p> <p>Press <strong>Up Arrow</strong> to go back, or <strong>Right Arrow</strong> to continue.</p> <hr> <h2 id="citations--quotes">Citations & Quotes</h2> <blockquote class="border-l-4 border-neutral-300 dark:border-neutral-600 pl-4 italic text-neutral-600 dark:text-neutral-400 my-6"> <p>“The best way to predict the future is to invent it.”</p> <p>— Alan Kay</p> </blockquote> <p>Or reference research:</p> <blockquote class="border-l-4 border-neutral-300 dark:border-neutral-600 pl-4 italic text-neutral-600 dark:text-neutral-400 my-6"> <p>Recent work by Smith et al. (2024) demonstrates that Markdown-based slides improve reproducibility by 78% compared to proprietary formats<sup id="fnref:1"><a href="#fn:1" class="footnote-ref" role="doc-noteref">1</a></sup>.</p> </blockquote> <hr> <h2 id="media-youtube-videos">Media: YouTube Videos</h2> <div style="position: relative; padding-bottom: 56.25%; height: 0; overflow: hidden;"> </div> <p>Note: Embed YouTube videos with just the video ID. Perfect for demos, tutorials, or interviews.</p> <hr> <h2 id="media-all-options">Media: All Options</h2> <p>Embed various media types with simple shortcodes:</p> <ul> <li><strong>YouTube</strong>: <code>{{< youtube VIDEO_ID >}}</code></li> <li><strong>Bilibili</strong>: <code>{{< bilibili id="BV1..." >}}</code></li> <li><strong>Local videos</strong>: <code>{{< video src="file.mp4" controls="yes" >}}</code></li> <li><strong>Audio</strong>: <code>{{< audio src="file.mp3" >}}</code></li> </ul> <p>Perfect for demos, interviews, tutorials, or podcasts!</p> <p>Note: All media types work seamlessly in slides. Just use the appropriate shortcode.</p> <hr> <h2 id="interactive-elements">Interactive Elements</h2> <p>Try these keyboard shortcuts:</p> <ul> <li><code>→</code> <code>←</code> : Navigate slides</li> <li><code>↓</code> <code>↑</code> : Vertical navigation</li> <li><code>S</code> : Speaker notes</li> <li><code>F</code> : Fullscreen</li> <li><code>O</code> : Overview mode</li> <li><code>/</code> : Search</li> <li><code>ESC</code> : Exit modes</li> </ul> <hr>  <h2 id="hidden-slide-demo-inline-comment">Hidden Slide Demo (Inline Comment)</h2> <p>This slide is hidden using the <code></code> comment method.</p> <p>Perfect for:</p> <ul> <li>Speaker-only content</li> <li>Backup slides</li> <li>Work-in-progress content</li> </ul> <p>Note: This slide won’t appear in the presentation but remains in source for reference.</p> <hr> <h2 id="thanks">Thanks</h2> <h3 id="questions">Questions?</h3> <ul> <li>🌐 Website: </li> <li>🐦 X/Twitter: </li> <li>💬 Discord: </li> <li>⭐ GitHub: </li> </ul> <p><strong>All slides created with Markdown</strong> • No vendor lock-in • Edit anywhere</p> <p>Note: Thank you for your attention! Feel free to reach out with questions or contributions.</p> <hr> <h2 id="-branding-your-slides">🎨 Branding Your Slides</h2> <p>Add your identity to every slide with simple configuration!</p> <p><strong>What you can add:</strong></p> <table> <thead> <tr> <th>Element</th> <th>Position Options</th> </tr> </thead> <tbody> <tr> <td>Logo</td> <td>top-left, top-right, bottom-left, bottom-right</td> </tr> <tr> <td>Title</td> <td>Same as above</td> </tr> <tr> <td>Author</td> <td>Same as above</td> </tr> <tr> <td>Footer Text</td> <td>Same + bottom-center</td> </tr> </tbody> </table> <p>Edit the <code>branding:</code> section in your slide’s front matter (top of file).</p> <hr> <h2 id="-adding-your-logo">📁 Adding Your Logo</h2> <ol> <li>Place your logo in <code>assets/media/</code> folder</li> <li>Use SVG format for best results (auto-adapts to any theme!)</li> <li>Add to front matter:</li> </ol> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-yaml" data-lang="yaml"><span class="line"><span class="cl"><span class="nt">branding</span><span class="p">:</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">logo</span><span class="p">:</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">filename</span><span class="p">:</span><span class="w"> </span><span class="s2">"your-logo.svg"</span><span class="w"> </span><span class="c"># Must be in assets/media/</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">position</span><span class="p">:</span><span class="w"> </span><span class="s2">"top-right"</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">width</span><span class="p">:</span><span class="w"> </span><span class="s2">"60px"</span><span class="w"> </span></span></span></code></pre></div><p><strong>Tip:</strong> SVGs with <code>fill="currentColor"</code> automatically match theme colors!</p> <hr> <h2 id="-title--author-overlays">📝 Title & Author Overlays</h2> <p>Show presentation title and/or author on every slide:</p> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-yaml" data-lang="yaml"><span class="line"><span class="cl"><span class="nt">branding</span><span class="p">:</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">title</span><span class="p">:</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">show</span><span class="p">:</span><span class="w"> </span><span class="kc">true</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">position</span><span class="p">:</span><span class="w"> </span><span class="s2">"bottom-left"</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">text</span><span class="p">:</span><span class="w"> </span><span class="s2">"Short Title"</span><span class="w"> </span><span class="c"># Optional: override long page title</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">author</span><span class="p">:</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">show</span><span class="p">:</span><span class="w"> </span><span class="kc">true</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">position</span><span class="p">:</span><span class="w"> </span><span class="s2">"bottom-right"</span><span class="w"> </span></span></span></code></pre></div><p>Author is auto-detected from page front matter (<code>author:</code> or <code>authors:</code>).</p> <hr> <h2 id="-footer-text">📄 Footer Text</h2> <p>Add copyright, conference name, or any persistent text:</p> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-yaml" data-lang="yaml"><span class="line"><span class="cl"><span class="nt">branding</span><span class="p">:</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">footer</span><span class="p">:</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">text</span><span class="p">:</span><span class="w"> </span><span class="s2">"© 2024 Your Name · ICML 2024"</span><span class="w"> </span></span></span><span class="line"><span class="cl"><span class="w"> </span><span class="nt">position</span><span class="p">:</span><span class="w"> </span><span class="s2">"bottom-center"</span><span class="w"> </span></span></span></code></pre></div><p><strong>Tip:</strong> Supports Markdown! Use <code>[Link](url)</code> for clickable links.</p> <hr>  <h2 id="-hiding-branding-per-slide">🔇 Hiding Branding Per-Slide</h2> <p>Sometimes you want a clean slide (title slides, full-screen images).</p> <p>Add this comment at the <strong>start</strong> of your slide content:</p> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-markdown" data-lang="markdown"><span class="line"><span class="cl"><span class="cm"></span> </span></span><span class="line"><span class="cl"><span class="gu">## My Clean Slide </span></span></span><span class="line"><span class="cl"> </span></span><span class="line"><span class="cl">Content here... </span></span></code></pre></div><p>☝️ <strong>This slide uses <code></code></strong> — notice no logo or overlays!</p> <hr>  <h2 id="-selective-hiding">🔇 Selective Hiding</h2> <p>Hide just the header (logo + title):</p> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-markdown" data-lang="markdown"><span class="line"><span class="cl"><span class="cm"></span> </span></span></code></pre></div><p>Or just the footer (author + footer text):</p> <div class="highlight"><pre tabindex="0" class="chroma"><code class="language-markdown" data-lang="markdown"><span class="line"><span class="cl"><span class="cm"></span> </span></span></code></pre></div><p>☝️ <strong>This slide uses <code></code></strong> — footer still visible below!</p> <hr>  <h2 id="-quick-reference">✅ Quick Reference</h2> <table> <thead> <tr> <th>Comment</th> <th>Hides</th> </tr> </thead> <tbody> <tr> <td><code></code></td> <td>Everything (logo, title, author, footer)</td> </tr> <tr> <td><code></code></td> <td>Logo + Title overlay</td> </tr> <tr> <td><code></code></td> <td>Author + Footer text</td> </tr> </tbody> </table> <p>☝️ <strong>This slide uses <code></code></strong> — logo still visible above!</p> <hr> <h2 id="-get-started">🚀 Get Started</h2> <ol> <li>Copy this example’s front matter as a starting point</li> <li>Replace logo with yours in <code>assets/media/</code></li> <li>Customize positions and text</li> <li>Use <code></code> for special slides</li> </ol> <p><strong>Pro tip:</strong> Set site-wide defaults in <code>config/_default/params.yaml</code> under <code>slides.branding</code>!</p> <div class="footnotes" role="doc-endnotes"> <hr> <ol> <li id="fn:1"> <p>Smith, J. et al. (2024). <em>Open Science Presentations</em>. Nature Methods. <a href="#fnref:1" class="footnote-backref" role="doc-backlink">↩︎</a></p> </li> </ol> </div> </article> <article> <h1>Experience</h1> <p>Tue, 24 Oct 2023 00:00:00 +0000</p> </article> </main></body></html>