Thursday, December 10, 2009

Shortest path Algorithm

Given a graph, the source and the destination, it is an important problem to find the shortest path between the source and the destination. Shortest path is used in scheduling, routing and other application areas.
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to another on a road map; in this case, the vertices represent locations and the edges represent segments of road and are weighted by the time needed to travel that segment.

# Dijkstra's algorithm solves the single-pair, single-source, and single-destination shortest path problems.
# Bellman-Ford algorithm solves single source problem if edge weights may be negative.

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

Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing. An equivalent algorithm was developed by Edward F. Moore in 1957.

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined.

Here is the Pseudocode:
shortestPath(Graph, source){
for each vertex v in Graph {
dist[v] = infinity;
previous[v] = NULL;
}
dist[source] = 0 ;
for all neigbors of source {
add to Quene
}
while Quene is not empty {
u = remove from Quene;

for each neighbor v of u {
length = dist[u] + path(u, v);
if (length < dist[v]) {
dist[v] = length;
previous[v] = u;
}
}
return Graph;
}
}


http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Tuesday, December 1, 2009

Edit music online



You can create new music and edit music online.
Change the sample rates and mixing.
You can make a home music with your real voice.

URL:

http://www.musiceditingonline.com/

Online music share tools


Web 2.0 tool. share music online.

Share and download music online.
Supports iPod and MP3 players
You can make new friends and connect with old ones.
You can Share, Discover and Download music and videos.


BearShare is a file-sharing program that lets you find, download, share, and publish audio and video files. An ever-growing community of millions of registered users ensures quick location and download of virtually any type of file available on the P2P network. With the power of the Bearshare network you can listen to and download songs that are 100% legal. BearShare 8 allows you to explore and experience the power of the Bearshare network where you can access millions of songs and a great music community instantaneously. With BearShare 8 you get: instant connections, a powerful search engine, and great tools to share and experience music including, playlists, unique compilations and great mood music.


http://www.bearshare.com/

Cloning pets and human being

DNA has the commands and requirements to reproduce part of the body of animal and human being.
More and more companies like to clone part of the body to cure disease instead of cloning the whole body.

Ever since the announcement of Dolly the cloned sheep, the idea of human cloning has been both an area of interest for conspiracy theorists and real scientists alike. Since the release of the movie "The Island," the ethical debate revolving around cloning has only gotten more intense. But how exactly would human cloning work?



Step 1. Grow the human cells. First, you would need to separate and artificially grow your human cells from a provided piece of human tissue. Once you have enough human cells grown you must then transfer those cells on to a piece of media with just enough atmosphere to survive but not continue to divide. This is called a "quiescence" state. These human cells will become the material needed to clone the person that the human tissue was obtained from.

Step 2. Remove the nucleus from an unfertilized human egg cell. When you do this you must be sure to be as careful as possible as causing damage to the rest of the cell could ruin the chances of having a viable clone in future steps. Throw away the nucleus once it has been removed.

Step 3. Implant the quiescent cell into the zona pellucida surrounding the unfertilized egg cell.

Step 4 Shock the cell. Since no actual human cloning has taken place as far as we know thus far, we can not say for sure how long it would take to shock the cell into combining the embryo with the human growth cells from the person to be cloned. Once the two cells have fused together, the electroshock will cause the DNA to move across the membrane into the embryo.

Step 5. Continue these steps until you have a good amount of embryos. Many of your embryos will not survive the process, hence the need for more than one to guarantee that you will be able to produce a clone.

Step 6.

Implant the clone embryo within a surrogate mother until she comes to term and delivers the clone baby.

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

Clone a person genetically. It has the same appearances.
Steps to clone a person.
http://www.ehow.com/how_4495553_clone-person.html


Clone the Dolly sheep.
Dolly (5 July 1996 – 14 February 2003) was a female domestic sheep remarkable in being the first mammal to be cloned from an adult somatic cell, using the process of nuclear transfer.[

http://en.wikipedia.org/wiki/Dolly_(sheep)



Couple pays 155K to clone a dog from NBC news in Jan2009.
http://www.msnbc.msn.com/id/28892792/

Here are the steps to clone a dog.
Cloning a dog will not bring the exact dog back to life, but it will make an genetic replica

http://www.ehow.com/how_4769600_clone-a-dog.html