Friday, February 22, 2013

Learning English in U.S.

Basketball vocabulary
dribble
layup
block
pass
chest pass
bounce pass
cut
shout
rebound
make it take it
turnover
flop:

Others
food stamp
tattoo [tæ'tu]
taekwondo [taɪ'kɔndo]

Food

tortilla chips
tortilla: [tɔ:'tilə]

enchiladas: Mexican food. Tortilla rolled around a filling and covered with a chili pepper sauce.


Ranch: is a condiment made of some combination of buttermilk, mayonnaise, salt, garlic, onion, herbs (commonly chives[tʃaɪvz], parsley, and dill), and spices (commonly black pepper, paprika, and ground mustard seed), mixed into a sauce.

El Panchito: eggplant stuffed with crab meat, shrimp, scallops and chile con queso sauce

Lime Cilantro [sɪ'læntro] dressing
Basil: [ˈbāzəl] culinary herb used in Thai food

Marshmallow
Sausage
Crawfish
Mochi
Taro: [ˈtarō]
Mango [ˈmaNGgō]
Vinegar:

Gimbap(kimbap): a popular Korean dish made from steamed white rice (bap) and various other ingredients,  often served with danmuji or kimchiGimbap is derived from Japanese futomaki (Makizushi) during the Japanese rule, but now has certain distinctive elements not found in Japanese-style makizushi. Whereas the essence of Japanese sushi is vinegared rice, gimbap does not use rice vinegar but rather sesame oil.


Gamjatang: a spicy Korean soup made with pork spine or ribs, vegetables, green onion, hot peppers and ground wild sesame seeds. The meal is usually served with kimchi and a bowl of rice.

Jjamppong:

Sesame: 

Danmuji:

Kimchi:

Avocado:

The California roll (カリフォルニアロール Kariforunia rōru?) is a maki-zushi, a kind of sushi roll, usually made inside-out, containing cucumber,crab meat or imitation crab, and avocado. In some countries it is made with mango or banana instead of avocado. Sometimes crab salad is substituted for the crab stick, and often the outer layer of rice (in an inside-out roll) is sprinkled with toasted sesame seedstobiko or masago.

Barbacoa: a form of cooking meat that originated in the Caribbean with the Taíno people, from which the term “barbecue” derives.
Pinto bean: 

Bento: a single-portion takeout or home-packed meal common in Japanese cuisine. A traditional bento holds rice, fish or meat, with pickled or cooked vegetables, usually in a box-shaped container.

Teriyaki: (kanjiき; hiragana: てりやき) is a cooking technique used in Japanese cuisine in which foods are broiled orgrilled with a glaze of soy saucemirin, and sugar.




American football
hut

Insects
wasp

Plants
bluebonnet (Lupinus texensis): state flower of Texas



Animals
jaguar: [ˈjagwär]

Phrases
a fly on the wall: if you say you would like to be a fly on the wall in a certain situation, you mean that you would like to be there secretly to see and hear what happens I'd give anything to be a fly on the wall when she tells him.

Thursday, February 14, 2013

Extremely interesting: SEO for particular query (urjnasw xkfjjkn)

This is an interesting homework of CSCE 670 Information Storage and Retrieval.
For the next half month, I will do as much as I can to increase the rank of one of my webpages for query urjnasw xkfjjkn. It's my webpage for urjnasw xkfjjkn. Let's see if I can put it in the top answer of google and bing.

Wednesday, December 19, 2012

Learning Networks (0): Open Course "Networks: Friend, Money and Bytes"

I'm gonna jump into Networks area. To broaden my horizons, I decide first to take the course "Networks: Friend, Money and Bytes", taught by Mung Chiang from Princeton University. The course attracts me by its interesting 20 Questions. Its goal is to teach students some important models and methods used in different areas.

Q1: What makes CDMA work for my smartphone

This question is not so interesting to me, perhaps because I don't use smartphone. The methods used to solve the problem is familiar to me. We will see what these methods are soon.

Problem Statement

The problem is CDMA performs frequency reuse, but it is non-orthogonal so that it suffers from interference. The goal is to achieve a target signal quality for each user.

Model

First to evaluate the signal quality, we define Signal-to-Interference-noise-Ratio (SIR) associated with $i$-th user:
\[SIR_i = \frac{P_iG_{ii}}{\sum_{j \neq i}{P_jG_{ij}} + n_i},\]
where $P_i$ denotes power at the transmitter side $i$, $G_{ij}$ represents the channel gain from the transmitter of the logical transceiver pair $j$ to the receiver of logical transceiver pair $i$, and $n_i$ is the noise at the $i$-th receiver.
The above formula is quite straightforward, $P_iG_{ii}$ is the signal power at the $i$-th receiver side. The denominator contains signal interference from other transmitters plus the noise. In this course, $G_{ij}$ and $n_i$ is considered as constants. We only need to decide the value of $P_i$ to achieve target SIR.

Methods
View1: Optimization
\[\min\sum_{i=1}^{N}P_i\]
\[s.t. STR_i(\vec{p}) \geq \beta_i, i = 1, 2, \ldots, N\]
where $\beta_i$ is the target SIR. After simple conversion of the constrains, we can find it is a linear programming.

About linear programming, I just know how to write down a LP formula, but don't know how to analyze its convexity and how to solve it. These questions left for future study.

View2: Game Theory
In my point of view, if optimization considers the problem from the perspective of overall performance, game theory is from the perspective of individual benefit when we think players are competing with each other. In the lecture, the professor talked about dominant action and Nash equilibrium, which reminds me of the course I took from coursera this spring. The professor gave the conclusion without proof that is the best strategy is Distributed power control (DPC).

DPC
This simple algorithm goes as follows:
\[P_i[t+1] = \frac{\beta_i}{STR_i[t]}P_i[t]\]
where $P_i[t]$ is current power, $STR_i[t]$ is the feedback.

Assignment

Learning Python (1): Reading Book "Dive into Python 3"

I am reading the book "Dive into Python 3" now, which has HTML version for free. This is an advanced book, and actually the first two chapters almost cover all the syntax talked in "Learn to Program". One of the book's drawback is it doesn't have exercise, so I have to find some interesting projects from other places.

Comprehension

The first special thing I learn from the book is comprehension. It's like a filter that can select elements from list, dictionary or set. It's pretty much like for-if-else loop, but more compact.

Example
Replace each lowercase letter in a string by the letter two places after it. It can be achieved by one-line code in Python:

a = "g fmnc wms bgblr rpylqjyrc gr zw fylb. rfyrq ufyr amknsrcpq ypc dmp. bmgle gr gl zw fylb gq glcddgagclr ylb rfyr'q ufw rfgq rcvr gq qm jmle. sqgle qrpgle.kyicrpylq() gq pcamkkclbcb. lmu ynnjw ml rfc spj."
print(''.join([chr(ord('a') + (ord(x) - ord('a') + 2) % 26) if x in string.ascii_lowercase else x for x in a]))

Another way is to use maketrans and translate function:
table = a.maketrans(string.ascii_lowercase, string.ascii_lowercase[2:] + string.ascii_lowercase[:2])
print(a.translate(table))


This example is from level 1 of Python Challenge, which I'm currently using and enjoying as exercise.


Monday, December 3, 2012

Learning Python (0): Open Course "Learn to Program"

Next semester, I will have information storage and retrieval class, which request students to use Python to do some projects. So I plan to obtain some practical experience in Python before the class. What I first want to do is to learn the basic knowledge from online course and finish its assignments and projects. The next step is to read books about advance programming on Python.

Previously, I learned machine learning course on coursera which impressed my a lot. So this time I also choose the course on the coursera, which is "Learn to Program" taught by University of Toronto . The course is very basic, so I usually use 1.5x-2x speed to watch the lecture. Now I have watched 4/7 lectures. I'm not going to type any syntax of Python here because it's kind of waste of time and meaningless. Instead, I'm gonna to write down something about the assignments that is interesting to me.

12/08/2012
I finished watching all the lectures.

12/13/2012
I finished the programming assignments, which seem very basic. It's helpful for beginners especially those who do not have experience in programming to take this course. One of the motivation of the course I think is to teach the fundamental idea of programming. For experienced guys, advanced course is needed. Anyway, it's a good start. Next, I'm probably going to find a book and do some practice.

Learning Guitar

Since September 2012, I began to learn to play guitar from my roommate Xiaoxi Bi and also from videos online. Here is some record for my learning. Hope one day I can post some audios record by myself.

What I have learned:
Wonderful tonight by Eric Clapton: finger pick, part of it, solo part to be learned
小手拉大手 by 梁静茹: basic folk strum, almost the whole song
恋爱ing by 五月天: the cord is similar to 小手拉大手
恰似你的温柔 by 蔡琴: learn from Ma.shushu, chord: Dm, G7
Happy birthday song: learn from Ma.shushu, combine single-tone and chord
Anonymity: first song of classic guitar that Xiaoxi learned
老男孩 by 筷子兄弟: the whole song, learn from Ma.shushu
晴天 by 周杰伦: prelude and simple strum version, learn from Ma.shushu. Although the song is simple, it's hard for me to sing when playing guitar. One day when I waited for the train at the subway in New York, I suddenly realized how to sing with the strum. What I do is understanding the beat of lyric and strum first and then combine them together. When I got it, the train arrived at the station "Jay", the English name of 周杰伦.
米店 by 张玮玮: three fingers
拥抱 by 五月天: slow soul, 4 chords, learn from Guitar Handbook
彩虹 by 周杰伦: just the prelude, learn from Ma.shushu
南方 by 达达乐队: slow soul, learn from Xiaoxi

What I am learning:
Tears in heaven by Eric Clapton, learn from Youtube.
1984 by 梁晓雪: first impressed by its beautiful prelude, recommended and taught by Xiaoxi
爱很简单 by 陶喆: learn from Guitar Handbook and Ma.shushu.
我的心真的受伤了 by 张学友: practice Bm cord, learn from Guitar Handbook

What I am going to learn
遇见 by 孙燕姿: the hardest song I heard so far

Tuesday, July 31, 2012

CSCE619-600 notes

Congestion Control
  • Fundamental
    • Design controllers for each r(n) so that R(n) converges
    • Each flow can only rely on its loal state
  • Controller model
    • Differential equation: dy(t)/dt = F(y(t), f(t), t)
    • Recurrences: y(n+1) = y(n) + F(y(n), f(n), n)
  • Stationarity
    • Continuous 
      • dx(t)/dt = F(x(t))
      • stationary point: F(x*) = 0
    • Discrete: 
      • x(n+1) = F(x(n))
      • fixed point: F(x*) = x*
    • Corollary
      • if a system does not have stationary points, it either ocscillates or diverges
  • Stability
    • Whether the system returns back to the stationary state after a small disturbance or not
    • Lyapunov stability theory
      • Lyapunov-stable 
        • stay in neighborhood
      • quasi-asymptotically stable
        • converge to stationary point
      • asympototically stable
        • both Lyapunov and quasi-asympototially stable
    • Stability-analysis
      • Solving differential equations
      • Graphical analysis
      • Lemma
        • If the system converges to a stationary point monotonically, it is asymptotically stable
        • For linear systems, local stability implies global stability
    • Comparison
      • Discrete systems are usually more strict in their requirements for stability because continuous systems make infinitely small steps and avoid drastic jumps of discrete systems

  • Linear Stability
    • Model
      • A system of N equations: dx(t)/dt = Ax(t) + b
      • A is non singular i.e. det(A) ≠ 0, there is no linear dependency between the rows.
      • y(t) = x(t) + A^-1b 
      • dy(t)/dt = Ay(t)
    • Eigenvalue and eigenvector
      • Avλvλ is eigenvalue, v is eigenvector, Mi is set of linearly independent engienvectors corresponding to λi
      • det(AλI) = 0
      • P(λ) = det(A-λI) = (λ-λ1)^m1...(λ-λk)^mk, sum(mi) = N
      • M = (M1,...,Mk) = (v1,...,vl)
      • if A has N different eigenvalues, l = N
    • Determine the stability
      • Continuous system
        • Solution: $z(n) = \sum_{i=1}^{N}{c_iv_ie^{\lambda_it}}$
        • r = max Re(λi)
      • Discrete system
        • Solution: $z(n) = \sum_{i=1}^{N}{e_iv_i\lambda_i^n}$
        • spectral radius max|λi|