You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Includes subject section, name section, and 1968-1970, technical reports.
Table of contents
None
None
Magicians, necromancers and astrologers are assiduous characters in the European golden age theatre. This book deals with dramatic characters who act as physiognomists or palm readers in the fictional world and analyses the fictionalisation of physiognomic lore as a practice of divination in early modern Romance theatre from Pietro Aretino and Giordano Bruno to Lope de Vega, Calderón de la Barca and Thomas Corneille.
First multi-year cumulation covers six years: 1965-70.
"The Encyclopedia of Library and Information Science provides an outstanding resource in 33 published volumes with 2 helpful indexes. This thorough reference set--written by 1300 eminent, international experts--offers librarians, information/computer scientists, bibliographers, documentalists, systems analysts, and students, convenient access to the techniques and tools of both library and information science. Impeccably researched, cross referenced, alphabetized by subject, and generously illustrated, the Encyclopedia of Library and Information Science integrates the essential theoretical and practical information accumulating in this rapidly growing field."
This thesis contributes to the field of inverse problems with sparsity constraints. Since the pioneering work by Daubechies, Defries and De Mol in 2004, methods for solving operator equations with sparsity constraints play a central role in the field of inverse problems. This can be explained by the fact that the solutions of many inverse problems have a sparse structure, in other words, they can be represented using only finitely many elements of a suitable basis or dictionary. Generally, to stably solve an ill-posed inverse problem one needs additional assumptions on the unknown solution--the so-called source condition. In this thesis, the sparseness stands for the source condition, and with that in mind, stability results for two different approximation methods are deduced, namely, results for the Tikhonov regularization with a sparsity-enforcing penalty and for the orthogonal matching pursuit. The practical relevance of the theoretical results is shown with two examples of convolution type, namely, an example from mass spectrometry and an example from digital holography of particles.