Allocated 2 days for this course which is mainly about stochastic process e.g. Poisson Process, Markov Chain and Markov Process. But it is not as easy as it seems. Though the the first part is only to play with probabilities while in the other, just to apply some theorem results, when it comes to exams, I really don't know how can know the way to solve them. With the help of all lecture notes (after 2 days of revision) I finished 2006's paper in like 3-4hours which should be finished in only 2... It is a shock!

 

Just one question from the paper, let you guys have some feeling about it(though it is not the time consuming one). Note it only requires the knowledge about probabilities.

 

A router in a mobile telecommunications network has a recovery buffer, of capacity K packets, in which it stores every outgoing packets so that it can be re-sent in the event that the packet is corrupted downstream. Clearly, the buffer is always full in the long term and the oldest packet is chosen for replacement when a new packet is transmitted. The router works in slotted fashion, i.e. it transmits a packet in any discrete time-slot with independent probability p. A packet-retransmission is requested by a Negative Acknowledgement signal (NAck) being received from a downstream node. Find the probability that a clean packet can be re-sent when a NAck is received for it N time-slots after its original transmission.

 

I still have the Adv.Architecture, Vision, Adv.Graphics. Security.etc.etc..........God, I should hang myself...

以免被人说闷骚 事先声明: 如看的过程中有任何不适 请立即关闭窗口

---

虽然天天抱怨着时间不够 但是发现自己的耐力还真的是不好 坚持看书4个小时就不成了

休息间歇打电话给老妈, 老妈告诉我, 三姨问我家的猫是不是从小养的, 都已经显老了

忽然间眼前浮现出'小咪'刚刚来到我家的样子

 

刚刚到这个世界一个月 丑丑的 很活泼 却还连路都走不好

吃饭的时候怕有别的伙伴会抢 会呜呜的护食

 

转眼之间 下个月就要过8岁生日了(大概相当人的56吧)

已然是猫到中(老)年 很少再上窜下跳 代替儿子静静的守着老妈

 

从没像现在这样觉得一年是这么的久 可每天又是这么短暂

 

要23了 虽是对以后的生活还一无所知

对于生活中已经成了习惯

看人的方式 做事的方式 ...... 很难再改

眷恋

Miss Beijing!