Философия сетей Петри
Article analyzes the methods of study of complex systems. A general approach to the design of complex systems based on the use of the theory of tensor analysis. The expediency of transition from continuous to discrete space. The necessity of the transition to the new geometry that is different from the analytic or projective. We introduce the notion of Petri net structure or NP-structure. Introduces the concept of the reference model NP-structures. We introduce the concept of coordinate transformation NP structures. We introduce the notion of the invariant under tensor analysis of NP-structures. A general model of the use of tensor methods and detailing the study of superconducting structures
Some methodological foundations for elaboration of the modern strategies of ecological thinking based on the theoretical biology and on the theory of complex adaptive systems статье are under review in the article. Ecology, being a science of interaction of living organisms and their communities with environment, goes far beyond its primary frames of the biological knowledge and becomes a nodal discipline from which vectors of perspective interdisciplinary synthesis of knowledge diverge. The ecological approach turns to be fruitful in social and humanitarian researches. Ecology of action, ecology of mind, ecology of life, of cognition and of creativity, ecology of thoughts and words, ecology of ideas, ecology of communication and ecology of management – all these conceptual attitudes give evidence of audacious integration of the ecological thinking in wide spheres of the humanitarian and social knowledge, where it gives opportunities for some fresh approaches. The concept of Umwelt coined by Jakob von Uexküll in 1909 and his study of Umwelt (Umweltslehre) are of great significance for the development of the modern ecological universalism and for elaboration of strategic imperatives of the ecological thinking. The concept of Umwelt as a specific environment to which any biological species or its separate individual is adapted and which is constructed by it allows us to elaborate a real interdisciplinary platform for development of the theory of ecology, for holding a reasonable position in discussions about sustainable development and sustainable futures as well as about the role of education for sustainable development of the world.
The chapter explores the semantics and pragmatics of the Russian temporal syntactic phraseme ‘X to X,’ (a construction characterized by a semantically restricted set of lexical items able to fill in its syntactic variables) which expresses either the speaker’s surprise at the fact that events go as planned (surprising punctuality interpretation) or the speaker’s surprise at the fact that unplanned events go as if they had been pre-planned (surprising fateful coincidence interpretation). While the construction is not unique, and occurs in other languages, its preferred interpretations are language-specific. The chapter demonstrates differences between Russian and English outlooks on time, based on their fundamental differences in linguistic worldviews. According to one of the central key ideas of the Russian linguistic worldview, events are difficult for human subjects to control, as they are commonly controlled by outside forces, such as fate, and therefore surprising punctuality interpretation prevails in Russian. English, which does not view punctuality as something out of the ordinary, favours the surprising fateful coincidence interpretation of this syntactic phraseme. The idea of fate in relation to temporality is also found in other languages, as demonstrated by Bernard Charlier’s research on Mongolian temporality in his chapter in the current volume.
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 traﬃc 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 ﬁnal 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 ﬁnite-dimensional system of diﬀerential 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 diﬀerential 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.
Many electronic devices operate in a cyclic mode. This should be considered when forecastingreliability indicators at the design stage.The accuracy of the prediction and the planning for the event to ensure reliability depends on correctness of valuation and accounting greatest possiblenumber of factors. That in turn will affect the overall progress of the design and, in the end,result in the quality and competitiveness of products
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