[Sacrificium deo vespertinum notis musicis adornatum, sive Delectus vesperarum ...] : [opus III]

R. P. Peregrini PoeglRISM A/I P 496

Incensum dignum ... Hoc est Offertoria XIX, pro omnibus ... festis ... : à 4 vocibus canto, alto, tenore & basso. 2. violinis & organo concertantibus; alto viola & clarinis fivé litius pro libitu omittendis ... Opus V

ab authore R. P. Peregrino PöglRISM A/I P 4967Vorlageform des Erscheinungsvermerks: Typis & Sumptibus Monasterii, penes quod etiam Exemplaria reperienda sunt. NEOSTADII MDCCLI

Латинская и древнегреческая лексика в немецком языке. Заимствованные и иноязычные слова древнего происхождения

Основу книги составляют древнегреческо-немецкий и латинско-немецкий словники, в которые вошла лексика классических языков и соответствующие заимствования с дериватами в немецком языке.Список основных греко-латинских префиксов и их значений: с. 8-9. Список основных греко-латинских суффиксов и их значений: с. 10. Греческий алфавит: с. 11. Знаки ударения и придыхания в греческом языке, ударение в греческом и латинском языках: с. 12. Латинские и греческие крылатые выражения: с. 179-184. Алфавитный указатель иноязычных и заимствованных слов и основных греко-латинских словообразовательных элементов, содержащихся в книге: с. 185-222. Библ.: с. 223

874 A Cache-Aware Algorithm for PDEs on Hierarchical Data Structures

Abstract. A big challenge in implementing up to date simulation software for various applications is to bring together highly efficient mathematical methods on the one hand side and an efficient usage of modern computer archtitectures on the other hand. We concentrate on the solution of PDEs and demonstrate how to overcome the hereby occuring quandary between cache-efficiency and modern multilevel methods on adaptive grids. Our algorithm is based on stacks, the simplest possible and thus very cache-efficient data structures.

Use of a Monte-Carlo based probability matrix for 3D iterative reconstruction of MADPET–II data

under development, is characterized by a small diameter (71 mm), two radial layers of detectors and by small LSO crystal elements read out individually by avalanche photodiodes. To exploit this configuration, aimed at achieving high resolution and high sensitivity, we intend to reconstruct a FOV almost as large as the opening of the device. However, parallax errors may hinder this task. To overcome this problem, our objective was to implement fully 3D reconstruction techniques (MLEM and OSEM) based on an accurate description of the system response. The main feature of our method is the calculation of the probability system matrix by means of Monte-Carlo simulations. This approach requires the sorting of the simulated data into the matrix, a computationally expensive procedure hindered by the huge size of the matrix. In order to handle this problem, we have employed a database management system (DB2), which has proven to be a practical solution. In this work we also studied the effect of applying the underlying symmetries within the matrix to reduce statistical noise affecting the matrix elements and to save disk space. The results showed that this procedure increases the SNR and contrast. The transaxial resolution calculated from a phantom consisting of 7 point sources degraded slowly towards the edges of the FOV: for a source at r = 0 the FWHM was 1.0 mm, while for a source at r = 30 mm, the FWHM was 2.0 mm. The use of the symmetries allowed us to reduce the resolution degradation (FWHM = 1.4 mm for r = 30 mm). Despite the gaps between modules and between detectors, rotation of the scanner was not needed. For the 3D case, an important issue is to improve the accuracy and the statistical quality of the matrix. This is the objective of our future work. Index Terms — small animal PET, iterative reconstruction, Monte Carlo simulations, system probability matrix. I