24 Dec 2023 ✈️： 13:10 -> 20:45 London Luton -> Hurghada 468 GBP 🏠：21:30 Marina Square Hostel 16 mins by taxi from airport, 10:00 pm checkin approx.) 25 GBP 🥣： 22:00 McDonlad’s ? (2 min walk from hostel) / Or ask stuff 25 Dec 2023 🤿：8:30 - 15:30 50 GBP 🌄：16:30 - 20:00 Start with a visit to Hurghada Museum Open until 9:00 PM Artfacts from recent Egyptian history Next head to Ad Dahar Souq The most egyptian part of the city Join the through of local shoppers Walking through Marina promenade, Pedestrinised the tourist hub and perfect place for sundown lovers. Passing through Fish souq and Grand Mseque Preview of the dinner supper 🍴：20:30 ...

入职数月，年关在即。不论我喜欢与否，过去关于学校和工作的起承转合，都已经成为刻画我职业起点的一份记忆。虽是寥寥，但也参与了一次完整的开发周期。其间的感受，冷暖自知，但涌现的经验与反思可贵。趁着记忆新鲜，还是用文字记录。 学校的任务清晰，明确，甚至有Criteria一一对应，但工作不会。 目标导向，用第一性原理倒推过程，主动思考。 比不懂更可怕的是糊弄。 确保记录，每天的日志比任何时间管理方法都更好用。 期待下月会更好。

Concept What is a database? A structured set of computerized data with accessible interface SQL: Structure Query Language (SQL), A standard language used in all relational database management system Install the database Two components: MySQL SQL workbench Add the mysql to the environment variable open ~/.zshrc ## add the mysql bin ## no spaces around the = export PATH=${PATH}:/usr/local/mysql/bin ## The save the file source ./zshrc Hierachy: Server -> Multiple database -> Multiple sheets Basic Select, Create, Delete ...

Common Terminologies in Graph Thoery Define an undirected graph with the natrual order as $G = (V,E,\sigma)$ where $V$ is the set of the vertices, $E$ is the set of edges and $\sigma$ is the natrual ordering. Chordal graph A chordal is a path of undirected graph between two non-conescutive vertices. (“shortcut”" between two vertices") A chordal graph referes to every cycle of length four or greater of a simple graph has a chord. (triangulated graph) Chordal Completion ...

Clique seperator Decomposition by clique seperator (Tarjan, 1985) Main Idea: Based on the idea of ‘divide and conquer’, this paper proposed an graph decomposition algorithm by finding the clique seperator recursively. The decomposition results in a binary decomposition tree. The author suggested some general ideas to tackle 4 NP-hard problems by ultlizing the binary decomposition tree. Preliminaries Perfect elimination ordering, Clique, Minimal and Minimum ordering, Seperator Algorithms Text description ...

Overview Revisitting the sparse matrix technology - Summary. ...

Overview Revisitting the sparse matrix technology. ...

Overview Revisitting the sparse matrix technology. ...

Monte Carlo Tree Search Summary...

Reinforcement Learning Algorithms Summary...