Логическое управление и технологические защиты : методические указания к практическим работам

В пособии представлены практические задания по дисциплине «Логическое управление и защиты» Каждая работа содержит краткое изложение теоретических сведений, разобранные примеры выполнения заданий и варианты для самостоятельной индивидуальной проработки изученного материала. В практических работах затрагиваются законы алгебры логики Буля, основные логические элементы, известные методы построения и минимизации логических схем, а также вопросы синтеза и анализа конечных логических автоматов. Предназначено для магистров, обучающихся по направлению 13.04.01 «Теплоэнергетика и теплотехника»

Fast computation tools for adaptive wavelet schemes

During the past few years, a new algorithmic paradigm for adaptive wavelet schemes was developed. First approaches covered elliptic problems, but meanwhile, the class of feasible problems could be significantly enlarged, including even certain nonlinear problems. This thesis will present and analyze routines for key tasks arising in connection with those schemes. The central point will be a so called recovery scheme that allows to compute arrays of wavelet coefficients efficiently by treating the array as a whole instead of treating each entry separately by quadrature schemes. The tools and methods we develop are realized in a C++ implementation by the author, which we present in form of a schematic overview. All numerical studies presented in the thesis are based on this implementation

Adaptive Application of Operators in Standard Representation ∗

Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of non coercive problems such as saddle point problems [8, 9, 12]. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems

The IGPM Villemoes Machine

In this note, we describe a program which can be used to estimate the Hölder regularity of refinable functions. The regularity estimates are carried out by means of the refinement mask. The theoretical background is briefly explained and a detailed description how to install and to use the program is given

Some Remarks on Quadrature Formulas for Refinable Functions and Wavelets

This paper is concerned with the efficient computation of integrals of (smooth) functions against refinable functions and wavelets, respectively. We derive quadrature formulas of Gauss-type using these functions as weight functions. The methods are tested for several model problems and possible practical applications are discussed