“Silent Assassins - as the name suggests, are silently trying to assassinate PC’s by pursuing the Virus-Anti-Virus project. This uphill task has been undertaken by our team under the guidance of our mentor Mr Niteesh Sahni and with the dedicated support of Mr. Rahul, and is being carried out in assembly language. After grasping certain basic concepts of assembly language, we have started developing “Overwritten Virus”, which is one of the categories of viruses. We are doing this, so as to get a snapshot of how a virus actually searches for its host and infects by replicating itself.
Further, after getting the basic understanding of viruses, we will try to develop viruses with more complexities like companion viruses, parasitic viruses as well as source code viruses.MSF is simply awesome!! Along with the superb task of developing viruses, here we enjoy learning mathematics in a quite innovative manner. We wholeheartedly thank MSF for providing us a platform to enhance our skills by organising IAYM-2010. MSF ROCKS!!!"
Ankit Kumar, Biplob Biswas, Manika Bindal, Nandini Deka, Neha Singh, Reyaz Ahmed Siddiqui, Rishabh Bhasin, Ritwik Rath, Saurabh Kumar Saha, Shreyas Kapoor, Subh Vardhan.
IAYM is a summer internship programme designed to stimulate creativity through ‘hands on’ applications of mathematics with the help of computing techniques. The programme is open to high school and college level students, and features a stipend as well as travel and stay support.
IAYM 2011 Dates
Duration of Programme: | June 6 to 28 |
Know your result: | Result |
Last updated: May 10, 2011 |
Sponsored by the Shiv Nadar University, Greater NOIDA
Showing posts with label 2010. Show all posts
Showing posts with label 2010. Show all posts
Wednesday, June 16, 2010
Thursday, May 27, 2010
Get in line
Shivani Wadehra will be leading the group working on Queuing Theory. She has a master's degree in Operations Research from the University of Delhi.
"Queues are formed at movie halls, metro stations, traffic lights, etc. We would like to optimise these queues so that waiting times are as low as possible, or the number of servers is economically efficient. Longer waiting times lead to costs such as loss of productive time, higher fuel consumption, etc. For example, in Hong Kong, it was computed that a 10 minute delay each day for every worker would lead to a loss of output of about US $2.28 billion a year."
"How do we study the impact of different factors on a queue? One way to get insight is to simulate random arrivals and departures on a computer - this involves basic probability combined with "random numbers" (Ever noticed the RAND button on your scientific calculator?). The diagram shows a simulation of the changing length of a queue where arrivals are random but on average are once every 10 minutes. The service time is similarly random, but on average is one customer every 5 minutes. Note that even though the service time is - on average - quite short, the queue can still get quite long!"
"Queues are formed at movie halls, metro stations, traffic lights, etc. We would like to optimise these queues so that waiting times are as low as possible, or the number of servers is economically efficient. Longer waiting times lead to costs such as loss of productive time, higher fuel consumption, etc. For example, in Hong Kong, it was computed that a 10 minute delay each day for every worker would lead to a loss of output of about US $2.28 billion a year."
"How do we study the impact of different factors on a queue? One way to get insight is to simulate random arrivals and departures on a computer - this involves basic probability combined with "random numbers" (Ever noticed the RAND button on your scientific calculator?). The diagram shows a simulation of the changing length of a queue where arrivals are random but on average are once every 10 minutes. The service time is similarly random, but on average is one customer every 5 minutes. Note that even though the service time is - on average - quite short, the queue can still get quite long!"
Labels:
2010,
queuing theory,
random numbers,
shivani,
simulation
Wednesday, May 26, 2010
Trading in pairs
This contribution is from Tanmoy Neog, who recently completed his masters in Financial Mathematics from the University of Warwick.
"We see that the two stock price series in the first diagram display a lot of co-movement. Can we take advantage of the co-movement of stocks to build a trading strategy? In fact we can. By taking appropriate amounts of the two stocks we obtain the second diagram."
"We observe that we can now sell one stock and buy another simultaneously at certain time intervals to register a profit. This strategy is based on the premise that certain portfolios of stocks have a long run equilibrium value. Due to speculative trading on individual stocks there is a deviation from this value. We take advantage of this fact!!"
"These stocks are in fact Infosys and Wipro on the Bombay Stock Exchange!!"
The job of mathematics is to create ways of identifying such co-movement and the appropriate combinations which will allow this strategy to work...
"We see that the two stock price series in the first diagram display a lot of co-movement. Can we take advantage of the co-movement of stocks to build a trading strategy? In fact we can. By taking appropriate amounts of the two stocks we obtain the second diagram."
"We observe that we can now sell one stock and buy another simultaneously at certain time intervals to register a profit. This strategy is based on the premise that certain portfolios of stocks have a long run equilibrium value. Due to speculative trading on individual stocks there is a deviation from this value. We take advantage of this fact!!"
"These stocks are in fact Infosys and Wipro on the Bombay Stock Exchange!!"
The job of mathematics is to create ways of identifying such co-movement and the appropriate combinations which will allow this strategy to work...
Labels:
2010,
cointegration,
finance,
mutual fund,
portfolio,
stock,
Tanmoy
Tuesday, May 25, 2010
Maths in Biology
Charu Sharma, senior lecturer at MSF, carried out this analysis of genetic data from 78 individuals. Some simple applications of matrices and statistics show that the individuals belong to 3 distinct groups (in fact these individuals are grouped geographically - they are from the Middle East, China and Brazil). In IAYM we will explore whether such techniques can also distinguish the healthy from those in the early stages of a disease!
Charu has a masters in Applied Mathematics from the University of Houston, and is currently collaborating with faculty of the Institute for Genomics and Integrative Biology (IGIB), a premier CSIR institute, towards developing mathematical tools and software for use in biology.
Charu has a masters in Applied Mathematics from the University of Houston, and is currently collaborating with faculty of the Institute for Genomics and Integrative Biology (IGIB), a premier CSIR institute, towards developing mathematical tools and software for use in biology.
Friday, May 21, 2010
Up, up, and ...
As our faculty put the finishing touches on the preparations, some are having more fun than others. Here we see Jatin Anand, in charge of the Space Science project, launching a water rocket he has constructed from the barest of materials. Start thinking on how to improve it!
Jatin has a masters in Mathematics from University of Delhi. As is visible here, he particularly enjoys creating tools and models for use in education.
Jatin has a masters in Mathematics from University of Delhi. As is visible here, he particularly enjoys creating tools and models for use in education.
Thursday, May 20, 2010
IAYM 2010 is at The Air Force School
This year's venue is The Air Force School (TAFS), Subroto Park, New Delhi. Outstation participants will be accommodated in the TAFS hostel.
See the Google map below:
View Larger Map
See the Google map below:
View Larger Map
Saturday, May 8, 2010
IAYM 2010 - Ready for Launch
The second edition of IAYM is due to start on June 1, 2010. We are currently finalizing the list of selected students - a heavy task since there were over 1500 applications for about 60 seats! The selections will be announced by 5 pm Monday, May 10.
Subscribe to:
Posts (Atom)