The magnetic levitation trains excludes the impacts of the grating brought about by ordinary rail-wheel contact, so the specialists ought to stress just over the friction from the air. So the study of air is the motivation behind why this train looks so cutting edge. The front car is 92 ft (28 m) long, the aerodynamic nose took the front 45 feet of it. Behind that is seating for 24 travelers, and whatever remains of the train will comprise of an alternate 13 cars, with an total limit for 864 seating travelers.

Audi Sport Quattro LaserLight

Everything is better with lasers. Everything. Audi has kitted its most recent idea auto out with headlights that join lasers and framework Leds to enlighten the way up to 500m in front of you. The developments aren't restricted to the lights – its crossover four liter bi-turbo V8 turbo motor will move you from 0-62mph in 3.7 seconds, and its cutting edge Nvidia-fueled infotainment framework kneads your eyeballs with howdy res 3D design. Move over, KIT.

Futuristic Helicopter Impelled By 4 Rotors

PlC28 is a helicopter particularly intended for the control and support of force lines in the year 2028. The principle part of the outline is the formation of two ergonomic work places and work positions. For the working group comprising of a pilot and a specialist it is extremely significant to have the capacity to create eye contact throughout the entire working period. Together they are a generally prepared group to perform these assignments. We composed Plc28 with the mean to bring the positioning of both tenants to flawlessness while making a safe stage for the specialist outside the helicopter.

World's First 3D printed Bike

The bike is super strong and incredibly light

The MX-6 bike isn't the initial 3d-printed two wheeler – there have been some fairly stout plastic exertions, and Australian-based Flying Machine has made a bicycle utilizing off-the-rack tubes with 3d-printed drags. At the same time Empire Cycles has taken things above and beyond and printed the whole casing – in a few areas – utilizing laser sintering

32GB Compact American Express Card U Disk Card USB Flash Drive memory-Brown

Principle Features: Polished card style USB drive Interface: USB 2.0 Regressive perfect with USB1.1/ 1.0 Plug and play, no drive need Conveyable card size; effectively fit into a wallet Hearty plastic outline, Shock safety Incredible to need to exchange or capacity information Supports Windows 98/ SE/ ME/ 2000/ XP/ 7/ Vista/ Linux/ Mac

New iWatch Concept Gives More Classic Look

This plans (imagined above) has been concocted by Argentinian plan scholar, Tomas Moyano, where he envisions the iwatch with a more excellent and conventional round face. Indeed in the event that you didn't know any better, you might have thought it was a normal watch.

Interestingly Moyano has finished away with a considerable measure of characteristics that smartwatches ordinarily accompany, for example, ports, catches, and speakers. The reason he has avoided them is in light of the fact that he has selected an encased outline to avert tidy and water from entering.

He likewise mades a great point that in the event that you're outside, chances are you may not hear the sounds originating from your watch, which is the reason he has depended on vibrations for warnings. Obviously this is just an idea yet we need to concede that it is a really great one. What do you all think? Is this a smartwatch you could get going to play a part with?

Transformer: lifts 110 pounds of weight with each hand

It gives you a chance to lift up to 220 pounds like you're lifting an infant. It has 22 separate purposes of development. Also it makes you look somewhat like Optimus Prime. It's the "form extender" from Perceptual Robotics Laboratory in Italy. Furthermore it might make one whale of a Halloween ensemble.

The Percro engineers who created the automated exoskeleton say its the most advanced wearable robot created to date. They say it could be utilized to aid in misfortune zones as wearers might have the capacity to lift vast bits of rubble off individuals trapped by quake flotsam and jetsam, however starting now, there's no expression on when it will be accessible. The contraption lets wearers lift up to 110 pounds with each one hand.

"It's a mechanism that is equipped to track the complex developments of the human form, and likewise to enhance the power of the client," Fabio Selsedo from Percro told the BBC.

Program For Pipelining Architecture

import java.util.*;
class InstP
{

 public static void main(String args[])
 { 
  System.out.println("    T1  T2  T3  T4  T5  T6  T7  T8"); 
  for(int i=0;i<4;i++)
  { 
   System.out.print("I"+(i+1)+"  ");
   for(int j =1;j<=4*i;j++)
   System.out.print(" ");
   System.out.println("F"+(i+1)+"  D"+(i+1)+"  E"+(i+1)+"  W"+(i+1));
  }
 }
}

Program For Superscalar Architecture

import java.util.*;
class SuperS
{

 public static void main(String args[])
 { 
  System.out.println("    T1  T2  T3  T4  T5  T6  T7  T8"); 
  for(int i=0;i<8;i+=2)
  { 
   System.out.print("I"+(i+1)+"  ");
   for(int j =1;j<=2*i;j++)
   System.out.print(" ");
   System.out.println("F"+(i+1)+"  D"+(i+1)+"  E"+(i+1)+"  W"+(i+1));
   
   System.out.print("I"+(i+2)+"  "); 
   for(int j =1;j<=2*i;j++)
   System.out.print(" ");  
   System.out.println("F"+(i+2)+"  D"+(i+2)+"  E"+(i+2)+"  W"+(i+2));
  }
 }
}

UDP Client Server Programming //client:
import java.io.*;
import java.net.*;

class Udpcsr {
    public static void main(String args[]) throws Exception
    {
while(true)
{

      BufferedReader inFromUser =
        new BufferedReader(new InputStreamReader(System.in));

      DatagramSocket clientSocket = new DatagramSocket();

      InetAddress IPAddress = InetAddress.getByName("localhost");

      byte[] sendData = new byte[1024];
      byte[] receiveData = new byte[1024];

      String sentence = inFromUser.readLine();

      sendData = sentence.getBytes();

      DatagramPacket sendPacket =
         new DatagramPacket(sendData, sendData.length, IPAddress, 8080);

      clientSocket.send(sendPacket);

      DatagramPacket receivePacket =
         new DatagramPacket(receiveData, receiveData.length);

      clientSocket.receive(receivePacket);

      String modifiedSentence =
          new String(receivePacket.getData());

      System.out.println("FROM SERVER:" + modifiedSentence);
clientSocket.close();
    
 }
    }
}





//server:
import java.io.*;
import java.net.*;

class Udpssr {
  public static void main(String args[]) throws Exception
    {

      DatagramSocket serverSocket = new DatagramSocket(8080);

      byte[] receiveData = new byte[1024];
      byte[] sendData  = new byte[1024];

      while(true)
        {

          DatagramPacket receivePacket =
             new DatagramPacket(receiveData, receiveData.length);

          serverSocket.receive(receivePacket);

          String sentence = new String(receivePacket.getData());
 System.out.println("From client:"+" "+sentence);
          InetAddress IPAddress = receivePacket.getAddress();
 BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
 String sentencesend = br.readLine();
 sendData = sentencesend.getBytes();



          int port = receivePacket.getPort();

         

          DatagramPacket sendPacket =
             new DatagramPacket(sendData, sendData.length, IPAddress,
                              port);

          serverSocket.send(sendPacket);

        }
    }
}

FCFS (First Come First Serve) import java.util.*;
class Fcfs
{
int c=0,at[],bt[],wt=0,twt=0,tat=0,ttat=0,i,pid;
Scanner src=new Scanner(System.in);
void read()
{
System.out.println("enter the number of at,bt of process:"+i);
int at=src.nextInt();
int bt=src.nextInt();
}
void display()
{
pid=++c;
System.out.println(" pid \t  at \t bt n\t wt \t tat");
System.out.print(" "+pid +"\t "+ at+" \t"+ bt+" \t");
System.out.println(wt-at+" \t"+ wt+bt-at+"\t");
wt+=bt-at;
}
}
class Cfcfs
{
public static void main(String args[])
{
Scanner src=new Scanner(System.in);
Fcfs a=new Fcfs();
int ch;
do
{
System.out.println("1:read\n2:display\n3:exit \n enter ur choice");
ch=src.nextInt();
switch(ch)
{
case 1:
a.read();
break;
case 2:
a.display();
break;
case 3:
break;
}
}
while(ch!=3);
}
}

Cyclic Redundancy Code import java.util.*;


class U
{
public  static String remainder(String data, String divisor) {
    int x = 1, z = divisor.length(), j = 0, i;
    String data2 = "", strOfZeros = "";
    int y = divisor.length() - 1;
    /* This is to get correct amount of zero's onto the end of the data */
    while (y > 0) {
        data += "0";
        y--;
    }
    // Main part of method, this is the long division of Binary numbers.
    needToExit: for (i = x, j = 1; i < z && z <= data.length(); i++, j++) {
        if (z == data.length() && data2.charAt(0) == '1') {
            strOfZeros = "";
            for (i = 1; i < divisor.length(); i++) {   
                if (data2.charAt(i) == divisor.charAt(i))
                    strOfZeros += '0';
                else
                    strOfZeros += '1';
            }
            data2 = strOfZeros;
            break needToExit;
        }

        if (data.charAt(i) == divisor.charAt(j))
            data2 += "0";
        else
            data2 += "1";

        if (i == divisor.length() - 1) {
            data2 += data.charAt(z);
            x++;
            z++;
            // i = x;
            j = 0;

            // when first bit is a 0
            while (data2.charAt(0) != '1' && i == divisor.length() - 1) {
                for (i = 1; i < divisor.length(); i++) {
                    if (data2.charAt(i) == '0')
                        strOfZeros += "0";
                    else
                        strOfZeros += "1";
                }
                strOfZeros += data.charAt(z);
                data2 = strOfZeros;
                strOfZeros = "";
                x++;
                z++;
                i = x;
            }
        }

    }
    return data2;
}
public static String codeword(String x,String y)
{
StringBuffer d=new StringBuffer(x);
for(int i=0;i<y.length();i++)
{
char c,l;
c=d.charAt(d.length()-i-1);
l=y.charAt(y.length()-i-1);
int a=(int)c-48;
int b=(int)c-48;
int q=a^b;
d.setCharAt((d.length()-i-1),(char)(q+48));
}
String h=d.toString();
return h;
}
}
class CRCC
{
public static void main(String args[])
{
Scanner src=new Scanner(System.in);
System.out.println("enter the data word");
String s=src.nextLine();
System.out.println("enter the divisor");
String x=src.nextLine();
String h=U.remainder(s,x);
System.out.println("the remainder is:"+h);
String a=U.codeword(s,h);
System.out.println("the codewordis:"+a);
Random r=new Random();
String w="";
StringBuffer sb=new StringBuffer(w);
for(int i=0;i<7;i++);
{
if(r.nextBoolean()==true)
sb.append('1');
else
sb.append('0');
}
System.out.println("the recieved bits are:"+sb);
String j=sb.toString();
String k=U.remainder(j,x);
if(k=="000")
System.out.println("No ERROR");
else
System.out.println("ERROR");
}
}

Error Detection Using Parity Bit import java.util.*;
class Parity
{
public static String count(String x)
{
int j=0;
for(int i=0;i<x.length();i++)
{
if(x.charAt(i)=='1')
j++;
}
StringBuffer s=new StringBuffer(x);
if(j%2==0)
{

s.append('0');
}
else
s.append('1');
System.out.println("parity: "+j);
return s.toString();
}

}
class Check
{
public static void main(String args[])
{
Scanner src=new Scanner(System.in);
System.out.println("enter the string");
String s1=src.nextLine();
StringBuffer sb1=new StringBuffer(s1);
Random rb=new Random();
String s2="";
StringBuffer sb2=new StringBuffer(s2);
for(int i=0;i<s1.length();i++)
{
if(rb.nextBoolean()==true)
sb2.append('1');
else
sb2.append('0');
}
System.out.println(" random number without parity"+sb2);
String a;
a=Parity.count(sb1.toString());
String b;
b=Parity.count(sb2.toString());
System.out.println("Numbers with parity:");
System.out.println(a+"\n"+b);
char ch1=a.charAt(a.length()-1);
char ch2=b.charAt(b.length()-1);
if(ch1==ch2)
{
System.out.println("No error");
}
else
System.out.println("ERROR");
}
}

Error Correction and Detection Using Hamming Code import java.util.*;
class Parity
{
public static char count(String x)
{
int j=0;
for(int i=0;i<x.length();i++)
{
if(x.charAt(i)=='1')
j++;
}
if(j%2==0)
return '0';
else
return '1';
}
 public static char r0bits( String x)
{
StringBuffer sb=new StringBuffer(x);
String y="";
StringBuffer s=new StringBuffer(y);
s.append(sb.charAt(1));
s.append(sb.charAt(2));
s.append(sb.charAt(3));
String w=s.toString();
char ch=count(w);
return ch;
}

public static char r1bits( String x)
{
StringBuffer sb=new StringBuffer(x);
String y="";
StringBuffer s=new StringBuffer(y);
s.append(sb.charAt(0));
s.append(sb.charAt(1));
s.append(sb.charAt(2));
String w=s.toString();
char ch=count(w);
return ch;
}

public static char r2bits( String x)
{
StringBuffer sb=new StringBuffer(x);
String y="";
StringBuffer s=new StringBuffer(y);
s.append(sb.charAt(2));
s.append(sb.charAt(3));
s.append(sb.charAt(0));
String w=s.toString();
char ch=count(w);
return ch;
}


public static char sj(String x)
{
StringBuffer sb=new StringBuffer(x);
String y="";
StringBuffer s=new StringBuffer(y);
s.append(sb.charAt(1));
s.append(sb.charAt(2));
s.append(sb.charAt(3));
s.append(sb.charAt(6));
String w=s.toString();
char ch=count(w);
return ch;
}


 public static char sy(String x)
{
StringBuffer sb=new StringBuffer(x);
String y="";
StringBuffer s=new StringBuffer(y);
s.append(sb.charAt(0));
s.append(sb.charAt(1));
s.append(sb.charAt(2));
s.append(sb.charAt(5));
String w=s.toString();
char ch=count(w);
return ch;
}


 public static char sp(String x)
{
StringBuffer sb=new StringBuffer(x);
String y="";
StringBuffer s=new StringBuffer(y);
s.append(sb.charAt(2));
s.append(sb.charAt(3));
s.append(sb.charAt(0));
s.append(sb.charAt(4));
String w=s.toString();
char ch=count(w);
return ch;
}

}
class Hamming
{
public static void main(String args[])
{
Scanner src=new Scanner(System.in);
System.out.println("Message bits");
String s1=src.nextLine();
char r2=Parity.r2bits(s1);
char r1=Parity.r1bits(s1);
char r0=Parity.r0bits(s1);
StringBuffer sb=new StringBuffer(s1);
sb.append(r2);
sb.append(r1);
sb.append(r0);
System.out.println("code word is:"+sb);
System.out.println("enter the bits on receiver side");
String f=src.nextLine();
StringBuffer a=new StringBuffer(f);
a.append(r2);
a.append(r1);
a.append(r0);
System.out.println("received bits are"+a);
String n=a.toString();
String q="";
StringBuffer u=new StringBuffer(q);
char s0,s3,s2;
s0=Parity.sj(n);
s3=Parity.sy(n);
s2=Parity.sp(n);
u.append(s2);
u.append(s3);
u.append(s0);
System.out.println("Syndrome is:"+u);
String i=u.toString();


switch(i)
{
case "000":
System.out.println("NO ERROR");
break;

case "001":
System.out.println("7th bit is in error");
if(a.charAt(6)=='0')
a.setCharAt(6,'1');
else
a.setCharAt(6,'0');
System.out.println("the correct received bits are:"+a);
break;
case "010":
System.out.println("2nd bit is in error");
if(a.charAt(1)=='0')
a.setCharAt(1,'1');
else
a.setCharAt(1,'0');
System.out.println("the correct received bits are:"+a);
break;

case "011":
System.out.println("6th bitis in error");
if(a.charAt(5)=='0')
a.setCharAt(5,'1');
else
a.setCharAt(5,'0');
System.out.println("the correct received bits are:"+a);
break;

case "100":
System.out.println("5th bit is in error");
if(a.charAt(4)=='0')
a.setCharAt(4,'1');
else
a.setCharAt(4,'0');
System.out.println("the correct received bits are:"+a);
break;

case "101":
System.out.println("4th bit is in error");
if(a.charAt(3)=='0')
a.setCharAt(3,'1');
else
a.setCharAt(3,'0');
System.out.println("the correct received bits are:"+a);
break;

case "110":
System.out.println("1st bit is inerror ");
if(a.charAt(0)=='0')
a.setCharAt(0,'1');
else
a.setCharAt(0,'0');
System.out.println("the correct received bits are:"+a);
break;

case "111":
System.out.println("3rd bit is in error");
if(a.charAt(2)=='0')
a.setCharAt(2,'1');
else
a.setCharAt(2,'0');

System.out.println("the correct received bits are:"+a);
break;
}


}
}

Common Characters In Two Strings import java.util.*;
class Common
{
public static void main(String args[])
{
Scanner src= new Scanner(System.in);
System.out.println("enter the two strings");
String s1=src.nextLine();
String s2=src.nextLine();
String c="";
StringBuffer sb=new StringBuffer(c);
for(int i=0;i<s2.length();i++)
{
char ch=s2.charAt(i);
    for(int j=0;j<s1.length();j++)
    {
    if(ch==s1.charAt(j))
    {
        int k;
        for( k=0;k<sb.length();k++)

            {
            if(ch==sb.charAt(k))
            break;
            else
            continue;
            }
        if(k>=sb.length())
        sb.append(ch);
    }
    else
    continue;
    }

}
System.out.println(sb);
}
}

Simple Linear Regression import java.util.*;
Future Tanks with Adaptive Technology
class SimpleLR
{
static double[][] dataArray;
static double sumX,sumY,sumXY,sumXX,alpha,beta;
static int totalCount;
public static void main(String args[])
{
Scanner src= new Scanner(System.in);
System.out.println("Enter no. of entries");
totalCount=src.nextInt();
dataArray=new double[totalCount][2];
for(int i=0;i<totalCount;i++)
{
System.out.print((i+1)+" x=");
dataArray[i][0]=src.nextDouble();
System.out.print(" y=");
dataArray[i][1]=src.nextDouble();
System.out.println();
}
printDataArray();
calculateSums();
calculateAlphaBeta();
System.out.println("enter value of X:");
calculateY(src.nextDouble());
}
static void calculateY(double x)
{
double y;
y=alpha+(beta*x);
System.out.println("Y: "+y);
}
static void calculateAlphaBeta()
{
beta=((totalCount*sumXY)-(sumX*sumY))/((totalCount*sumXX)-(sumX*sumX));
alpha=((sumY-(beta*sumX))/totalCount);
System.out.println("beta : "+beta+" alpha : "+alpha);
}
static void calculateSums()
{
for(int i=0;i<totalCount;i++)
{
sumX=sumX+dataArray[i][0];
sumY=sumY+dataArray[i][1];
sumXY=(dataArray[i][0]*dataArray[i][1])+sumXY;
sumXX=(dataArray[i][0]*dataArray[i][0])+sumXX;
}
System.out.println("sumX: "+sumX+"sumY: "+sumY+"sumXY: "+sumXY+"sumXX: "+sumXX);
}
static void printDataArray()
{
for(int i=0;i<totalCount;i++)
System.out.println(dataArray[i][0]+" "+dataArray[i][1]);
}
}

import java.util.*;
class Compute
{
public static String complement(String s)
{
StringBuffer d= new StringBuffer(s);
for(int i=0;i<d.length();i++)
{
if(d.charAt(i)=='1')
d.setCharAt(i,'0');
else
d.setCharAt(i,'1');
}
String j=d.toString();

return j;
}
public static String checksum(int sum)
{
String s;

s=Integer.toBinaryString(sum);

System.out.println("the sum in binary is"+s);
String z=s.substring(0,2);
String y=s.substring(2,s.length());
StringBuffer sb1=new StringBuffer(z);
StringBuffer sb2=new StringBuffer(y);
System.out.println(sb1);
System.out.println(sb2);
for(int i=0;i<2;i++)
{

char ch1,ch2;
ch1=sb1.charAt(i);
int l=(int)ch1;
ch2=sb2.charAt((sb2.length()/2)+i);
int m=(int)ch2;
char ch;
ch=(char)(l|m);
sb2.setCharAt((sb2.length()/2)+i,ch);

}
System.out.println("the wrapped sum is"+sb2);
String e=sb2.toString();
String h;
h=Compute.complement(e);
return h;
}
}

class Cs
{
public static void main(String args[])
{
Scanner src= new Scanner(System.in);
int a[],n;
int sum=0;
System.out.println("enter the no of frames to be sent");
 n=src.nextInt();
a=new int[n];
System.out.println("enter the frames");
for(int i=0;i<n;i++)
a[i]=src.nextInt();
for(int i=0;i<n;i++)
sum=sum+a[i];
System.out.println("the sum is"+sum);
String scs=Compute.checksum(sum);
System.out.println("the check sum is"+scs);
int g=Integer.parseInt(scs,2);
System.out.println(g);
System.out.println("frames sent will be");
for(int i=0;i<a.length;i++)
System.out.print(a[i]+" ");
System.out.println(g);
int sum2=0;
sum2=sum+g;
String f=Compute.checksum(sum2);
System.out.println(" Cheksum at reciever:"+f);
if(f.equals("0000"))
System.out.println(" NO ERROR");
else
System.out.println("ERROR");



}
}

Error Detection Using Checksum

Inflatable Bulb Tent
This cool tent characteristics twofold sewing and fourfold sewing in high stretch ranges, for example, corners and other tear hazard regions. It is produced out of top quality 0.6mm Oxford Cloth PVC / Tarpaulian that is blaze retardant. It is fabulous for outdoors and the agreeable air pocket arch settles on it a phenomenal decision as a safe house at the vacation spot or in any viable grand zone where you wish to see your surroundings. Expanding is not a troublesome assignment and might be carried out by utilizing the included blower which is supplied with a wooden case.
A great thought for any individual who is not extraordinary at raising universal styled tents, it could be a muddled assignment for the unpracticed camper. This is an extravagance tent that is agreeable, simple to utilize and great. It looks awesome and is an amazing blessing thought for any prepared or amatuer camper. And also being flame retardant it is likewise waterproof advantageous for outdoors as well as a convenient sun protect that could be utilized throughout outside recreation exercises.

ASCIMiner Block Erupter USB 300 MH/s Sapphire Miner

Product Description: The USB Blosk Erupter is the second major product of Bitfountain .This allows you to quickly and easily mine Bitcoins directly from your PC .It will hash at 300 MH/s and is powered directly from your USB port. It uses significantly less power than a GPU. Technical Details Plugs Usage:500-510 mA,2.5 W Plugs into standard USB port Bitcoin hashrate above 300 MH/sec SMT machine assembly Green LED indicates when a share is found