Classification of k-Primitive Sets of Matrices
The article is concerned with the analysis of metapoetic statements of Genrikh Sapgir that were made by him in poetic form – in the shape of «programmatic» poems. In his work, the poet preferred to dispense with creative manifestos or forewords: there is extremely small number of them in Sapgir’s heritage. But at the same time he looked for ways to give a key to the meaning of his poetical quests and experiments, using his poetry, comprising of a new design concept: «poetics of semi-word» or particular method of «permutation».
Lambek calculus is a logical foundation of categorial grammar, a linguistic paradigm of grammar as logic and parsing as deduction. Pentus (2010) gave a polynomial-time algorithm for determining provability of bounded depth formulas in L* , the Lambek calculus with empty antecedents allowed. Pentus’ algorithm is based on tabularisation of proof nets. Lambek calculus with brackets is a conservative extension of Lambek calculus with bracket modalities, suitable for the modeling of syntactical domains. In this paper we give an algorithm for provability in Lb* , the Lambek calculus with brackets allowing empty antecedents. Our algorithm runs in polynomial time when both the formula depth and the bracket nesting depth are bounded. It combines a Pentus-style tabularisation of proof nets with an automata-theoretic treatment of bracketing.
In this research it was considered the particular case of a railway problem, specifically, the construction of orders delivery schedule for one locomotive plying among three railway station. In this paper it was suggested a polynomial algorithm and were shown the results of a computing experiment.
"Designing" the complete works of his own is an important part of Aleksander Kondratov's creations, a neofuturist poet from Leningrad. One of the prospects of his future collection, "My Trinities" makes it possible to restore the poet's concept to create "The Concretions", a volume of concretist texts, which has not been fully implemented. These texts were obviously aimed at the demonstration of the whole paradigm of devices and forms of this trend of experimental poetry that Kondratov knew at the time. Keywords: Aleatory works, Aleksander Kondratov, dadaism, concretism, neofuturism, uncensored poetry, zero text, permutation, hollow text, found poetry.
This proceedings publication is a compilation of selected contributions from the “Third International Conference on the Dynamics of Information Systems” which took place at the University of Florida, Gainesville, February 16–18, 2011. The purpose of this conference was to bring together scientists and engineers from industry, government, and academia in order to exchange new discoveries and results in a broad range of topics relevant to the theory and practice of dynamics of information systems. Dynamics of Information Systems: Mathematical Foundation presents state-of-the art research and is intended for graduate students and researchers interested in some of the most recent discoveries in information theory and dynamical systems. Scientists in other disciplines may also benefit from the applications of new developments to their own area of study.
A form for an unbiased estimate of the coefficient of determination of a linear regression model is obtained. It is calculated by using a sample from a multivariate normal distribution. This estimate is proposed as an alternative criterion for a choice of regression factors.