458 lines
12 KiB
Plaintext
458 lines
12 KiB
Plaintext
#. 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: 2022-07-06 20:19+0200\n"
|
|
"PO-Revision-Date: 2024-06-20 01:45+0000\n"
|
|
"Last-Translator: Ilham Nurwansah <ilhamnurwansah@gmail.com>\n"
|
|
"Language-Team: Sundanese <https://translations.documentfoundation.org/projects/libo_ui-master/nlpsolverhelpencomsunstarcompcalcnlpsolver/su/>\n"
|
|
"Language: sun\n"
|
|
"MIME-Version: 1.0\n"
|
|
"Content-Type: text/plain; charset=UTF-8\n"
|
|
"Content-Transfer-Encoding: 8bit\n"
|
|
"Plural-Forms: nplurals=1; plural=0;\n"
|
|
"X-Accelerator-Marker: ~\n"
|
|
"X-Generator: Weblate 5.4.3\n"
|
|
|
|
#. XpeLj
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"tit\n"
|
|
"help.text"
|
|
msgid "Options"
|
|
msgstr "Pilihan"
|
|
|
|
#. GfZUJ
|
|
#: 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>Pangungkul Masalah-masalah Teu liniér;Pilihan</bookmark_value>"
|
|
|
|
#. FCECT
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"hd_id0503200917103593\n"
|
|
"help.text"
|
|
msgid "General Options"
|
|
msgstr "Pilihan Umum"
|
|
|
|
#. ZkCEe
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0503200917103780\n"
|
|
"help.text"
|
|
msgid "Size of Swarm"
|
|
msgstr "Ukuran Gundukan"
|
|
|
|
#. hRGYs
|
|
#: 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 "... nangtukeun réana individu anu miluan prosés diajar. Unggal individu manggihan solusina séwang-séwangan sarta nyumbangkeun kana pangaweruh kalawan gumulung."
|
|
|
|
#. zReEK
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0503200917103771\n"
|
|
"help.text"
|
|
msgid "Learning Cycles"
|
|
msgstr "Siklus Diajar"
|
|
|
|
#. mDzwh
|
|
#: 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 "... nangtukeun réana iterasi anu kudu dijalankeun ku algoritma. Dina unggal iterasi, sakabéh individu nyieun hiji teguhan kana solusi panghadéna sarta ngabagikeun pangaweruhna."
|
|
|
|
#. SWBAK
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0503200917103732\n"
|
|
"help.text"
|
|
msgid "Variable Bounds Guessing"
|
|
msgstr "Teguhan Wates Variabel"
|
|
|
|
#. 86AX8
|
|
#: 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 "Lamun digunakeun (baku), algoritma nyoba néangan wates variabel ku cara ningali peunteun mimiti."
|
|
|
|
#. 7tnqA
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0503200917103794\n"
|
|
"help.text"
|
|
msgid "Variable Bounds Threshold"
|
|
msgstr "Ambang Wates Variabel"
|
|
|
|
#. 6fpGp
|
|
#: 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 "Nalika neguh wates variabel, ieu ambang nangtukeun kumaha peunteun nu mimiti diésérkeun pikeun ngawangun wates-wates. Pikeun conto kumaha ieu peunteun diitungna, prak tingali Manual dina Wiki."
|
|
|
|
#. 4nKkq
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0503200917103740\n"
|
|
"help.text"
|
|
msgid "Use ACR Comparator"
|
|
msgstr "Paké Pangbanding ACR"
|
|
|
|
#. eVij6
|
|
#: 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 "Lamun <emph>dipareuman</emph>(asalna), mangka Pangbanding BCH dipaké. Ieu ngabandingkeun dua individu ku cara ningali heula palanggaran wengkuan jeung lamun sarua, mangka éta ngukur solusina sorangan kiwari."
|
|
|
|
#. wHTo3
|
|
#: 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 "Lamun <emph>dihurungkeun</emph>, mangka Pangbanding ACR dipaké. Ieu ngabandingkeun dua individu gumantung kana iterasi jeung ngukur kahadéanana ku pangaweruh ngeunaan pustaka solusi panggoréngna anu dipikanyaho (patali jeung ngarumpak watesan)."
|
|
|
|
#. 5jPbx
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0503200917103792\n"
|
|
"help.text"
|
|
msgid "Use Random Starting Point"
|
|
msgstr "Paké Titik Mimiti Acak"
|
|
|
|
#. pt3XB
|
|
#: 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 "Lamun <emph>dihurungkan</emph>, pustaka copélna dieusian ku titik anu dipilihan kalawan acak."
|
|
|
|
#. HFv6w
|
|
#: 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 "Lamun <emph>dipareuman</emph>, ajén anu kiwari aya (nu dibéré ku pamaké) diasupkeun dina pustaka minangka titik rujukan."
|
|
|
|
#. TYEBG
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0504200917103794\n"
|
|
"help.text"
|
|
msgid "Stagnation Limit"
|
|
msgstr "Wates Stagnasi"
|
|
|
|
#. nWRYK
|
|
#: 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 ""
|
|
|
|
#. UFcxy
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0503200917103762\n"
|
|
"help.text"
|
|
msgid "Stagnation Tolerance"
|
|
msgstr ""
|
|
|
|
#. F3qEp
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0503200917103834\n"
|
|
"help.text"
|
|
msgid "Defines in what range solutions are considered “similar”."
|
|
msgstr ""
|
|
|
|
#. RUbSm
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0503200917103891\n"
|
|
"help.text"
|
|
msgid "Show Enhanced Solver Status"
|
|
msgstr ""
|
|
|
|
#. zmkYh
|
|
#: 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 ""
|
|
|
|
#. KH5yg
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"hd_id0603200910392151\n"
|
|
"help.text"
|
|
msgid "DEPS-specific Options"
|
|
msgstr ""
|
|
|
|
#. ZU7FF
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0603200910394232\n"
|
|
"help.text"
|
|
msgid "Agent Switch Rate"
|
|
msgstr ""
|
|
|
|
#. 2zhCp
|
|
#: 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 ""
|
|
|
|
#. 2yhKo
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0603200910394277\n"
|
|
"help.text"
|
|
msgid "DE: Crossover Probability"
|
|
msgstr ""
|
|
|
|
#. eDjrN
|
|
#: 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 ""
|
|
|
|
#. DfF2d
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0603200910394216\n"
|
|
"help.text"
|
|
msgid "DE: Scaling Factor"
|
|
msgstr ""
|
|
|
|
#. ThmU9
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id060320091039424\n"
|
|
"help.text"
|
|
msgid "During crossover, the scaling factor decides about the “speed” of movement."
|
|
msgstr ""
|
|
|
|
#. pxYLF
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id060320091039421\n"
|
|
"help.text"
|
|
msgid "PS: Constriction Coefficient"
|
|
msgstr ""
|
|
|
|
#. CPpbg
|
|
#: 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 ""
|
|
|
|
#. dGVYP
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0603200910394222\n"
|
|
"help.text"
|
|
msgid "PS: Cognitive Constant"
|
|
msgstr ""
|
|
|
|
#. HmszE
|
|
#: 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 ""
|
|
|
|
#. ktGLv
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0603200910394292\n"
|
|
"help.text"
|
|
msgid "PS: Social Constant"
|
|
msgstr ""
|
|
|
|
#. CkqZA
|
|
#: 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 ""
|
|
|
|
#. BAGAU
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id060320091039425\n"
|
|
"help.text"
|
|
msgid "PS: Mutation Probability"
|
|
msgstr ""
|
|
|
|
#. CyJWk
|
|
#: 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 ""
|
|
|
|
#. JbhLh
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"hd_id0603200910401383\n"
|
|
"help.text"
|
|
msgid "SCO-specific Options"
|
|
msgstr ""
|
|
|
|
#. zCr2J
|
|
#: Options.xhp
|
|
msgctxt ""
|
|
"Options.xhp\n"
|
|
"par_id0603200910401382\n"
|
|
"help.text"
|
|
msgid "Size of Library"
|
|
msgstr ""
|
|
|
|
#. RSA7B
|
|
#: 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 ""
|
|
|
|
#. CoicK
|
|
#: Usage.xhp
|
|
msgctxt ""
|
|
"Usage.xhp\n"
|
|
"tit\n"
|
|
"help.text"
|
|
msgid "Usage"
|
|
msgstr ""
|
|
|
|
#. B5wxZ
|
|
#: Usage.xhp
|
|
msgctxt ""
|
|
"Usage.xhp\n"
|
|
"bm_id0603200910434044_scalc\n"
|
|
"help.text"
|
|
msgid "<bookmark_value>Solver for Nonlinear Problems;Usage</bookmark_value>"
|
|
msgstr ""
|
|
|
|
#. FXuKu
|
|
#: Usage.xhp
|
|
msgctxt ""
|
|
"Usage.xhp\n"
|
|
"hd_id0603200910430882\n"
|
|
"help.text"
|
|
msgid "Usage"
|
|
msgstr ""
|
|
|
|
#. 8YjMm
|
|
#: Usage.xhp
|
|
msgctxt ""
|
|
"Usage.xhp\n"
|
|
"par_id0603200910430845\n"
|
|
"help.text"
|
|
msgid "Regardless whether you use DEPS or SCO, you start by going to <menuitem>Tools - Solver</menuitem> 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 ""
|
|
|
|
#. iuEnw
|
|
#: 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 ""
|
|
|
|
#. E5pcq
|
|
#: 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 ""
|
|
|
|
#. 4SEEA
|
|
#: help.tree
|
|
msgctxt ""
|
|
"help.tree\n"
|
|
"08\n"
|
|
"help_section.text"
|
|
msgid "Solver for Nonlinear Problems"
|
|
msgstr ""
|
|
|
|
#. 3sHVz
|
|
#: help.tree
|
|
msgctxt ""
|
|
"help.tree\n"
|
|
"0816\n"
|
|
"node.text"
|
|
msgid "Solver for Nonlinear Problems"
|
|
msgstr ""
|