reference letter sample
Web Reference Database 0.9.0
Web Reference Database is a bibliographic manager that can import and export references in various formats. more>>
It can make formatted lists of citations in HTML, RTF, PDF, or LaTeX, and offers powerful searching, rich metadata, and RSS support
Enhancements:
- This release offers major function enhancements and bugfixes.
- Batch import from various bibliographic formats (including BibTeX, Endnote, RIS, ISI, and MODS XML) is now supported, as is import from a PubMed ID.
- An OpenDocument spreadsheet for use with OpenOffice.org can be exported, and formatted citation lists can be generated as HTML, RTF, PDF, or LaTeX. An SRU/W service and support for unAPI, OpenURL, and COinS metadata have been added.
- These allow the data to be used by the next generation of bibliographic clients.
- A new command line client is also included.
Linux Letters and Numbers 0.1.95
Linux Letters and Numbers project is an educational childrens game for linux. more>>
Linux Letters and Number is a fun and educational learning game intended for children 2 and up.
It helps children learn or improve their letters, numbers, spelling, and vocabulary skills through the use of interesting pictures.
It also helps them develop important computer skills too.
It is written in C using the GTK and GDK_Imlib libraries.
Main features:
- Extensible - add new images yourself without having to make changes to the program. With support for gdk_imlib, you can now use common image formats, including common formats like gif, jpeg, xpm, png, and tiff.
- Dynamic - each letter or number can be represented by numerous pictures, each being displayed randomly.
- Flexible - you can even have more than one picture for a given word, by using a simple versioning scheme (ie Apple.1.xpm, Apple.2.xpm)
- Interesting - because you can change the game, its different every time!
Algorithm::Numerical::Sample 1.3
Algorithm::Numerical::Sample is a Perl module that can draw samples from a set. more>>
SYNOPSIS
use Algorithm::Numerical::Sample qw /sample/;
@sample = sample (-set => [1 .. 10000],
-sample_size => 100);
$sampler = Algorithm::Numerical::Sample::Stream -> new;
while () {$sampler -> data ($_)}
$random_line = $sampler -> extract;
This package gives two methods to draw fair, random samples from a set. There is a procedural interface for the case the entire set is known, and an object oriented interface when the a set with unknown size has to be processed.
A: sample (set => ARRAYREF [,sample_size => EXPR])
The sample function takes a set and a sample size as arguments. If the sample size is omitted, a sample of 1 is taken. The keywords set and sample_size may be preceeded with an optional -. The function returns the sample list, or a reference to the sample list, depending on the context.
B: Algorithm::Numerical::Sample::Stream
The class Algorithm::Numerical::Sample::Stream has the following methods:
new
This function returns an object of the Algorithm::Numerical::Sample::Stream class. It will take an optional argument of the form sample_size => EXPR, where EXPR evaluates to the sample size to be taken. If this argument is missing, a sample of size 1 will be taken. The keyword sample_size may be preceeded by an optional dash.
data (LIST)
The method data takes a list of parameters which are elements of the set we are sampling. Any number of arguments can be given.
extract
This method will extract the sample from the object, and reset it to a fresh state, such that a sample of the same size but from a different set, can be taken. extract will return a list in list context, or the first element of the sample in scalar context.
Kumula Letters 0.3
Kumula Letters is a program that generates letters in PDF format using the addresses and contacts managed with Kumula Clients. more>>
After selecting an address or contact, its possible to change the address field manually. Choose a template (you can build a letter template on your own) and start writing the letter. "Show PDF" generates a pdf file and calls your favorite pdf viewer (which is configured with "Kumula Configurator").
Objective Modula-2 1.00 (Reference Implementation)
Objective Modula-2 programming language is a hybrid between Smalltalk and Modula-2. more>>
The design is an example how native Cocoa/GNUstep support can be added to static imperative programming languages without implementing a bridge.
Objective Modula-2s scope encompasses the design of the Objective Modula-2 programming language and the implementation of a compiler to implement it. The initial compiler will generate Objective-C source code.
Enhancements:
- This code is used to verify ideas and concepts which come up in the course of defining the language.
- It is in an early stage, incomplete and subject to frequent changes.
Letter Hunt 002
Leter Hunt is a Seven Day Roguelike game. more>>
Main features:
- Spell words by capturing your foes in the correct order to earn points and powerups.
- Fifty-two letters to capture, many with their own personalities or unique abilities.
- Power-up based character advancement. Rather than gaining experience or levels, you just gain powerups that can wear off. Advancement is not permament.
- Open-ended game - there is no final boss or win condition. Your goal is to get as many points as possible before attrition or increasingly difficult enemies take you down.
- Extremely tactical combat. There is no randomness in combat. You always hit and always do full damage. This means that careful placement is the difference between success and failure.
- Turn based action, as is normal for a roguelike.
- User editable wordlist: The list of valid words is a plain text file that can be added to or replaced. Creature frequency is calculated from letter frequency in the wordlist file.
Enhancements:
- Various niggly bugs fixed, including the crash on walk.
YAPE::Regex::Element 3.03
YAPE::Regex::Element contains sub-classes for YAPE::Regex elements. more>>
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.
Stream::Reader 0.09
Stream::Reader is a stream reader Perl class. more>>
SYNOPSIS
# Input stream can be reference to TYPEGLOB or SCALAR, output stream
# can be the same types or undefined
# Constructor
$stream = Stream::Reader->new( *IN,
{ Limit => $limit, BuffSize => $buffsize, Mode => UB } );
# Reading all before delimiter beginning from current position.
# Delimiter is SCALAR or reference to array with many SCALARs.
# Returns true value on succesfull matching or if end of stream
# expected at first time
$bool = $stream->readto( $delimiter,
{ Out => *OUT, Limit => $limit, Mode => AIE } );
# Reading fixed number of chars beginning from current position.
# Returns true value if was readed number of chars more then zero or
# end of stream was not expected yet
$bool = $stream->readsome( $limit, { Out => *OUT, Mode => A } );
# Mode is string, what can contains:
# U - modificator for constructor. disable utf-8 checking
# B - modificator for constructor. enable second buffer for speed up
# case insensitive search
# A - modificator for readto() and readsome(). appending data to
# output stream, if stream is SCALAR
# I - modificator for readto(). enable case insensitive search
# E - modificator for readto(). at end of input stream alltimes
# returns false value
$number = $stream->{Total}; # total number of readed chars
$number = $stream->{Readed}; # number of readed chars at last
# operation (without matched string
# length at readto() method)
$number = $stream->{Stored}; # number of succesfully stored chars
# at last operation
$string = $stream->{Match}; # matched string at last operation
# (actually for readto() only)
$bool = $stream->{Error}; # error status. true on error
METHODS
OBJ = Stream::Reader->new( INPUT, { ... Params ... } )
The constructor method instantiates a new Stream::Reader object.
INPUT - is a reference to file stream, opened for reading, or reference to defined string. This is an obligatory parameter.
Params (all optionaly):
Limit - limit size of input stream data in characters. If this parameter is absent, not defined or less then zero, then all data from input stream will be available for reading.
BuffSize - size of buffer in characters. If this parameter is absent, not defined or less then zero, then will be used default buffer size 32768 characters.
Mode - is string with letters-modificators:
B - use second buffer. Can really speed up search in case insensitive mode.
U - disable UTF-8 data check in UTF-8 mode. Use this flag if you are absolutely sure, that your UTF-8 data is valid.
RESULT = OBJ->readto( DELIMITER, { ... Params ... } )
This method reads all data from input stream before first found delimiter, beginning from current position.
RESULT - boolean value. True value if successfuly found delimeter or and of input stream has expected at first time. False value otherwise, or in case of reading error.
DELIMETER - is a string-delimeter or reference to array with many delimeters. This is an obligatory parameter and must be defined.
Remember! In case of many delimiters, left delimiter alltimes have more priority then right!
Params (all optionaly):
Out - is a reference to file stream, opened for writing, or reference to string. If this parameter is absent then data will not stored.
Limit - size in characters. Defines, the maximum number of characters that must be stored in Out. If this paramter is absent, not defined or less then zero, then this method will be trying to store all readed data.
Mode - is string with letters-modificators:
A - appendig data to Out if Out is a reference to string.
I - search in case insensitive mode.
E - at the end of input stream returns only false value. Without this modificator, if end of stream expected at first time, then will be returned true value.
RESULT = OBJ->readsome( LIMIT, { ... Params ... } )
This method reads fixed number of characters from input stream beginning from current position.
RESULT - boolean value. True value, if any characters were read or end of input stream is not expected yet. False value otherwise, or in case of reading error.
LIMIT - limit size in characters, how many it is necessary to read. If this parameter is absent, not defined or less then zero, then will be read all available data from input stream.
Params (all optionaly):
Out - the same as in readto() method.
Mode - is string with letters-modificators:
A - the same as in readto() method.
Statistics:
OBJ->{Total} - total number of readed characters. Warning! This module using block reading and real position in stream is different.
OBJ->{Readed} - number of readed characters at last operation (without matched string length at readto() method).
OBJ->{Stored} - number of succesfully stored chars at last operation
OBJ->{Match} - matched string at last operation (actually for readto() only)
OBJ->{Error} - boolen error status. At any reading erorrs all operations will be stopes and this flag turned to true value.
Universal Module Player B4
Universal Module Player is a multiplatform audio module player for Unix-like systems. more>>
Universal Module Player works in UNIX-like platforms, including Linux, Mac OS X, FreeBSD, Solaris...
It uses the Custom LibModPlug audio library, an improved version of the well-known LibModPlug library, supporting more than 20 formats and giving you high playing quality. It uses LibSDL to handle multiplatform sound support.
Main features:
- You can play the supported formats and seek to any order in the song. You have pause, timer, display, and other standard features.
- You can view the pattern notes while playing.
- You can specify noise reduction, megabass, surround, reverb sound options specifying the grade and the delay of most of the options.
- You can create, save and edit playlists to play a selection of modules.
- You can read and export to a file the song builtin message, the song instrument names and the song sample names.
- Each user of your UNIX box can save all the sound options.
- And much more!
Supported Formats
Supported file formats on both Little Endian (Intel x86, etc.) and Big Endian (PowerPC, SPARC, MIPS, Motorola 68000, etc.) platforms:
Impulse Tracker (IT), Scream Tracker (STM), Scream Tracker 3 (S3M), Extended Modules (XM), Amiga Modules (MOD), OktaMED (MED), Oktalyzer (OKT), Unreal Modules (UMX), Composer 669 (669), DigiBooster Pro Modules (DBM), PolyTracker (PTM), and Farandole (FAR)
Additional file formats supported only on Little Endian platforms (support for Big Endian is on development):
MultiTracker Modules (MTM), AFM, AMS, DMF, DSM, DigiTracker (MDL), MadTracker 2.0 (MT2), PSM, ULT
Exporting Formats
You can export or convert any of the above formats to the following file types:
Impulse Tracker (IT)
WAVE Audio File (WAV)
Audio Interchange File Format (AIFF)
Raw Pulse Code Modulation (PCM)
Enhancements:
- Buffer length fixes.
- Playlist commands were a pain. Now we use the first letter of the command name. Also, pressing ENTER does not quit, the user has to explicitly specify to quit pressing q
- Hopefully fixed AIFF exporting bug.
- New section in the README about LibAo configuration, and some misc. rearrangements.
SQL::Interpolate 0.33
SQL::Interpolate is a Perl module to interpolate Perl variables into SQL statements. more>>
SYNOPSIS
use SQL::Interpolate qw(:all);
# Some sample data to interpolate:
my $s = blue; my @v = (5, 6);
# Variable references are transformed into bind parameters.
# The most basic usage involves scalarrefs (as well as arrayrefs
# preceeded by "IN").
my ($sql, @bind) = sql_interp
SELECT * FROM table WHERE x = , $s, AND y IN, @v;
# RESULT:
# $sql = SELECT * FROM mytable WHERE x = ? AND y IN (?, ?)
# @bind = ($s, @v);
# In certain contexts, an arrayref or hashref acts as a single tuple:
my ($sql, @bind) = sql_interp
INSERT INTO table, {x => $s, y => 1};
# RESULT:
# $sql = INSERT INTO mytable (x, y) VALUES(?, ?);
# @bind = ($s, 1);
my ($sql, @bind) = sql_interp
UPDATE table SET, {x => $s, y => 1}, WHERE y , 2;
# RESULT:
# $sql = UPDATE mytable SET x = ?, y = ? WHERE y ?;
# @bind = ($s, 1, 2);
# In general, a hashref provides a shortcut for specifying
# a logical-AND construction:
my ($sql, @bind) = sql_interp
SELECT * FROM table WHERE, {x => $s, y => @v};
# RESULT:
# $sql = SELECT * FROM mytable WHERE (x = ? AND y IN (?, ?));
# @bind = ($s, @v);
# In general, an arrayref acts as a result set or reference to
# a temporary table:
my ($sql, @bind) = sql_interp
[[1, 2], [4, 5]], UNION, [{x => 2, y => 3}, {x => 5, y => 6};
# RESULT:
# $sql = (SELECT ?, ? UNION ALL SELECT ?, ?) UNION
# (SELECT ? AS x, ? AS y UNION ALL SELECT ?, ?);
# @bind = (1,2,4,5, 2,3,5,6);
my ($sql, @bind) = sql_interp
SELECT * FROM, [[1, 2], [4, 5]]
# RESULT:
# $sql = SELECT * FROM (SELECT ?, ? UNION ALL SELECT ?, ?) AS tbl0;
# @bind = (1,2,4,5);
# Each result above is suitable for passing to DBI:
my $res = $dbh->selectall_arrayref($sql, undef, @bind);
# Besides these simple techniques shown, SQL-Interpolate includes
# various optional modules to further integrate SQL::Interpolate with
# DBI and streamline the syntax with source filtering and macros (see
# the L section):
use DBIx::Interpolate FILTER => 1;
...
my $rows = $dbx->selectall_arrayref(sql[
SELECT thid, date, title, subject
FROM threads
WHERE date > $x AND subject IN @subjects
]);
Text::WagnerFischer 0.04
Text::WagnerFischer is an implementation of the Wagner-Fischer edit distance. more>>
SYNOPSIS
use Text::WagnerFischer qw(distance);
print distance("foo","four");# prints "2"
print distance([0,1,2],"foo","four");# prints "3"
my @words=("four","foo","bar");
my @distances=distance("foo",@words);
print "@distances"; # prints "2 0 3"
@distances=distance([0,2,1],"foo",@words);
print "@distances"; # prints "3 0 3"
This module implements the Wagner-Fischer dynamic programming technique, used here to calculate the edit distance of two strings. The edit distance is a measure of the degree of proximity between two strings, based on "edits": the operations of substitutions, deletions or insertions needed to transform the string into the other one (and vice versa). A cost (weight) is needed for every of the operation defined above:
/ a if x=y (cost for letter match)
w(x,y) = | b if x=- or y=- (cost for insertion/deletion operation)
c if x!=y (cost for letter mismatch)
These costs are given through an array reference as first argument of the distance subroutine: [a,b,c]. If the costs are not given, a default array cost is used: [0,1,1] that is the case of the Levenshtein edit distance:
/ 0 if x=y (cost for letter match)
w(x,y) = | 1 if x=- or y=- (cost for insertion/deletion operation)
1 if x!=y (cost for letter mismatch)
This particular distance is the exact number of edit needed to transform the string into the other one (and vice versa). When two strings have distance 0, they are the same. Note that the distance is calculated to reach the _minimum_ cost, i.e. choosing the most economic operation for each edit.
calcamp 0.1
calcamp is a program that calculates with what factor an audio-sample should be amplified to get maximum volume. more>>
Instruction for usage:
calcamp file_in
or
... | calcamp
Getopt::ExPar 0.01
Getopt::ExPar contains extended parameters command line parser. more>>
SYNOPSIS
use Getopt::ExPar;
my(@PDT, @MM, %OPT);
ExPar @PDT, @MM, $OPT;
EXPORT
use Getopt::ExPar exports the sub ExPar into your name space.
ExPar is a perl5 module used to parse command line parameters. This package uses the @PDT, Parameter Description Table, and the @MM, Message Module, to return %OPT which is a hash reference containing the command line option data. The function of Getopt::ExPar is based on Getopt::EvaP, created by Stephen O. Lidie.
Introduction
The ExPar function parses a perl command line. Using the option definitions in the @PDT, argument types are checked and the arguments themselves may be checked against a specified range or pattern. By using both @PDT and @MM, several types of help may be retured to the user. ExPar handles command lines with this format:
command [-parameters] [file_list]
where any parameters and file_list are optional.
Parameter Description Table (PDT) Syntax
Here is the PDT syntax. Optional constructs are enclosed in [], and the | character separates possible values in a list.
PDT [program_name, alias]
[parameter_name[, alias]: type [pattern | range] [ = [default_variable,] default_value]]
PDTEND [flag_list]
flag_list is one or more of the following flags: optional_file_list | required_file_list | no_file_list: specifies condition of list of files at end of command line. (only one of these may be specified) abbreviations: allows for abbreviations of commands or aliases as long as enough of the command is given to make it distinguishable from all others. If not, a message is printed so the user may be more specific. switchglomming: allows for multiple single-letter switch options to be specified as single option (must be first option). pdt_warnings: for debugging a @PDT, it prints out messages that are not necessarily errors, like inconsistent number of default values in a list, etc.
The default_variable is an environment variable - see the section Usage Notes for complete details.
So, the simplest possible PDT would be:
PDT
PDTEND
This PDT would simply define a -help switch for the command, but is rather useless.
A typical PDT would look more like this:
PDT frog
number, n: integer = 1
chars, c: string = "default_string"
PDTEND no_file_list
This PDT, for command frog, defines two parameters, number (or n), of type integer with a default value of 1, and chars (or c), of type string with a default value of "default_string". The PDTEND no_file_list indicator indicates that no trailing file_list can appear on the command line. Of course, the -help switch is defined automatically.
Each of these options may be further refined by using a range and a pattern, respectively:
PDT frog
number, n: integer (((#100, the # is implied. Other simple conditions are < and == (a single = is accepted as ==, not an assignment). Ex: This condition: (#>10, #<<less
Network Transparent Widgets 0.3.2
Network Transparent Widgets is a protocol and application framework. more>>
The client applications are nearly indistinguishable from local, native applications. The protocol is language and architecture neutral. Server language bindings for C and Java are in heavy development.
Main features:
Speed: Remote apps can run at a speed which is nearly indistinguishable from a locally running application. Since the client draws the widgets natively, its not necessary to transfer graphical data, only widget state data. This can be done asynchronously, so the responsiveness of the UI never suffers.
Persistence: Its just as easy to write the ntw protocol data to disk as it is to the network, so the state of the entire gui application can be easily saved. This also happens transparently, so the developer doesnt have to spend any time loading and saving data. Also, if a network connection dies or the client computer loses power, the application can be restarted from the point of failure at the next connection.
Portability: using the protocol, an ntw server application running on a Unix machine could talk to an ntw client for Windows, and vice versa. So a developer could write a program on Linux that could be run from any OS without any porting necessary. Any language or platform that can read and write data to a network can use the protocol to create gui apps.
Scalability: Since the ntw server does not store or draw widget graphics, the memory and computational overhead of running an ntw application is much less than a comparable X Window application. A low end machine could easily serve hundreds of remote clients.
Productivity: Users can run ntw apps without installing anything but the client. Developers can release new versions of their apps without the users having to do anything, much like a web page.
Reference Implementation:
The current reference implementation of the client implements most of the widgets in the Gtk toolkit, and is written in C using the GTK+ 2.0 toolkit for drawing the widgets and handling events. It compiles and runs on FreeBSD, Linux, and Windows, and likely other Unix variants also. Youll need the GTK+ toolkit installed to run the client, and the GTK+ development headers to compile it.
The source code also include a server reference implementation and a sample server application. The "server" is really a set of C language bindings to functions that create and send ntw widget data. The bindings can be used in much the same way as any other GUI toolkit. See the file "ntwtest.c" for the example application. Its been tested on FreeBSD, Linux, and Windows XP. The server library should compile and run on most systems with a C compiler and support for sockets, without the need for any additional libraries.
The protocol is defined by the two header files, ntw.h and ntw_signals.h. These are C header files that describe exactly the byte layout for each of the widgets and all of the opcodes and events that can be sent.
There are still some widgets missing, and some of the signals raised by GTK are not yet handled in the protocol. This will be fixed in the near future.
Note: Although the reference implementation is coded in GTK, the NTW protocol is designed to be independent of any particular widget toolkit. GTK was picked due to favorable design features and a favorable license.
Enhancements:
- 02JUL06 - Fixed bug in update.c where spin_button was switched with slider
- 02JUL06 - Removed status field from image_buffer widget protocol
DNA BASER 2.60
Visit us for updated info: http://www.DNABaser.com DNA Baser Assembler is easy to use software for simple and batch DNA sequence assembly, DNA sequence analysis, contig editing, metadata integration and mutation detection. It also offers a powerful chromatogram viewer/editor. The truly user-friendly interface makes DNA Baser the best choice for DNA contig assembly. For more details, see the DNA BASER Features page. File formats supported are abi, scf and seq (or FASTA). Features: end clip, export,auto trim... more>>
DNA BASER - Visit us for updated info: http://www.DNABaser.com
DNA Baser Assembler is easy to use software for simple and batch DNA sequence assembly, DNA sequence analysis, contig editing, metadata integration and mutation detection. It also offers a powerful chromatogram viewer/editor. The truly user-friendly interface makes DNA Baser the best choice for DNA contig assembly. For more details, see the DNA BASER Features page.
Why is DNA Baser Assembler special?
Any software company pretends that their product is the best. But lets see for real if DNA Baser can offer you a better proposition. As you will see below we concentrate on adding automatic and batch functions to our product in order to decrease the time. Additional to this, DNA Baser is available at a "kill your competition" price.
Forget about manually trimming the low quality ends of your sequences. DNA Baser Assembler will do it for you!
Do you think you need weeks to assemble hundreds of contigs? What about doing this in minutes? DNA Baser is the only software that can automatically detect and assemble sequences belonging to the same contig based on their filename.
Do you think that is necessary to spend more than 20 minutes to correct discrepancies and mismatches in every contig? Wrong! DNA Baser is the first software which can make correct suggestions in at least 98% of cases.
Have you ever wondered how others laboratories afford to have sequence assembly software in EVERY computer? Simple! They dont spend thousands of dollars for each license. They use DNA Baser Assembler. DNA Baser is affordable, has no annual maintenance fees, technical support is included in price and you have instant access to your key, right after purchase.
You dont have to fill in and submit forms in order to get a trial version. If you want to try it, you can download and install it in less than one minute. No personal data or registration process is required. The trial version is fully functional.
DNA BASER Assembler offers a smart navigation system that takes you to the location of each sequence ambiguity / mutation with a single click.
Enhancements:
Version 2.60
New: Metadata and batch metadata integration.
New: Button to open Windows Explorer in contigs folder, after sequence assembly.
New: Remove vectors from single chromatograms.
New: SEQUENCE ANALISYS - mark al bases with a confidence level (QV) below a specified threshold, in red.
New: Batch convert from chromatogram to Fasta with vector removal and automatic metadata integration.
New: Resizable chromatograms.
Full support for low quality sample ends editing.
100% compatible with Mac via Parallels/Bootcamp/VMWare.
Improved handling of corrupted/invalid ABI/SCF files.
Improved contig editor.
Improved file association.
Improved Assemble to reference.
Improved log window.
Improved file handling: Before starting the contig, check if all files in the JobList are valid. Invalid samples are automatically removed from Job List so the assembly process can continue without human intervention. Build a list of invalid files and report it.
Improved user interface: new toolbar, improved embedded help, interactive help, workflow...
Improved sample viewer: Mark as trusted/un-trusted can now be used also in Sample viewer window
New: Show error message while trying to open empty/invalid FASTA files
Improved: Correctly handle multiple contigs resulted when assembling to a reference.
Improved: menu Save as Fasta/Seq/Scf was replaced with Save all as... and Save selected as.... Now the user can choose where to save the file.
Version 2.10
Batch assembly. Thousand of contigs can be assembled at once.
System Requirements:CPU: 333MHz, 64MB RAM, Video 1024x768, 2MB HDD free space<<less