Separation of variables in the generalized 4th Appelrot class

We consider the analogue of the 4th Appelrot class of motions of the Kowalevski top for the case of two constant force fields. The trajectories of this family fill the four-dimensional surface O^4 in the six-dimensional phase space. The constants of three first integrals in involution restricted to this surface fill one of the sheets of the bifurcation diagram in R^3. We point out the pair of partial integrals to obtain the explicit parametric equations of this sheet. The induced system on O^4 is shown to be Hamiltonian with two degrees of freedom having the thin set of points where the induced symplectic structure degenerates. The region of existence of motions in terms of the integral constants is found. We provide the separation of variables on O^4 and the algebraic formulae for the initial phase variables.Comment: LaTex, 16 pages, 1 figur

Specificity of modern corporate culture

В статье рассматриваются некоторые проблемы корпоративной культуры современного общества. Характеризуются факторы развития современной концепции корпоративной культуры. Анализируется сущность корпоративной культуры, которая проявляется в виде ряда аспектов, формирующих содержательные характеристики культуры общения и взаимодействия в определенных коллективах.The article discusses some problems of corporate culture of modern society. Characterized by the factors of the development of the concept of corporate culture. Analyzes the nature of corporate culture which is manifested in the form of a number of aspects, forming the characteristics of the culture of communication and interaction in certain groups

Algorithm for Adapting Cases Represented in a Tractable Description Logic

Case-based reasoning (CBR) based on description logics (DLs) has gained a lot of attention lately. Adaptation is a basic task in the CBR inference that can be modeled as the knowledge base revision problem and solved in propositional logic. However, in DLs, it is still a challenge problem since existing revision operators only work well for strictly restricted DLs of the \emph{DL-Lite} family, and it is difficult to design a revision algorithm which is syntax-independent and fine-grained. In this paper, we present a new method for adaptation based on the DL $\mathcal{EL_{\bot}}$. Following the idea of adaptation as revision, we firstly extend the logical basis for describing cases from propositional logic to the DL $\mathcal{EL_{\bot}}$, and present a formalism for adaptation based on $\mathcal{EL_{\bot}}$. Then we present an adaptation algorithm for this formalism and demonstrate that our algorithm is syntax-independent and fine-grained. Our work provides a logical basis for adaptation in CBR systems where cases and domain knowledge are described by the tractable DL $\mathcal{EL_{\bot}}$.Comment: 21 pages. ICCBR 201