1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
|
// solve_IP.cc
// This file provides the interface to call the implemented IP-algorithms.
// This includes a short help text on the choice of algorithms and their
// arguments and the required formats of the input file.
#ifndef SOLVE_IP_CC
#define SOLVE_IP_CC
#include "IP_algorithms.h"
int main(int argc, char *argv[])
{
// initialize arguments for the IP-algorithms (Buchberger)
// with default settings
BOOLEAN verbose=FALSE;
int version=1;
int S_pair_criteria=11;
double interreduction_percentage=12.0;
///////////////////////// parse options /////////////////////////////////////
int alg_option=0;
// no algorithm specified yet
if(argc>=3)
// argc has to be at least 3 (except when help is required, see below):
// program name, (MATRIX or) GROEBNER file, PROBLEM file
{
for(int i=1;i<argc-2;i++)
// these are the input options
{
if(!strcmp(argv[i],"-v") || !strcmp(argv[i],"--verbose"))
{
verbose=TRUE;
continue;
// read next argument
}
if(!strcmp(argv[i],"-V") || !strcmp(argv[i],"-version"))
{
// check if next argument is a valid version number
i++;
if(!strcmp(argv[i],"1"))
{
version=1;
continue;
}
if(!strcmp(argv[i],"1a"))
{
version=0;
continue;
}
if(!strcmp(argv[i],"2"))
{
version=2;
continue;
}
if(!strcmp(argv[i],"3"))
{
version=3;
continue;
}
// When reaching this line, the version argument was invalid.
cerr<<"ERROR: invalid version argument\n"
<<"Type `solve_IP --help' for help on options.\n";
return 1;
}
if(!strcmp(argv[i],"-S"))
{
// initialize argument to the use of no criteria
S_pair_criteria=0;
do
{
// Check what S-pair criterion the next argument indicates.
// If none: The algorithm is called without S-pair criteria.
i++;
if(i>=argc-2)
// file arguments reached
break;
if(!strcmp(argv[i],"RP"))
{
S_pair_criteria|=1;
continue;
}
if(!strcmp(argv[i],"M"))
{
S_pair_criteria|=2;
continue;
}
if(!strcmp(argv[i],"F"))
{
S_pair_criteria|=4;
continue;
}
if(!strcmp(argv[i],"B"))
{
S_pair_criteria|=8;
continue;
}
if(!strcmp(argv[i],"2"))
{
S_pair_criteria|=16;
continue;
}
// option does not belong to an S-pair criterion
break;
}
while(1);
i--; // reset counter so that the outer loop
continue; // continues with the just considered argument
}
if(!strcmp(argv[i],"-p"))
{
// read interreduction percentage
i++;
char** rest;
interreduction_percentage=strtod(argv[i],rest);
// The function strtod converts a string into a double. As the
// specification is not correct, it may cause trouble...
// For example, if the argument can be read as a float, the value
// of rest should be NULL. This is not the case. Therefore, we can
// only check by the following string comparison if a float has been
// built. An argument as 15xy is thereby considered as valid
// (with interreduction_percentage==15.0).
if(!(strcmp(argv[i],*rest)))
// argument was no float
{
cerr<<"ERROR: invalid argument for interreduction percentage\n"
<<"Type `solve_IP --help' for help on options.\n";
return 1;
}
continue;
}
if(!strcmp(argv[i],"-alg") || !strcmp(argv[i],"--algorithm"))
{
// check if next argument is a valid algorithm specification
i++;
if(!strcmp(argv[i],"ct") || !strcmp(argv[i],"pct") ||
!strcmp(argv[i],"ect") || !strcmp(argv[i],"pt") ||
!strcmp(argv[i],"hs") || !strcmp(argv[i],"du") ||
!strcmp(argv[i],"blr"))
{
alg_option=i;
continue;
}
// When reaching this line, the algorithm argument was invalid.
cerr<<"ERROR: unkwon algorithm\n"
<<"Type `solve_IP --help' for help on options.\n";
return 1;
}
// When reaching this line, the argument is no legal option.
cerr<<"ERROR: invalid option "<<argv[i]
<<"\nType `solve_IP --help' for help on options.\n";
return 1;
}
///////////////////// call IP-algorithms ////////////////////////////////////
// open first input stream (MATRIX or GROEBNER file)
ifstream first_input(argv[argc-2]);
if(!first_input)
{
cerr<<"ERROR: cannot open first input file, possibly not found\n";
return 1;
}
// open second input stream (PROBLEM file)
ifstream second_input(argv[argc-1]);
if(!second_input)
{
cerr<<"ERROR: cannot open second input file, possibly not found\n";
return 1;
}
// check if the first input file is a MATRIX file; in that case,
// we have to compute a Groebner basis first
char format_string[128];
first_input>>format_string;
if(!strcmp(format_string,"MATRIX"))
{
if(alg_option==0)
{
cerr<<"ERROR: first input file is a MATRIX file;\n"
"algorithm has to be specified\n";
return 1;
}
// perform specified algorithm to compute a Groebner basis of the
// toric ideal defined by the input matrix
int success;
if(!strcmp(argv[alg_option],"ct"))
success=Conti_Traverso(argv[argc-2], version, S_pair_criteria,
interreduction_percentage, verbose);
if(!strcmp(argv[alg_option],"pct"))
success=Positive_Conti_Traverso(argv[argc-2], version,
S_pair_criteria,
interreduction_percentage, verbose);
if(!strcmp(argv[alg_option],"ect"))
success=Elim_Conti_Traverso(argv[argc-2], version, S_pair_criteria,
interreduction_percentage, verbose);
if(!strcmp(argv[alg_option],"pt"))
success=Pottier(argv[argc-2], version, S_pair_criteria,
interreduction_percentage, verbose);
if(!strcmp(argv[alg_option],"hs"))
success=Hosten_Sturmfels(argv[argc-2], version, S_pair_criteria,
interreduction_percentage, verbose);
if(!strcmp(argv[alg_option],"du"))
success=DiBiase_Urbanke(argv[argc-2], version, S_pair_criteria,
interreduction_percentage, verbose);
if(!strcmp(argv[alg_option],"blr"))
success=Bigatti_LaScala_Robbiano(argv[argc-2], version,
S_pair_criteria,
interreduction_percentage, verbose);
if(!success)
{
cerr<<"ERROR: could not perform required IP-algorithm,\n"
"no GROEBNER file created\n";
return 1;
}
// Groebner basis successfully computed
// now solve problems
char* GROEBNER=new char[128];
memset(GROEBNER,0,128);
int i=0;
while(argv[argc-2][i]!='\0' && argv[argc-2][i]!='.' && argv[argc-2][i]>' ')
{
GROEBNER[i]=argv[argc-2][i];
i++;
}
strcat(GROEBNER,".GB.");
strcat(GROEBNER,argv[alg_option]);
success=solve(argv[argc-1],GROEBNER);
delete[] GROEBNER;
return(!success);
// ! because 0 indicates in general a regular program termination
}
else
// first input file is no MATRIX file, GROEBNER file assumed
{
if(argc>3)
// input options are ignored when program is called with a
// GROEBNER file
cerr<<"WARNING: program called with a GROEBNER file,\n"
"specified options will not have any effect\n";
return(!solve(argv[argc-1],argv[argc-2]));
}
}
/////////////////////// provide help text ///////////////////////////////////
// handle the case of "missing" arguments
if((argc==2) && !strcmp(argv[1],"--help"))
// help required
{
system("less solve_IP.hlp");
return 0;
}
else
// invalid arguments
cerr<<"USAGE: solve_IP [options] toric_file problem_file\n"
<<"Type `solve_IP --help' for help on options.\n";
return 1;
}
#endif // SOLVE_IP_CC
|
