ЭБ Раздел:https://elib.bsu.by:443/handle/123456789/3036942026-04-21T04:50:38Z2026-04-21T04:50:38ZA Note On Eigenvalue Decomposition On Jacket TransformLee, M.Song, W.Kim, C.J.https://elib.bsu.by:443/handle/123456789/1929492018-08-15T06:42:52Z2009-01-01T00:00:00ZЗаглавие документа: A Note On Eigenvalue Decomposition On Jacket Transform
Авторы: Lee, M.; Song, W.; Kim, C.J.
Аннотация: Jacket transforms are defined to be n x n matrices A = (a^) over a field F with the property A4* = nln, where A* is the transpose matrix of elements inverse of Л, i.e., Л* = (<C'), which generalized Hadamard transforms and Center Weighted Hadamard transforms. It has been found that the Jacket transforms are applied to signal and image representation and compression. This paper propose a new eigenvalue decomposition method with Jacket transform. The eigenvalue decomposition methods discussed here may be applied to doubly stochastic processing and the information-theoretic analysis of multiple input multiple output (MIMO) channels.2009-01-01T00:00:00ZThe problem of the reality of the laplacian spectrum of digraphsAgaev, R.https://elib.bsu.by:443/handle/123456789/1929482018-08-15T08:48:55Z2009-01-01T00:00:00ZЗаглавие документа: The problem of the reality of the laplacian spectrum of digraphs
Авторы: Agaev, R.
Аннотация: A Laplacian matrix L — (lij) € Rnxn has nonpositive off-diagonal entries and zero row sums. Every nonsymmetric Laplacian matrix is associated with a directed graph Г(V,E) with vertex set V = {I,.,., n} and arc set £. In this paper we investigate the Laplacian spectrum of the digraphs that consist of two contradirectional Hamittonian cycles from one of which one or two arcs were removed. The characteristic polynomials for these matrices are studied by means of the polynomials Zn(x) that satisfy the recurrence relation Zn(x) = (x-2)Zn-i(x)~Zn-2{x) with the initial conditions ZQ(X)= 1 andZj(^) = x- 1.2009-01-01T00:00:00ZOn some approach to an estimation of correspondence matrix of transport networkAndronov, A.https://elib.bsu.by:443/handle/123456789/1929452018-08-15T07:14:46Z2009-01-01T00:00:00ZЗаглавие документа: On some approach to an estimation of correspondence matrix of transport network
Авторы: Andronov, A.
Аннотация: An estimation problem of correspondence matrix for a network is considered. It is supposed that intensity of output flow for each node is fixed, but intensities of flow between nodes are unknown. It is necessary to estimate them. As a criterion of the estimation efficiency, the weighted sum of residual squares is used. Practical example is considered.2009-01-01T00:00:00ZNew stability conditions for time-sharing servicing process in random environmentZorine, A.https://elib.bsu.by:443/handle/123456789/1929442018-08-15T07:12:16Z2009-01-01T00:00:00ZЗаглавие документа: New stability conditions for time-sharing servicing process in random environment
Авторы: Zorine, A.
Аннотация: We present updated results concerning stability conditions for time-sharing queueing systems with group arrivals and branching secondary flows in random environment.2009-01-01T00:00:00Z