Firstly, use IguanaTex to generate equations (Latex Display) in MS PowerPoint. You can set a larger dpi for a higher quality output. Select the "Reset size" option to ensure the consistency of font size. image Copy and paste it to MS Publiser. Drag the figure by holding its center (right on the logo), otherwise, the auto arranging feature will make you frustrated. image Set the figure format. Firstly, Select the "Inline with text" option in the "Wrap Text" menu. And then select the "More Layout Options" in the "Wrap Text" menu. image Set the figure format. Cancel the auto checkbox. Adjust the bottom distance as your needs. The value varies in different Latex Displays. image Now, the figure object, i.e., the equation, can be treated just like normal characters. You can drag it among words with spacing settings as you set for a paragraph. image

在軍中，洗餐盤洗得乾淨不油膩是基本，但邊緣角落累積的陳年汙垢，洗起來費力費時，就很多人不願去理會 (畢竟洗完餐盤後的一分一秒可能攸關洗澡時排隊的人流長度呢)。每次我在洗餐盤，都在想到底是不是要多花點心思刷掉頑強的汙垢，到底我下次再拿到相同餐盤的機率是多少呢? 餐盤示意圖 (非當事餐盤)，引用出處。 問題描述 單兵每次拿餐盤，都會從籃中任意挑選一個餐盤，並且用餐完後會將髒污洗乾淨放回籃中。籃中有兩種餐盤：一是被我取出並且洗去角落污垢者；一是尚未被我取過者。請問在 $t$ 餐後，我拿到曾經被我洗過的、沒有角落汙垢的餐盤機率? 假設條件 不管籃中餐盤乾淨與否，被取到的機率相同，也就是弟兄們不會挑餐盤 (然而，顯然在現實中這是不可能的)。

contributed by < sciyen > repository on github 遊戲方法 按 :arrow_up:/:arrow_down: 前進/後退 按 :arrow_left:/:arrow_right: 向左轉/右轉 按 e 舉槍 按 g 開啟 God Mode 使出透視眼 特殊函數筆記

2020 KGHS i2trc2 26th (下) 基礎程式組 積點/作業/專題/分組 這學期的大綱 積點兌換表 Processing 下載連結 作業上傳雲端連結 每個禮拜都會有作業喔，大家記得交 ww

Google 表單 其他組的 Paper 30~40 mins for each presentation, 5 mins for Q&A The paper you select must published in 2015~2021 CAD contest Paper 1 簡報共筆 Cad 雲端 Paper II Report Cad Contest PPT Cad Contest report

Lecture Notes Lecture 0 Google Colab Lecture 1 Image Processing HW: 手寫文字辨識 Lecture 2 Basic Deep Learning HW: Design your Mnist hand writing classification model

PWM Simulating a PWM output 這個練習只是為了幫助你熟悉 C 語言的使用方式，實際上我們不常這樣應用! 現在你已經知道 PWM 就是控制 Duty cycle ，為了更了解運作原理，我們可以用程式模擬硬體電路的運作方式。 策略 設定 number of slots (num) 為每個燈設定亮度 (brightness)

contributed by < sciyen > [Toc] NCKUCS_WIKI 分組及專題 Homework

contributed by < sciyen > [TOC] Code explaination 在這邊為方便理解， graph 新增與刪除connection時， 以紅色 arrow 代表在前一步中還存在，但是這一步被刪除的 connection 以綠色 arrow 代表在這一步被新增的 connection

contributed by < sciyen > [TOC] Q1 is_ascii() 題目： #include <stdbool.h> #include <stddef.h> #include <stdint.h>

contributed by < sciyen > [Toc] 作答表單 Q1 [LeetCode 835. Image Overlap](https://leetcode.com/problems/image-overlap 解題關鍵： if (j >= 0) {

contributed by < sciyen > [Toc] 作答表單 Q1 LeetCode 1239. Maximum Length of a Concatenated String with Unique Characters for (int i = 0; i < arr_size; i++) { int k = 0; int len = strlen(arr[i]);

NCKU ES Python 部課 [Toc] 筆記網址：https://hackmd.io/@yencheng/2020NCKU-Python Virtual Environment Slides

Branch of Project SelfDriving Table of Content [ToC] Brift Description Accoring to ROS wiki, it was recommended to install ROS in ubuntu with this instruction, however, because we have to use the can bus functions, we have no chioce but to use raspbian which have a better naive raspberry hardware intergration. The original ROS instruction on raspbian would install ROS with Python2 version only, nevertheless, our other program need python3 module, therefore, we can't build ROS from this