represents
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 662
HORRORss 1.3
HORRORss is a set of Java classes to parse RSS files. more>>
HORRORss is a set of Java classes to parse RSS files. It works with simple objects (POJOs) which represents the main items of RSS files like "image", "channel", and "item".
The main features are ease of use, compatibility with all RSS/RDF specifications, and compatibility with GNU Classpath.
Compatible with:
- RSS 0.9x
- RSS 1.0
- RSS 2.0
- Atom 0.3
- GNU Classpath
Enhancements:
- The most important features in this release are a cache system to store the RSS feeds and the ability to define the charset.
- It also fixes an error when using the method "parse(String URL)".
<<lessThe main features are ease of use, compatibility with all RSS/RDF specifications, and compatibility with GNU Classpath.
Compatible with:
- RSS 0.9x
- RSS 1.0
- RSS 2.0
- Atom 0.3
- GNU Classpath
Enhancements:
- The most important features in this release are a cache system to store the RSS feeds and the ability to define the charset.
- It also fixes an error when using the method "parse(String URL)".
Download (0.13MB)
Added: 2006-12-18 License: Public Domain Price:
1040 downloads
Regression mAKEr 0.9.11
Regression mAKEr project is a simple modular application for data investigation. more>>
Regression mAKEr project is a simple modular application for data investigation.
This is an application to help user (mathematician) to make regression between series of data, draw grpahics, and export them into various formats by means of common graphics packages (i.e., gnuplot, plotutils). It is written in Python.
The user interfeace is built upon the wxPython (wxWindows) widget set.
The idea of usage is as follows: the user builds a project which is represented as a tree of modules; modules can generate data variables, as well as consume them. Essentialy, such a tree represents an algorithm of data analysis.
The system is intended to educate students.
<<lessThis is an application to help user (mathematician) to make regression between series of data, draw grpahics, and export them into various formats by means of common graphics packages (i.e., gnuplot, plotutils). It is written in Python.
The user interfeace is built upon the wxPython (wxWindows) widget set.
The idea of usage is as follows: the user builds a project which is represented as a tree of modules; modules can generate data variables, as well as consume them. Essentialy, such a tree represents an algorithm of data analysis.
The system is intended to educate students.
Download (1.9MB)
Added: 2006-10-23 License: GPL (GNU General Public License) Price:
1102 downloads
Apache Struts 1.3.5
Apache Struts is a free open-source framework for creating Java web applications. more>>
Apache Struts project is a free open-source framework for creating Java web applications.
Web applications differ from conventional websites in that web applications can create a dynamic response. Many websites deliver only static pages. A web application can interact with databases and business logic engines to customize a response.
Web applications based on JavaServer Pages sometimes commingle database code, page design code, and control flow code. In practice, we find that unless these concerns are separated, larger applications become difficult to maintain.
One way to separate concerns in a software application is to use a Model-View-Controller (MVC) architecture. The Model represents the business or database code, the View represents the page design code, and the Controller represents the navigational code. The Struts framework is designed to help developers create web applications that utilize a MVC architecture.
The framework provides three key components:
A "request" handler provided by the application developer that is mapped to a standard URI.
A "response" handler that transfers control to another resource which completes the response.
A tag library that helps developers create interactive form-based applications with server pages.
The frameworks architecture and tags are buzzword compliant. Struts works well with conventional REST applications and with nouveau technologies like SOAP and AJAX.
The Apache Struts Project is the open source community that creates and maintains the Apache Struts framework. The project consists of a diverse group of volunteers who share common values regarding collaborative, community-based open source development. The Apache Struts Project is proud to share these values with our parent organization: The Apache Software Foundation.
The project is called "Struts" because the framework is meant to furnish the "invisible underpinnings" that support professional application development. Struts provides the glue that joins the various elements of the standard Java platform into a coherent whole. Our goal is to leverage existing standards by producing the missing pieces we need to create enterprise-grade applications that are easy to maintain over time.
The Apache Struts Project offers two major versions of the Struts framework. Struts 1 is recognized as the most popular web application framework for Java. The 1.x framework is mature, well-documented, and widely supported. Struts 1 is the best choice for teams who value proven solutions to common problems.
Struts 2 was originally known as WebWork 2. After working independently for several years, the WebWork and Struts communities joined forces to create Struts 2. The new framework is the best choice for teams who value elegant solutions to difficult problems.
<<lessWeb applications differ from conventional websites in that web applications can create a dynamic response. Many websites deliver only static pages. A web application can interact with databases and business logic engines to customize a response.
Web applications based on JavaServer Pages sometimes commingle database code, page design code, and control flow code. In practice, we find that unless these concerns are separated, larger applications become difficult to maintain.
One way to separate concerns in a software application is to use a Model-View-Controller (MVC) architecture. The Model represents the business or database code, the View represents the page design code, and the Controller represents the navigational code. The Struts framework is designed to help developers create web applications that utilize a MVC architecture.
The framework provides three key components:
A "request" handler provided by the application developer that is mapped to a standard URI.
A "response" handler that transfers control to another resource which completes the response.
A tag library that helps developers create interactive form-based applications with server pages.
The frameworks architecture and tags are buzzword compliant. Struts works well with conventional REST applications and with nouveau technologies like SOAP and AJAX.
The Apache Struts Project is the open source community that creates and maintains the Apache Struts framework. The project consists of a diverse group of volunteers who share common values regarding collaborative, community-based open source development. The Apache Struts Project is proud to share these values with our parent organization: The Apache Software Foundation.
The project is called "Struts" because the framework is meant to furnish the "invisible underpinnings" that support professional application development. Struts provides the glue that joins the various elements of the standard Java platform into a coherent whole. Our goal is to leverage existing standards by producing the missing pieces we need to create enterprise-grade applications that are easy to maintain over time.
The Apache Struts Project offers two major versions of the Struts framework. Struts 1 is recognized as the most popular web application framework for Java. The 1.x framework is mature, well-documented, and widely supported. Struts 1 is the best choice for teams who value proven solutions to common problems.
Struts 2 was originally known as WebWork 2. After working independently for several years, the WebWork and Struts communities joined forces to create Struts 2. The new framework is the best choice for teams who value elegant solutions to difficult problems.
Download (MB)
Added: 2007-01-12 License: The Apache License 2.0 Price:
634 downloads
YAPE::Regex::Element 3.03
YAPE::Regex::Element contains sub-classes for YAPE::Regex elements. more>>
YAPE::Regex::Element contains sub-classes for YAPE::Regex elements.
SYNOPSIS
use YAPE::Regex MyExt::Mod;
# this sets up inheritence in MyExt::Mod
# see YAPE::Regex documentation
YAPE MODULES
The YAPE hierarchy of modules is an attempt at a unified means of parsing and extracting content. It attempts to maintain a generic interface, to promote simplicity and reusability. The API is powerful, yet simple. The modules do tokenization (which can be intercepted) and build trees, so that extraction of specific nodes is doable.
Methods for YAPE::Regex::Element
This class contains fallback methods for the other classes.
my $str = $obj->text;
Returns a string representation of the content of the regex node itself, not any nodes contained in it. This is undef for non-text nodes.
my $str = $obj->string;
Returns a string representation of the regex node itself, not any nodes contained in it.
my $str = $obj->fullstring;
Returns a string representation of the regex node, including any nodes contained in it.
my $quant = $obj->quant;
Returns a string with the quantity, and a ? if the node is non-greedy. The quantity is one of *, +, ?, {M,N}, or an empty string.
my $ng = $obj->ngreed;
Returns a ? if the node is non-greedy, and an empty string otherwise.
Methods for YAPE::Regex::anchor
This class represents anchors. Objects have the following methods:
my $anchor = YAPE::Regex::anchor->new($type,$q,$ng);
Creates a YAPE::Regex::anchor object. Takes three arguments: the anchor (^, A, $, Z, z, B, b, or G), the quantity, and the non-greedy flag. The quantity should be an empty string.
my $anc = YAPE::Regex::anchor->new(A, , ?);
# /A?/
my $type = $anchor->type;
Returns the string anchor.
Methods for YAPE::Regex::macro
This class represents character-class macros. Objects have the following methods:
my $macro = YAPE::Regex::macro->new($type,$q,$ng);
Creates a YAPE::Regex::macro object. Takes three arguments: the macro (w, W, d, D, s, or S), the quantity, and the non-greedy flag.
my $macro = YAPE::Regex::macro->new(s, {3,5});
# /s{3,5}/
my $text = $macro->text;
Returns the macro.
print $macro->text; # s
my $type = $macro->type;
Returns the string macro.
Methods for YAPE::Regex::oct
This class represents octal escapes. Objects have the following methods:
my $oct = YAPE::Regex::oct->new($type,$q,$ng);
Creates a YAPE::Regex::oct object. Takes three arguments: the octal number (as a string), the quantity, and the non-greedy flag.
my $oct = YAPE::Regex::oct->new(040);
# / 40/
my $text = $oct->text;
Returns the octal escape.
print $oct->text; # 40
my $type = $oct->type;
Returns the string oct.
Methods for YAPE::Regex::hex
This class represents hexadecimal escapes. Objects have the following methods:
my $hex = YAPE::Regex::hex->new($type,$q,$ng);
Creates a YAPE::Regex::hex object. Takes three arguments: the hexadecimal number (as a string), the quantity, and the non-greedy flag.
my $hex = YAPE::Regex::hex->new(20,{2,});
# /x20{2,}/
my $text = $hex->text;
Returns the hexadecimal escape.
print $hex->text; # x20
my $type = $hex->type;
Returns the string hex.
Methods for YAPE::Regex::utf8hex
This class represents UTF hexadecimal escapes. Objects have the following methods:
my $hex = YAPE::Regex::utf8hex->new($type,$q,$ng);
Creates a YAPE::Regex::utf8hex object. Takes three arguments: the hexadecimal number (as a string), the quantity, and the non-greedy flag.
my $utf8hex = YAPE::Regex::utf8hex->new(beef,{0,4});
# /x{beef}{2,}/
my $text = $utf8hex->text;
Returns the hexadecimal escape.
print $utf8hex->text; # x{beef}
my $type = $utf8hex->type;
Returns the string utf8hex.
Methods for YAPE::Regex::backref
This class represents back-references. Objects have the following methods:
my $bref = YAPE::Regex::bref->new($type,$q,$ng);
Creates a YAPE::Regex::bref object. Takes three arguments: the number of the back-reference, the quantity, and the non-greedy flag.
my $bref = YAPE::Regex::bref->new(2,,?);
# /2?/
my $text = $bref->text;
Returns the backescape.
print $bref->text; # 2
my $type = $bref->type;
Returns the string backref.
Methods for YAPE::Regex::ctrl
This class represents control character escapes. Objects have the following methods:
my $ctrl = YAPE::Regex::ctrl->new($type,$q,$ng);
Creates a YAPE::Regex::ctrl object. Takes three arguments: the control character, the quantity, and the non-greedy flag.
my $ctrl = YAPE::Regex::ctrl->new(M);
# /cM/
my $text = $ctrl->text;
Returns the control character escape.
print $ctrl->text; # cM
my $type = $ctrl->type;
Returns the string ctrl.
Methods for YAPE::Regex::named
This class represents named characters. Objects have the following methods:
my $ctrl = YAPE::Regex::named->new($type,$q,$ng);
Creates a YAPE::Regex::named object. Takes three arguments: the name of the character, the quantity, and the non-greedy flag.
my $named = YAPE::Regex::named->new(GREEK SMALL LETTER BETA);
# /N{GREEK SMALL LETTER BETA}/
my $text = $named->text;
Returns the character escape text.
print $named->text; # N{GREEK SMALL LETTER BETA}
my $type = $named->type;
Returns the string named.
<<lessSYNOPSIS
use YAPE::Regex MyExt::Mod;
# this sets up inheritence in MyExt::Mod
# see YAPE::Regex documentation
YAPE MODULES
The YAPE hierarchy of modules is an attempt at a unified means of parsing and extracting content. It attempts to maintain a generic interface, to promote simplicity and reusability. The API is powerful, yet simple. The modules do tokenization (which can be intercepted) and build trees, so that extraction of specific nodes is doable.
Methods for YAPE::Regex::Element
This class contains fallback methods for the other classes.
my $str = $obj->text;
Returns a string representation of the content of the regex node itself, not any nodes contained in it. This is undef for non-text nodes.
my $str = $obj->string;
Returns a string representation of the regex node itself, not any nodes contained in it.
my $str = $obj->fullstring;
Returns a string representation of the regex node, including any nodes contained in it.
my $quant = $obj->quant;
Returns a string with the quantity, and a ? if the node is non-greedy. The quantity is one of *, +, ?, {M,N}, or an empty string.
my $ng = $obj->ngreed;
Returns a ? if the node is non-greedy, and an empty string otherwise.
Methods for YAPE::Regex::anchor
This class represents anchors. Objects have the following methods:
my $anchor = YAPE::Regex::anchor->new($type,$q,$ng);
Creates a YAPE::Regex::anchor object. Takes three arguments: the anchor (^, A, $, Z, z, B, b, or G), the quantity, and the non-greedy flag. The quantity should be an empty string.
my $anc = YAPE::Regex::anchor->new(A, , ?);
# /A?/
my $type = $anchor->type;
Returns the string anchor.
Methods for YAPE::Regex::macro
This class represents character-class macros. Objects have the following methods:
my $macro = YAPE::Regex::macro->new($type,$q,$ng);
Creates a YAPE::Regex::macro object. Takes three arguments: the macro (w, W, d, D, s, or S), the quantity, and the non-greedy flag.
my $macro = YAPE::Regex::macro->new(s, {3,5});
# /s{3,5}/
my $text = $macro->text;
Returns the macro.
print $macro->text; # s
my $type = $macro->type;
Returns the string macro.
Methods for YAPE::Regex::oct
This class represents octal escapes. Objects have the following methods:
my $oct = YAPE::Regex::oct->new($type,$q,$ng);
Creates a YAPE::Regex::oct object. Takes three arguments: the octal number (as a string), the quantity, and the non-greedy flag.
my $oct = YAPE::Regex::oct->new(040);
# / 40/
my $text = $oct->text;
Returns the octal escape.
print $oct->text; # 40
my $type = $oct->type;
Returns the string oct.
Methods for YAPE::Regex::hex
This class represents hexadecimal escapes. Objects have the following methods:
my $hex = YAPE::Regex::hex->new($type,$q,$ng);
Creates a YAPE::Regex::hex object. Takes three arguments: the hexadecimal number (as a string), the quantity, and the non-greedy flag.
my $hex = YAPE::Regex::hex->new(20,{2,});
# /x20{2,}/
my $text = $hex->text;
Returns the hexadecimal escape.
print $hex->text; # x20
my $type = $hex->type;
Returns the string hex.
Methods for YAPE::Regex::utf8hex
This class represents UTF hexadecimal escapes. Objects have the following methods:
my $hex = YAPE::Regex::utf8hex->new($type,$q,$ng);
Creates a YAPE::Regex::utf8hex object. Takes three arguments: the hexadecimal number (as a string), the quantity, and the non-greedy flag.
my $utf8hex = YAPE::Regex::utf8hex->new(beef,{0,4});
# /x{beef}{2,}/
my $text = $utf8hex->text;
Returns the hexadecimal escape.
print $utf8hex->text; # x{beef}
my $type = $utf8hex->type;
Returns the string utf8hex.
Methods for YAPE::Regex::backref
This class represents back-references. Objects have the following methods:
my $bref = YAPE::Regex::bref->new($type,$q,$ng);
Creates a YAPE::Regex::bref object. Takes three arguments: the number of the back-reference, the quantity, and the non-greedy flag.
my $bref = YAPE::Regex::bref->new(2,,?);
# /2?/
my $text = $bref->text;
Returns the backescape.
print $bref->text; # 2
my $type = $bref->type;
Returns the string backref.
Methods for YAPE::Regex::ctrl
This class represents control character escapes. Objects have the following methods:
my $ctrl = YAPE::Regex::ctrl->new($type,$q,$ng);
Creates a YAPE::Regex::ctrl object. Takes three arguments: the control character, the quantity, and the non-greedy flag.
my $ctrl = YAPE::Regex::ctrl->new(M);
# /cM/
my $text = $ctrl->text;
Returns the control character escape.
print $ctrl->text; # cM
my $type = $ctrl->type;
Returns the string ctrl.
Methods for YAPE::Regex::named
This class represents named characters. Objects have the following methods:
my $ctrl = YAPE::Regex::named->new($type,$q,$ng);
Creates a YAPE::Regex::named object. Takes three arguments: the name of the character, the quantity, and the non-greedy flag.
my $named = YAPE::Regex::named->new(GREEK SMALL LETTER BETA);
# /N{GREEK SMALL LETTER BETA}/
my $text = $named->text;
Returns the character escape text.
print $named->text; # N{GREEK SMALL LETTER BETA}
my $type = $named->type;
Returns the string named.
Download (0.15MB)
Added: 2007-08-17 License: Perl Artistic License Price:
799 downloads
PDF::ReportWriter::Report 1.3
PDF::ReportWriter::Report is a Perl module with PDF::ReportWriter classes that represents a single report. more>>
PDF::ReportWriter::Report is a Perl module with PDF::ReportWriter classes that represents a single report. It handles the conversions from/to XML to PDF::ReportWriter correct data structures, and can provide the data to be used in the report. XML::Simple module is used for data structures serialization to XML and restore.
This class is designed in a way that should be simple to be overloaded, and thus provide alternative classes that load reports in a totally different way, or supply data connecting automatically to a DBI DSN, or who knows...
USAGE:
The most useful usage for this class is through the PDF::ReportWriter::render_report() call. If you really want an example of usage of standalone Report object, here it is:
# Create a blank report object
my $report = PDF::ReportWriter::Report->new();
my $config;
# Load XML report definition
eval { $config = $report->load(/home/cosimo/myreport.xml) };
if( $@ ) {
# Incorrect xml file!
print Error in XML report:, $@, "n";
}
# Now save the report object to xml file
my $ok = $report->save($config);
my $ok = $report->save($config, Copy of report.xml);
<<lessThis class is designed in a way that should be simple to be overloaded, and thus provide alternative classes that load reports in a totally different way, or supply data connecting automatically to a DBI DSN, or who knows...
USAGE:
The most useful usage for this class is through the PDF::ReportWriter::render_report() call. If you really want an example of usage of standalone Report object, here it is:
# Create a blank report object
my $report = PDF::ReportWriter::Report->new();
my $config;
# Load XML report definition
eval { $config = $report->load(/home/cosimo/myreport.xml) };
if( $@ ) {
# Incorrect xml file!
print Error in XML report:, $@, "n";
}
# Now save the report object to xml file
my $ok = $report->save($config);
my $ok = $report->save($config, Copy of report.xml);
Download (0.13MB)
Added: 2006-09-18 License: Perl Artistic License Price:
1131 downloads
Synaesthesia 2.3
Synaesthesia graphically represents music in real time as a shimmering field of fog and glowing lines. more>>
Synaesthesia is a program that gives a graphical accompanyment to music. Anyone can make some pretty piece of graphics that flashes in time to the music, Synaesthesia manages a wee bit more sophistication.
The screenshots to the right dont really do justice to the display, which writhes in tight synchrony to the music you play.
Synaesthesias display combines information about the frequency, location and diffuseness of sound.
The display is sufficiently detailed to let you distinguish several individual instruments, singers, or special effects on screen by their location, shape and color, and sufficiently fast to distinguish individual drum beats and notes.
Synaesthesia runs under Linux, FreeBSD and Windows.
Main features:
- Displays sound from CD or line input, piped from another program, or through EsounD.
- Display incorporates stereo and surround sound information.
- Can be used as a CD player
- Svgalib, X-Windows and SDL support
Synaesthesia works well in tandem with EsounD based mp3 players, such as XMMS.
Synaesthesia is free software distributed under GPL.
<<lessThe screenshots to the right dont really do justice to the display, which writhes in tight synchrony to the music you play.
Synaesthesias display combines information about the frequency, location and diffuseness of sound.
The display is sufficiently detailed to let you distinguish several individual instruments, singers, or special effects on screen by their location, shape and color, and sufficiently fast to distinguish individual drum beats and notes.
Synaesthesia runs under Linux, FreeBSD and Windows.
Main features:
- Displays sound from CD or line input, piped from another program, or through EsounD.
- Display incorporates stereo and surround sound information.
- Can be used as a CD player
- Svgalib, X-Windows and SDL support
Synaesthesia works well in tandem with EsounD based mp3 players, such as XMMS.
Synaesthesia is free software distributed under GPL.
Download (2.3MB)
Added: 2005-09-09 License: GPL (GNU General Public License) Price:
1506 downloads
Set::IntSpan::Fast 0.0.5
Set::IntSpan::Fast is a Perl module for fast handling of sets containing integer spans. more>>
Set::IntSpan::Fast is a Perl module for fast handling of sets containing integer spans.
SYNOPSIS
use Set::IntSpan::Fast;
my $set = Set::IntSpan::Fast->new();
$set->add(1, 3, 5, 7, 9);
$set->add_range(100, 1_000_000);
print $set->as_string(), "n"; # prints 1,3,5,7,9,100-1000000
The Set::IntSpan module represents sets of integers as a number of inclusive ranges, for example 1-10,19-23,45-48. Because many of its operations involve linear searches of the list of ranges its overall performance tends to be proportional to the number of distinct ranges. This is fine for small sets but suffers compared to other possible set representations (bit vectors, hash keys) when the number of ranges grows large.
This module also represents sets as ranges of values but stores those ranges in order and uses a binary search for many internal operations so that overall performance tends towards O log N where N is the number of ranges.
The internal representation used by this module is extremely simple: a set is represented as a list of integers. Integers in even numbered positions (0, 2, 4 etc) represent the start of a run of numbers while those in odd numbered positions represent the ends of runs. As an example the set (1, 3-7, 9, 11, 12) would be represented internally as (1, 2, 3, 8, 11, 13).
Sets may be infinite - assuming youre prepared to accept that infinity is actually no more than a fairly large integer. Specifically the constants Set::IntSpan::Fast::NEGATIVE_INFINITY and Set::IntSpan::Fast::POSITIVE_INFINITY are defined to be -(2^31-1) and (2^31-2) respectively. To create an infinite set invert an empty one:
my $inf = Set::IntSpan::Fast->new()->complement();
Sets need only be bounded in one direction - for example this is the set of all positive integers (assuming you accept the slightly feeble definition of infinity were using):
my $pos_int = Set::IntSpan::Fast->new();
$pos_int->add_range(1, $pos_int->POSITIVE_INFINITY);
<<lessSYNOPSIS
use Set::IntSpan::Fast;
my $set = Set::IntSpan::Fast->new();
$set->add(1, 3, 5, 7, 9);
$set->add_range(100, 1_000_000);
print $set->as_string(), "n"; # prints 1,3,5,7,9,100-1000000
The Set::IntSpan module represents sets of integers as a number of inclusive ranges, for example 1-10,19-23,45-48. Because many of its operations involve linear searches of the list of ranges its overall performance tends to be proportional to the number of distinct ranges. This is fine for small sets but suffers compared to other possible set representations (bit vectors, hash keys) when the number of ranges grows large.
This module also represents sets as ranges of values but stores those ranges in order and uses a binary search for many internal operations so that overall performance tends towards O log N where N is the number of ranges.
The internal representation used by this module is extremely simple: a set is represented as a list of integers. Integers in even numbered positions (0, 2, 4 etc) represent the start of a run of numbers while those in odd numbered positions represent the ends of runs. As an example the set (1, 3-7, 9, 11, 12) would be represented internally as (1, 2, 3, 8, 11, 13).
Sets may be infinite - assuming youre prepared to accept that infinity is actually no more than a fairly large integer. Specifically the constants Set::IntSpan::Fast::NEGATIVE_INFINITY and Set::IntSpan::Fast::POSITIVE_INFINITY are defined to be -(2^31-1) and (2^31-2) respectively. To create an infinite set invert an empty one:
my $inf = Set::IntSpan::Fast->new()->complement();
Sets need only be bounded in one direction - for example this is the set of all positive integers (assuming you accept the slightly feeble definition of infinity were using):
my $pos_int = Set::IntSpan::Fast->new();
$pos_int->add_range(1, $pos_int->POSITIVE_INFINITY);
Download (0.10MB)
Added: 2007-01-24 License: Perl Artistic License Price:
1003 downloads
App::Session 0.962
App::Session can represents a sequence of multiple events perhaps executed in separate processes. more>>
App::Session can represents a sequence of multiple events perhaps executed in separate processes.
SYNOPSIS
# ... official way to get a Session object ...
use App;
$session = App->context();
$context = $session->session(); # get the session
# any of the following named parameters may be specified
$session = $context->session(
);
# ... alternative way (used internally) ...
use App::Session;
A Session class models the sequence of events associated with a use of the system. These events may occur in different processes.
For instance, in a web environment, when a new user arrives at a web site, he is allocated a new Session, even though he may not even be authenticated. In subsequent requests, his actions are tied together by a Session ID that is transmitted from the browser to the server on each request. During the Session, he may log in, log out, and log in again. Finally, Sessions in the web environment generally time out if not accessed for a certain period of time.
Conceptually, the Session may span processes, so they generally have a way to persist themselves so that they may be reinstantiated wherever they are needed. This would certainly be true in CGI or Cmd Contexts where each CGI request or command execution relies on and contributes to the running state accumulated in the Session. Other execution Contexts (Curses, Gtk) only require trivial implementations of a Session because it stays in memory for the duration of the process. Nonetheless, even these Contexts use a Session object so that the programming model across multiple platforms is the same.
<<lessSYNOPSIS
# ... official way to get a Session object ...
use App;
$session = App->context();
$context = $session->session(); # get the session
# any of the following named parameters may be specified
$session = $context->session(
);
# ... alternative way (used internally) ...
use App::Session;
A Session class models the sequence of events associated with a use of the system. These events may occur in different processes.
For instance, in a web environment, when a new user arrives at a web site, he is allocated a new Session, even though he may not even be authenticated. In subsequent requests, his actions are tied together by a Session ID that is transmitted from the browser to the server on each request. During the Session, he may log in, log out, and log in again. Finally, Sessions in the web environment generally time out if not accessed for a certain period of time.
Conceptually, the Session may span processes, so they generally have a way to persist themselves so that they may be reinstantiated wherever they are needed. This would certainly be true in CGI or Cmd Contexts where each CGI request or command execution relies on and contributes to the running state accumulated in the Session. Other execution Contexts (Curses, Gtk) only require trivial implementations of a Session because it stays in memory for the duration of the process. Nonetheless, even these Contexts use a Session object so that the programming model across multiple platforms is the same.
Download (0.072MB)
Added: 2006-07-20 License: GPL (GNU General Public License) Price:
1191 downloads
Games::Poker::TexasHoldem 1.4
Games::Poker::TexasHoldem is an abstract state in a Holdem game. more>>
Games::Poker::TexasHoldem is an abstract state in a Holdem game.
SYNOPSIS
use Games::Poker::TexasHoldem;
my $game = Games::Poker::TexasHoldem->new(
players => [
{ name => "lathos", bankroll => 500 },
{ name => "MarcBeth", bankroll => 500 },
{ name => "Hectate", bankroll => 500 },
{ name => "RichardIII", bankroll => 500 },
],
button => "Hectate",
bet => 10,
limit => 50
);
$game->blinds; # Puts in both small and large blinds
print $game->pot; # 15
$game->call; # Hecate puts in 10
$game->bet_raise(15) # RichardIII sees the 10, raises another 5
...
This represents a game of Texas Holdem poker. It maintains the state of the pot, whos in to what amount, whos folded, what the bankrolls look like, and so on. Its meant to be used in conjunction with Games::Poker::OPP, but can be used stand-alone as well for analysis.
<<lessSYNOPSIS
use Games::Poker::TexasHoldem;
my $game = Games::Poker::TexasHoldem->new(
players => [
{ name => "lathos", bankroll => 500 },
{ name => "MarcBeth", bankroll => 500 },
{ name => "Hectate", bankroll => 500 },
{ name => "RichardIII", bankroll => 500 },
],
button => "Hectate",
bet => 10,
limit => 50
);
$game->blinds; # Puts in both small and large blinds
print $game->pot; # 15
$game->call; # Hecate puts in 10
$game->bet_raise(15) # RichardIII sees the 10, raises another 5
...
This represents a game of Texas Holdem poker. It maintains the state of the pot, whos in to what amount, whos folded, what the bankrolls look like, and so on. Its meant to be used in conjunction with Games::Poker::OPP, but can be used stand-alone as well for analysis.
Download (0.006MB)
Added: 2007-01-02 License: Perl Artistic License Price:
1041 downloads
Text::NSP::Measures::3D::MI::tmi 1.03
Text::NSP::Measures::3D::MI::tmi is a Perl implementation for True Mutual Information for trigrams. more>>
Text::NSP::Measures::3D::MI::tmi is a Perl implementation for True Mutual Information for trigrams.
SYNOPSIS
Basic Usage
use Text::NSP::Measures::3D::MI::tmi;
$tmi_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 ".$tmi_value."n";
}
True Mutual Information (tmi) is defined as the weighted average of the pointwise mutual informations for all the observed and expected value pairs.
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)]
PMI = log (n111/m111)
Here n111 represents the observed value for the cell (1,1,1) and m111 represents the expected value for that cell. 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
Methods
calculateStatistic($count_values) - This method calculates the tmi value
INPUT PARAMS : $count_values .. Reference of an hash containing the count values computed by the count.pl program.
RETURN VALUES : $tmi .. TMI 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::tmi;
$tmi_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 ".$tmi_value."n";
}
True Mutual Information (tmi) is defined as the weighted average of the pointwise mutual informations for all the observed and expected value pairs.
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)]
PMI = log (n111/m111)
Here n111 represents the observed value for the cell (1,1,1) and m111 represents the expected value for that cell. 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
Methods
calculateStatistic($count_values) - This method calculates the tmi value
INPUT PARAMS : $count_values .. Reference of an hash containing the count values computed by the count.pl program.
RETURN VALUES : $tmi .. TMI 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-12 License: Perl Artistic License Price:
956 downloads
/etc/net Scripts 0.9.2
/etc/net represents a new approach to Linux network configuration tasks. more>>
/etc/net represents a new approach to Linux network configuration tasks. /etc/net Scripts is inspired by the limitations of traditional configuration subsystems.
/etc/net provides builtin support for configuration profiles, interface name management, removable device support, full iproute2 command set support, interface dependency resolution, and a QoS configuration framework.
/etc/net provides support for the following interface types: Ethernet, WiFi (WEP), IPv6/IPv6 tunnels, PSK IPSec tunnels, VLAN, PLIP, Ethernet bonding and bridging, traffic equalizer, Pent@NET, usbnet, and PPP.
Due to its modular design, support for new interface types can be added without overall design changes.
Enhancements:
- This release features mostly new features (ip6tables, ebtables, OpenVPN, and tun/tap) and some bugfixes (IP rules, wireless, firewall, and DVB).
<<less/etc/net provides builtin support for configuration profiles, interface name management, removable device support, full iproute2 command set support, interface dependency resolution, and a QoS configuration framework.
/etc/net provides support for the following interface types: Ethernet, WiFi (WEP), IPv6/IPv6 tunnels, PSK IPSec tunnels, VLAN, PLIP, Ethernet bonding and bridging, traffic equalizer, Pent@NET, usbnet, and PPP.
Due to its modular design, support for new interface types can be added without overall design changes.
Enhancements:
- This release features mostly new features (ip6tables, ebtables, OpenVPN, and tun/tap) and some bugfixes (IP rules, wireless, firewall, and DVB).
Download (0.063MB)
Added: 2007-04-27 License: GPL (GNU General Public License) Price:
915 downloads
Games::Lineofsight 1.0
Games::Lineofsight is a Perl module. more>>
Games::Lineofsight is a Perl module.
Many games (Ultima, Nethack) use two-dimensional maps that consists of the squares of the same size in a grid. Line-of-sight means that some of the squares may represent the items that block the vision of the player from seeing squares behind them. With this module you can add that behaviour to your games.
SYNOPSIS
use Games::Lineofsight qw(lineofsight);
# The map has to be a two-dimensional array. Each member (or "cell") of the array represents one
# square in the map. In this example each cell contains only one character but you can put strings
# to the cells also - practical with the graphical games.
my @map=(
[split //,"..:..::........."], # this is the map
[split //,".......:..X....:"], # . and : represents the ground
[split //,"...X.....:...:.."], # X is the barrier for the sight
[split //,".:...:....:....."],
[split //,"..X....:..X....."],
[split //,"..X..:........:."],
);
my($width)=scalar(@{@map[0]}); # the width of the map
my($height)=scalar(@map); # the height of the map
my($barrier_str)="X"; # string that represents the barrier
my($hidden_str)="*"; # string that represents a cell behind a barrier
my($man_str)="@"; # string that represents the viewer
my($man_x,$man_y)=(7,3); # view point coordinates - the player is here
# recreate the map with line-of-sight
@map=lineofsight(@map,$man_x,$man_y,$barrier_str,$hidden_str);
# draw the map
for(my $i=0;$i < $height;$i++){
for(my $j=0;$j < $width;$j++){
print $man_x == $j && $man_y == $i ? $man_str : $map[$i][$j];
}
print "n";
}
or
# The lineofsight() calls get_barriers() and analyze_map() each time its called. If the viewer
# moves around the map a lot, its much faster to read in the barriers once and call only
# analyze_map() each time before drawing it.
use Games::Lineofsight qw(get_barriers analyze_map);
# The map has to be a two-dimensional array. Each member (or "cell") of the array represents one
# square in the map. In this example each cell contains only one character but you can put strings
# to the cells also - practical with the graphical games.
my @map=(
[split //,"..:..::........."], # this is the map
[split //,".......:..X....:"], # . and : represents the ground
[split //,"...X.....:...:.."], # X is the barrier for the sight
[split //,".:...:....:....."],
[split //,"..X....:..X....."],
[split //,"..X..:........:."],
);
my($width)=scalar(@{@map[0]}); # the width of the map
my($height)=scalar(@map); # the height of the map
my($barrier_str)="X"; # string that represents the barrier
my($hidden_str)="*"; # string that represents a cell behind a barrier
my($man_str)="@"; # string that represents the viewer
my($man_x,$man_y)=(7,3); # view point coordinates - the player is here
# get_barriers() returns a hash with the information about barriers in the map. In this example we
# declare the "X"-character as a barrier. As well you can declare it to be a string in the graphical
# games; for example "barrier.jpg".
my %barrier=get_barriers($width,$height,@map,$barrier_str);
# analyze_map() returns an array containing the original map looked from the view point. The cells
# behind the barriers are replaced with given strings. The barriers should be told to the subroutine
# calling first get_barriers()-subroutine as we already did.
my @map2=analyze_map($width,$height,@map,%barrier,$man_x,$man_y,$hidden_str);
#draw the map with the lineofsight
print "nOriginal map:n";
draw($width,$height,$man_x,$man_y,@map2,$man_str);
# move the viewer two squares right
$man_x+=2;
# refresh the map
my @map2=analyze_map($width,$height,@map,%barrier,$man_x,$man_y,$hidden_str);
#draw the map again
print "nViewer has moved:n";
draw($width,$height,$man_x,$man_y,@map2,$man_str);
sub draw{
my($width,$height,$man_x,$man_y,$map,$man_str)=@_;
for(my $i=0;$i < $height;$i++){
for(my $j=0;$j < $width;$j++){
print $man_x == $j && $man_y == $i ? $man_str : $$map[$i][$j];
}
print "n";
}
}
<<lessMany games (Ultima, Nethack) use two-dimensional maps that consists of the squares of the same size in a grid. Line-of-sight means that some of the squares may represent the items that block the vision of the player from seeing squares behind them. With this module you can add that behaviour to your games.
SYNOPSIS
use Games::Lineofsight qw(lineofsight);
# The map has to be a two-dimensional array. Each member (or "cell") of the array represents one
# square in the map. In this example each cell contains only one character but you can put strings
# to the cells also - practical with the graphical games.
my @map=(
[split //,"..:..::........."], # this is the map
[split //,".......:..X....:"], # . and : represents the ground
[split //,"...X.....:...:.."], # X is the barrier for the sight
[split //,".:...:....:....."],
[split //,"..X....:..X....."],
[split //,"..X..:........:."],
);
my($width)=scalar(@{@map[0]}); # the width of the map
my($height)=scalar(@map); # the height of the map
my($barrier_str)="X"; # string that represents the barrier
my($hidden_str)="*"; # string that represents a cell behind a barrier
my($man_str)="@"; # string that represents the viewer
my($man_x,$man_y)=(7,3); # view point coordinates - the player is here
# recreate the map with line-of-sight
@map=lineofsight(@map,$man_x,$man_y,$barrier_str,$hidden_str);
# draw the map
for(my $i=0;$i < $height;$i++){
for(my $j=0;$j < $width;$j++){
print $man_x == $j && $man_y == $i ? $man_str : $map[$i][$j];
}
print "n";
}
or
# The lineofsight() calls get_barriers() and analyze_map() each time its called. If the viewer
# moves around the map a lot, its much faster to read in the barriers once and call only
# analyze_map() each time before drawing it.
use Games::Lineofsight qw(get_barriers analyze_map);
# The map has to be a two-dimensional array. Each member (or "cell") of the array represents one
# square in the map. In this example each cell contains only one character but you can put strings
# to the cells also - practical with the graphical games.
my @map=(
[split //,"..:..::........."], # this is the map
[split //,".......:..X....:"], # . and : represents the ground
[split //,"...X.....:...:.."], # X is the barrier for the sight
[split //,".:...:....:....."],
[split //,"..X....:..X....."],
[split //,"..X..:........:."],
);
my($width)=scalar(@{@map[0]}); # the width of the map
my($height)=scalar(@map); # the height of the map
my($barrier_str)="X"; # string that represents the barrier
my($hidden_str)="*"; # string that represents a cell behind a barrier
my($man_str)="@"; # string that represents the viewer
my($man_x,$man_y)=(7,3); # view point coordinates - the player is here
# get_barriers() returns a hash with the information about barriers in the map. In this example we
# declare the "X"-character as a barrier. As well you can declare it to be a string in the graphical
# games; for example "barrier.jpg".
my %barrier=get_barriers($width,$height,@map,$barrier_str);
# analyze_map() returns an array containing the original map looked from the view point. The cells
# behind the barriers are replaced with given strings. The barriers should be told to the subroutine
# calling first get_barriers()-subroutine as we already did.
my @map2=analyze_map($width,$height,@map,%barrier,$man_x,$man_y,$hidden_str);
#draw the map with the lineofsight
print "nOriginal map:n";
draw($width,$height,$man_x,$man_y,@map2,$man_str);
# move the viewer two squares right
$man_x+=2;
# refresh the map
my @map2=analyze_map($width,$height,@map,%barrier,$man_x,$man_y,$hidden_str);
#draw the map again
print "nViewer has moved:n";
draw($width,$height,$man_x,$man_y,@map2,$man_str);
sub draw{
my($width,$height,$man_x,$man_y,$map,$man_str)=@_;
for(my $i=0;$i < $height;$i++){
for(my $j=0;$j < $width;$j++){
print $man_x == $j && $man_y == $i ? $man_str : $$map[$i][$j];
}
print "n";
}
}
Download (0.004MB)
Added: 2007-01-03 License: Perl Artistic License Price:
1029 downloads
Qalculate! Bases 0.9.4
Qalculate! is a multi-purpose desktop calculator for GNU/Linux. more>>
Qalculate! is a multi-purpose desktop calculator for GNU/Linux. Qalculate! project is small and simple to use but with much power and versatility underneath.
Main features:
- Redesigned GUI with history view in the main window
- Display of as-you-type expression parsing and function hints
- Enhanced completion
- Scaling of result display to vertically fit the window
- Nicer history listing
- Enhanced result display with much nicer parentheses
- Meta modes
- 67 new units: bel (B) and neper (Np), information units such as bit and byte, many convenience units (km/h, deciliter, etc), and more.
- Binary prefixes
- Some new variables and functions
- Fixed help display in new yelp
- Fixed compile with cln-1.1.10
- Fixed regressions in simplification
- Fixed f(x) return type analysis (ex. log(x) represents a real number if x represents a positive). This was by accident unused.
- ...and many more bug fixes and enhancements...
<<lessMain features:
- Redesigned GUI with history view in the main window
- Display of as-you-type expression parsing and function hints
- Enhanced completion
- Scaling of result display to vertically fit the window
- Nicer history listing
- Enhanced result display with much nicer parentheses
- Meta modes
- 67 new units: bel (B) and neper (Np), information units such as bit and byte, many convenience units (km/h, deciliter, etc), and more.
- Binary prefixes
- Some new variables and functions
- Fixed help display in new yelp
- Fixed compile with cln-1.1.10
- Fixed regressions in simplification
- Fixed f(x) return type analysis (ex. log(x) represents a real number if x represents a positive). This was by accident unused.
- ...and many more bug fixes and enhancements...
Download (0.35MB)
Added: 2006-06-02 License: GPL (GNU General Public License) Price:
1239 downloads
Acme::MorningMusume::Base 0.07
Acme::MorningMusume::Base is a baseclass of the class represents each member of Morning Musume. more>>
Acme::MorningMusume::Base is a baseclass of the class represents each member of Morning Musume.
SYNOPSIS
use Acme::MorningMusume;
my $musume = Acme::MorningMusume->new;
# retrieve the members as a list of
# Acme::MorningMusume::Base based objects
my @members = $musume->members;
for my $member (@members) {
my $name_ja = $member->name_ja;
my $first_name_ja = $member->first_name_ja;
my $family_name_ja = $member->family_name_ja;
my $name_en = $member->name_en;
my $first_name_en = $member->first_name_en;
my $family_name_en = $member->family_name_en;
my $nick = $member->nick; # arrayref
my $birthday = $member->birthday; # Date::Simple object
my $age = $member->age;
my $blood_type = $member->blood_type;
my $hometown = $member->hometown;
my $emoticon = $member->emoticon; # arrayref
my $class = $member->class;
my $graduate_date = $member->graduate_date; # Date::Simple object
my $count;
my $images = $member->images(limit => 5);
while (my $image = $images->next) {
$count++;
my $content_url = $image->content_url;
my $context_url = $image->context_url;
$image->save_content(base => image . $count);
$image->save_context(base => page . $count);
}
}
Acme::MorningMusume::Base is a baseclass of the class represents each member of Morning Musume.
<<lessSYNOPSIS
use Acme::MorningMusume;
my $musume = Acme::MorningMusume->new;
# retrieve the members as a list of
# Acme::MorningMusume::Base based objects
my @members = $musume->members;
for my $member (@members) {
my $name_ja = $member->name_ja;
my $first_name_ja = $member->first_name_ja;
my $family_name_ja = $member->family_name_ja;
my $name_en = $member->name_en;
my $first_name_en = $member->first_name_en;
my $family_name_en = $member->family_name_en;
my $nick = $member->nick; # arrayref
my $birthday = $member->birthday; # Date::Simple object
my $age = $member->age;
my $blood_type = $member->blood_type;
my $hometown = $member->hometown;
my $emoticon = $member->emoticon; # arrayref
my $class = $member->class;
my $graduate_date = $member->graduate_date; # Date::Simple object
my $count;
my $images = $member->images(limit => 5);
while (my $image = $images->next) {
$count++;
my $content_url = $image->content_url;
my $context_url = $image->context_url;
$image->save_content(base => image . $count);
$image->save_context(base => page . $count);
}
}
Acme::MorningMusume::Base is a baseclass of the class represents each member of Morning Musume.
Download (0.008MB)
Added: 2006-12-06 License: Perl Artistic License Price:
1052 downloads
Qalculate! Units 0.9.4
Qalculate! is a multi-purpose desktop calculator for GNU/Linux. more>>
Qalculate! is a multi-purpose desktop calculator for GNU/Linux. Qalculate! project is small and simple to use but with much power and versatility underneath.
Features include customizable functions, units, arbitrary precision, plotting, and a user-friendly interface (KDE or GTK+).
Main features:
- Redesigned GUI with history view in the main window
- Display of as-you-type expression parsing and function hints
- Enhanced completion
- Scaling of result display to vertically fit the window
- Nicer history listing
- Enhanced result display with much nicer parentheses
- Meta modes
- 67 new units: bel (B) and neper (Np), information units such as bit and byte, many convenience units (km/h, deciliter, etc), and more.
- Binary prefixes
- Some new variables and functions
- Fixed help display in new yelp
- Fixed compile with cln-1.1.10
- Fixed regressions in simplification
- Fixed f(x) return type analysis (ex. log(x) represents a real number if x represents a positive). This was by accident unused.
- ...and many more bug fixes and enhancements...
<<lessFeatures include customizable functions, units, arbitrary precision, plotting, and a user-friendly interface (KDE or GTK+).
Main features:
- Redesigned GUI with history view in the main window
- Display of as-you-type expression parsing and function hints
- Enhanced completion
- Scaling of result display to vertically fit the window
- Nicer history listing
- Enhanced result display with much nicer parentheses
- Meta modes
- 67 new units: bel (B) and neper (Np), information units such as bit and byte, many convenience units (km/h, deciliter, etc), and more.
- Binary prefixes
- Some new variables and functions
- Fixed help display in new yelp
- Fixed compile with cln-1.1.10
- Fixed regressions in simplification
- Fixed f(x) return type analysis (ex. log(x) represents a real number if x represents a positive). This was by accident unused.
- ...and many more bug fixes and enhancements...
Download (0.36MB)
Added: 2006-06-02 License: GPL (GNU General Public License) Price:
1240 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 represents 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