can predict
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 42
Gpredict 0.8.0
Gpredict is a real-time satellite tracking and orbit prediction program. more>>
Gpredict project is a satellite tracking program for Unix-like operating systems. In the begining (v. 0.1.x) Gpredict was just a GUI client to John Magliacanes excellent satellite tracking program, Predict, but due to performance problems it has been decided to include the tracking code directly into Gnome Predict (v. 0.2.0 and later).
Gpredict is licensed under the GNU General Public License which basically gives you the right to freely use, distribute and modify the software and its source code, but without any warranty from the authors.
<<lessGpredict is licensed under the GNU General Public License which basically gives you the right to freely use, distribute and modify the software and its source code, but without any warranty from the authors.
Download (1.8MB)
Added: 2007-06-03 License: GPL (GNU General Public License) Price:
877 downloads
Gnome Predict 0.5.99.5
Gnome Predict is a real time satellite tracking program for GNOME. more>>
Gnome Predict or Gpredict is a satellite tracking program for Unix-like operating systems. In the begining (v. 0.1.x) Gpredict was just a GUI client to John Magliacanes excellent satellite tracking program, Predict, but due to performance problems it has been decided to include the tracking code directly into Gnome Predict (v. 0.2.0 and later).
Gpredict is licensed under the GNU General Public License which basically gives you the right to freely use, distribute and modify the software and its source code, but without any warranty from the authors.
Gpredict is in development stage, but it is has already some very useful features. The current version can track a large number of satellites, display the satellite data in lists and/or show the satellites on maps.
It is possible to have several lists and maps open at the same time in a separate windows or organized in a notebook (you can also have some of them in a notebook and some of them in their own window). The lists can be sorted and the maps can be saved and printed.
You can alse make brief or detailed predictions of upcoming passes and each pass can be plotted in a radial plot. The predictions and plots can be saved and printed as well.
Enhancements:
- The flexible module layout has been implemented, which also includes several new views.
- The pass prediction dialogs have been improved with more parameters.
<<lessGpredict is licensed under the GNU General Public License which basically gives you the right to freely use, distribute and modify the software and its source code, but without any warranty from the authors.
Gpredict is in development stage, but it is has already some very useful features. The current version can track a large number of satellites, display the satellite data in lists and/or show the satellites on maps.
It is possible to have several lists and maps open at the same time in a separate windows or organized in a notebook (you can also have some of them in a notebook and some of them in their own window). The lists can be sorted and the maps can be saved and printed.
You can alse make brief or detailed predictions of upcoming passes and each pass can be plotted in a radial plot. The predictions and plots can be saved and printed as well.
Enhancements:
- The flexible module layout has been implemented, which also includes several new views.
- The pass prediction dialogs have been improved with more parameters.
Download (0.97MB)
Added: 2006-07-26 License: GPL (GNU General Public License) Price:
1189 downloads
HDR Visual Difference Predictor 1.6
HDR Visual Difference Predictor (HDR VDP) is a perceptual metric that can predict whether differences between two images. more>>
Visual difference metrics can predict whether differences between two images are visible to the human observer or not. Such metrics are used for testing either visibility of information (whether we can see important visual information) or visibility of noise (to make sure we do not see any distortions in images, e.g. due to lossy compression).
The image below shows how two input images, a reference image (upper left) and a distorted image (lower left), are processed with the VDP to produce a probability of detection map (right). Such probability of detection map tells how likely we will notice a difference between two images for each part of an image.
Red color denotes high probability, green - low probability. Red color is mostly present in the areas where there is a snow covered path. Because of smooth texture of the snow, there is not much visual masking and distortions are easily visible.
Although there are dozens of visible difference metrics that serve a similar purpose, our Visual Difference Predictor for HDR images (HDR-VDP) has two unique advantages: firstly, our metric works with a full range of luminance values that can be meet in a real word (HDR images), and secondly, we offer a complete source code for free.
High Dynamic Range Visible Difference Predictor (HDR-VDP) can work within the complete range of luminance the human eye can see. An input to our metric is a high dynamic range (HDR) image, or an ordinary 8-bits-per-color image, converted to the actual luminance values. The proposed metric takes into account the aspects of high contrast vision, like scattering of the light in the optics (OTF), nonlinear response to light for the full range of luminance, and local adaptation.
<<lessThe image below shows how two input images, a reference image (upper left) and a distorted image (lower left), are processed with the VDP to produce a probability of detection map (right). Such probability of detection map tells how likely we will notice a difference between two images for each part of an image.
Red color denotes high probability, green - low probability. Red color is mostly present in the areas where there is a snow covered path. Because of smooth texture of the snow, there is not much visual masking and distortions are easily visible.
Although there are dozens of visible difference metrics that serve a similar purpose, our Visual Difference Predictor for HDR images (HDR-VDP) has two unique advantages: firstly, our metric works with a full range of luminance values that can be meet in a real word (HDR images), and secondly, we offer a complete source code for free.
High Dynamic Range Visible Difference Predictor (HDR-VDP) can work within the complete range of luminance the human eye can see. An input to our metric is a high dynamic range (HDR) image, or an ordinary 8-bits-per-color image, converted to the actual luminance values. The proposed metric takes into account the aspects of high contrast vision, like scattering of the light in the optics (OTF), nonlinear response to light for the full range of luminance, and local adaptation.
Download (0.13MB)
Added: 2007-01-05 License: GPL (GNU General Public License) Price:
1028 downloads
project-p 2.0
project-p project is a simulation in which particles interact with each other based on a simple rule. more>>
project-p project is a simulation in which particles interact with each other based on a simple rule.
In p, a bunch of particles interact with each other according to this simple rule: every particle must move towards, away or watch another particle. When the program starts, each particle chooses a random color, position and the particle it will move towards, away or watch.
As the program runs, some particles join together to form a train and continue their journey together thereafter. There are many such trains too, but how do they form? Imagine 2 particles A and B. If A moves away from B as B moves towards A we get a self propelling train. The rules dont predict when and where these trains will form but they emerge everytime the program runs.
A particle in p moves towards or away from another particle by a definite amount D along the straight line joining the particles. Consequently, a particle cant move towards or away from itself. A particle that watches another particle doesnt move too. It either waits for the watched particle to come close to it or move far away before it decides to move towards, away or watch another particle. But if the watched particle recedes while it hopes it would come closer, it would watch forever.
Now, what happens if there is only 1 particle in the system? Well, it cant move towards or away from itself thats for sure. It could watch itself but what can it do when it stopped watching? Move towards, away or watch itself some more! Therefore, if there is only 1 particle in the system, we can conclude that it will stay put in its initial position.
Now consider a 2 (or more) particle system. Let the particles be A and B. Let A stand still (as if it were a 1-particle system) and let B move towards A. If B is seperated by a multiple M of D ie separated distance = M x D, it will collapse into A in M steps. If B is instead separated by a multiple M of D and by some more distance N ie the separated distance = M x D + N, B will orbit A in M steps.
Apogee and perigee will be N units or N - D units. The same thing happens if A is also moving towards B as B is moving towards A but sooner - in approximately M / 2 steps. Once again, the rules dont predict these phenomena but they always emerge when the program runs.
<<lessIn p, a bunch of particles interact with each other according to this simple rule: every particle must move towards, away or watch another particle. When the program starts, each particle chooses a random color, position and the particle it will move towards, away or watch.
As the program runs, some particles join together to form a train and continue their journey together thereafter. There are many such trains too, but how do they form? Imagine 2 particles A and B. If A moves away from B as B moves towards A we get a self propelling train. The rules dont predict when and where these trains will form but they emerge everytime the program runs.
A particle in p moves towards or away from another particle by a definite amount D along the straight line joining the particles. Consequently, a particle cant move towards or away from itself. A particle that watches another particle doesnt move too. It either waits for the watched particle to come close to it or move far away before it decides to move towards, away or watch another particle. But if the watched particle recedes while it hopes it would come closer, it would watch forever.
Now, what happens if there is only 1 particle in the system? Well, it cant move towards or away from itself thats for sure. It could watch itself but what can it do when it stopped watching? Move towards, away or watch itself some more! Therefore, if there is only 1 particle in the system, we can conclude that it will stay put in its initial position.
Now consider a 2 (or more) particle system. Let the particles be A and B. Let A stand still (as if it were a 1-particle system) and let B move towards A. If B is seperated by a multiple M of D ie separated distance = M x D, it will collapse into A in M steps. If B is instead separated by a multiple M of D and by some more distance N ie the separated distance = M x D + N, B will orbit A in M steps.
Apogee and perigee will be N units or N - D units. The same thing happens if A is also moving towards B as B is moving towards A but sooner - in approximately M / 2 steps. Once again, the rules dont predict these phenomena but they always emerge when the program runs.
Download (0.20MB)
Added: 2007-01-11 License: GPL (GNU General Public License) Price:
1018 downloads
Apache Portals
Apache Portals provides robust Portal related software on a wide variety of platforms. more>>
Apache Portals is a collaborative software development project dedicated to providing robust, full-featured, commercial-quality, and freely available Portal related software on a wide variety of platforms and programming languages.
This project is managed in cooperation with various individuals worldwide (both independent and company-affiliated experts), who use the Internet to communicate, plan, and develop Portal software and related documentation.
Modern software is complex and expensive, which has motivated many companies to invest in enterprise portals as a mechanism by which they can manage information in a cohesive and structured fashion.
Portals offer many advantages over other software applications. First, they provide a single point of entry for employees, partners, and customers. Second, portals can access Web services transparently from any device in virtually any location. Third, portals are highly flexible; they can exist in the form of B2E intra-nets, B2B extra-nets, or B2C inter-nets. Fourth, portals can be combined to form a portal network that can span a companys entire enterprise system, allowing for access both inside and outside the firewall.
Portals have many advantages, which is why they have become the de facto standard for Web application delivery. In fact, analysts have predicted that portals will become the next generation for the desktop environment.
Portals distinguish themselves from other software systems because they provide the ability to integrate disparate systems and leverage the functionality provided by those systems. As such, they are not mutually exclusive, and do not force you into an either-or decision vis-a-vis existing software systems. This point is of paramount importance, particularly when you consider the fact that Web services are destined to fuel the explosion of Web applications. Since portals can access any Web services, the conclusion is inescapable: portals provide a unique opportunity to leverage the functionality of nascent technologies as well as mature, well-established software systems.
<<lessThis project is managed in cooperation with various individuals worldwide (both independent and company-affiliated experts), who use the Internet to communicate, plan, and develop Portal software and related documentation.
Modern software is complex and expensive, which has motivated many companies to invest in enterprise portals as a mechanism by which they can manage information in a cohesive and structured fashion.
Portals offer many advantages over other software applications. First, they provide a single point of entry for employees, partners, and customers. Second, portals can access Web services transparently from any device in virtually any location. Third, portals are highly flexible; they can exist in the form of B2E intra-nets, B2B extra-nets, or B2C inter-nets. Fourth, portals can be combined to form a portal network that can span a companys entire enterprise system, allowing for access both inside and outside the firewall.
Portals have many advantages, which is why they have become the de facto standard for Web application delivery. In fact, analysts have predicted that portals will become the next generation for the desktop environment.
Portals distinguish themselves from other software systems because they provide the ability to integrate disparate systems and leverage the functionality provided by those systems. As such, they are not mutually exclusive, and do not force you into an either-or decision vis-a-vis existing software systems. This point is of paramount importance, particularly when you consider the fact that Web services are destined to fuel the explosion of Web applications. Since portals can access any Web services, the conclusion is inescapable: portals provide a unique opportunity to leverage the functionality of nascent technologies as well as mature, well-established software systems.
Download (MB)
Added: 2007-01-11 License: The Apache License 2.0 Price:
1018 downloads
Class::Contract 1.00
Class::Contract - Design-by-Contract OO in Perl. more>>
Class::Contract - Design-by-Contract OO in Perl.
SYNOPSIS
package ClassName
use Class::Contract;
contract {
inherits BaseClass;
invar { ... };
attr data1;
attr data2 => HASH;
class attr shared => SCALAR;
ctor new;
method methodname;
pre { ... };
failmsg Error message;
post { ... };
failmsg Error message;
impl { ... };
method nextmethod;
impl { ... };
class method sharedmeth;
impl { ... };
# etc.
};
Background
Design-by-contract is a software engineering technique in which each module of a software system specifies explicitly what input (or data or arguments) it requires, and what output (or information or results) it guarantees to produce in response.
These specifications form the "clauses" of a contract between a module and the client software that uses it. If the client software abides by the input requirements, the module guarantees to produce the correct output. Hence by verifying these clauses at each interaction with a module, the overall behaviour of the system can be confidently predicted.
Design-by-contract reinforces the benefits of modular design techniques by inserting explicit compile-time or run-time checks on a contract. These checks are most often found in object-oriented languages and are typically implemented as pre-conditions and post-conditions on methods, and invariants on classes.
Note that these features differ from simple verification statements such as the C assert statement. Conditions and invariants are properties of a class, and are inherited by derived classes.
An additional capacity that is often provided in design-by-contract systems is the ability to selectively disable checking in production code. This allows the contractual testing to be carried out during implementation, without impinging on the performance of the final system.
Adding design-by-contract to Perl
The Class::Contract module provides a framework for specifying methods and attributes for a class (much like the existing class definition modules Class::Struct, Class::MethodMaker, and Class::Generate). Class::Contract allows both per-object and per-class methods and attributes to be defined. Attributes may be scalar-, array-, hash-, or object-based.
Class::Contract differs from other class-specification modules (except Class::Generate) in that it also provides the ability to specify invariant conditions on classes, and pre- and post-conditions on methods and attributes. All of these clauses are fully inheritable, and may be selectively disabled. It differs from all other modules in that it has a cleaner, simpler specification syntax, and -- more importantly -- it enforces encapsulation of object attributes, thereby ensuring that the class contract cannot be subverted.
Defining classes
Class::Contract provides an explicit syntax for defining the attributes, methods, and constructors of a class. The class itself is defined using the contract subroutine. contract takes a single argument -- a subroutine reference or a block. That block is executed once and the results used to construct and install the various components of the class in the current package:
package Queue;
contract {
# specification of class Queue attributes and methods here
};
<<lessSYNOPSIS
package ClassName
use Class::Contract;
contract {
inherits BaseClass;
invar { ... };
attr data1;
attr data2 => HASH;
class attr shared => SCALAR;
ctor new;
method methodname;
pre { ... };
failmsg Error message;
post { ... };
failmsg Error message;
impl { ... };
method nextmethod;
impl { ... };
class method sharedmeth;
impl { ... };
# etc.
};
Background
Design-by-contract is a software engineering technique in which each module of a software system specifies explicitly what input (or data or arguments) it requires, and what output (or information or results) it guarantees to produce in response.
These specifications form the "clauses" of a contract between a module and the client software that uses it. If the client software abides by the input requirements, the module guarantees to produce the correct output. Hence by verifying these clauses at each interaction with a module, the overall behaviour of the system can be confidently predicted.
Design-by-contract reinforces the benefits of modular design techniques by inserting explicit compile-time or run-time checks on a contract. These checks are most often found in object-oriented languages and are typically implemented as pre-conditions and post-conditions on methods, and invariants on classes.
Note that these features differ from simple verification statements such as the C assert statement. Conditions and invariants are properties of a class, and are inherited by derived classes.
An additional capacity that is often provided in design-by-contract systems is the ability to selectively disable checking in production code. This allows the contractual testing to be carried out during implementation, without impinging on the performance of the final system.
Adding design-by-contract to Perl
The Class::Contract module provides a framework for specifying methods and attributes for a class (much like the existing class definition modules Class::Struct, Class::MethodMaker, and Class::Generate). Class::Contract allows both per-object and per-class methods and attributes to be defined. Attributes may be scalar-, array-, hash-, or object-based.
Class::Contract differs from other class-specification modules (except Class::Generate) in that it also provides the ability to specify invariant conditions on classes, and pre- and post-conditions on methods and attributes. All of these clauses are fully inheritable, and may be selectively disabled. It differs from all other modules in that it has a cleaner, simpler specification syntax, and -- more importantly -- it enforces encapsulation of object attributes, thereby ensuring that the class contract cannot be subverted.
Defining classes
Class::Contract provides an explicit syntax for defining the attributes, methods, and constructors of a class. The class itself is defined using the contract subroutine. contract takes a single argument -- a subroutine reference or a block. That block is executed once and the results used to construct and install the various components of the class in the current package:
package Queue;
contract {
# specification of class Queue attributes and methods here
};
Download (0.026MB)
Added: 2007-02-21 License: Perl Artistic License Price:
976 downloads
CAN Abstraction Layer 0.1.6
The CAN Abstraction Layer (CANAL) provides a single interface for programs to use different CAN drivers. more>>
The CAN Abstraction Layer (CANAL) provides a single interface for programs to use different CAN drivers.
It consists of a CANAL daemon that handles client and driver communication, a canalLogger that logs messages in a window, and a simple diagnostic application. C++ clases and DLL/DL interfaces are provided.
Enhancements:
- The configuration readings for CanalWorks were upgraded.
- A GUID ordering problem in canald was fixed.
- A problem with clear message list switch in CanalWorks was fixed.
- A problem in which Linux version Level I received a thread with an invalid count returned for DataAvailable was fixed.
<<lessIt consists of a CANAL daemon that handles client and driver communication, a canalLogger that logs messages in a window, and a simple diagnostic application. C++ clases and DLL/DL interfaces are provided.
Enhancements:
- The configuration readings for CanalWorks were upgraded.
- A GUID ordering problem in canald was fixed.
- A problem with clear message list switch in CanalWorks was fixed.
- A problem in which Linux version Level I received a thread with an invalid count returned for DataAvailable was fixed.
Download (2.3MB)
Added: 2005-10-11 License: LGPL (GNU Lesser General Public License) Price:
1474 downloads
auCDtect 0.8
AuCDtect - is a free console program for determining the authenticity of musical CDs. more>>
AuCDtect - is a free console program for determining the authenticity of musical CDs. By evaluating the character of audio data a CD contains, Tau Analyzer can distinguish between original studio-based recordings and those that have been "reconstructed" using a lossy audio source, such as MP3. Its a console application and is freeware.
This program could determine authenticity of a musical CD records, stored in WAV format, using the character of the audio data it contains, and predicts its possible source - is it an
original record or a reconstruction from a lossy encoded music file (for example, MP3).
Enhancements:
- Program should work little bit faster;
- Supports disk conclusion mode over the set of tracks (-d key);
- Decreased error level while processing strongly hardware-compressed; studio records - now makes less errors;
- Small algorithm improvements.
<<lessThis program could determine authenticity of a musical CD records, stored in WAV format, using the character of the audio data it contains, and predicts its possible source - is it an
original record or a reconstruction from a lossy encoded music file (for example, MP3).
Enhancements:
- Program should work little bit faster;
- Supports disk conclusion mode over the set of tracks (-d key);
- Decreased error level while processing strongly hardware-compressed; studio records - now makes less errors;
- Small algorithm improvements.
Download (0.029MB)
Added: 2006-07-28 License: GPL (GNU General Public License) Price:
1183 downloads
Score Reading Trainer 0.1.3
Score Reading Trainer helps you improve your (musical) score reading skills by practicing with random scores. more>>
Score Reading Trainer helps you improve your (musical) score reading skills by practicing with random scores.
It works in a very simple way, you choose the clef, the key and the accidentals you want to practice as well as thee range of notes and then, the program generates a on-screen score with that parameters but randomizing the notes and the accidentals (and everything else that is randomizable).
The keys of the keyboard are mapped to the notes like in a piano (it would be nice to support midi in the future) and all you have to do, is press the right key for the first note you see in the score on the screen.
If you pressed the right key, the note will disapear and replaced by the second one, a diferent note, and you have to repeat the process.
As the notes are generated randomly, theres no way one can predict the following note and since several notes (as much as the screen allows) are on the screen, one can also train pre-reading (reading ahead of the current one) of the notes.
The program doesnt emit any sound (at least, yet) and its not inteded to teach rithmic or melodic concepts.
Enhancements:
2004-03-08 Jos? Pablo Ezequiel "Pupeno" Fern?ndez
- Try harder not to leave any extra line floating arround.
2004-03-08 Jos? Pablo Ezequiel "Pupeno" Fern?ndez
- Respect the position (over the third line) where notes are inverted.
2004-03-08 Jos? Pablo Ezequiel "Pupeno" Fern?ndez
- Limits wasnt really respected in other clefs than G2.
2004-03-08 Jos? Pablo Ezequiel "Pupeno" Fern?ndez
- Solved important bug. Extre lines was not being shown correctly (http://sourceforge.net/tracker/index.php?func=detail&aid=909427&group_id=97653&atid=618659).
<<lessIt works in a very simple way, you choose the clef, the key and the accidentals you want to practice as well as thee range of notes and then, the program generates a on-screen score with that parameters but randomizing the notes and the accidentals (and everything else that is randomizable).
The keys of the keyboard are mapped to the notes like in a piano (it would be nice to support midi in the future) and all you have to do, is press the right key for the first note you see in the score on the screen.
If you pressed the right key, the note will disapear and replaced by the second one, a diferent note, and you have to repeat the process.
As the notes are generated randomly, theres no way one can predict the following note and since several notes (as much as the screen allows) are on the screen, one can also train pre-reading (reading ahead of the current one) of the notes.
The program doesnt emit any sound (at least, yet) and its not inteded to teach rithmic or melodic concepts.
Enhancements:
2004-03-08 Jos? Pablo Ezequiel "Pupeno" Fern?ndez
- Try harder not to leave any extra line floating arround.
2004-03-08 Jos? Pablo Ezequiel "Pupeno" Fern?ndez
- Respect the position (over the third line) where notes are inverted.
2004-03-08 Jos? Pablo Ezequiel "Pupeno" Fern?ndez
- Limits wasnt really respected in other clefs than G2.
2004-03-08 Jos? Pablo Ezequiel "Pupeno" Fern?ndez
- Solved important bug. Extre lines was not being shown correctly (http://sourceforge.net/tracker/index.php?func=detail&aid=909427&group_id=97653&atid=618659).
Download (0.13MB)
Added: 2005-06-01 License: GPL (GNU General Public License) Price:
1611 downloads
WWW::RaptureReady 0.1
WWW::RaptureReady is a Perl interface to Rapture Readys Rapture Index. more>>
WWW::RaptureReady is a Perl interface to Rapture Readys Rapture Index.
SYNOPSIS
use WWW::RaptureReady;
my $rr = WWW::RaptureReady->new;
print "URL: ", $rr->url, "n",
"Current Index: ", $rr->index, "n",
"Index Change: ", $rr->change, "n",
"Last Updated: ", $rr->updated, "n";
This module provides an interface to the Rapture Ready Rapture Index. Rapture Readys description of the index: The Rapture Index has two functions: one is to factor together a number of related end time components into a cohesive indicator, and the other is to standardize those components to eliminate the wide variance that currently exists with prophecy reporting.
The Rapture Index is by no means meant to predict the rapture, however, the index is designed to measure the type of activity that could act as a precursor to the rapture.
You could say the Rapture index is a Dow Jones Industrial Average of end time activity, but I think it would be better if you viewed it as prophetic speedometer. The higher the number, the faster were moving towards the occurrence of pre-tribulation rapture.
The rapture index is the "prophetic speedometer of end-time activity".
INTERFACE
new()
Creates and returns a new WWW::RaptureReady object.
my $rr = WWW::RaptureReady->new
url()
Returns the configured URL for retrieving the Rapture Index.
my $url = $rr->url
url($url)
Sets the URL to be used for retrieving the Rapture Index.
$rr->url("http://example.com/rapture.html")
fetch()
Fetches the Rapture Index HTML from the configured URL.
$rr->fetch
index()
Returns the current index level. Calls fetch() if index not already retrieved.
my $index = $rr->index
change()
Returns the change in the index. Calls fetch() if index not already retrieved.
my $change = $rr->change
updated()
Returns when the index was last updated. Calls fetch() if index not already retrieved.
my $updated = $rr->updated
<<lessSYNOPSIS
use WWW::RaptureReady;
my $rr = WWW::RaptureReady->new;
print "URL: ", $rr->url, "n",
"Current Index: ", $rr->index, "n",
"Index Change: ", $rr->change, "n",
"Last Updated: ", $rr->updated, "n";
This module provides an interface to the Rapture Ready Rapture Index. Rapture Readys description of the index: The Rapture Index has two functions: one is to factor together a number of related end time components into a cohesive indicator, and the other is to standardize those components to eliminate the wide variance that currently exists with prophecy reporting.
The Rapture Index is by no means meant to predict the rapture, however, the index is designed to measure the type of activity that could act as a precursor to the rapture.
You could say the Rapture index is a Dow Jones Industrial Average of end time activity, but I think it would be better if you viewed it as prophetic speedometer. The higher the number, the faster were moving towards the occurrence of pre-tribulation rapture.
The rapture index is the "prophetic speedometer of end-time activity".
INTERFACE
new()
Creates and returns a new WWW::RaptureReady object.
my $rr = WWW::RaptureReady->new
url()
Returns the configured URL for retrieving the Rapture Index.
my $url = $rr->url
url($url)
Sets the URL to be used for retrieving the Rapture Index.
$rr->url("http://example.com/rapture.html")
fetch()
Fetches the Rapture Index HTML from the configured URL.
$rr->fetch
index()
Returns the current index level. Calls fetch() if index not already retrieved.
my $index = $rr->index
change()
Returns the change in the index. Calls fetch() if index not already retrieved.
my $change = $rr->change
updated()
Returns when the index was last updated. Calls fetch() if index not already retrieved.
my $updated = $rr->updated
Download (0.008MB)
Added: 2007-01-26 License: Perl Artistic License Price:
1002 downloads
Printbill 4.2.0
Printbill is a sophistocated Unix print billing and/or accounting system with associated administration utilities. more>>
Printbill is a sophistocated Unix print billing and/or accounting system with associated administration utilities. It primarily supports LPRng but now has limited CUPS support as well.
A simple print filter and accompanying daemon perform pre-printing billing, post-printing billing, print-accounting and print job quote generation. In addition, various utilities for administrators and users are provided - including programs to check your print quota and usage patterns, a web interface for both users and administrators and a command-line quote generator.
Charge rates may be specified on per-page, per-percent-coverage or both, and any number of printers/print queues can be provided (with different charge rates and printer parameters). Monochrome and CMYK colour printers are supported (with separate charge rates for both colour and black ink).
For all filters, processing can happen out-of-order, and you may prioritise jobs on the basis of size (jobs larger than a threshold can get lower priority or higher priority as desired) and jobs are billed in parallel / overlapping - jobs which finish billing first get printed first.
This is not necessarily the same as the order of arrival. Detailed stats are collected on a per-printer basis for job size, CPU time for each job, page count and ink/toner coverage, so you can analyse the usage patterns for your printers and predict when a cartridge will need to be replaced. It supports an optional user-supplied anything-to-postscript filter, so you can get properly billed for plain text, DVI files, image files, and so forth as well as PostScript.
Databases and configuration files may be stored on a centralised web server. This allows read-only access so that Unix (and conceivably Windows) clients could easily check quota, calculate quotes etc. remotely.
For fun, an additional filter is provided which allows users to deduct fixed amounts from their accounts (we use it to let students buy drinks and food from an unsecured laboratory fridge).
Enhancements:
- Finished support for per-user per-printer stats, tested that it works.
<<lessA simple print filter and accompanying daemon perform pre-printing billing, post-printing billing, print-accounting and print job quote generation. In addition, various utilities for administrators and users are provided - including programs to check your print quota and usage patterns, a web interface for both users and administrators and a command-line quote generator.
Charge rates may be specified on per-page, per-percent-coverage or both, and any number of printers/print queues can be provided (with different charge rates and printer parameters). Monochrome and CMYK colour printers are supported (with separate charge rates for both colour and black ink).
For all filters, processing can happen out-of-order, and you may prioritise jobs on the basis of size (jobs larger than a threshold can get lower priority or higher priority as desired) and jobs are billed in parallel / overlapping - jobs which finish billing first get printed first.
This is not necessarily the same as the order of arrival. Detailed stats are collected on a per-printer basis for job size, CPU time for each job, page count and ink/toner coverage, so you can analyse the usage patterns for your printers and predict when a cartridge will need to be replaced. It supports an optional user-supplied anything-to-postscript filter, so you can get properly billed for plain text, DVI files, image files, and so forth as well as PostScript.
Databases and configuration files may be stored on a centralised web server. This allows read-only access so that Unix (and conceivably Windows) clients could easily check quota, calculate quotes etc. remotely.
For fun, an additional filter is provided which allows users to deduct fixed amounts from their accounts (we use it to let students buy drinks and food from an unsecured laboratory fridge).
Enhancements:
- Finished support for per-user per-printer stats, tested that it works.
Download (0.11MB)
Added: 2005-11-21 License: GPL (GNU General Public License) Price:
1436 downloads
Accelerated KNOPPIX 1.0
Accelerated KNOPPIX is a fast-booting variant of the popular KNOPPIX live CD. more>>
Accelerated KNOPPIX is a fast-booting variant of the popular KNOPPIX live CD.
The mechanism of acceleration in the live CD
A cloop profiler is developed in order to grasp the access situation of CD.
Although various files are referred to in Live CD in the case of a system startup, since each position of media is dotted with the file, a lot of seeking will generate it at the time of reading. If the seek time of this CD is lost, it will be said that data can be transmitted at a stretch from CD. Then, the seek time of a pickup is reduced by rearranging the file read at the time of starting on a block level.
Live CD performs automatic recognition of the peripheral equipment of PC at the boot sequence.
Although the cache of the file required for starting of a desktop are predicted and carried out in the meantime, if there are few memories which can be used for cache, starting will become slow conversely. By this development, memory capacity is examining making it an effect show up at least because the predicted data carries out the cache of the compression image of cloop as it is.
<<lessThe mechanism of acceleration in the live CD
A cloop profiler is developed in order to grasp the access situation of CD.
Although various files are referred to in Live CD in the case of a system startup, since each position of media is dotted with the file, a lot of seeking will generate it at the time of reading. If the seek time of this CD is lost, it will be said that data can be transmitted at a stretch from CD. Then, the seek time of a pickup is reduced by rearranging the file read at the time of starting on a block level.
Live CD performs automatic recognition of the peripheral equipment of PC at the boot sequence.
Although the cache of the file required for starting of a desktop are predicted and carried out in the meantime, if there are few memories which can be used for cache, starting will become slow conversely. By this development, memory capacity is examining making it an effect show up at least because the predicted data carries out the cache of the compression image of cloop as it is.
Download (692MB)
Added: 2006-03-01 License: GPL (GNU General Public License) Price:
762 downloads
MyProfi 0.161 Beta
MyProfi project is a command line tool that parses mysql query log and outputs statistics. more>>
MyProfi project is a command line tool that parses mysql query log and outputs statistics of most frequently used queries, sorting them by number of times they appear in a log file. The similar queries are groupped together.
Thus, select id from user where login="admin" and select id from user where login=root become select id from user where login={} - the variable parts of queries are replaced with {} markers, this make statistics analysis as easy as revewing the top of most frequently occured queries patterns.
When developing an application one can hardly predict, which of the sql queries will run the most often, and which less often. The most popular queries are to be the first candidates for optimisation, fine tuning and polishing. By optimizing the most frequenly run queries the developer may achieve significant performance gain for overall system. By reviewing the statistics of MyProfi output its becomes too easy to extract those queries to start optimizing db by adding indexes, reconsidering database structure, etc.
Main features:
Removing unsignificant variable data
- Usually applications run similar queries against database, but using different variable parameters in them. For example, fetch some data by its ID number in a table. What we want is to know, how frequently this query was executed at all. By removing the variable data from all queries we can then group them and count how many times they appear in the log file. Thus, from two queries SELECT NAME FROM USER WHERE ID=223 and SELECT NAME FROM USER WHERE ID=223 we will get one pattern SELECT NAME FROM USER WHERE ID={} two times.
- As there may be variable data of different types we also wish to remove quoted strings (considering all possible escaping techniques), multiline and single line comments, unsignificant whitespaces, siquential variables like ID IN (1 ,2 ,3), etc.
Queries ordered by popularity
- Thats exactly the reason, why this utility has been developed - to know, which queries are the most frequently run on database server. The more popular the query is, the more performance may be gained by optimizing it.
Additional statistics
- For slow query formats there are available additional options to use for sorting by a different then number of queries criteria. As slow query log provides the information for each query about the time it was running, the time it was locked, the number of rows totally examined and finally returned. MyProfi allowes to sort the statistics by any of these field, and even by maximum, total or average numbers for each pattern.
Statistics by query type
- Query type statistics is sometimes useful for appropriate database server configuration and tuning. For example, if UPDATE queries are the most frequently run against database, a developer may consider restructurizing tables to reduce the use of indexes, as too many indexes in tables make its update slower. Or otherwise, if SELECT queries are popular, it may be a reason to allocate more memory buffer space, etc.
Different input formas support
- MyProfi understands several input file formats. Beside general query log format, slow query log format is also supported.
- As of version 5.1.x of MySQL server, both the general and slow query logs may be configured to be writen to mysql system table. By setting an appropriate option in MyProfi or providing input file with .csv extension we can tell the parser to treat input files as csv formatted.
- Moreover, for slow query log you can output an additional statistics.
Stream parsing
- No matter how huge your input file is, the parser will never load whole content into memory, but reads the file chunk by chunk (though, you might be going to wait for "some time" while this huge file is being processed).
Custom queries filtering
- You can choose to output statistics only for certain type of queries: SELECT, UPDATE, DELETE, etc. This may be useful, for instance, when you are going to check the most popular queries execution plan using EXPLAIN. In this case non-SELECT queries will be just useless.
Support for top N queries
- Output only first N patters in sorted statistics.
<<lessThus, select id from user where login="admin" and select id from user where login=root become select id from user where login={} - the variable parts of queries are replaced with {} markers, this make statistics analysis as easy as revewing the top of most frequently occured queries patterns.
When developing an application one can hardly predict, which of the sql queries will run the most often, and which less often. The most popular queries are to be the first candidates for optimisation, fine tuning and polishing. By optimizing the most frequenly run queries the developer may achieve significant performance gain for overall system. By reviewing the statistics of MyProfi output its becomes too easy to extract those queries to start optimizing db by adding indexes, reconsidering database structure, etc.
Main features:
Removing unsignificant variable data
- Usually applications run similar queries against database, but using different variable parameters in them. For example, fetch some data by its ID number in a table. What we want is to know, how frequently this query was executed at all. By removing the variable data from all queries we can then group them and count how many times they appear in the log file. Thus, from two queries SELECT NAME FROM USER WHERE ID=223 and SELECT NAME FROM USER WHERE ID=223 we will get one pattern SELECT NAME FROM USER WHERE ID={} two times.
- As there may be variable data of different types we also wish to remove quoted strings (considering all possible escaping techniques), multiline and single line comments, unsignificant whitespaces, siquential variables like ID IN (1 ,2 ,3), etc.
Queries ordered by popularity
- Thats exactly the reason, why this utility has been developed - to know, which queries are the most frequently run on database server. The more popular the query is, the more performance may be gained by optimizing it.
Additional statistics
- For slow query formats there are available additional options to use for sorting by a different then number of queries criteria. As slow query log provides the information for each query about the time it was running, the time it was locked, the number of rows totally examined and finally returned. MyProfi allowes to sort the statistics by any of these field, and even by maximum, total or average numbers for each pattern.
Statistics by query type
- Query type statistics is sometimes useful for appropriate database server configuration and tuning. For example, if UPDATE queries are the most frequently run against database, a developer may consider restructurizing tables to reduce the use of indexes, as too many indexes in tables make its update slower. Or otherwise, if SELECT queries are popular, it may be a reason to allocate more memory buffer space, etc.
Different input formas support
- MyProfi understands several input file formats. Beside general query log format, slow query log format is also supported.
- As of version 5.1.x of MySQL server, both the general and slow query logs may be configured to be writen to mysql system table. By setting an appropriate option in MyProfi or providing input file with .csv extension we can tell the parser to treat input files as csv formatted.
- Moreover, for slow query log you can output an additional statistics.
Stream parsing
- No matter how huge your input file is, the parser will never load whole content into memory, but reads the file chunk by chunk (though, you might be going to wait for "some time" while this huge file is being processed).
Custom queries filtering
- You can choose to output statistics only for certain type of queries: SELECT, UPDATE, DELETE, etc. This may be useful, for instance, when you are going to check the most popular queries execution plan using EXPLAIN. In this case non-SELECT queries will be just useless.
Support for top N queries
- Output only first N patters in sorted statistics.
Download (0.006MB)
Added: 2007-05-15 License: GPL (GNU General Public License) Price:
893 downloads
American Political Science: Campaign Simulator 0.1
American Political Science: Campaign Simulator project is a statistically based political campaign simulation game. more>>
American Political Science: Campaign Simulator project is a statistically based political campaign simulation game.
The Campaign Simulator is an attempt to statistically model and predict the outcome of an American presidential election.
Several users assume the roles of competitive candidates and inflict the repercussions of certain decisions on a GSS-based dataset.
The application is written in Java and supports all operating systems with a Java 1.5 VM.
Main features:
- Time is not the only limiting variable. In fact, time may not be the proper limit as most operations may be performed in tandem; an economic system that allows fund raising elements should be implemented.
- The current choices all utilize the same dataset algorithm to effect the populace in similar ways- this set of scripts should be broadened and deepened as they are too high level.
- The Python Architecture needs polishing- the internal IDE is not complete, and the ability to assign scripts to run at differing points in the lifetime of the application has yet to be created.
- The installer should place links on the desktops of Mac and Unix/Linux Systems.
- Some of the small features planned, such as a GUI for dialog creation, have been cut for the deadline and should be added.
<<lessThe Campaign Simulator is an attempt to statistically model and predict the outcome of an American presidential election.
Several users assume the roles of competitive candidates and inflict the repercussions of certain decisions on a GSS-based dataset.
The application is written in Java and supports all operating systems with a Java 1.5 VM.
Main features:
- Time is not the only limiting variable. In fact, time may not be the proper limit as most operations may be performed in tandem; an economic system that allows fund raising elements should be implemented.
- The current choices all utilize the same dataset algorithm to effect the populace in similar ways- this set of scripts should be broadened and deepened as they are too high level.
- The Python Architecture needs polishing- the internal IDE is not complete, and the ability to assign scripts to run at differing points in the lifetime of the application has yet to be created.
- The installer should place links on the desktops of Mac and Unix/Linux Systems.
- Some of the small features planned, such as a GUI for dialog creation, have been cut for the deadline and should be added.
Download (30.0MB)
Added: 2006-11-01 License: GPL (GNU General Public License) Price:
1090 downloads
Impact 0.7.5
Impact is a finite element program based on an explicit time stepping algorithm. more>>
Impact project is an open source, free finite element program which can be used to predict most dynamic events such as car crashes or metal sheet punch operations. They usually involve large deformations and high velocities.
Simulations are made on a virtual three dimensional model which can be created with a pre-processor or with the built-in Fembic language. Results are viewed in a post-processor.
Impact is designed to interface with the included pre- and postprocessor by default, but there are also interfaces available for more advanced pre-and postprocessors such as GiD or Gmsh. Impact also has rudamentary support for Nastran file format.
Development is made by a team of volunteers from all over the world with the aim of creating a clean and compact program which is simple to understand and use.
Impact is licensed under the Gnu Public License which makes it free to use and modify as long as you release and publish your improvements under the same license.
Impact is written in Java which means it can be run on most hardware and operating systems.
Enhancements:
- The entire preprocessor model can now be saved in the .in file.
- It is possible to script drive the geometry and FE model by manually editing the .in file and then reading it into the preprocessor.
- A bug was fixed in the post-processor where Gradient Result is now visible in the OpenGL accelerated version.
<<lessSimulations are made on a virtual three dimensional model which can be created with a pre-processor or with the built-in Fembic language. Results are viewed in a post-processor.
Impact is designed to interface with the included pre- and postprocessor by default, but there are also interfaces available for more advanced pre-and postprocessors such as GiD or Gmsh. Impact also has rudamentary support for Nastran file format.
Development is made by a team of volunteers from all over the world with the aim of creating a clean and compact program which is simple to understand and use.
Impact is licensed under the Gnu Public License which makes it free to use and modify as long as you release and publish your improvements under the same license.
Impact is written in Java which means it can be run on most hardware and operating systems.
Enhancements:
- The entire preprocessor model can now be saved in the .in file.
- It is possible to script drive the geometry and FE model by manually editing the .in file and then reading it into the preprocessor.
- A bug was fixed in the post-processor where Gradient Result is now visible in the OpenGL accelerated version.
Download (4.4MB)
Added: 2007-07-12 License: GPL (GNU General Public License) Price:
869 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 can predict 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
