measure latency
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 341
Text::NSP::Measures 1.03
Text::NSP::Measures is a Perl module for computing association scores of Ngrams. more>>
Text::NSP::Measures is a Perl module for computing association scores of Ngrams. This module provides the basic framework for these measures.
SYNOPSIS
Basic Usage
use Text::NSP::Measures::2D::MI::ll;
my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;
$ll_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);
if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n"";
}
<<lessSYNOPSIS
Basic Usage
use Text::NSP::Measures::2D::MI::ll;
my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;
$ll_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);
if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n"";
}
Download (0.94MB)
Added: 2006-10-19 License: Perl Artistic License Price:
1100 downloads
Jdelay
Jdelay project is a small JACK app you can use to measure the latency of your sound card. more>>
Jdelay project is a small JACK app you can use to measure the latency of your sound card.
It uses a phase measurements on a set of tones to measure the delay from the output to the input. Accuracy is about 1/1000 of a sample.
Installation:
To install, cd to this directory and make.
Copy the binary to your preferred location.
<<lessIt uses a phase measurements on a set of tones to measure the delay from the output to the input. Accuracy is about 1/1000 of a sample.
Installation:
To install, cd to this directory and make.
Copy the binary to your preferred location.
Download (0.003MB)
Added: 2006-02-03 License: GPL (GNU General Public License) Price:
1358 downloads
Mixmaster 3.0 RC1
Mixmaster is an anonymous remailer. more>>
Mixmaster is an anonymous remailer. Mixmaster is the type II remailer protocol and the most popular implementation of it.
Remailers provide protection against traffic analysis and allow sending email nonymously or pseudonymously. Mixmaster consists of both client and server installations and is designed to run on several operation systems including but not limited to *BSD, Linux and Microsoft Windows.
The current 2.9.x versions are the stable ones and widely deployed. The 3.0beta* releases are betas for the upcoming Mixmaster 3.0.
To download Mixmaster visit Sourceforges download center. Packages for the Debian GNU/Linux distribution can be found in the testing and unstable distributions on a mirror near you. Also see http://packages.debian.org/mixmaster.
For pingers and other remailer implementations see related Software.
Whats New in 2.0.4 Stable Release:
- Prefer pubring.asc over secring.pgp.
- Support an unpublished dest.alw file.
- Added MINLAT directive. Ensures randhopped messages are sent through remailers of latency of MINLAT time or greater (suggested by Steve Crook). Improved OpenSSL version checking in the Install script.
- Added Full stats download support.
- Fixed buffer overflow bug in keymgt.c
Whats New in 3.0 RC1 Development Release:
- Prefer pubring.asc over secring.pgp.
- Support an unpublished dest.alw file.
- Added MINLAT directive. Ensures randhopped messages are sent through remailers of latency of MINLAT time or greater (suggested by Steve Crook).
- Improved OpenSSL version checking in the Install script.
- Added full stats download support.
- Fixed buffer overflow bug in keymgt.c.
<<lessRemailers provide protection against traffic analysis and allow sending email nonymously or pseudonymously. Mixmaster consists of both client and server installations and is designed to run on several operation systems including but not limited to *BSD, Linux and Microsoft Windows.
The current 2.9.x versions are the stable ones and widely deployed. The 3.0beta* releases are betas for the upcoming Mixmaster 3.0.
To download Mixmaster visit Sourceforges download center. Packages for the Debian GNU/Linux distribution can be found in the testing and unstable distributions on a mirror near you. Also see http://packages.debian.org/mixmaster.
For pingers and other remailer implementations see related Software.
Whats New in 2.0.4 Stable Release:
- Prefer pubring.asc over secring.pgp.
- Support an unpublished dest.alw file.
- Added MINLAT directive. Ensures randhopped messages are sent through remailers of latency of MINLAT time or greater (suggested by Steve Crook). Improved OpenSSL version checking in the Install script.
- Added Full stats download support.
- Fixed buffer overflow bug in keymgt.c
Whats New in 3.0 RC1 Development Release:
- Prefer pubring.asc over secring.pgp.
- Support an unpublished dest.alw file.
- Added MINLAT directive. Ensures randhopped messages are sent through remailers of latency of MINLAT time or greater (suggested by Steve Crook).
- Improved OpenSSL version checking in the Install script.
- Added full stats download support.
- Fixed buffer overflow bug in keymgt.c.
Download (0.33MB)
Added: 2006-06-24 License: Freeware Price:
709 downloads
Text::NSP::Measures::2D 1.01
Text::NSP::Measures::2D is a Perl module that provides basic framework for building measure of association for bigrams. more>>
Text::NSP::Measures::2D is a Perl module that provides basic framework for building measure of association for bigrams.
SYNOPSIS
Basic Usage
use Text::NSP::Measures::2D::MI::ll;
my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;
$ll_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);
if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n"";
}
This module is to be used as a foundation for building 2-dimensional measures of association. The methods in this module retrieve observed bigram frequency counts, marginal totals, and also compute expected values. They also provide error checks for these counts.
<<lessSYNOPSIS
Basic Usage
use Text::NSP::Measures::2D::MI::ll;
my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;
$ll_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);
if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n"";
}
This module is to be used as a foundation for building 2-dimensional measures of association. The methods in this module retrieve observed bigram frequency counts, marginal totals, and also compute expected values. They also provide error checks for these counts.
Download (0.93MB)
Added: 2006-08-30 License: Perl Artistic License Price:
1150 downloads
Text::NSP::Measures::3D 1.01
Text::NSP::Measures::3D is a Perl module that provides basic framework for building measure of association for trigrams. more>>
Text::NSP::Measures::3D is a Perl module that provides basic framework for building measure of association for trigrams.
This module can be used as a foundation for building 3-dimensional measures of association that can then be used by statistic.pl. In particular this module provides methods that give convenient access to 3-d (i.e., trigram) frequency counts as created by count.pl, as well as some degree of error handling that verifies the data.
Basic Usage
use Text::NSP::Measures::3D::MI::ll;
$ll_value = calculateStatistic( n111=>10,
n1pp=>40,
np1p=>45,
npp1=>42,
n11p=>20,
n1p1=>23,
np11=>21,
nppp=>100);
if( ($errorCode = getErrorCode()))
{
print STDERR $erroCode." - ".getErrorMessage()."n";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n";
}
The methods in this module retrieve observed trigram frequency counts and marginal totals, and also compute expected values. They also provide support for error checking of the output produced by count.pl. These methods are used in all the trigram (3d) measure modules provided in NSP. If you are writing your own 3d measure, you can use these methods as well.
<<lessThis module can be used as a foundation for building 3-dimensional measures of association that can then be used by statistic.pl. In particular this module provides methods that give convenient access to 3-d (i.e., trigram) frequency counts as created by count.pl, as well as some degree of error handling that verifies the data.
Basic Usage
use Text::NSP::Measures::3D::MI::ll;
$ll_value = calculateStatistic( n111=>10,
n1pp=>40,
np1p=>45,
npp1=>42,
n11p=>20,
n1p1=>23,
np11=>21,
nppp=>100);
if( ($errorCode = getErrorCode()))
{
print STDERR $erroCode." - ".getErrorMessage()."n";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n";
}
The methods in this module retrieve observed trigram frequency counts and marginal totals, and also compute expected values. They also provide support for error checking of the output produced by count.pl. These methods are used in all the trigram (3d) measure modules provided in NSP. If you are writing your own 3d measure, you can use these methods as well.
Download (0.96MB)
Added: 2006-09-02 License: Perl Artistic License Price:
1147 downloads
mubench 0.2.2
mubench is an in-depth, low-level benchmark for x86 processors. more>>
mubench is an in-depth, low-level benchmark for x86 processors. Its primary goal is to provide useful information for people who optimize assembly code and for people who write compilers. mubench project measures latency and throughput for each individual instruction (sometimes several forms of the same instruction), as well as the throughput of arbitrary instruction mixes. The results produced by mubench are typically an order of magnitude more detailed than those found in AMD or Intel manuals.
mubench results for a variety of processors are available. If you find this information useful, please run mubench on your processor and upload the results.
mubench fully supports all SIMD instruction sets for the x86, including SSSE3, SSE3, SSE2, SSE, MMX, MMX Ext, 3DNow! and 3DNow! Ext. Support for non-SIMD instructions is partial: most data move, binary arithmetic, logical, shift/rotate and bit/byte instructions are supported, but other instructions, particularly branch and function call instructions or instructions manipulating the stack, are not supported. Floating-point instructions for the x87 are not supported. mubench only uses register-to-register (or immediate) forms of the instructions; memory operands are not supported. These limitations will be gradually removed in later releases.
Running:
perl mubench.pl [options]
Options:
--(no-)accurate runs tests several times (default on)
--mhz=2500 processor speed in MHz (normally autodetected from /proc/cpuinfo, set here if that
is wrong, for example if you have SpeedStep enabled)
--(no-)64bit benchmark 64-bit (amd64, emt64, x86-64) instructions (default autodetected)
--(no-)32bit benchmark 32-bit instructions
--(no-)pairs benchmark instruction mixes (default on, very slow; use --no-pairs for a very fast benchmark
that runs in minutes)
--include=add,sub benchmark only instructions matching the given list of patterns (regular expressions ok)
--output=xml|csv|text select output format
--outfile=file.xml output file to save results to (default mubench-results- .xml if xml,
standard output otherwise)
Enhancements:
- the fast form of the benchmark is now default.
- gcc 4.x now works
- a number of non-simd instructions added, support for non-simd is much closer to complete now
<<lessmubench results for a variety of processors are available. If you find this information useful, please run mubench on your processor and upload the results.
mubench fully supports all SIMD instruction sets for the x86, including SSSE3, SSE3, SSE2, SSE, MMX, MMX Ext, 3DNow! and 3DNow! Ext. Support for non-SIMD instructions is partial: most data move, binary arithmetic, logical, shift/rotate and bit/byte instructions are supported, but other instructions, particularly branch and function call instructions or instructions manipulating the stack, are not supported. Floating-point instructions for the x87 are not supported. mubench only uses register-to-register (or immediate) forms of the instructions; memory operands are not supported. These limitations will be gradually removed in later releases.
Running:
perl mubench.pl [options]
Options:
--(no-)accurate runs tests several times (default on)
--mhz=2500 processor speed in MHz (normally autodetected from /proc/cpuinfo, set here if that
is wrong, for example if you have SpeedStep enabled)
--(no-)64bit benchmark 64-bit (amd64, emt64, x86-64) instructions (default autodetected)
--(no-)32bit benchmark 32-bit instructions
--(no-)pairs benchmark instruction mixes (default on, very slow; use --no-pairs for a very fast benchmark
that runs in minutes)
--include=add,sub benchmark only instructions matching the given list of patterns (regular expressions ok)
--output=xml|csv|text select output format
--outfile=file.xml output file to save results to (default mubench-results- .xml if xml,
standard output otherwise)
Enhancements:
- the fast form of the benchmark is now default.
- gcc 4.x now works
- a number of non-simd instructions added, support for non-simd is much closer to complete now
Download (0.079MB)
Added: 2006-12-02 License: GPL (GNU General Public License) Price:
1058 downloads
Measuring Buffer 20090628
Measuring Buffer is an enhanced version of buffer. more>>
Measuring Buffer 20090628 provides you with a perfect and enhanced version of buffer which features display of throughput, network support, memory-mapped file I/O for huge buffers and multithreading. This will be your excellent choice.
Major Features:
- Display of I/O speed
- Optional use of memory mapped I/O for huge buffers
- Multithreaded instead of sharedmemory ipc
- Multi volume support
- Autoloader support
- Networking support
- Compatible command-line options
Enhancements:
- This release fixes a hang on transfer sizes smaller than blocksize with status display active.
- It has a Gentoo compatibility update, a man page update, a summary display update, and a libmhash initialization fix.
- Termination latency with active status display is reduced.
- There is a fix for -q suppressing the output of -H.
Added: 2009-06-29 License: GPL v3 Price: FREE
14 downloads
Other version of Measuring Buffer
License:GPL (GNU General Public License)
Text::NSP::Measures::2D::MI 1.03
Text::NSP::Measures::2D::MI is a Perl module that provides error checks for Loglieklihood. more>>
Text::NSP::Measures::2D::MI is a Perl module that provides error checks for Loglieklihood, Total Mutual Information, Pointwise Mutual Information and Poisson-Stirling Measure.
SYNOPSIS
Basic Usage
use Text::NSP::Measures::2D::MI::ll;
my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;
$ll_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);
if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n"";
}
<<lessSYNOPSIS
Basic Usage
use Text::NSP::Measures::2D::MI::ll;
my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;
$ll_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);
if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n"";
}
Download (0.93MB)
Added: 2007-03-13 License: Perl Artistic License Price:
955 downloads
Text::NSP::Measures::3D::MI 1.03
Text::NSP::Measures::3D::MI is a Perl module that provides error checks and framework to implement Loglieklihood and more. more>>
Text::NSP::Measures::3D::MI is a Perl module that provides error checks and framework to implement Loglieklihood, Total Mutual Information, Pointwise Mutual Information and Poisson Stirling Measure for trigrams.
SYNOPSIS
Basic Usage
use Text::NSP::Measures::3D::MI::ll;
$ll_value = calculateStatistic( n111=>10,
n1pp=>40,
np1p=>45,
npp1=>42,
n11p=>20,
n1p1=>23,
np11=>21,
nppp=>100);
if( ($errorCode = getErrorCode()))
{
print STDERR $erroCode." - ".getErrorMessage()."n";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n";
}
This module is the base class for the Loglikelihood and the True Mutual Information measures. All these measure are similar. This module provides error checks specific for these measures, it also implements the computations that are common to these measures.
Log-Likelihood measure is computed as
Log-Likelihood = 2 * [n111 * log(n111/m111) + n112 * log(n112/m112) +
n121 * log(n121/m121) + n122 * log(n122/m122) +
n211 * log(n211/m211) + n212 * log(n212/m212) +
n221 * log(n221/m221) + n222 * log(n222/m222)]
Total Mutual Information
tmi = [n111/nppp * log(n111/m111) + n112/nppp * log(n112/m112) + n121/nppp * log(n121/m121) + n122/nppp * log(n122/m122) + n211/nppp * log(n211/m211) + n212/nppp * log(n212/m212) + n221/nppp * log(n221/m221) + n222/nppp * log(n222/m222)]
Pointwise Mutual Information
pmi = log (n111/m111)
Poisson Stirling Measure
ps = n111 * ( log(n111/m111) - 1)
All these methods use the ratio of the observed values to expected values, for computations, and thus have common error checks, so they have been grouped togrther.
<<lessSYNOPSIS
Basic Usage
use Text::NSP::Measures::3D::MI::ll;
$ll_value = calculateStatistic( n111=>10,
n1pp=>40,
np1p=>45,
npp1=>42,
n11p=>20,
n1p1=>23,
np11=>21,
nppp=>100);
if( ($errorCode = getErrorCode()))
{
print STDERR $erroCode." - ".getErrorMessage()."n";
}
else
{
print getStatisticName."value for bigram is ".$ll_value."n";
}
This module is the base class for the Loglikelihood and the True Mutual Information measures. All these measure are similar. This module provides error checks specific for these measures, it also implements the computations that are common to these measures.
Log-Likelihood measure is computed as
Log-Likelihood = 2 * [n111 * log(n111/m111) + n112 * log(n112/m112) +
n121 * log(n121/m121) + n122 * log(n122/m122) +
n211 * log(n211/m211) + n212 * log(n212/m212) +
n221 * log(n221/m221) + n222 * log(n222/m222)]
Total Mutual Information
tmi = [n111/nppp * log(n111/m111) + n112/nppp * log(n112/m112) + n121/nppp * log(n121/m121) + n122/nppp * log(n122/m122) + n211/nppp * log(n211/m211) + n212/nppp * log(n212/m212) + n221/nppp * log(n221/m221) + n222/nppp * log(n222/m222)]
Pointwise Mutual Information
pmi = log (n111/m111)
Poisson Stirling Measure
ps = n111 * ( log(n111/m111) - 1)
All these methods use the ratio of the observed values to expected values, for computations, and thus have common error checks, so they have been grouped togrther.
Download (0.93MB)
Added: 2007-03-12 License: Perl Artistic License Price:
956 downloads
mod_auth_useragent 1.0
mod_auth_useragent allows you to forbid clients based on their User-Agent by placing a single line in your Apache httpd.conf. more>>
mod_auth_useragent allows you to forbid clients based on their User-Agent by placing a single line in your Apache httpd.conf.
Be aware that this is by no means a security measure as it is trivial to change your User-Agent in most browsers.
<<lessBe aware that this is by no means a security measure as it is trivial to change your User-Agent in most browsers.
Download (0.005MB)
Added: 2005-08-24 License: GPL (GNU General Public License) Price:
1521 downloads
RTAI LiveCD 0.16
The Real-Time Application Interface is a hard real-time extension to the Linux kernel. more>>
The Real-Time Application Interface is a hard real-time extension to the Linux kernel, contributed in accordance with the Free Software guidelines.
It provides the features of an industrial-grade RTOS, seamlessly accessible from the powerful and sophisticated GNU/Linux environment.
The bootable CD-ROM provided on this website allows you to determine whether your systems hardware is capable of being used as a hard real-time system.
Furthermore, this website provides information about the real-time performance of various systems, which might help you when buying hardware for building hard real-time systems.
The LiveCD is based on RTAI (Realtime Application Interface) and provides easy-to-use menus that guide users through running the test suite and submitting the results and system configuration information to an Internet database.
Enhancements:
- Fixed issue where the per-loop max and min latency were stored in the database instead of the overall max and min latency... Added support for Gigabit Ethernet (requested by Phil Nitschke)
- Reduced ISO size to 8MB
<<lessIt provides the features of an industrial-grade RTOS, seamlessly accessible from the powerful and sophisticated GNU/Linux environment.
The bootable CD-ROM provided on this website allows you to determine whether your systems hardware is capable of being used as a hard real-time system.
Furthermore, this website provides information about the real-time performance of various systems, which might help you when buying hardware for building hard real-time systems.
The LiveCD is based on RTAI (Realtime Application Interface) and provides easy-to-use menus that guide users through running the test suite and submitting the results and system configuration information to an Internet database.
Enhancements:
- Fixed issue where the per-loop max and min latency were stored in the database instead of the overall max and min latency... Added support for Gigabit Ethernet (requested by Phil Nitschke)
- Reduced ISO size to 8MB
Download (8.0MB)
Added: 2005-11-05 License: GPL (GNU General Public License) Price:
1462 downloads
WordNet::SenseRelate::AllWords 0.06
WordNet::SenseRelate::AllWords is a Perl module to perform Word Sense Disambiguation. more>>
WordNet::SenseRelate::AllWords is a Perl module to perform Word Sense Disambiguation.
SYNOPSIS
use WordNet::SenseRelate::AllWords;
use WordNet::QueryData;
my $qd = WordNet::QueryData->new;
my $wsd = WordNet::SenseRelate::AllWords->new (wordnet => $qd,
measure => WordNet::Similarity::lesk);
my @results = $wsd->disambiguate ();
WordNet::SenseRelate::AllWords implements an algorithm for Word Sense Disambiguation that uses measures of semantic relatedness. The algorithm is an extension of an algorithm described by Pedersen, Banerjee, and Patwardhan[1]. This implementation is similar to the original SenseRelate package but disambiguates every word in the given context rather than just single word.
<<lessSYNOPSIS
use WordNet::SenseRelate::AllWords;
use WordNet::QueryData;
my $qd = WordNet::QueryData->new;
my $wsd = WordNet::SenseRelate::AllWords->new (wordnet => $qd,
measure => WordNet::Similarity::lesk);
my @results = $wsd->disambiguate ();
WordNet::SenseRelate::AllWords implements an algorithm for Word Sense Disambiguation that uses measures of semantic relatedness. The algorithm is an extension of an algorithm described by Pedersen, Banerjee, and Patwardhan[1]. This implementation is similar to the original SenseRelate package but disambiguates every word in the given context rather than just single word.
Download (0.035MB)
Added: 2007-04-07 License: Perl Artistic License Price:
934 downloads
Text::NSP::Measures::2D::MI::ll 1.03
Text::NSP::Measures::2D::MI::ll is a Perl module that implements Loglikelihood measure of association for bigrams. more>>
Text::NSP::Measures::2D::MI::ll is a Perl module that implements Loglikelihood measure of association for bigrams.
SYNOPSIS
Basic Usage
use Text::NSP::Measures::2D::MI::ll;
my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;
$ll_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);
if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage();
}
else
{
print getStatisticName."value for bigram is ".$ll_value;
}
<<lessSYNOPSIS
Basic Usage
use Text::NSP::Measures::2D::MI::ll;
my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;
$ll_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);
if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage();
}
else
{
print getStatisticName."value for bigram is ".$ll_value;
}
Download (0.93MB)
Added: 2007-03-13 License: Perl Artistic License Price:
955 downloads
Text::NSP::Measures::3D::MI::ps 1.03
Text::NSP::Measures::3D::MI::ps is a Perl module that implements Poisson Stirling Measure for trigrams. more>>
Text::NSP::Measures::3D::MI::ps is a Perl module that implements Poisson Stirling Measure for trigrams.
SYNOPSIS
Basic Usage
use Text::NSP::Measures::3D::MI::ps;
$ps_value = calculateStatistic( n111=>10,
n1pp=>40,
np1p=>45,
npp1=>42,
n11p=>20,
n1p1=>23,
np11=>21,
nppp=>100);
if( ($errorCode = getErrorCode()))
{
print STDERR $erroCode." - ".getErrorMessage()."n";
}
else
{
print getStatisticName."value for bigram is ".$ps_value."n";
}
The log-likelihood ratio measures the devitation between the observed data and what would be expected if < word1 >, < word2 > and < word3 > were independent. The higher the score, the less evidence there is in favor of concluding that the words are independent.
The expected values for the internal cells are calculated by taking the product of their associated marginals and dividing by the sample size, for example:
n1pp * np1p * npp1
m111= --------------------
nppp
The poisson stirling measure is a negative lograthimic approximation of the poisson-likelihood measure. It uses the stirlings firmula to approximate the factorial in poisson-likelihood measure. It is computed as follows:
Posson-Stirling = n111 * ( log(n111) - log(m111) - 1)
Methods
calculateStatistic() - This method calculates the ps value
INPUT PARAMS : $count_values .. Reference of an hash containing the count values computed by the count.pl program.
RETURN VALUES : $poissonStirling .. Poisson-Stirling value for this trigram.
getStatisticName() - Returns the name of this statistic
INPUT PARAMS : none
RETURN VALUES : $name .. Name of the measure.
<<lessSYNOPSIS
Basic Usage
use Text::NSP::Measures::3D::MI::ps;
$ps_value = calculateStatistic( n111=>10,
n1pp=>40,
np1p=>45,
npp1=>42,
n11p=>20,
n1p1=>23,
np11=>21,
nppp=>100);
if( ($errorCode = getErrorCode()))
{
print STDERR $erroCode." - ".getErrorMessage()."n";
}
else
{
print getStatisticName."value for bigram is ".$ps_value."n";
}
The log-likelihood ratio measures the devitation between the observed data and what would be expected if < word1 >, < word2 > and < word3 > were independent. The higher the score, the less evidence there is in favor of concluding that the words are independent.
The expected values for the internal cells are calculated by taking the product of their associated marginals and dividing by the sample size, for example:
n1pp * np1p * npp1
m111= --------------------
nppp
The poisson stirling measure is a negative lograthimic approximation of the poisson-likelihood measure. It uses the stirlings firmula to approximate the factorial in poisson-likelihood measure. It is computed as follows:
Posson-Stirling = n111 * ( log(n111) - log(m111) - 1)
Methods
calculateStatistic() - This method calculates the ps value
INPUT PARAMS : $count_values .. Reference of an hash containing the count values computed by the count.pl program.
RETURN VALUES : $poissonStirling .. Poisson-Stirling value for this trigram.
getStatisticName() - Returns the name of this statistic
INPUT PARAMS : none
RETURN VALUES : $name .. Name of the measure.
Download (0.93MB)
Added: 2007-03-15 License: GPL (GNU General Public License) Price:
953 downloads
Text::NSP::Measures::2D::MI::ps 1.03
Text::NSP::Measures::2D::MI::ps is a Perl module that implements Poisson-Stirling measure of association for bigrams. more>>
Text::NSP::Measures::2D::MI::ps is a Perl module that implements Poisson-Stirling measure of association for bigrams.
SYNOPSIS
Basic Usage
use Text::NSP::Measures::2D::MI::ps;
my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;
$ps_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);
if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$ps_value."n"";
}
The log-likelihood ratio measures the devitation between the observed data and what would be expected if < word1 > and < word2 > were independent. The higher the score, the less evidence there is in favor of concluding that the words are independent.
Assume that the frequency count data associated with a bigram < word1 >< word2 > as shown by a 2x2 contingency table:
word2 ~word2
word1 n11 n12 | n1p
~word1 n21 n22 | n2p
--------------
np1 np2 npp
where n11 is the number of times < word1 >< word2 > occur together, and n12 is the number of times < word1 > occurs with some word other than word2, and n1p is the number of times in total that word1 occurs as the first word in a bigram.
The expected values for the internal cells are calculated by taking the product of their associated marginals and dividing by the sample size, for example:
np1 * n1p
m11= ---------
npp
The poisson stirling measure is a negative lograthimic approximation of the poisson-likelihood measure. It uses the stirlings firmula to approximate the factorial in poisson-likelihood measure.
Posson-Stirling = n11 * ( log(n11) - log(m11) - 1)
which is same as
Posson-Stirling = n11 * ( log(n11/m11) - 1)
Methods
calculateStatistic() - This method calculates the ps value
INPUT PARAMS : $count_values .. Reference of an hash containing the count values computed by the count.pl program.
RETURN VALUES : $poissonStirling .. Poisson-Stirling value for this bigram.
getStatisticName() - Returns the name of this statistic
INPUT PARAMS : none
RETURN VALUES : $name .. Name of the measure.
<<lessSYNOPSIS
Basic Usage
use Text::NSP::Measures::2D::MI::ps;
my $npp = 60; my $n1p = 20; my $np1 = 20; my $n11 = 10;
$ps_value = calculateStatistic( n11=>$n11,
n1p=>$n1p,
np1=>$np1,
npp=>$npp);
if( ($errorCode = getErrorCode()))
{
print STDERR $errorCode." - ".getErrorMessage()."n"";
}
else
{
print getStatisticName."value for bigram is ".$ps_value."n"";
}
The log-likelihood ratio measures the devitation between the observed data and what would be expected if < word1 > and < word2 > were independent. The higher the score, the less evidence there is in favor of concluding that the words are independent.
Assume that the frequency count data associated with a bigram < word1 >< word2 > as shown by a 2x2 contingency table:
word2 ~word2
word1 n11 n12 | n1p
~word1 n21 n22 | n2p
--------------
np1 np2 npp
where n11 is the number of times < word1 >< word2 > occur together, and n12 is the number of times < word1 > occurs with some word other than word2, and n1p is the number of times in total that word1 occurs as the first word in a bigram.
The expected values for the internal cells are calculated by taking the product of their associated marginals and dividing by the sample size, for example:
np1 * n1p
m11= ---------
npp
The poisson stirling measure is a negative lograthimic approximation of the poisson-likelihood measure. It uses the stirlings firmula to approximate the factorial in poisson-likelihood measure.
Posson-Stirling = n11 * ( log(n11) - log(m11) - 1)
which is same as
Posson-Stirling = n11 * ( log(n11/m11) - 1)
Methods
calculateStatistic() - This method calculates the ps value
INPUT PARAMS : $count_values .. Reference of an hash containing the count values computed by the count.pl program.
RETURN VALUES : $poissonStirling .. Poisson-Stirling value for this bigram.
getStatisticName() - Returns the name of this statistic
INPUT PARAMS : none
RETURN VALUES : $name .. Name of the measure.
Download (0.93MB)
Added: 2007-03-15 License: GPL (GNU General Public License) Price:
953 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above measure latency search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed