Free startup programs software for linux

game control program project helps administrate game servers, especially automated kicking of players.
game control program helps you administrate gameservers (its written for Q1 and Q3, but works for others). It is highly modular and therefore extensible.
With the current modules, it can start/stop servers, create and rotate logfiles, allow remote administration via telnet, and kick misbehaving players automagically (according to a rule set).
Main features:
- starting a game server and getting hold of all log messages
- creating log files (complete or rotated per map)
- parsing log messages (game independent and configurable)
- sophisticated remote administration (user groups, extensible command set)
- sending commands to a running server (Q,QW,Q2,Q3)
- automatic kicking system according to specific rules (eg. too high rate set by the client)
- check if a server is hanging and kill the process to force a restart
- sending commands to the server at specified timesallows timed startup / shutdown of servers
Enhancements:
- renamed packages and modules (see doc/config)
- added new module: CommandScheduler
- sends a command to the server in defineable periods - see cfg/events.xml allows:
- COMMAND - send as RCon command (command is set as attribute parameter)
- KILLSERVER
- STARTUP
- SHUTDOWN

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.

AmarokFS Startup Script simply provides a shortcut for starting AmarokFS ("Amarok Full Screen") from within Amarok itself.

AmarokFS itself can be downloaded from: http://www.kde-apps.org/content/show.php?content=52641

Installation:

Download the .amarokscript.tar file and install it with Amaroks script installer.

Usage:

Upon startup, the script will automatically look for the "amarokFS" executable in your PATH, and if not found, will prompt you for its location.

Once the script is running, you will have an "AmarokFS" menu entry in your playlist popup menu; now simply select "Run Amarok Full Screen" to activate AmarokFS.

The script can also be configured to use an amarokFS executable other than the one detected in the users PATH.