India’s first navigation satellite soars to success

With this launch, India has entered a new era in space applications, says ISRO chief

The Polar Satellite Launch Vehicle blasted off with India’s first dedicated navigation satellite IRNSS-1A close to midnight on Monday. Photo: S.R. RAGHUNATHAN

India’s first dedicated navigation satellite, the IRNSS-1A, developed by the Indian Space Research Organisation, was successfully put in orbit on Monday night.

The launch vehicle, PSLV-C22, bearing the 1,425-kg navigation satellite, blasted off the launch pad at the Satish Dhawan Space Centre here at the scheduled lift-off time of 11.41 p.m.

As the PSLV-C22 tore into the night skies and set off four stages of ignition and separation, all the while gaining in altitude and velocity, down on earth, twitchy mission controllers at the command centre awaited the final confirmation of the mission’s success.

A round of applause greeted the successful kick-starting of the fourth stage of ignition, arguably the most critical component of the mission to place the satellite in the targeted orbit.

About 20 minutes after the lift-off, the PSLV-C22 completed its task of injecting the IRNSS-1A into a sub geosynchronous transfer orbit with a 284-km perigee (nearest point to the Earth) and 20,650 km apogee (farthest point from the Earth).

As the final act of the rocket separating from the satellite unfurled on the giant screen at the mission control room, the gathering of scientists and engineers broke into cheers and applause.

Once again, Team ISRO had pulled off with clockwork precision the roughly 65-hour countdown that began on June 29 and ended in the lift-off close to midnight on July 1.

ISRO Chairman K. Radhakrishnan, who congratulated the team, said that with the successful launch, India had entered a new era in space applications.

P.J. Kurien, Deputy Chairman, Rajya Sabha, said it was a great moment for the nation.

Yash Pal, one of the doyens of India’s space programme, was also present.

The IRNSS-1A is the first of the proposed seven satellites in the Indian Regional Navigation Satellite System. Apart from India, its benefits would extend to a range of 1,500 km in the region.

With a mission life of 10 years, it will deliver applications ranging across terrestrial, aerial and marine navigation, disaster management, tracking of vehicles, guiding hikers and travellers, and visual-voice navigation for drivers.

The PSLV-XL used for the launch does not directly transfer satellites into a geosynchronous orbit. Instead, it puts the satellite into an interim sub Geosynchronous Transfer Orbit (sub-GTO), from where thrusters are used to push the satellite into geosynchronous orbit.

Once it has been injected into the preliminary orbit, solar panels of the satellite are automatically deployed and the Master Control Facility at Hassan, Karnataka, takes over the control of the satellite — from the initial orbit raising manoeuvres to the final placement in the circular geosynchronous orbit.

Some of the features of the IRNSS-1A are two solar panels with ultra triple junction solar cells that can generate about 1,660 watts of electrical power, Sun and star sensors as well as gyroscopes to provide orientation.

It also carries Corner Cube Retro Reflectors for laser imaging and is endowed with a highly accurate Rubidium atomic clock.

Keywords: IRNSS-1A, Indian satellite, navigation satellite

SOURCE: THE HINDU

Apple applies for 'iWatch' trademark in Japan

Apple Inc. has applied for a trademark in Japan for “iWatch” as rumors suggest it may be developing a smart wristwatch.

A document obtained Monday from the Japan Patent Office’s website said the application was made June 3 and made public June 27.

It was not immediately clear when the application might be approved. Patent office and Apple officials in Japan were not available for comment late Monday.

Apple is rumored to be working on a smart watch that would run on a version of the operating system used by its iPhone and iPad. The company has not confirmed those rumors, but CEO Tim Cook has hinted that it may be developing a wearable computing device such as a wristwatch.

Applying for a trademark in Japan isn’t proof of Apple’s intentions. The company based in Cupertino, California, has many patents for devices it will never produce.

SOURCE: THE HINDU

LIVE CRICKET STREAMING HERE!

linkk

rarabc

click the link below (testing..)

testing link

How to activate idm without crack

1. By opening IDM,it shows dialog box by entering fake serials (almost everyone try this trick but doesn't work for long time.Dialog Box Shown below:

2. After pressing ok another dialog box appears, image below:

3. Fill the form,also fill the serial number box you were pasting before.DONT press ok.

4.now open the taask manager,image below:

5. On the applications tab, right click on Internet Download Manager Registration and tap on 'Go To Process' option,image below:

6. Dialog box will appear, image below

7. Click on end process,another dailog box appears to confirm end process, image below:

 

8. Dont press End process button,

9. Keep this dialog box and dialog box of step 2 beside to do things fast, image below:

10. Now do it quick, first press ok and then press End process imediately...

Now your IDM is fully functional,so why r u waiting download your favourite stuff now.........

Note: please dont forget to like it....

Addition of Two Matrices

This c program adds two matrices i.e. 

compute the sum of two matrices and

then print it. Firstly user will be

asked to enter the order of matrix 

( number of rows and columns ) and 

then two matrices. For example if 

the user entered order as 2, 2 

i.e. two rows and two columns and 

matrices as

First Matrix :-

1 2

3 4

Second matrix :-

4 5

-1 5

then output of the program 

( sum of First and Second matrix ) 

will be

5 7

2 9 

#include <stdio.h>
 
int main()
{
   int m, n, c, d, first[10][10], second[10][10], sum[10][10];
 
   printf("Enter the number of rows and columns of matrix\n");
   scanf("%d%d", &m, &n);
   printf("Enter the elements of first matrix\n");
 
   for ( c = 0 ; c < m ; c++ )
      for ( d = 0 ; d < n ; d++ )
         scanf("%d", &first[c][d]);
 
   printf("Enter the elements of second matrix\n");
 
   for ( c = 0 ; c < m ; c++ )
      for ( d = 0 ; d < n ; d++ )
            scanf("%d", &second[c][d]);
 
   for ( c = 0 ; c < m ; c++ )
      for ( d = 0 ; d < n ; d++ )
         sum[c][d] = first[c][d] + second[c][d];
 
   printf("Sum of entered matrices:-\n");
 
   for ( c = 0 ; c < m ; c++ )
   {
      for ( d = 0 ; d < n ; d++ )
         printf("%d\t", sum[c][d]);
 
      printf("\n");
   }
 
   return 0;
}

Transpose of Matrix in c

#include <stdio.h>
 
int main()
{
   int m, n, c, d, matrix[10][10], transpose[10][10];
 
   printf("Enter the number of rows and columns of matrix ");
   scanf("%d%d",&m,&n);
   printf("Enter the elements of matrix \n");
 
   for( c = 0 ; c < m ; c++ )
   {
      for( d = 0 ; d < n ; d++ )
      {
         scanf("%d",&matrix[c][d]);
      }
   }
 
   for( c = 0 ; c < m ; c++ )
   {
      for( d = 0 ; d < n ; d++ )
      {
         transpose[d][c] = matrix[c][d];
      }
   }
 
   printf("Transpose of entered matrix :-\n");
 
   for( c = 0 ; c < n ; c++ )
   {
      for( d = 0 ; d < m ; d++ )
      {
         printf("%d\t",transpose[c][d]);
      }  
      printf("\n");
   }
 
   return 0;
}

Multiplication of two matrice in C++

1. #include<iostream.h>
2. #include<conio.h>
3. void main()
4. {
5. clrscr();
6. int a[10][10],b[10][10],c[10][10],m,n,o,p,i,j;
7. cout<<"Enter number of rows of A: ";
8. cin>>m;
9. cout<<"Enter number of coloumns of A: ";
10. cin>>n;
11. cout<<endl<<"Enter elements of matrix A: "<<endl;
12. //Coding by:Mir Mueen
13. //http://www.thecorblog.blogspot.com
14. for(i=0;i<m;i++)
15. {
16. for(j=0;j<n;j++)
17. {
18. cout<<"Enter element a"<<i+1<<j+1<<": ";
19. cin>>a[i][j];
20. }
21. }
22. cout<<endl<<"Enter number of rows of B: ";
23. cin>>o;
24. cout<<"Enter number of coloumns of B: ";
25. cin>>p;
26. cout<<endl<<"Enter elements of matrix B: "<<endl;
27. for(i=0;i<o;i++)
28. {
29. for(j=0;j<p;j++)
30. {
31. cout<<"Enter element b"<<i+1<<j+1<<": ";
32. cin>>b[i][j];
33. }
34. }
36. cout<<endl<<"Displaying Matrix A: "<<endl<<endl;
37. for(i=0;i<m;i++)
38. {
39. for(j=0;j<n;j++)
40. {
41. cout<<a[i][j]<<" ";
42. }
43. cout<<endl<<endl;
44. }
45. cout<<endl<<"Displaying Matrix B: "<<endl<<endl;
46. for(i=0;i<o;i++)
47. {
48. for(j=0;j<p;j++)
49. {
50. cout<<b[i][j]<<" ";
51. }
52. cout<<endl<<endl;
53. }
54. if(n==o)
55. {
56. for(i=0;i<m;i++)
57. {
58. for(j=0;j<p;j++)
59. {
60. c[i][j]=0;
61. for(int k=0;k<n;k++)
62. {
63. c[i][j]=c[i][j]+a[i][k]*b[k][j];
64. }
65. }
66. }
67. cout<<endl<<"Matrix A * Matrix B = Matrix C: "<<endl<<endl;
68. for(i=0;i<m;i++)
69. {
70. for(j=0;j<p;j++)
71. {
72. cout<<c[i][j]<<" ";
73. }
74. cout<<endl<<endl;
75. }
76. }
77. else
78. cout<<"Multiplication not possible :(";
79. getch();
80. }

Tranpose of matrix in c++

1. #include<iostream.h>
2. #include<conio.h>
3. void main()
4. {
5. clrscr();
6. int a[10][10],m,n,i,j;
7. cout<<"Enter number of rows: ";
8. cin>>m;
9. cout<<"Enter number of coloumns: ";
10. cin>>n;
11. //Coding by:Mir Mueen
12. //http://www.thecorblog.blogspot.com
13. if(m!=n)
14. {
15. cout<<"Matrix not square so Transpose not possible :(";
16. }
17. else
18. {
19. cout<<endl<<"Enter elements of matrix: "<<endl;
20. for(i=0;i<m;i++)
21. {
22. for(j=0;j<n;j++)
23. {
24. cout<<"Enter element a"<<i+1<<j+1<<": ";
25. cin>>a[i][j];
26. }
27. }
28. cout<<endl<<"Displaying Matrix: "<<endl<<endl;
29. for(i=0;i<m;i++)
30. {
31. for(j=0;j<n;j++)
32. {
33. cout<<a[i][j]<<" ";
34. }
35. cout<<endl<<endl;
36. }
37. cout<<endl<<"Displaying Matrix Transpose: "<<endl<<endl;
38. for(i=0;i<m;i++)
39. {
40. for(j=0;j<n;j++)
41. {
42. cout<<a[j][i]<<" ";
43. }
44. cout<<endl<<endl;
45. }
46. }
47. getch();
48. }

How to merge sorted arrays

#include<iostream.h>

#include<conio.h>

void main()

{

clrscr();

int a[10],b[10],c[20];

int i,j,k,m,n;

cout<<"\nNo. of elementin A\t";

cin>>n;

cout<<"\nEnter the element in array\n";

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

{

cin>>a[i];

}

cout<<"\nNo. of elementin B\t";

cin>>m;

cout<<"\nEnter the element in array\n";

for(j=0;j<m;j++)

{

cin>>b[j];

}

i=0;j=0;k=0;

while(i<n&&j<m)

{

if(a[i]<b[j])

{

c[k]=a[i];

i++;

}

else

{

c[k]=b[j];

j++;

}

k++;

}

if(i>=n)

{

for(int p=j;p<m;p++)

{

c[k]=b[p];

k++;

}

}

else

{

for(int p=i;p<n;p++)

{

c[k]=a[p];

k++;

}

}

cout<<"\nMerged array\n";

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

{

cout<<c[i]<<endl;

}

getch();

}