• A
• A
• A
• АБB
• АБB
• АБB
• А
• А
• А
• А
• А
Обычная версия сайта
Найдено 28 979 публикаций
Сортировка:
по названию
по году
Глава
Klimanov D., Buzulukova E. V. In bk.: 5th EMAC Regional Conference - Marketing Theory Challenges in Emerging Markets. Katowice: Publishing house of the University of Economics in Katowice, 2014. P. 89-96.
Добавлено: 21 октября 2014
Глава
Stanislav Pozdniakov, Musabirov I., Anastasiya Kuznetsova. In bk.: Digital Transformation & Global Society: Second International Conference, DTGS 2017, St. Petersburg, Russia, June 21-23, 2017, Revised Selected Papers. Springer, 2017. P. 113-119.
Добавлено: 11 декабря 2017
Глава
Lomazova I. A., Romanov I. In bk.: Concurrency, Specification and Programming. CS&P’2012. Berlin, September 26 – September 28, 2012. Volume 2.. Vol. 2. Iss. 225. Berlin: Humboldt University of Berlin, 2012. P. 239-250.

Работа посвящена моделированию сервисов с помощью модулей потоков работ, которые представляют собой специальный подкласс сетей Петри. Проблема совместимости сервисов состоит в проверке того, что два Веб-сервиса подходят друг другу, т.е. что их композиция является бездефектной. Исследуется задача проверки комплиментарности ресурсов производимых/потребляемых сервисами, что является необходимым условием совместимости сервисов. Ресурсы, производимые/потребляемые сервисами, описываются как языки мультимножеств. В работе определена алгебра языков мультимножеств и приведен алгоритм проверки совместимости ресурсов для двух структурированных модулей потоков работ.

Добавлено: 19 ноября 2012
Глава
Glukhova E. In bk.: XVI Апрельская международная научная конференция по проблемам развития экономики и общества: в 4 кн.. Bk. 4. M.: Higher School of Economics Publishing House, 2016. P. 307-314.
Current research is devoted to the problem of the ombudsman institution and NGOs interaction. Therefore, the question of the research is the following: which factors influence on the interaction of the ombudsmen and NGOs? The research is made in theoretical and applied dimensions. It is based on both structural, system and institutional methodological approaches. The current study purpose is to develop matrix applicable for the description of ombudsman and NGOs interaction and cooperation. The research is based on 5 cases of Russian regions (Saint Petersburg, Arkhangelsk region, Novgorod region, Kaluga region and Republic of Dagestan). The research is based on qualitative methods such as comparative case-study, descriptive-inductive method, double reflection, triangulation and grounded theory instrumentality that provides an achievement of theoretical results.
Добавлено: 19 апреля 2016
Глава
Glukhova E. In bk.: XVI Апрельская международная научная конференция по проблемам развития экономики и общества: в 4 кн.. Bk. 4. M.: Higher School of Economics Publishing House, 2016. P. 307-3014.
Добавлено: 24 мая 2016
Глава
Mikhail Batsyn, Valery Kalyagin. In bk.: Models, Algorithms, and Technologies for Network Analysis. Iss. 32. NY: Springer, 2013. Ch. 3. P. 51-63.
Добавлено: 19 ноября 2013
Глава
Skorinkin D., Старостин А., Богданов А. et al. In bk.: Computational Linguistics and Intellectual Technologies: papers from the Annual conference “Dialogue 2014”. Iss. 13 (20). M.: 2014. P. 89-102.
Добавлено: 28 ноября 2015
Глава
Gromoff A. I., Chebotarev V. G., Bilinkis (Stavenko) J. et al. In bk.: S-BPM ONE - Learning by Doing - Doing by Learning: Third International Conference S-BPM ONE 2011. Vol. 4. Iss. 213. NY: Springer, 2011. P. 271-280.

The midline results of a scientific survey of the definition of requirements for the development of an innovative ECM system are presented. These results were obtained during the second stage of a complex project carried out through Government Grant with participation of NRU and IT Corporation (Russia). The particular research is based on 3 scopes: 1) Enterprise Content Management (ECM) system as roofing, 2) umbellate Total Content Management system (TCM); 3) process-based enterprise innovation activity and subject-oriented approach to BPM.

Добавлено: 26 марта 2013
Глава
Sukhov A. O., Lyadova L. N. In bk.: Advances in Information Science and Applications. Volumes I & II. Proceedings of the 18th International Conference on Computers (part of CSCC '14). Vol. 1-2. Santorini Island: CSCC, 2014. P. 61-66.

The approaches based on applying of metamodeling and domain-specific languages are widely used in software engineering. There are many different tools for creating visual domain-specific modeling languages with a possibility of determining user’s graphical notations. However, these tools possess disadvantages. The article presents an approach to the development of language workbench that allows to eliminate some restrictions of existing DSM-platforms. The MetaLanguage system is designed for creation of visual dynamic adaptable domain-specific modeling languages and for models construction with these languages. It allows executing transformations of the created models in various textual and graphical notations. Basic metalanguage constructions of this system are described. The formal description of modeling languages metamodel used in MetaLanguage is given. The architecture of MetaLanguage toolkit is presented.

Добавлено: 26 июля 2014
Глава
Belenky A., Egorova L. G. In bk.: Advances in Intelligent Systems and Computing. Iss. 359: Modelling, Computation and Optimization in Information Systems and Management Sciences. Switzerland: Springer, 2015. P. 257-268.
Добавлено: 1 июня 2015
Глава
Seryi A. P., Lyadova L. N. In bk.: Proceedings of the 7th Spring/Summer Young Researchers’ Colloquium on Software Engineering, SYRCoSE 2013. Kazan: 2013. P. 41-46.
Добавлено: 3 сентября 2013
Глава
Tatarnikov A. In bk.: Proceedings of IEEE East-West Design & Test Symposium (EWDTS'2016). Yerevan: IEEE, 2016. P. 270-273.
Добавлено: 22 декабря 2017
Глава
Avdeeva Z., Abramova N., Fedotov A. In bk.: 18th IFAC World Congress. Milan: IFAC publisher, 2011. P. 14246-14252.

Existing diversity of types of formal cognitive maps with corresponding theoretical models makes actual the problem of their systematization for further comparative analysis of their capabilities in solving applied problems and for development of the general theory of formal cognitive maps, when and if it is possible. The lack of the general theory of formal cognitive maps, orientation of many known theoretical models exclusively on simulation, semantic vagueness of some models have already led to incorrect formal statements and solutions of applied problems on the basis of cognitive maps. The general parametrical model of semantics of functional cognitive maps is developed to uniformly describe semantics of formal cognitive maps. The model has covered the major part of known types of formal cognitive maps and has enabled systemizing non-functional types of maps. Efficiency of the proposed approach to systematization of formal cognitive maps is shown on the representative set of types of such maps.

Добавлено: 8 ноября 2013
Глава
Chernyak E. L. In bk.: Proceedings of The Eighth International Conference on Web Search and Data Mining. NY; United States of America: ACM, 2014. Ch. 58. P. 429-434.
Добавлено: 8 декабря 2014
Глава
Lanin V., Uzunova E., Yugov A. et al. In bk.: Proceedings of the 7th Spring/Summer Young Researchers’ Colloquium on Software Engineering, SYRCoSE 2013. Kazan: 2013. P. 139-143.

Today many problems that are dedicated to a particular problem domain can be solved using DSL. Thus to use DSL it must be created or it can be selected from existing ones. Creating a completely new DSL in most cases requires high financial and time costs. Selecting an appropriate existing DSL is an intensive task because such actions like walking through every DSL and deciding if current DSL can handle the problem are done manually. This problem appears because there are no DSL repository and no tools for matching suitable DSL with specific task. This paper observes an approach for implementing an automated detection of requirements for DSL (ontology-based structure) and automated DSL matching for specific task.

Добавлено: 21 января 2014
Глава
Lazarev A. A. In bk.: European Chapter on Combinatorial Optimization (ECCO 2009). Jerusalem: 2009. P. 23-23.

We consider the scheduling problems α|β|Fmax: A set of n jobs J1,…,Jn with release dates r1,…,rn, processing times p1,…,pn and due dates d1,…,dn has to be scheduled on a single or many machines. The job preemption is not allowed. The goal is to find aschedule that minimizes the regular function F(C1,…,Cn), that Cj is the job jcompletion time. We have suggest an approximation scheme to find approximate optimal value of the objective function.

Добавлено: 4 марта 2013
Глава
Lazarev A. A. In bk.: European Chapter on Combinatorial Optimization (ECCO 2009). Jerusalem: 2009. P. 13-13.

In this paper, for $NP$-hardness single and multi-machine scheduling problems with the criterion of minimization maximum lateness the metrics $\rho$ has been used. We consider some approaches finding of the approximate solution for the problems. The idea of approaches consists in construction to a initial instance $A$ such instance $B$ (with the same number of jobs) with minimum of estimation of absolute error that$$0\le L_{max}^A(\pi^B)-L_{max}^A(\pi^A)\le \rho_d(A,B)+ \rho_r(A,B)+\rho_p(A,B),$$ where $\rho_d(A,B)=\max\limits_{j\in N}\{d_j^A-d_j^B\}-\min\limits_{j\in N}\{d_j^A-d_j^B\},$ $\rho_r(A,B)=\max\limits_{j\in N}\{r_j^A-r_j^B\}-\min\limits_{j\in N}\{r_j^A-r_j^B\}$ and$\rho_p(A,B)=\sum\limits_{j\in N}|p_j^A-p_j^B|,$ and $\pi^A, \pi^B$ -- optimal schedules for instances $A$ and $B$,respectively. Besides $\rho(A,B)=\rho_d(A,B)+ \rho_r(A,B)+\rho_p(A,B)$ satisfies to properties of the metrics in$(3n-2)$-dimensional space $\{(r_j,p_j,d_j)\,|\,j\in N\}$ with fixed in two parameters.

Добавлено: 4 марта 2013
Глава
Korenev P. S., Lazarev A. A. In bk.: 13th International Conference on Project Management and Scheduling (PMS 2012). Leuven, April 1-4, 2012. Leuven: Katholieke Universiteit Leuven, 2012. P. 195-198.

In the paper, we consider the NP-hard total tardiness minimization on a single machine scheduling problem. We propose a metric for that problem and present a new polynomial approximation scheme based on search for the polynomially solvable instance which has a minimal distance in the metric from an initial instance.

Добавлено: 27 декабря 2012
Глава
Protopopescu T. I. In bk.: Symposium on Logical Foundations of Computer Science (LFCS 2016). Vol. 9537: Logical Foundations of Computer Science. Springer, 2016. P. 317-330.
Добавлено: 25 ноября 2016
Глава
Schang F. In bk.: The square of opposition: a cornerstone of thought. Basel: Birkhäuser, 2016.

An arithmetic theory of oppositions is devised by comparing expressions, Boolean bitstrings, and integers. This leads to a set of correspondences between three domains of investigation, namely: logic, geometry, and arithmetic. The structural properties of each area are investigated in turn, before justifying the procedure as a whole. To finish, I show how this helps to improve the logical calculus of oppositions, through the consideration of corresponding operations between integers.

Добавлено: 14 июня 2016
Глава
Fuad Aleskerov, Sergey Demin. In bk.: Dynamics of Disasters—Key Concepts, Models, Algorithms, and Insights. Switzerland: Springer, 2016. P. 1-14.
Добавлено: 19 декабря 2016