Ports 搜索

共有792项符合/math/的查询结果,以下是第781790项(搜索用时0.002秒)
mail/mutt-1.4.2.3 (Score: 0.02068723)
The Mongrel of Mailers (part Elm, Pine, Mush, mh, etc.)
Mutt -- "The Mongrel of Mail User Agents" (part Elm, part Pine, part mh, part slrn, part everything else) is an interactive screen-oriented mailer program that supersedes Elm, Pine, mail and mailx. Features include color support, message threading, MIME support (including RFC1522 support for encoded headers), customizable key bindings, POP3, Delivery Status Notification (DSN) support, and PGP/MIME. Mutt User Information: http://www.math.fu-berlin.de/~guckes/mutt/ -- David (obrien@cs.ucdavis.edu)
security/Crypt-Random-Seed-0.03 (Score: 0.02068723)
Simple method to get strong randomness
Crypt::Random::Seed is a simple mechanism to get strong randomness. The main purpose of this module is to provide a simple way to generate a seed for a PRNG such as Math::Random::ISAAC, for use in cryptographic key generation, or as the seed for an upstream module such as Bytes::Random::Secure. Flags for requiring non-blocking sources are allowed, as well as a very simple method for plugging in a source.
textproc/LaTeX-TOM-1.03 (Score: 0.02068723)
Perl module for parsing, analyzing, and manipulating LaTeX documents
This module provides a parser which parses and interprets (though not fully) LaTeX documents and returns a tree-based representation of what it finds. This tree is a LaTeX::TOM::Tree. The tree contains LaTeX::TOM::Node nodes. This module should be especially useful to anyone who wants to do processing of LaTeX documents that requires extraction of plain-text information, or altering of the plain-text components (or alternatively, the math-text components).
devel/asl-1.41r8 (Score: 0.017731912)
Assembler for a variety of microcontrollers/-processors
ASL can generate code for totally different processors. These are implemented: Motorola 68000..68030,683xx including math co-processor and MMU; DSP56000; Motorola/IBM MPC601/MPC505/PPC403; 6800, 6805, 6809, 68(HC)11 and Hitachi 6301 Hitachi 6309, H8 and SH7000/7600 Rockwell 6502 and 65(S)C02 CMD 65816 Mitsubishi MELPS-740; MELPS-7700; MELPS-4500 and M16 Intel MCS-48/41, MCS-51, MCS-96 and 8080/8085 AMD 29K Siemens 80C166/167 Zilog Z80, Z180, Z380 and Z8 Toshiba TLCS-900(L), TLCS-90, TLCS-870, TLCS-47 and TLCS-9000 Microchip PIC16C54..16C57, PIC16C84/PIC16C64 and PIC17C42 SGS-Thomson ST62xx and 6804 Texas Instruments TMS32010/32015, TMS3202x, TMS320C3x and TMS370xxx NEC uPD 78(C)1x and uPD 75xxx (a.k.a. 75K0)
security/openssl-0.9.4 (Score: 0.017731912)
Toolkit for Encryption, Signatures and Certificates Based on OpenSSL
Bindings to OpenSSL libssl and libcrypto, plus custom SSH pubkey parsers. Supports RSA, DSA and NIST curves P-256, P-384 and P-521. Cryptographic signatures can either be created and verified manually or via x509 certificates. AES block cipher is used in CBC mode for symmetric encryption; RSA for asymmetric (public key) encryption. High-level envelope functions combine RSA and AES for encrypting arbitrary sized data. Other utilities include key generators, hash functions (md5, sha1, sha256, etc), base64 encoder, a secure random number generator, and 'bignum' math methods for manually performing crypto calculations on large multibyte integers.
security/Bytes-Random-Secure-0.29 (Score: 0.016717806)
Generate cryptographically-secure random bytes
Bytes::Random::Secure provides two interfaces for obtaining crypto-quality random bytes. The simple interface is built around plain functions. For greater control over the Random Number Generator's seeding, there is an Object Oriented interface that provides much more flexibility. The "functions" interface provides functions that can be used any time you need a string of a specific number of random bytes. The random bytes are available as simple strings, or as hex-digits, Quoted Printable, or MIME Base64. There are equivalent methods available from the OO interface, plus a few others. This module can be a drop-in replacement for Bytes::Random, with the primary enhancement of using a cryptographic-quality random number generator to create the random data. The random_bytes function emulates the user interface of Bytes::Random's function by the same name. But with Bytes::Random::Secure the random number generator comes from Math::Random::ISAAC, and is suitable for cryptographic purposes. The harder problem to solve is how to seed the generator. This module uses Crypt::Random::Seed to generate the initial seeds for Math::Random::ISAAC.
devel/PV-1.5 (Score: 0.014776593)
Perl5 library for text-mode user interface widgets
INTRO ===== I needed a basic text-mode GUI framework to implement some nice-looking proggies on Linux. Didn't find any around, so necessity became the mother of PerlVision. And this beast kept growing as I made love to Perl, so now it's far from 'basic'. Provides 90% of the features you'd want for a user interface, including check boxes, radio buttons, three different styles (!) of pushbuttons, single and multiple selection list boxes, an extensible edit box that does auto-wrapping, a scrollable viewbox, single line text entry fields, a menu bar with pulldown menus, and full pop-up dialog boxes with multiple controls. This version of PerlVision uses Will Setzer's Curses.pm dynaload module for Perl, so you need to get and compile that first, from ftp://ftp.ncsu.edu/pub/math/wsetzer/cursperl<whatever>. PerlVision will only work with Perl 5+ of-course (upgrade || die()!).
devel/pragmarcs-20160904 (Score: 0.014776593)
PragmAda Reusable Components
PragmAda Reusable Components (PragmARCs) from PragmAda S/W Engineering Provides basic to high-level reusable components to reduce requirements to write new code by 50%. An non-comprehensive component list: * ANSI TTY control * Assertion handler * Assignment * Unbounded bags * Binary searcher * Binary semaphores * Regex matcher * Complex numbers * Date handler * Card deck handler * Concurrent forwarder * Genetic algorithm * New getline * fast string hashing * Extended num. images * Signed int. images * Least squares fitting * Linear eq. solver * Bounded lists * Unbounded lists * Extended maths * GCD/LCM Int. functs * Generic math functs * Matrix maths * Text menu handler * Min/Max functions * Mix case converter * Concurrent monitor * Postfix calculator * Protected options * Bounded queues * Blocking queues * Quick searcher * Generic Regex * REM neural network * Safe pointers * Safe suspension * Safe semaphores * Discrete operations * Skip lists * Generic heap sort * Generic insert sort * Quick in-place sort * Generic radix sort * General stacks * 3-way comparisons * Random Num. generator * and more!
lang/kturtle-4.14.3 (Score: 0.014776593)
Educational programming environment for KDE 4
KTurtle is an educational programming environment for KDE. KTurtle aims to make programming as easy and touchable as possible, and therefore can be used to teach kids the basics of math, geometry and... programming. The programming language used in KTurtle is loosely based on Logo. KTurtle allows, just like some implementations of Logo, to translate the programming language (the commands, the documentation and the error messages) to the native language of the programmer. Translating the programming language to the native language of the programmer is one of the many ways KTurtle tries to make learning to programming more simple. Other features to help to achieve this goal are: intuitive syntax highlighting, simple error messages, integrated canvas to make drawings on, integrated help function, slow-motion or step execution, and more.
security/Crypt-Primes-0.50 (Score: 0.014776593)
Provable Prime Number Generator suitable for Cryptographic Applications
This module implements Ueli Maurer's algorithm for generating large provable primes and secure parameters for public-key cryptosystems. The generated primes are almost uniformly distributed over the set of primes of the specified bitsize and expected time for generation is less than the time required for generating a pseudo-prime of the same size with Miller-Rabin tests. Detailed description and running time analysis of the algorithm can be found in Maurer's paper[1]. Crypt::Primes is a pure perl implementation. It uses Math::Pari for multiple precision integer arithmetic and number theoretic functions. Random numbers are gathered with Crypt::Random, a perl interface to /dev/u?random devices found on modern Unix operating systems.