|
|
Electronic means for creation, release and distribution of music
Šebek, Michael ; Pavlíček, Antonín (advisor) ; Oškrdal, Václav (referee)
Electronic means for creation, release and distribution of music are covered by the Bachelor thesis, particularly from a starting author's point of view. Major modes to release electronic music are reviewed with a particular focus on internet operating online music distributors that link the authors with music e-shops. Dozens of online distributors are reviewed for the conditions and services they offer to starting authors. Based on the data acquired by an original research, the online distributors are evaluated and compared according to the total benefit the author can achieve. The marketing of both singles and albums is considered. A new concept of averaged album is introduced to cope with diversity of distributors. Several methods are proposed and used to evaluate and compare the author's profit. Calculations are performed using a fixed number as well as an expected number of units sold. An electronic music debutant may apply the recommendations derived in the thesis, consult the data tables and the charts included in the text or even run the presented methods on his or her own. Intellectual property rights are also discussed and several organizations protecting the rights of music authors are reviewed and evaluated from a starting author's point of view.
|
|
|
Výpočet determinantu rozměrné matice Sylvesterova typu
Kujan, Petr ; Hromčík, M. ; Šebek, Michael
This work is devoted to computation of large n-D polynomial determinants with a special structure. Applications involve n-D systems theory (e.g. coprimeness test for two n-D polynomials) or the theory of algebraic equations. More specifically, these determinants were exploited by Chiasson recently to solve the practical problem of multilevel converter by a special computational procedure. To tackle the concerned problem it is essential to solve a system of polynomial equations with many unknowns.
|
|
|
Numerical algorithms for polynomial matrices
Hromčík, Martin ; Šebek, Michael
This report is devoted to new numerical methods for computations with polynomials and polynomial matrices that are encountered when solving the problems of control systems design via the algebraic methods. A distinguishing feature ofour approach is the extensive employment of the discrete Fourier transform tech-niques, namely of the famous Fast Fourier Transform routine and its relation to polynomial interpolation and Z-transform.
|
|
|
Modular shift of a polynomial matrix using Matlab
Hurák, Zdeněk ; Šebek, Michael
Efficient algorithm for modular shift of a polynomial matrix is proposed in this note.The algorithm avoids any iteration that is inherent in standard Euclidean algorithm for division of polynomial matrices.It assumes that the denominator polynomial matrix is row-reduced.If it is not,it can always be transformed into row-reduced form accepting some additional computational cost. Numerical experiments with an implementation of the proposed algorithm in Matlab are reported.
|
|
|
New algorithm for spectral factorization and its application in signal processing
Ježek, Jan ; Hromčík, Martin ; Šebek, Michael
In this report a new algorithm is presented for the spectral factorization of a two-sided symmetric polynomial. The method is based on the discrete Fourier transform theory (DFT) and its relationship to the Z-transform. Involving DFT computational techniques, namely the famous fast Fourier transform routine (FFT), brings high computational efficiency and reliability. The power of the proposed procedure is employed in a particular practical signal processing application.
|
|
|
Simultaneous feedback stabilization: A survey
Hurák, Zdeněk ; Šebek, Michael
This paper gives a short introduction into the topic of simultaneous feedback stabilization, which is recognized as one of the fundamental open problems in control theory. In this paper, some essential defnitions are given, the relation between strong and simultaneous stability is explained, the recent result on complexity of the topic is stated, and some recent approaches based on LMI paradigm are described. SISO systems are considered only.
|
|
| |
|
|
An LMI condition for robust stability of polynomial matrix polytopes
Henrion, D. ; Arzelier, D. ; Peaucelle, D. ; Šebek, Michael
A sufficient LMI condition is proposed for checking robust stability of apolytope of polynomial matrices. It hinges upon two recent results: a new approach topolynomial matrix stability analysis and a new robust stability condition for convex polytopic uncertainty. Numerical experiments illustrate that the condition narrows signifficantly the unavoidable gap between conservative tractable quadratic stability results and exact NP-hard robust stability results.
|
|
|
Numerical algorithms for polynomial matrices
Hromčík, Martin ; Šebek, Michael
This report is devoted to new numerical methods for computations with polynomials and polynomial matrices that are encountered when solving the problems of control systems design via the algebraic methods. A distinguishing feature of our approach is the extensive employment of the discrete Fourier transform techniques, namely of the famous Fast Fourier Transform routine and its relation topolynomial interpolation and Z-transform.
|
|
|
Polynomial toolbox and control education
Hromčík, Martin ; Šebek, Michael
In this report we give our experience with employing thePolynomial Toolbox for Matlab version 2 at the lectures and labs of Algebraic Design Methods course taught at the Czech Technical University in Prague. Practical examples illustrating the Toolbox performance and contribution are also included. Though we have been using the tool for teaching purposes for arelatively short time, our experience is positive and we find the Polynomial Toolbox a very useful software tool for teachers.
|
guest ::
RSS feed.