摘要:

A heuristic algorithm is suggested for approximating the departure process from a G/M/1 queueing system with generally distributed interarrival times, a single markovian server, an infinite capacity, and the first-come first-served queueing discipline, in the steady state. The tandem behaviour of the system is then approximated in the steady state. Finally, the approximation results are compared against both a simulation study and the approximation results of Kuehn (1979) and Whitt (1983 a, b).

ISSN:0020-7721    

DOI:10.1080/00207728908910190

出版商:Taylor & Francis Group    

年代:1989

数据来源: Taylor

摘要:

In this paper we are concerned with packet broadcast networks in which users communicate with the central station. The key problem is multiple access of a shared broadcast channel. The performance of a family of SRMA (split-channel reservation multiple access) protocols for multiple access proposed by Tobagi and Kleinrock (1976) is studied. We analyse the performance of SRMA-RM (request message) and modified SRMA-RAM (request answer message) protocols in terms of the throughput and the average packet delay. Bounds on the throughput are also established for both protocols.

ISSN:0020-7721    

DOI:10.1080/00207728908910191

出版商:Taylor & Francis Group    

年代:1989

数据来源: Taylor

摘要:

An imperfect model reference adaptive control for a DC motor drive system having bounded disturbances is proposed. The discrete-time model reference adaptive control algorithm proposed by Chiang and Chen (1987) with bounded disturbances is introduced to an Elettronica Veneta Mod. IBS-4/EV DC motor. This work shows that the adaptive controller can maintain good performance during startup, anticlockwise, or clockwise winding in the regulating reference signals.

ISSN:0020-7721    

DOI:10.1080/00207728908910192

出版商:Taylor & Francis Group    

年代:1989

数据来源: Taylor

摘要:

Many methods have been proposed in the last few years for the study of the identifiability of linear systems. We review these methods, which are based on different basic concepts, and demonstrate that these approaches can be considered as equivalent and that some properties are common. We use these results to study the relations between the determinants of the jacobian matrices corresponding to these approaches. The calculation of these determinants has a great importance since the jacobian matrices are the main starting points for the study of local identifiability and are proposed by some authors for the study of global identifiability. However, whatever the method used, this calculation is long, often difficult and even unmanageable when the model is too complex. We show that the relations between the model parameters that negate these determinants can be determinated from the study of some matrices that have the same rank properties as jacobian matrices, and whose main interest is that they are easy to obtain and available even in the case of complex models.

ISSN:0020-7721    

DOI:10.1080/00207728908910193

出版商:Taylor & Francis Group    

年代:1989

数据来源: Taylor