Rev 15681 | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 15681 | Rev 17228 | ||
---|---|---|---|
Line 2... | Line 2... | ||
2 | Norbert Haider, norbert.haider@univie.ac.at, modified by Ernst-Georg Schmid |
2 | Norbert Haider, norbert.haider@univie.ac.at, modified by Ernst-Georg Schmid |
3 | 3 | ||
4 | :curvecomp |
4 | :curvecomp |
5 | Xiao Gang |
5 | Xiao Gang |
6 | Compare two curves |
6 | Compare two curves |
7 | Input parameters: environment.<br |
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 |
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 |
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 |
10 | xx |
11 | 11 | ||
12 | :cyclicode |
12 | :cyclicode |
13 | Xiao Gang |
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. |
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 |
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 | 16 | ||
17 | 17 | ||
18 | 3 22 10 |
18 | 3 22 10 |
19 | 19 | ||
20 | :dicfind |
20 | :dicfind |
Line 27... | Line 27... | ||
27 | for adm modules |
27 | for adm modules |
28 | 28 | ||
29 | :huffman |
29 | :huffman |
30 | Xiao Gang |
30 | Xiao Gang |
31 | This program computes an optimal coding of variable lengths on a given distribution of probabilities, using Huffman algorithm. |
31 | This program computes an optimal coding of variable lengths on a given distribution of probabilities, using Huffman algorithm. |
32 | Two environment variables<br |
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 |
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 |
34 | huffman_radix=4 |
35 | 0.16, 0.39, 0.55 |
35 | 0.16, 0.39, 0.55 |
36 | 36 | ||
37 | :lceb |
37 | :lceb |
38 | Lucas Nussbaum, lucas@lucas-nussbaum.net |
38 | Lucas Nussbaum, lucas@lucas-nussbaum.net |
Line 50... | Line 50... | ||
50 | For the moment, use only in deductio |
50 | For the moment, use only in deductio |
51 | 51 | ||
52 | :moneyprint |
52 | :moneyprint |
53 | J.M. Evers |
53 | J.M. Evers |
54 | prints a number with fixed amount of decimal places |
54 | prints a number with fixed amount of decimal places |
55 | Usage:!exec moneyprint number1,number2,number3,....number_n decimal_places<br |
55 | Usage:!exec moneyprint number1,number2,number3,....number_n decimal_places<br>or !exec moneyprint number1,number2,number3;....number_n decimal_places<br>\text{A=wims(exec moneyprint number1,number2,number3....number_n decimal_places)}<br>default value "decimal_places = 2"<br>A=!exec moneyprint 123,43.5,23.45665<br>A=123.00,43.50,23.47<br>A=!exec moneyprint 1.000,6.234;8.4567<br>A=1.00,6.23;8.46<br>or specified a last "word"<br>A=!exec moneyprint 123,43.5,23.45665 3 <br>A=123.000,43.500,23.457 |
56 | 56 | ||
57 | 57 | ||
58 | :msg2wims |
58 | :msg2wims |
59 | Xiao Gang |
59 | Xiao Gang |
60 | transforms a text in a file and save it in another file (administrative module). Transforms some commands of the form \ in wims equivalence. By default, the commands are \(\) (replace by !insmath) and translation in html of $$, !, (to complete). More commands can be translated by the configuration of the variable msg2wims_primitives. Usage:!sh cd $$wims_home; bin/msg2wims file_in > file_out |
60 | transforms a text in a file and save it in another file (administrative module). Transforms some commands of the form \ in wims equivalence. By default, the commands are \(\) (replace by !insmath) and translation in html of $$, !, (to complete). More commands can be translated by the configuration of the variable msg2wims_primitives. Usage:!sh cd $$wims_home; bin/msg2wims file_in > file_out |
Line 70... | Line 70... | ||
70 | 70 | ||
71 | 71 | ||
72 | :scienceprint |
72 | :scienceprint |
73 | J.M. Evers |
73 | J.M. Evers |
74 | Prints a number in scientific notation. |
74 | Prints a number in scientific notation. |
75 | Usage: !exec scienceprint number,significant_digits,output_type<br |
75 | Usage: !exec scienceprint number,significant_digits,output_type<br>\text{A=wims(exec scienceprint number,significant_digits,output_type )}<br>output_type can be<ul><li>0 : calculating format : 1.234*10^-4</li><li>1 : html format :1.234×10<sup>-4</sup></li><li>2 : latex format : 1.234\times10^{-4}</li><li>3 : prefix format : 1.234×10<sup>-1</sup> m</li><li>4 : mathml format : <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><mstyle id="wims_mathml" mathsize="110%"><mn>1.234</mn><mo>×</mo><msup><mn>10</mn><mn>-4</mn></msup></mstyle></math></li><li>5 : long prefix format : 1.234×10<sup>-1</sup> milli</li></ul> |
76 | 76 | ||
77 | 77 | ||
78 | :shortpath |
78 | :shortpath |
79 | Xiao Gang |
79 | Xiao Gang |
80 | Finds the shortest paths linking given points |
80 | Finds the shortest paths linking given points |
81 | wims_exec_parm is ... . w_shortpath_style : 0: loop to the start<br |
81 | 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 |
82 | 82 | ||
83 | shortpath_style=0 |
83 | shortpath_style=0 |
84 | 1,3\\5,1\\3,4\\1,1\\3,1\\4,5 |
84 | 1,3\\5,1\\3,4\\1,1\\3,1\\4,5 |
85 | 85 | ||
86 | 86 | ||
Line 92... | Line 92... | ||
92 | 92 | ||
93 | :voronoi |
93 | :voronoi |
94 | Steve J. Fortune |
94 | Steve J. Fortune |
95 | 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. |
95 | 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. |
96 | Each input line should consist of two real numbers, separated by white space. |
96 | Each input line should consist of two real numbers, separated by white space. |
97 | 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 |
97 | 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. |
98 | 98 | ||
99 | -t 5 7\\2 8\\7 6\\3 5\\1 2\\8 1\\4 3\\6 4 |
99 | -t 5 7\\2 8\\7 6\\3 5\\1 2\\8 1\\4 3\\6 4 |
100 | 100 |