209 lines
10 KiB
Plaintext
209 lines
10 KiB
Plaintext
#. extracted from nlpsolver/help/en/com.sun.star.comp.Calc.NLPSolver.oo
|
||
msgid ""
|
||
msgstr ""
|
||
"Project-Id-Version: PACKAGE VERSION\n"
|
||
"Report-Msgid-Bugs-To: http://qa.openoffice.org/issues/enter_bug.cgi?comment=&component=l10n&form_name=enter_issue&short_desc=Localization+issue+in+file%3A+nlpsolver%2Fhelp%2Fen%2Fcom.sun.star.comp.Calc.NLPSolver.oo&subcomponent=ui\n"
|
||
"POT-Creation-Date: 2012-01-21 15:59+0200\n"
|
||
"PO-Revision-Date: 2012-02-10 09:43+0200\n"
|
||
"Last-Translator: Zeki <zeki@ozgurlukicin.com>\n"
|
||
"Language-Team: LANGUAGE <LL@li.org>\n"
|
||
"Language: tr\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-Generator: Pootle 2.1.6\n"
|
||
"X-Accelerator-Marker: ~\n"
|
||
|
||
#: Options.xhp#tit.help.text
|
||
msgid "Options"
|
||
msgstr "Seçenekler"
|
||
|
||
#: Options.xhp#bm_id0503200917110375_scalc.help.text
|
||
msgid "<bookmark_value>Solver for Nonlinear Problems;Options</bookmark_value>"
|
||
msgstr "<bookmark_value>Lineer Olmayan Sorular için Çözücü;Ayarlar</bookmark_value>"
|
||
|
||
#: Options.xhp#hd_id0503200917103593.help.text
|
||
msgid "General Options"
|
||
msgstr "Genel Seçenekler"
|
||
|
||
#: Options.xhp#par_id0503200917103780.help.text
|
||
msgid "Size of Swarm"
|
||
msgstr "Küme Boyutu"
|
||
|
||
#: Options.xhp#par_id0503200917103723.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 "... öğrenme sürecine katılan bireylerin sayısını belirler. Her birey kendi çözümünü bulur ve toplam bilgiye katkı sağlar."
|
||
|
||
#: Options.xhp#par_id0503200917103771.help.text
|
||
msgid "Learning Cycles"
|
||
msgstr "Öğrenme Döngüleri"
|
||
|
||
#: Options.xhp#par_id0503200917103720.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 "... algoritmanın alacağı yinelemelerin sayısını belirler. Her yinelemede, her birey en iyi çözüm için tahminde bulunur ve bilgi birikimlerini paylaşır."
|
||
|
||
#: Options.xhp#par_id0503200917103732.help.text
|
||
#, fuzzy
|
||
msgid "Variable Bounds Guessing"
|
||
msgstr "Değişken Bağlar Tahmin Ediliyor"
|
||
|
||
#: Options.xhp#par_id050320091710378.help.text
|
||
msgid "If enabled (default), the algorithm tries to find variable bounds by looking at the starting values."
|
||
msgstr "Etkinse (varsayılan), algoritma başlangıç değerlerini inceleyerek değişken bağımlılığınıı bulmayı dener."
|
||
|
||
#: Options.xhp#par_id0503200917103794.help.text
|
||
msgid "Variable Bounds Threshold"
|
||
msgstr "Değişken Bağlılıkları Eşiği"
|
||
|
||
#: Options.xhp#par_id0503200917103710.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 "Bu eşik ile, değişken bağlılıkları seçilirken,başlangıç değerlerinin bağlılıkları kurmak için nasıl değiştirileceğini belirlenir. Değer hesaplamalarını incelemek için lütfen Wiki Yardım kısmına bakınız."
|
||
|
||
#: Options.xhp#par_id0503200917103740.help.text
|
||
msgid "Use ACR Comparator"
|
||
msgstr "ACR Karşılaştırıcısı kullan"
|
||
|
||
#: Options.xhp#par_id0503200917103766.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 ""
|
||
|
||
#: Options.xhp#par_id0503200917103744.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 ""
|
||
|
||
#: Options.xhp#par_id0503200917103792.help.text
|
||
msgid "Use Random Starting Point"
|
||
msgstr "Rasgele Başlangıç Noktası Kullan"
|
||
|
||
#: Options.xhp#par_id0503200917103790.help.text
|
||
msgid "If <emph>enabled</emph>, the library is simply filled up with randomly chosen points."
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id0503200917103765.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 ""
|
||
|
||
#: Options.xhp#par_id0504200917103794.help.text
|
||
msgid "Stagnation Limit"
|
||
msgstr "Yanıtsızlık Sınırı"
|
||
|
||
#: Options.xhp#par_id050320091710377.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#par_id0503200917103762.help.text
|
||
msgid "Stagnation Tolerance"
|
||
msgstr "Yanıtsızlık Toleransı"
|
||
|
||
#: Options.xhp#par_id0503200917103834.help.text
|
||
msgid "Defines in what range solutions are considered “similar”."
|
||
msgstr "Çözümlerin hangi aralıkla \"benzer\" olarak tanımlanacağını belirler."
|
||
|
||
#: Options.xhp#par_id0503200917103891.help.text
|
||
msgid "Show Enhanced Solver Status"
|
||
msgstr "Gelişmiş Çözüm Durumunu Göster"
|
||
|
||
#: Options.xhp#par_id0503200917103832.help.text
|
||
msgid "If <emph>enabled</emph>, an additional dialog is shown during the solving process which gives informations 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#hd_id0603200910392151.help.text
|
||
msgid "DEPS-specific Options"
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id0603200910394232.help.text
|
||
msgid "Agent Switch Rate"
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id0603200910394248.help.text
|
||
msgid "Specifies the probability for an individual to choose the Differential Evolution strategy."
|
||
msgstr "Bireyin Diferansiyel Evrim yöntemini belirlemesi için gerekli olasılığı belirtir."
|
||
|
||
#: Options.xhp#par_id0603200910394277.help.text
|
||
msgid "DE: Crossover Probability"
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id0603200910394280.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#par_id0603200910394216.help.text
|
||
msgid "DE: Scaling Factor"
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id060320091039424.help.text
|
||
msgid "During crossover, the scaling factor decides about the “speed” of movement."
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id060320091039421.help.text
|
||
msgid "PS: Constriction Coefficient"
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id0603200910394225.help.text
|
||
msgid "… defines the speed at which the particles/individuals move towards each other."
|
||
msgstr "... parçacıkların/bireylerin birbirlerine doğru hareket etme hızlarını tanımlar."
|
||
|
||
#: Options.xhp#par_id0603200910394222.help.text
|
||
msgid "PS: Cognitive Constant"
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id0603200910394212.help.text
|
||
msgid "… sets the importance of the own memory (in particular the best reached point so far)."
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id0603200910394292.help.text
|
||
msgid "PS: Social Constant"
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id0603200910394284.help.text
|
||
msgid "… sets the importance of the global best point between all particles/individuals."
|
||
msgstr "Tüm arçacıklar/bireyler arasındaki küresel en iyi noktanın önemini kurar."
|
||
|
||
#: Options.xhp#par_id060320091039425.help.text
|
||
msgid "PS: Mutation Probability"
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id0603200910394272.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 "... parçacık bileşenin en iyi noktaya hareketinden ziyade değişken için geçerli aralıktan rastgele yeni değer seçilme olasılığını tanımlar."
|
||
|
||
#: Options.xhp#hd_id0603200910401383.help.text
|
||
msgid "SCO-specific Options"
|
||
msgstr ""
|
||
|
||
#: Options.xhp#par_id0603200910401382.help.text
|
||
msgid "Size of Library"
|
||
msgstr "Kitaplık Boyutu"
|
||
|
||
#: Options.xhp#par_id060320091040136.help.text
|
||
msgid "… defines the amount of informations to store in the public library. Each individual stores knowledge there and asks for informations."
|
||
msgstr "... ortak kitaplıkta saklanacak bilgi miktarını tanımlar. Her birey bilgisini orada saklar ve oradan bilgi ister."
|
||
|
||
#: Usage.xhp#tit.help.text
|
||
msgctxt "Usage.xhp#tit.help.text"
|
||
msgid "Usage"
|
||
msgstr "Kullanım"
|
||
|
||
#: Usage.xhp#bm_id0603200910434044_scalc.help.text
|
||
#, fuzzy
|
||
msgid "<bookmark_value>Solver for Nonlinear Problems;Usage</bookmark_value>"
|
||
msgstr "<bookmark_value>Lineer Olmayan Sorular için Çözücü;Ayarlar</bookmark_value>"
|
||
|
||
#: Usage.xhp#hd_id0603200910430882.help.text
|
||
msgctxt "Usage.xhp#hd_id0603200910430882.help.text"
|
||
msgid "Usage"
|
||
msgstr "Kullanım"
|
||
|
||
#: Usage.xhp#par_id0603200910430845.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#par_id0603200910430821.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#par_id0603200910430873.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 "Sınırlar sol tarafta bir ya da daha fazla değişkenin (aralık için) seçilip sağ tarafa nümerik bir değerin (hücre ya da bağıntı değil) girilmesi ile belirtilir. Bu şekilde bir ya da daha fazla değişken <emph>Tam sayı</emph> ya da yalnızca <emph>İkili</emph> olarak da belirtilebilir."
|