On the Transformations of Symplectic Expansions and the Respective Bäcklund Transformation for the KDV Equation

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

Structuring of Ranked Models

Prognostic procedures can be based on ranked linear models. Ranked regression type models are designed on the basis of feature vectors combined with set of relations defined on selected pairs of these vectors. Feature vectors are composed of numerical results of measurements on particular objects or events. Ranked relations defined on selected pairs of feature vectors represent additional knowledge and can reflect experts' opinion about considered objects. Ranked models have the form of linear transformations of feature vectors on a line which preserve a given set of relations in the best manner possible. Ranked models can be designed through the minimization of a special type of convex and piecewise linear (CPL) criterion functions. Some sets of ranked relations cannot be well represented by one ranked model. Decomposition of global model into a family of local ranked models could improve representation. A procedures of ranked models decomposition is described in this paper.

Parameterized Link Functions in Generalized Linear Random Effect Models: a Case Study on Breast Cancer Treatment

In non-linear random effects some attention has been very recently devoted to the analysis ofsuitable transformation of the response variables separately (Taylor 1996) or not (Oberg and Davidian 2000) from the transformations of the covariates and, as far as we know, no investigation has been carried out on the choice of link function in such models. In our study we consider the use of a random effect model when a parameterized family of links (Aranda-Ordaz 1981, Prentice 1996, Pregibon 1980, Stukel 1988 and Czado 1997) is introduced. We point out the advantages and the drawbacks associated with the choice of this data-driven kind of modeling. Difficulties in the interpretation of regression parameters, and therefore in understanding the influence of covariates, as well as problems related to loss of efficiency of estimates and overfitting, are discussed. A case study on radiotherapy usage in breast cancer treatment is discussed.

Highest Weight Modules of W1+∞, Darboux Transformations and the Bispectral Problem

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.

Matrixes of Relations between Pairs Objects and Transformations between Various Kinds

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.

A WEB-System for Computer Experiments in the Field of Program Transformations

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.

Processing of Knowledge about Optimization of Classical Optimizing Transformations

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.

Invariants of Unipotent Transformations Acting on Noetherian Relatively Free Algebras

2000 Mathematics Subject Classification: 16R10, 16R30.

On the Semigroup of all Increasing Full Transformations

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

Classification of the Maximal Subsemigroups of the Semigroup of all Partial Order-Preserving Transformations

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