Free file sharing programs software for linux

Volume Sharing Manager (Vsman) is a utility that has been designed for volume (directory) sharing management on the server side. So far, it manages NFS v3 and V4, but can be extended to others volume sharing systems.
You can select a NFS v4 server interface in the preferences dialog box. Otherwise, invoke vsman with the flag -4 in order to display the NFS v4 specific mounting options when needed.
Vsman must be run as root. It displays on the left a tree view of known directories with their possible accesses, i.e. client hosts that can mount directories from the server where vsman is running.
Each directory is displayed with a green, yellow or red spot.
Green if the directory is exported but not mounted.
Yellow when exported and mounted.
Red when unexported.
When you double-click on an access, the left side shows its mounting options.
You can obviously declare a new volume. Vsman just asks you the name of the corresponding directory. You can of course create or delete accesses for the current volume. When you create one, a dialog box appears, that asks you the suitable host name, network
name or address, or netgroup name.
If the host filed is empty, the networks field is then tested, and if empty again, the netgroup is selected.
If you select "NIS" instead of "Files" in the preferences dialog box, the hosts, networks, users and groups will be fetched from the given NIS domain name. For more info about NIS, read the corresponding HOWTO documentation.
Selecting the Reexport menu will reexport all and synchronize vsman with the exported volumes declared in /etc/exports.
Double-click on a mounting host and select Unexport Host in the Action menu, and the current volume will be unexported from the corresponding volume.
Unexport whole volume will do the same thing, but for all the mounting hosts.
The Start / Stop menu will stop or restart the NFS server.
The Save menu will write the NFS /etc/exports file and reexport all volumes.
This tool has been written in Ada 95, using gtkada 2.4 as the toolkit. Dont forget to install gnat 4.1.x or later. Gnat is now a component of the gcc suite.
Enhancements:
- A few important bugs were fixed.
- Hostname lookup was added.
- The compilation and installation process was improved.

Programs Bar is a programs launcher bar theme for SuperKaramba.

Was tested on Mandriva 2006 and Fedora Core 5.

Solving Constraint Integer Programs is a framework for constraint integer programming. For solving Integer Programs and Constraint Programs, a very similar technique is used: the problem is successively divided into smaller subproblems (branching) that are solved recursively.
On the other hand, Integer Programming and Constraint Programming have different strengths: Integer Programming uses LP relaxations and cutting planes to provide strong dual bounds, while Constraint Programming can handle arbitrary (non-linear) constraints and uses propagation to tighten the variables domains.
SCIP is a framework for Constraint Integer Programming oriented towards the needs of Mathematical Programming experts who want to have total control of the solution process and access detailed information down to the guts of the solver. SCIP can also be used as pure MIP solver or as framework for branch-cut-and-price.
Main features:
- It is a framework for branching, cutting, pricing, and propagation.
- It is highly flexible through many possible user plugins:
- constraint handlers to implement arbitrary constraints,
- variable pricers to dynamically create problem variables,
- domain propagators to apply constraint independent propagations on the variables domains,
- cut separators to apply cutting planes on the LP relaxation,
- relaxators to provide relaxations and dual bounds in addition to the LP relaxation,
- primal heuristics to search for feasible solutions with specific support for probing and diving,
- node selectors to guide the search,
- branching rules to split the problem into subproblems,
- presolvers to simplify the solved problem,
- file readers to parse different input file formats,
- event handlers to be informed on specific events, e.g., when a node was solved, a specific variable changed its bounds, or a new primal solution was found,
- display handlers to create additional columns in the solvers output.
- dialog handlers to extend the included command shell.
- Every existing unit is implemented as a plugin, leading to an interface flexible enough to meet the needs of most additional user extensions.
- A dynamic cut pool management is included.
- The user may mix preprocessed and active problem variables in expressions: they are automatically transformed to corresponding active problem variables.
- Arbitrarily many children per node can be created, and the different children can be arbitrarily defined.
- It has an open LP solver support (currently supporting ILOG CPLEX, Dash XPress-MP, SoPlex, and CLP.
- The LP relaxation need not to be solved at every single node (it can even be turned off completely, mimicing a pure constraint solver).
- Additional relaxations (e.g., semidefinite relaxations or Lagrangian relaxations) can be included, working in parallel or interleaved.
- Conflict analysis can be applied to learn from infeasible subproblems.
- Dynamic memory management reduces the number of operation system calls with automatic memory leakage detection in debug mode.
Enhancements:
- The new heuristics "RENS", "mutation", "veclendiving", and "intshifting", were included.
- The existing ones were improved.
- Presolving and c-MIR cut generation were improved.
- A few bugs were fixed.