Difference between revisions of "Private:progress-dastpak"
From NMSL
| Line 1: | Line 1: | ||
=Summer 2011 (TA course MACM 101)= | =Summer 2011 (TA course MACM 101)= | ||
| + | |||
| + | '''July 20''' | ||
| + | |||
| + | * busy with TA duties, marking midterm exam and assignment for a class of 80 students | ||
| + | * Also as you and JC mentioned, I started writing the whole paper and applied your comments. I tried to explain the problem in more detail, in an organized way. and highlight the challenges. I also tried to explain the solution more clearly. The part remained is giving a formal form (pseudocode) of the algorithm. Also as you said, I should take into account the variation in image quality between successive images (I,B,P) frames, as the perceived quality also depends on quality variation and for the same number of bits added to I,B,P frames, the gain in quality are different. | ||
| + | |||
| + | My report till now: [https://cs-nsl-svn.cs.surrey.sfu.ca/cssvn/nsl-members/dastpak/reports/20%20July%20-%202011/] | ||
'''July 5''' | '''July 5''' | ||
Revision as of 10:06, 20 July 2011
Summer 2011 (TA course MACM 101)
July 20
- busy with TA duties, marking midterm exam and assignment for a class of 80 students
- Also as you and JC mentioned, I started writing the whole paper and applied your comments. I tried to explain the problem in more detail, in an organized way. and highlight the challenges. I also tried to explain the solution more clearly. The part remained is giving a formal form (pseudocode) of the algorithm. Also as you said, I should take into account the variation in image quality between successive images (I,B,P) frames, as the perceived quality also depends on quality variation and for the same number of bits added to I,B,P frames, the gain in quality are different.
My report till now: [1]
July 5
- I finished the simulation of the problem. I formulated the problem as an optimization problem which could be modeled as a bounded knapsack problem. The problem is then solved by Reaching method of Dynamic Programming. The results show the increase in Quality (in db) by taking advantage of dynamic spectrum access, using cognitive radio networks.
My report can be found here: [2] The src code : [3]
June 8
- Talked to Ahmed about 3D medical Imaging and after looking into their work and some papers for about a week, I decided that their work is so much different from what I've been doing. Ahmed said that getting to know all about it took him about 4 months, so I decided that I'd rather stay on my research topic and invest those four months into it.
- I decided to go back to simulating it with Java, FGS trace files with the help of this paper : [4]
- Attended NOSSDAV Conference at UBC
May 10
- My report can be found here. [5]
Spring 2011 (Graduate Fellowship & Half-RA by JC Liu):
April 8
- Been busy simulating my ideas but found the settings of simulation unrealistic and looking for cognitive radio simulators, I decided to change to CRCN simulator (NS-2 based). Now I'm done with the installation and set up part and I'm going through NS-2 and OTCL tutorials to see how I can simulate my scenario in this simulator environment. More details can be found in my report [6].
Jan 18
- worked on simulation of the project (video streaming over CR networks), changing some parameters and trying to analyze the results.
Fall 2010 (RA by JC Liu):
- Courses:
- CMPT 771 Internet Arch and Protocols (Grade:A)
- CMPT 820 Multimedia Systems (Grade: A-)
- Worked on: Video streaming over cognitive radio networks
- Did a project on multimedia streaming over cognitive radio networks.
Summer 2010 (RA by Mohamed Hefeeda)
- Worked on : Cognitive Radios
- Did a survey on Cognitive Radio networks.
Spring 2010 (TA)
- Courses :
- CMPT 705 Design/Analysis Algorithms (Grade: A)
- CMPT 882 Spc.Topics Art. Intelligence (Grade :A)
