13 resultados para Coordinate Transformations

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper is a survey of our recent results on the bispectral problem. We describe a new method for constructing bispectral algebras of any rank and illustrate the method by a series of new examples as well as by all previously known ones. Next we exhibit a close connection of the bispectral problem to the representation theory of W1+∞–algerba. This connection allows us to explain and generalise to any rank the result of Magri and Zubelli on the symmetries of the manifold of the bispectral operators of rank and order two.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We define Bäcklund–Darboux transformations in Sato’s Grassmannian. They can be regarded as Darboux transformations on maximal algebras of commuting ordinary differential operators. We describe the action of these transformations on related objects: wave functions, tau-functions and spectral algebras.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Special generalizing for the artificial neural nets: so called RFT – FN – is under discussion in the report. Such refinement touch upon the constituent elements for the conception of artificial neural network, namely, the choice of main primary functional elements in the net, the way to connect them(topology) and the structure of the net as a whole. As to the last, the structure of the functional net proposed is determined dynamically just in the constructing the net by itself by the special recurrent procedure. The number of newly joining primary functional elements, the topology of its connecting and tuning of the primary elements is the content of the each recurrent step. The procedure is terminated under fulfilling “natural” criteria relating residuals for example. The functional proposed can be used in solving the approximation problem for the functions, represented by its observations, for classifying and clustering, pattern recognition, etc. Recurrent procedure provide for the versatile optimizing possibilities: as on the each step of the procedure and wholly: by the choice of the newly joining elements, topology, by the affine transformations if input and intermediate coordinate as well as by its nonlinear coordinate wise transformations. All considerations are essentially based, constructively and evidently represented by the means of the Generalized Inverse.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Ways of representation of relations between pair's objects are described at a complete choice. Methods of revealing and kinds of relations between objects are considered. The table of conformity between various forms of representation of relations is resulted.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The paper presents basic notions and scientific achievements in the field of program transformations, describes usage of these achievements both in the professional activity (when developing optimizing and unparallelizing compilers) and in the higher education. It also analyzes main problems in this area. The concept of control of program transformation information is introduced in the form of specialized knowledge bank on computer program transformations to support the scientific research, education and professional activity in the field. The tasks that are solved by the knowledge bank are formulated. The paper is intended for experts in the artificial intelligence, optimizing compilation, postgraduates and senior students of corresponding specialties; it may be also interesting for university lecturers and instructors.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The article describes the structure of an ontology model for Optimization of a sequential program. The components of an intellectual modeling system for program optimization are described. The functions of the intellectual modeling system are defined.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present OBDD transformation problem representing finite labeled transition systems corresponding to some congruence relation. Transformations are oriented toward obtaining the OBDD of a minimized transition system for this congruence relation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

AMS Subj. Classification: Primary 20N05, Secondary 94A60

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary: 34B40; secondary: 35Q51, 35Q53

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 16R10, 16R30.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Илинка А. Димитрова - Полугрупата Tn от всички пълни преобразувания върху едно n-елементно множество е изучавана в различни аспекти ог редица автори. Обект на разглеждане в настоящата работа е полугрупата Incn състояща се от всички нарастващи пълни преобразувания. Очевидно Incn е подполугрупа на Tn. Доказано е, че всеки елемент на полугрупата Incn от ранг r може да се представи като произведение на идемпотенти от същия ранг и всеки идемпотент от ранг по-малък или равен на r може да се представи като произведение на идемпотенти от ранг r. С помощта на тези твърдения е показано, че полугрупата Incn се поражда от множеството на всички идемпотенти от ранг n − 1 и тъждественото преобразувание. Освен това е доказано, че идемпотентите от ранг n − 1 са неразложими в полугрупата Incn. В резултат на това е получено, че рангът и идемпотичниат ранг на разглежданата полугрупа са равни. Като са използвани тези твърдения е направена пълна класификация на маскималните подполугрупи на полугрупата Incn.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Илинка А. Димитрова, Цветелина Н. Младенова - Моноида P Tn от всички частични преобразования върху едно n-елементно множество относно операцията композиция на преобразования е изучаван в различни аспекти от редица автори. Едно частично преобразование α се нарича запазващо наредбата, ако от x ≤ y следва, че xα ≤ yα за всяко x, y от дефиниционното множество на α. Обект на разглеждане в настоящата работа е моноида P On състоящ се от всички частични запазващи наредбата преобразования. Очевидно P On е под-моноид на P Tn. Направена е пълна класификация на максималните подполугрупи на моноида P On. Доказано е, че съществуват пет различни вида максимални подполугрупи на разглеждания моноид. Броят на всички максимални подполугрупи на POn е точно 2^n + 2n − 2.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 94A29, 94B70