Article
Оценка инвестиционной привлекательности IT-проектов: применение сервисно-ориентированной архитектуры
The author regards the main principles of an overall method of assessing the investment attractiveness of IT-projects and underlines the diffusion of service-oriented architecture (SOA) at the moment. Among modern works taking SOA into consideration in the framework of the methodology of assessing information systems (IS) economic efficiency, he detaches the approach based on event-driven process chain (EPC) extension.
In the era of globalization Russia as one of the dynamic development markets became attractive to foreign investors willing to get high return and ready to take high risks. The aim of this article is to examine the investment flows and changes of its volume and direction in the periods of stable economic grows and economic crises 1998 and 2008-2009 years, weather we can say that Russia is the international investment center in recent years or it suffers from great capital outflow. According to practice there are two major kinds of investments: portfolio and direct investments. The former are more speculative, the latter - more stable and lead to technology and experience spreading. Ernst & Young European Investment Monitor illustrates the tendency of turning the international investments to development markets using the criteria of the sum of investments projects with participation of foreign investor, the article examines weather it is possible to prove this fact using data of flows of portfolio and direct foreign investments in the Russian market. As that is not a secret that Russian economy is mostly dependent on oil prices, this factor is also taken into account. As a whole the author outlines short-term, medium-term and long-term signs of investment attractiveness of Russia and proves that there is much to be done to make Russia the international investment center.
The study identifies operational risks within service-oriented architecture (SOA) of information systems. As a part of operational risks a new error classification scheme is proposed for SOA applications. It is based on errors of the information systems which are service providers for application with service-oriented architecture. The proposed classification approach was used to classify system errors from two different enterprises (oil and gas industry, metal and mining industry). Besides we conducted a research to identify possible losses from operational risks and estimated losses for each error group per day.
This book constitutes the proceedings of the 9th International Workshop on Enterprise and Organizational Modeling and Simulation, EOMAS 2013, held in conjunction with CAiSE 2013 in Valencia, Spain, in June 2013.
Tools and methods for modeling and simulation are widely used in enterprise engineering, organizational studies, and business process management. In monitoring and evaluating business processes and the interactions of actors in a realistic environment, modeling and simulation have proven to be both powerful, efficient, and economic, especially if complemented by animation and gaming elements.
The ten contributions in this volume were carefully reviewed and selected from 22 submissions. They explore the above topics, address the underlying challenges, find and improve solutions, and show the application of modeling and simulation in the domains of enterprises, their organizations and underlying business processes.
Despite all the advantages brought by service-oriented architecture (SOA), experts argue that SOA introduces more complexity into information systems rather than resolving it. The problem of service integration challenges modern companies taking the risk of implementing SOA. One of important aspects of this problem relates to dynamic service composition, which has to take into account many types of information and restrictions existing in each enterprise. Moreover, all the changes in business logic should also be promptly reflected. This chapter proposes the approach to solution of the stated problem based on such concepts as model-driven architecture (MDA), ontology modelling and logical analysis. The approach consists of several steps of modelling and finite scope logical analysis for automated translation of business processes into the sequence of service invocations. Formal language of relational logic is proposed as a key element of the proposed approach which is responsible for logical analysis and service workflow generation. We present a logical theory to automatically specialize generic orchestration templates which are close to semantic specification of abstract services in OWL-S. The developed logical theory is described formally in terms of Relational Logic. Our approach is implemented and tested using MIT Alloy Analyzer software.
There are a number of stereotypes regarding the investment attractiveness of Russian enterprises. Local companies often do not see any development prospects in Russia and complain at the unsatisfactory local institutional environment. However, the activity of multinational corporations (MNCs) in Russia serves as a clear evidence of its potential attractiveness as one of the BRICS markets (the so called "21st century markets"). This article discusses the activities of MNCs aimed to increase market representation in Russia, as well as the reasons for such behavior.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traffic is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the final node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a finite-dimensional system of differential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of differential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
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
The geographic information system (GIS) is based on the first and only Russian Imperial Census of 1897 and the First All-Union Census of the Soviet Union of 1926. The GIS features vector data (shapefiles) of allprovinces of the two states. For the 1897 census, there is information about linguistic, religious, and social estate groups. The part based on the 1926 census features nationality. Both shapefiles include information on gender, rural and urban population. The GIS allows for producing any necessary maps for individual studies of the period which require the administrative boundaries and demographic information.
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets in EXPNP, or even in EXP that are not computable by polynomial size circuits and hence are not reducible to a sparse set. In this paper we study this question in a more restricted setting: what is the computational complexity of sparse sets that are selfreducible? It follows from earlier work of Lozano and Torán (in: Mathematical systems theory, 1991) that EXPNP does not have sparse selfreducible hard sets. We define a natural version of selfreduction, tree-selfreducibility, and show that NEXP does not have sparse tree-selfreducible hard sets. We also construct an oracle relative to which all of EXP is reducible to a sparse tree-selfreducible set. These lower bounds are corollaries of more general results about the computational complexity of sparse sets that are selfreducible, and can be interpreted as super-polynomial circuit lower bounds for NEXP.