Work at SourceForge, help us to make it a better place! We have an immediate need for a Support Technician in our San Francisco or Denver office.

Close

Tree [bc0268] master /
History



File Date Author Commit
examples 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
Makefile 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
README 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
bool_intv.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
bool_intv.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
box.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
box.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
constants.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
constants.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
constr.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
constr.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
degree.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
ieval.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
ieval.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
interval.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
interval.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
intset.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
intset.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
lexer.mll 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
local_search-dummy.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
local_search.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
local_search.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
parser.mly 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
parser_access.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
parser_access.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
parser_intern.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
parser_intern.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
prune.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
prune.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
sdp-ocaml-dummy.c 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
sdp-ocaml-proper.c 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
sdp-ocaml.c 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
sdp.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
sdp.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
smath-ocaml.c 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
util.ml 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit
util.mli 2012-07-30 Peter Fránek Peter Fránek [bc0268] initial commit

Read Me

TopDeg 1.0
Autors: Peter Franek, Stefan Ratschan, Tomas Dzetkulic
Lesser General Public License

------------------------------------------------------
In order to compile this package, you need the following software:
  * O'Caml compiler 
  * OCamlMakefile: contained in ocaml-tools Debian package, also from http://ocaml.info/home/ocaml_sources.html#OCamlMakefile
  * smathlib: http://interval.sourceforge.net/interval/prolog/clip/clip/smath/README.html

Invoke:
  make dc (for creating a slow debugging version)
  make nc (for creating an optimized version)

------------------------------------------------------
How to use the program:

INPUT: 
  [var1, var2, ..., varn] // variables
  expression 1; // expressions where the specified variables are used together with + - * / ^ SIN COS TAN EXP LOG ASIN ACOS ATAN  ... 
  expression 2; 
  ...
  expression n;
  [[a1,b1], [a2, b2], ..., [an, bn]] // box 

OUTPUT: deg(f,B,0), where f is a function with i'th component "expression i" and B is the box specified in the last line of entrance.


  Examples of use can be found in the directory Examples.

  WARNINGS:
  (1) the number of variables should be the same as the number of expressions and the dimension of the box
  (2) the box should be bounded, infinities are not allowed
  (3) The function f has to be nonzero everywhere on the boundary. Otherwise, the program does not terminate.

------------------------------------------------------
How it works: the main file is degree.ml It is the implementation of the algorithm described precisly in this paper:
http://arxiv.org/abs/1207.6331

I would appreciate if you would notify me of your use of TopDeg, inform be about bugs, and
send me resulting publications.

peter dot franek (gmail)