This program is six tools in one. It creates a new HTML document template, automates most of the tasks involved in converting a text file (which may consist of program code) to a decent-looking HTML document, converts data in a text file to an HTML list or table, and creates the HTML code for tables, with the possibility of specifying cells larger than 1 row by 1 column and of entering text into the table cells.
|
متطلبات البرنامج :
A video resolution of 800x600 or better.
|
|
| |
|
تقييم و آراء الزوار |
|
|
لا يوجد
|
| |
| برامج لنفس المطور
|
| |
Easy Email Encryption
Easy Email Encryption is for sending and receiving encrypted email messages (optionally with attached files up to 100 KB), and is designed to be both secure and easy to use. It works with any email program including Outlook Express. It uses a symmetric key method, and keys are maintained in an encrypted list of keys for easy access. It is bilingual, English/German, and works with text in languages other than English.
|
| |
Hermetic Word Frequency Counter Advanced
This software scans a text file, multiple files or text on the clipboard, and counts the number of occurrences of the different words. The text can be non-English. The words which are found and displayed can be ordered alphabetically or by frequency. There is no limit on the size of an input file. The manner in which words are counted can be customized. Can be used with XML files. Results can be written to a file.
|
| |
Hermetic Stego
Hermetic Stego is a a steganography program which allows you to encrypt and hide a file of any size in one or more BMP image files, with or without the use of a stego/encryption key, so that the presence of the hidden file is undetectable , even by forensic software using statistical methods and if a user-specified stego key is used then the hidden file can be extracted only by someone, using this software, who knows that stego key.
|
| |
Hermetic Word Frequency Counter
This software scans a file, or text on the clipboard, and counts the number of occurrences of the different words. The text can be in a language other than English and can be a program code. The words which are found and displayed can be ordered alphabetically or by frequency. There is no limit on the size of an input file. The manner in which words are counted can be customized. Can be used with XML files. Results can be written to a file.
|
| |
Data Destroyer
A program for secure file deletion and disk wipe which destroys (or purges, by overwriting) data in files on floppy, ZIP or hard disk so that the data cannot be recovered. A single file can be purged or, in batch mode, multiple files (in multiple folders) can be purged in one operation. Allows user-specifiable type of purge. Purge speed can be tested for accurate estimation of purge times.
|
| |
Hermetic File Search - Search Module
Hermetic File Search is for indexing and searching HTML files, text files or similar on CD, a hard disk, etc. It consists of an index module and a search module. The index module indexes every word in every file, and any file containing a particular set of words (or any of those words, or an exact phrase) can be found in seconds by the search module. The results can be displayed in a web browser with hotlinks to the files files found.
|
| |
Keywords Meta Tag Generator
This program scans an HTML file, counting the number of occurrences of words and how they are used, and produces a keywords meta tag for the document. It ignores common words such as 'this', and the resulting meta tag depends on weights that you assign to boldface words, etc. It can be used with documents which use cascading style sheets or which have lots of embedded javascript, and it works with non-English text such as Spanish.
|
| |
Factorizer
Factorizer may be used: (1) to get the prime decomposition of all numbers in a range of numbers, (2) to get all factors of a single number or all factors of all numbers in a range, (3) to find only the prime numbers in a range of numbers, (4) to find pairs of prime numbers in a certain range, (5) to count (without displaying) the prime numbers in a range of numbers and (6) to find Fermat and Mersenne primes less than 2,147,483,647.
|
|
|
