Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
743 2 |
Ultima descărcare din IBN: 2021-05-27 21:51 |
SM ISO690:2012 LAZARI, Alexandru. Caracteristicile probabilistice ale timpului de evoluţie al sistemelor aleatoare discrete
. In: Studia Universitatis Moldaviae (Seria Ştiinţe Exacte şi Economice), 2009, nr. 2(22), pp. 224-228. ISSN 1857-2073. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Studia Universitatis Moldaviae (Seria Ştiinţe Exacte şi Economice) | ||||||
Numărul 2(22) / 2009 / ISSN 1857-2073 /ISSNe 2345-1033 | ||||||
|
||||||
Pag. 224-228 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
In this article it is being studied a class of random discrete systems, developing polynomial algorithms for determining the basic characteristics of time evolution of their own. It is a generalized problem for the case when the transfer time of the system in the next state is also a random variable with known distribution law. The developed algorithms are based on probabilistic method of determining the characteristics of random variables, knowing the generating function or characte-ristic function of them. Algorithms are being presented for numerical derivation of functions composed and rational fractions that appear later in main algorithms. It makes a brief foray into the theory of homogeneous linear recurring series to argue theoretically developed algorithms. |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Lazari, A.A.</dc:creator> <dc:date>2009-04-01</dc:date> <dc:description xml:lang='en'>In this article it is being studied a class of random discrete systems, developing polynomial algorithms for determining the basic characteristics of time evolution of their own. It is a generalized problem for the case when the transfer time of the system in the next state is also a random variable with known distribution law. The developed algorithms are based on probabilistic method of determining the characteristics of random variables, knowing the generating function or characte-ristic function of them. Algorithms are being presented for numerical derivation of functions composed and rational fractions that appear later in main algorithms. It makes a brief foray into the theory of homogeneous linear recurring series to argue theoretically developed algorithms.</dc:description> <dc:source>Studia Universitatis Moldaviae (Seria Ştiinţe Exacte şi Economice) 22 (2) 224-228</dc:source> <dc:title>Caracteristicile probabilistice ale timpului de evoluţie al sistemelor aleatoare discrete </dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>