4 files changed, 36 insertions, 32 deletions

diff --git a/math/p5-Math-Expr/pkg-descr b/math/p5-Math-Expr/pkg-descr
index 2da05bf0c14e..bd60aac72c5a 100644
--- a/math/p5-Math-Expr/pkg-descr
+++ b/math/p5-Math-Expr/pkg-descr
@@ -5,3 +5,5 @@ might be used as operators. The operators can consist of multiple
 characters.  The only limitation is that a variable or function
 name may not start on a digit, and not all chars are accepted in
 operation names.
+
+WWW: http://search.cpan.org/search?dist=Math-Expr
diff --git a/math/p5-Math-FFT/pkg-descr b/math/p5-Math-FFT/pkg-descr
index d701e1d2a1fd..a28c9a70babd 100644
--- a/math/p5-Math-FFT/pkg-descr
+++ b/math/p5-Math-FFT/pkg-descr
@@ -19,4 +19,4 @@ arrays to and from C comes from the PGPLOT module of Karl Glazebrook
 is Copyright 2000 by Randy Kobes <randy@theoryx5.uwinnipeg.ca>,
 and may be distributed under the same terms as Perl itself.
 
-WWW: http://momonga.t.u-tokyo.ac.jp/~ooura/fft.html
+WWW: http://search.cpan.org/search?dist=Math-FFT
diff --git a/math/p5-Math-Interpolate/pkg-descr b/math/p5-Math-Interpolate/pkg-descr
index 7af9c0ed75ec..e84b041f8198 100644
--- a/math/p5-Math-Interpolate/pkg-descr
+++ b/math/p5-Math-Interpolate/pkg-descr
@@ -1,24 +1,24 @@
-This module contains several useful routines for interpolating data
-sets and finding where a given value lies in a sorted list.
-The first is a subroutine used to locate a position in an array of
-values where a given value would fit using bisection. It has been
-designed to be efficient in the common situation that it is called
-repeatedly. The user can supply a different set of comparison
-operators to replace the standard < and <=. For example, given a
-list (1, 2, 5, 8, 15) and the number 9.5 it would return 3.
+* This module contains several useful routines for interpolating
+  data sets and finding where a given value lies in a sorted list.
+  The first is a subroutine used to locate a position in an array
+  of values where a given value would fit using bisection. It has
+  been designed to be efficient in the common situation that it is
+  called repeatedly. The user can supply a different set of comparison
+  operators to replace the standard < and <=. For example, given a
+  list (1, 2, 5, 8, 15) and the number 9.5 it would return 3.
+* The remaining routines all are related to interpolating sets of
+  (x,y) data pairs. They all take a list of (x,y) data pairs given
+  another x value, return a sensible y value using the list of (x,y)
+  data pairs. Three different interpolating functions are provided.
+  The first, called a constant interpolator, assumes that the
+  function being interpolated moves in non-linear jumps from one
+  value to another. The interpolated value for some value x is the
+  y value of the neighboring (x,y) to the left of the given x. The
+  second interpolator performs a linear interpolation between the
+  neighboring points. The third interpolator is called the robust
+  interpolator and interpolates a smooth curve between all of the
+  (x,y) pairs. To do the interpolation, it first calculates some
+  reasonable derivatives at the (x,y) pairs. The robust interpolator
+  can also use derivative information supplied by the user.
 
-The remaining routines all are related to interpolating sets of
-(x,y) data pairs. They all take a list of (x,y) data pairs given
-another x value, return a sensible y value using the list of (x,y)
-data pairs. Three different interpolating functions are provided.
-The first, called a constant interpolator, assumes that the function
-being interpolated moves in non-linear jumps from one value to
-another. The interpolated value for some value x is the y value of
-the neighboring (x,y) to the left of the given x. The second
-interpolator performs a linear interpolation between the neighboring
-points. The third interpolator is called the robust interpolator
-and interpolates a smooth curve between all of the (x,y) pairs.
-To do the interpolation, it first calculates some reasonable
-derivatives at the (x,y) pairs. If you have measured your own
-derivative information, you can supply it to the robust interpolator
-and it will use it.
+WWW: http://search.cpan.org/search?dist=Math-Interpolate
diff --git a/math/p5-Math-Logic/pkg-descr b/math/p5-Math-Logic/pkg-descr
index c97c337c80f0..c489b7f12037 100644
--- a/math/p5-Math-Logic/pkg-descr
+++ b/math/p5-Math-Logic/pkg-descr
@@ -1,10 +1,12 @@
 Perl's built-in logical operators, C<and>, C<or>, C<xor> and C<not>
 support 2-value logic. This means that they always produce a result
-which is either true or false. In fact perl sometimes returns 0
-and sometimes returns undef for false depending on the operator
-and the order of the arguments. For "true" Perl generally returns
-the first value that evaluated to true which turns out to be
-extremely useful in practice. Given the choice Perl's built-in
-logical operators are to be preferred -- but when you really want
-pure 2-degree logic or 3-degree logic or multi-degree logic they
-are available through this module
+which is either true or false. In fact perl sometimes returns 0 and
+sometimes returns undef for false depending on the operator and the
+order of the arguments. For "true" Perl generally returns the first
+value that evaluated to true which turns out to be extremely useful
+in practice. Given the choice Perl's built-in logical operators are
+to be preferred -- but when you really want pure 2-degree logic or
+3-degree logic or multi-degree logic they are available through
+this module
+
+WWW: http://search.cpan.org/search?dist=Math-Logic