Dynamic Component Composition
This paper presents an approach to dynamic component composition that facilitates creating new composed components using existing ones at runtime and without any code generation. The dynamic abilities are supported by extended type notion and implementation based on additional superstructure provided with its Java API and corresponding JavaBeans components. The new component composition is performed by building the composed prototype object that can be dynamically transformed into the new instantiable type (component). That approach demonstrates interrelations between prototype-based and class-based component-oriented programming. The component model proposed can be used when implementing user-defined types in declarative languages for event-driven applications programming.
A component model enabling to construct new software components from existing ones dynamically, at runtime, without their bytecodes generation is presented with supporting it software framework. The framework is implemented using JavaBeans component model, but is aimed to eliminate its drawback – the inability to create user-defined components without bytecodes generation. To construct user-defined component dynamically, a composed prototype object is built using predefined (hardcoded and/or composed) component instances; that prototype object can provide functionality required and can be transformed at runtime into a new component (instantiable type) whose instances are able to provide the same functionality, but more efficiently. The prototype object is composed using meta-components – the framework provided components to produce user-defined components dynamically.
Patrimonial and imperial orders mingle with other political forms of various kinds and dimensions into complex assemblages to produce a ‘flaky pastry of politics’. Their shapes could be investigated with the help of morphological analysis. It helps to identify morphological similarities that develop due to three different modes – descent, elective affinity and pseudomorphsis. The first part of the article provides methodological apparatus of morphological analysis to deal with specific paradigmatic variations of prototype forms within complex political orders. The task of investigating evolutionary and historical transformations of patrimonial and imperial prototypes is left for the second part of the article that is to follow
The article introduces a previously unknown text by Boris Pasternak, written by the latter in the album of his gymnasium schoolmate at the beginning of the last school year. The structure of the autograph reveals the preferences of the future poet with regard to philosophy and music. In particular, a connection between Pasternak’s aphorism and Schopenhauer’s ideas can be traced. The place of Pasternak’s writing within the context of the album sheds light on the author’s relationship with the circle of Kurlov. Finally, some hypotheses are advanced concerning the role of early impressions in the development of Doktor Zhivago, and a possible explanation of the origin of Zhivago’s brothers’ names is proposed.
Во второй части статьи прослеживаются основные моменты развития патримониальных и имперских порядков, а также институтов и практик. Специально рассматриваются каче- ства патримониев и империй как прототипических оснований властвования и политической организации, а также сохранение и модификация этих качеств в череде метаморфоз. Ана- лизируется проблема «гибридизации», сочетаемости патримониальных и имперских по- рядков друг с другом и с другими политическими формами. В заключение статьи ставится вопрос о настоящем и будущем патримониальных и имперских форм.
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.