Ubuntu is composed of many software packages, the vast majority of which are distributed under a free software license. The only exceptions are some proprietary hardware drivers.The main license used is the GNU General Public License (GNU GPL) which, along with the GNU Lesser General Public License (GNU LGPL), explicitly declares that users are free to run, copy, distribute, study, change, develop and improve the software. On the other hand, there is also proprietary software available that can run on Ubuntu. Ubuntu focuses on usability, security and stability. The Ubiquity installer allows Ubuntu to be installed to the hard disk from within the Live CD environment, without the need for restarting the computer prior to installation. Ubuntu also emphasizes accessibility and internationalization to reach as many people as possible.
The battery applet in KDE Plasma 4.4 has gotten some nice improvements. First of all, I wasn’t really happy with the layout of its popup dialog. It looked messy and didn’t scale well with bigger fonts. During Tokamak3 in September, I started improving this. To make it look calmer, I reduced the amount of edges widgets are aligned to. The previous version used nested layouts, which lead to widgets not properly aligned with each other. This creates a rather messy look. For 4.4, I’ve reworked the layout and reduced everything to only one layout and attached the battery in the popup off-layout in the top-right corner. I thought about using an AnchorLayout for this, but a simple setGeometry() to position the battery top-right would work as well, so I went for KISS. I also replaced the text on the "Configure Power Management" button with a tooltip, reducing visual clutter but keeping this handy in-context shortcut to easily get at the more advanced power managment settings.
The battery popup now resembles a FormLayout more closely, which should make it more consistent with how other dialogs in KDE are designed, so that’s a bonus in consistency. The two screenshots show the old and the new version of the applet side-by-side.
One wish came up more than once over the past months. Some (very vocal) users would like to see the battery showing the remaining time when it’s running on battery. Normally, the applet would show the charge percentage, which is a rather abstract number. (How long is 37%?) Now unfortunately, there’s no way to give an accurate estimation oft the time that’s left, since it largely depends on the usage patterns. You check the battery, it says "10 minutes left", then you start some app that exercises your CPU and disk and suddenly the machine goes into suspend after 3 minutes. Quite possible, and the usage scenarios and differences in modern portable hardware are such that there’s really no way to accurately predict the remaining battery lifetime. In the Plasma team, we decided that we rather not show the user unreliable information, since there’s only a very small group that understands that this number is almost black magic, and often simply wrongly reported by HAL. There’s well over 200 emails on that subject, mainly on the Plasma mailinglist and everytime this topic comes up we hear how much KDE must suck if this tiny little feature isn’t available. We’ve made this feature available in KDE 4.3, as a hidden config option (meaning that you cannot enable it using the configuration UI, but it’s there if you enable it in the configuration file. I had tentatively disabled this code during the larger part of the 4.4 development cycle to see if I’d get away with ditching it, and it didn’t quite fit in with the new layouting for the popup.
Lately, the same discussion came up again, hopefully for the last time, since I submitted a patch yesterday night that brings the remaining time back (still as hidden config option, and that’s about as far as we will go). No, there won’t be a checkbox since I don’t want to confront users with information that’s most likely bogus and highly depends on what you’re doing at this very moment. As the option needs a power user to understand what this info really means (i.e. an estimation that’s completely off or not, depending on what your BIOS or ACPI subsystem reports), I think we can reasonable expect that adding a line to a config file is easy enough for those who really, really, really want it.
So, for reference, here’s how you get the remaining time display in the battery applet.
Install KDE Plasma 4.4, at least trunk from today
kquitapp plasma-desktop (to stop your plasma shell, as long as it’s running, it can’t pick up config changes, if you stop it after you changed the config file, it will happily overwrite your hand-made changes on quit)
Open your plasma-desktop config file, (mine is ~/.kde4/share/config/plasma-desktop-appletsrc, YMMV)
Locate the section for the battery applet, in the below example, you’ll find the plugin=battery line, choose the section that adds [Configuration] to the identifier. This section might not exist if you’re using default settings, in that case, it’s easiest to check the “show charge information” checkbox in the battery’s config (you might need to restart plasma-desktop for that, don’t kill it afterwards but use kquitapp). Then locate the showBatteryString= line and add another line in the same section:
showRemainingTime=true
Save the edited config file, restart plasma-desktop
The remaining time will now be shown if it’s non-zero (obviously bogus since the machine would be off then) and the battery is discharging. If in doubt, use “plasmaengineexplorer –engine powermanagement” to check wether Solid reports the remaining time at all, and that it’s non-zero. The remaining time could also be shown while charging, but this apparently isn’t supported by my setup, so I can’t test it.
Also during Tokamak3, Dario fixed a bug that would switch the display’s brightness back to 100% after it was dimmed because the machine had been idle. So if you’d set it to 50%, and it would then dim after some minutes of idle time, you’d move the mouse and it pops back to 100%, while it should go back to 50%. That’s fixed as well, and the patch has also been backported to KDE 4.3. You probably are already running with this fix.
There was a sudden rise of popularity of most of the 'major' social bookmark services since 2009 For some, we see popularity slowly going down towards end 2008 then suddenly rising.
PREDICT is an open-source, multi-user satellite tracking and orbital prediction program written under the Linux operating system by John A. Magliacane, KD2BD. PREDICT is free software. Users may redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 2 of the License or any later version.
PREDICT software is released in three forms:
* A version compatible with Linux or Unix operating systems (as well as some derivatives, such as Mac OS X), * A version for DOS and DOS-based operating systems operating on 32-bit CPUs (80386s or better) that contains many, but not all the features and functionality of the Linux/Unix version. * Bundled as part of an application-specific Linux distribution (Portable PREDICT Plus!) that includes a small suite of satellite communication applications in addition to PREDICT that can all be booted from a pair of floppy disks. (No permanent installation required.)
Download PREDICT
PREDICT may be downloaded through the following links:
Shortly after its initial release in late 1999, PREDICT was evaluated by the Linuxberg/Tucows web site, and received a rating of four out of five possible penguins/cows. A lot has happened since.
PREDICT has been adopted as a standard application in the Debian distribution of Linux.
PREDICT is included in the latest version of Slackware Linux.
PREDICT has been successfully ported to the Sharp Zaurus Linux-based PDA!
The use of PREDICT software is outlined in Infrastructure for Internet-Based Operations (PDF document) by James Cutler, Gregory Hutchins, Christopher Kitts, and Robert Twiggs of the Space Systems Development Laboratory, Stanford University. This paper was presented at the 14th annual Utah State University conference on small satellites.
Several important advantages to using PREDICT software for small satellite ground support are illustrated in Design of a Distributed Ground Support System for Small Satellites (PDF Documement) by Richard M. Barry and Dr. Pieter J. Bakkes of the University of Stellenbosch Electronic Systems Laboratory, South Africa. This paper was presented at the 15th annual AIAA/Utah State University Conference on Small Satellites in August 2001.
Reference is made to PREDICT in TU Sat 1: A Novel Communications and Scientific Satellite (PDF Document), written by members of the Physics Department at Taylor University, and presented at the 16th annual USU Conference on Small Satellites in 2002.
PREDICT has been used to determine the Data Communication Accuracy of the ARGO Floats located in the seas adjacent to Japan. The following PDF Document provides further details.
The adaptation of PREDICT's core functions in the development of specialized tracking applications is discussed in a paper entitled Development of an Ikonos Coverage Prediction Application (PDF Document), authored at the Department of Geodesy and Geomatics Engineering at the University of New Brunswick, and the Department of Industrial Engineering at Dalhousie University.
PREDICT software was selected for use at Aalborg University's Institute of Electronic Systems (Denmark) for the operation of their SSETI-Express and AAUSAT-II automated satellite ground station. A detailed description of the development and operation of this system is available in PDF format.
Use of PREDICT is also cited in theses presented recently at Santa Clara University at both the Undergraduate and Graduate levels in Computer and Electrical Engineering.
Linux2000 has a page describing the installation and use of PREDICT.
A description of the history and use of PREDICT software appeared in the July 2000 (Science and Engineering) issue of Linux Journal magazine.
John Heaton, G1YYH, has created several modifications to PREDICT Version 2.2.x to allow some additional features. Details and screenshots are available at his web site.
Fernand Lamberts, ON4LY, has developed several interesting graphical clients for PREDICT.
Christophe Mercier has developed JCP, a graphical Java client for PREDICT. Information on JCP, as well as a PREDICT user manual and installation guide in the French language is available at his web site.
PCRSAT, a PREDICT client application written by Vittorio Benvenuti, I3VFJ, allows operation of an ICOM PCR 1000 receiver in a satellite communication environment.
Iain Young, G7III, has also created some interesting PREDICT clients, including a telemetry decoder for the PCSAT, RAFT, and ANDE satellites.
Alexandru Csete's Groundstation Software Suite uses a derivative of PREDICT's source code for its satellite tracking functions.
Edson Pereira's PetitTrack satellite tracking software for the Sharp Zaurus SL-5000D and SL-5500 series Linux-based PDAs uses a derivative of PREDICT's source code for its tracking functions.
Ktrack by Luc Langehegermann, LX2GT, adopts some code and concepts from both PetitTrack and PREDICT. Luc has also developed a FODTRACK rotator interface utility for PREDICT.
Paul Williamson, KB5MU, has released Mac Vocalizer to enable PREDICT to run with speech announcements under Mac OS X.
Portable and modular coding has allowed users to successfully port PREDICT to operating systems, such as FreeBSD, Mac OS X, and Windows (using Cygwin-32).
Dana, N1OFZ, has created a web page that describes how to run PREDICT and GSAT successfully under Mac OS X.
David A. B. Johnson, G4DPZ, is actively developing a Satellite Tracking Web Service (websat) for the ESA/NASA/JAXA GENSO project that is based on code in PREDICT.
Andrew T. West has created PredictLib, a JavaScript satellite tracking library based on code contained in PREDICT.
Grace Peng has added an entry to her blog detailing her approach toward getting PREDICT to run on her MacBook Pro.
An interesting article entitled, Open Source Moved the Cheese, on an AMSAT discussion group describes the use of PREDICT as a low-cost, highly-capable alternative to hardware-specific approaches to satellite tracking.
PREDICT version 2.2.3 has been released! This is a maintainance release that attempts to offer improved performance together with sustained compatibility with the latest versions of xplanet and gcc.
Predicting Satellite Passes
Orbital predictions are useful for determining in advance when a satellite is expected to come within range of a ground station. They can also be used to look back to previous passes to help to confirm or identify past observations.
PREDICT includes two orbital prediction modes to predict any pass above a ground station (main menu option [P]), or list only those passes that might be visible to a ground station through optical means (main menu option [V]). In either mode, the user is asked to select a satellite of interest from a menu, and then asked to enter the date and time (in UTC) at which prediction calculations should start. Orbital calculations are started and prediction information is then displayed on the screen.
The date and time in UTC, along with the satellite's elevation above ground, azimuth heading, modulo 256 orbital phase, sub-satellite point latitude and longitude, slant range between the ground station and the satellite, and the satellite's orbit number are all displayed. An asterisk (*) displayed to the right of the orbit number means the satellite is in sunlight at the date and time listed on the line. A plus symbol (+) means the satellite is in sunlight while the ground station is under the cover of darkness at the time and date listed. Under good viewing conditions, large satellites such as the International Space Station, and the US Space Shuttles are visible to the naked eye. If no symbol appears to the right of the orbit number, then the satellite is in the Earth's shadow at the time and date listed, and is not receiving any illumination from the sun.
Selecting [V] from PREDICT's main menu will permit a ground station to only predict passes for satellites that are potentially visible through optical means. Since all other passes are filtered out in this mode, and since some satellites may never arrive over a ground station when optical viewing conditions are possible, the program provides the option of breaking out of visual orbital prediction mode by pressing the [ESC]ape key as calculations are made. A prompt is displayed at the bottom of the screen to alert the user of this option.
In either orbital prediction mode, predictions will not be attempted for satellites that can never rise above the ground station's horizon, or for satellites in geostationary orbits. If a satellite is in range at the starting date and time specified, PREDICT will adjust the starting date back in time until the point of AOS so that the prediction screen displays the first pass in its entirety from start to finish.
Single Satellite Tracking Mode
In addition to predicting satellite passes, PREDICT allows satellites to be tracked individually in real-time using PREDICT's Single Satellite Tracking Mode (main menu option [T]), or simultaneously as a group of 24 using the program's Multi-Satellite Tracking Mode (main menu option [M]). The positions of the Sun and Moon are also displayed when tracking satellites in real-time.
Selecting option [T] from PREDICT's main menu places the program in Single Satellite Tracking Mode. The user will be prompted to select the satellite of interest, after which a screen will appear and display tracking positions for the satellite selected.
In Single Satellite Tracking Mode, a wealth of real-time satellite data is provided by PREDICT. If the satellite contains an active communications downlink, uplink, or two-way communications transponder, then Doppler-corrected uplink and downlink frequencies, path loss, propagation delay, and echo are displayed. It is also possible to tune across the transponder's passband using certain keystrokes to locate a specific uplink or downlink frequency within the satellite's transponder. This makes it possible to determine the appropriate uplink frequency to match a desired downlink frequency (or vice-versa). PREDICT supports a number of transponders per satellite, including linear (both inverting and non-inverting), digital (Pacsat), and bent-pipe (FM). Also new to version 2.2.x is the determination of antenna squint angle and solar eclipse depth.
If a soundcard is present in your machine and the Single Satellite Tracking Mode is invoked with an uppercase 'T' rather than a lowercase 't', PREDICT will make periodic voice announcements stating the satellite's tracking coordinates in real-time. Announcements such as:
are made at intervals that are a function of how quickly the satellite is moving across the sky. Announcements can occur as frequently as every 50 seconds for satellites in low earth orbits such as the International Space Station (370 km), or as infrequently as every 8 minutes for satellites in very high orbits, such as the GE-2 geostationary satellite (35780 km). Voice announcements are performed as background processes so as not to interfere with tracking calculations as the announcements are made. Announcements can be forced at any time by pressing the 'T' key in Single Satellite Tracking Mode. Alarms are sounded at the precise moment when satellites enter into sunlight or into eclipse.
Solar Illumination Predictions
PREDICT even makes it possible to determine how much solar illumination a particular satellite will receive over the course of a day. This information is especially valuable to spacecraft designers and satellite groundstation controllers who must monitor spacecraft power budgets or thermal conditions on-board their spacecraft due to sunlight and eclipse periods. It can even be used to predict the optimum times for astronauts to perform extra-vehicular activities in space.
Multi-Satellite Tracking Mode
Selecting [M] from PREDICT's main menu places the program in a real-time multi-satellite tracking mode. In this mode, all 24 satellites in the program's database are tracked simultaneously along with the positions of the Sun and Moon. Tracking data for the satellites is displayed in two columns of 12 satellites each. The name, azimuth heading, elevation, sub-satellite point latitude (in degrees North) and longitude (in degrees West) positions are provided, along with the slant range (in kilometers), and the slant range distance between the satellite and the ground station (also in kilometers).
A letter displayed to the right of the slant range indicates the satellite's sunlight and eclipse conditions. If the satellite is experiencing an eclipse period, an N is displayed. If the satellite is in sunlight and the ground station is under the cover of darkness, a V is displayed to indicate the possibility that the satellite is visible under the current conditions. If the satellite is in sunlight while conditions at the ground station do not allow the satellite to be seen, a D is displayed. Satellites in range of the ground station are displayed in BOLD lettering. The AOS dates and times for the next three satellites predicted to come into range are displayed on the bottom of the screen between the tracking coordinates of the Sun and Moon. Predictions are not made for satellites in geostationary orbits or for satellites so low in inclination and/or altitude that they can never rise above the horizon of the ground station.
Solar and Lunar Orbital Predictions
In addition to making orbital predictions of spacecraft, PREDICT can also predict transits of the Sun and the Moon. When making solar and lunar orbital predictions, PREDICT provides azimuth and elevation headings, the right ascension, declination, Greenwich Hour Angle (GHA), radial velocity, and normalized distance (range) to the Sun or Moon.
The Declination and Greenwich Hour Angles correspond to the latitude and longitude of the object's sub-satellite point above the Earth's surface. The radial velocity corresponds to the speed and direction the object is traveling toward (+) or away (-) from the ground station, and is expressed in meters per second. When the radial distance of the Moon is close to zero, the amount of Doppler shift experienced in Moon bounce (EME) communications is minimal. The normalized distance corresponds to the object's actual distance to the ground station divided its average distance. In practice, the normalized distance can range from about 0.945 to 1.055 for the Moon, and about 0.983 to 1.017 for the Sun.
EME Support
Included with PREDICT is a utility called MoonTracker. MoonTracker supports moonbounce (EME) communications by calculating the position of the Moon, and sending appropriate control signals to an AZ/EL antenna rotator to track the Moon as it crosses the sky. Once invoked, MoonTracker spawns itself as background process, and continues to run until terminated by a kill signal. If the Moon is not above the horizon when MoonTracker is invoked, MoonTracker goes to "sleep" until the predicted time of Moon rise.
Client Applications
The Linux version of PREDICT includes networking code to permit its use as a socket-based server, allowing it to supply real-time tracking and orbital prediction information to client applications using the UDP communications protocol. A number of excellent client applications have been developed thus far for use with PREDICT, and more are on the way.
The graphical client applications pictured above are included as part of the Linux version of PREDICT.
The latest version of PB/PG (a Pacsat communication suite) for Linux written by Bent Bagger, OZ6BL polls PREDICT for live tracking data, and displays the information in the center of PB's main screen.
COIN-OR stands for the Computational Infrastructure for Operations Research. The stated goal of the COIN-OR project is "to create for mathematical software what the open literature is for mathematical theory." The open literature (e.g., a research journal) provides the OR community with a peer-review process and an archive. Papers in operations research journals on mathematical theory often contain supporting numerical results from computational studies. The software implementations, models, and data used to produce the numerical results are typically not published. The status quo impeded researchers needing to reproduce computational results, make fair comparisons, and extend the state of the art.
The success of Linux, Apache, and other projects popularized the open-source model of software development and distribution. A group at IBM Research proposed open source as an analogous yet viable means to "publish" software, models, and data. COIN-OR was conceived as an initiative to promote open-source in the computational Operations Research community and to provide the on-line resources and hosting services required to enable others to run their own open-source software projects.
The COIN-OR website was launched as an experiment in 2000, in conjunction with 17th International Symposium on Math Programming in Atlanta, Georgia. In the year 2007, COIN-OR had 25 application projects, including tools for linear programming (e.g., COIN-OR CLP), nonlinear programming (e.g., IPOPT), integer programming (e.g., CBC, Bcp and COIN-OR SYMPHONY) and more. COIN-OR is hosted by the Institute for Operations Research and the Management Sciences, INFORMS, and run by the educational, non-profit COIN-OR Foundation.
Projects
CLP
CLP stands for COIN-OR LP . CLP is an open-source linear programming solver written in C++. It is published under the Common Public License so it can be used in commercial software without any of the contamination issues of the GNU General Public License. CLP is primarily meant to be used as a callable library, although a stand-alone executable version can be built. It is designed to be as reliable as any commercial solver (if not quite as fast) and to be able to tackle very large problems.
CLP is designed to solve linear programming problems such as :
minimize c_1 x_1 + c_2 x_2\,
* subject to problem constraints of the following form
with up to millions of variables and/or constraints. Its main algorithm is the Simplex algorithm.
CLP is used in other COIN-OR projects such as SYMPHONY, BCP (Branch Cut and Price), CBC (Coin Branch and Cut) and others.
SYMPHONY
SYMPHONY is a software for solving a class of mathematical problems called integer programming (IP) problems and its variants. A linear programming problem is an optimization (mathematics) problem in which we want to maximize or minimize a linear objective function over a set of linear constraints. A Pure Integer Programming problem is a Linear Programming problem in which all the variables are allowed to assume only integer values. A Mixed Integer Programming (MIP) problem is similar to a Pure IP Problem, but only some of the variables are constrained to be integers. Other variables can assume non-integral values. MIPs are useful in modelling a lot of real life problems in logistics, scheduling, production planning, finance and management sciences. They are also extensively used in theoretical research like combinatorics, statistics, physics and computational biology. MIPs are therefore, an important tool in the field of Operations research (OR), which is, roughly, the analysis and optimization of business and other decisions using mathematics.
SYMPHONY is an acronym standing for Single- or multi-process optimization over networks. It is a callable library which can solve general mixed integer programs (MIPs) over heterogeneous networks. It is an open source branch and cut framework for solving MIPs and is available as a part of COIN-OR. It can use CLP, CPLEX, XPRESS or other linear programming solvers to solve the underlying linear programs.
SYMPHONY is a callable library which implements both sequential and parallel versions of branch, cut and price to solve MILPs. A branch, cut and price algorithm is similar to a branch and bound algorithm but additionally includes Cutting-plane methods and pricing algorithms. The user of the library can customize the algorithm in any number of ways by supplying application-specific subroutines for reading in custom data files, generating application-specific cutting planes, or applying custom branching rules, resulting in a customized state-of-the-art branch and cut algorithm. Most components of the algorithm, e.g., search tree management, management of linear programming solution, cut pool management, and communication management, are internal to the library and need not be touched by the user. The executables can be built in any number of configurations ranging from completely sequential to fully parallel with independently functioning cut generators, cut pools, and LP solvers. The distributed version currently runs in any environment supported by the PVM message passing protocol. The same source code can also be compiled for shared-memory architectures using any OpenMP compliant compiler.
SYMPHONY reads files in both, the MPS (format) (through the COIN-OR MPS reader) and AMPL files (through the GLPK parser). SYMPHONY does not have an LP-Solver of its own, but can be used with solvers like Clp, Cplex, Xpress through the Osi-interface. The cuts are generated using COIN's cut generation library: CGL. SYMPHONY also has structure specific implementations for problems like the Traveling salesman problem, Vehicle routing problem, Set partitioning problem, Mixed postman problem etc. SYMPHONY also has an interactive shell where the user can enter commands to execute and control the program.
Developer tools
BuildTools: COIN-OR Unix developer tools and documentation, tools for managing configuration and compilation of various COIN-OR projects under Linux, Unix, and Cygwin
CoinBinary: COIN-OR Binary Distributions, pre-compiled binary distributions of COIN-OR projects
CoinWeb: COIN-OR Web Services, COIN-OR Web pages, Subversion, Trac, etc.
TestTools: TestTools, Python scripts to automatically download, configure, build, test, and install COIN-OR projects
Graphs
CGC: COIN-OR Graph Classes, a collection of network representations and algorithms
LEMON: Library of Efficient Models and Optimization in Networks, a C++ template library aimed at combinatorial optimization tasks, especially those working with graphs and networks.
Interfaces
CoinMP: CoinMP, a lightweight API and DLL for CLP, CBC, and CGL
GAMSlinks: GAMS/COIN-OR Links, links between GAMS (General Algebraic Modeling System) and solvers that are hosted at COIN-OR
NLPAPI: Nonlinear Programming API, a subroutine interface for defining and solving nonlinear programming problems
OS: Optimization Services, standards for representing optimization instances, results, solver options, and communication between clients and solvers in a distributed environment using Web Services
OSI: Open Solver Interface, a uniform API for calling embedded linear and mixed-integer programming solvers
SMI: Stochastic Modeling Interface, for optimization under uncertainty
Metaheuristics
METSlib: METSlib, an object oriented metaheuristics optimization framework and toolkit in C++
OTS: Open Tabu Search, a framework for constructing tabu search algorithms
Modeling systems
FLOPC++: FLOPC++, an algebraic modeling language embedded in C++
GAMSlinks: GAMS/COIN-OR Links, links between GAMS (General Algebraic Modeling System) and solvers that are hosted at COIN-OR
OS: Optimization Services, standards for representing optimization instances, results, solver options, and communication between clients and solvers in a distributed environment using Web Services
Optimization convex non-differentiable
OBOE: Oracle Based Optimization Engine, optimization of convex problems with user-supplied methods delivering key first order information (like support to the feasible set, support to the objective function)
CoinMP: CoinMP, a lightweight API and DLL for CLP, CBC, and CGL
DyLP: Dynamic LP, an implementation of the dynamic simplex methods
FLOPC++: FLOPC++, an algebraic modeling language embedded in C++
OSI: Open Solver Interface, a uniform API for calling embedded linear and mixed-integer programming solvers
VOL: Volume Algorithm, a subgradient algorithm that also computes approximate primal solutions
Optimization deterministic linear discrete
BCP: Branch-Cut-Price Framework, a framework for constructing parallel branch-cut-price algorithms for mixed-integer linear programs
CBC: COIN-OR Branch and Cut, an LP-based branch-and-cut library
CGL: Cut Generator Library, a library of cutting-plane generators
CHiPPS: COIN-OR High Performance Parallel Search Framework, a framework for constructing parallel tree search algorithms (includes an LP-based branch-cut-price implementation)
DIP: Decomposition in Integer Programming , a framework for implementing a variety of decomposition-based branch-and-bound algorithms for solving mixed integer linear programs
SYMPHONY: SYMPHONY, a callable library for solving mixed-integer linear programs
Optimization deterministic nonlinear
DFO: Derivative-Free Optimization, a package for solving general nonlinear optimization problems when derivatives are unavailable
Ipopt: Interior-Point Optimizer, for general large-scale nonlinear optimization
MOCHA: Matroid Optimization: Combinatorial Heuristics and Algorithms, heuristics and algorithms for multicriteria matroid optimization
NLPAPI: Nonlinear Programming API, a subroutine interface for defining and solving nonlinear programming problems
OptiML: Optimization for Machine learning, interior point, active set method and parametric solvers for support vector machines, solver for the sparse inverse covariance problem
Optimization deterministic nonlinear discrete
Bonmin: Basic Open-source Nonlinear Mixed INteger programming, an experimental open-source C++ code for solving general MINLP (Mixed Integer NonLinear Programming) problems
Couenne: Couenne, a branch-and-bound algorithm for mixed integer nonlinear programming problems
LaGO: Lagrangian Global Optimizer, for the global optimization of nonconvex mixed-integer nonlinear programs
CSDP: CSDP, an interior-point method for semidefinite programming
Optimization stochastic
SMI: Stochastic Modeling Interface, for optimization under uncertainty
Optimization utility
ADOL-C: ADOL-C, package for the automatic differentiation of C and C++ programs
CHiPPS: COIN-OR High Performance Parallel Search Framework, a framework for constructing parallel tree search algorithms (includes an LP-based branch-cut-price implementation)
CoinUtils: COIN-OR utilities, utilities, data structures, and linear algebra methods for COIN-OR projects
CppAD: CppAD, a tool for differentiation of C++ functions
LEMON: Library of Efficient Models and Optimization in Networks, a C++ template library aimed at combinatorial optimization tasks, especially those working with graphs and networks.
OS: Optimization Services, standards for representing optimization instances, results, solver options, and communication between clients and solvers in a distributed environment using Web Services
PFunc: Parallel Functions, a lightweight and portable library that provides C and C++ APIs to express task parallelism
Web services
OS: Optimization Services, standards for representing optimization instances, results, solver options, and communication between clients and solvers in a distributed environment using Web Services
Projects alphabetically:
ADOL-C: ADOL-C, package for the automatic differentiation of C and C++ programs
BCP: Branch-Cut-Price Framework, a framework for constructing parallel branch-cut-price algorithms for mixed-integer linear programs
Bonmin: Basic Open-source Nonlinear Mixed INteger programming, an experimental open-source C++ code for solving general MINLP (Mixed Integer NonLinear Programming) problems
BuildTools: COIN-OR Unix developer tools and documentation, tools for managing configuration and compilation of various COIN-OR projects under Linux, Unix, and Cygwin
CBC: COIN-OR Branch and Cut, an LP-based branch-and-cut library
CGC: COIN-OR Graph Classes, a collection of network representations and algorithms
CGL: Cut Generator Library, a library of cutting-plane generators
CHiPPS: COIN-OR High Performance Parallel Search Framework, a framework for constructing parallel tree search algorithms (includes an LP-based branch-cut-price implementation)
CoinBinary: COIN-OR Binary Distributions, pre-compiled binary distributions of COIN-OR projects
CoinMP: CoinMP, a lightweight API and DLL for CLP, CBC, and CGL
CoinUtils: COIN-OR utilities, utilities, data structures, and linear algebra methods for COIN-OR projects
CoinWeb: COIN-OR Web Services, COIN-OR Web pages, Subversion, Trac, etc.
Couenne: Couenne, a branch-and-bound algorithm for mixed integer nonlinear programming problems
CppAD: CppAD, a tool for differentiation of C++ functions
CSDP: CSDP, an interior-point method for semidefinite programming
DFO: Derivative-Free Optimization, a package for solving general nonlinear optimization problems when derivatives are unavailable
DIP: Decomposition in Integer Programming , a framework for implementing a variety of decomposition-based branch-and-bound algorithms for solving mixed integer linear programs
DyLP: Dynamic LP, an implementation of the dynamic simplex methods
FLOPC++: FLOPC++, an algebraic modeling language embedded in C++
GAMSlinks: GAMS/COIN-OR Links, links between GAMS (General Algebraic Modeling System) and solvers that are hosted at COIN-OR
Ipopt: Interior-Point Optimizer, for general large-scale nonlinear optimization
LaGO: Lagrangian Global Optimizer, for the global optimization of nonconvex mixed-integer nonlinear programs
LEMON: Library of Efficient Models and Optimization in Networks, a C++ template library aimed at combinatorial optimization tasks, especially those working with graphs and networks.
METSlib: METSlib, an object oriented metaheuristics optimization framework and toolkit in C++
MOCHA: Matroid Optimization: Combinatorial Heuristics and Algorithms, heuristics and algorithms for multicriteria matroid optimization
NLPAPI: Nonlinear Programming API, a subroutine interface for defining and solving nonlinear programming problems
OBOE: Oracle Based Optimization Engine, optimization of convex problems with user-supplied methods delivering key first order information (like support to the feasible set, support to the objective function)
OptiML: Optimization for Machine learning, interior point, active set method and parametric solvers for support vector machines, solver for the sparse inverse covariance problem
OS: Optimization Services, standards for representing optimization instances, results, solver options, and communication between clients and solvers in a distributed environment using Web Services
OSI: Open Solver Interface, a uniform API for calling embedded linear and mixed-integer programming solvers
OTS: Open Tabu Search, a framework for constructing tabu search algorithms
PFunc: Parallel Functions, a lightweight and portable library that provides C and C++ APIs to express task parallelism
SMI: Stochastic Modeling Interface, for optimization under uncertainty
SYMPHONY: SYMPHONY, a callable library for solving mixed-integer linear programs
TestTools: TestTools, Python scripts to automatically download, configure, build, test, and install COIN-OR projects
VOL: Volume Algorithm, a subgradient algorithm that also computes approximate primal solutions
Download
Binaries
Pre-compiled binaries for a number of projects and platforms are available here. For more information on using these binaries, please visit the Binary Distribution Project Web page.
Source Code
You can find detailed instruction on obtaining, configuring, compiling, installing, and finally using the COIN-OR libraries at the CoinHelp (BuildTools) project page.
An archive containing the source code for the latest stable release of each project can be obtained here or by checking it out using Subversion (SVN). See the FAQs for general instructions on subversion or go to the Web site of the project you are interested in for more specific instructions (see here for a list).
On-line Services
NEOS Some COIN-OR solvers can be accessed on-line through NEOS. You only need a description of the optimization problem you want to solve---all additional information required by the solver is determined automatically. The following COIN-OR solvers run on NEOS. (Click on the links below to get to the solver's webpage on NEOS.)
BonMin, Basic Open-source Nonlinear Mixed INteger program solver on NEOS using AMPL input
CLP COIN Linear Program Solver on NEOS using MPS input
Rally Dakar Argentina Perú 2012: Camiones.
-
N° Nombre Marca Modelo 501
- LOPRAIS Ales (CZE)
- ALMÁŠI PETR (CZE)
- ERNST MICHAL (CZE)
TATRA
815-2 ZO R45 12.400 4x4.1 503
...
Argentina, stamp issues in 2010 .
-
*50 Años del Consejo Federal de la Energía Eléctrica*
*50th Anniversary of the Electric Power Federal Council*
*Fecha de emisión:* 27 de Noviembre d...
Restyling Ulmus Parviflia
-
Ulmus parvifolia, commonly known as the Chinese Elmor Lacebark Elm, is a
species native to China, Japan, North Korea and Vietnam.It has been
described as ...
Dinosaurs in Patagonia Argentina: Fossils.
-
The fossils are testimonies from the past. They evidence the existence of
organisms in other geological eras and they are present at different levels
in ...
Los 40 juegos para Linux más conocidos.
-
Visto que la gente principalmente tiene como primer problema para migrar a
Linux es el tema de los juegos, os vamos a dejar una lista detallada de
juegos ...
Restyling Ulmus Parviflia
-
Ulmus parvifolia, commonly known as the Chinese Elmor Lacebark Elm, is a
species native to China, Japan, North Korea and Vietnam.It has been
described as ...
Argentina, stamp issues in 2010 .
-
*50 Años del Consejo Federal de la Energía Eléctrica*
*50th Anniversary of the Electric Power Federal Council*
*Fecha de emisión:* 27 de Noviembre d...
The battery applet in KDE Plasma 4.4 has gotten some nice improvements. First of all, I wasn’t really happy with the layout of its popup dialog. It looked messy and didn’t scale well with bigger fonts. During Tokamak3 in September, I started improving this. To make it look calmer, I reduced the amount of edges widgets are aligned to. The previous version used nested layouts, which lead to widgets not properly aligned with each other. This creates a rather messy look. For 4.4, I’ve reworked the layout and reduced everything to only one layout and attached the battery in the popup off-layout in the top-right corner. I thought about using an AnchorLayout for this, but a simple setGeometry() to position the battery top-right would work as well, so I went for KISS. I also replaced the text on the "Configure Power Management" button with a tooltip, reducing visual clutter but keeping this handy in-context shortcut to easily get at the more advanced power managment settings. 
PREDICT
PREDICT version 2.2.3 has been released! This is a maintainance release that attempts to offer improved performance together with sustained compatibility with the latest versions of xplanet and gcc. 
COIN-OR
Posts
