Проблема выбора языка для начала обучения программированию в техническом ВУЗе
The article discusses issues related to computer science and programming teaching for undergraduate students of universities and collegues. Enrollee's classification and expected learning outcomes are included. Every discipline included in Computer Science course is also described in details
Derick Kourie is one of the founding fathers of Computer Science in the Republic of South Africa. On the occasion of his 65th birthday in the year 2013, to honour his scientific and academic contributions to research and higher education, this Festschrift book has been compiled. It contains ten chapters in four parts, namely Logic, Automata, Stringology, Programming, which cover many of Derrick Kourie's own research interests in the area of Theoretical Informatics and Formal Aspects of Computing. All authors and coauthors of this Festschrift belong to Derrick Kourie's long-term scientific cooperators and academic colleagues, and all of them are experts in their related fields. The contributions are written by L. Cleophas, J.W. Daykin, A. Deza, F. Franek, J. Geldenhuys, S. Gruner, J. Gutknecht, C. Iliopoulos, S. Objedkov, S. Pissis, W.F. Smyth, B. van der Merwe, L. van Zijl, and B.W. Watson.
This document presents results of non-quantitative observations application and their processing methods, which significantly widen the analytical capabilities of the statistical measurement of the Russian IT market. The need to expand statistical tools that allow to reflect current and future trends in the sectoral development of IT sphere in a fast and visible manner, due to the rapid character of penetration of these services into the Russian market, is argued in the paper.
With the help of business climate indicators and construction of different homogeneous behavior models, analysis of business trends in the financial and economic activities of IT organizations is presented, highlighting the specifics of them functioning within the various cyclic episodes of 2010-2017.
Special issue of Elsevier’s Procedia Computer Science, which consists of the proceedings of the 20th International Conference on Knowledge - Based and Intelligent Information & Engineering Systems (KES2016) which was organised by KES International and held on September 5th to 7th, 2016 in York, United Kingdom. Celebrating 20 years of KES conferences, KES2016 was the 20th event in a series of broad-spectrum intelligent systems conferences first held in Adelaide, Australia in 1997. The main aim of this KES conference series is to provide an internationally respected forum for the dissemination of research results and the discussion of issues relating to the theory, technologies and applications of intelligent information and knowledge-based systems. This year, this truly international conference attracted a substantial number of researchers and practitioners from all over the world who submitted their papers to five general tracks and 28 special sessions on specific topics. The papers highlight the new trends and challenge of intelligent and knowledge-based systems. Each paper was peer reviewed by at least two members of the International Program Committee and International Reviewer Board. Out of a large number of submissions, more than 200 high-quality papers were accepted for oral presentation and publication in Procedia Computer Science, submitted for indexing in CPCi (ISI conferences), Engineering Index, and Scopus.
Event logs collected by modern information and technical systems usually contain enough data for automated process models discovery. A variety of algorithms was developed for process models discovery, conformance checking, log to model alignment, comparison of process models, etc., nevertheless a quick analysis of ad-hoc selected parts of a journal still have not get a full-fledged implementation. This paper describes an ROLAP-based method of multidimensional event logs storage for process mining. The result of the analysis of the journal is visualized as directed graph representing the union of all possible event sequences, ranked by their occurrence probability. Our implementation allows the analyst to discover process models for sublogs defined by ad-hoc selection of criteria and value of occurrence probability
Let G be a semisimple algebraic group whose decomposition into the product of simple components does not contain simple groups of type A, and P⊆G be a parabolic subgroup. Extending the results of Popov , we enumerate all triples (G, P, n) such that (a) there exists an open G-orbit on the multiple flag variety G/P × G/P × . . . × G/P (n factors), (b) the number of G-orbits on the multiple flag variety is finite.
I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables