<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Python on Miquel's Portfolio</title><link>https://miquelt9.github.io/portfolio/tags/python/</link><description>Recent content in Python on Miquel's Portfolio</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Tue, 21 Nov 2023 06:00:23 +0600</lastBuildDate><atom:link href="https://miquelt9.github.io/portfolio/tags/python/index.xml" rel="self" type="application/rss+xml"/><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>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>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></channel></rss>