CSE 6250 Project Proposal Team B2 - Ngok Chao HO, Zeyu Wei Paper 1: Index 113, Automated LOINC Standardization Using Pre-trained Large Language Models, Google Research, Author(s): Tao Tu, Eric Loreaux, Emma Chesley, Adam D. Lelkes, Paul Gamble, Mathias Bellaiche, Martin Seneviratne, Ming-Jun Chen Task: Tool for mapping general text to LOINC. Innovation: Uses embeddings from pre-trained LLM with minimal labeled data. Dis/Adv: Learns from small datasets but requires substantial computational resources. Data: Yes, MIMIC-III (Link). Code: Not provided.

cs6210Project4 asd

Commit to Open Source Project grpc/grpc Add concurrency into python example in route_guide apache/airflow Add exception to templates ref list labuladong/fucking-algorithm Fix for terminology in Framework and thoughts about learning data structure and algorithm.md Edit to Wiki https://en.wikibooks.org/wiki/Special:Contributions/Ngokchaoho

This is a review of https://towardsdev.com/solid-principles-with-go-examples-every-developer-should-master-6bc6f9f2b6ab Single Responsibility Principle (SRP) class UserRepository: def __init__(self): self.db = "some db" def find_by_id(id): // Find user by ID def save(user): // save to database

This is HO NGOK CHAO's Readme file. Project Description This project has two parts. Part 1 is a basic gRPC file sharing service with 4 synchronous Remote Procedure Calls (rpc) fetch, store, list, and Stat. sequenceDiagram Client->>Server: Fetch a file request(unary) Server-->>Client: Transfer file to client(stream)

This is HO NGOK CHAO's Readme file. Project Description This project has two parts. Part 1 is basically an extension of project 1 except this time instead of transferring a file available locally, the gfserver is repurposed as webproxy and with callback function libcurl registered so it is expected that the file would be downloaded from network upon the request from gfclient. credit: https://github.gatech.edu/gios-spr-23/pr3 Part 2 is about IPC communication, where instead of using libcurl to download from network, the requirement is now to build a Cache process (simplecached) which would read and then deliver content of local file to Proxy process. The delivery mechanism involves two channels: data channel implemented using POSIX Message Queue and command channel using POSIX shared memory API

This is Ho, Ngok Chao's Readme file. Spring 2023 for Project 1 of CS6200 Graduate Intro to OS Warmup (Echo) Understanding This is a typical Echo Server - Client pair, Client sends 15 bytes content to server and then server send the same content back. At the end, the client receive it and export to stdout. Implementation and Testing Referencing beej's guide, in order to receive and send On server side, I called:

https://realpython.com/primer-on-python-decorators/ Real python is my favorite material learning python. Decorator is one of the mid-level to advance topic of python and used extensively in production. part one Part one of python decorator, main takeaways is function in python is First class object. And hence you can pass function in parameter. The inner function is called closure and have access to variable in the enclosing scope. The functools.wraps update the wrapper function with passed in function's function name, docstring, arguments list, etc.

contributed by < ngokchaoho > Experiment Environment $ gcc --version gcc (Ubuntu 9.3.0-17ubuntu1~20.04) 9.3.0 $ lscpu Architecture: x86_64 CPU op-mode(s): 32-bit, 64-bit Byte Order: Little Endian

from queue import PriorityQueue pq = PriorityQueue() n = int(input()) L = [] for i in range(n): L.append(int(input())) ans = 0 for i in range(n):

contributed by: ngokchaoho Questions: https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/ Recently, I start practising algorithm again. I pick up a book called プログラミングコンテストチャレンジブック [第2版] and reached its BFS (breath first search) section, it introduced a classic problem finding short path for maze. BFS is often implemented through Queue. For python user, you can use queue module. import queue que = queue.Queue() BFS complexity is often O(number of way to transit * number of possible states)

author: ngokchaoho Exercise questions belong to https://missing.csail.mit.edu/2020/course-shell/ Solution provided by: ngokchaoho Lecture 1 Exercise For this course, you need to be using a Unix shell like Bash or ZSH. If you are on Linux or macOS, you don’t have to do anything special. If you are on Windows, you need to make sure you are not running cmd.exe or PowerShell; you can use Windows Subsystem for Linux or a Linux virtual machine to use Unix-style command-line tools. To make sure you’re running an appropriate shell, you can try the command echo $SHELL. If it says something like /bin/bash or /usr/bin/zsh, that means you’re running the right program.

author: ngokchaoho After reading Python Descriptors: An Introduction, I realise that Note that, in Python, a class method is just a static method that takes the class reference as the first argument of the argument list. Hence I do the following experiment, since f in class A is static method, no arguemnt will be automatically supplied, Hence the number of argument is zero. You can use staticmethod with or without class, just note that it cannot access neither class attributes nor instance attrivutes hence both secret nor self._secret will be not available inside static method: class A(): secret = 100

author: ngokchaoho TL;DR: I illustrated that multiple threads can actually complete CPU intensive jobs in parallel. My understanding of parallelism is like below. Quoting Sun's Multithreaded Programming Guide: Concurrency: A condition that exists when at least two threads are making progress. A more generalized form of parallelism that can include time-slicing as a form of virtual parallelism. Parallelism: A condition that arises when at least two threads are executing simultaneously.

author: ngokchaoho Polymorphism is good. It makes life easier to have common interface. It is implemented often with inheritance where we have a super class with default behaviours and its child classes overriding those bahaviours. Then you can create instances usig those child classes while using the same set of methods. Taking example from https://www.programiz.com/python-programming/polymorphism class Cat: def __init__(self, name, age): self.name = name self.age = age

Pre-departure VTP Berlin Welcome Card (Note BER Airport is at Zone C) Berlin Welcome card activities (look for tour) Various day tour searchable on klook UK & EU SIM VTL requirements https://www.singaporeair.com/en_UK/sg/travel-info/vaccinated-travel-lanes/ Booking.com for hotel: Motel One Berlin-Hauptbahnhof Museum ticket

contributed by < ngokchaoho > 第 2 週測驗題 系統環境 Ubuntu Linux 20.04.1 LTS 測驗 1 解釋程式碼運作原理，指出改進空間並著手實作 以下這段函式目標如名字所示，是要拿到中間的節點。留意 list_head 是由 linux/list.h 提供的，利用 list_head 這個結構體，我們可以打造一個雙向鏈結串列，因此 struct list_head *list 如下圖 11-1 所示的，沒有 data，作用是連接頭和尾。

contributed by < ngokchaoho > 作業要求 需要由學員補完並逐步精進，包含以下: q_new: 建立新的「空」佇列; q_free: 釋放佇列所佔用的記憶體; q_insert_head: 在佇列開頭 (head) 加入 (insert) 給定的新元素 (以 LIFO 準則); q_insert_tail: 在佇列尾端 (tail) 加入 (insert) 給定的新元素 (以 FIFO 準則); q_remove_head: 在佇列開頭 (head) 移除 (remove) 給定的元素。

contributed by < ngokchaoho > 2021q1 第 1 週測驗題 程式運作原理 list_add_node_t 加新的節點到 list 開頭 static inline void list_add_node_t(node_t **list, node_t *node_t) { node_t->next = *list; *list = node_t; }