Posts Tagged ‘ English ’

Single variable optimization

January 1, 2011
By

Optimization means to seek minima or maxima of a funtion within a given defined domain. If a function reach its maxima or minima, the derivative at that point is approaching to 0. If we apply Newton-Raphson method for root finding to f’, we can get the optimizing f. Read More: 223 Words Totally

Read more »

one-dimensional integrals

December 25, 2010
By
one-dimensional integrals

The foundamental idea of numerical integration is to estimate the area of the region in the xy-plane bounded by the graph of function f(x). The integral was esimated by divide x to small intervals, then add all the small approximations to give a total approximation. Read More: 468 Words Totally

Read more »

one-dimensional integrals

December 25, 2010
By
one-dimensional integrals

The foundamental idea of numerical integration is to estimate the area of the region in the xy-plane bounded by the graph of function f(x). The integral was esimated by divide x to small intervals, then add all the small approximations to give a total approximation. Read More: 468 Words Totally

Read more »

Project Euler — Problem 187

December 23, 2010
By

http://projecteuler.net/index.php?section=problems&id=187 A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3. There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26. Read...

Read more »

Project Euler — Problem 187

December 23, 2010
By

http://projecteuler.net/index.php?section=problems&id=187 A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3. There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26. Read...

Read more »

Root finding

December 4, 2010
By

Numerical root finding methods use iteration, producing a sequence of numbers that hopefully converge towards a limits which is a root. In this post, only focus four basic algorithm on root finding, and covers bisection method, fixed point method, Newton-Raphson method, and secant method. Read More: 1896 Words Totally

Read more »

Root finding

December 4, 2010
By

Numerical root finding methods use iteration, producing a sequence of numbers that hopefully converge towards a limits which is a root. In this post, only focus four basic algorithm on root finding, and covers bisection method, fixed point method, Newton-Raphson method, and secant method. Read More: 1886 Words Totally

Read more »

bubble chart by using ggplot2

December 1, 2010
By
bubble chart by using ggplot2

The visualization represented by Hans Rosling’s TED talk was very impressive. FlowingData provides a tutorial on making bubble chart in R. I try to create bubble chart by using ggplot2. With the dataset provided by FlowingData,The bubble chart was made by the following code. Read More: 548 Words Totally

Read more »

bubble chart by using ggplot2

December 1, 2010
By
bubble chart by using ggplot2

The visualization represented by Hans Rosling’s TED talk was very impressive. FlowingData provides a tutorial on making bubble chart in R. I prefer ggplot2 for graphics.

Read more »

The avalanche of publications mentioning GO

November 30, 2010
By
The avalanche of publications mentioning GO

Gene Ontology is the de facto standard for annotation of gene products. It has been widely used in biological data mining, and I believe it will play more central role in the future. Publications mentioning GO was collected and deposited in GO ftp, and can be accessed (ftp://ftp.geneontology.org/go/doc/). Read More: 454 Words Totally

Read more »