Result:
found more than 999 distributions - search limited to the first 2001 files matching your query
( run in 1.283 )
Algorithm-Evolutionary-Utils
view release on metacpan or search on metacpan
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
Algorithm-ExpectationMaximization
view release on metacpan or search on metacpan
lib/Algorithm/ExpectationMaximization.pm view on Meta::CPAN
# In the same manner, you can write out the posterior probability based possibly
# overlapping clusters to files by calling:
$clusterer->write_posterior_prob_clusters_above_threshold_to_files($theta1);
# where the threshold $theta1 sets the probability threshold for deciding which
# data elements to place in a cluster. These clusters are placed in files with
# names like
posterior_prob_cluster1.txt
posterior_prob_cluster2.txt
lib/Algorithm/ExpectationMaximization.pm view on Meta::CPAN
output_datafile => $out_datafile,
total_number_of_data_points => $N );
# where the value of $N is the total number of data points you would like to see
# generated for all of the Gaussians. How this total number is divided up amongst
# the Gaussians is decided by the prior probabilities for the Gaussian components
# as declared in input parameter file. The synthetic data may be visualized in a
# terminal window and the visualization written out as a PNG image to a diskfile
# by
my $data_visualization_mask = "11";
lib/Algorithm/ExpectationMaximization.pm view on Meta::CPAN
....
where the first column contains the symbolic ID tag for each
data record and the rest of the columns the numerical
information. As to which columns are actually used for
clustering is decided by the string value of the mask. For
example, if we wanted to cluster on the basis of the entries
in just the 3rd, the 4th, and the 5th columns above, the
mask value would be C<N0111> where the character C<N>
indicates that the ID tag is in the first column, the
character C<0> that the second column is to be ignored, and
lib/Algorithm/ExpectationMaximization.pm view on Meta::CPAN
$clusterer->write_posterior_prob_clusters_above_threshold_to_files($theta1);
This call writes out the posterior-probability based soft
clusters to disk files. As in the previous method, the
threshold C<$theta1> sets the probability threshold for
deciding which data elements belong to a cluster. These
clusters are placed in files with names like
posterior_prob_cluster1.txt
posterior_prob_cluster2.txt
...
lib/Algorithm/ExpectationMaximization.pm view on Meta::CPAN
...
The soft clusters on the other hand are created by calling
C<return_clusters_with_posterior_probs_above_threshold($theta1)>
on an instance of the module, where the argument C<$theta1>
is the threshold for deciding whether a data element belongs
in a soft cluster. The posterior class probability at a
data element must exceed the threshold for the element to
belong to the corresponding cluster. The soft cluster can
be written out to disk files by calling
C<write_posterior_prob_clusters_above_threshold_to_files($theta1)>.
Algorithm-FeatureSelection
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.05';
Algorithm-FloodControl
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.77';
Algorithm-FuzzyCmeans
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-GoldenSection
view release on metacpan or search on metacpan
lib/Algorithm/GoldenSection.pm view on Meta::CPAN
necessary servicing, repair, or correction.
In no event unless required by applicable law or agreed to in writing
will any copyright holder, or any other party who may modify and/or
redistribute the software as permitted by the above licence, be
liable to you for damages, including any general, special, incidental,
or consequential damages arising out of the use or inability to use
the software (including but not limited to loss of data or data being
rendered inaccurate or losses sustained by you or third parties or a
failure of the software to operate with any other software), even if
such holder or other party has been advised of the possibility of
Algorithm-Graphs-TransitiveClosure-Tiny
view release on metacpan or search on metacpan
lib/Algorithm/Graphs/TransitiveClosure/Tiny.pm view on Meta::CPAN
works on hashes only,
=item *
uses C<undef> for hash values, so an incidence must be checked with
C<exists()> (but for the input hash you are not forced to use C<undef>),
=item *
fixes following problem of L<Algorithm::Graphs::TransitiveClosure>:
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-Kademlia
view release on metacpan or search on metacpan
CODE_OF_CONDUCT.md view on Meta::CPAN
reported to the community leaders responsible for enforcement at
https://github.com/sanko/Algorithm-Kademlia/discussions.
All complaints will be reviewed and investigated promptly and fairly.
All community leaders are obligated to respect the privacy and security of the
reporter of any incident.
## Enforcement Guidelines
Community leaders will follow these Community Impact Guidelines in determining
the consequences for any action they deem in violation of this Code of Conduct:
CODE_OF_CONDUCT.md view on Meta::CPAN
clarity around the nature of the violation and an explanation of why the
behavior was inappropriate. A public apology may be requested.
### 2. Warning
**Community Impact**: A violation through a single incident or series
of actions.
**Consequence**: A warning with consequences for continued behavior. No
interaction with the people involved, including unsolicited interaction with
those enforcing the Code of Conduct, for a specified period of time. This
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
( run in 1.283 second using v1.01-cache-2.11-cpan-39bf76dae61 )