Rev 5766 | Go to most recent revision | Details | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 2507 | bpr | 1 | :checkmol |
| 2 | Norbert Haider, norbert.haider@univie.ac.at, modified by Ernst-Georg Schmid |
||
| 3 | |||
| 4 | :curvecomp |
||
| 5 | Xiao Gang |
||
| 6 | Compare two curves |
||
| 7 | Input parameters: environment.<br> w_curvecomp_1 and w_curvecomp_2: curves to compare, as lists of points.<br> w_curvecomp_xrange and w_curvecomp_yrange: list of 2 integers each.<br> w_curvecomp_tolerance: Maximal tolerance of distances. |
||
| 8 | Output: 10 double numbers separated by white spaces.<br>- Average distance of curve 1 with respect to curve 2.<br> - Average distance of curve 2 with respect to curve 1.<br> - Maximal distance of curve 1 with respect to curve 2.<br> - Maximal distance of curve 2 with respect to curve 1.<br> - Proportion of curve 1 close to curve 2.<br> - Proportion of curve 2 close to curve 1.<br> - Maximal jump of curve 1.<br> - Maximal jump of curve 2.<br> - Ratio of repetitions found in curve 1.<br> Number 10: Ratio of repetitions found in curve 2.<br> Furthermore, words "fnofx" and/or "fnofy" will appear if curve 2 represents the graph of a function of x (and/or y).<br> Returns empty if one of the curves is degenerated. |
||
| 9 | curvecomp_1=0,92,1,92,2,92,3,92\\curvecomp_2=46,41,48,41,50,45\\curvecomp_tolerance=40\\curvecomp_xrange=11,208\\curvecomp_yrange=0,220 |
||
| 10 | xx |
||
| 11 | |||
| 12 | :cyclicode |
||
| 13 | Xiao Gang |
||
| 14 | This program generates cyclic code from a polynomial defined over a prime field. It does not check whether the polynomial is primitive or irreducible. |
||
| 15 | Accepted parameter: 3 words<br> Word 1: field characteristics, limited to 2,3,5,7<br> Word 2: The polynomial coefficients (except the leading one, from lower degree to higher).<br>Word 3: The starting status (starting from the first bit). |
||
| 16 | |||
| 17 | |||
| 18 | 3 22 10 |
||
| 19 | |||
| 20 | :dicfind |
||
| 21 | Xiao Gang |
||
| 22 | for adm modules |
||
| 23 | |||
| 24 | :dicsort |
||
| 25 | Xiao Gang |
||
| 26 | Sort dictionary |
||
| 27 | for adm modules |
||
| 28 | |||
| 29 | :huffman |
||
| 30 | Xiao Gang |
||
| 31 | This program computes an optimal coding of variable lengths on a given distribution of probabilities, using Huffman algorithm. |
||
| 32 | Two environment variables<br> wims_exec_parm is a comma-separated list of probability distributions<br> Limited to MAX_ITEMS<br>The input data will be scaled to unit sum<br> w_huffman_radix is the encoding radix, between 2 and MAX_RADIX. |
||
| 33 | two lines<br> Line 1: Entropy and Average code length, comma-separated<br> Line 2: comma-separated list of codes. |
||
| 34 | huffman_radix=4 |
||
| 35 | 0.16, 0.39, 0.55 |
||
| 36 | :lceb |
||
| 37 | Lucas Nussbaum <lucas@lucas-nussbaum.net> |
||
| 38 | jeu "le compte est bon" |
||
| 39 | 7 integers |
||
| 40 | How to obtain the first number from the six other ones by addition, multiplication, division, substraction |
||
| 41 | |||
| 42 | 598 6 8 2 5 10 12 |
||
| 43 | :matchmol |
||
| 44 | Norbert Haider, norbert.haider@univie.ac.at, modified by Ernst-Georg Schmid |
||
| 45 | |||
| 46 | :mathexp |
||
| 47 | Xiao Gang |
||
| 48 | Mathematical expression manipulations for WIMS |
||
| 49 | |||
| 50 | |||
| 51 | :shortpath |
||
| 52 | Xiao Gang |
||
| 53 | Finds the shortest paths linking given points |
||
| 54 | wims_exec_parm is ... . w_shortpath_style : 0: loop to the start<br> 1: arbitrary open path<br> 2: open path with fixed start<br> 3: open path with fixed end<br> 4: open path with fixed start and end |
||
| 55 | |||
| 56 | shortpath_style=0 |
||
| 57 | 1,3\\5,1\\3,4\\1,1\\3,1\\4,5 |
||
| 58 | |||
| 59 | |||
| 60 | :voronoi |
||
| 61 | Steve J. Fortune |
||
| 62 | compute Voronoi diagram or Delaunay triangulation. Voronoi reads the standard input for a set of points in the plane and writes either the Voronoi diagram or the Delaunay triangulation to the standard output. |
||
| 63 | Each input line should consist of two real numbers, separated by white space. |
||
| 64 | If option -t is present, the Delaunay triangulation is produced. Each output line is a triple i j k which are the indices of the three points in a Delaunay triangle.<br> Points are numbered starting at 0. <br>If this option is not present, the Voronoi diagram is produced.<br> There are four output record types.<br> s a b indicates that an input point at coordinates l a b c indicates a line with equation ax + by = c.<br> v a b indicates a vertex at a b.<br> e l v1 v2 indicates a Voronoi segment which is a subsegment of line number l; with endpoints numbered v1 and v2.<br> If v1 or v2 is -1, the line extends to infinity. |
||
| 65 | |||
| 66 | -t 5 7\\2 8\\7 6\\3 5\\1 2\\8 1\\4 3\\6 4 |
||
| 67 | |||
| 68 | :translator |
||
| 69 | Xiao Gang |
||
| 70 | Versatile translation according to a dictionary |
||
| 71 | for adm modules |
||
| 72 |