IIT Results
It's no secret that most of us (at least in the MPC branch) are IIT aspirants. So, how did we all do? Please post your results (and your expected marks) below.
It's no secret that most of us (at least in the MPC branch) are IIT aspirants. So, how did we all do? Please post your results (and your expected marks) below.
Author : Arun Chaganty at 5/30/2007 10:56:00 AM 10 comments
Okay, so I know most of the people visiting this blog find biology awfully boring.
Well I can't seem to complain given that I hated it too during school. Anyway lets put all that behind and try to make things interesting.
Now Twish had some really interesting posts which definitely might have made all of you think about the brain in terms of circuits, processing, perception and a whole lot of other things. However before I put up a post about the workings of the brain, I have to first get everyone to know how the brain or for that matter any organ develops. (wait, it doesn't start getting boring here, I am gonna talk about circuits in a totally different way).
So lets start with two cells i.e the resultant of the fusion of the sperm and the ovum. So what happens next. How is it determined which cells become what in the course of division of these two cells to form the millions of cells that is us? How is it that the neurons are formed only in the brain and the spinal cord and other regions? What makes the heart not be in the place of the kidneys and the blood cells to be as they are? (No, this is something that isn't easily ascribed to the creations of a higher power namely God)
So what happens is a completely different branch of biology that is called Developmental Biology.
I can't promise you that I shall give you the answers to what makes the heart cells to not become neurons and vice versa but what I can say is that probably some of you might see the analogy between genetics and circuits.
So now lets get to the start of development. You have 2 cells and they divide something like 9 times over. Till this point none of the cells are in anyway different from one another (or atleast no one has been able to prove that they are). So these cells are called embryonic stem cells (ESC). Now once this stage has been reached what happens is that the embryo starts getting polarised, by polarised I mean to say that now you have distinct regions within the embryo which you can differentiate. Hence we now have an anterior (mouth) end and a posterior (anus) end. Similarly we have left and right sides and up and down distinctions.
But in turn how do two cells differ simply becuase of positions. This is due to a clever trick brought about by diffusion of protein products that have been passed on with the ovum(the sperm is a poor guy who contributes only DNA and no proteins).
So how do these circuits work?
Due to the proteins passed into the embryo by the ovum, these protein create a gradient by simple diffusion and the varying levels of these proteins at different areas "switch on" or "switch off" certain specific genes and these genes form certain other proteins and so on and so forth. Now the products of these genes are important for the activity of other genes and so forth. Thus what you have is a series of AND/IF/OR gates which function together in a highly complexical manner leading to different cells showing different reactions to the same stimulus.
Thus in most simple words, this is the basis of differentiation of cells to form neurons and muscle cells and liver cells.
I think this much is enough at one go, shall write more once I feel it has been adequately understood.
Author : Navneet at 5/25/2007 10:14:00 AM 4 comments
read between the lines:- "this guy is so lazy that he posts on what he has been doing for his summer project."
the first part calls for a recapitulation of sorts----I've been reading a really lovely book on optics by hecht---i don't know who he is guys......but i am a fan!
so , we can start with the polarization states of light---
(i) natural / randomly polarized light(never unpolarized,no!)
(ii) plane polarized light (P - state)
(iii) circularly polarized light----divided further into right handed(clockwise)--R-state
left handed (anti-clockwise)--L-state
(iv)elliptically polarised light --can be right/left handed or horizontal/vertically polarized-depends which way it has a larger amplitude.
essentially every state can be generalised into the elliptical light category-- i mean plane polarised and circularly polarised light are but special cases of the elliptical category.
the mathematical treatment too is very general - assuming the polarized (or randomly so) radiation to consist of the orthogonal components -- horizontally and vertically polarized light respectively.
assumption: propagation of the ray is along z axis.
in the x-y plane, A(x)= acos(wt - kx)
A(y)= bcoswt(wt - kx+ 0) "sorry 0 for theta
adding up amplitudes , A(tot)= acos (wt - kx) + b cos(wt - kx + 0)
= a' cos(wt - kx + 0') where a'= ........ you know the drill
now,
apparently this represents the general elliptic equation, you know where the pricipal axes dont constitute the major and minor axes.
(my knowledge of gemetry and maths is seriously limited)
so when the phase difference in the orthogonal polarized states of light(0)is zero-
we get plane polarization
when 0= 45*(degrees) ,and the two impinging amplitudes are different the elliptic phase takes over,
while for 0=45* and equal amplitudes, circular polarization takes up.
i dont why i explained all this, but this is only the beginning............ most of you should know this but i started dutifully.
in the next part i will take in something that we dont know till now and expand on it.
this article actually deals wth mathematical methods of denoing polarized light.
but what makes it interesting is that we can treat polarization optics entirely through matrix algebra. i mean denote the incident light with a matrix, multiply it with a square matrix that is specific to the optical element to which the incident ray is subjected, and you obtain the emerging ray.
the simplicity of the whole process drew me in, and i perfomed my project on the same thing.
Author : obiwankenoby at 5/20/2007 02:37:00 PM 0 comments
Labels: stokes paramters
This is a big comment on the prev. topic (TP II). Its just soo long, and more than less disconnected that I thought I'd post it out here.
Twish: I'm basing this on memory, so I may have a few gfacts sketchy, but what Turing proved was that there were functions/programs (algorithms) that could not be solved. Wait, thats what you said. Ok, let me go into a little histoire here:
Alan Turing made a theory for what is called the Turing Machine. The Turing machine can perform certain actions, and helped solidify what an algorithm is. It is a function that the Turing machine can perform. Now I don't know how he proved it, but Church and Turing made the Church-Turing Thesis for the Universal Turing Machine. Catch this very carefully: A UTM, can perform ANY action any machine can perform, albeit not very well. Theoretically, given the time, power, and memory, a UTM can perform any task a machine can perform, i.e. every single algorithm.
In exact words:
"Every 'function which would naturally be regarded as computable' can be computed by a Turing machine."
However, he also found the Halting Problem. An algorithm that could never be decided whether it halts or not. Remember that this machine can process any algorithm a machine can process... but it can't determine the halt-ability of this algorithm (note that it can still run the algorithm.) That means that the UTM, and any other turing machine (algorithm) can not find whether this halting problem will halt or not.
Once again, I'm sure to have confuzzled you all. So what do I mean by halting. Suppose you have a problem: find an odd number ending in 3. It halts very quickly (every number ending in 3 is odd). Suppose I were to switcheroo this question. Find an even number that ends in 3. It would never halt. Determining if a problem can halt or not is the object of the Halting Problem, but unlike us, it can't see the very obivious fact that an even number can't end in 3. More about this later. Bascially the program will have to continue trying for every single even number to see if one of them ends in 3.
WARNING: This is going to be *very* confusing. I've lost my sanity thrice while reading this (twice before, once right now). First some teaching of this kind of axioamatic functions. Axiomatic functions happen to be strings. That's what axiomatic systems are all about, strings. Now, a function operates on well... another string. So remember, everything is a string. Note, this may seem confusing, but I'd like to point out to say Twish or Rash, who program a lot, in OOP, functions are objects too!. If you've ever done ASM, you'll know that the functions that are called are binary too! There is not biggie here.
Lets have a possible (?) program called (Captial names are programs) Halt (str, in). This takes an axiom function string (str) and an input (in), and returns true if prg halts for input in, and false other wise. Now, this is precisely what Hilbert-garu wanted, but alas, he's going to be disappointed.
Now, lets create another function called Disappoint (t), and put in its argument (input) some string 't'. Now this Disappoint's function is evaluate Halt (t,t) (this is where Cantor's diagonal argument comes in actually), and to loop forever if the Halt returns TRUE, and stop if it returns FALSE. We can just represent it at Disappoint (t). Nothing very out of the ordinary really. These are all functions within the great UTM's scope. Now for the final blow, suppose we take the very input (t) to be nothing but the program string for Disappoint? This is again something to do with the quirk of self-action. Dissapoint is applying the program string upon itself! Now...
* Lets say that Disappoint(t) stops. That means that Halt(t,t) must have returned false! But that must mean that the program "t" didn't halt! But the prg "t" is nothing but Disappoint(t)! So, if Disappoint(t) stops, it must mean that Disappoint(t) did not stop!!! *zing* You have just gone insane ;)
* Now, suppose Disappoint goes on forever. That could only imply that Halt returned true, or it hasn't finished yet. If Halt stopped, then well that means that "t", i.e. Disappoint (t) stopped, but then again it hasn't!.
Now of course you will say, what if Halt(t,t) itself does not halt EVER, but then isn't a suitable function. That is to say, Halt(t,t) is a function that is supposed to find whether a given function halts or not. Now if it never halts itself, it can not tell you if the given program (t) halts. So it is insufficient to determine if a program halts or not.
The objective of the Halting Problem is to prove that there can not be a particular algorithm/program that can find out if *any* program will halt or not.
That's the proof. Now that you've lost your marbles, I'd like to profess that the first time around, I didn't get it, but this time I did! Yay! (Well to my defense, the first time around was with a much denser material, with a bunch of axiom maths in it too). So what have we learnt? Hilbert was twarted just like Russell. Just for interest, Russell spent a good 10-15 years I think, to come up with a system that he said was complete. Poor guy was gunned down by Godel. OUCH!
Well, what does this have to do with our lively discussion? To start with, our mind, can break through this barrier. How, I don't know, but it can. We can understand that there is no such thing as an even number ending with 3. BUT, that very same mind can also say that there no consecutive primes after 2. The very same system can do both. There is a slightly larger proof of this argument (Turings), that proves the same result for any (finite ?) set of methods (i.e. if you argue with me that we have two specialised methods for both the above problems). But, we are able to transcend that rule. Again, how, I have no idea, but that is the greatness of our mind. There are bits and pieces dealing with rebuttals that I've left out, but I think that this post is long enough as it is!
Author : Arun Chaganty at 5/19/2007 07:54:00 PM 11 comments
I was more than pleased to see so many comments. It was a greatdiscussion. So why delay for Part II ? Of course the observations and "comments" affect the system ( A sleek example of Uncertainity Principle like effect is real life ) so now the posts I had thought of are no longer going to be the same. I was supposed to write about all this an year ago, but got lazy. To me, this is DAMN interesting ! I hope you all too would realize the importance, consequences, and implications of the ideas that follow.
Temporal Programming
Hats off to Time and all of you for mentioning this. For this ceratainly is a great field of current research. A hot field indeed where people fix neuro-networks with electric chips and try to control them and stuff. The aim of course is to combine electrical and biological systems to create "cybernetic organic matter"... sounds Terminator-ish ehh ? lol
However TP is NOT equal to Temporal Programming. If I were to mention it, it might sound 'dubious' and trivial/unimportant/crazy. But I'd insist, that if not of all the importance, it sure is what I began with. So more about TP on Part III. Till then I would like to have a time travel session ( yoh Time get the machine ready man ... ) back to history (a subject I hate from the core of my heart ) ...
Many of you ( Im sure Arun would ) would already know about many of these facts. However, please bear patience, for the others would be fascinated indeed. Countdown Time...
10
9
8
7
6
5
4
3
2
1
0
-1
...
(oops forget it)
Old Hilbert had Problems
In the early 1900s ( not early... infact the very year 1900 ) the great mathematician Hilbert listed out a few "good" "classical" problems in mathematics. Many of these have been solved now. What he emphasised further, was a need to organize mathematical reasoning. He said that a formal axiomatic system should be both `consistent' (free of contradictions) and `complete' (it represents all the truth). Further argued that a mathematical problem should be "decidable" in the sense that there exists an exact procedure or set of instructions (however complex) to decide whether a proposition is TRUE or NOT... an algoritm !
Around the same time, people were talking about unification of physics. This, in a sense, was a unification or generalization of Mathematics. But it's been tested ... that nature seldom appreciates such acts of (folly???). The 2 problems can be listed...
Author : Twishmay at 5/18/2007 01:04:00 PM 11 comments
Introduction
If you toss a coin seven times to get seven heads, you know there is something wrong with the coin.
Author : Twishmay at 5/14/2007 04:01:00 PM 23 comments