Result:
found more than 994 distributions - search limited to the first 2001 files matching your query
( run in 0.800 )
Algorithm-HITS-Lite
view release on metacpan or search on metacpan
inc/Module/Install.pm view on Meta::CPAN
use strict 'vars';
use vars qw{$VERSION};
BEGIN {
# All Module::Install core packages now require synchronised versions.
# This will be used to ensure we don't accidentally load old or
# different versions of modules.
# This is not enforced yet, but will be some time in the next few
# releases once we can make sure it won't clash with custom
# Module::Install extensions.
$VERSION = '0.64';
Algorithm-HowSimilar
view release on metacpan or search on metacpan
A README file is required for CPAN modules since CPAN extracts the
README file from a module distribution so that people browsing the
archive can use it get an idea of the modules uses. It is usually a
good idea to provide version information here so that people can
decide whether fixes for the module are worth downloading.
INSTALLATION
To install this module type the following:
Algorithm-IncludeExclude
view release on metacpan or search on metacpan
inc/Module/Install.pm view on Meta::CPAN
use strict 'vars';
use vars qw{$VERSION};
BEGIN {
# All Module::Install core packages now require synchronised versions.
# This will be used to ensure we don't accidentally load old or
# different versions of modules.
# This is not enforced yet, but will be some time in the next few
# releases once we can make sure it won't clash with custom
# Module::Install extensions.
$VERSION = '0.64';
Algorithm-InversionList
view release on metacpan or search on metacpan
A README file is required for CPAN modules since CPAN extracts the
README file from a module distribution so that people browsing the
archive can use it get an idea of the modules uses. It is usually a
good idea to provide version information here so that people can
decide whether fixes for the module are worth downloading.
Use "perldoc Algorithm::InversionList" after installation.
INSTALLATION
Algorithm-KMeans
view release on metacpan or search on metacpan
examples/cluster_and_visualize.pl view on Meta::CPAN
## each data record is in the first column and you want to cluster 3D data
## that is in the next three columns, your data mask will be N111. On the
## other hand, if for the same data file, you want to carry out 2D
## clustering on the last two columns, your data mask will be N011.
##
## 3) Next, you need to decide how many clusters you want the program to return.
## If you want the program to figure out on its own how many clusters to
## partition the data into, see the script find_best_K_and_cluster.pl in this
## directory.
##
## 4) Next you need to decide whether you want to `random' seeding or `smart'
## seeding. Bear in mind that `smart' seeding may produce worse results
## than `random' seeding, depending on how the data clusters are actually
## distributed.
##
## 5) Next you need to decide whether or not you want to use the Mahalanobis
## distance metric for clustering. The default is the Euclidean metric.
##
## 6) Finally, you need to choose a mask for visualization. Here is a reason
## for why the visualization mask is set independently of the data mask
## that was specified in Step 2: Let's say your datafile has 8 columns and
Algorithm-KernelKMeans
view release on metacpan or search on metacpan
inc/Module/Install.pm view on Meta::CPAN
use File::Path ();
use vars qw{$VERSION $MAIN};
BEGIN {
# All Module::Install core packages now require synchronised versions.
# This will be used to ensure we don't accidentally load old or
# different versions of modules.
# This is not enforced yet, but will be some time in the next few
# releases once we can make sure it won't clash with custom
# Module::Install extensions.
$VERSION = '1.00';
Algorithm-Kmeanspp
view release on metacpan or search on metacpan
inc/Module/Install.pm view on Meta::CPAN
use strict 'vars';
use vars qw{$VERSION $MAIN};
BEGIN {
# All Module::Install core packages now require synchronised versions.
# This will be used to ensure we don't accidentally load old or
# different versions of modules.
# This is not enforced yet, but will be some time in the next few
# releases once we can make sure it won't clash with custom
# Module::Install extensions.
$VERSION = '0.91';
Algorithm-LBFGS
view release on metacpan or search on metacpan
inc/Module/Install.pm view on Meta::CPAN
use strict 'vars';
use vars qw{$VERSION};
BEGIN {
# All Module::Install core packages now require synchronised versions.
# This will be used to ensure we don't accidentally load old or
# different versions of modules.
# This is not enforced yet, but will be some time in the next few
# releases once we can make sure it won't clash with custom
# Module::Install extensions.
$VERSION = '0.68';
Algorithm-LCSS
view release on metacpan or search on metacpan
A README file is required for CPAN modules since CPAN extracts the
README file from a module distribution so that people browsing the
archive can use it get an idea of the modules uses. It is usually a
good idea to provide version information here so that people can
decide whether fixes for the module are worth downloading.
INSTALLATION
To install this module type the following:
Algorithm-LeakyBucket
view release on metacpan or search on metacpan
lib/Algorithm/LeakyBucket.pm view on Meta::CPAN
{
if ($bucket->tick)
{
# allowed
do_something();
# maybe decide to change limits?
$bucket->ticks(2);
$bucket->seconds(5);
}
}
Algorithm-LibLinear
view release on metacpan or search on metacpan
src/liblinear/linear.cpp view on Meta::CPAN
double ywTx = 0, xisq = xTx[i];
feature_node * const xi = prob->x[i];
ywTx = yi*sparse_operator::dot(w, xi);
double a = xisq, b = ywTx;
// Decide to minimize g_1(z) or g_2(z)
int ind1 = 2*i, ind2 = 2*i+1, sign = 1;
if(0.5*a*(alpha[ind2]-alpha[ind1])+b < 0)
{
ind1 = 2*i+1;
ind2 = 2*i;
Algorithm-Line-Lerp
view release on metacpan or search on metacpan
# else
# define D_PPP_TO_FOLD_CALLEE(s,r,l) to_utf8_fold(s,r,l)
# endif
# else /* Below is 5.15.6, which failed to make the macros available
# outside of core, so we have to use the 'Perl_' form. khw
# decided it was easier to just handle this case than have to
# document the exception, and make an exception in the tests below
# */
# define D_PPP_TO_LOWER_CALLEE(s,r,l) \
Perl__to_utf8_lower_flags(aTHX_ s, r, l, 0, NULL)
# define D_PPP_TO_TITLE_CALLEE(s,r,l) \
Algorithm-LineSegments
view release on metacpan or search on metacpan
0.03 March 2013
- Floating point number serialisation apparently differs among
platforms, making a test fail; attempt to address that.
0.02 March 2014
- Removed accidental debug print
0.01 March 2014
- Initial release
Algorithm-Loops
view release on metacpan or search on metacpan
lib/Algorithm/Loops.pm view on Meta::CPAN
} $cgi->...,
...
$cgi->...;
Note that it also also works correctly if you change how you output your
HTML and accidentally switch from list to scalar context:
my $html= '';
...
$html .= Filter {
s/%(\w*)%/expand($1)/g
lib/Algorithm/Loops.pm view on Meta::CPAN
worth. This makes using even the less problematic cases often not a good
idea.
=back
However, I have decided to use a prototype here because:
=item
Several other functions from this module already use prototypes to good
advantage, enough advantage that I'd hate to lose it.
Algorithm-MLCS
view release on metacpan or search on metacpan
that should be provided before the module is installed.
A README file is required for CPAN modules since CPAN extracts the README
file from a module distribution so that people browsing the archive
can use it to get an idea of the module's uses. It is usually a good idea
to provide version information here so that people can decide whether
fixes for the module are worth downloading.
INSTALLATION
Algorithm-NCS
view release on metacpan or search on metacpan
Algorithm-NCS/README view on Meta::CPAN
A README file is required for CPAN modules since CPAN extracts the
README file from a module distribution so that people browsing the
archive can use it get an idea of the modules uses. It is usually a
good idea to provide version information here so that people can
decide whether fixes for the module are worth downloading.
INSTALLATION
To install this module type the following:
Algorithm-NeedlemanWunsch
view release on metacpan or search on metacpan
lib/Algorithm/NeedlemanWunsch.pm view on Meta::CPAN
defined and the specific callback isn't.
Note that C<select_align> is called I<instead> of the specific
callbacks, not in addition to them - users defining both
C<select_align> and other callbacks should probably call the specific
callback explicitly from their C<select_align>, once it decides which
one to prefer.
Also note that the passed positions move backwards, from the sequence
ends to zero - if you're building the alignment in your callbacks, add
items to the front.
lib/Algorithm/NeedlemanWunsch.pm view on Meta::CPAN
=head1 CREDITS
The algorithm is defined by Saul Needleman and Christian Wunsch in "A
general method applicable to the search for similarities in the amino
acid sequence of two proteins", J Mol Biol. 48(3):443-53.
This implementation is based mostly on
L<http://www.ludwig.edu.au/course/lectures2005/Likic.pdf>, local
alignment is from
L<http://www.techfak.uni-bielefeld.de/bcd/Curric/PrwAli/node6.html>.
Algorithm-Networksort
view release on metacpan or search on metacpan
See the documentation for nw_comparator() for more information.
- Undid use of mark attributes for SVG graphing. Too many inconsistencies
between different SVG viewers for me to be sure that I'm doing the right
thing.
- While undoing that change, simplified the code that generates the
group/color attributes. I decided that individually assigning the
color attribute to each element was probably a less error-prone mechanism.
- Updated svg.pl and eps.pl in the eg directory to make use of the
color options.
- Fixed the nw_group() example. It was using the default 'bosenelson'
algorithm, but the output was from the 'batcher' algorithm. Oops.
Algorithm-Pair-Swiss
view release on metacpan or search on metacpan
lib/Algorithm/Pair/Swiss.pm view on Meta::CPAN
=item $pair-E<gt>B<drop>( @parties )
Excludes the given parties from further pairing. The given parties will
be removed from the internal parties list and won't be returned by the
parties method anymore. This method is usually used when a participant
has decided to quit playing.
=cut
sub drop {
my $self = shift;
Algorithm-QuadTree-XS
view release on metacpan or search on metacpan
# else
# define D_PPP_TO_FOLD_CALLEE(s,r,l) to_utf8_fold(s,r,l)
# endif
# else /* Below is 5.15.6, which failed to make the macros available
# outside of core, so we have to use the 'Perl_' form. khw
# decided it was easier to just handle this case than have to
# document the exception, and make an exception in the tests below
# */
# define D_PPP_TO_LOWER_CALLEE(s,r,l) \
Perl__to_utf8_lower_flags(aTHX_ s, r, l, 0, NULL)
# define D_PPP_TO_TITLE_CALLEE(s,r,l) \
Algorithm-QuineMcCluskey
view release on metacpan or search on metacpan
lib/Algorithm/QuineMcCluskey/Util.pm view on Meta::CPAN
my $str = "d10d11d1d";
matchcount($str, "d"); # returns 4
matchcount($str, "d1"); # returns 3
To search for only the string without a regular expression accidentally
interfering, enclose the search string between '\Q' and '\E'. E.g.:
#
# We don't know what's in $looking, so de-magic it.
#
Algorithm-RabinKarp
view release on metacpan or search on metacpan
0.41
Modification of t/util.t to make it more compatible with perl 5.6 -- Some of the
tests failed because I forgot that the special form for opening a string as
a file handle was only recently introduced in 5.8
0.39
Umm. I accidently included duplicate information from two projects in the last push.
This version has an improved version of the rabin.pl that allows (requires, actually)
you to pass it a glob pattern before the directories it will scan. Much better
reporting, as well.
0.38:
Speed up the next method a little by reducing the number of times it copies its internal
Algorithm-RandomMatrixGeneration
view release on metacpan or search on metacpan
lib/Algorithm/RandomMatrixGeneration.pm view on Meta::CPAN
for(my $k=$j+1; $k<=$m; $k++)
{
$rem_col_marg = $rem_col_marg + $tmp_cmar[$k];
}
# based on the row_marg and the sum_of_col_marg decide the value for min
$min = $tmp_rmar[$i] - $rem_col_marg;
if($signValues eq "positive")
{
if($min < 0)
lib/Algorithm/RandomMatrixGeneration.pm view on Meta::CPAN
for each cell C(i,j)
{
# Find the range (min, max) for the random number generation
max = MIN(row_marg[i], col_marg[j])
# If max !=0 then decide the min.
# To decide min value sum together the col_marginals for all
# the columns past the current column - this sum gives the total
# of the column marginals yet to be satisfied beyond the current col.
# Subtract this sum from the current row_marginal to compute
# the lower bound on the random number. We do this because if we
# do not set this lower bound and thus a number smaller than this
Algorithm-RectanglesContainingDot_XS
view release on metacpan or search on metacpan
A README file is required for CPAN modules since CPAN extracts the
README file from a module distribution so that people browsing the
archive can use it get an idea of the modules uses. It is usually a
good idea to provide version information here so that people can
decide whether fixes for the module are worth downloading.
INSTALLATION
To install this module type the following:
Algorithm-Scale2x
view release on metacpan or search on metacpan
inc/Module/Install.pm view on Meta::CPAN
use strict 'vars';
use vars qw{$VERSION $MAIN};
BEGIN {
# All Module::Install core packages now require synchronised versions.
# This will be used to ensure we don't accidentally load old or
# different versions of modules.
# This is not enforced yet, but will be some time in the next few
# releases once we can make sure it won't clash with custom
# Module::Install extensions.
$VERSION = '0.91';
Algorithm-Simplex
view release on metacpan or search on metacpan
lib/Algorithm/Simplex/Float.pm view on Meta::CPAN
=head2 is_optimal
Check the basement row to see if any positive entries exist. Existence of
a positive entry means the solution is sub-optimal and optimal otherwise.
This is how we decide when to stop the algorithm.
Use EPSILON instead of zero because we're dealing with floats (imperfect numbers).
=cut
Algorithm-SkipList
view release on metacpan or search on metacpan
- SIZE_THRESHOLD/SIZE_LEVEL now decrease with deletions
- additional minor optimizations and code cleanup
- optimizations of Header and Null node types
- updated tests
- Benchmark: re-commented-out delete test for Tree::RedBlack
(which was accidentally uncommented in v0.62)
0.62 Tue May 18 2004
- fixed typo in (commented-out) assertion
- additional minor optimizations and code cleanup
- updated tests
Algorithm-TokenBucket
view release on metacpan or search on metacpan
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
Algorithm-VSM
view release on metacpan or search on metacpan
lib/Algorithm/VSM.pm view on Meta::CPAN
through the constructor parameter 'query_file'. The format of the this file
must be according to the sample file 'test_queries.txt' in the 'examples'
directory. The module estimates the relevancies of the documents to the
queries and dumps the relevancies in a file named by the 'relevancy_file'
constructor parameter. The constructor parameter 'relevancy_threshold' is used
to decide which of the documents are considered to be relevant to a query. A
document must contain at least the 'relevancy_threshold' occurrences of query
words in order to be considered relevant to a query.
lib/Algorithm/VSM.pm view on Meta::CPAN
We have already explained the purpose of the constructor parameter 'query_file'
and about the constraints on the format of queries in the file named through
this parameter. As mentioned earlier, the module estimates the relevancies of
the documents to the queries and dumps the relevancies in a file named by the
'relevancy_file' constructor parameter. The constructor parameter
'relevancy_threshold' is used in deciding which of the documents are considered
to be relevant to a query. A document must contain at least the
'relevancy_threshold' occurrences of query words in order to be considered
relevant to a query. We have previously explained the role of the constructor
parameter 'lsa_svd_threshold'.
lib/Algorithm/VSM.pm view on Meta::CPAN
vectors:
$vsm->construct_lsa_model();
The SVD decomposition that is carried out in LSA model construction uses the
constructor parameter C<lsa_svd_threshold> to decide how many of the singular values
to retain for the LSA model. A singular is retained only if it is larger than the
C<lsa_svd_threshold> fraction of the largest singular value.
=item B<display_average_precision_for_queries_and_map():>
( run in 0.800 second using v1.01-cache-2.11-cpan-4505f990765 )