<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Miquel's Portfolio</title><link>https://miquelt9.github.io/portfolio/</link><description>Recent content on Miquel's Portfolio</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Wed, 26 Aug 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://miquelt9.github.io/portfolio/index.xml" rel="self" type="application/rss+xml"/><item><title>Bingo Musical</title><link>https://miquelt9.github.io/portfolio/posts/personal/bingo-musical/</link><pubDate>Wed, 26 Aug 2026 00:00:00 +0000</pubDate><guid>https://miquelt9.github.io/portfolio/posts/personal/bingo-musical/</guid><description>&lt;h2 id="the-project"&gt;The project&lt;/h2&gt;
&lt;p&gt;Bingo Musical turns a playlist into printable bingo cards and a live host. Search a song, paste a YouTube playlist, or paste an Artist - Title list. Cards print from 3×3 to 6×6, and the host calls the next song. It runs in the browser.&lt;/p&gt;
&lt;br /&gt;
&lt;figure&gt;&lt;img src="https://miquelt9.github.io/portfolio/posts/personal/bingo-musical/editor.png"&gt;
&lt;/figure&gt;
&lt;p style="text-align: center;"&gt;Editor.&lt;/p&gt;
&lt;figure&gt;&lt;img src="https://miquelt9.github.io/portfolio/posts/personal/bingo-musical/cards.png"&gt;
&lt;/figure&gt;
&lt;p style="text-align: center;"&gt;Cards.&lt;/p&gt;
&lt;figure&gt;&lt;img src="https://miquelt9.github.io/portfolio/posts/personal/bingo-musical/host.png"&gt;
&lt;/figure&gt;
&lt;p style="text-align: center;"&gt;Host.&lt;/p&gt;
&lt;br /&gt;
&lt;h4 id="open-the-live-site"&gt;
&lt;a href="https://miquelt9.github.io/bingo-musical/" target="_blank" rel="noopener"&gt;Open the live site &lt;/a&gt;&lt;/h4&gt;
&lt;h4 id="project"&gt;
&lt;a href="https://github.com/miquelt9/bingo-musical" target="_blank" rel="noopener"&gt;Project&amp;rsquo;s code on Github &lt;i class="fab fa-github"&gt;&lt;/i&gt; &lt;/a&gt;&lt;/h4&gt;</description></item><item><title>Ecoforecast</title><link>https://miquelt9.github.io/portfolio/posts/competitions/ecoforecast/</link><pubDate>Tue, 21 Nov 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/ecoforecast/</guid><description>&lt;h2 id="the-challenge"&gt;The challenge&lt;/h2&gt;
&lt;p&gt;With increasing digitalisation and the growing on data servers, the significance of sustainable computing is on the rise. That&amp;rsquo;s why the task is to predict which will be the European country that will have the highest surplus of green energy in the following hour. Knowing this information can be critical to make important decisions in order to reduce CO2 emissions.
This
&lt;a href="https://nuwe.io/dev/competitions/schneider-electric-european-2023/ecoforecast-revolutionizing-green-energy-surplus-prediction-in-europe" target="_blank" rel="noopener"&gt;challenge&lt;/a&gt; was the problem of a Nuwe competition.&lt;/p&gt;</description></item><item><title>Junction 2023</title><link>https://miquelt9.github.io/portfolio/posts/competitions/junction2023/</link><pubDate>Sun, 12 Nov 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/junction2023/</guid><description>&lt;p&gt;Since I was in Finland for Erasmus, I decided it was a great opportunity to take part in a Hackathon there, and so I joined
&lt;a href="https://www.junction2023.com/" target="_blank" rel="noopener"&gt;Junction 2023&lt;/a&gt;.&lt;/p&gt;
&lt;h2 id="our-project"&gt;Our project&lt;/h2&gt;
&lt;p&gt;Because creating habits is really important, Bernat, René and me, re-imagined Huawei Health app to make it attractive and satisfying for young people to do sports daily and weekly via a quests system with which everyone can compete as well as cooperate in order to get the most points across your friends and get better deals in Huawei products.&lt;/p&gt;</description></item><item><title>Otaniemi Tracker Bot</title><link>https://miquelt9.github.io/portfolio/posts/personal/otaniemi-tracker-bot/</link><pubDate>Fri, 01 Sep 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/personal/otaniemi-tracker-bot/</guid><description>&lt;h2 id="the-project"&gt;The project&lt;/h2&gt;
&lt;p&gt;On the fall semester of 2023-2024 I went abroad at Aalto University, as a Erasmus+ student I needed some place to stay during the period I was in Helsinki. However, even though me and a friend manage to get a nice apartment, we soon find out that most of the apartments rented there didn&amp;rsquo;t have any furtniture and people brought their own. Unfortunately as exchange students we couldn&amp;rsquo;t just rent a van a bring our bed, table and chair from the other side of Europe.&lt;br&gt;
We quickly noticed that people there had a Telegram group in which they buy and sell their furniture and other stuff. That was the door to find a good oportunity to spend the fewer days as possible without (at least) a bed, but as day were passing most of the good deals were &amp;lsquo;dibsed&amp;rsquo; very fast (even in 1-2 seconds). &lt;br&gt;
That&amp;rsquo;s when I thought we needed something to increase our chances. And a bot was the solution, that&amp;rsquo;s why I decided to create a bot that was added to the buy/sell group, so you are able to set alarms for any keyword, so you can mute the main group (which has above 100 messages a day) and keep updated with the deals that get published via the bot.&lt;/p&gt;</description></item><item><title>λ-Calculus Telegram Bot</title><link>https://miquelt9.github.io/portfolio/posts/college/lambdacalculustelegrambot/</link><pubDate>Tue, 13 Jun 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/college/lambdacalculustelegrambot/</guid><description>&lt;h2 id="the-statement"&gt;The statement&lt;/h2&gt;
&lt;p&gt;The task was to build a lambda calculus interpreter. The interpreter also requiered to support the definition and use of macros. The interpreter had to run as a
&lt;a href="https://telegram.org/" target="_blank" rel="noopener"&gt;Telegram&lt;/a&gt; bot. It was needed that the bot could support sending the image of the tree interpratated, do ß-reductions and α-conversions.&lt;/p&gt;
&lt;p&gt;The full statement can be found below or in the following
&lt;a href="https://gebakx.github.io/lp-achurch-23/" target="_blank" rel="noopener"&gt;site&lt;/a&gt; (in Catalan).&lt;/p&gt;
&lt;embed src="lp-achurch-23-enunciat.pdf" width="100%" height="700" type="application/pdf"&gt;
&lt;br /&gt;
&lt;p&gt;More than a complex project this just requiered spending time on making sure all the requierements were added after understanding how λ calculus works. I also decided to add some more features such as multiple languages and toogle some of the features.&lt;/p&gt;</description></item><item><title>JBarcelona 2023</title><link>https://miquelt9.github.io/portfolio/posts/competitions/jobbarcelona2023/</link><pubDate>Sun, 23 Apr 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/jobbarcelona2023/</guid><description>&lt;h2 id="the-challenge"&gt;The challenge&lt;/h2&gt;
&lt;p&gt;This
&lt;a href="https://nuwe.io/dev/competitions/job-barcelona-23/jobarcelona-23-data-science" target="_blank" rel="noopener"&gt;challenge&lt;/a&gt; was the problem of a Nuwe competition. The goal of the challenge was to build a classification model which had to predict which costumers decide to end their contracts with the company we get the data from, so the percentage of people who stop being clients decreses by analyzing the reasons.&lt;/p&gt;
&lt;h2 id="the-approach"&gt;The approach&lt;/h2&gt;
&lt;p&gt;Since this was my first time building a model, I decided to start by looking at some guides and understand what had to exactly do the model. I manage to get something and predict some results, and it was really nice when I checked and turn out I had a f1-score of 0.9. Then I also tried some optimitzations which didn&amp;rsquo;t work, but that was enough to pass to the final.&lt;/p&gt;</description></item><item><title>HackUPC 2023</title><link>https://miquelt9.github.io/portfolio/posts/competitions/hackupc2023/</link><pubDate>Tue, 07 Feb 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/hackupc2023/</guid><description>&lt;h2 id="our-project"&gt;Our project&lt;/h2&gt;
&lt;p&gt;
&lt;a href="https://hackupc.com/" target="_blank" rel="noopener"&gt;HackUPC&lt;/a&gt; is the main yearly hackathon organized in my university. In 2023 was my first time attending on site.&lt;/p&gt;
&lt;p&gt;Me,
&lt;a href="https://github.com/AlexRG03" target="_blank" rel="noopener"&gt;AlexRG03&lt;/a&gt;,
&lt;a href="https://github.com/Martaw-code" target="_blank" rel="noopener"&gt;Martaw-code&lt;/a&gt; and
&lt;a href="https://github.com/Koldp/" target="_blank" rel="noopener"&gt;Koldp&lt;/a&gt; took part at the competition. We were very indecisive in terms of which challenge to go for, but in the end we decided to work in the HP challenge, in which we had to build a prediction model to forecast the supply chain inventory units of HP.
Because we wanted to get even more work we were also thinking about how to solve other challenges and even coding a bot that battled in a survival game between all other hackers.&lt;/p&gt;</description></item><item><title>Falcon Explorer</title><link>https://miquelt9.github.io/portfolio/posts/college/falconexplorer/</link><pubDate>Sun, 22 Jan 2023 06:00:14 +0200</pubDate><guid>https://miquelt9.github.io/portfolio/posts/college/falconexplorer/</guid><description>&lt;h2 id="the-statement"&gt;The statement&lt;/h2&gt;
&lt;p&gt;The
&lt;a href="https://www.fib.upc.edu/en/studies/bachelors-degrees/bachelor-degree-informatics-engineering/curriculum/syllabus/PROP" target="_blank" rel="noopener"&gt;PROP&lt;/a&gt; college subject asked us to create an application to manage documents using Java. The app must allow the user to create, read, write, modify, delete, import and export files in various formats. One of the key features of the app is the queries to allow the user to find documents based on multiple arguments.&lt;/p&gt;
&lt;p&gt;The full statement is in the document below (in Catalan).&lt;/p&gt;
&lt;embed src="enunciatProp.pdf" width="100%" height="700" type="application/pdf"&gt;
&lt;h2 id="our-approach"&gt;Our approach&lt;/h2&gt;
&lt;p&gt;Together with
&lt;a href="https://github.com/AleexHrB" target="_blank" rel="noopener"&gt;@AleexHrB&lt;/a&gt;,
&lt;a href="https://github.com/LlucCC" target="_blank" rel="noopener"&gt;@LlucCC&lt;/a&gt; and
&lt;a href="https://github.com/eZWALT" target="_blank" rel="noopener"&gt;@eZWALT&lt;/a&gt;, we made a case diagram to list all the features and functionalities our app had to have. One of the most important parts of it was the algorithms and a data structure we used. We ended up using the
&lt;a href="https://en.wikipedia.org/wiki/Ternary_search_tree" target="_blank" rel="noopener"&gt;Ternary Search Tree&lt;/a&gt; data structure to index all words contained in the documents and the
&lt;a href="https://en.wikipedia.org/wiki/Tf%E2%80%93idf" target="_blank" rel="noopener"&gt;term frequency–inverse document frequency&lt;/a&gt; algorithm also known as tf-idf to rank the importance of each word across the documents.&lt;/p&gt;</description></item><item><title>PDDL on Mars</title><link>https://miquelt9.github.io/portfolio/posts/college/planification/</link><pubDate>Sat, 14 Jan 2023 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/college/planification/</guid><description>&lt;h2 id="the-statement"&gt;The statement&lt;/h2&gt;
&lt;p&gt;In 2075, the first colonizers of Mars have established a network of bases throughout the geography of the planet. Moving between these bases is done by rovers that can move supplies and specialized personnel.&lt;/p&gt;
&lt;p&gt;We are in charge of planning the movements of the rovers from the base where they are parked, to pick up the supplies and personnel, to bring them in the requested place. We&amp;rsquo;ve been told that there are always more requests for supplies and personnel of those that can be used (life on Mars is very hard).&lt;/p&gt;</description></item><item><title>Knowledge Based Systems</title><link>https://miquelt9.github.io/portfolio/posts/college/knowledgebasedsystems/</link><pubDate>Mon, 19 Dec 2022 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/college/knowledgebasedsystems/</guid><description>&lt;h2 id="the-statement"&gt;The statement&lt;/h2&gt;
&lt;p&gt;In order to keep the older population in shape we had to build a program that recommends exercises and activities that are appropiate taking into account all factors of the individual and how may effect on the performance and goals.&lt;/p&gt;
&lt;p&gt;I.e.: given certain information about a person, we had to output an exercise plan suitable for him/her.&lt;/p&gt;
&lt;p&gt;The full statement is in the document below. Note that the statement is in Spanish.&lt;/p&gt;</description></item><item><title>Chips-Chips</title><link>https://miquelt9.github.io/portfolio/posts/competitions/funcions-numerables/</link><pubDate>Sun, 13 Nov 2022 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/funcions-numerables/</guid><description>&lt;h2 id="the-challenge"&gt;The challenge&lt;/h2&gt;
&lt;p&gt;The goal of this challenge was to minimize the average length of chains that connected pins in a chip, while also trying to minimize the standard deviation of the lengths of the different chains. This was a problem set by Qualcomm for the
&lt;a href="https://datathon.cat/2022/" target="_blank" rel="noopener"&gt;FME Datathon 2022&lt;/a&gt; which had the aim of minimizing the power loss across a chip.&lt;/p&gt;
&lt;h2 id="our-approach"&gt;Our approach&lt;/h2&gt;
&lt;p&gt;Together with
&lt;a href="https://github.com/paulaesquerra" target="_blank" rel="noopener"&gt;Paula&lt;/a&gt;,
&lt;a href="https://github.com/ruthilberry" target="_blank" rel="noopener"&gt;Ruth&lt;/a&gt;,
&lt;a href="https://github.com/AlexRG03" target="_blank" rel="noopener"&gt;Àlex&lt;/a&gt; and I, we decided to approach the problem by modelling it by considering a graph where the nodes are pins and the edges cables. We implemented 2 strategies:&lt;/p&gt;</description></item><item><title>Local Search</title><link>https://miquelt9.github.io/portfolio/posts/college/localsearch/</link><pubDate>Mon, 24 Oct 2022 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/college/localsearch/</guid><description>&lt;h2 id="the-statement"&gt;The statement&lt;/h2&gt;
&lt;p&gt;Given a set of power plants and clients, we had to optimize the profit. Power gets drained depending on the distance it needs to travel, clients don&amp;rsquo;t pay the same (not all of them are requiered to be served) and power plants costs depend on their size.&lt;/p&gt;
&lt;p&gt;To solve the problem, we were asked to use
&lt;a href="https://en.wikipedia.org/wiki/Hill_climbing" target="_blank" rel="noopener"&gt;Hill Climbing&lt;/a&gt; and
&lt;a href="https://en.wikipedia.org/wiki/Simulated_annealing" target="_blank" rel="noopener"&gt;Simulated Annealing&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;The full statement below (in Spanish).&lt;/p&gt;
&lt;embed src="PracticaBusqueda-local.pdf" width="100%" height="700" type="application/pdf"&gt;
&lt;h2 id="our-solution"&gt;Our solution&lt;/h2&gt;
&lt;p&gt;Together with
&lt;a href="https://github.com/JCasahuga" target="_blank" rel="noopener"&gt;@JCasahuga&lt;/a&gt; and
&lt;a href="https://github.com/XBLOYT" target="_blank" rel="noopener"&gt;@XBLOYT&lt;/a&gt;, we used
&lt;a href="https://github.com/aimacode/aima-java" target="_blank" rel="noopener"&gt;AIMA&lt;/a&gt; library and we determined the initial state, the operands as well as the heuristic function.&lt;/p&gt;</description></item><item><title>Google Hash Code 2022</title><link>https://miquelt9.github.io/portfolio/posts/competitions/hashcode2022/</link><pubDate>Thu, 24 Feb 2022 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/hashcode2022/</guid><description>&lt;p&gt;
&lt;a href="https://codingcompetitions.withgoogle.com/hashcode" target="_blank" rel="noopener"&gt;Google Hash Code&lt;/a&gt; is a team programming competition that lasts about 4 hours, in which a solution to multiple inputs of a problem must be given, points are given depending on how good it is. Not happy enought with the result we got during our last attempt at this competition we decided to try again.&lt;/p&gt;
&lt;h2 id="the-problem"&gt;The problem&lt;/h2&gt;
&lt;p&gt;In 2022 a list of contributors (with mastered skills) and a list of projects with different skill requirements were given. Contributors could improve their skills by completing projects and can mentor each other to work is roles in which they couldn&amp;rsquo;t succeed on their own. The task was to assign the contributors to project roles that fit them and maximize the score for completed projects.&lt;/p&gt;</description></item><item><title>Royal Hackaway v6</title><link>https://miquelt9.github.io/portfolio/posts/competitions/royalhackawayv6/</link><pubDate>Mon, 07 Feb 2022 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/royalhackawayv6/</guid><description>&lt;h2 id="our-project"&gt;Our project&lt;/h2&gt;
&lt;p&gt;When
&lt;a href="https://github.com/BernatBC" target="_blank" rel="noopener"&gt;@BernatBC&lt;/a&gt;,
&lt;a href="https://github.com/alexland7219" target="_blank" rel="noopener"&gt;@alexland7219&lt;/a&gt;,
&lt;a href="https://github.com/Loparc" target="_blank" rel="noopener"&gt;@Loparc&lt;/a&gt;, and I discovered that a shark plushies were one of the prizes of an clearly underated challenge, we realized that
the UK&amp;rsquo;s hackathons needed a way to optimally distribute the shark flushies across the country.&lt;/p&gt;
&lt;p&gt;Therefore, we develop a simulator that allows them to place the distribution centers and hackathons (and link them), as well as how many plushie vans you want and its capacity, and it will find a optimal route at the same time it satisfies the demand.&lt;/p&gt;</description></item><item><title>HackUPC 2021</title><link>https://miquelt9.github.io/portfolio/posts/competitions/hackupc2021/</link><pubDate>Sun, 16 May 2021 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/hackupc2021/</guid><description>&lt;!-- &lt;div style="position: relative; padding-bottom: 56.25%; height: 0; overflow: hidden;"&gt;
&lt;iframe allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share; fullscreen" loading="eager" referrerpolicy="strict-origin-when-cross-origin" src="https://www.youtube.com/embed/-AzCSZg9y1A?autoplay=0&amp;amp;controls=1&amp;amp;end=0&amp;amp;loop=0&amp;amp;mute=0&amp;amp;start=0" style="position: absolute; top: 0; left: 0; width: 100%; height: 100%; border:0;" title="YouTube video"&gt;&lt;/iframe&gt;
&lt;/div&gt;
--&gt;
&lt;br /&gt;
&lt;p&gt;
&lt;a href="https://hackupc.com/" target="_blank" rel="noopener"&gt;HackUPC&lt;/a&gt; is the main yearly hackathon organized in my university. In 2021 because of the pandemic we decided to take part from home.&lt;/p&gt;
&lt;h2 id="our-project"&gt;Our project&lt;/h2&gt;
&lt;p&gt;
&lt;a href="https://github.com/BernatBC" target="_blank" rel="noopener"&gt;@BernatBC&lt;/a&gt;,
&lt;a href="https://github.com/JCasahuga" target="_blank" rel="noopener"&gt;@JCasahuga&lt;/a&gt; and I went to it as 1st year students, it was indeed our first hackathon. We were there for fun and learning new things. That year, the project didn&amp;rsquo;t have to had a theme (even though later we found people tend to do one of the partners challenges). Without much knowledge we ended up creating a 2D game using Unity, given that two of us already had little experience and it was a great time learn how to develop further.&lt;/p&gt;</description></item><item><title>Google Hash Code 2021</title><link>https://miquelt9.github.io/portfolio/posts/competitions/hashcode2021/</link><pubDate>Thu, 25 Feb 2021 06:00:23 +0600</pubDate><guid>https://miquelt9.github.io/portfolio/posts/competitions/hashcode2021/</guid><description>&lt;p&gt;
&lt;a href="https://codingcompetitions.withgoogle.com/hashcode" target="_blank" rel="noopener"&gt;Google Hash Code&lt;/a&gt; is a team programming competition that lasts about 4 hours, in which a solution to multiple inputs of a problem must be given, points are given depending on how good it is.&lt;/p&gt;
&lt;h2 id="the-problem"&gt;The problem&lt;/h2&gt;
&lt;p&gt;In 2021 a city road network was given and planned paths for all cars in it, we had to optimize the schedule of traffic lights to minimize the total amount of time spent and help as many cars as possible reach their destination.&lt;/p&gt;</description></item></channel></rss>