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
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
|
#. extracted from nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver
msgid ""
msgstr ""
"Project-Id-Version: PACKAGE VERSION\n"
"Report-Msgid-Bugs-To: https://bugs.libreoffice.org/enter_bug.cgi?product=LibreOffice&bug_status=UNCONFIRMED&component=UI\n"
"POT-Creation-Date: 2014-01-11 23:34+0100\n"
"PO-Revision-Date: 2013-01-21 00:26+0100\n"
"Last-Translator: Goran Rakic <grakic@devbase.net>\n"
"Language-Team: none\n"
"Language: sr\n"
"MIME-Version: 1.0\n"
"Content-Type: text/plain; charset=UTF-8\n"
"Content-Transfer-Encoding: 8bit\n"
"X-Generator: LibreOffice\n"
"X-Accelerator-Marker: ~\n"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"tit\n"
"help.text"
msgid "Options"
msgstr "Opcije"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"bm_id0503200917110375_scalc\n"
"help.text"
msgid "<bookmark_value>Solver for Nonlinear Problems;Options</bookmark_value>"
msgstr "<bookmark_value>Rešavač za nelinearne probleme;Opcije</bookmark_value>"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"hd_id0503200917103593\n"
"help.text"
msgid "General Options"
msgstr "Opšta podešavanja"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103780\n"
"help.text"
msgid "Size of Swarm"
msgstr "Veličina roja"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103723\n"
"help.text"
msgid "… defines the number of individuals to participate in the learning process. Each individual finds its own solutions and contributes to the overall knowledge."
msgstr "... određuje broj jedinki u procesu učenja. Svaka jedinka traži sopstvena rešenja i doprinosi ukupnom znanju."
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103771\n"
"help.text"
msgid "Learning Cycles"
msgstr "Broj ciklusa za učenje"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103720\n"
"help.text"
msgid "… defines the number of iterations, the algorithm should take. In each iteration, all individuals make a guess on the best solution and share their knowledge."
msgstr "... određuje broj iteracija koje će algoritam izvesti. U svakoj iteraciji sve jedinke pogađaju najbolje rešenje i razmenjuju novo znanje."
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103732\n"
"help.text"
msgid "Variable Bounds Guessing"
msgstr "Pogađanje ograničenja vrednosti"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id050320091710378\n"
"help.text"
msgid "If enabled (default), the algorithm tries to find variable bounds by looking at the starting values."
msgstr "Ako je omogućeno (podrazumevano) algoritam će pokušati da na osnovu početnih vrednosti pronađe granice za moguće vrednosti."
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103794\n"
"help.text"
msgid "Variable Bounds Threshold"
msgstr "Prag pri pogađanju ograničenja vrednosti"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103710\n"
"help.text"
msgid "When guessing variable bounds, this threshold specifies, how the initial values are shifted to build the bounds. For an example how these values are calculated, please refer to the Manual in the Wiki."
msgstr "Pri pogađanju ograničenja ovaj prag određuje način na koji se početne vrednosti pomeraju da se formira ograničenje. Potražite primer izračunavanja vrednosti u uputstvu objavljenom na vikiju."
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103740\n"
"help.text"
msgid "Use ACR Comparator"
msgstr "Koristi ACR komparator"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103766\n"
"help.text"
msgid "If <emph>disabled</emph> (default), the BCH Comparator is used. It compares two individuals by first looking at their constraint violations and only if those are equal, it measures their current solution."
msgstr "Ako <emph>nije omogućeno</emph> (podrazumevano), koristi se BCH komparator. On upoređuje dve jedinke gledajući prvo narušavanja ograničenja, i samo ukoliko su ona podjednaka, premerava njihovo trenutno rešenje."
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103744\n"
"help.text"
msgid "If <emph>enabled</emph>, the ACR Comparator is used. It compares two individuals dependent on the current iteration and measures their goodness with knowledge about the libraries worst known solutions (in regard to their constraint violations)."
msgstr "Ako <emph>je omogućeno</emph>, koristi se ACR komparator. On upoređuje dve jedinke zavisno od tekuće iteracije i meri njihovo podudaranje sa znanjem o najlošijim poznatim rešenjima (prema narušavanju ograničenja)."
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103792\n"
"help.text"
msgid "Use Random Starting Point"
msgstr "Nasumična početna tačka"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103790\n"
"help.text"
msgid "If <emph>enabled</emph>, the library is simply filled up with randomly chosen points."
msgstr "Ako je <emph>omogućeno</emph> biblioteka se prosto puni slučajno izabranim tačkama."
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103765\n"
"help.text"
msgid "If <emph>disabled</emph>, the currently present values (as given by the user) are inserted in the library as reference point."
msgstr "Ako <emph>nije omogućeno</emph>, unose se prisutne vrednosti koje navodi korisnik."
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0504200917103794\n"
"help.text"
msgid "Stagnation Limit"
msgstr "Limit za zaustavljanje"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id050320091710377\n"
"help.text"
msgid "If this number of individuals found solutions within a close range, the iteration is stopped and the best of these values is chosen as optimal."
msgstr ""
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103762\n"
"help.text"
msgid "Stagnation Tolerance"
msgstr "Dozvoljeno odstupanje pri zaustavljanju"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103834\n"
"help.text"
msgid "Defines in what range solutions are considered “similar”."
msgstr ""
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103891\n"
"help.text"
msgid "Show Enhanced Solver Status"
msgstr "Prikaži obogaćeno stanje rešavača"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0503200917103832\n"
"help.text"
msgid "If <emph>enabled</emph>, an additional dialog is shown during the solving process which gives information about the current progress, the level of stagnation, the currently best known solution as well as the possibility, to stop or resume the solver."
msgstr ""
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"hd_id0603200910392151\n"
"help.text"
msgid "DEPS-specific Options"
msgstr "Opcije za DEPS"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394232\n"
"help.text"
msgid "Agent Switch Rate"
msgstr "Brzina promene agenta"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394248\n"
"help.text"
msgid "Specifies the probability for an individual to choose the Differential Evolution strategy."
msgstr ""
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394277\n"
"help.text"
msgid "DE: Crossover Probability"
msgstr "DE: Verovatnoća ukrštanja"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394280\n"
"help.text"
msgid "… defines the probability of the individual being combined with the globally best point. If crossover is not used, the point is assembled from the own memory of the individual."
msgstr ""
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394216\n"
"help.text"
msgid "DE: Scaling Factor"
msgstr "DE: Faktor skaliranja"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id060320091039424\n"
"help.text"
msgid "During crossover, the scaling factor decides about the “speed” of movement."
msgstr ""
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id060320091039421\n"
"help.text"
msgid "PS: Constriction Coefficient"
msgstr "PS: Koeficijent suženja"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394225\n"
"help.text"
msgid "… defines the speed at which the particles/individuals move towards each other."
msgstr ""
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394222\n"
"help.text"
msgid "PS: Cognitive Constant"
msgstr "PS: Kognitivna konstanta"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394212\n"
"help.text"
msgid "… sets the importance of the own memory (in particular the best reached point so far)."
msgstr ""
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394292\n"
"help.text"
msgid "PS: Social Constant"
msgstr "PS: Društvena konstanta"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394284\n"
"help.text"
msgid "… sets the importance of the global best point between all particles/individuals."
msgstr ""
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id060320091039425\n"
"help.text"
msgid "PS: Mutation Probability"
msgstr "PS: Verovatnoća mutacije (0-0.005)"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910394272\n"
"help.text"
msgid "… defines the probability, that instead of moving a component of the particle towards the best point, it randomly chooses a new value from the valid range for that variable."
msgstr ""
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"hd_id0603200910401383\n"
"help.text"
msgid "SCO-specific Options"
msgstr "Opcije za SCO"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id0603200910401382\n"
"help.text"
msgid "Size of Library"
msgstr "Veličina biblioteke"
#: Options.xhp
msgctxt ""
"Options.xhp\n"
"par_id060320091040136\n"
"help.text"
msgid "… defines the amount of information to store in the public library. Each individual stores knowledge there and asks for information."
msgstr ""
#: Usage.xhp
msgctxt ""
"Usage.xhp\n"
"tit\n"
"help.text"
msgid "Usage"
msgstr "Upotreba"
#: Usage.xhp
msgctxt ""
"Usage.xhp\n"
"bm_id0603200910434044_scalc\n"
"help.text"
msgid "<bookmark_value>Solver for Nonlinear Problems;Usage</bookmark_value>"
msgstr "<bookmark_value>Rešavač za nelinearne probleme;Upotreba</bookmark_value>"
#: Usage.xhp
#, fuzzy
msgctxt ""
"Usage.xhp\n"
"hd_id0603200910430882\n"
"help.text"
msgid "Usage"
msgstr "Upotreba"
#: Usage.xhp
msgctxt ""
"Usage.xhp\n"
"par_id0603200910430845\n"
"help.text"
msgid "Regardless whether you use DEPS or SCO, you start by going to Tools → Solver and set the Cell to be optimized, the direction to go (minimization, maximization) and the cells to be modified to reach the goal. Then you go to the Options and specify the solver to be used and if necessary adjust the according <link href=\"com.sun.star.comp.Calc.NLPSolver/Options.xhp\">parameters</link>."
msgstr ""
#: Usage.xhp
msgctxt ""
"Usage.xhp\n"
"par_id0603200910430821\n"
"help.text"
msgid "There is also a list of constraints you can use to restrict the possible range of solutions or to penalize certain conditions. However, in case of the evolutionary solvers DEPS and SCO, these constraints are also used to specify bounds on the variables of the problem. Due to the random nature of the algorithms, it is <emph>highly recommended</emph> to do so and give upper (and in case \"Assume Non-Negative Variables\" is turned off also lower) bounds for all variables. They don't have to be near the actual solution (which is probably unknown) but should give a rough indication of the expected size (0 ≤ var ≤ 1 or maybe -1000000 ≤ var ≤ 1000000)."
msgstr ""
#: Usage.xhp
msgctxt ""
"Usage.xhp\n"
"par_id0603200910430873\n"
"help.text"
msgid "Bounds are specified by selecting one or more variables (as range) on the left side and entering a numerical value (not a cell or a formula) on the right side. That way you can also choose one or more variables to be <emph>Integer</emph> or <emph>Binary</emph> only."
msgstr ""
#: help.tree
msgctxt ""
"help.tree\n"
"08\n"
"help_section.text"
msgid "Solver for Nonlinear Problems"
msgstr "Rešavač za nelinearne probleme"
#: help.tree
#, fuzzy
msgctxt ""
"help.tree\n"
"0816\n"
"node.text"
msgid "Solver for Nonlinear Problems"
msgstr "Rešavač za nelinearne probleme"
|