• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Найдено 55 113 публикаций
Сортировка:
по названию
по году
Статья
Karasev M., Novikova E. Mathematical notes. 2018. Vol. 104. No. 5-6. P. 833-847.

Для трехчастотного квантового резонансного осциллятора исследован приводимый случай, когда его частоты целые, и хотя бы одна пара частот имеет нетривиальный общий делитель. Показано, как описание алгебры симметрий такого осциллятора сводится к неприводимому случаю попарно взаимно простых целых частот. Выписаны полиномиальные алгебраические соотношения, построены неприводимые представления и когерентные состояния.

Добавлено: 31 октября 2018
Статья
Karpov M. Asia and Africa today. 2007. No. 3.
Добавлено: 21 сентября 2015
Статья
Piontkovski D. International Journal of Algebra and Computation. 2005. No. 4. P. 643-648.
Quadratic algebras associated to pseudo-roots of noncommutative polynomials have been introduced by I. Gelfand, Retakh, and Wilson in connection with studying the decompositions of noncommutative polynomials. Later they (with S. Gelfand and Serconek) shown that the Hilbert series of these algebras and their quadratic duals satisfy the necessary condition for Koszulity. It is proved in this note that these algebras are Koszul.
Добавлено: 17 сентября 2008
Статья
Alexeevski A., Natanzon S. M. American Mathematical Society Translations. 2014. Vol. 234. P. 1-12.

In 2001 Ivanov and Kerov associated with the infinite permutation group S∞ certain commutative associative algebra A∞ called the algebra of conjugacy classes of partial elements. A standard basis of A∞ islabeled by Yang diagrams of all orders. Mironov, Morozov, Natanzon, 2012, have proved that the completion of A∞ is isomorphic to the direct product of centers of group algebras of groups Sn. This isomorphism was explored in a construction of infinite dimensional Cardy-Frobenius algebra corresponding to asymptotic Hurwitz numbers. In this work algebras of conjugacy classes of partial elements are defined for a wider class of infinite groups. It is proven that completion of any such algebra is isomorphic to the direct product of centers of group algebras of relevant subgroups.

Добавлено: 2 апреля 2014
Статья
Vladimir L. Popov. Proceedings of the Steklov Institute of Mathematics. 2016. Vol. 292. P. 209-223.
Добавлено: 29 марта 2016
Статья
Piontkovski D. Advances in Mathematics. 2019. Vol. 343. P. 141-156.
Добавлено: 26 февраля 2019
Статья
Arzhantsev I. Annales de l'Institut Fourier. 2003. Vol. 53. No. 2. P. 379-398.
Добавлено: 9 июля 2014
Статья
Shehtman V. B., Chagrov A. Lecture Notes in Computer Science. 1995. Vol. 933. P. 442-455.
Добавлено: 8 октября 2010
Статья
Presnova A. Journal of Physics: Conference Series. 2019. No. 1163. P. 1-6.
Добавлено: 28 марта 2019
Статья
Vereshchagin N. Theory of Computing Systems. 2016. Vol. 58. No. 3. P. 463-481.
Добавлено: 7 февраля 2017
Статья
Zhukov A. A., Remizov S. V., Pogosov W. V. et al. Quantum Information Processing. 2018. Vol. 17. No. 223. P. 1-26.
Добавлено: 22 октября 2018
Статья
Vereshchagin N., Shen A. Lecture Notes in Computer Science. 2017. Vol. 10010. P. 669-737.
Добавлено: 13 февраля 2017
Статья
Chernyshev S., Cherepanov E., Pankratiev E. et al. Journal of Mathematical Sciences. 2005. Vol. 128. No. 6. P. 3487-3495.
Добавлено: 27 января 2014
Статья
Koonin E., Fenner T., Mirkin B. et al. BMC Evolutionary Biology. 2003. Vol. 3. No. 2.
Добавлено: 27 августа 2009
Статья
Maxim Babenko, Goldberg A. V., Gupta A. et al. Lecture Notes in Computer Science. 2013. Vol. 7965. No. PART 1. P. 69-80.

Cohen et al. developed an O(log n)-approximation algorithm for minimizing the total hub label size (l1 norm). We give O(log n)- approximation algorithms for the problems of minimizing the maximum label (l∞ norm) and minimizing lp and lq norms simultaneously.

Добавлено: 13 ноября 2013
Статья
Babenko M. A., Goldberg A., Gupta A. et al. ACM Transactions on Algorithms. 2016. Vol. 13. No. 1. P. 16:1-16:17.
Добавлено: 12 января 2017
Статья
Beaudou L., Nourine L., Mary A. Theoretical Computer Science. 2017. Vol. 658. P. 391-398.
Добавлено: 11 апреля 2019
Статья
Polyakov I.V., Chepovskiy A.A., Chepovskiy A.M. Journal of Mathematical Sciences. 2015. Vol. 211. No. 3. P. 413-417.
Добавлено: 23 октября 2015
Статья
Гафаров Е., Lazarev A. A., Werner F. Automation and Remote Control. 2014. Vol. 71. No. 10. P. 2070-2084.

In this paper, we consider two scheduling problems on a single machine, where a specific objective function has to be maximized in contrast to usual minimization problems. We propose exact algorithms for the single machine problem of maximizing total tardiness 1‖max-ΣT j and for the problem of maximizing the number of tardy jobs 1‖maxΣU j . In both cases, it is assumed that the processing of the first job starts at time zero and there is no idle time between the jobs. We show that problem 1‖max-ΣT j is polynomially solvable. For several special cases of problem 1‖maxΣT j , we present exact polynomial algorithms. Moreover, we give an exact pseudo-polynomial algorithm for the general case of the latter problem and an alternative exact algorithm.

Добавлено: 10 ноября 2014
Статья
Lazarev A. A., Werner F. Mathematical and Computer Modelling. 2009. Vol. 49. No. 9-10. P. 2061-2072.
Добавлено: 24 ноября 2012
Статья
Vikentyeva O. L., Deryabin A. I., Shestakova L. V. International Journal "Information Models and Analyses". 2014. Vol. 3. No. 3. P. 271-279.

Changes of professional environment, caused by introduction of new technologies and techniques, create a necessity in continuous education and development of professional competences. In these conditions, managers and other company employees face the choice of methods and tools of personnel training. A business game is one of the most productive tools of business-education This paper elaborates the ideas embodied previously, which considered the conceptual approach to a toolkit creation for active training techniques in a form of competence-based business game studio. Competence-based business game studio is an ergatic system for development of professional competences, which are required to ensure organization’s business processes. Business game control is performed with the help of automate module, which executes the interpretation of expressions in algorithm logical scheme language. Unified business process is the input data for automate model construction. Unified business process is acquired from the information about company’s real business processes, represented in poorly formalized ways. Unified business process transforms into unified training business process, which includes possible business game trainee actions and information about input, output, administrative data and business process operation execution mechanism. The next step to automate model is the construction of scenario graph, which represents a more formalized description of unified training business process. Next, the administrating algorithm of the business game in algorithm logical scheme language is built. The paper considers the algorithms of transition between models that allow to automate the process of acquiring algorithm logical scheme in order to implement the business games scenario.

Добавлено: 19 августа 2014