|
Product-form Stationary Distribution
In probability theory, a product-form solution is a particularly efficient form of solution for determining some metric of a system with distinct sub-components, where the metric for the collection of components can be written as a product of the metric across the different components. Using capital Pi notation a product-form solution has algebraic form :\text(x_1,x_2,x_3,\ldots,x_n) = B \prod_^n \text(x_i) where ''B'' is some constant. Solutions of this form are of interest as they are computationally inexpensive to evaluate for large values of ''n''. Such solutions in queueing networks are important for finding performance metrics in models of multiprogrammed and time-shared computer systems. Equilibrium distributions The first product-form solutions were found for equilibrium distributions of Markov chains. Trivially, models composed of two or more independent sub-components exhibit a product-form solution by the definition of independence. Initially the term was used in qu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Probability Theory
Probability theory is the branch of mathematics concerned with probability. Although there are several different probability interpretations, probability theory treats the concept in a rigorous mathematical manner by expressing it through a set of axioms. Typically these axioms formalise probability in terms of a probability space, which assigns a measure taking values between 0 and 1, termed the probability measure, to a set of outcomes called the sample space. Any specified subset of the sample space is called an event. Central subjects in probability theory include discrete and continuous random variables, probability distributions, and stochastic processes (which provide mathematical abstractions of non-deterministic or uncertain processes or measured quantities that may either be single occurrences or evolve over time in a random fashion). Although it is not possible to perfectly predict random events, much can be said about their behavior. Two major results in probability ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Random Neural Network
The random neural network (RNN) is a mathematical representation of an interconnected network of neurons or cells which exchange spiking signals. It was invented by Erol Gelenbe and is linked to the G-network model of queueing networks as well as to Gene Regulatory Network models. Each cell state is represented by an integer whose value rises when the cell receives an excitatory spike and drops when it receives an inhibitory spike. The spikes can originate outside the network itself, or they can come from other cells in the networks. Cells whose internal excitatory state has a positive value are allowed to send out spikes of either kind to other cells in the network according to specific cell-dependent spiking rates. The model has a mathematical solution in steady-state which provides the joint probability distribution of the network in terms of the individual probabilities that each cell is excited and able to send out spikes. Computing this solution is based on solving a set of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jackson Network
In queueing theory, a discipline within the mathematical theory of probability, a Jackson network (sometimes Jacksonian network) is a class of queueing network where the equilibrium distribution is particularly simple to compute as the network has a product-form solution. It was the first significant development in the theory of networks of queues, and generalising and applying the ideas of the theorem to search for similar product-form solutions in other networks has been the subject of much research, including ideas used in the development of the Internet. The networks were first identified by James R. Jackson A version from January 1963 is available at http://www.dtic.mil/dtic/tr/fulltext/u2/296776.pdf and his paper was re-printed in the journal ''Management Science’s'' ‘Ten Most Influential Titles of Management Sciences First Fifty Years.’ Jackson was inspired by the work of Burke and Reich, though Jean Walrand notes "product-form results … rea much less immediate r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
M/M/1 Queue
In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times have an exponential distribution. The model name is written in Kendall's notation. The model is the most elementary of queueing models and an attractive object of study as closed-form expressions can be obtained for many metrics of interest in this model. An extension of this model with more than one server is the M/M/c queue. Model definition An M/M/1 queue is a stochastic process whose state space is the set where the value corresponds to the number of customers in the system, including any currently in service. * Arrivals occur at rate λ according to a Poisson process and move the process from state ''i'' to ''i'' + 1. * Service times have an exponential distribution with rate parameter μ in the M/M/1 queue, where 1/μ is the mean ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chemical Reaction Network
Chemical reaction network theory is an area of applied mathematics that attempts to model the behaviour of real-world chemical systems. Since its foundation in the 1960s, it has attracted a growing research community, mainly due to its applications in biochemistry and theoretical chemistry. It has also attracted interest from pure mathematicians due to the interesting problems that arise from the mathematical structures involved. History Dynamical properties of reaction networks were studied in chemistry and physics after the invention of the law of mass action. The essential steps in this study were introduction of detailed balance for the complex chemical reactions by Rudolf Wegscheider (1901), development of the quantitative theory of chemical chain reactions by Nikolay Semyonov (1934), development of kinetics of catalytic reactions by Cyril Norman Hinshelwood, and many other results. Three eras of chemical dynamics can be revealed in the flux of research and publications ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Martin Feinberg
Martin Feinberg is an American chemical engineer and mathematician known for his work in chemical reaction network theory. Life Born in New York, Feinberg received his undergraduate degree in chemical engineering from The Cooper Union for the Advancement of Science and Art in 1962. A year later, he obtained his master's degree from Purdue University. In 1968, he received his PhD degree from Princeton University. The subject of the doctoral thesis is fluid mechanics and the advisor is William Schowalter. After completing the PhD, he went to work at the University of Rochester, Rochester, NY, where he was a professor of chemical engineering until 1997. He then moved to The Ohio State University, where he serves as Richard M. Morrow Professor of Chemical Engineering and Professor of Mathematics. Feinberg was a Member of the Editorial Board of the Archive for Rational Mechanics and Analysis from 1978–1991. Research Together with F. J. M. Horn and Roy Jackson, Feinberg created c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Petri Nets
A Petri net, also known as a place/transition (PT) net, is one of several mathematical modeling languages for the description of distributed systems. It is a class of discrete event dynamic system. A Petri net is a directed bipartite graph that has two types of elements, places and transitions. Place elements are depicted as white circles and transition elements are depicted as rectangles. A place can contain any number of tokens, depicted as black circles. A transition is enabled if all places connected to it as inputs contain at least one token. Some sources state that Petri nets were invented in August 1939 by Carl Adam Petri—at the age of 13—for the purpose of describing chemical processes. Like industry standards such as UML activity diagrams, Business Process Model and Notation, and event-driven process chains, Petri nets offer a graphical notation for stepwise processes that include choice, iteration, and concurrent execution. Unlike these standards, Petri nets ha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stochastic
Stochastic (, ) refers to the property of being well described by a random probability distribution. Although stochasticity and randomness are distinct in that the former refers to a modeling approach and the latter refers to phenomena themselves, these two terms are often used synonymously. Furthermore, in probability theory, the formal concept of a ''stochastic process'' is also referred to as a ''random process''. Stochasticity is used in many different fields, including the natural sciences such as biology, chemistry, ecology, neuroscience, and physics, as well as technology and engineering fields such as image processing, signal processing, information theory, computer science, cryptography, and telecommunications. It is also used in finance, due to seemingly random changes in financial markets as well as in medicine, linguistics, music, media, colour theory, botany, manufacturing, and geomorphology. Etymology The word ''stochastic'' in English was originally used as a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
PEPA
Performance Evaluation Process Algebra (PEPA) is a stochastic process algebra designed for modelling computer and communication systems introduced by Jane Hillston in the 1990s. The language extends classical process algebras such as Milner's CCS and Hoare's CSP by introducing probabilistic branching and timing of transitions. Rates are drawn from the exponential distribution and PEPA models are finite-state and so give rise to a stochastic process, specifically a continuous-time Markov process (CTMC). Thus the language can be used to study quantitative properties of models of computer and communication systems such as throughput, utilisation and response time as well as qualitative properties such as freedom from deadlock. The language is formally defined using a structured operational semantics in the style invented by Gordon Plotkin. As with most process algebras, PEPA is a parsimonious language. It has only four combinators, ''prefix'', ''choice'', ''co-operation'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
RCAT
In probability theory, the reversed compound agent theorem (RCAT) is a set of sufficient conditions for a stochastic process expressed in any formalism to have a product form stationary distribution (assuming that the process is stationary). The theorem shows that product form solutions in Jackson's theorem, the BCMP theorem and G-networks are based on the same fundamental mechanisms. The theorem identifies a reversed process using Kelly's lemma In probability theory, Kelly's lemma states that for a stationary continuous-time Markov chain, a process defined as the time-reversed process has the same stationary distribution as the forward-time process. The theorem is named after Frank Kelly. ..., from which the stationary distribution can be computed. Notes References * ::A short introduction to RCAT. Probability theorems {{Probability-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ruth J
Ruth (or its variants) may refer to: Places France * Château de Ruthie, castle in the commune of Aussurucq in the Pyrénées-Atlantiques département of France Switzerland * Ruth, a hamlet in Cologny United States * Ruth, Alabama * Ruth, Arkansas * Ruth, California * Ruth, Louisiana * Ruth, Pulaski County, Kentucky * Ruth, Michigan * Ruth, Mississippi * Ruth, Nevada * Ruth, North Carolina * Ruth, Virginia * Ruth, Washington * Ruth, West Virginia In space * Ruth (lunar crater), crater on the Moon * Ruth (Venusian crater), crater on Venus * 798 Ruth, asteroid People * Ruth (biblical figure) * Ruth (given name) contains list of namesakes including fictional * Princess Ruth or Keʻelikōlani, (1826–1883), Hawaiian princess Surname * A. S. Ruth, American politician * Babe Ruth (1895–1948), American baseball player * Connie Ruth, American politician * Earl B. Ruth (1916–1989), American politician * Elizabeth Ruth, Canadian novelist * Kristin Ruth, American jud ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Queueing Systems
''Queueing Systems'' is a peer-reviewed scientific journal covering queueing theory. It is published by Springer Science+Business Media. The current editor-in-chief is Sergey Foss. According to the ''Journal Citation Reports'', the journal has a 2019 impact factor of 1.114. Editors-in-chief N. U. Prabhu was the founding editor-in-chief when the journal was established in 1986 and remained editor until 1995. Richard F. Serfozo was editor from 1996–2004, and Onno J. Boxma from 2004–2009. Since 2009, the editor has been Sergey Foss. Abstracting and indexing ''Queueing Systems'' is abstracted and indexed in DBLP, Journal Citation Reports, Mathematical Reviews, Research Papers in Economics, SCImago Journal Rank, Scopus, Science Citation Index, Zentralblatt MATH zbMATH Open, formerly Zentralblatt MATH, is a major reviewing service providing reviews and abstracts for articles in pure and applied mathematics, produced by the Berlin office of FIZ Karlsruhe – Leibniz Ins ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Probability Theory")
.png "Click for more on -> Jackson Network")
