ʿEśrîm we-arbaʿ oif ṭaiṭš : ein oiṭ enndišr ṭaiṭš oif jedn worṭ ...

Digitalisat der Ausg. Prag, [1764/65]

Brivšṭellr oder Patšegen hak-ketāv : le-ḥinnûk neʿārîm meyûssād ʿal-pî darkê hal-lāšôn we-ham-melîṣā ...

ḥûbberû mē'ēt ... Ṣevî Hirš Ben- ... Mē'îr

Devārîm aḥadîm : kôlēl ʿinyānîm šônîm derāšā we-sippûr û-māzāl ; oif welcher weize man kann be-emes reṭṭen Galitzien ...

Jitzḥak Weber

Sēfer Śîaḥ Yiṣḥāq : we-hû min Pele yôʿēṣ ; has-sēfer haz-ze neʿttāq mik-kammā sefārîm ... û-vî-feraṭ min has-sēfer Pele yôʿēṣ ... gam neʿttāq bô kammā dinîm ... ; oif ivri-ṭaiṭš ...

ham-maʿttîq Yiṣḥāq B. ... Efrayim Fišel Hamburger mi- ... Qrâqā

Brivšṭellr oder Patšegen hak-ketāv : le-ḥinnûk neʿārîm meyûssād ʿal-pî darkê hal-lāšôn we-ham-melîṣā ...

ḥûbberû mē'ēt ... Ṣevî Hirš Ben- ... Mē'îr

Sēfer Maṭṭē Aharôn : bi-šenê ḥalāqîm, kôlēl derûšîm yeqārîm bi-šeʾēlat had-dāt û-vi-šeʾēlat haz-zemān ; we-ḥiddûšê gapa"t ...

hēḵînô Aharôn Dāwid b. R. Ḥayyîm hak-Kōhēn Zeldner

Nachrichṭ fon dem gegnwerṭign tzušṭand, bisherign forṭgang und eignṭlichm endtzwek der Fraiešule (ḥevrat ḥinnûk neʿārîm) tzu Berlin

di direktzion des Insṭiṭuṭs Ḥinnûk Neʿ̄arîm

Šîrîm : (lider un poemen)

Ḥ. N. Bialik

Maʿanē lāšôn oif ṭaiṭš : woś man zol zogen oif die elṭern und fraindś (qevārîm) oich (ʿerev rôš haš-šānā und ʿerev yôm kippûr) ...

Digitalisat der Ausg. Fürth, 1860

Sēfer Divrê yôšer : hā-lô hem ketûvîm ʿal sifrê yešārîm ...

ḥibbērô Avrāhām Ben ... Menaḥēm Mendelî Šwab ...

Šṭaṭuṭen der "Ḥevrā Maḥzîqê Baḥûrîm" Waiṭtzen

Digitalisat der Ausg. Budapesṭ, [1878/79]

Guarantie-Schein von acht gesessenen Bürgerlichen Deputirten, die Einkünffte der Stadt auff hundert tausend Gülden jährlichen Einkünfften, auff den Fuß, wie sie Magistratus bißher erhebt, gleich in primo anno weiter und hernach viel höher zuverrechnen : In Causa Commissionis Impetrantischer Bürgerschafft der Kayserl. Freyen Reichs- auch Wahl- und Crönungs-Stadt Franckfurth Contra E. E. Rath allda ; Ihro Röm. Kayserl. Majestät benebenst einem allerunterthänigsten Memorial sub lit. B originaliter ... den 28. Jan. 1715 ... überreicht

[David Düring, Peter Bischoff, Johannes Klotz, Johann Conrad Siegling, Paul Hennrici, David Klotz, Joh. Dietrich Notebohm, Joachim Hoppe] [[Elektronische Ressource]]

A Genetic Algorithm to associate optical measurements and estimate orbits of geocentric objects

Cataloging geocentric objects can be put in the framework of Multiple Target Tracking (MTT). Current work tends to focus on the S = 2 MTT problem because of its favorable computational complexity of O(n²). The MTT problem becomes NP-hard for a dimension of S˃3. The challenge is to find an approximation to the solution within a reasonable computation time. To effciently approximate this solution a Genetic Algorithm is used. The algorithm is applied to a simulated test case. These results represent the first steps towards a method that can treat the S˃3 problem effciently and with minimal manual intervention.

A study of the time complexity of an Elitist Genetic Algorithm used for associating optical observations of MEO and GEO Space Debris

Currently several thousands of objects are being tracked in the MEO and GEO regions through optical means. The problem faced in this framework is that of Multiple Target Tracking (MTT). In this context both the correct associations among the observations, and the orbits of the objects have to be determined. The complexity of the MTT problem is defined by its dimension S. Where S stands for the number of ’fences’ used in the problem, each fence consists of a set of observations that all originate from dierent targets. For a dimension of S ˃ the MTT problem becomes NP-hard. As of now no algorithm exists that can solve an NP-hard problem in an optimal manner within a reasonable (polynomial) computation time. However, there are algorithms that can approximate the solution with a realistic computational e ort. To this end an Elitist Genetic Algorithm is implemented to approximately solve the S ˃ MTT problem in an e cient manner. Its complexity is studied and it is found that an approximate solution can be obtained in a polynomial time. With the advent of improved sensors and a heightened interest in the problem of space debris, it is expected that the number of tracked objects will grow by an order of magnitude in the near future. This research aims to provide a method that can treat the correlation and orbit determination problems simultaneously, and is able to e ciently process large data sets with minimal manual intervention.