<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Eren Darici on eren darici</title><link>https://erendarici.com/</link><description>Recent content in Eren Darici on eren darici</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 24 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://erendarici.com/index.xml" rel="self" type="application/rss+xml"/><item><title>What I Listened To This Week (10/5 - 10/24)</title><link>https://erendarici.com/blog/wilttw-105-1024-2026/</link><pubDate>Sat, 24 Oct 2026 00:00:00 +0000</pubDate><guid>https://erendarici.com/blog/wilttw-105-1024-2026/</guid><description>&lt;p&gt;As I mentioned in my last post, I knew that it was going to be a crazy few weeks, and it was. So instead of &amp;ldquo;What I Listened to This Week,&amp;rdquo; I present to you &amp;ldquo;What I Listened to Over the Past 20 Days&amp;rdquo;. On the other hand, I&amp;rsquo;m glad that I wasn&amp;rsquo;t able to write because I was able to listen to a bunch of new releases along with some of my favorites.&lt;/p&gt;</description></item><item><title>What I Listened To This Week? (9/28 - 10/4)</title><link>https://erendarici.com/blog/wilttw-928-104-2026/</link><pubDate>Sun, 04 Oct 2026 00:00:00 +0000</pubDate><guid>https://erendarici.com/blog/wilttw-928-104-2026/</guid><description>&lt;p&gt;I used to do this type of content on Substack (no, I won&amp;rsquo;t be linking it in here), but now that I have my name as my domain, I think it makes more sense to do it here. I will try to keep this weekly, but I can&amp;rsquo;t promise that I will be able to do it every week. For those who don&amp;rsquo;t know, &amp;ldquo;What I Listened to This Week?&amp;rdquo; is a weekly post where I share the music I listened to during the week as a way to keep log of my experiences and force myself to discover new music -obviously I need content.&lt;/p&gt;</description></item><item><title>Agalar, Brolar, ve Asklarim</title><link>https://erendarici.com/asklar/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://erendarici.com/asklar/</guid><description>&lt;p&gt;Hepinizi seviom adinizi unuttuysam mesaj atin.&lt;/p&gt;&#10;&lt;div class="highlight"&gt;&lt;pre tabindex="0" class="chroma"&gt;&lt;code class="language-text" data-lang="text"&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; *** ***&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;***** *****&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt;***********&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; *********&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; *******&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; *****&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; ***&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; *&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;h3 id="ismail-mert-etil-md---canimkarim"&gt;Ismail Mert Etil M.D. - canimkarim&lt;/h3&gt;&#10;&lt;div class="highlight"&gt;&lt;pre tabindex="0" class="chroma"&gt;&lt;code class="language-text" data-lang="text"&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; .-. .-.&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; ( `.&amp;#39; )&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; \ /&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; \ M+E /&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; \ /&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; \ /&#10;&lt;/span&gt;&lt;/span&gt;&lt;span class="line"&gt;&lt;span class="cl"&gt; v&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;h3 id="ezgi-konanc---kardeshim"&gt;Ezgi Konanc - kardeshim&lt;/h3&gt;&#10;&lt;h3 id="idil-okten---kebabo"&gt;Idil Okten - kebabo&lt;/h3&gt;</description></item><item><title>Curriculum Vitae</title><link>https://erendarici.com/resume/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://erendarici.com/resume/</guid><description>&lt;h2 id="contact"&gt;Contact&lt;/h2&gt;&#10;&lt;p&gt;&lt;strong&gt;Eren Darici&lt;/strong&gt;&lt;br&gt;&#10;Ph.D. Student, Industrial Engineering&lt;br&gt;&#10;Western Michigan University&lt;/p&gt;&#10;&lt;p&gt;Email: &lt;a href="mailto:hello@erendarici.com" rel="noopener external"&gt;hello@erendarici.com&lt;/a&gt; or &lt;a href="mailto:eren.darc@wmich.edu" rel="noopener external"&gt;eren.darc@wmich.edu&lt;/a&gt;&lt;/p&gt;&#10;&lt;hr&gt;&#10;&lt;h2 id="research-interests"&gt;Research Interests&lt;/h2&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;Operations Research / Mathematical Optimization&lt;/li&gt;&#10;&lt;li&gt;Machine Learning&lt;/li&gt;&#10;&lt;li&gt;Simulation Modeling&lt;/li&gt;&#10;&lt;li&gt;Decision Support Systems&lt;/li&gt;&#10;&lt;li&gt;AI Applications in Industrial Engineering&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;hr&gt;&#10;&lt;h2 id="education"&gt;Education&lt;/h2&gt;&#10;&lt;h3 id="western-michigan-university"&gt;Western Michigan University&lt;/h3&gt;&#10;&lt;p&gt;&lt;strong&gt;Ph.D., Industrial Engineering&lt;/strong&gt; (2025–Present)&lt;br&gt;&#10;GPA: 3.92/4.00&lt;/p&gt;&#10;&lt;h3 id="western-michigan-university-1"&gt;Western Michigan University&lt;/h3&gt;&#10;&lt;p&gt;&lt;strong&gt;M.Sc., Industrial Engineering&lt;/strong&gt; (2023–2025)&lt;br&gt;&#10;GPA: 4.00/4.00&lt;/p&gt;&#10;&lt;p&gt;Thesis: &lt;em&gt;Optimization of the Room Booking Processes in a Nonprofit Organization&lt;/em&gt;&lt;/p&gt;&#10;&lt;h3 id="eskisehir-technical-university"&gt;Eskisehir Technical University&lt;/h3&gt;&#10;&lt;p&gt;&lt;strong&gt;B.Sc., Industrial Engineering&lt;/strong&gt; (2019–2023)&lt;/p&gt;</description></item><item><title>Get in Touch</title><link>https://erendarici.com/contact/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://erendarici.com/contact/</guid><description>&lt;p&gt;If you&amp;rsquo;d like to get in touch, feel free to reach out by email or connect with me through the links below.&lt;/p&gt;&#10;&lt;p&gt;&lt;strong&gt;Personal Email:&lt;/strong&gt; &lt;a href="mailto:hello@erendarici.com" rel="noopener external"&gt;hello@erendarici.com&lt;/a&gt;&lt;/p&gt;&#10;&lt;p&gt;&lt;strong&gt;WMU Email:&lt;/strong&gt; &lt;a href="mailto:eren.darc@wmich.edu" rel="noopener external"&gt;eren.darc@wmich.edu&lt;/a&gt;&lt;/p&gt;&#10;&lt;h3 id="socials"&gt;Socials&lt;/h3&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;a href="https://www.linkedin.com/in/eren-darici" rel="noopener external"&gt;LinkedIn&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://github.com/eren-darici" rel="noopener external"&gt;GitHub&lt;/a&gt;&lt;/li&gt;&#10;&lt;li&gt;&lt;a href="https://orcid.org/0009-0000-3608-5550" rel="noopener external"&gt;ORCID&lt;/a&gt;&lt;/li&gt;&#10;&lt;/ul&gt;</description></item><item><title>Lab 1 - Introduction to Mathematical Modeling</title><link>https://erendarici.com/teaching/spring2026/iee3110/materials/lab1/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://erendarici.com/teaching/spring2026/iee3110/materials/lab1/</guid><description>&lt;h3 id="1-introduction-to-operations-research-modeling"&gt;1. Introduction to Operations Research Modeling&lt;/h3&gt;&#10;&lt;p&gt;Operations Research (OR) is a scientific approach to decision-making using mathematical models.&lt;/p&gt;&#10;&lt;p&gt;A typical OR model consists of:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&lt;strong&gt;Decision variables&lt;/strong&gt; → what we control (e.g. production quantity)&lt;/li&gt;&#10;&lt;li&gt;&lt;strong&gt;Objective function&lt;/strong&gt; → what we optimize (profit, cost, service level)&lt;/li&gt;&#10;&lt;li&gt;&lt;strong&gt;Constraints&lt;/strong&gt; → limitations (resources, demand, capacity)&lt;/li&gt;&#10;&lt;li&gt;&lt;strong&gt;Parameters&lt;/strong&gt; → fixed input data&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;h4 id="the-or-modeling-cycle"&gt;The OR modeling cycle&lt;/h4&gt;&#10;&lt;ol&gt;&#10;&lt;li&gt;Define the problem&lt;/li&gt;&#10;&lt;li&gt;Build a mathematical model&lt;/li&gt;&#10;&lt;li&gt;Solve using an algorithm/solver&lt;/li&gt;&#10;&lt;li&gt;Interpret results and validate&lt;/li&gt;&#10;&lt;/ol&gt;&#10;&lt;img class="course-figure" src="https://images.squarespace-cdn.com/content/v1/5e59eefe0e4624584d852c64/520a4c63-7147-4df4-a200-a75120740b2d/OR-diagram-e1586897929559.jpg" alt="Operations Research overview diagram"&gt;&#10;&lt;hr&gt;&#10;&lt;h3 id="3-model-vs-language-vs-solver"&gt;3. Model vs. Language vs. Solver&lt;/h3&gt;&#10;&lt;h4 id="mathematical-model-abstract"&gt;Mathematical Model (Abstract)&lt;/h4&gt;&#10;&lt;p&gt;The mathematical formulation:&lt;/p&gt;</description></item><item><title>Lab 2 - Mathematical Programming Examples</title><link>https://erendarici.com/teaching/spring2026/iee3110/materials/lab2/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://erendarici.com/teaching/spring2026/iee3110/materials/lab2/</guid><description>&lt;h3 id="1-introduction"&gt;1. Introduction&lt;/h3&gt;&#10;&lt;p&gt;This lab introduces additional mathematical programming examples and demonstrates how optimization models can be formulated in both &lt;strong&gt;open form&lt;/strong&gt; (explicit equations) and &lt;strong&gt;closed form&lt;/strong&gt; (set-based notation).&lt;/p&gt;&#10;&lt;p&gt;Topics covered include:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;Cake Production Problem&lt;/li&gt;&#10;&lt;li&gt;Diet Problem&lt;/li&gt;&#10;&lt;li&gt;Dorian Auto Advertising Problem&lt;/li&gt;&#10;&lt;li&gt;Indexed decision variables in PuLP&lt;/li&gt;&#10;&lt;li&gt;Summation notation using &lt;code&gt;lpSum&lt;/code&gt;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;hr&gt;&#10;&lt;h3 id="2-cake-production-problem"&gt;2. Cake Production Problem&lt;/h3&gt;&#10;&lt;p&gt;A bakery produces two types of cakes:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;&#10;&lt;p&gt;Plain cake:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;200g flour&lt;/li&gt;&#10;&lt;li&gt;25g fat&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;/li&gt;&#10;&lt;li&gt;&#10;&lt;p&gt;Chocolate cake:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;100g flour&lt;/li&gt;&#10;&lt;li&gt;50g fat&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;p&gt;Available resources:&lt;/p&gt;</description></item><item><title>Lab 3 - Assignment and Transportation Problems</title><link>https://erendarici.com/teaching/spring2026/iee3110/materials/lab3/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://erendarici.com/teaching/spring2026/iee3110/materials/lab3/</guid><description>&lt;h3 id="1-introduction"&gt;1. Introduction&lt;/h3&gt;&#10;&lt;p&gt;This lab introduces transportation and assignment problems, two important classes of optimization models.&lt;/p&gt;&#10;&lt;p&gt;Topics covered include:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;Transportation Problems&lt;/li&gt;&#10;&lt;li&gt;Assignment Problems&lt;/li&gt;&#10;&lt;li&gt;Powerco Transportation Example&lt;/li&gt;&#10;&lt;li&gt;Decision Variables with &lt;code&gt;LpVariable.dicts()&lt;/code&gt;&lt;/li&gt;&#10;&lt;li&gt;Useful Pandas Concepts for Optimization&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;hr&gt;&#10;&lt;h3 id="2-recap-transportation-and-assignment-problems"&gt;2. Recap: Transportation and Assignment Problems&lt;/h3&gt;&#10;&lt;p&gt;The &lt;strong&gt;Assignment Problem&lt;/strong&gt; is a special case of the &lt;strong&gt;Transportation Problem&lt;/strong&gt;.&lt;/p&gt;&#10;&lt;p&gt;Key characteristics:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;Assignment problems typically have many zero-valued technical coefficients, allowing specialized solution methods.&lt;/li&gt;&#10;&lt;li&gt;Transportation problems represent a &lt;strong&gt;many-to-many (m:n) matching problem&lt;/strong&gt;.&lt;/li&gt;&#10;&lt;li&gt;They are modeled as &lt;strong&gt;bipartite networks&lt;/strong&gt; connecting sources and destinations.&lt;/li&gt;&#10;&lt;li&gt;Common applications involve shipping products from factories to customers or regions.&lt;/li&gt;&#10;&lt;li&gt;The objective is usually to &lt;strong&gt;minimize total transportation cost&lt;/strong&gt; while satisfying supply and demand requirements.&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;hr&gt;&#10;&lt;h3 id="3-transportation-problem-closed-form-model"&gt;3. Transportation Problem: Closed Form Model&lt;/h3&gt;&#10;&lt;h4 id="decision-variables"&gt;Decision Variables&lt;/h4&gt;&#10;$$&#10;x_{ij} = \text{amount shipped from source } i \text{ to destination } j&#10;$$&lt;h4 id="parameters"&gt;Parameters&lt;/h4&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;$c_{ij}$ = transportation cost from source $i$ to destination $j$&lt;/li&gt;&#10;&lt;li&gt;$s_i$ = supply available at source $i$&lt;/li&gt;&#10;&lt;li&gt;$d_j$ = demand required at destination $j$&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;hr&gt;&#10;&lt;h4 id="objective-function"&gt;Objective Function&lt;/h4&gt;&#10;$$&#10;\min \sum_i \sum_j c_{ij}x_{ij}&#10;$$&lt;h4 id="constraints"&gt;Constraints&lt;/h4&gt;&#10;&lt;h5 id="supply-constraints"&gt;Supply Constraints&lt;/h5&gt;&#10;$$&#10;\sum_j x_{ij} \le s_i&#10;\qquad \forall i&#10;$$&lt;h5 id="demand-constraints"&gt;Demand Constraints&lt;/h5&gt;&#10;$$&#10;\sum_i x_{ij} \ge d_j&#10;\qquad \forall j&#10;$$&lt;h5 id="non-negativity"&gt;Non-negativity&lt;/h5&gt;&#10;$$&#10;x_{ij} \ge 0&#10;\qquad \forall i,j&#10;$$&lt;hr&gt;&#10;&lt;h3 id="4-powerco-transportation-problem"&gt;4. Powerco Transportation Problem&lt;/h3&gt;&#10;&lt;p&gt;Powerco operates three electric power plants that supply electricity to four cities.&lt;/p&gt;</description></item><item><title>Lab 4 - Assignment Problems and Shortest Path</title><link>https://erendarici.com/teaching/spring2026/iee3110/materials/lab4/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://erendarici.com/teaching/spring2026/iee3110/materials/lab4/</guid><description>&lt;h3 id="1-introduction"&gt;1. Introduction&lt;/h3&gt;&#10;&lt;p&gt;This lab introduces two important network optimization models:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;Assignment Problems&lt;/li&gt;&#10;&lt;li&gt;Shortest Path Problems&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;p&gt;Topics covered include:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;Machineco Assignment Problem&lt;/li&gt;&#10;&lt;li&gt;Mathematical formulation of assignment problems&lt;/li&gt;&#10;&lt;li&gt;General shortest path model&lt;/li&gt;&#10;&lt;li&gt;Seervada Park shortest path example&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;hr&gt;&#10;&lt;h3 id="2-assignment-problem"&gt;2. Assignment Problem&lt;/h3&gt;&#10;&lt;p&gt;The assignment problem seeks to assign resources to tasks while minimizing cost or maximizing effectiveness.&lt;/p&gt;&#10;&lt;p&gt;Common applications include:&lt;/p&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;Assigning workers to jobs&lt;/li&gt;&#10;&lt;li&gt;Assigning machines to tasks&lt;/li&gt;&#10;&lt;li&gt;Assigning vehicles to routes&lt;/li&gt;&#10;&lt;li&gt;Assigning students to projects&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;p&gt;The assignment problem is a special case of the transportation problem where:&lt;/p&gt;</description></item><item><title>Open Source</title><link>https://erendarici.com/open-source/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://erendarici.com/open-source/</guid><description>&lt;p&gt;I build open-source tools at the intersection of software and music. Most of these projects explore audio processing, plugin development, and practical utilities for musicians.&lt;/p&gt;&#10;&lt;h2 id="spotify-keyfinder"&gt;Spotify Keyfinder&lt;/h2&gt;&#10;&lt;p&gt;&lt;strong&gt;Python · Flask · Spotify&lt;/strong&gt;&lt;/p&gt;&#10;&lt;p&gt;A web utility for retrieving information about the song currently playing on Spotify. The project uses Flask and the Spotify ecosystem and can be run locally.&lt;/p&gt;&#10;&lt;p&gt;&lt;a href="https://github.com/eren-darici/spotify-keyfinder" rel="noopener external"&gt;View Spotify Keyfinder on GitHub&lt;/a&gt;&lt;/p&gt;&#10;&lt;hr&gt;&#10;&lt;h2 id="saturator-plugin"&gt;Saturator Plugin&lt;/h2&gt;&#10;&lt;p&gt;&lt;strong&gt;C++ · JUCE · CMake · Audio DSP&lt;/strong&gt;&lt;/p&gt;</description></item><item><title>Webcam Archive</title><link>https://erendarici.com/webcam-archive/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://erendarici.com/webcam-archive/</guid><description>&lt;h3 id="october-27th-2026"&gt;October 27th, 2026&lt;/h3&gt;&#10;&lt;p&gt;&lt;img src="https://erendarici.com/images/webcams/10-27-2026.jpg" alt="October 27th, 2026" loading="lazy" decoding="async"&gt;&lt;/p&gt;&#10;&lt;h3 id="october-22th-2026"&gt;October 22th, 2026&lt;/h3&gt;&#10;&lt;p&gt;&lt;img src="https://erendarici.com/images/webcams/10-22-2026.png" alt="October 22nd, 2026" loading="lazy" decoding="async"&gt;&lt;/p&gt;&#10;&lt;h3 id="october-20th-2026"&gt;October 20th, 2026&lt;/h3&gt;&#10;&lt;div class="webcam-pair"&gt;&#10; &lt;img src="https://erendarici.com/images/webcams/10-20-2026-1.jpeg" alt="October 20th, 2026 webcam photo 1"&gt;&#10; &lt;img src="https://erendarici.com/images/webcams/10-20-2026-2.jpeg" alt="October 20th, 2026 webcam photo 2"&gt;&#10;&lt;/div&gt;&#10;&lt;h3 id="october-15th-2026"&gt;October 15th, 2026&lt;/h3&gt;&#10;&lt;p&gt;&lt;img src="https://erendarici.com/images/webcams/10-15-2026.png" alt="October 15th, 2026" loading="lazy" decoding="async"&gt;&lt;/p&gt;&#10;&lt;h3 id="october-14th-2026"&gt;October 14th, 2026&lt;/h3&gt;&#10;&lt;p&gt;&lt;img src="https://erendarici.com/images/webcams/10-14-2026.jpeg" alt="October 14th, 2026" loading="lazy" decoding="async"&gt;&lt;/p&gt;&#10;&lt;h3 id="september-30th-2026"&gt;September 30th, 2026&lt;/h3&gt;&#10;&lt;p&gt;&lt;img src="https://erendarici.com/images/webcams/09-30-2026.png" alt="September 30th, 2026" loading="lazy" decoding="async"&gt;&lt;/p&gt;&#10;&lt;h3 id="march-3rd-2026"&gt;March 3rd, 2026&lt;/h3&gt;&#10;&lt;p&gt;&lt;img src="https://erendarici.com/images/webcams/03-18-2026.png" alt="March 3rd, 2026" loading="lazy" decoding="async"&gt;&lt;/p&gt;&#10;&lt;h3 id="january-23rd-2026"&gt;January 23rd, 2026&lt;/h3&gt;&#10;&lt;p&gt;&lt;img src="https://erendarici.com/images/webcams/01-23-2026.png" alt="January 23rd, 2026" loading="lazy" decoding="async"&gt;&lt;/p&gt;</description></item></channel></rss>