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