每當我們訓練完一個深度學習模型後，就又到了我們評估模型好壞的時間。比方說分類任務所使用的分類模型，我們總是會拿各式各樣的指標來測試，比方說 precision、recall、F1-score、Accuracy… 指標間總是有好有壞，甚至有可能會互相衝突，所以大部分時候還是要依據任務的需求來選擇自己評估模型的指標的。
Read More »[Machine Learning] 可以和 Accuracy、F1 一同用於模型評估的 MCC 指標筆記
量子電腦（quantum computer）的優勢在於，它極有可能解決一些傳統電腦所無法解決的問題。為了能夠了解實際上我們到底能使用量子電腦解決哪些問題，我們首先需要了解一個問題究竟具有多複雜的計算量。
Read More »[Qiskit] 量子電腦的複雜度、潛力與應用
記憶體（Random Access Memory, RAM）是現代電腦裝置中不可或缺的一個儲存硬體。其可用於儲存作業系統、應用程式、及所有顯示資料的實時（real-time）工作狀態。
Read More »[Linux] 使用 Memtest86+ 進行燒機測試筆記
For two strings s and t, we say "t divides s" if and only if s = t + ... + t (i.e., t is concatenated with itself one or more times).
Hydra是一個開源的 Python 框架，它被設計用來簡化研發佈署的流程（尤其是在複雜的應用上）。Hydra 能夠在佈署時動態地建立階層式的設定檔案、也透過命令列（command line）來繼承（複寫）設定檔。
Read More »Hydra 環境配置管理套件筆記Given an undirected tree consisting of n vertices numbered from 0 to n-1, which has some apples in their vertices. You spend 1 second to walk over one edge of the tree. Return the minimum time in seconds you have to spend to collect all apples in the tree, starting at vertex 0 and coming back to this vertex.
Given the roots of two binary trees p and q, write a function to check if they are the same or not.
Two binary trees are considered the same if they are structurally identical, and the nodes have the same value.
Read More »LeetCode: 100-Same Tree 解題紀錄You are given a 0-indexed integer array tasks, where tasks[i] represents the difficulty level of a task. In each round, you can complete either 2 or 3 tasks of the same difficulty level.
