<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by MorriLiu on Medium]]></title>
        <description><![CDATA[Stories by MorriLiu on Medium]]></description>
        <link>https://medium.com/@morris.cy0910?source=rss-be0408f16eee------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*n3fUjskyg0dthNvfHtqm2g.jpeg</url>
            <title>Stories by MorriLiu on Medium</title>
            <link>https://medium.com/@morris.cy0910?source=rss-be0408f16eee------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sat, 21 Nov 2026 03:56:43 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@morris.cy0910/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Leetcode Daily Update Note]]></title>
            <link>https://medium.com/@morris.cy0910/leetcode-daily-update-note-c0336c08b1e7?source=rss-be0408f16eee------2</link>
            <guid isPermaLink="false">https://medium.com/p/c0336c08b1e7</guid>
            <category><![CDATA[leetcode-hard]]></category>
            <category><![CDATA[leetcode-easy]]></category>
            <category><![CDATA[leetcode-medium]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[python]]></category>
            <dc:creator><![CDATA[MorriLiu]]></dc:creator>
            <pubDate>Sat, 03 Aug 2024 05:28:33 GMT</pubDate>
            <atom:updated>2024-08-03T05:28:33.850Z</atom:updated>
            <content:encoded><![CDATA[<p>Record my own leetcode tips and what I learned, keep update<br>3 easy &gt; 1 medium, 3 medium &gt; 1 hard</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*qBxaaQdqAcSRfziTV9pDuQ.jpeg" /></figure><h3>Easy</h3><ul><li>Two Sum</li></ul><pre>Python<br>  * Array to dict<br>  * enumerate() or for in range(len())<br>  * enumerate() return index and element<br><br>C#<br>  * Array to dict<br>  * array.Length &gt; get the length of list<br>  * dictionary.ContainsKey()<br>  * throw new ArgumentException(&quot;No two sum solution&quot;); &gt;&gt; must handle exception<br>  * for (int i = 0; i &lt; nums.Length; i++) {}</pre><ul><li>Valid Parentheses</li></ul><pre>Python<br>  * stack<br>  * dictionary use closing bracket as key, opening bracket as value<br>  * stack.pop(), stack.append()<br><br>C#<br>  * new Dictionary&lt;char, char&gt;{}, new stack&lt;char&gt;()<br>  * foreach (char c in s){}<br>  * stack.Count &gt; 0 stack.Pop() : &#39;#&#39;; <br>  * stack.Pop(), stack.Push()</pre><ul><li>Merge Two Sorted Lists</li></ul><pre>Python<br>  * dummy = ListNode() &gt; as return answer<br>  * Node.next &gt; move to next one<br>  * Node.val &gt; what the value point now<br>  ** or use Recursive would be easier<br>  ** when smaller then use smaller.next = samefunction(smaller.next, bigger)<br>  ** else bigger.next = sameFunction(smaller, bigger.next)<br><br>C#<br>  * use Recursive</pre><ul><li>Climbing Stairs</li></ul><pre>Python<br>  * Dynamic Programming &gt; bottom-up approach<br>  * Similar with Fibonacci Sequence<br>  * Deal with edge case<br>  * for i in range(2, n+1):<br>      c = f + s<br>      f = s<br>      s = c<br><br>C#<br>  * same idea<br>  * remember ; as end of symbol</pre><ul><li>Same Tree</li></ul><pre>Python<br>  * recursive<br>  * and, or, ==, !=<br>  * deal with edge case<br>  * return True/False<br>  * not p, not q <br><br>C#<br>  * same idea<br>  * &amp;&amp;, ||, ==, !=<br>  * return true/false<br>  * p == null, q == null</pre><ul><li>Maximum Depth of Binary Tree</li></ul><pre>Python<br>  * recursive &gt; runtime: pyhon better then python3<br>  * left_max = self.function(node.left)...<br>  * queue and deque (doulbe-ended queue) &gt; runtime: python3 better then python<br>  * popleft() &gt; first-in-first-out<br>  * append() &gt; to the end<br>  * BFS, with tree level size<br><br>C#<br>  * runtime: recursive better then queue<br>  * recursive same idea<br>  * Queue&lt;TreeNode&gt; queue = new Queue&lt;TreeNode&gt;();<br>  * queue.Enqueue() &gt; append<br>  * TreeNode node = queue.Dequeue();<br>  * if(node.left != null){queue.Enqueue(node.left)}</pre><ul><li>Best Time to Buy and Sell Stock</li></ul><pre>Python<br>  * Not solving problems from God&#39;s perspective <br>  * min_price = float(&#39;inf&#39;)<br>  * for price in prices:<br><br>C#<br>  * int minPrice = Int32.MaxValue;<br>  * foreach(int price in prices){}</pre><ul><li>Valid Palindrome</li></ul><pre>Python<br>  * .lower()  &gt;&gt; change to lower character<br>  * .isalnum() &gt;&gt;  check the alphanumeric characters or not<br>  ** len(array()) - 1 would be string of last one<br>  ** two pointers <br><br>C#<br>  * new type StringBuilder<br>  * StringBuilder cleaned = new StringBuilder();<br>  * IsLetterOrDigit(c) &gt;&gt; Returns true if c is an alphanumeric character<br>                       &gt;&gt; Returns false if c is not an alphanumeric character<br>  * ToLower()<br>  * ToString()</pre><ul><li>Linked List Cycle</li></ul><pre>Python<br>  * Floyd&#39;s Cycle-Finding Algorithm = Tortoise and Hare algorithm<br>  * the one is fast, another step by step they will meet together<br>  * when slow == fast &gt; cycle<br>  * start from different node would be quicker <br><br>C#<br>  * same idea and use ListNode</pre><h3>Medium</h3><ul><li>Longest Substring Without Repeating Characters</li></ul><pre>Python<br>  * sliding window<br>  * char to dictionary &gt; array to dictionary<br>  * max(answer, end-start+1)<br>  * if char in map and char index in map &gt;= start<br><br>C#<br>  * Math.Max &gt; library would use Uppercase <br>  * &amp;&amp; <br>  * dictionary.ContainsKey()<br>  * end of line use ;</pre><ul><li>Longest Palindromic Substring</li></ul><pre>Python<br>  * create a function : expand_around_center<br>  * empty string is considered False<br>  * check for odd-length palindromic<br>  * check for even-length palindromic<br>  * python slicing string will out of one index of array<br>  * slicing: s[0:3] = array: s[0:4]<br>  * while left &gt;= 0 and right &lt; len(s) and s[left] == s[right]:<br>  * left -= 1<br><br>C#<br>  * null is a valid value for strings in C# and attempting to access properties or methods on null would throw a NullReferenceException.<br>  * string.IsNullOrEmpty(s) || s.Lenght &lt; 1<br>  * left --<br>  * c# slicing &gt; s.Substring(start, end-start+1)</pre><ul><li>Container With Most Water</li></ul><pre>Python<br>  * two pointer<br>  * len(list) will less then index pointer<br><br>C#<br>  * same idea<br>  * same concept </pre><h3>Hard</h3><ul><li>Merge k Sorted Lists</li></ul><pre>Python<br>  * simple idea : separate all &gt; sort &gt; combine (runtime beats 99.75%)<br>  * Linked list structure : node, pointer<br>  * pointer.next = ListNode(value) # create a new node in next but not move the pointer<br>  * pointer = pointer.next # pointer move to the new node<br><br>C#<br>  * same idea<br>  * foreach loop iteration variables are read-only in C#<br>  * values.Add(l.val); &gt;&gt; in foreach loop will be failed</pre><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c0336c08b1e7" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[口試通過了，然後呢？]]></title>
            <link>https://medium.com/@morris.cy0910/%E5%8F%A3%E8%A9%A6%E9%80%9A%E9%81%8E%E4%BA%86-%E7%84%B6%E5%BE%8C%E5%91%A2-5554ca34c79e?source=rss-be0408f16eee------2</link>
            <guid isPermaLink="false">https://medium.com/p/5554ca34c79e</guid>
            <category><![CDATA[nthu]]></category>
            <dc:creator><![CDATA[MorriLiu]]></dc:creator>
            <pubDate>Wed, 17 Jul 2024 07:31:19 GMT</pubDate>
            <atom:updated>2024-07-17T07:43:18.763Z</atom:updated>
            <content:encoded><![CDATA[<p>本篇介紹口試結束後要做哪些事</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*JPByqEwgV2fj1Qby54GYEw.jpeg" /><figcaption>Made From Dall-E</figcaption></figure><p>恭喜你已經通過口試，好險你有委紋(畢業一定要好好感謝她），委紋會告訴你一系列流程，但你因為口試通過太爽沒什麼心情聽，所以可以看我這篇。</p><ol><li>首先，校務資訊系統 &gt; 畢業生離校程序 &gt; 步驟三 &gt; 填寫畢業生問卷</li><li>開始根據口委的建議修改論文 &gt; 修改完成後 &gt; 和指導教授取得審定書正本+推薦書正本 &gt; 取得的當下可以直接給老師簽，”離系程序單 (第一格）“</li><li>第二步完成後，才能去圖書館網址 <a href="https://www.lib.nthu.edu.tw/">https://www.lib.nthu.edu.tw/</a><br>學習研究&gt;論文繳交&gt;上傳論文(此處上傳論文有許多規範還要填寫一些論文的基本資訊和公開與否，以及文件加密、浮水印、中英文摘要分離新檔，請詳閱<a href="https://www.lib.nthu.edu.tw/ETD/downloads/upload.pdf">https://www.lib.nthu.edu.tw/ETD/downloads/upload.pdf</a>)</li><li>如果你家或公司的adobe pdf就是付費版，那很棒!!! <br>如果沒有也沒關係，你可以選擇跑去圖書館使用加密和檔案分離功能<br>或者選擇免費試用7天，但在試用之前一定要先把原本下載的所有adobe系列移除，在申請在安裝，否則會一直安裝功能失敗！！！<br>～～～～～記得拿到畢業證書之後要退訂～～～～～</li><li>另外進入上傳論文的網址，<br><strong>一定要選擇登出系統，不能關閉視窗 ！！！<br>一定要選擇登出系統，不能關閉視窗 ！！！<br>一定要選擇登出系統，不能關閉視窗 ！！！<br>否則會鎖帳就要打電話給圖書館人員</strong>（水木&amp;我實測）</li><li>等待系辦審核，通過後會寄mail (校務資訊系統 &gt; 畢業生離校程序 &gt; 步驟二&gt;常使用之聯絡Email)給你</li><li>等待圖書館審核，通過後會寄mail(校務資訊系統 &gt; 畢業生離校程序 &gt; 步驟二&gt;常使用之聯絡Email)給你</li><li>校務資訊系統 &gt; 畢業生離校程序 &gt; 步驟一開始走，直到步驟三(每個連結都要點）</li><li>圖書館審核通過之後，你就可以再次登入圖書館<a href="https://www.lib.nthu.edu.tw/">https://www.lib.nthu.edu.tw/</a><br>前往列印授權清單，另存pdf。</li><li>請準備以下電子檔案<br>*論文內文包含封面(可以不用書脊，但請一定要跟上傳圖書館的一致，如有更改需填寫修改申請)<br>*推薦書*1與審定書*1<br>*清大電子授權書*1<br>*國圖授權書*2<br>分成不同PDF檔案整理好，帶去學校對面”名揚輸出列印(新竹市東區光復路二段364號)“，純粹覺得老闆太專業了!!!<br>老闆會跟你一起確認列印順序，你只要確認這些你都準備好就可以～</li><li>請準備三本紙本論文、學生證、離系程序單，按照上面順序前往</li><li>到了系辦那關交出兩本論文和系上問卷，如果都有準備好委紋會給你一個信封，讓你前往圖書館和註冊組交最後一本論文</li><li>圖書館五號櫃檯交出最後一本論文＋國圖授權書一張</li><li>圖書館三號櫃檯交出學生證設定，恭喜畢業</li><li>註冊組&gt;交出委紋給你的信封給洪小姐&gt;現場等待&gt;取得中文畢業證書(同時也會收到email電子的畢業證書）<br>英文版畢業證書需準備護照，約三個工作天</li><li>恭喜以上都搞定了，你就畢業了，後續三個月內在抽空登記辦理校友證<br><a href="https://www.alumni.nthu.edu.tw/AlumniCard2.aspx">https://www.alumni.nthu.edu.tw/AlumniCard2.aspx</a></li><li>至此你的學生證無用，也無法進入903，如果有用悠遊卡剩下的餘額記得認真閱讀 : 校務資訊系統 &gt; 畢業生離校程序 &gt; 步驟三 &gt;畢業生學生證注意事項</li><li>後續再回頭校務資訊系統 &gt; 畢業生離校程序 &gt; 步驟四 應該都會通過</li></ol><h4>小小感謝文</h4><ul><li>這中間遇到很崎嶇的過程<br>感謝James Lin, 賴博, 皓哥, 裕晏給予的建議，其中Wen和她男友的各種軍師操作，真的非常感激我才能順利畢業\m/\m/\m/</li><li>在此一定要感謝同實驗室的水木願意持續堅持，不斷PUSH才有今天美好的結果，還有深深感謝SMJ老大教會我怎樣做人，而且都忍住不打我</li><li>感謝閑姐總是熱情的打招呼，讓我不是邊緣人XD<br>感謝這兩年來每堂課願意和我同組的同學，一起闖關拿高分～～</li><li>最後祝大家都能順利畢業，找到好戰友一起堅持下去，一定能畢業的</li></ul><blockquote>好的教授帶你飛，其他教授請順著他的方向飛，跟緊著飛</blockquote><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5554ca34c79e" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[EndNote-文獻回顧得力助手]]></title>
            <link>https://medium.com/@morris.cy0910/endnote-%E6%96%87%E7%8D%BB%E5%9B%9E%E9%A1%A7%E5%BE%97%E5%8A%9B%E5%8A%A9%E6%89%8B-20928ce15406?source=rss-be0408f16eee------2</link>
            <guid isPermaLink="false">https://medium.com/p/20928ce15406</guid>
            <category><![CDATA[thesis]]></category>
            <category><![CDATA[nthu]]></category>
            <category><![CDATA[endnote]]></category>
            <category><![CDATA[paper]]></category>
            <category><![CDATA[máster]]></category>
            <dc:creator><![CDATA[MorriLiu]]></dc:creator>
            <pubDate>Tue, 07 May 2024 10:18:53 GMT</pubDate>
            <atom:updated>2024-05-07T10:18:53.208Z</atom:updated>
            <content:encoded><![CDATA[<p>使用EndNote Windows教學：從安裝到使用</p><h3>安裝</h3><p>小弟不才尚未畢業，所以使用學校資源<a href="https://www.lib.nthu.edu.tw/library/department/ref/db/EndNote/EndNote.html">https://www.lib.nthu.edu.tw/library/department/ref/db/EndNote/EndNote.html</a></p><ul><li>我下載的是EndNote 21版，安裝自己喜愛的版本即可</li><li>以下步驟說明圖來自: <a href="https://www.lib.nthu.edu.tw/library/department/ref/db/EndNote/EndNote%2021_for%20WIN.pdf">https://www.lib.nthu.edu.tw/library/department/ref/db/EndNote/EndNote%2021_for%20WIN.pdf</a></li><li><strong>下載後啟動安裝時，最需要注意的是要關閉所有office有關的軟體，否則會一直出現安裝失敗(如下圖)，如果都關掉還是有問題，就直接重新開機後再點選安裝檔。</strong></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/665/1*32hrM2bQoh_LjZz5J66tuQ.png" /></figure><ul><li><strong>下載後是一個壓縮檔，按右鍵選擇解壓縮至此</strong></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/586/1*fWY9dLVj6kWIN0AqsDz0hQ.png" /></figure><ul><li><strong>如下圖，.msi為安裝檔</strong></li><li><strong>點選下一步，但不要一直點下一步，會安裝失敗</strong></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/444/1*4LsEcJe6TgdL-tL2hQ3Wjw.png" /></figure><ul><li><strong>接受後，在按下一步</strong></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/424/1*OtIADs4ok-j9u0cQqGlI3A.png" /></figure><ul><li><strong>再次接受後，請點選客製化(custom)</strong></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/424/1*NVv2IiwmVqNbQBKIIx7fGQ.png" /></figure><ul><li><strong>下一步，你會遇到這個頁面</strong></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/419/1*xCmKurib_z6d4gGCvVlt9A.png" /></figure><ul><li><strong>請點選EndNote for Windows, 改成Entire feature will be installed on local hard drive。</strong></li><li><strong>然後你選完之後，你會看到原本的XX消失了</strong></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/619/1*gRXhQtl4lCH32FEVT4RvyA.png" /></figure><ul><li><strong>接著就是你熟悉的，一直按&quot;下一步&quot;和&quot;是&quot;就會安裝完成，但如果遇到安裝失敗，請回頭看最上面，關閉所有WINDOWS相關軟體或選擇重新開機。</strong></li></ul><h3>使用</h3><ul><li>安裝成功後打開word你會看到如下圖，上方會多一個頁籤</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*3LwRfJHdwHrK4uRlz5ST-Q.png" /></figure><ul><li>這時候會一直跳出要你import library，這部分我沒有用學校圖書館資源，所以可以直接選擇add new library(圖書館)，他就會在你的安裝資料夾新增一個library，這個圖書館就是你電腦裡的論文資料庫</li><li>當你新增好之後去安裝的資料夾或者你選擇的資料夾找，會有一個這種資料夾檔案，這個Library目前會是空白的</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/229/1*OkBJ1ResQ145KKn8VAiOtw.png" /></figure><h3>如何新增你想要的文獻到Library ?</h3><ul><li>由於採用google scholar最快最方便，所以用scholar舉例，可以先做以下設定</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*UDZog1FrsFQt55WVlodBIA.png" /></figure><ul><li>打開顯示導入EndNote的連結，並且儲存</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*h53cQZ7LJ5DbLWaJUUihrA.png" /></figure><ul><li>隨意搜尋一下，你會看到多了一個選擇-導入EndNote</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*raoKfZsG8sB1MJFuMdVS0g.png" /></figure><ul><li>毫不由於點下去後，他會跑出下載</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*GQ2X4Yl4WyteMq3OOX5tHQ.png" /></figure><ul><li><strong>接著去你下載的地方，點他兩下，它就會打開EndNote，會自動幫你導入到你的library，會直接跳到Recently Added，顯示新增結果。</strong></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/238/1*45_291JkXwrvofygU-qzrQ.png" /></figure><h3>如何開始在Word引用?</h3><ul><li>打開Word，點一下Go to EndNote，會打開你文件中的Library</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*JGzoyaqzvznbwd4AZ8Ct9A.png" /></figure><ul><li>在EndNote選擇你要引用的文獻，接著按回Word把游標放在你要插入的地方，點選Insert Citation</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*ScRXARQy95B-rG1fDpo8ow.png" /></figure><ul><li>選擇Insert Selected Citation</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*sTS4eFYKqvFgfh0r-Krhvg.png" /></figure><ul><li>神奇的是它就會幫你建立好參考文獻與索引</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*gAYyj5W4ht-E0lIQYdlDig.png" /></figure><ul><li>由於他的插入數字都是變數所以，你如果往前面插入的時候他會幫你改變編號，讓在前面的引用數字更靠前</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*MOACLv8ZZy1LVgA1VCWM0w.png" /></figure><ul><li><strong>請記住所有數字索引都是變數所以如果你不想要這個引用的時候</strong>，請點選Edit &amp; Manage Citation &gt; Remove Citation &gt; 然後記得點OK</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/943/1*uBkHlFUy8DRLzv0FY0WgSA.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/953/1*a6wqXOpCM4wrmPFWSBKkQA.png" /></figure><ul><li>預設是數字引用，不過你也可以更換變成其他的風格，只要去 Edit &amp; Manage Citation &gt; 點選你要改的 &gt; formatting &gt; 選你想要的 &gt; OK；就會更換了</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*XB5pAGlW6wpA1nPAGmmEhw.png" /></figure><h3>如何調整參考文獻的風格?</h3><ul><li>就按下Style 任你挑選</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*w9-qfLZWi6xaVIG1gmENjg.png" /></figure><h3><strong>如何建立文獻的超連結?</strong></h3><ul><li>一樣進入Edit &amp; Manage Citation &gt; Tools &gt; Config Bibliography</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*0O6fHvqOrOdog0C_kdb5XA.png" /></figure><ul><li>如下圖，兩個都勾起來，按下確定</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/943/1*t5Xq-QA7wpb9oKT4TDQidw.png" /></figure><ul><li>結果他就會變成藍色的，可以按ctrl+點選，就會跳到參考文獻囉</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*yV4rVpBUjYjsMlrmAQO0SA.png" /></figure><ul><li>順帶一提，在Layout可以改參考文獻的字體和引用文獻的字形和大小</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/936/1*8er05s5-6fCAdQPhAXWnyQ.png" /></figure><h3>如何把自己有用到的文獻變成是一個<strong>本地</strong>EndNote資料庫?</h3><ul><li>點選Export to EndNote &gt; Export Traveling Library</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*ttcrdAjS9Kn22Q5Ha0TVZw.png" /></figure><ul><li>然後就可以選擇新增一個新的把所有這份word有用到的另存成一個Library，或者是把有用到的全都加進另一個本來就在的Library</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*QyjCRRG-KddPQj0xv3-hPQ.png" /></figure><h3>欸不是，你這篇文章太慢出了吧，我都手動寫好了欸!?</h3><ul><li>抱歉，你可以去這個網站，<a href="https://citation-finder.vercel.app/">https://citation-finder.vercel.app/</a></li><li>把你的參考文獻那頁複製貼上，一次最多100行，不然他會太慢，這網站他會幫你盡量找到符合的</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*dQ7NFEnmSa2Yl5fXxeDQaQ.png" /></figure><ul><li>貼上後，選擇RIS格式，開始搜尋</li><li>我要的是孟魏結果找錯人，這網站只會幫你找到盡量符合，我就是那個手動寫的人，最後用這個網站先把多數找到，後面插入endnote時候，在一個個檢查，然後用google scholar搜尋最準</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*e9pOTK-DbImaxRgNReS8eg.png" /></figure><ul><li>下載後一樣，會有個RIS檔，就點兩下也是會自動打開EndNote匯入</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*tj8hFy02UCFY-oaizs8ieA.png" /></figure><h3>如果你還想學更多種招數，請見以下網站</h3><ul><li>AI尋找各種論文，但要記得去google scholar 或 直接瀏覽器搜尋求證<a href="https://consensus.app/search/">https://consensus.app/search/</a></li><li><a href="http://tul.blog.ntu.edu.tw/">台大參考服務部落格，超多論文技巧和EndNote教學</a></li><li><a href="https://sci-hub.se/">最受爭議的Sci-Hub，解鎖你下載不到的論文，當然有些還是解鎖不了，貼上doi搜尋最快，doi在哪找，如下圖</a></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*bdgYRrY_hoOcDMJFJjXymA.png" /></figure><blockquote>以上就這樣拉，祝大家順利畢業</blockquote><h4>參考網站</h4><ul><li><a href="http://tul.blog.ntu.edu.tw/archives/101">http://tul.blog.ntu.edu.tw/archives/101</a></li><li><a href="https://support.clarivate.com/Endnote/s/article/EndNote-%E5%A6%82%E4%BD%95%E5%AE%9E%E7%8E%B0%E5%9C%A8Word%E4%B8%AD%E7%82%B9%E5%87%BB%E5%BC%95%E6%96%87%E5%90%8E%E7%9B%B4%E6%8E%A5%E8%B7%B3%E8%BD%AC%E5%88%B0%E6%96%87%E5%90%8E%E5%8F%82%E8%80%83%E6%96%87%E7%8C%AE?language=zh_CN">https://support.clarivate.com/Endnote/s/article/EndNote-%E5%A6%82%E4%BD%95%E5%AE%9E%E7%8E%B0%E5%9C%A8Word%E4%B8%AD%E7%82%B9%E5%87%BB%E5%BC%95%E6%96%87%E5%90%8E%E7%9B%B4%E6%8E%A5%E8%B7%B3%E8%BD%AC%E5%88%B0%E6%96%87%E5%90%8E%E5%8F%82%E8%80%83%E6%96%87%E7%8C%AE?language=zh_CN</a></li><li><a href="https://www.lib.nthu.edu.tw/library/department/ref/db/EndNote/EndNote.html">https://www.lib.nthu.edu.tw/library/department/ref/db/EndNote/EndNote.html</a></li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=20928ce15406" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[GA & GTM important metric — 2/12 note]]></title>
            <link>https://medium.com/@morris.cy0910/ga-gtm-important-metric-7df5c7929476?source=rss-be0408f16eee------2</link>
            <guid isPermaLink="false">https://medium.com/p/7df5c7929476</guid>
            <category><![CDATA[tracking]]></category>
            <category><![CDATA[metrics]]></category>
            <category><![CDATA[google-analytics]]></category>
            <category><![CDATA[google-tag-manager]]></category>
            <dc:creator><![CDATA[MorriLiu]]></dc:creator>
            <pubDate>Mon, 12 Feb 2024 07:00:01 GMT</pubDate>
            <atom:updated>2024-02-12T07:00:33.195Z</atom:updated>
            <content:encoded><![CDATA[<p>Metric for tracking user</p><ul><li>User : Unique User base on Cookie</li><li>Session(working phase) : Visit/Per Times</li><li>Page View/ Per Page : 瀏覽量</li><li>Jump Rate : 跳出率，Left/All , Next but not install, Google Analytics Tracking Code(GATC) — 子網域追蹤</li><li>Exit Rate : 離開率，Thank You Page</li><li>Average Web Stay Time : After Page — Before Page = Stay Time，後-前=停留時間</li><li>Data Level Pyramid, From bottom to top : Product &gt; Hit &gt; Session &gt; User</li><li>Traffic Index Pyramid, From bottom to top : Page View &gt; Session &gt; User</li><li>Two Pyramid correspond : Hit &lt;&gt; Page View , Session &lt;&gt; Session , User &lt;&gt; User</li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7df5c7929476" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Decision Analysis 1224, 1230 note]]></title>
            <link>https://medium.com/@morris.cy0910/decision-analysis-1224-1230-note-00479b4e1849?source=rss-be0408f16eee------2</link>
            <guid isPermaLink="false">https://medium.com/p/00479b4e1849</guid>
            <category><![CDATA[design-analysis]]></category>
            <category><![CDATA[analysis]]></category>
            <category><![CDATA[nthu]]></category>
            <dc:creator><![CDATA[MorriLiu]]></dc:creator>
            <pubDate>Sun, 07 Jan 2024 06:18:46 GMT</pubDate>
            <atom:updated>2024-01-07T06:18:46.548Z</atom:updated>
            <content:encoded><![CDATA[<p>In the end — 最後都會來到人的決策、John Nash-混合策略一定能找到均衡解</p><ul><li>小中取大準則(Max-min return)：最大化最小的報酬是悲觀和保守的準則</li><li>大中取大準則(Max-max return)：最大化最大的報酬是樂觀和願意冒險的準則</li><li>最小化最大後悔準則(Savage’s mini-max regret)：後悔-&gt; 相同自然狀態下，最大報酬方案與該方案的報酬之間的差額，找出每一個方案可能的最大後悔</li><li>Mini-max regret strategy for capacity planning : Shortage regret, Oversupply regret =&gt; 取中間的路 would be better</li><li>影響圖：<br>&gt; 錯把影響圖當作流程圖：ex：採購方案要經過三層簽合手續，不應畫三個決策點，因為只有一個決策「採購甲機台」要做。<br>&gt; 為了表達決策的不確定性，將機會點都指向決策點：繪圖者應自問「是否需等待該不確定事件的發生，並可由其中獲得需要的資訊？」<br>&gt; 節點間有循環(close loops)產生：由於影響圖呈現瞬時的決策情境，決策者不會有機會根據決策結果回饋到下一次決策。</li><li>根據不同的條件做出不同的決策，發生Ａ情況做Ａ決定、發生Ｂ情況做Ｂ決定</li><li>Stochastic domination隨機凌越</li><li>母體知道的狀況可以知道條件機率，分子不確定</li><li>分子確定/個體知道但母體/分母不知道的狀況下，可以知道概似機率</li><li>ROC曲線：曹操&gt;FN偽陰性越小越好；根據生產者風險或消費者風險來決定要選哪一條曲線來執行</li><li>清華慶甲子，水木鑄春秋 =&gt; 水木清華鑄甲子慶春秋</li><li>聖彼得堡悖論（St. Petersburg paradox）</li><li>找一個生命的夥伴</li><li>找出沒有人在做的，創造自己的價值</li><li>Last Mention: <br>&gt; 不要被懷才不遇 &lt;策&gt;<br>&gt; 器“識-洞察”為先，真空妙有(想要有的時候就有)&lt;勢&gt;<br>&gt; 與”時”俱進，終生學習&lt;時&gt;<br>&gt; 制勝無形、廣結善緣 &lt;形&gt;</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*EEbIIfrxQv49C2IChYwf3A.jpeg" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=00479b4e1849" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Design and Analysis of Algorithm- 1214 note]]></title>
            <link>https://medium.com/@morris.cy0910/design-and-analysis-of-algorithm-1214-note-23d9af4a1f27?source=rss-be0408f16eee------2</link>
            <guid isPermaLink="false">https://medium.com/p/23d9af4a1f27</guid>
            <category><![CDATA[nthu]]></category>
            <category><![CDATA[approximation-algorithm]]></category>
            <category><![CDATA[polynomial]]></category>
            <category><![CDATA[np-hard]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[MorriLiu]]></dc:creator>
            <pubDate>Thu, 14 Dec 2023 15:38:34 GMT</pubDate>
            <atom:updated>2023-12-14T15:38:34.133Z</atom:updated>
            <content:encoded><![CDATA[<p>pseudo -poly time algo for NP-H problems, approx algo(poly time) for NP-H problems</p><ul><li>Subset sum: n numbers x1, x2, … xn; bount t; <br>&gt; From decision version to optimization version(goal)</li><li>approx algo: we don’t have to quarentte optimal only need near optimal</li><li>Running time: every two consecutive elements differ by a factor at least 1+delta/2n, at most log 1+delta/2n t+2 numbers</li><li>PTAS: Polynomial Time Approximation Scheme: for any fixed parameter a &gt; 0, a PTAS can produce a (1-a) factor approximation to OPT(I) , for any instance I of a maximization problem, and its running time is polynomial in the order n (and a, called fully PTAS)</li><li>Related knapsack: given n items and knapsack size W, each of which is associated with weight wi and profit vi, the goal is to select a subset S st: sigma wi ≤ W</li><li>PTAS for knapsack, Fractional knapsack: it allows the input objects to be split &gt;&gt; greedy algorithm cp value first until cannot then split</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*P90Jq0m6ru1iehtbOjetrQ.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*1bKVV2cEpOpLFsSL-h9OtA.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*btJwxbTl8EihJdQJhwvMDQ.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*hH499L3e1f2GEzruUUfBKw.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*yUgt5jN2ZPXmcqTAAP9_hA.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*6hHKuzqXLkAvR6Wr50Os5g.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*yzcrxu3O_akOGLSdZGaAsw.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*MdcRoPrsuMDSVMimRvEJEg.jpeg" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=23d9af4a1f27" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Design and Analysis of Algorithm 1207 note]]></title>
            <link>https://medium.com/@morris.cy0910/design-and-analysis-of-algorithm-1207-note-a49bdb9138cf?source=rss-be0408f16eee------2</link>
            <guid isPermaLink="false">https://medium.com/p/a49bdb9138cf</guid>
            <category><![CDATA[binary-search-tree]]></category>
            <category><![CDATA[analysis]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[approximation-algorithm]]></category>
            <category><![CDATA[nthu]]></category>
            <dc:creator><![CDATA[MorriLiu]]></dc:creator>
            <pubDate>Sun, 10 Dec 2023 08:54:47 GMT</pubDate>
            <atom:updated>2023-12-10T08:54:47.318Z</atom:updated>
            <content:encoded><![CDATA[<p>OPT binary search trees, Approximation algorithms,</p><ul><li>Binary search trees:<br>1. Every node has at most two child nodes<br>2. Left child node is always smaller then its parent node<br>3. Right child node is always larger then its parent node</li><li>Successful search:<br>1. n keys(numbers) for search ; k1,k2….kn increasing order<br>1&#39;. P1, P2,….Pn ; its search probability of each ki</li><li>Unsuccessful search:<br>2. n+1 dummy keys , d0, d1, d2…dn ; ki &lt; di &lt; ki+1; 1≤i≤n-1; d0&lt;k1 and dn&gt;kn<br>2&#39;. q0,q1….qn; search probability of di</li><li>Minimize the total search cost:<br>&gt; depth of the search key + 1 =&gt; comparisons</li><li>Dynamic Programing : <br>&gt; e[1, n]<br>&gt; e[i,j] : search ki~kj and di-1~dj, a good root r from i to j</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*-xwr8H__IAemPiN0gC_LIw.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*zxxSql94MCTgjCWlFdSAxg.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*SfceilNFKAUIXroUaBwLGg.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*MYn_4mqHmyyGXoMmKypuRw.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*LiWTCb6GY9L2rGJ0it4kjQ.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*yWddd-f7i6-VPlLQM86HMw.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Vr9i_yzsgTx-XFSL_NwBMg.jpeg" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=a49bdb9138cf" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Design and Analysis of algorithm 1130 note]]></title>
            <link>https://medium.com/@morris.cy0910/design-and-analysis-of-algorithm-1130-note-9d6c17882316?source=rss-be0408f16eee------2</link>
            <guid isPermaLink="false">https://medium.com/p/9d6c17882316</guid>
            <category><![CDATA[lcs]]></category>
            <category><![CDATA[string-matching]]></category>
            <category><![CDATA[edit-distance]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[nthu]]></category>
            <dc:creator><![CDATA[MorriLiu]]></dc:creator>
            <pubDate>Sun, 03 Dec 2023 05:22:02 GMT</pubDate>
            <atom:updated>2023-12-03T05:22:02.734Z</atom:updated>
            <content:encoded><![CDATA[<p>String matching, edit distance, LCS — Longest Common subsequence</p><ul><li>Recall Dynamic Programming<br>&gt;bottom-up manner<br>&gt;Iteration: recursive type<br>&gt;Iteration: optimal sub-structure<br>&gt;Iteration: overlapping problems<br>&gt;Memorization: a particular sequence of steps<br>&gt;Memorization: lookup table</li><li>The edit distance between two strings is the cost of their best possible alignment. find the min number of edits to transform one string to the other.</li><li>edits: insertion(gap), deletion(gap), substitution(mismatch)</li><li>ocurrance vs. occurrence<br>6 mismatches, 1 gap<br>1 mismatches, 1 gap<br>0 mismatches, 3 gaps<br>Identical or weighted cost for gap and mismatch</li><li>three cases: x[i] versus y[j]<br>x[i] vs. — : gap penalty +1<br>- vs. y[j]: gap penalty + 1<br>x[i] vs. y[j] : if x[i] not equal y[j], then mismatch penalty +1; otherwise 0;</li><li>LCS: given two sequences X and Y, determine the common subsequence of X and Y with the largest length, find the maximum length a of common subsequence between them — subsequence alignment</li><li>NGS: next generation sequences; new way and fast but spend a lot of memory</li><li>LCS Properties: Let the kth prefix of a sequence X=x1,x2….xn of length n be a subsequence x1x2x3..xk of length k, where k≤n<br>Denoted by Xk;</li><li>Use m*2 array B for use less memory =&gt; use two rows only<br>From n*m to 2*m =&gt; O(m) space<br>Disadvantage : cannot backtrack</li><li>Divided &amp; conquer &gt; to fix this disadvantage<br>Running time?<br>&gt;Let T(m,n) be the maximum running time on strings of length m and n<br>&gt;It takes O(mn) time finding q to minimize the cost<br>&gt;T(m,n) ≤ T(q,n/2) + T(m-q, n/2) + cmn<br>&gt;T(m,n) ≤ 2T(m,n/2) + O(mn) =&gt; T(m,n) = O(mnlogn)</li><li>Induction hypothesis: T(m,n) ≤ 2cmn =&gt; 2cmn =&gt; O(mn) time</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*AXBM41-hlHZ3SktI9g5b0g.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*DGt2Pun97P8MHdmAXpl02g.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*cvx5-FkWq8KZGxJg0HvGjg.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*9_HqpbkOg1QMzMgZ6saWiw.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*ZlhtyrCQtqKcHDfd7v5b4A.jpeg" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=9d6c17882316" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Design and Analysis of the algorithms 1123 note]]></title>
            <link>https://medium.com/@morris.cy0910/design-and-analysis-of-the-algorithms-1123-note-9c0cb8e5ddb7?source=rss-be0408f16eee------2</link>
            <guid isPermaLink="false">https://medium.com/p/9c0cb8e5ddb7</guid>
            <category><![CDATA[nthu]]></category>
            <category><![CDATA[dynamic-programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[MorriLiu]]></dc:creator>
            <pubDate>Sun, 03 Dec 2023 03:34:06 GMT</pubDate>
            <atom:updated>2023-12-03T03:34:06.015Z</atom:updated>
            <content:encoded><![CDATA[<p>job-shop scheduling、set cover、Dynamic Programming</p><ul><li>The job shop problem is very difficult<br>most of them are NP-Hard</li><li>Given n jobs, each of them has its start time Si finish time fi, the goal is to find a largest set of jobs that have no overlap (compatible jobs) (si,fi] =length<br>1. sort jobs by their finish time (fi), fi is equal it doesn’t matter<br> {1,4,7} is compatible jobs<br>2. Put the job with the min finish time into the solution , then remove the jobs that have overlap with it<br>3. repeat 2</li><li>other problems, how many machines required? : coloring in interval graphs, channel assignment</li><li>minimum makespan scheduling: n jobs with processing time : p1, p2,…pn; m identical machines find an assignment of the n jobs such that the completion time(makespan) is minimized</li><li>2-factor approx. algorithm:<br>1. Order the jobs arbitrarily; Use an arbitrary order of the n jobs(online version)<br>2. Put the next job into the machine with the least amount of jobs so far</li><li>tight example</li><li>Recall greedy algorithms: sub-opt, similar to dynamic programming, consider one sub-opt case instead of all the dynamic cases.<br>Difference: making choices before/after solving sub-problems</li><li>Single Source Shortest Paths — Dijkstra’s algorithm</li><li>Profit vi for each job: find a set of compatible jobs with the maximum total sum of values</li><li>the number of sub-problems : might be exponential</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*cPjTWX8SXpBKZHlgaPBeVQ.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*K_5SQ18znWXNyNh54U8rxw.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*onXsjPBcjXd2bMUg8ODFmw.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*YS50E7p46m2p9Eu7dfpAwQ.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*JpKlJOFz9k_PRK17ZHRf1g.jpeg" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*orkDUNY4hUQhkCgdu1BxkQ.jpeg" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=9c0cb8e5ddb7" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Decision Analysis 1202 note]]></title>
            <link>https://medium.com/@morris.cy0910/decision-analysis-1202-note-6321c4622f84?source=rss-be0408f16eee------2</link>
            <guid isPermaLink="false">https://medium.com/p/6321c4622f84</guid>
            <category><![CDATA[analysis]]></category>
            <category><![CDATA[decision-making]]></category>
            <category><![CDATA[nthu]]></category>
            <dc:creator><![CDATA[MorriLiu]]></dc:creator>
            <pubDate>Sun, 03 Dec 2023 03:31:36 GMT</pubDate>
            <atom:updated>2023-12-03T03:31:36.749Z</atom:updated>
            <content:encoded><![CDATA[<p>決策品質，研究效度</p><ul><li>目標：決定努力的方向、決定應該搜集的資訊、溝通決策結果</li><li>好的計畫：擴大產能、標準化、可衡量化、PDCA、永動機、自體循環</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*8KxrqZrnv5nexOrhHtHyTg.jpeg" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6321c4622f84" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>