Ports 搜索

Math::Sequence defines a class for simple mathematic sequences with a recursive definition such as x_(n+1) = 1 / (x_n + 1). Creation of a Math::Sequence object is described below in the paragraph about the constructor. Math::Sequence uses Math::Symbolic to parse and modify the recursive sequence definitions. That means you specify the sequence as a string which is parsed by Math::Symbolic. Alternatively, you can pass the constructor a Math::Symbolic tree directly. Because Math::Sequence uses Math::Symbolic for its implementation, all results will be Math::Symbolic objects which may contain other variables than the sequence variable itself. Each Math::Sequence object is an iterator to iterate over the elements of the sequence starting at the first element (which was specified by the starting element, the second argument to the new() constructor). It offers facilities to cache all calculated elements and access any element directly, though unless the element has been cached in a previous calculation, this is just a shortcut for repeated use of the iterator.

Math::Series defines a class for simple mathematic series with a recursive definition such as x_(n+1) = 1 / (x_n + 1). Such a recursive definition is treated as a sequence whose elements will be added to form a series. You can refer to the previous sequence element as well as to the current index in the series. Creation of a Math::Series object is described below in the paragraph about the constructor. Math::Series uses Math::Symbolic to parse and modify the recursive sequence definitions. That means you specify the sequence as a string which is parsed by Math::Symbolic. Alternatively, you can pass the constructor a Math::Symbolic tree directly. Because Math::Series uses Math::Symbolic for its implementation, all results will be Math::Symbolic objects which may contain other variables than the sequence variable and the iterator variable. Each Math::Series object is an iterator to iterate over the elements of the series starting at the first element (which was specified by the starting element, the second argument to the new() constructor). It offers facilities to cache all calculated elements and access any element directly, though unless the element has been cached in a previous calculation, this is just a shortcut for repeated use of the iterator.

SNNS (Stuttgart Neural Network Simulator) is a software simulator for neural networks on Unix workstations developed at the Institute for Parallel and Distributed High Performance Systems (IPVR) at the University of Stuttgart. The goal of the SNNS project is to create an efficient and flexible simulation environment for research on and application of neural nets. The SNNS simulator consists of two main components: 1) simulator kernel written in C 2) graphical user interface under X The simulator kernel operates on the internal network data structures of the neural nets and performs all operations of learning and recall. It can also be used without the other parts as a C program embedded in custom applications. It supports arbitrary network topologies and the concept of sites. SNNS can be extended by the user with user defined activation functions, output functions, site functions and learning procedures, which are written as simple C programs and linked to the simulator kernel. The graphical user interface XGUI (X Graphical User Interface), built on top of the kernel, gives a 2D and a 3D graphical representation of the neural networks and controls the kernel during the simulation run. In addition, the 2D user interface has an integrated network editor which can be used to directly create, manipulate and visualize neural nets in various ways.

XMakemol is a program written for UN*X operating systems in ANSI C using the X, Xt and Motif libraries. It can be used to view and manipulate atomic and molecular data given in xyz format. XMakemol is a mouse-based application and many features can be accessed by clicking or dragging the mouse on the main window. Additional popup dialogs offer a number of additional features. Here is what an XMakemol session might look like. The system is a bucky ball and the Measure dialog is showing the measurement of bond-lengths, angles and a torsion angle. XMakemol can produce output in PostScript (black and white or colour)and in xpm format (which can be translated to gif format using xpmtoppm and ppmtogif). XMakemol can also produce a series of xpm files which can be translated into an animated gif file using the bundled utility xmake_anim.pl (formerly gmake_anim.pl). The one above is an animation of the "viagra" molecule (sidenafil).

This is the last version that handles both the 8.x and 9.x install media formats. Qjail [ q = quick ] is a 4th generation wrapper for the basic chroot jail system that includes security and performance enhancements. Plus a new level of "user friendliness" enhancements dealing with deploying just a few jails or large jail environments consisting of 100's of jails. Qjail requires no knowledge of the jail command usage. It uses "nullfs" for read-only system binaries, sharing one copy of them with all the jails. Uses "mdconfig" to create sparse image jails. Sparse image jails provide a method to limit the total disk space a jail can consume, while only occupying the physical disk space of the sum size of the files in the image jail. Ability to assign ip address with their network device name, so aliases are auto created on jail start and auto removed on jail stop. Ability to create "ZONE"s of identical qjail systems, each with their own group of jails. Ability to designate a portion of the jail name as a group prefix so the command being executed will apply to only those jail names matching that prefix.

Writing RESTful apps is a good thing, but if you're also trying to support web browsers, you're probably going to need some hackish workarounds. This module provides one such workaround for your Plack applications. Specifically, you can also use a header named X-HTTP-Method-Override (as used by Google for its APIs) override the POST request method. Or you can add a parameter named x-tunneled-method to your form action's query. Either way, the overriding works only via POST requests, not GET. If either of these attributes are available in a POST request, the REQUEST_METHOD key of the Plack environment hash will be replaced with its value. This allows your apps to override any HTTP method over POST. If your application needs to know that such overriding has taken place, the original method is stored under the plack.original_request_method key in the Plack environment hash. The list of methods you can specify are: GET, POST, HEAD, PUT, DELETE, OPTIONS, TRACE and CONNECT.

A suite of tools for visualising sequence alignments. Blixem is an interactive browser of pairwise alignments that have been stacked up in a "master-slave" multiple alignment; it is not a 'true' multiple alignment but a 'one-to-many' alignment. Belvu is a multiple sequence alignment viewer and phylogenetic tool. It has an extensive set of user-configurable modes to color residues by conservation or by residue type, and some basic alignment editing capabilities. Dotter is a graphical dot-matrix program for detailed comparison of two sequences. Every residue in one sequence is compared to every residue in the other, with one sequence plotted on the x-axis and the other on the y-axis.

viewfax displays one or more fax files in an X11 window. The input files may be either raw, single-page faxes received by a fax modem with a program such as mgetty, or tiff files such as those used by hylafax. The first (or only) page of "PC-Research"-style (DigiFAX) files produced by the ghostscript dfaxhigh or dfaxlow drivers can also be displayed. Input files using any common fax encoding such as group 3 (1 and 2 dimensional) and group 4 can be displayed. The fax images are rendered at full resolution and then successively scaled down by a linear factor of 2 prior to display, until they fit on the screen. The display can be controlled interactively using mouse and keyboard commands.

Charm is a program for OS X, Linux and Windows that helps to keep track of time. It is built around two major ideas - tasks and events. Tasks are the things time is spend on, repeatedly. For example, ironing laundry is a task. The laundry done for two hours on last Tuesday is an event in that task. When doing laundry multiple times, the events will be accumulated, and can later be printed in activity reports or weekly time sheets. So in case laundry would be done for three hours on Wednesday again, the activity report for the "Ironing Laundry" task would list the event on tuesday, the event on wednesday and a total of five hours.

This is teapot (Table Editor And Planner, Or: Teapot), a new spread sheet program for UNIX. The current release has the following features: o curses based user interface with easy to understand menues o portable sheet file format uses XDR or ASCII format o tbl, LaTeX, HTML, CSV or formatted text files can be generated and simple SC and WK1 sheets can be imported o typed expression evaluator with the types int, float, string, error, pointer to cell and empty o iterative expressions o powerful cell addressing o three-dimensional sheets o new expression evaluator functions can be added very easy o English, Dutch or German builtin messages or X/OPEN message catalogues o a user guide, available as pdf and html o It is still a small and simple program! NOTE: the GUI interface is not yet supported on FreeBSD