Perfect Afternoon Milk Tea Recipe

Ingredients: Tetley Orange Pekoe Teabags (not Tetley Bold) x2 Condensed milk, roughly half a tablespoon Sugar, 2 teaspoons or 8g Filtered Water (or anything better than tap water) Content Item Calories Sugar Fat Protein Cond. milk 50cal 6g 0.8g 0.5g Sugar 15cal 15g 0g 0g Directions: Boil 15-16oz of filtered water for one serving and…

«Close to the Edge» Translation 中文翻译 第二章

(原文来自«Close to the Edge: How Yes’s Masterpiece Defined Prog Rock»,作者Will Romano,出版社Backbeat Books 2017) 2 美梦 Sweet Dreams 早期Yes         John Roy Anderson生于1944年兰开夏郡。在音乐世界里,大多数人会认他为英国前卫乐团Yes的主唱和总导Jon Anderson。         光看他的背景,你很难预料到他未来作为70年代最成功的录音室和巡演乐团之一的一部分所获得的成就。Anderson的母亲在一个棉花工坊工作,而他自己也经常周末在农地里干活,帮助家庭挣钱。他最早的梦想之一是在阿克灵顿斯坦利俱乐部踢球,但因为家庭需求没有实现。         英国北方的教育系统、农业工作和生活节奏显然没能满足他漫游探索的愿望。于是,这个年轻的梦想家开始朝音乐漫游。青春期之前,他曾加入过一个噪音爵士乐团,虽然不清楚他们有否表演过。到17岁时,Anderson加入了白人灵魂乐团The Warriors。这乐团在它的存在期内经历了许多人员变动。它曾包括歌手Tony Anderson(Jon的哥哥)、鼓手Ian Wallace(后来从1971年到1972年呆在过King Crimson)、键盘手Brian Chatton(之后与Phil Collins,Boys Don’t Cry合作过)以及贝斯手David Foster(Badger乐团)等等。         在一次德国巡演后,Anderson离开了The Warriors并且呆在慕尼黑表演了一阵子小酒吧场地,同时充当了The Gentle Party乐团的领导。他曾说过他离开The Warriors之后,感到自己像是通过一次寻找灵魂的过程中重生了一样。接着精神分析了之后,Anderson开始掌控自己的生活以及自己的事业生涯。当他抛开了忧虑和不安,他说他经历了重生。  …

«Close to the Edge» Translation 中文翻译 第一章

(原文来自«Close to the Edge: How Yes’s Masterpiece Defined Prog Rock»,作者Will Romano,出版社Backbeat Books 2017) 1 生命之绳 Cord of Life 前卫摇滚的诞生         上世纪70年代的前五年是英伦前卫摇滚特别丰饶的时期,短短几年内诞生了许多经典专辑,比如《Tarkus》、《Selling England by the Pound》、《Larks’ Tongue in Aspic》、《The Dark Side of the Moon》、《Thick as a Brick》等。这些专辑代表了英国前卫摇滚音乐最为出色的作品。然而是Yes乐团1972年发行的巨作《Close to the Edge》真正地展现了一个处于巅峰时期的摇滚乐团,无论是作为个体还是团队,都在突破着音乐极限。         Yes乐团之前曾在《The Yes Album》和《Fragile》中创造出许多壮丽的乐曲,但没有一首能够与《Close to the Edge》中的三首音乐珍宝媲美。这个摇滚五重奏能在当时经常无比忙乱的录音过程中创造出如此紧密又扣人心弦的音乐,而不成为一个被历史遗忘、被人们低评的杰作真的是一个奇迹。这张专辑的巨大威力使它在被发布之前便永久地改变了Yes乐团个体的演奏动态以及前卫摇滚历史的走向。而在当今21世纪,该魄力的余波还能被深刻地感受到。      …

Front-end Analysis/Compilation

Stages There are four stages of front-end analysis. They are lexical analysis, syntax analysis, semantic analysis and intermediate code generation. Frequent access to a symbol table is required during front-end analysis. A symbol table is a data structure that stores the name and attributes, such as the data type and the scope, of every identifier….

Introduction to Encryption III – Overview of TLS/SSL Handshake

TLS and SSL Transport Layer Security (TLS) protocol is the successor to the Secure Sockets Layer (SSL) protocol which has been prohibited from use by the Internet Engineering Task Force (IETF) due to its vulnerabilities to attacks. They are both protocol suites that have been implemented to function as an additional layer of security between…

Introduction to Encryption II: Digital Signature and Digital Certificate

Key terms Hashing: uses a mathematical algorithm that takes a string as input and outputs a universally unique hash Data Integrity: data is not modified or corrupted Key idea A public key and private key’s function can be reversed: a public key can be used to decrypt a message encrypted by its corresponding private key….

Introduction to Encryption I: Symmetric vs Asymmetric cryptography

Key terms Plaintext: original data before encryption Cyphertext: data after applying encryption algorithms Key: a string that is used to encrypt or decrypt data Public key: the key of the asymmetric key pair that is shared with the public Private key: the key of the asymmetric key pair that is kept by the receiver Symmetric…

Basic Sorting Algorithms: Bubble vs Insertion

Explanation Bubble Sort: Repeatedly loops through the list, comparing each pair of adjacent items and swapping them if needed, until it is sorted Insertion Sort: Builds a sorted list by comparing the next unsorted item with each item of the sorted list and inserting it at the appropriate place (initially, the sorted list consists of…

Basic Search Algorithms: Linear vs Binary

Explanation Linear Search: checking each element of an array in turn for a required value Binary Search: checking the middle of a sorted array and discarding the half that does not contain the required value Type Requirement Performance Linear Search no requirement O(n); Time proportional to array length Binary Search must be sorted O(log n);…