between two
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 4181
Zebedee 2.5.3
Zebedee is a simple program to establish an encrypted, compressed tunnel for TCP/IP or UDP data transfer between two systems. more>>
Zebedee is a simple program to establish an encrypted, compressed "tunnel" for TCP/IP or UDP data transfer between two systems.
This allows data from, for example, telnet, ftp and X sessions to be protected from snooping. You can also use compression, either with or without data encryption, to gain performance over low-bandwidth networks.
Zebedee is made with next goals in mind:
Provide client and server functionality under both UNIX/Linux and Windows.
Be easy to install, use and maintain with little or no configuration required.
Have a small footprint, low wire protocol overhead and give significant traffic reduction by the use of compression.
Use only algorithms that are either unpatented or for which the patent has expired.
Be entirely free for commercial or non-commercial use and distributed under the term of the GNU General Public Licence (see LICENCE.txt for details).
For further information on how to use Zebedee see the filezebedee.html in the distribution (or the manual page for zebedee(1) under UNIX -- it is basically the same text). Example
configuration files are also provided.
Versions of Zebedee in the 2.4.x series are stable, "production" versions. The development series, containing new features, but less well tested is numbered 2.5.x.
Enhancements:
- Fix file descriptor leak when IP address lookup fails.
- Fix problem with running a server in "reverse" mode and detached -- only
- apparent on Windows.
- Add "maxconnections" to alleviate DoS attack.
- Check for target port 0 to avoid DoS.
- Linux 64-bit port (a result of the "Linux on POWER" contest) courtesy of
- Stew Benedict . Use the "linux64" OS target.
- Upgraded version of bzip2 and zlib.
<<lessThis allows data from, for example, telnet, ftp and X sessions to be protected from snooping. You can also use compression, either with or without data encryption, to gain performance over low-bandwidth networks.
Zebedee is made with next goals in mind:
Provide client and server functionality under both UNIX/Linux and Windows.
Be easy to install, use and maintain with little or no configuration required.
Have a small footprint, low wire protocol overhead and give significant traffic reduction by the use of compression.
Use only algorithms that are either unpatented or for which the patent has expired.
Be entirely free for commercial or non-commercial use and distributed under the term of the GNU General Public Licence (see LICENCE.txt for details).
For further information on how to use Zebedee see the filezebedee.html in the distribution (or the manual page for zebedee(1) under UNIX -- it is basically the same text). Example
configuration files are also provided.
Versions of Zebedee in the 2.4.x series are stable, "production" versions. The development series, containing new features, but less well tested is numbered 2.5.x.
Enhancements:
- Fix file descriptor leak when IP address lookup fails.
- Fix problem with running a server in "reverse" mode and detached -- only
- apparent on Windows.
- Add "maxconnections" to alleviate DoS attack.
- Check for target port 0 to avoid DoS.
- Linux 64-bit port (a result of the "Linux on POWER" contest) courtesy of
- Stew Benedict . Use the "linux64" OS target.
- Upgraded version of bzip2 and zlib.
Download (0.17MB)
Added: 2006-07-13 License: GPL (GNU General Public License) Price:
1203 downloads
EtherPuppet 0.2
EtherPuppet will create a virtual interface (TUN/TAP) between two machines through a TCP connection. more>>
EtherPuppet will create a virtual interface (TUN/TAP) between two machines through a TCP connection.
Everything seen by the real interface will be seen by the virtual one.
Everything sent to the virtual interface will be emitted by the real one.
It has been designed because one often has a small machine as his Internet gateway, and sometimes want to run some big applications that need raw access to this interface, for sniffing (Ethereal, etc.) or for crafting packets that do not survive being reassembled, NATed, etc.
It can even run on Linux embedded routers such as the Linksys WRT54G.
Compiling:
$ gcc -o etherpuppet etherpuppet.c
<<lessEverything seen by the real interface will be seen by the virtual one.
Everything sent to the virtual interface will be emitted by the real one.
It has been designed because one often has a small machine as his Internet gateway, and sometimes want to run some big applications that need raw access to this interface, for sniffing (Ethereal, etc.) or for crafting packets that do not survive being reassembled, NATed, etc.
It can even run on Linux embedded routers such as the Linksys WRT54G.
Compiling:
$ gcc -o etherpuppet etherpuppet.c
Download (0.014MB)
Added: 2006-09-11 License: GPL (GNU General Public License) Price:
1141 downloads
xmlTreeNav 0.3.0
xmlTreeNav is a XML viewer with several features. more>>
xmlTreeNav is a XML viewer with several features. It can show the differences between two XML files (by using software based on the libxmldiff project).
xmlTreeNav can also perform XPath searches, "local XSLT" display, easy tree navigation, and more.
Main features:
- tree navigation
- diff XML files
- customization of the display with XSLT files (you can customize what appears on a tree line : add a label, convert ids...)
- XSLT HTML visualization (you can automatically apply a XSLT and view the result in xmlTreeNav ; if you copy/paste XML, it will be transformed)
- support for large XML files
- run both on Windows and Linux
Enhancements:
- This release lets you view, directly in xmlTreeNav, the HTML result of an XSLT conversion (you can directly copy/paste some XML in it, and view the result).
- It adds a configuration file, an XPath bar, and a few bugfixes.
<<lessxmlTreeNav can also perform XPath searches, "local XSLT" display, easy tree navigation, and more.
Main features:
- tree navigation
- diff XML files
- customization of the display with XSLT files (you can customize what appears on a tree line : add a label, convert ids...)
- XSLT HTML visualization (you can automatically apply a XSLT and view the result in xmlTreeNav ; if you copy/paste XML, it will be transformed)
- support for large XML files
- run both on Windows and Linux
Enhancements:
- This release lets you view, directly in xmlTreeNav, the HTML result of an XSLT conversion (you can directly copy/paste some XML in it, and view the result).
- It adds a configuration file, an XPath bar, and a few bugfixes.
Download (0.13MB)
Added: 2006-07-26 License: GPL (GNU General Public License) Price:
1189 downloads
KRepton 4.0
KRepton is an implementation of the classic Repton 3 game. more>>
KRepton project is an implementation of the classic Repton 3 game, which was originally produced for the BBC Micro and was the third successful Repton game for Superior Software. KRepton brings the original game to the KDE desktop, and can be used on any of its supported platforms.
The game and editor are released under the GNU General Public Licence, although I would suggest that, if you make any improvements or modifications, that you send me a copy so that they can be incorporated into updated versions.
The current version 4.0 integrates the game player and editor into a single seamless application, so there is now of course only one download. An episode can be selected using a graphical preview list, and immediately played or edited, without having to switch between two separate applications.
If you have fond memories of the original Repton games then you wont need to be told any more; download and play the game now! If you dont know anything about them but would like to find out more then there is far more information online than I could list here; the best site by far is the Repton Appreciation Society with plenty of Repton information and downloads, including games and emulators for many other platforms.
Enhancements:
- Version 4 integrates the game player and editor into a single seamless application.
- An episode can be selected using a graphical preview list, and immediately played or edited, without having to switch between two separate applications as was the case with version 3.
<<lessThe game and editor are released under the GNU General Public Licence, although I would suggest that, if you make any improvements or modifications, that you send me a copy so that they can be incorporated into updated versions.
The current version 4.0 integrates the game player and editor into a single seamless application, so there is now of course only one download. An episode can be selected using a graphical preview list, and immediately played or edited, without having to switch between two separate applications.
If you have fond memories of the original Repton games then you wont need to be told any more; download and play the game now! If you dont know anything about them but would like to find out more then there is far more information online than I could list here; the best site by far is the Repton Appreciation Society with plenty of Repton information and downloads, including games and emulators for many other platforms.
Enhancements:
- Version 4 integrates the game player and editor into a single seamless application.
- An episode can be selected using a graphical preview list, and immediately played or edited, without having to switch between two separate applications as was the case with version 3.
Download (1.1MB)
Added: 2005-06-17 License: GPL (GNU General Public License) Price:
1590 downloads
Date Calculator 0.1
Date Calculator is a date calculator application written in pyqt. more>>
Date Calculator is a date calculator application written in pyqt. You can add or subtract days to a date, or calculate the number of days between two dates.
You can also choose to run your calculations using only working days and/or calculate inclusive of the start/end dates. There is a comprehensive gui for setting holiday dates.
Holidays can be fixed annual dates, variable dates, such as "the 1st Monday in June" or "the closest Monday to 22 February". This utility could be useful for people who need to be able to calculate time critical deadlines, such as lawyers.
Date Calculator application is also available as a superkaramba theme. You can download both from the download link.
<<lessYou can also choose to run your calculations using only working days and/or calculate inclusive of the start/end dates. There is a comprehensive gui for setting holiday dates.
Holidays can be fixed annual dates, variable dates, such as "the 1st Monday in June" or "the closest Monday to 22 February". This utility could be useful for people who need to be able to calculate time critical deadlines, such as lawyers.
Date Calculator application is also available as a superkaramba theme. You can download both from the download link.
Download (0.19MB)
Added: 2006-04-03 License: GPL (GNU General Public License) Price:
1307 downloads
Showerhead 195
Say youve got a really fat but high latency link, and you want to run something over it that uses tcp more>>
Say youve got a really fat but high latency link, and you want to run something over it that uses tcp... but it cant use the whole link, because of tcp windows or whatever. At least thats what they told me happens, so I wrote this. I dont have any big fat but high latency links to use it on, but it does work.
What it does is set up a proxy between two machines, each running showerhead; you connect to one, and the showerhead on the other end connects to whatever you told it to when you started it. All your data gets sent over some large (configurable) number tcp streams, and reassembled on the other end.
You can run a completely arbitrary number of connections over it; Ive tested up to around 20 (netcatting huge files, mostly).
Showerhead project should be better documented and easier to use.
<<lessWhat it does is set up a proxy between two machines, each running showerhead; you connect to one, and the showerhead on the other end connects to whatever you told it to when you started it. All your data gets sent over some large (configurable) number tcp streams, and reassembled on the other end.
You can run a completely arbitrary number of connections over it; Ive tested up to around 20 (netcatting huge files, mostly).
Showerhead project should be better documented and easier to use.
Download (0.044MB)
Added: 2007-01-16 License: Public Domain Price:
1011 downloads
Time::Skew 0.1
Time::Skew is a Perl module that computes local clock skew with respect to a remote clock. more>>
Time::Skew is a Perl module that computes local clock skew with respect to a remote clock.
SYNOPISI
use Time::Skew
# Init Convex Hull and timing data
my $hull=[];
my $result={};
# Iterate data point introduction
Time::Skew::convexhull($result,$datapoint,$hull);
This module supports the computation of the skew between two clocks: the (relative) skew is the speed with which two clocks diverge. For instance, if yesterday two clocks, at the same time, showed respectively 10:00 and 10:05, while today when the former shows 10:00 the latter shows 10:04, we say that their relative skew is 1 minute/24 hours, roughly 7E-4.
The module contains one single subroutine, which accepts as input a pair of timestamps, associated to a message from host A to host B: the timestamps correspond to the time when the message was sent, and to the time when message is received. Each timestamp reflects the value of the local clock where the operation takes place: the clock of host A for the send, the clock of B for the receive.
Please note that the module does _not_ contain any message exchange facility, but only the mathematics needed to perform the skew approximation, once timestamps are known.
The subroutine takes as argument:
a reference to a hash where values related to the timing of the network path from A to B;
a 2-elems array (a data point in the sequel) containing the timestamp of the receive event, and the differece between the send timestamp and the receive timestamp for one message;
a stack containing some data points, those that form the convex hull.
The usage is very simple, and is illustrated by the following example:
#!/usr/bin/perl -w
use strict;
use Time::Skew;
# Initialize data
my $hull=[];
my $result={};
while ( 1 ) {
# Exchange message and acquire a new data point
my $datapoint = acquire();
# Call the convexhull subroutine
Time::Skew::convexhull($result,$datapoint,$hull);
# After first message some results are still undefined
( defined $result->{skewjitter} ) || next;
# here you can use the results
};
}
The data returned in the "result" hash is the following:
result->{skew} the clock skew;
result->{skewjitter} the variance of the skew estimate, used to estimate convergence;
result->{jitter} difference between the current delay and the previous delay;
result->{delay} the communication delay, decremented by a constant (yet unknown) value, used to compute communication jitter;
result->{elems} the number of data points in the convex hull;
result->{select} the index of the data point in the convex hull used to compute the skew;
result->{itimestamp} the timestamp, first element in the data point just passed to the subroutine;
result->{delta} the timestamp difference, second element in the data point just passed to the subroutine;
The data returned in the "hull" stack is a series of data points, selected from those passed to successive calls of the subroutine. The number of data points in the "hull" stack usually does not exceed 20 units.
The algorithm is very fast: each call consists in scanning at most all data points in the "hull" stack, performing simple arithmetic operations for each element.
The algorithm must be fed with a sequence of data points before returning significant results. The accuracy of the estimate keeps growing while new data points are passed to the subroutine. A rough rule of thumb to evaluate estimate accuracy is to observe the skew jitter, and assume it corresponds to the skew estimate accuracy. Paths with quite regular communication delay (small jitter) converge faster.
<<lessSYNOPISI
use Time::Skew
# Init Convex Hull and timing data
my $hull=[];
my $result={};
# Iterate data point introduction
Time::Skew::convexhull($result,$datapoint,$hull);
This module supports the computation of the skew between two clocks: the (relative) skew is the speed with which two clocks diverge. For instance, if yesterday two clocks, at the same time, showed respectively 10:00 and 10:05, while today when the former shows 10:00 the latter shows 10:04, we say that their relative skew is 1 minute/24 hours, roughly 7E-4.
The module contains one single subroutine, which accepts as input a pair of timestamps, associated to a message from host A to host B: the timestamps correspond to the time when the message was sent, and to the time when message is received. Each timestamp reflects the value of the local clock where the operation takes place: the clock of host A for the send, the clock of B for the receive.
Please note that the module does _not_ contain any message exchange facility, but only the mathematics needed to perform the skew approximation, once timestamps are known.
The subroutine takes as argument:
a reference to a hash where values related to the timing of the network path from A to B;
a 2-elems array (a data point in the sequel) containing the timestamp of the receive event, and the differece between the send timestamp and the receive timestamp for one message;
a stack containing some data points, those that form the convex hull.
The usage is very simple, and is illustrated by the following example:
#!/usr/bin/perl -w
use strict;
use Time::Skew;
# Initialize data
my $hull=[];
my $result={};
while ( 1 ) {
# Exchange message and acquire a new data point
my $datapoint = acquire();
# Call the convexhull subroutine
Time::Skew::convexhull($result,$datapoint,$hull);
# After first message some results are still undefined
( defined $result->{skewjitter} ) || next;
# here you can use the results
};
}
The data returned in the "result" hash is the following:
result->{skew} the clock skew;
result->{skewjitter} the variance of the skew estimate, used to estimate convergence;
result->{jitter} difference between the current delay and the previous delay;
result->{delay} the communication delay, decremented by a constant (yet unknown) value, used to compute communication jitter;
result->{elems} the number of data points in the convex hull;
result->{select} the index of the data point in the convex hull used to compute the skew;
result->{itimestamp} the timestamp, first element in the data point just passed to the subroutine;
result->{delta} the timestamp difference, second element in the data point just passed to the subroutine;
The data returned in the "hull" stack is a series of data points, selected from those passed to successive calls of the subroutine. The number of data points in the "hull" stack usually does not exceed 20 units.
The algorithm is very fast: each call consists in scanning at most all data points in the "hull" stack, performing simple arithmetic operations for each element.
The algorithm must be fed with a sequence of data points before returning significant results. The accuracy of the estimate keeps growing while new data points are passed to the subroutine. A rough rule of thumb to evaluate estimate accuracy is to observe the skew jitter, and assume it corresponds to the skew estimate accuracy. Paths with quite regular communication delay (small jitter) converge faster.
Download (0.044MB)
Added: 2007-04-10 License: Perl Artistic License Price:
927 downloads
DateTime::Precise 1.05
DateTime::Precise can perform common time and date operations with additional GPS operations. more>>
DateTime::Precise can perform common time and date operations with additional GPS operations.
SYNOPSIS
use DateTime::Precise;
use DateTime::Precise qw(:TimeVars);
# Constructors and ways to set time.
$t1 = DateTime::Precise->new;
$t2 = DateTime::Precise->new(1998. 4. 3 12:13:44.054);
$t3 = DateTime::Precise->new(time() - 100.23456);
$t4 = DateTime::Precise->new(1998.04.24);
$t1->set_localtime_from_epoch_time;
$t1->set_gmtime_from_epoch_time(time + 120.987);
$t1->set_from_datetime(1998.03.23 16:58:14.65);
$t1->set_time(YDHMS, 1998, 177, 9, 15, 26.5);
# This is the same as $d3->set_from_datetime(...)
$t3->dscanf("%^Y.%M.%D %h:%m:%s", "1998.03.25 20:25:23");
if ($msg = $d1->dscanf("%~M", $input)) {
print "error: $msgn";
print "Must enter a three-letter month abbrev.n";
}
# Get different parts of the time.
$year = $t3->year;
$month = $t3->month;
$day = $t3->day;
$hours = $t3->hours;
$minutes = $t3->minutes;
$seconds = $t3->seconds;
($year, $day_of_year) = $t3->get_time(Yj);
# Print times and dates.
print $t2->asctime;
print $t2->strftime(%T %C%n);
print $t2->dprintf("%^Y.%M.%D %h:%m:%s"); # datetime
print $t2->dprintf("%~w %~M %-D %h:%m:%s CST %^Y"); # ctime
# Copy times.
my $t4 = $t2->copy;
# Set one time object to the same time as another: set $t3 equal to $t2.
$t3->clone($t2);
# Find the difference between two times.
$secs_from_midnight = $t4 - $t1;
$secs_from_midnight = $t4->diff($t1);
# Add seconds, days, months, etc to time.
$t1 = $t4 + 3600; # $t1 is now an hour after midnight
$t1->inc_month(2); # add two months to $t1
$t1->floor_month; # set $t1 to the first of the month
$t1 -= 0.25; # subtract 1/4 of a second from $t1
# Can compare and sort DateTime::Precise.
print "Its late!!!" if ($t1 > $t4);
@sorted = sort @birthdays; # normal comparisons work fine
# Get the GPS weeks, seconds and day.
$gps_week = $t1->gps_week;
$gps_seconds = $t1->gps_seconds;
$gps_day = $t1->gps_day;
($gps_week, $gps_seconds, $gps_day) = $t1->gps_week_seconds_day;
<<lessSYNOPSIS
use DateTime::Precise;
use DateTime::Precise qw(:TimeVars);
# Constructors and ways to set time.
$t1 = DateTime::Precise->new;
$t2 = DateTime::Precise->new(1998. 4. 3 12:13:44.054);
$t3 = DateTime::Precise->new(time() - 100.23456);
$t4 = DateTime::Precise->new(1998.04.24);
$t1->set_localtime_from_epoch_time;
$t1->set_gmtime_from_epoch_time(time + 120.987);
$t1->set_from_datetime(1998.03.23 16:58:14.65);
$t1->set_time(YDHMS, 1998, 177, 9, 15, 26.5);
# This is the same as $d3->set_from_datetime(...)
$t3->dscanf("%^Y.%M.%D %h:%m:%s", "1998.03.25 20:25:23");
if ($msg = $d1->dscanf("%~M", $input)) {
print "error: $msgn";
print "Must enter a three-letter month abbrev.n";
}
# Get different parts of the time.
$year = $t3->year;
$month = $t3->month;
$day = $t3->day;
$hours = $t3->hours;
$minutes = $t3->minutes;
$seconds = $t3->seconds;
($year, $day_of_year) = $t3->get_time(Yj);
# Print times and dates.
print $t2->asctime;
print $t2->strftime(%T %C%n);
print $t2->dprintf("%^Y.%M.%D %h:%m:%s"); # datetime
print $t2->dprintf("%~w %~M %-D %h:%m:%s CST %^Y"); # ctime
# Copy times.
my $t4 = $t2->copy;
# Set one time object to the same time as another: set $t3 equal to $t2.
$t3->clone($t2);
# Find the difference between two times.
$secs_from_midnight = $t4 - $t1;
$secs_from_midnight = $t4->diff($t1);
# Add seconds, days, months, etc to time.
$t1 = $t4 + 3600; # $t1 is now an hour after midnight
$t1->inc_month(2); # add two months to $t1
$t1->floor_month; # set $t1 to the first of the month
$t1 -= 0.25; # subtract 1/4 of a second from $t1
# Can compare and sort DateTime::Precise.
print "Its late!!!" if ($t1 > $t4);
@sorted = sort @birthdays; # normal comparisons work fine
# Get the GPS weeks, seconds and day.
$gps_week = $t1->gps_week;
$gps_seconds = $t1->gps_seconds;
$gps_day = $t1->gps_day;
($gps_week, $gps_seconds, $gps_day) = $t1->gps_week_seconds_day;
Download (0.034MB)
Added: 2007-08-09 License: Perl Artistic License Price:
807 downloads
Tunnel Vision 1.0
TunnelVision creates an encrypted VirtualPrivateNetwork, or VPN, between two Tunnel Vision-capable sites on the Internet. more>>
TunnelVision creates an encrypted VirtualPrivateNetwork, or VPN, between two Tunnel Vision-capable sites on the Internet.
TunnelVision creates an encrypted VirtualPrivateNetwork?, or VPN, between two Tunnel Vision-capable sites on the Internet. Realistically, that means sites with a Linux server running TunnelVision or with a WorldvisionsWeaver? or NetIntegrator acting as their Internet gateway.
TunnelVision requires a Linux 2.2.x kernel or later for running properly. Were sorry about that, but we wanted to use the new features.
Enhancements:
- Also known as 0.70pre2.
- Lots of underlying library changes as WvStreams v2 was debugged.
- A new way of handling strings and lists makes things prettier.
- Several bug fixes resulting from the use of our new stresstest program.
- Connections regenerate themselves after the 10-minute idle timeout.
- All known bugs have been eliminated.
<<lessTunnelVision creates an encrypted VirtualPrivateNetwork?, or VPN, between two Tunnel Vision-capable sites on the Internet. Realistically, that means sites with a Linux server running TunnelVision or with a WorldvisionsWeaver? or NetIntegrator acting as their Internet gateway.
TunnelVision requires a Linux 2.2.x kernel or later for running properly. Were sorry about that, but we wanted to use the new features.
Enhancements:
- Also known as 0.70pre2.
- Lots of underlying library changes as WvStreams v2 was debugged.
- A new way of handling strings and lists makes things prettier.
- Several bug fixes resulting from the use of our new stresstest program.
- Connections regenerate themselves after the 10-minute idle timeout.
- All known bugs have been eliminated.
Download (0.099MB)
Added: 2006-07-14 License: GPL (GNU General Public License) Price:
1197 downloads
Pipe Viewer 1.0.1
Pipe Viewer is a pipeline data transfer meter. more>>
Pipe Viewer project is a terminal-based tool for monitoring the progress of data through a pipeline.
It can be inserted into any normal pipeline between two processes to give a visual indication of how quickly data is passing through, how long it has taken, how near to completion it is, and an estimate of how long it will be until completion.
pv is now considered to be stable code: it appears to work reliably on systems it has been tested on.
<<lessIt can be inserted into any normal pipeline between two processes to give a visual indication of how quickly data is passing through, how long it has taken, how near to completion it is, and an estimate of how long it will be until completion.
pv is now considered to be stable code: it appears to work reliably on systems it has been tested on.
Download (0.037MB)
Added: 2007-08-07 License: Artistic License Price:
819 downloads
fprobe 0.4
fprobe is a small NetFlow probe which will listen on a network interface. more>>
fprobe is a small NetFlow probe which will listen on a network interface. It isusing libpcap, aggregate the traffic and export NetFlow V5 datagram to a remote collector for processing. A flow is identified by ip protocol, source ip, source port, destination ip, destination port.
Right now only ethernet interfaces are supported. Support for more media types (tunnel, ppp etc) will be added in nex versions.
/fprobe -t IP:PORT [ -i interface ] [ -s scan ] [ expression ]
-t IP:PORT NetFlow collector address
-i interface interface to listen for traffic (default eth0)
-s scan interval in seconds between two flow tables scans (Default: 10)
-c file file with MAC definitions
-p dont put the interface in promisc mode
-b go in background (daemon mode)
-l file log file name
expression a bpf expresion to filter traffic (See libpcap/tcpdump)
For example:
./fprobe -i eth2 -t 127.0.0.1:8182
This will sniff the traffic on interface eth2 and will send the NetFlow data to localhost (127.0.0.1) on UDP port 8182.
Internal flow table is parsed every scan seconds for expired flows which are sent to remote collector.
Enhancements:
- can handle IP fragments
- can set the snmp interface ID based on source/destination MAC address
- fixed uptime in exported flows
- new hash function for internal storage
- delay between udp datagrams emited
<<lessRight now only ethernet interfaces are supported. Support for more media types (tunnel, ppp etc) will be added in nex versions.
/fprobe -t IP:PORT [ -i interface ] [ -s scan ] [ expression ]
-t IP:PORT NetFlow collector address
-i interface interface to listen for traffic (default eth0)
-s scan interval in seconds between two flow tables scans (Default: 10)
-c file file with MAC definitions
-p dont put the interface in promisc mode
-b go in background (daemon mode)
-l file log file name
expression a bpf expresion to filter traffic (See libpcap/tcpdump)
For example:
./fprobe -i eth2 -t 127.0.0.1:8182
This will sniff the traffic on interface eth2 and will send the NetFlow data to localhost (127.0.0.1) on UDP port 8182.
Internal flow table is parsed every scan seconds for expired flows which are sent to remote collector.
Enhancements:
- can handle IP fragments
- can set the snmp interface ID based on source/destination MAC address
- fixed uptime in exported flows
- new hash function for internal storage
- delay between udp datagrams emited
Download (0.020MB)
Added: 2006-07-05 License: GPL (GNU General Public License) Price:
1214 downloads
Math::Cephes 0.44
Math::Cephes is a Perl interface to the cephes math library. more>>
Math::Cephes is a Perl interface to the cephes math library.
SYNOPSIS
use Math::Cephes qw(:all);
This module provides an interface to over 150 functions of the
cephes math library of Stephen Moshier. No functions are exported
by default, but rather must be imported explicitly, as in
use Math::Cephes qw(sin cos);
There are a number of export tags defined which allow
importing groups of functions:
use Math::Cephes qw(:constants);
imports the variables
$PI : 3.14159265358979323846 # pi
$PIO2 : 1.57079632679489661923 # pi/2
$PIO4 : 0.785398163397448309616 # pi/4
$SQRT2 : 1.41421356237309504880 # sqrt(2)
$SQRTH : 0.707106781186547524401 # sqrt(2)/2
$LOG2E : 1.4426950408889634073599 # 1/log(2)
$SQ2OPI : 0.79788456080286535587989 # sqrt( 2/pi )
$LOGE2 : 0.693147180559945309417 # log(2)
$LOGSQ2 : 0.346573590279972654709 # log(2)/2
$THPIO4 : 2.35619449019234492885 # 3*pi/4
$TWOOPI : 0.636619772367581343075535 # 2/pi
As well, there are 4 machine-specific numbers available:
$MACHEP : machine roundoff error
$MAXLOG : maximum log on the machine
$MINLOG : minimum log on the machine
$MAXNUM : largest number represented
use Math::Cephes qw(:trigs);
imports
acos: Inverse circular cosine
asin: Inverse circular sine
atan: Inverse circular tangent (arctangent)
atan2: Quadrant correct inverse circular tangent
cos: Circular cosine
cosdg: Circular cosine of angle in degrees
cot: Circular cotangent
cotdg: Circular cotangent of argument in degrees
hypot: hypotenuse associated with the sides of a right triangle
radian: Degrees, minutes, seconds to radians
sin: Circular sine
sindg: Circular sine of angle in degrees
tan: Circular tangent
tandg: Circular tangent of argument in degrees
cosm1: Relative error approximations for function arguments near unity
use Math::Cephes qw(:hypers);
imports
acosh: Inverse hyperbolic cosine
asinh: Inverse hyperbolic sine
atanh: Inverse hyperbolic tangent
cosh: Hyperbolic cosine
sinh: Hyperbolic sine
tanh: Hyperbolic tangent
use Math::Cephes qw(:explog);
imports
exp: Exponential function
expxx: exp(x*x)
exp10: Base 10 exponential function (Common antilogarithm)
exp2: Base 2 exponential function
log: Natural logarithm
log10: Common logarithm
log2: Base 2 logarithm
log1p,expm1: Relative error approximations for function arguments near unity.
use Math::Cephes qw(:cmplx);
imports
new_cmplx: create a new complex number object
cabs: Complex absolute value
cacos: Complex circular arc cosine
cacosh: Complex inverse hyperbolic cosine
casin: Complex circular arc sine
casinh: Complex inverse hyperbolic sine
catan: Complex circular arc tangent
catanh: Complex inverse hyperbolic tangent
ccos: Complex circular cosine
ccosh: Complex hyperbolic cosine
ccot: Complex circular cotangent
cexp: Complex exponential function
clog: Complex natural logarithm
cadd: add two complex numbers
csub: subtract two complex numbers
cmul: multiply two complex numbers
cdiv: divide two complex numbers
cmov: copy one complex number to another
cneg: negate a complex number
cpow: Complex power function
csin: Complex circular sine
csinh: Complex hyperbolic sine
csqrt: Complex square root
ctan: Complex circular tangent
ctanh: Complex hyperbolic tangent
use Math::Cephes qw(:utils);
imports
cbrt: Cube root
ceil: ceil
drand: Pseudorandom number generator
fabs: Absolute value
fac: Factorial function
floor: floor
frexp: frexp
ldexp: multiplies x by 2**n.
lrand: Pseudorandom number generator
lsqrt: Integer square root
pow: Power function
powi: Real raised to integer power
round: Round double to nearest or even integer valued double
sqrt: Square root
use Math::Cephes qw(:bessels);
imports
i0: Modified Bessel function of order zero
i0e: Modified Bessel function of order zero, exponentially scaled
i1: Modified Bessel function of order one
i1e: Modified Bessel function of order one, exponentially scaled
iv: Modified Bessel function of noninteger order
j0: Bessel function of order zero
j1: Bessel function of order one
jn: Bessel function of integer order
jv: Bessel function of noninteger order
k0: Modified Bessel function, third kind, order zero
k0e: Modified Bessel function, third kind, order zero, exponentially scaled
k1: Modified Bessel function, third kind, order one
k1e: Modified Bessel function, third kind, order one, exponentially scaled
kn: Modified Bessel function, third kind, integer order
y0: Bessel function of the second kind, order zero
y1: Bessel function of second kind of order one
yn: Bessel function of second kind of integer order
yv: Bessel function Yv with noninteger v
use Math::Cephes qw(:dists);
imports
bdtr: Binomial distribution
bdtrc: Complemented binomial distribution
bdtri: Inverse binomial distribution
btdtr: Beta distribution
chdtr: Chi-square distribution
chdtrc: Complemented Chi-square distribution
chdtri: Inverse of complemented Chi-square distribution
fdtr: F distribution
fdtrc: Complemented F distribution
fdtri: Inverse of complemented F distribution
gdtr: Gamma distribution function
gdtrc: Complemented gamma distribution function
nbdtr: Negative binomial distribution
nbdtrc: Complemented negative binomial distribution
nbdtri: Functional inverse of negative binomial distribution
ndtr: Normal distribution function
ndtri: Inverse of Normal distribution function
pdtr: Poisson distribution
pdtrc: Complemented poisson distribution
pdtri: Inverse Poisson distribution
stdtr: Students t distribution
stdtri: Functional inverse of Students t distribution
use Math::Cephes qw(:gammas);
imports
fac: Factorial function
gamma: Gamma function
igam: Incomplete gamma integral
igamc: Complemented incomplete gamma integral
igami: Inverse of complemented imcomplete gamma integral
psi: Psi (digamma) function
rgamma: Reciprocal gamma function
use Math::Cephes qw(:betas);
imports
beta: Beta function
incbet: Incomplete beta integral
incbi: Inverse of imcomplete beta integral
lbeta: Natural logarithm of |beta|
use Math::Cephes qw(:elliptics);
imports
ellie: Incomplete elliptic integral of the second kind
ellik: Incomplete elliptic integral of the first kind
ellpe: Complete elliptic integral of the second kind
ellpj: Jacobian Elliptic Functions
ellpk: Complete elliptic integral of the first kind
use Math::Cephes qw(:hypergeometrics);
imports
hyp2f0: Gauss hypergeometric function F
hyp2f1: Gauss hypergeometric function F
hyperg: Confluent hypergeometric function
onef2: Hypergeometric function 1F2
threef0: Hypergeometric function 3F0
use Math::Cephes qw(:misc);
imports
airy: Airy function
bernum: Bernoulli numbers
dawsn: Dawsons Integral
ei: Exponential integral
erf: Error function
erfc: Complementary error function
expn: Exponential integral En
fresnl: Fresnel integral
plancki: Integral of Plancks black body radiation formula
polylog: Polylogarithm function
shichi: Hyperbolic sine and cosine integrals
sici: Sine and cosine integrals
simpson: Simpsons rule to find an integral
spence: Dilogarithm
struve: Struve function
vecang: angle between two vectors
zeta: Riemann zeta function of two arguments
zetac: Riemann zeta function
use Math::Cephes qw(:fract);
imports
new_fract: create a new fraction object
radd: add two fractions
rmul: multiply two fractions
rsub: subtracttwo fractions
rdiv: divide two fractions
euclid: finds the greatest common divisor
<<lessSYNOPSIS
use Math::Cephes qw(:all);
This module provides an interface to over 150 functions of the
cephes math library of Stephen Moshier. No functions are exported
by default, but rather must be imported explicitly, as in
use Math::Cephes qw(sin cos);
There are a number of export tags defined which allow
importing groups of functions:
use Math::Cephes qw(:constants);
imports the variables
$PI : 3.14159265358979323846 # pi
$PIO2 : 1.57079632679489661923 # pi/2
$PIO4 : 0.785398163397448309616 # pi/4
$SQRT2 : 1.41421356237309504880 # sqrt(2)
$SQRTH : 0.707106781186547524401 # sqrt(2)/2
$LOG2E : 1.4426950408889634073599 # 1/log(2)
$SQ2OPI : 0.79788456080286535587989 # sqrt( 2/pi )
$LOGE2 : 0.693147180559945309417 # log(2)
$LOGSQ2 : 0.346573590279972654709 # log(2)/2
$THPIO4 : 2.35619449019234492885 # 3*pi/4
$TWOOPI : 0.636619772367581343075535 # 2/pi
As well, there are 4 machine-specific numbers available:
$MACHEP : machine roundoff error
$MAXLOG : maximum log on the machine
$MINLOG : minimum log on the machine
$MAXNUM : largest number represented
use Math::Cephes qw(:trigs);
imports
acos: Inverse circular cosine
asin: Inverse circular sine
atan: Inverse circular tangent (arctangent)
atan2: Quadrant correct inverse circular tangent
cos: Circular cosine
cosdg: Circular cosine of angle in degrees
cot: Circular cotangent
cotdg: Circular cotangent of argument in degrees
hypot: hypotenuse associated with the sides of a right triangle
radian: Degrees, minutes, seconds to radians
sin: Circular sine
sindg: Circular sine of angle in degrees
tan: Circular tangent
tandg: Circular tangent of argument in degrees
cosm1: Relative error approximations for function arguments near unity
use Math::Cephes qw(:hypers);
imports
acosh: Inverse hyperbolic cosine
asinh: Inverse hyperbolic sine
atanh: Inverse hyperbolic tangent
cosh: Hyperbolic cosine
sinh: Hyperbolic sine
tanh: Hyperbolic tangent
use Math::Cephes qw(:explog);
imports
exp: Exponential function
expxx: exp(x*x)
exp10: Base 10 exponential function (Common antilogarithm)
exp2: Base 2 exponential function
log: Natural logarithm
log10: Common logarithm
log2: Base 2 logarithm
log1p,expm1: Relative error approximations for function arguments near unity.
use Math::Cephes qw(:cmplx);
imports
new_cmplx: create a new complex number object
cabs: Complex absolute value
cacos: Complex circular arc cosine
cacosh: Complex inverse hyperbolic cosine
casin: Complex circular arc sine
casinh: Complex inverse hyperbolic sine
catan: Complex circular arc tangent
catanh: Complex inverse hyperbolic tangent
ccos: Complex circular cosine
ccosh: Complex hyperbolic cosine
ccot: Complex circular cotangent
cexp: Complex exponential function
clog: Complex natural logarithm
cadd: add two complex numbers
csub: subtract two complex numbers
cmul: multiply two complex numbers
cdiv: divide two complex numbers
cmov: copy one complex number to another
cneg: negate a complex number
cpow: Complex power function
csin: Complex circular sine
csinh: Complex hyperbolic sine
csqrt: Complex square root
ctan: Complex circular tangent
ctanh: Complex hyperbolic tangent
use Math::Cephes qw(:utils);
imports
cbrt: Cube root
ceil: ceil
drand: Pseudorandom number generator
fabs: Absolute value
fac: Factorial function
floor: floor
frexp: frexp
ldexp: multiplies x by 2**n.
lrand: Pseudorandom number generator
lsqrt: Integer square root
pow: Power function
powi: Real raised to integer power
round: Round double to nearest or even integer valued double
sqrt: Square root
use Math::Cephes qw(:bessels);
imports
i0: Modified Bessel function of order zero
i0e: Modified Bessel function of order zero, exponentially scaled
i1: Modified Bessel function of order one
i1e: Modified Bessel function of order one, exponentially scaled
iv: Modified Bessel function of noninteger order
j0: Bessel function of order zero
j1: Bessel function of order one
jn: Bessel function of integer order
jv: Bessel function of noninteger order
k0: Modified Bessel function, third kind, order zero
k0e: Modified Bessel function, third kind, order zero, exponentially scaled
k1: Modified Bessel function, third kind, order one
k1e: Modified Bessel function, third kind, order one, exponentially scaled
kn: Modified Bessel function, third kind, integer order
y0: Bessel function of the second kind, order zero
y1: Bessel function of second kind of order one
yn: Bessel function of second kind of integer order
yv: Bessel function Yv with noninteger v
use Math::Cephes qw(:dists);
imports
bdtr: Binomial distribution
bdtrc: Complemented binomial distribution
bdtri: Inverse binomial distribution
btdtr: Beta distribution
chdtr: Chi-square distribution
chdtrc: Complemented Chi-square distribution
chdtri: Inverse of complemented Chi-square distribution
fdtr: F distribution
fdtrc: Complemented F distribution
fdtri: Inverse of complemented F distribution
gdtr: Gamma distribution function
gdtrc: Complemented gamma distribution function
nbdtr: Negative binomial distribution
nbdtrc: Complemented negative binomial distribution
nbdtri: Functional inverse of negative binomial distribution
ndtr: Normal distribution function
ndtri: Inverse of Normal distribution function
pdtr: Poisson distribution
pdtrc: Complemented poisson distribution
pdtri: Inverse Poisson distribution
stdtr: Students t distribution
stdtri: Functional inverse of Students t distribution
use Math::Cephes qw(:gammas);
imports
fac: Factorial function
gamma: Gamma function
igam: Incomplete gamma integral
igamc: Complemented incomplete gamma integral
igami: Inverse of complemented imcomplete gamma integral
psi: Psi (digamma) function
rgamma: Reciprocal gamma function
use Math::Cephes qw(:betas);
imports
beta: Beta function
incbet: Incomplete beta integral
incbi: Inverse of imcomplete beta integral
lbeta: Natural logarithm of |beta|
use Math::Cephes qw(:elliptics);
imports
ellie: Incomplete elliptic integral of the second kind
ellik: Incomplete elliptic integral of the first kind
ellpe: Complete elliptic integral of the second kind
ellpj: Jacobian Elliptic Functions
ellpk: Complete elliptic integral of the first kind
use Math::Cephes qw(:hypergeometrics);
imports
hyp2f0: Gauss hypergeometric function F
hyp2f1: Gauss hypergeometric function F
hyperg: Confluent hypergeometric function
onef2: Hypergeometric function 1F2
threef0: Hypergeometric function 3F0
use Math::Cephes qw(:misc);
imports
airy: Airy function
bernum: Bernoulli numbers
dawsn: Dawsons Integral
ei: Exponential integral
erf: Error function
erfc: Complementary error function
expn: Exponential integral En
fresnl: Fresnel integral
plancki: Integral of Plancks black body radiation formula
polylog: Polylogarithm function
shichi: Hyperbolic sine and cosine integrals
sici: Sine and cosine integrals
simpson: Simpsons rule to find an integral
spence: Dilogarithm
struve: Struve function
vecang: angle between two vectors
zeta: Riemann zeta function of two arguments
zetac: Riemann zeta function
use Math::Cephes qw(:fract);
imports
new_fract: create a new fraction object
radd: add two fractions
rmul: multiply two fractions
rsub: subtracttwo fractions
rdiv: divide two fractions
euclid: finds the greatest common divisor
Download (0.29MB)
Added: 2007-06-27 License: Perl Artistic License Price:
850 downloads
Geo::Google::Segment 0.02
Geo::Google::Segment is an annotated segment of a path. more>>
Geo::Google::Segment is an annotated segment of a path.
SYNOPSIS
use Geo::Google::Segment;
# you shouldnt need to construct these yourself,
# have a Geo::Google object do it for you.
Google Maps is able to serve up directions between two points. Directions consist of two types of components:
1. a series of points along a "polyline".
2. a series of annotations, each of which applies to a contiguous
range of points.
In the Geo::Google object model, directions are available by calling path() on a Geo::Google instance. The return value is a Geo::Google::Path object, which is a composite of Geo::Google::Segment objects, which are in turn composites of Geo::Google::Location objects.
<<lessSYNOPSIS
use Geo::Google::Segment;
# you shouldnt need to construct these yourself,
# have a Geo::Google object do it for you.
Google Maps is able to serve up directions between two points. Directions consist of two types of components:
1. a series of points along a "polyline".
2. a series of annotations, each of which applies to a contiguous
range of points.
In the Geo::Google object model, directions are available by calling path() on a Geo::Google instance. The return value is a Geo::Google::Path object, which is a composite of Geo::Google::Segment objects, which are in turn composites of Geo::Google::Location objects.
Download (0.010MB)
Added: 2006-11-24 License: Perl Artistic License Price:
1064 downloads
NcFTP Client 3.2.1
NcFTP Client is a File Transfer Protocol (FTP) client applications. more>>
NcFTPs purpose is to provide a powerful and flexible interface to the Internet standard File Transfer Protocol. It is intended to replace the stock ftp program that comes with the system.
Although the program appears to be rather spartan, youll find that ncftp has a wealth of valuable performance and usage features. The program was designed with an emphasis on usability, and it does as much as it can for you automatically so you can do what you expect to do with a file transfer program, which is transfer files between two interconnected systems.
Some of the cooler features include progress meters, filename completion, command-line editing, background processing, auto-resume downloads, bookmarking, cached directory listings, host redialing, working with firewalls and proxies, downloading entire directory trees, etc., etc.
The ncftp distribution comes with the useful utility programs ncftpget(1) and ncftpput(1) which were designed to do command-line FTP. In particular, they are very handy for shell scripts. This version of ncftp no longer does command-line FTP, since the main ncftp program is more of a browser-type program.
<<lessAlthough the program appears to be rather spartan, youll find that ncftp has a wealth of valuable performance and usage features. The program was designed with an emphasis on usability, and it does as much as it can for you automatically so you can do what you expect to do with a file transfer program, which is transfer files between two interconnected systems.
Some of the cooler features include progress meters, filename completion, command-line editing, background processing, auto-resume downloads, bookmarking, cached directory listings, host redialing, working with firewalls and proxies, downloading entire directory trees, etc., etc.
The ncftp distribution comes with the useful utility programs ncftpget(1) and ncftpput(1) which were designed to do command-line FTP. In particular, they are very handy for shell scripts. This version of ncftp no longer does command-line FTP, since the main ncftp program is more of a browser-type program.
Download (0.50MB)
Added: 2007-08-01 License: Artistic License Price:
828 downloads
binkd 0.9.4
Binkd is a TCP/IP daemon which transfers files between two Fidonet systems. more>>
Binkd is a TCP/IP daemon which transfers files between two Fidonet systems. It supports so-called "Binkley-Style outbound", also supported by most Fidonet software.
It uses its own protocol (called Binkp), but its not a big problem, as binkd (started Nov, 96) now is maybe the most popular fidonet-over-IP technology in the former USSR.
Binkd cannot (and never will) make calls via regular telephone lines, so it should be used not instead of, but along with any other Bink-style Fidonet mailer. Its known that Binkd (at least) runs perfectly together with Ifmail, Brake!, Bink/+, McMail, T-Mail and Xenia mailers.
Binkd comes in ANSI C sources, so it can be built in almost any environment with Berkeley sockets API supported (multitasking is a plus). I know about UNIX (AIX, FreeBSD, NetBSD, Linux, Solaris), OS/2, NT, DOS, and Windows95 ports.
For install just follow these steps:
1. Edit sample binkd.cfg.
2. Run binkd.
Enhancements:
- Dont attempt to kill client manager if its not running (Michail Vidiassov ).
- Fixed bug in multithread version (win32 & os2/watcom).
- New option "temp-inbound" in binkd.cfg - directory for incomplete receiving files (.dt and .hr).
- New options "socks" and "proxy" in binkd.cfg (Dima Afanasiev )
- MD5 authorization (Dima Afanasiev )
- New commandline switch "-m" - disable MD5 authorization.
- prescan did not work on incoming sessions with send-if-pwd
- NT: new commandline parameters "-i" (install as service) and "-u" (uninstall service) (Dima Afanasiev )
- Immediate events (beginning with !) runs immediate after file receiving (Dima Afanasiev )
- Macros *F (file name), *H (host name), *A0..*A9 (remote addresses), *L (listed), *P (protected) in events (Dima Afanasiev )
<<lessIt uses its own protocol (called Binkp), but its not a big problem, as binkd (started Nov, 96) now is maybe the most popular fidonet-over-IP technology in the former USSR.
Binkd cannot (and never will) make calls via regular telephone lines, so it should be used not instead of, but along with any other Bink-style Fidonet mailer. Its known that Binkd (at least) runs perfectly together with Ifmail, Brake!, Bink/+, McMail, T-Mail and Xenia mailers.
Binkd comes in ANSI C sources, so it can be built in almost any environment with Berkeley sockets API supported (multitasking is a plus). I know about UNIX (AIX, FreeBSD, NetBSD, Linux, Solaris), OS/2, NT, DOS, and Windows95 ports.
For install just follow these steps:
1. Edit sample binkd.cfg.
2. Run binkd.
Enhancements:
- Dont attempt to kill client manager if its not running (Michail Vidiassov ).
- Fixed bug in multithread version (win32 & os2/watcom).
- New option "temp-inbound" in binkd.cfg - directory for incomplete receiving files (.dt and .hr).
- New options "socks" and "proxy" in binkd.cfg (Dima Afanasiev )
- MD5 authorization (Dima Afanasiev )
- New commandline switch "-m" - disable MD5 authorization.
- prescan did not work on incoming sessions with send-if-pwd
- NT: new commandline parameters "-i" (install as service) and "-u" (uninstall service) (Dima Afanasiev )
- Immediate events (beginning with !) runs immediate after file receiving (Dima Afanasiev )
- Macros *F (file name), *H (host name), *A0..*A9 (remote addresses), *L (listed), *P (protected) in events (Dima Afanasiev )
Download (0.17MB)
Added: 2006-07-03 License: GPL (GNU General Public License) Price:
1211 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 between two 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
