Saturday, January 29, 2011

Music Night



Awesome music night at BITS...


one can never forget this one... :)

http://jaldeepvasavada.blogspot.com/2011/01/hectic-day-at-bits.html

Friday, January 28, 2011

Life at BITS

coolest dayyyyyyyyy

no work........but still managed to get 1 project...

and applied for 5 more.. :-)

awesome work pressure.. + count to infinity no. of projects


let's see

:)

Life at BITs is awesome..

Tuesday, January 25, 2011

Hectic Day at BITS

Today we got our first assignment of RC (Reconfigurable Computing)...

Dont know what to do... !!!

Let's see... :-)

The assignment stuff and lecture stuff are completely different...

A very hectic day at BITS Pilani... the institute which is known for the same... :)

AND - XOR Effect

Suppose you have an 8-bit binary number and you want to find 1's complement of it:

(I am taking assumption to explain the method, this method works well with any binary representation of the number)

Assumption: Let's say the 8-bit number is 10011110.

Method-

1 0 0 1 1 1 1 0
1 1 1 1 1 1 1 1 Apply XOR of the 2 numbers
--------------
0 1 1 0 0 0 01

So, we are able to find a 1's complement of the number 10011110 with a single XOR function as shown in this simple example.

This method works for any binary number representation.

Suppose you have an 8-bit binary number and you want to check whether the number is non-zero or not:

(I am taking assumption to explain the method, this method works well with any binary representation of the number)

Assumption: Let's say the 8-bit number is 10011110.

Method-

1 0 0 1 1 1 1 0
1 1 1 1 1 1 1 1 Apply AND of the 2 numbers
--------------
1 0 0 1 1 1 1 0

So, we are able to find a number 10011110, from which we can say that the number is non-zero, with a single AND function as shown in this simple example.

This method works for any binary number representation.

However, this method is useful to check for a single bit whether it is zero or not.

As an example:

We will check for the input 10011110, whether the bit at position 3 is '0' or not. (considering the Least significant bit as 1st bit)

10 0 1 1 1 1 0
000 00 1 0 0 Apply AND of the 2 numbers
--------------
000 00 1 0 0

Here, the result is >0. Therefore,
we can say that for a number 10011110, the bit at position 3 (
10011110) is 1.

In general, to check the nth bit for the number, keep the nth bit as 1 and reset the rest of the bits in the input number, with which you are going to perform AND operation.

Monday, January 24, 2011

Cyberoam’s Layer 8 Technology :: A more secure approach

Cyberoam Unified Threat Management appliances provide security, connectivity and productivity -- assurance -- to SMEs by allowing user identity-based policy controls and introducing Layer-8.


Cyberoam’s Layer 8 Technology considers "user-identity" as a new 8th Layer in the protocol stack, by considering a 7-Layer basic OSI Model. The layer is also defined with a name "HUMAN layer". The Layer is defined such that there will be a mapping from IP address and user name corresponds to Layer-8, which actually increases security, by taking organizations a step ahead of conventional security solutions of considering IP-address based security.

The new concept provides efficiency with increasing speed to an security services by offering instant visibility to the source by username and not by conventional IP address methods. The Layer 8 technology allows creation of identity-based security policies. Cyberoam’s Extensible Security Architecture (ESA) offers an extensible platform without degrading system performance. The supporting feature enhancements to ESA, can be developed rapidly and deployed with minimum efforts.