The internet has seen an unprecedented network growth in the recent past. But According to the standard protocol there is a limitation in the number of IPs that can be supported. This hinted at a possibility that with the increasing number of devices the internet is about to run out of IP addresses very soon. The proposed solution is about to be implemented next week.

On June 6 all major Internet service providers (ISPs), home networking equipment manufacturers, and web companies around the world are coming together to permanently enable IPv6 for their products and services. It is the Internet Protocol version 6 which will allow 2^128 address spaces that can support billions of devices to connect to internet and it will also improve the QoS (Quality of Service) parameters in services including video and audio. The list of companies to shift to IPv6 includes Facebook, Google, Yahoo, AT&T, Cisco, and Akamai to name a few.

On June 8 2011, some companies tried out the IPv6 addresses for a day. The check was done to look for any issues that may crop up when the final transition from IPv4 to the new protocol is made. "Last year’s industry-wide test of IPv6 successfully showed that its global adoption is the best way to keep web devices communicating in the future.” saidJay Parikh, VP of Infrastructure Engineering at Facebook.

This change to IPv6 is not going to affect end users too much. The 4 digit IP addresses will change to 6 digit addresses and there will a large number of IP addresses available for users.

 “The Internet has grown to be an essential part of our daily lives. It connects our devices to our apps; more importantly, it connects us to each other. Yahoo! is proud to be a part of the World IPv6 Launch – an event that marks the next chapter of our Internet. IPv6 enables the Internet to grow, while remaining open and accessible to new applications and new ideas.” said Jason Fesler, Distinguished Architect and IPv6 Evangelist, Yahoo!

Source

A 16-year-old Kolkata boy Shouryya Ray, who arrived Germany 4 years ago, surprised the world by solving two fundamental particle dynamics theories which physicists could calculate only by using powerful computers. Hundreds and thousands of geniuses have already tried their hands and brains on it and Shouryya Ray is the first ever person to have succeeded with flying colors. His solutions will now enable scientists to calculate the flight path of a thrown ball and how it will exactly hit and bounce off a wall for which they had been waiting for more than 350 years.

Shouryya Ray’s journey of solving the maths puzzles started when he heard that the 350 years old puzzle was unsolvable from professors of Dresden University during a school trip. His reaction was “Why not?” “I didn’t believe there couldn’t be a solution” he added and the next what he did, all at the age 16, is history.

He is the son of an engineer who discovered his son’s exceptional intellect after testing his brain with complicated arithmetic problems.

What can we learn from Shouryya Ray?

His accomplishment is greatest which will lead scientist to solve some of the biggest unsolved questions of our time; however, he desires to stay humble and little. He says ‘I’m no genius’ and credits his achievement to ‘hard work in right direction.

Be ready to learn anything. When he arrived Germany at the age of 12, he had no prior knowledge of German but today he is fluent in the language.

Don’t believe in things simply because you are told ‘it is not possible’ by any genius, ask question to yourself and see what answer you receive. Shouryya Ray could accomplish the most difficult task because of the question ‘Why not’ which he posed to himself.

Source

Reliance Communications customers were unable to access Facebook, Twitter and other sites for several hours on Saturday after hacker group Anonymous reportedly hacked into the Reliance servers.

According to reports on sites like MediaNama andZDNet, Anonymous hacked into Reliance's servers in such a way that users trying to access Facebook, Twitter, Google, Gmail and Yahoo were greeted by this message:

As the screenshot says, Anonymous' latest step is to protest against the suspension of their old Twitter page, which Anonymous alleges was done at Government of India's behest. The message from Anonymous goes on to criticize the Government for colluding with the ISPs and censoring the internet.

Anonymous has been tweeting against the Department of Telecom and Internet Service Providers like Reliance. The hacktivists are opposed to torrent sites being blocked by companies who get court orders to prevent pirated content from being shared at sites like Vimeo, DailyMotion and others. 

On Friday, Anonymous held a press-conference via an Internet chat in which it criticized Reliance on similar grounds.

Anonymous had last week brought down various websites including that of Congress Party and Reliance Big Cinemas to protest against the blocking of Vimeo and file-sharing sites by ISPs.

After creating waves of social awareness on the silver screen, Aamir Khan Productions' Satyamev Jayate has now come out with an app for your iDevice. For those who follow the show keenly, every episode features a new song and video. Using the app you can catch a quick preview of such content. While the app is free to download, you will have to pay up $2 (around Rs 110) to get access to the full video and music steams, through an in-app purchase.

You can also access content in Tamil, Telegu, Kanada, and Malayalam, apart from Hindi. Although the app is available only for the iOS platform, it is expected to be available for Android users as well.

Developer: Hungama Digital Media Entertainment Pvt. Ltd
Version: 1.0
Size: 3.3 MB
Licence: Freeware
Platform: iOS 4.0 or above

Download

Over 200 hundred developers from across India have camped up for two days at a hotel in south Mumbai for a Windows 8 hackathon. This is the first time that the Indian developer community is getting into the hack mode for Microsoft Windows.

Hackathon, or codefest, is an event in which computer programmers and others in the field of software development, like graphic designers, interface designers and project managers, collaborate intensively on software-related projects.

With Microsoft Corp geared to launch its cloud-connected Windows 8 later this year, the US-based software developer is making sure that the developer community is ready with applications (apps) for the platform.

“India is an incredible bastion of software developers. On a global scale about 25-30 per cent of all the software codes written in the world are written by Indian developers (based out in India and abroad). Certainly galvanising the developer community in India to see the possibility and re-imagine Windows 8 and build next generation businesses is important,” said Steve Ballmer, chief executive officer (CEO) of Microsoft, via a video conference at the Microsoft India Technology Summit.

Atul Gupta, an individual application developer who has been coding for the last 16-17 hours, is elated with his experience on Windows 8. “This is my first time that I have attended a hackathon and the experience was awesome. The application that I developed is consumer oriented,” said Gupta.

But some of the app developers, who are active on the Android and Apple platforms, are yet to test the Windows 8 platform. “We do not see any immediate reason to be part of the Windows 8 environment. What matters is the actual number of people using handset on that platform, as of now they are very small. Besides the Android base is just growing fast,” said Sagar Bedmutha, founder CEO of Optinno Mobitech.

The company has been developing apps for Research in Motion’s (RIM) BlackBerry smartphones and the Android platform.

Noida based OnGraph Technologies is yet another app developer that is staying away from the Windows 8 platform. “Our issue with Windows is that it is not an open source system. Hence, we prefer Android,” said Nikhil Verma, business development manager, OnGraph.

For Microsoft, getting the developer support from India and APAC (Asia Pacific region) will be significant as the region has several hundreds of companies creating application for the Android, Apple and RIM platforms. “For Microsoft, this is crucial as they need to create a market. There is no dispute that Windows has a huge base in the enterprise segment but that’s not the case in the handset and tablet segments. And these are two areas that are growing exponentially,” said an analyst who did not want to be identified.

Ballmer also reiterated that the launch of Windows 8 is a “rebirth” of the company. “While Windows 7 was one of the best products, with Windows 8 we are re-imagining Windows from ground up,” he said.

Agrees Alok Shende, principal analyst, Ascentius Consulting: “For Microsoft Windows 8 is one of the most important product. The company has a dominant position in the desktop environment, the challenge will be in the mobile category. With Blackberry losing sheen in the enterprise segment perhaps Microsoft can address that market too. But consumers already have too much to choose from,” added Shende.

Vishal Tripathi, principal research analyst, Gartner, believes that Windows 8 has its benefits as security, application store and delivery models and app contracts. It will also support broader devices where users can have same seamless experience on tablet, Phone and PC. “But one of the challenges for Windows 8 is the Metro UI. While they have developed plenty of desktop applications but the catalogue of Metro is limited. Though Microsoft is encouraging developers to build applications and apps acquired through the app store are free for a limited time. In India Windows 8 adoption will face some resistance enterprise who have recently migrated to Windows7 so moving to to a new platform is a huge cost in terms of license, manpower, application testing etc. The change in OS in the enterprise environment happens every three to four years in India and in case of small businesses perhaps up to five to years. It might make sense of companies who are still on XP to move to Windows 8,” said Tripathi.

Source

BootStrapToday adds intelligence, integration and automation to the software development process and makes development team highly productive. 

• Collaborate efficiently with right information at right places
• Detect software bugs early and maintain code quality
• Reduce your project cost significantly
• Improve management ease and clarity
• Use it as Software Development Life Cycle Management Solution or Simple Task Management tool

A tool for software & IT companies that incoroporate "Application Lifecycle Management" processes & practices. BootStrapToday is a result of immense research on Software Development Process and we refer to it as "Intelligent Workspace for smart Teams".

Take Look on it ...

Trusted Customers of BootStrapToday :

http://bootstraptoday.com/testimonial/

To see tour video: 

http://www.youtube.com/watch?v=GRQ5NLMx-7g

Plans and Pricing of BootStrapToday :

http://bootstraptoday.com/plans-pricing/

Create an account on BootStrapToday :  https://bootstraptoday.com/account/create/8/

For any kind of support: 

http://bootstraptoday.com/support/faq/

This is probably a way out, but if SocialCam goes the way of Instagram, there may no longer be a need for a web portal that hosts video like YouTube. Instead, videos will be shared socially and organically, without the need to actually search for videos on a site like YouTube. Anything relevant will just show up in your SocialCam feed.

This application for iPhone and Android users has eclipsed over 2million downloads and now that’s called a massive figure!

visit its official website : http://socialcam.com/

Former Facebook employees Adam D’Angelo and Charlie Cheever are the founders of this question and answer site which is gaining popularity for being one of its kind. D’Angelo once told “Q & A is one of those areas on the internet where there are a lot of sites, but no one had come along and built something that was really good yet” and you can browse the net to know its output.

People browse the internet with questions but Google isn't necessarily optimized for questions — it's optimized for keywords. Quora is optimized for questions and has a massive knowledge.  It is based in California and has been answering questions since June 2009.

Visit : http://www.quora.com/

to know more about it visit : http://en.wikipedia.org/wiki/Quora

visit quora india page : http://www.quora.com/India

SERVER


#include<stdio.h>
#include<netdb.h>
#include<string.h>
int main()
{
int sd,sd1,l;
char ch[30],ch1[30];
struct sockaddr_in s,c;
s.sin_family=AF_INET;
s.sin_addr.s_addr=inet_addr("192.168.6.25");
s.sin_port=htons(6001);
bzero(&(s.sin_zero),8);
sd=socket(AF_INET,SOCK_STREAM, 0);
bind(sd,(struct sockaddr*)&s, sizeof(s));
listen(sd,5);
sd1=accept(sd,(struct sockaddr*)&c,&l);
while(1)
{
read(sd1,ch,30);
int d=strcmp(ch,"q");
if(d==0)
break;
printf("%s",ch);
printf("\n");
printf("Enter the data:");
gets(ch1);
write(sd1,ch1,30);
}
printf("thank you...");
close(sd1);
return(0);
}


CLIENT



#include<netdb.h>
int main()
{
int sd2;
        char ch[30],ch1[30];
        struct sockaddr_in s,c;
        s.sin_family=AF_INET;
        s.sin_addr.s_addr=inet_addr("192.168.6.25");
        s.sin_port=htons(6001);
        bzero(&(s.sin_zero),8);
sd2=socket(AF_INET,SOCK_STREAM,0);
connect(sd2,(struct sockaddr*)&s,sizeof(s));
while(1)
{
printf("\n");
printf("Enter the data:");
gets(ch);
write(sd2,ch,30);
printf("\n");
read(sd2,ch1,30);
printf("%s",ch1);
}
close(sd2);
return(0);
}

A checksum or hash sum is a fixed-size datum computed from an arbitrary block of digital data for the purpose of detecting accidental errorsthat may have been introduced during its transmission or storage. The integrity of the data can be checked at any later time by recomputing the checksum and comparing it with the stored one. If the checksums match, the data was almost certainly not altered.

#include<stdio.h>
#include<conio.h>
#include<math.h>
void main()
{
int r,t[20],x,o,a[30],i,j,k,z,aa,b[20],n,y,s,n1,flag=0;
clrscr();
printf("*********sender side***********\n");
printf("enter the data length:");
scanf("%d",&n);
for(i=1;i<=30;i++)
{
a[i]=0;
}
printf("enter the data:");
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
printf("enter the chopping size:");
scanf("%d",&o);
z=0;
for(i=1;i<=n;i=i+o)
{
x=o-1;
k=0;
for(j=i;j<i+o;j++)
{
k+=pow(2,x)*a[j];
x--;
}
z=z+k;
}
printf("\ntotal in decimal is=%d",z);
y=0;
s=1;
while(z>=1)
{
aa=z%2;
t[s]=aa;
s++;
z=z/2;
y++;
}
if(y>o)
{
t[1]=t[o+1]+t[1];
}
r=1;
for(i=o;i>=1;i--)
{
b[r]=t[i];
r++;
}
for(i=o;i>=1;i--)
{
if(b[i]>1)
{
b[i]=b[i]%2;
b[i-1]+=1;
}
}
printf("\nb[i]=");
for(i=1;i<=o;i++)
printf("\t%d",b[i]);


for(i=1;i<=o;i++)
{
if(b[i]==0)
b[i]=1;
else
b[i]=0;
}
printf("\nthe checksum value is:");
for(i=1;i<=o;i++)
{
printf("\t%d",b[i]);
}
printf("\n*********Receiver side*********\n");
for(i=1;i<=30;i++)
{
a[i]=0;
}
n=n+o;
printf("enter the data:");
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
z=0;
for(i=1;i<=n;i=i+o)
{
x=o-1;
k=0;
for(j=i;j<i+o;j++)
{
k+=pow(2,x)*a[j];
x--;
}
z=z+k;
}
printf("total in decimal is:%d",z);
y=0;
s=1;
while(z>=1)
{
aa=z%2;
t[s]=aa;
s++;
z=z/2;
y++;
}
if(y>o)
{
t[1]=t[o+1]+t[1];
}
r=1;
for(i=o;i>=1;i--)
{
b[r]=t[i];
r++;
}
for(i=o;i>=1;i--)
{
if(b[i]>1)
{
b[i]=b[i]%2;
b[i-1]+=1;
}
}
printf("\nb[i]=");
for(i=1;i<=o;i++)
printf("\t%d",b[i]);
for(i=1;i<=o;i++)
{
if(b[i]==0)
b[i]=1;
else
b[i]=0;
}
printf("\nthe checksum value is:");
for(i=1;i<=o;i++)
{
printf("\t%d",b[i]);
}
for(i=1;i<=o;i++)
{
if(b[i]==1)
{
flag=1;
}
}
if(flag!=0)
printf("\nError present in the code....");
else
{
printf("\nNO error present in the code....");
getch();
printf("\n\tcode successfully accepted by receiver.....");
}
getch();


}


to know more about it :


http://en.wikipedia.org/wiki/Check_sum

A cyclic redundancy check (CRC) is an error-detecting code commonly used in digital networks and storage devices to detect accidental changes to raw data. Blocks of data entering these systems get a short check value attached, based on the remainder of apolynomial division of their contents; on retrieval the calculation is repeated, and corrective action can be taken against presumed data corruption if the check values do not match. 

Lets start...

#include<stdio.h>

#include<conio.h>

void main()

{

     int a[20],c[20],d[20],aux[20],r,i,j,l,in,flag,choice,key;

     clrscr();

     printf("\n ENTER THE SIZE OF DATA WORD : ");

     scanf("%d",&l);

     printf("\n ENTER THE DATA WORD : ");

     for(i=0; i<l; i++)

           scanf("%d",&a[i]);

     printf("\n ENTER THE NUMBER OF REDUNDANT BITS : ");

     scanf("%d",&r);

     printf("\n ENTER THE DIVISOR : ");

     for(i=0; i<(r+1); i++)

           scanf("%d",&d[i]);

     for(i=0; i<(l+r); i++){

           if(i<l) c[i]=a[i];

           else c[i]=0;

     }

     printf("\n\n ... GENERATOR MODULE ... \n");

     printf("\n\n THE INTERMEDIATE CODE WORD IS : ");

     for(i=0; i<(l+r); i++)

           printf("%d ",c[i]);

     for(i=0; i<(l+r); i++)

           aux[i]=c[i];

     for(i=0; i<l; i++){

           in=1;

           if(c[i]==1){

                for(j=i+1; j<(i+l); j++){

                     c[j]=c[j]^d[in];

                     in++;

                }

           }

           else{

                for(j=i+1; j<(i+l); j++)

                     c[j]=c[j]^0;

           }

     }

     printf("\n\n THE REMAINDER AFTER DIVISION IS : ");

     for(i=l; i<(l+r); i++)

           printf("%d ",c[i]);

     printf("\n\n SENDER CODE WORD : ");

     for(i=0; i<(l+r); i++){

           if(i<l) c[i]=aux[i];

           printf("%d ",c[i]);

     }

     printf("\n\n\n PRESS 1 IF YOU WANT TO CHANGE A BIT OR 0 TO CONTINUE : ");

     scanf("%d",&choice);

     if(choice==1){

           printf("\n\n ENTER THE BIT YOU WANT TO CHANGE :");

           scanf("%d",&key);

           for(i=0; i<(l+r); i++){

                if(i==(key-1)){

                     if(c[key-1]==0) c[key-1]=1;

                     else c[key-1]=0;

                }

           }

           printf("\n\n\n CODE WORD AFTER ERROR : ");

           for(i=0; i<(l+r); i++)

                printf("%d ",c[i]);

     }

     else printf("\n\n\n NO ERROR INSERTED IN CODE WORD... ");

     printf("\n\n\n\n ... CHECKER MODULE ... ");

     for(i=0; i<l; i++){

           in=1;

           if(c[i]==1){

                for(j=i+1; j<(i+l); j++){

                     c[j]=c[j]^d[in];

                     in++;

                }

           }

           else{

                for(j=i+1; j<(i+l); j++)

                     c[j]=c[j]^0;

           }

     }

     printf("\n\n\n THE SYNDROME ARRAY IS : ");

     for(i=l; i<(l+r); i++)

           printf("%d ",c[i]);

     flag=0;

     for(i=l; i<(l+r); i++){

           if(c[i]!=0){

                flag=1;

                break;

           }

     }

     if(flag==1) printf("\n\n\n ERROR DETECTED !!!");

     else printf("\n\n\n NO ERROR FOUND");

     getch();

}

To learn its theory part please visit on the link below:

http://www.hackersdelight.org/crc.pdf

http://en.wikipedia.org/wiki/Cyclic_redundancy_check