<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Algorithm Design and Analysis  by U2005254 STUDENT</title>
      <link>https://padlet.com/u2005254/n46aadde2upfc5hp</link>
      <description>Brainstorming padlet for our project</description>
      <language>en-us</language>
      <pubDate>2022-06-23 16:27:10 UTC</pubDate>
      <lastBuildDate>2022-06-23 18:50:08 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>Library planned to be used</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229030277</link>
         <description><![CDATA[<div>1. <strong><em>request</em></strong><em> </em><br>To get the http request of text extracted from the articles using txtify.it api<br><br>2. <strong><em>bs4</em></strong> (beautiful soup 4)&nbsp;<br>To extract the content in particular tags of the html of the 3 websites containing stopwords, positive words and negative words.<br><br></div><div>3. <strong><em>plotly </em></strong><strong><br></strong>To visualize data in the form of meaningful graphs</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:28:20 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229030277</guid>
      </item>
      <item>
         <title>Algorithm planned to be used (String Matching)</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229034630</link>
         <description><![CDATA[<div>1. <del>KMP - Not doing pattern searching</del> <br>2. <del>Rabin-Karp <br></del>3. Trie - only one insertion is required and can be used infinitely for searching.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:35:17 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229034630</guid>
      </item>
      <item>
         <title>Brainstorming of solution</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229037369</link>
         <description><![CDATA[<div>Steps:<br><br></div><blockquote>1. Extract stopwords, positive words and negative words from the given website and create 3 Tries for each of them.<br>2. Initiate a loop to read each article while removing stopwords.<br>3. Create two lists for the positive words and negative words extracted to be stored in.<br>4. Calculate positivity for each country.<br>5. Plot graphs for the output <br>Types of graphs: Bar chart/ <del>Table/ Pie chart</del></blockquote>]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:39:12 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229037369</guid>
      </item>
      <item>
         <title>Library planned to be used</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229037569</link>
         <description><![CDATA[<div>1.<strong><em>pandas</em></strong></div><div>Pandas is used to extract data from dataset in the csv file given.</div><div>&nbsp; &nbsp;</div><div><strong><em>2.requests</em></strong></div><div>Requests is used to perform HTTP GET function to get the json text from the TomTom api.</div><div><br></div><div><strong><em>3.folium</em></strong></div><div>Folium to generate an interactive html map with markers and route.</div><div><br></div><div><strong><em>4. TomTom API</em></strong></div><div>TomTom API is a free, routing api to calculate the distance of the each route and get route line.</div><div><br><br></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:39:32 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229037569</guid>
      </item>
      <item>
         <title>Algorithm planned to be used</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229037687</link>
         <description><![CDATA[<div>1. <del>Christofides</del><br>2. <del>Lin Kernighan</del><br>3. 2-Opt - has lowest time complexity while giving a reasonable optimized route<br>4. <del>3-Opt</del><br>5. <del>Greedy (not accurate enough)</del></div>]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:39:43 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229037687</guid>
      </item>
      <item>
         <title>Brainstorming of solution</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229037845</link>
         <description><![CDATA[<div>Steps:<br><br></div><blockquote>1. Import local centers for each country from the dataset in the csv file given&nbsp;<br>2. Call TomTom API to get the distance and route from one location to another<br>3. Create a distance matrix from one location to all other locations for all locations<br>4. Find distribution centre as the most central located store (i.e shortest total distance)<br>5. Run 2-Opt algorithm to optimize the delivery route<br>6. Create Folium Map and Plot Markers for distribution centre and other local stores<br>7. Draw route lines with route data from TomTom Api</blockquote>]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:39:53 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229037845</guid>
      </item>
      <item>
         <title>Ooi J Sen</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229038223</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:40:28 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229038223</guid>
      </item>
      <item>
         <title>Loh Yuen Min</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229038561</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:40:53 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229038561</guid>
      </item>
      <item>
         <title>Tung Chun Xian</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229038767</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:41:14 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229038767</guid>
      </item>
      <item>
         <title>Kayshav Renganathan</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039139</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:41:51 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039139</guid>
      </item>
      <item>
         <title>Library planned to be used</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039366</link>
         <description><![CDATA[<div>None.<br>We will be using mathematics (probability) and sorting algorithm to solve problem 3.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:42:14 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039366</guid>
      </item>
      <item>
         <title>Algorithm planned to be used (Sorting Algorithm)</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039441</link>
         <description><![CDATA[<div>1. <del>Insertion Sort - simple sorting algorithm but the time complexity will be O(n^2) for most of the cases<br>2. Selection Sort - Time complexity for all cases is O(n^2)</del><br>3. Quicksort - Time complexity is O(n * logn) for most of the cases.</div>]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:42:22 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039441</guid>
      </item>
      <item>
         <title>Brainstorming of solution</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039545</link>
         <description><![CDATA[<div>Steps :<br><br></div><blockquote>1. Get the probability of a country having good economic and social condition by using the output of problem 1 (positive words, neutral words and negative words)<br><br>2.&nbsp; Get the probability of a country having optimum delivery system by using the output from problem 2 (the optimum delivery distance of the countries)<br><br>3. Calculate the probability of a country to be recommended to have expansions by using the outputs got from step 1 and step 2.&nbsp;<br><br>4. Our idea of the formula for the calculation in step 3 is to implement the concept of probability in which we multiply the output in step 1 with the output in step 2.&nbsp;<br>(probability of a country having good economic and social condition&nbsp; * probability of a country having optimum delivery system)<br><br>5. Then we modify the formula to :<br>[probability of a country having good economic and social condition&nbsp; * ( 1 - probability of a country having optimum delivery system) ]<br><br>6. After getting the probability of a country to be recommended to have expansions, we use Quicksort algorithm to rank the countries from most recommended to least recommended.</blockquote>]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:42:32 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039545</guid>
      </item>
      <item>
         <title>Lew Jun Bin</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039623</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:42:39 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039623</guid>
      </item>
      <item>
         <title>Tan Thai Ming</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039740</link>
         <description><![CDATA[]]></description>
         <enclosure url="" />
         <pubDate>2022-06-23 16:42:52 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229039740</guid>
      </item>
      <item>
         <title>Link to Report</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229040448</link>
         <description><![CDATA[<div>https://docs.google.com/document/d/1YOruOell082uIaLPRP9sdtPolbDpcJPHOVeNKbkePEI/edit# </div>]]></description>
         <enclosure url="https://docs.google.com/document/d/1YOruOell082uIaLPRP9sdtPolbDpcJPHOVeNKbkePEI/edit#" />
         <pubDate>2022-06-23 16:43:52 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229040448</guid>
      </item>
      <item>
         <title>Link to GitHub</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229042064</link>
         <description><![CDATA[<div>https://github.com/autumnlewjb/AlgorithmProject</div>]]></description>
         <enclosure url="https://github.com/autumnlewjb/AlgorithmProject" />
         <pubDate>2022-06-23 16:46:34 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229042064</guid>
      </item>
      <item>
         <title>Link to Project Description</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229042725</link>
         <description><![CDATA[<div>https://docs.google.com/document/d/1WBnyJlvlTrF_k0YDga6DM6cWxq_ELb3r/edit?usp=sharing&amp;ouid=114076114557753338485&amp;rtpof=true&amp;sd=true</div>]]></description>
         <enclosure url="https://docs.google.com/document/d/1WBnyJlvlTrF_k0YDga6DM6cWxq_ELb3r/edit?usp=sharing&amp;ouid=114076114557753338485&amp;rtpof=true&amp;sd=true" />
         <pubDate>2022-06-23 16:47:21 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229042725</guid>
      </item>
      <item>
         <title>Link to Google Drive</title>
         <author>u2005254</author>
         <link>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229043736</link>
         <description><![CDATA[<div>https://drive.google.com/drive/folders/1FO8zLhn3imZ4v42i0Nvk07eFnVOXXH4r?usp=sharing</div>]]></description>
         <enclosure url="https://drive.google.com/drive/folders/1FO8zLhn3imZ4v42i0Nvk07eFnVOXXH4r?usp=sharing" />
         <pubDate>2022-06-23 16:48:54 UTC</pubDate>
         <guid>https://padlet.com/u2005254/n46aadde2upfc5hp/wish/2229043736</guid>
      </item>
   </channel>
</rss>
