Artificial neural networks. A review from physical and mathematical points of view
Artificial neural networks in time series forecasting: a comparative analysis
Artificial neural networks (ANN) have received a great deal of attention in many fields of engineering and science. Inspired by the study of brain architecture, ANN represent a class of non-linear models capable of learning from data. ANN have been applied in many areas where statistical methods are traditionally employed. They have been used in pattern recognition, classification, prediction and process control. The purpose of this paper is to discuss ANN and compare them to non-linear time series...
Aspects of Impatience in a Finite Buffer Queue
In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions of a number of performance measures are presented....
Aspects of Impatience in a Finite Buffer Queue
In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions...
Assignment of Distributed Processing Software: A Comparative Study
Associative closure and periodicity of -words
Associative models for storing and retrieving concept lattices.
Asymmetry level as a fuzzy measure.
Asymptotic analysis of a class of functional equations and applications
Flajolet and Richmond have invented a method to solve a large class of divide-and-conquer recursions. The essential part of it is the asymptotic analysis of a certain generating function for by means of the Mellin transform. In this paper this type of analysis is performed for a reasonably large class of generating functions fulfilling a functional equation with polynomial coefficients. As an application, the average life time of a party of people is computed, where each person advances one...
Asymptotic analysis of a loss model with trunk reservation. I: Trunks reserved for fast traffic.
Asymptotic behavior of excitable cellular automata.
Asymptotic behaviour of bi-infinite words
We present a description of asymptotic behaviour of languages of bi-infinite words obtained by iterating morphisms defined on free monoids.
Asymptotic behaviour of bi-infinite words
We present a description of asymptotic behaviour of languages of bi-infinite words obtained by iterating morphisms defined on free monoids.
Asymptotic classification of aliasing structures.
Asymptotic distributions and chaos for the supermarket model.
Asymptotic normality of recursive algorithms via martingale difference arrays.
Asymptotic spectral analysis of generalized Erdős-Rényi random graphs
Motivated by the Watts-Strogatz model for a complex network, we introduce a generalization of the Erdős-Rényi random graph. We derive a combinatorial formula for the moment sequence of its spectral distribution in the sparse limit.
Asymptotical behaviour of some non-uniform measures
Asynchronous serioparallel execution of the loop
Asynchronous sliding block maps