visually
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 83
AviUtils 2.0
AviUtils is a little tool for lazy peoples, to visually work with avi files. more>>
AviUtils is a little tool for lazy peoples, to visually work with avi files. It can change fourcc and can accept a command line argument: filepath of the avi.
Designed for seamless migration from win apps Gspot and Fourcc changer .
Aviutils2 is better graphics single tab version, but is experimental because of the string functions. Tested working only in Gentoo/ KDE3.5.0 .
Instructions: Choose your version (AviUtils or AviUtils2) and put the content of the choosed folder into ~/.kde/share/apps/konqueror/servicemenus to have it as service-menu for avi files.
<<lessDesigned for seamless migration from win apps Gspot and Fourcc changer .
Aviutils2 is better graphics single tab version, but is experimental because of the string functions. Tested working only in Gentoo/ KDE3.5.0 .
Instructions: Choose your version (AviUtils or AviUtils2) and put the content of the choosed folder into ~/.kde/share/apps/konqueror/servicemenus to have it as service-menu for avi files.
Download (0.020MB)
Added: 2006-02-05 License: GPL (GNU General Public License) Price:
1375 downloads
Social Networks Visualiser 0.43.1
SocNetV is a Linux GUI program written in Qt3. more>>
SocNetV is a Linux GUI program written in Qt3.
Social Networks Visualiser project main purpose is to bring to our Linux box comprehensive Social Networks Analysis and Visualisation.
It can read and write various network file formats and enables the user to visually modify an existing network or draw a new network using the mouse. Network and actor properties, such as distances, centralities, diameter etc, can be easily computed. Also, it can create random networks (lattice, same degree, etc).
SocNetV is NOT antagonistic to any commercial/scientific SNA programs, like PAJEK, visone, UCINET, AISee, KrackPlot, which are developed by groups of professionals and scientists. It is rather a personal trip to learn SNA and C++ programming while keeping the code open for others to learn from my mistakes. If you find it useful Ill be glad. But be aware that there is no warranty of efficiency, correctness or usability.
Oh, and this site is under never-ending construction as well.
Installation:
To see SocNetV in action, you need a modern Linux distro with Qt 3.x. Download the latest release from the link "Download" on the left. Untar the archive, cd to the new directory, and use:
/usr/lib/qt3/bin/qmake (or wherever are your Qt libs)
make
./socnetv
Enhancements:
- tarball of v. 043.1 was corrupted. fixed.
- Fixed display of HTML help in Debian package.
- Fixed wrong numbering of new actors with double-click.
- Fixed creation of links through middle-click.
<<lessSocial Networks Visualiser project main purpose is to bring to our Linux box comprehensive Social Networks Analysis and Visualisation.
It can read and write various network file formats and enables the user to visually modify an existing network or draw a new network using the mouse. Network and actor properties, such as distances, centralities, diameter etc, can be easily computed. Also, it can create random networks (lattice, same degree, etc).
SocNetV is NOT antagonistic to any commercial/scientific SNA programs, like PAJEK, visone, UCINET, AISee, KrackPlot, which are developed by groups of professionals and scientists. It is rather a personal trip to learn SNA and C++ programming while keeping the code open for others to learn from my mistakes. If you find it useful Ill be glad. But be aware that there is no warranty of efficiency, correctness or usability.
Oh, and this site is under never-ending construction as well.
Installation:
To see SocNetV in action, you need a modern Linux distro with Qt 3.x. Download the latest release from the link "Download" on the left. Untar the archive, cd to the new directory, and use:
/usr/lib/qt3/bin/qmake (or wherever are your Qt libs)
make
./socnetv
Enhancements:
- tarball of v. 043.1 was corrupted. fixed.
- Fixed display of HTML help in Debian package.
- Fixed wrong numbering of new actors with double-click.
- Fixed creation of links through middle-click.
Download (1.1MB)
Added: 2006-12-27 License: GPL (GNU General Public License) Price:
1037 downloads
Freedaisy 0.0.1 Alpha1
Freedaisy is a free implementation of Daisy book standard for allowing MP3 files to be indexed using (X)HTML and SMIL. more>>
Freedaisy is a free implementation of Daisy book standard for allowing MP3 files to be indexed using (X)HTML and SMIL.
Daisy is frequently used by visually impaired users, so they can listen to audio books with chapters.
<<lessDaisy is frequently used by visually impaired users, so they can listen to audio books with chapters.
Download (0.38MB)
Added: 2006-06-29 License: GPL (GNU General Public License) Price:
1213 downloads
KDirStat 2.5.2
KDirStat is a graphical disk usage utility, very much like the Unix more>>
KDirStat is a graphical disk usage utility, very much like the Unix "du" command.
KDirStat project displays a directory tree both in classical tree format (like Konqueror, but with accumulated tree sizes, shown as MB / GB and as percentage bars) and in "treemap" format like SequoiaView.
In addition to that, KDirStat provides cleanup facilities to reclaim disk space - both predefined and customizable.
Main features:
Display Features
- Graphical and numeric display of used disk space
- Files kept apart from directories in separate items to prevent cluttering the display
- All numbers displayed human readable - e.g., 34.4 MB instead of 36116381 Bytes
- Different colors in the directory tree display to keep the different tree levels visually apart
- Display of latest change time within an entire directory tree - you can easily see what object was changed last and when.
Treemap Display
- Treemap as alternate (auxiliary) view of a directory tree
- Easily find large in a directory tree: You see the entire tree at once. Large rectangles are large files - you can see them even if they are hidden somewhere deep within the tree.
- Treemap view slaved to the tree (list) view: Click on a file in the treemap, and it is selected in the tree view - and vice versa.
- Treemap tiles are colored by file type - all images in cyan, all audio tracks (MP3 etc.) in yellow, executables in magenta etc.; you can see from the color what a treemap rectangle is.
- Many treemap variants available:
- Plain treemap
- Squarified treemap (no thin elongated rectangles)
- Cushion treemap
- Colored treemap
- All combinations of the above
- Fast implementation: Treemap built in fractions of a second (on quite ordinary machines: Athlon-550 class)
- Treemap subwindow can be resized as the user prefers
- Treemap can be switched off with a single keypress (F9)
- Context menu with cleanup actions etc.
- Zoom the treemap in/out treemap with double click (left/right)
- Many treemap configuration options
Directory Reading
- Stays on one file system by default - reads mounted file systems only on request.
- You dont care about a mounted /usr file system if the root file system is full and you need to find out why in a hurry, nor do you want to scan everybodys home directory on the NFS server when your local disk is full.
- Network transparency: Scan FTP or Samba directories - or whatever else protocols KDE support.
- PacMan animation while directories are being read. OK, this is not exactly essential, but its fun.
Cleaning up
- Predefined cleanup actions: Easily delete a file or a directory tree, move it to the KDE trash bin, compress it to a .tar.bz2 archive or simply open a shell or a Konqueror window there.
- User-defined cleanup actions: Add your own cleanup commands or edit the existing ones.
- "Send mail to owner" report facility: Send a mail requesting the owner of a large directory tree to please clean up unused files.
Misc
- Feedback mail facility: Rate the program and tell the authors your opinion about it.
Whats New in 2.4.4 Release:
- Sparse files and hard links are now properly supported.
Whats New in 2.5.2 Release:
- Can now read and write directory contents from cache files generated by (supplied) Perl script, e.g. in cron job over night
<<lessKDirStat project displays a directory tree both in classical tree format (like Konqueror, but with accumulated tree sizes, shown as MB / GB and as percentage bars) and in "treemap" format like SequoiaView.
In addition to that, KDirStat provides cleanup facilities to reclaim disk space - both predefined and customizable.
Main features:
Display Features
- Graphical and numeric display of used disk space
- Files kept apart from directories in separate items to prevent cluttering the display
- All numbers displayed human readable - e.g., 34.4 MB instead of 36116381 Bytes
- Different colors in the directory tree display to keep the different tree levels visually apart
- Display of latest change time within an entire directory tree - you can easily see what object was changed last and when.
Treemap Display
- Treemap as alternate (auxiliary) view of a directory tree
- Easily find large in a directory tree: You see the entire tree at once. Large rectangles are large files - you can see them even if they are hidden somewhere deep within the tree.
- Treemap view slaved to the tree (list) view: Click on a file in the treemap, and it is selected in the tree view - and vice versa.
- Treemap tiles are colored by file type - all images in cyan, all audio tracks (MP3 etc.) in yellow, executables in magenta etc.; you can see from the color what a treemap rectangle is.
- Many treemap variants available:
- Plain treemap
- Squarified treemap (no thin elongated rectangles)
- Cushion treemap
- Colored treemap
- All combinations of the above
- Fast implementation: Treemap built in fractions of a second (on quite ordinary machines: Athlon-550 class)
- Treemap subwindow can be resized as the user prefers
- Treemap can be switched off with a single keypress (F9)
- Context menu with cleanup actions etc.
- Zoom the treemap in/out treemap with double click (left/right)
- Many treemap configuration options
Directory Reading
- Stays on one file system by default - reads mounted file systems only on request.
- You dont care about a mounted /usr file system if the root file system is full and you need to find out why in a hurry, nor do you want to scan everybodys home directory on the NFS server when your local disk is full.
- Network transparency: Scan FTP or Samba directories - or whatever else protocols KDE support.
- PacMan animation while directories are being read. OK, this is not exactly essential, but its fun.
Cleaning up
- Predefined cleanup actions: Easily delete a file or a directory tree, move it to the KDE trash bin, compress it to a .tar.bz2 archive or simply open a shell or a Konqueror window there.
- User-defined cleanup actions: Add your own cleanup commands or edit the existing ones.
- "Send mail to owner" report facility: Send a mail requesting the owner of a large directory tree to please clean up unused files.
Misc
- Feedback mail facility: Rate the program and tell the authors your opinion about it.
Whats New in 2.4.4 Release:
- Sparse files and hard links are now properly supported.
Whats New in 2.5.2 Release:
- Can now read and write directory contents from cache files generated by (supplied) Perl script, e.g. in cron job over night
Download (0.30MB)
Added: 2006-01-09 License: GPL (GNU General Public License) Price:
1392 downloads
SchemaSpy 3.1.1
SchemaSpy is a Java-based tool that analyzes the metadata of a schema in a database. more>>
SchemaSpy is a Java-based tool that analyzes the metadata of a schema in a database and generates a visual representation of it in a browser-displayable format. It lets you click through the hierarchy of database tables via child and parent table relationships.
The browsing through relationships can occur though HTML links and/or though the graphical representation of the relationships. Its also designed to help resolve the obtuse errors that a database sometimes gives related to failures due to constraints.
SchemaSpy is free software, distributed under the terms of the Lesser GNU Public License. Your donations are, however, greatly appreciated.
SchemaSpy uses the dot executable from Graphviz to generate graphical representations of the table/view relationships. This was initially added for people who see things visually.
Now the graphical representation of relationships is a fundamental feature of the tool. Graphvis is not required to view the output generated by SchemaSpy, but the dot program should be in your PATH (not CLASSPATH) when running SchemaSpy or none of the graphs will be generated.
Some Linux users have experienced problems with dot version 2.6. Version 2.6 (or higher) is preferred, but if it doesnt work then try 2.2.1. Note that SchemaSpy takes advantage of some dot 2.6+ features so graphs wont be as well formed when using 2.2.1.
SchemaSpy uses JDBCs database metadata extraction services to gather the majority of its information, but has to make vendor-specific SQL queries to gather some information such as the SQL associated with a view and the details of check constraints.
The differences between vendors have been isolated to configuration files and are extremely limited. Almost all of the vendor-specific SQL is optional.
Enhancements:
- This is a bugfix release primarily intended to address the Graphviz 2.9+ changes that broke SchemaSpy.
- It fixes bug 1602135 (an exception using dot version 2.9), bug 1571711 (failure to use a precompiled version of dot on Mac OS X), and bug 1597609 (quoting and Sybase ASE).
<<lessThe browsing through relationships can occur though HTML links and/or though the graphical representation of the relationships. Its also designed to help resolve the obtuse errors that a database sometimes gives related to failures due to constraints.
SchemaSpy is free software, distributed under the terms of the Lesser GNU Public License. Your donations are, however, greatly appreciated.
SchemaSpy uses the dot executable from Graphviz to generate graphical representations of the table/view relationships. This was initially added for people who see things visually.
Now the graphical representation of relationships is a fundamental feature of the tool. Graphvis is not required to view the output generated by SchemaSpy, but the dot program should be in your PATH (not CLASSPATH) when running SchemaSpy or none of the graphs will be generated.
Some Linux users have experienced problems with dot version 2.6. Version 2.6 (or higher) is preferred, but if it doesnt work then try 2.2.1. Note that SchemaSpy takes advantage of some dot 2.6+ features so graphs wont be as well formed when using 2.2.1.
SchemaSpy uses JDBCs database metadata extraction services to gather the majority of its information, but has to make vendor-specific SQL queries to gather some information such as the SQL associated with a view and the details of check constraints.
The differences between vendors have been isolated to configuration files and are extremely limited. Almost all of the vendor-specific SQL is optional.
Enhancements:
- This is a bugfix release primarily intended to address the Graphviz 2.9+ changes that broke SchemaSpy.
- It fixes bug 1602135 (an exception using dot version 2.9), bug 1571711 (failure to use a precompiled version of dot on Mac OS X), and bug 1597609 (quoting and Sybase ASE).
Download (0.12MB)
Added: 2006-12-18 License: LGPL (GNU Lesser General Public License) Price:
611 downloads
AnalyticMath 1.1
AnalyticMath is a FREE, cross-platform mathematics / plotting program. more>>
AnalyticMath is a FREE, cross-platform (Windows, Linux, etc.) mathematics / plotting program with a powerful editor and integrated auto-calc features that will help you develop and visually analyse mathematical expressions quickly and easily.
The program is intuitive, simple to use, and suitable for everyone from students to theoretical physicists.
This new release has many refinements over ver. 1.0 as well as some minor bug fixes.
<<lessThe program is intuitive, simple to use, and suitable for everyone from students to theoretical physicists.
This new release has many refinements over ver. 1.0 as well as some minor bug fixes.
Download (1.6MB)
Added: 2005-05-24 License: GPL (GNU General Public License) Price:
1613 downloads
FinerEdge Calculator 2.8
FinerEdge Calculator project handles all types of loans, bonds, annuities and other investments. more>>
The FinerEdge Calculation Solution is a modern Java, ISO and XML standards-based, customizable financial amortization calculation system designed for financial institutions, financial software vendors, and application service providers. The FinerEdge Calculator is a single source financial calculation solution from the Web to the Desktop to the Mainframe.
FinerEdge Calculator project handles all types of loans, bonds, annuities and other investments using all of the proper calculation methods and terms for each of the different types of cash flows. In addition, new calculation methods and terms can visually be added to FinerEdge Calculator and immediately leveraged across your entire enterprise and web offerings, all without any programming! In turn, this enables the easy creation and servicing of custom, hybrid financial products that keep you ahead of the competition.
<<lessFinerEdge Calculator project handles all types of loans, bonds, annuities and other investments using all of the proper calculation methods and terms for each of the different types of cash flows. In addition, new calculation methods and terms can visually be added to FinerEdge Calculator and immediately leveraged across your entire enterprise and web offerings, all without any programming! In turn, this enables the easy creation and servicing of custom, hybrid financial products that keep you ahead of the competition.
Download (2.3MB)
Added: 2007-04-02 License: Free To Use But Restricted Price:
939 downloads
Oralux 0.7 Alpha
Oralux is an audio GNU/Linux distro for visually impaired persons. more>>
Oralux project hopes to facilitate access to GNU/Linux for the visually impaired.
Firstly, through lowering the barrier by facilitating installation of the necessary software.
At the moment, the current version offers an experienced user a quick way to have GNU/Linux working on a PC.
The Oralux project must go further.
We hope to help and guide the newbie to reach the following initial stages:
- starting with Emacspeak or Yasr
- finding relevant documentation and browsing it,
- receiving and sending emails,
- browsing the web,
- and whatever else might be important to you...
You may want to help us to reach these aims by sharing your skills: advising and giving feedback, supplying configuration files, translating documentation, writing a tutorial and developing the Oralux scripts (shell and php).
Oralux is a Knoppix customization, the self-installing distro created by Klaus Knopper. Knoppix includes, on a single CD, nearly three compressed CDs.
Oralux boots up from the CD, whatever the already installed operating system (Win98, XP,...) may be.
Oralux includes, thanks to BRLTTY, a number of braille drivers.
The Oralux user interface is based on Emacspeak the Audio Desktop created by T. V. Raman. Emacspeak offers a complete and powerful desktop.
Another environment is available based on Yasr, the lightweight and portable screen reader by Mike Gorse.
The CD includes a free English Text-To-Speech software (TTS): Flite (Carnegie Mellon University).
It also includes EFM from Pierre Lorenzon for French and English. EFM is based on Festival (University of Edinburgh) and MBROLA (Thierry Dutoit, Universite de Mons).
Using Festival and MBROLA, implementing other languages might be possible: contributors are welcome!
ParleMax is a speech server in French based on LLiaphon and MBROLA. ParleMax and LLiaphon come from the Biglux team.
Multispeech is a speech server based for Russian on Ru_tts and for the English on freephone and MBROLA. Multispeech can automatically switch from one synthesis to the other. Igor B. Poretsky is the Multispeech and Ru_tts author.
Oralux can install the DECtalk software synthesizer (4.61 or 5.0), a multi language TTS from the Fonix company. This TTS allows Oralux to access the following languages: English or Castillan Spanish, French or German.
Enhancements:
- Major feature enhancements
<<lessFirstly, through lowering the barrier by facilitating installation of the necessary software.
At the moment, the current version offers an experienced user a quick way to have GNU/Linux working on a PC.
The Oralux project must go further.
We hope to help and guide the newbie to reach the following initial stages:
- starting with Emacspeak or Yasr
- finding relevant documentation and browsing it,
- receiving and sending emails,
- browsing the web,
- and whatever else might be important to you...
You may want to help us to reach these aims by sharing your skills: advising and giving feedback, supplying configuration files, translating documentation, writing a tutorial and developing the Oralux scripts (shell and php).
Oralux is a Knoppix customization, the self-installing distro created by Klaus Knopper. Knoppix includes, on a single CD, nearly three compressed CDs.
Oralux boots up from the CD, whatever the already installed operating system (Win98, XP,...) may be.
Oralux includes, thanks to BRLTTY, a number of braille drivers.
The Oralux user interface is based on Emacspeak the Audio Desktop created by T. V. Raman. Emacspeak offers a complete and powerful desktop.
Another environment is available based on Yasr, the lightweight and portable screen reader by Mike Gorse.
The CD includes a free English Text-To-Speech software (TTS): Flite (Carnegie Mellon University).
It also includes EFM from Pierre Lorenzon for French and English. EFM is based on Festival (University of Edinburgh) and MBROLA (Thierry Dutoit, Universite de Mons).
Using Festival and MBROLA, implementing other languages might be possible: contributors are welcome!
ParleMax is a speech server in French based on LLiaphon and MBROLA. ParleMax and LLiaphon come from the Biglux team.
Multispeech is a speech server based for Russian on Ru_tts and for the English on freephone and MBROLA. Multispeech can automatically switch from one synthesis to the other. Igor B. Poretsky is the Multispeech and Ru_tts author.
Oralux can install the DECtalk software synthesizer (4.61 or 5.0), a multi language TTS from the Fonix company. This TTS allows Oralux to access the following languages: English or Castillan Spanish, French or German.
Enhancements:
- Major feature enhancements
Download (495MB)
Added: 2006-05-08 License: GPL (GNU General Public License) Price:
1274 downloads
DSP5600x disassembly library 1.1
DSP5600x disassembly library is a code disassembly library for the Motorola DSP5600x. more>>
lib5600x is a library implementing Motorola DSP5600x disassembler. Its an ANSI C link library that should be useful for people writing debuggers, memory monitors etc for DSP5600x chips.
Usage
1. First you call two initialization functions in the library. This step is mandatory:
make_masks();
make_masks2();
You pass nothing and check for no results -- these functions are guaranteed to succeed.
2. Now you have to allocate memory for a structure that will be used for passing data to/from the library. You may do that on the stack
struct disasm_data dis, *d = &dis;
Yes, the pointer will be useful, too. The disasm_data structure is defined in 5600x_disasm.h file. Lets take a closer look:
#define LINE_SIZE 256
struct disasm_data
{
unsigned char *memory;
char line_buf[LINE_SIZE];
char *line_ptr;
char words;
};
First member -- "memory" -- should point to the opcode you want disassembled. IMPORTANT! The library expects it to be a 24-bit word, so if your assembler creates 32-bit words, youll have to make a simple conversion. Take a look at test.c to see how it is done. Whats more, the library may wish to evaluate two words at a time, so you have to account for that -- this is also demonstrated in the example source.
3. After properly setting up disasm_data struct (i.e. "memory" pointer), you call following function:
int disassemble_opcode(struct disasm_data *);
This function takes pointer to the struct youve just prepared as an argument. When it returns, disasm_data structs "line_buf" member contains the disassembled opcode as a string of ASCII characters. "line_ptr" should be of no interest to you (it is merely a internal variable) and "words" holds the number of 24-bit words you should advance your memory pointer by. This variable is also available as a return value of above function. Again, I
shall refer you to the example source.
4. Repeat step 3 until you run out of code to disassemble.
Testing
First, check out the makefile and make sure it contains proper flags and defines for your architecture. Big endian users should add -DBIGENDIAN to CFLAGS (Id appreciate if someone created Autoconf script to avoid such tricks). Following that, type
make
./test example_dsp_binary
and compare the output (visually) with example.a56 which is a source code I used to create example_dsp_binary and which contains all instructions and addressing modes described in DSP56000/DSP56001 Digital Signal Processor Users Manual. You can also diff your output and supplied example.out file to check if there are any differences (there should be none).
<<lessUsage
1. First you call two initialization functions in the library. This step is mandatory:
make_masks();
make_masks2();
You pass nothing and check for no results -- these functions are guaranteed to succeed.
2. Now you have to allocate memory for a structure that will be used for passing data to/from the library. You may do that on the stack
struct disasm_data dis, *d = &dis;
Yes, the pointer will be useful, too. The disasm_data structure is defined in 5600x_disasm.h file. Lets take a closer look:
#define LINE_SIZE 256
struct disasm_data
{
unsigned char *memory;
char line_buf[LINE_SIZE];
char *line_ptr;
char words;
};
First member -- "memory" -- should point to the opcode you want disassembled. IMPORTANT! The library expects it to be a 24-bit word, so if your assembler creates 32-bit words, youll have to make a simple conversion. Take a look at test.c to see how it is done. Whats more, the library may wish to evaluate two words at a time, so you have to account for that -- this is also demonstrated in the example source.
3. After properly setting up disasm_data struct (i.e. "memory" pointer), you call following function:
int disassemble_opcode(struct disasm_data *);
This function takes pointer to the struct youve just prepared as an argument. When it returns, disasm_data structs "line_buf" member contains the disassembled opcode as a string of ASCII characters. "line_ptr" should be of no interest to you (it is merely a internal variable) and "words" holds the number of 24-bit words you should advance your memory pointer by. This variable is also available as a return value of above function. Again, I
shall refer you to the example source.
4. Repeat step 3 until you run out of code to disassemble.
Testing
First, check out the makefile and make sure it contains proper flags and defines for your architecture. Big endian users should add -DBIGENDIAN to CFLAGS (Id appreciate if someone created Autoconf script to avoid such tricks). Following that, type
make
./test example_dsp_binary
and compare the output (visually) with example.a56 which is a source code I used to create example_dsp_binary and which contains all instructions and addressing modes described in DSP56000/DSP56001 Digital Signal Processor Users Manual. You can also diff your output and supplied example.out file to check if there are any differences (there should be none).
Download (0.012MB)
Added: 2005-03-07 License: BSD License Price:
1693 downloads
Quanta Plus 3.5.7
Quanta is a web editor for KDE supporting HTML and more. more>>
Quanta Plus is a highly stable and feature rich web development environment. Quantas vision has always been to start with the best architectural foundations, design for efficient and natural use and enable maximal user extensibility.
We recognize that we dont have the resources to do everything we would like to so our target is to make it easy for you to help make this the best community based desktop application anywhere. Pretty much everything in Quanta is designed so you can extend it.
Even the way it handles XML DTDs is based on XML files you can edit. You can even import DTDs, write scripts to manage editor contents, visually create dialogs for your scripts and assign script actions to nearly any file operation in a project. You can even look at and communicate with a wide range of what happens inside Quanta using DCOP.
Quanta is based on KDE so this means it is network transparent from any dialog or project. It can use not only FTP but other KDE KIO slaves from file dialogs or in project settings. For instance if you want secure access try the fish KIO slave that uses SSH.
Just enter fish://[user]@domain in any dialog or select fish in your project settings. Here on this site you will find information on using Kommander to visually build dialogs you can extend Quanta with. These applications talk to each other using an IPC (Inter Process Communication) called DCOP (DEsktop Communication Protocol).
Of course I realize this can sound like alphabet soup techno-babble to some web developers, but heres what it means. When you are using Quanta and realize you would like to do something and you want to ask "Can I do this?" you can expect the answer will not only be yes, but it will probably be even cooler than you hoped for.
Not included on this site are other tools you can use with Quanta for revision control and reviewing and merging changes in files. Those applications are Cervisia and Kompare, and if they are not installed and you install them Quanta will use them.
We would like to think that there are rich rewards to be found here for those willing to explore new ways of doing things, or perhaps in some cases old ways that are just new to you.
<<lessWe recognize that we dont have the resources to do everything we would like to so our target is to make it easy for you to help make this the best community based desktop application anywhere. Pretty much everything in Quanta is designed so you can extend it.
Even the way it handles XML DTDs is based on XML files you can edit. You can even import DTDs, write scripts to manage editor contents, visually create dialogs for your scripts and assign script actions to nearly any file operation in a project. You can even look at and communicate with a wide range of what happens inside Quanta using DCOP.
Quanta is based on KDE so this means it is network transparent from any dialog or project. It can use not only FTP but other KDE KIO slaves from file dialogs or in project settings. For instance if you want secure access try the fish KIO slave that uses SSH.
Just enter fish://[user]@domain in any dialog or select fish in your project settings. Here on this site you will find information on using Kommander to visually build dialogs you can extend Quanta with. These applications talk to each other using an IPC (Inter Process Communication) called DCOP (DEsktop Communication Protocol).
Of course I realize this can sound like alphabet soup techno-babble to some web developers, but heres what it means. When you are using Quanta and realize you would like to do something and you want to ask "Can I do this?" you can expect the answer will not only be yes, but it will probably be even cooler than you hoped for.
Not included on this site are other tools you can use with Quanta for revision control and reviewing and merging changes in files. Those applications are Cervisia and Kompare, and if they are not installed and you install them Quanta will use them.
We would like to think that there are rich rewards to be found here for those willing to explore new ways of doing things, or perhaps in some cases old ways that are just new to you.
Download (5.8MB)
Added: 2007-05-22 License: GPL (GNU General Public License) Price:
943 downloads
Gcalctool 5.19.90
Gcalctool is the default GNOME desktop calculator. more>>
Gcalctool is the default GNOME desktop calculator.
Gcalctool has Basic, Financial and Scientific modes. Internally it uses multiple precision arithmetic to produce results to a high degree of accuracy.
Calctool is a desktop calculator. It has been designed to be used with either the mouse or the keyboard. It is visually similar to a lot of hand-held calculators. There are financial, logical and scientific modes. Similar operations are color coded. Some of the calculator keys have menu marks. This indicates that there is a menu associated with that key.
One of the most important things to remember about calctool is that calculations are performed from left to right, with no arithmetic precedence. If you need arithmetic precedence, then you should use parentheses.
Internal arithmetic is now done with multi-precision floating point numbers. Accuracy can be adjusted from zero to nine numeric places in fixed notation, but numbers can be displayed in engineering and scientific notation as well. The calculator reverts to scientific notation when the number is larger than the display would allow in fixed notation. The base of operation can be changed between binary, octal, decimal and hexadecimal. Numbers are initially displayed in fixed notation to two numeric places, in the decimal base.
There are ten memory registers. Numbers can be stored or retrieved in these locations, and arithmetic can be performed upon register contents.
The display windows contains the current numerical value plus the current base and trigonometric type. There are also indicators which show if the hyperbolic and inverse function switches are set, and which numerical mode is currently in operation. If an operation needing more than one numerical input is partially complete, the operation is also displayed in this window as a reminder.
<<lessGcalctool has Basic, Financial and Scientific modes. Internally it uses multiple precision arithmetic to produce results to a high degree of accuracy.
Calctool is a desktop calculator. It has been designed to be used with either the mouse or the keyboard. It is visually similar to a lot of hand-held calculators. There are financial, logical and scientific modes. Similar operations are color coded. Some of the calculator keys have menu marks. This indicates that there is a menu associated with that key.
One of the most important things to remember about calctool is that calculations are performed from left to right, with no arithmetic precedence. If you need arithmetic precedence, then you should use parentheses.
Internal arithmetic is now done with multi-precision floating point numbers. Accuracy can be adjusted from zero to nine numeric places in fixed notation, but numbers can be displayed in engineering and scientific notation as well. The calculator reverts to scientific notation when the number is larger than the display would allow in fixed notation. The base of operation can be changed between binary, octal, decimal and hexadecimal. Numbers are initially displayed in fixed notation to two numeric places, in the decimal base.
There are ten memory registers. Numbers can be stored or retrieved in these locations, and arithmetic can be performed upon register contents.
The display windows contains the current numerical value plus the current base and trigonometric type. There are also indicators which show if the hyperbolic and inverse function switches are set, and which numerical mode is currently in operation. If an operation needing more than one numerical input is partially complete, the operation is also displayed in this window as a reminder.
Download (1.7MB)
Added: 2007-08-13 License: GPL (GNU General Public License) Price:
810 downloads
Tree::Binary 0.07
Tree::Binary is a Object Oriented Binary Tree for Perl. more>>
Tree::Binary is a Object Oriented Binary Tree for Perl.
SYNOPSIS
use Tree::Binary;
# a tree representaion of the expression:
# ((2 + 2) * (4 + 5))
my $btree = Tree::Binary->new("*")
->setLeft(
Tree::Binary->new("+")
->setLeft(Tree::Binary->new("2"))
->setRight(Tree::Binary->new("2"))
)
->setRight(
Tree::Binary->new("+")
->setLeft(Tree::Binary->new("4"))
->setRight(Tree::Binary->new("5"))
);
# Or shown visually:
# +---(*)---+
# | |
# +-(+)-+ +-(+)-+
# | | | |
# (2) (2) (4) (5)
# get a InOrder visitor
my $visitor = Tree::Binary::Visitor::InOrderTraversal->new();
$btree->accept($visitor);
# print the expression in infix order
print $visitor->getAccumulation(); # prints "2 + 2 * 4 + 5"
# get a PreOrder visitor
my $visitor = Tree::Binary::Visitor::PreOrderTraversal->new();
$btree->accept($visitor);
# print the expression in prefix order
print $visitor->getAccumulation(); # prints "* + 2 2 + 4 5"
# get a PostOrder visitor
my $visitor = Tree::Binary::Visitor::PostOrderTraversal->new();
$btree->accept($visitor);
# print the expression in postfix order
print $visitor->getAccumulation(); # prints "2 2 + 4 5 + *"
# get a Breadth First visitor
my $visitor = Tree::Binary::Visitor::BreadthFirstTraversal->new();
$btree->accept($visitor);
# print the expression in breadth first order
print $visitor->getAccumulation(); # prints "* + + 2 2 4 5"
# be sure to clean up all circular references
$btree->DESTROY();
This module is a fully object oriented implementation of a binary tree. Binary trees are a specialized type of tree which has only two possible branches, a left branch and a right branch. While it is possible to use an n-ary tree, like Tree::Simple, to fill most of your binary tree needs, a true binary tree object is just easier to mantain and use.
Binary Tree objects are especially useful (to me anyway) when building parse trees of things like mathematical or boolean expressions. They can also be used in games for such things as descisions trees. Binary trees are a well studied data structure and there is a wealth of information on the web about them.
This module uses exceptions and a minimal Design By Contract style. All method arguments are required unless specified in the documentation, if a required argument is not defined an exception will usually be thrown. Many arguments are also required to be of a specific type, for instance the $tree argument to both the setLeft and setRight methods, must be a Tree::Binary object or an object derived from Tree::Binary, otherwise an exception is thrown. This may seems harsh to some, but this allows me to have the confidence that my code works as I intend, and for you to enjoy the same level of confidence when using this module. Note however that this module does not use any Exception or Error module, the exceptions are just strings thrown with die.
This object uses a number of methods copied from another module of mine, Tree::Simple. Users of that module will find many similar methods and behaviors. However, it did not make sense for Tree::Binary to be derived from Tree::Simple, as there are a number of methods in Tree::Simple that just wouldnt make sense in Tree::Binary. So, while I normally do not approve of cut-and-paste code reuse, it was what made the most sense in this case.
<<lessSYNOPSIS
use Tree::Binary;
# a tree representaion of the expression:
# ((2 + 2) * (4 + 5))
my $btree = Tree::Binary->new("*")
->setLeft(
Tree::Binary->new("+")
->setLeft(Tree::Binary->new("2"))
->setRight(Tree::Binary->new("2"))
)
->setRight(
Tree::Binary->new("+")
->setLeft(Tree::Binary->new("4"))
->setRight(Tree::Binary->new("5"))
);
# Or shown visually:
# +---(*)---+
# | |
# +-(+)-+ +-(+)-+
# | | | |
# (2) (2) (4) (5)
# get a InOrder visitor
my $visitor = Tree::Binary::Visitor::InOrderTraversal->new();
$btree->accept($visitor);
# print the expression in infix order
print $visitor->getAccumulation(); # prints "2 + 2 * 4 + 5"
# get a PreOrder visitor
my $visitor = Tree::Binary::Visitor::PreOrderTraversal->new();
$btree->accept($visitor);
# print the expression in prefix order
print $visitor->getAccumulation(); # prints "* + 2 2 + 4 5"
# get a PostOrder visitor
my $visitor = Tree::Binary::Visitor::PostOrderTraversal->new();
$btree->accept($visitor);
# print the expression in postfix order
print $visitor->getAccumulation(); # prints "2 2 + 4 5 + *"
# get a Breadth First visitor
my $visitor = Tree::Binary::Visitor::BreadthFirstTraversal->new();
$btree->accept($visitor);
# print the expression in breadth first order
print $visitor->getAccumulation(); # prints "* + + 2 2 4 5"
# be sure to clean up all circular references
$btree->DESTROY();
This module is a fully object oriented implementation of a binary tree. Binary trees are a specialized type of tree which has only two possible branches, a left branch and a right branch. While it is possible to use an n-ary tree, like Tree::Simple, to fill most of your binary tree needs, a true binary tree object is just easier to mantain and use.
Binary Tree objects are especially useful (to me anyway) when building parse trees of things like mathematical or boolean expressions. They can also be used in games for such things as descisions trees. Binary trees are a well studied data structure and there is a wealth of information on the web about them.
This module uses exceptions and a minimal Design By Contract style. All method arguments are required unless specified in the documentation, if a required argument is not defined an exception will usually be thrown. Many arguments are also required to be of a specific type, for instance the $tree argument to both the setLeft and setRight methods, must be a Tree::Binary object or an object derived from Tree::Binary, otherwise an exception is thrown. This may seems harsh to some, but this allows me to have the confidence that my code works as I intend, and for you to enjoy the same level of confidence when using this module. Note however that this module does not use any Exception or Error module, the exceptions are just strings thrown with die.
This object uses a number of methods copied from another module of mine, Tree::Simple. Users of that module will find many similar methods and behaviors. However, it did not make sense for Tree::Binary to be derived from Tree::Simple, as there are a number of methods in Tree::Simple that just wouldnt make sense in Tree::Binary. So, while I normally do not approve of cut-and-paste code reuse, it was what made the most sense in this case.
Download (0.027MB)
Added: 2006-10-14 License: Perl Artistic License Price:
1108 downloads
Wmbattery
Wmbattery displays the status of your laptops battery in a small icon. more>>
Wmbattery displays the status of your laptops battery in a small icon. This includes if it is plugged in, if the battery is charging, how many minutes of battery life remain, battery life remaining (with both a percentage and a graph), and battery status (high - green, low - yellow, or critical - red).
Theres nothing in the program that makes it require WindowMaker, except maybe the look. It can be docked in WindowMaker or Aftersteps dock.
Wmbattery is based heavily on wmapm by Chris D. Faulhaber.
Enhancements:
- Improved icon layout. I crammed the same information into less space while making the icon more elegant and visually pleasing (IMHO).
- Easier to drag onto dock.
- It consumes a little less memory.
- Uses only 10 colors.
- ACPI support, including multiple battery support and battery charging completion countdown timer.
- Support for getting battery status from the sonypi driver instead of APM, for some Sony laptops that do not have apm support.
- Can make its own estimatess of time remaining or time until full charge, even if APM does not.
<<lessTheres nothing in the program that makes it require WindowMaker, except maybe the look. It can be docked in WindowMaker or Aftersteps dock.
Wmbattery is based heavily on wmapm by Chris D. Faulhaber.
Enhancements:
- Improved icon layout. I crammed the same information into less space while making the icon more elegant and visually pleasing (IMHO).
- Easier to drag onto dock.
- It consumes a little less memory.
- Uses only 10 colors.
- ACPI support, including multiple battery support and battery charging completion countdown timer.
- Support for getting battery status from the sonypi driver instead of APM, for some Sony laptops that do not have apm support.
- Can make its own estimatess of time remaining or time until full charge, even if APM does not.
Download (0.060MB)
Added: 2006-11-01 License: GPL (GNU General Public License) Price:
1096 downloads
Tvark 0.4
Tvark is a network monitoring tool (sniffer) with a GUI front-end, and is tied to a MySQL database. more>>
Tvark is a network monitoring tool (sniffer) with a GUI front-end, and is tied to a MySQL database. Tvark is necessarily resource-intensive. It is a multithreaded, database utility for recording network traffic. As a consequence, it uses 100% of the CPU simply because of context-switching and packet handling. Additionally, using the database with Tvark on a high traffic network will generate a great deal of stored data quite rapidly, hence filtering options.
The database is set to record traffic based on the filtering options selected in the GUI. This will change in a future release so that database population will have its own filtering options without having to run the GUI.
What we are looking to provide is a forensic tool that meets two needs. First, an admin should be able to get a feel for traffic on the network by running the GUI, and be able to determine traffic of interest quickly and visually. Second, a simple database of traffic information allows us, and anyone else, to build forensic modules that display traffic information in a customized (and thereby useful) way.
Enhancements:
- Rename MIN/MAX to avoid name conflicts.
- Avoid creating mutex before pthread_create to make some libcs happy.
<<lessThe database is set to record traffic based on the filtering options selected in the GUI. This will change in a future release so that database population will have its own filtering options without having to run the GUI.
What we are looking to provide is a forensic tool that meets two needs. First, an admin should be able to get a feel for traffic on the network by running the GUI, and be able to determine traffic of interest quickly and visually. Second, a simple database of traffic information allows us, and anyone else, to build forensic modules that display traffic information in a customized (and thereby useful) way.
Enhancements:
- Rename MIN/MAX to avoid name conflicts.
- Avoid creating mutex before pthread_create to make some libcs happy.
Download (0.044MB)
Added: 2006-06-29 License: BSD License Price:
1216 downloads
Derbrill Tutorials
Derbrill Tutorials are Free Tutorials For Writing Games and Multimedia Applications in Runtime Revolution with ArcadeEngine. more>>
Derbrill Tutorials are Free Tutorials For Writing Games and Multimedia Applications in Runtime Revolution with ArcadeEngine.
The tutorials come in a visually appealing e-book format which is both easy to read and use, the range of topics covered includes:
* The basics of Revolution such as: stacks, cards, scripts, messages and timers
* How to use geometric properties such as distances, angles and intersection rectangles
* Understanding and using different movements including linear, polygonal, circular and elliptic
* Advanced use of images
* Using the built-in collision detection
<<lessThe tutorials come in a visually appealing e-book format which is both easy to read and use, the range of topics covered includes:
* The basics of Revolution such as: stacks, cards, scripts, messages and timers
* How to use geometric properties such as distances, angles and intersection rectangles
* Understanding and using different movements including linear, polygonal, circular and elliptic
* Advanced use of images
* Using the built-in collision detection
Download (4.2MB)
Added: 2005-10-17 License: Freeware Price:
1470 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 visually 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