Queueing networks are important as Performance models of computer and communication systems because the performance of these systems is usually principally affected by contention for resources. Exact numerical solution of a queueing network is usually only feasible ifthe network has a product form solution in the sense of Jackson. An important network characteristic which apparently precludes a...

Mississippi Medical Center, Jackson, MS; Jackson Heart Study Field Center, Jackson State University, Jackson, MS; Departments of Genetics, Biostatistics, and Computer Science, University of North Carolina, Chapel Hill, NC; Departments of Medicine and Pediatrics, University of Mississippi Medical Center, Jackson, MS; and Department of Epidemiology, University of Washington School of Public Healt...

This paper studies the construction and approximation of neural network operators with a centered bell-shaped Gaussian activation function. Using a univariate Gaussian function a class of Cardaliaguet-Euvrard type network operators is constructed to approximate the continuous function, and the Jackson type theorems of the approximation and some discussions about the convergence are given. Furth...

This paper aims to study the construction and multivariate approximation of a class of network operators with logistic sigmoidal functions. First, a class of even and bell-shaped function with support on R is constructed by using appropriate translation and combination of the logistic function. Then, the constructed function is employed as activation function to construct a kind of so-called Ca...

The arrival theorem is investigated for communication networks that exhibit a product form. Two types of blocking protocols are distinguished: • a delay protocol • a retransmission protocol. (i) Under the delay protocol the arrival theorem is shown to f all. (ii) Under the more realistic retransmission protocol, however, the arrival theorem is shown to be generally valid provided the product fo...

This paper provides a necessary and sufficient condition for detectability, and an explicit construction of observers when this condition is satisfied, for chemical reaction networks of the Feinberg-Horn-Jackson zero deficiency type.