Communication system model for information rate evaluation of differential detection over time-varying channels

A communication system model for mutual information performance analysis of multiple-symbol differential M-phase shift keying over time-correlated, time-varying flat-fading communication channels is developed. This model is a finite-state Markov (FSM) equivalent channel representing the cascade of the differential encoder, FSM channel model and differential decoder. A state-space approach is used to model channel phase time correlations. The equivalent model falls in a class that facilitates the use of the forward backward algorithm, enabling the important information theoretic results to be evaluated. Using such a model, one is able to calculate mutual information for differential detection over time-varying fading channels with an essentially finite time set of correlations, including the Clarke fading channel. Using the equivalent channel, it is proved and corroborated by simulations that multiple-symbol differential detection preserves the channel information capacity when the observation interval approaches infinity.

The Exodus evacuation model applied to building evacuation scenarios

The purpose of this paper is to demonstrate the potential of the EXODUS evacuation model in building environments. The latest PC/workstation version of EXODUS is described and is also applied to a large hypothetical supermarket/restaurant complex measuring 50 m x 40 m. A range of scenarios is presented where population characteristics (such as size, individual travel speeds, and individual response times), and enclosure configuration characteristics (such as number of exits, size of exits, and opening times of exits) are varied. The results demonstrate a wide range of occupant behavior including overtaking, queuing, redirection, and conflict avoidance. Evacuation performance is measured by a number of model predicted parameters including individual exit flow rates, overall evacuation flow rates, total evacuation time, average evacuation time per occupant, average travel distance, and average wait time. The simulations highlight the profound impact that variations in individual travel speeds and occupant response times have in determining the overall evacuation performance. 1. Jin, T., and Yamada T., "Experimental Study of Human Behavior in Smoke Filled Corridors," Proceedings of The Second International Symposium on Fire Safety Science, 1988, pp. 511-519. 2. Galea, E.R., and Galparsoro, J.M.P., "EXODUS: An Evacuation Model for Mass Transport Vehicles," UK CAA Paper 93006 ISBN 086039 543X, CAA London, 1993. 3. Galea, E.R., and Galparsoro, J.M.P., "A Computer Based Simulation Model for the Prediction of Evacuation from Mass Transport Vehicles," Fire Safety Journal, Vol. 22, 1994, pp. 341-366. 4. Galea, E.R., Owen, M., and Lawrence, P., "Computer Modeling of Human Be havior in Aircraft Fire Accidents," to appear in the Proceedings of Combus tion Toxicology Symposium, CAMI, Oklahoma City, OK, 1995. 5. Kisko, T.M. and Francis, R.L., "EVACNET+: A Computer Program to Determine Optimal Building Evacuation Plans," Fire Safety Journal, Vol. 9, 1985, pp. 211-220. 6. Levin, B., "EXITT, A Simulation Model of Occupant Decisions and Actions in Residential Fires," Proceedings of The Second International Symposium on Fire Safety Science, 1988, pp. 561-570. 7. Fahy, R.F., "EXIT89: An Evacuation Model for High-Rise Buildings," Pro ceedings of The Third International Sym posium on Fire Safety Science, 1991, pp. 815-823. 8. Thompson, P.A., and Marchant, E.W., "A Computer Model for the Evacuation of Large Building Populations," Fire Safety Journal, Vol. 24, 1995, pp. 131-148. 9. Still, K., "New Computer System Can Predict Human Behavior Response to Building Fires," FIRE 84, 1993, pp. 40-41. 10. Ketchell, N., Cole, S.S., Webber, D.M., et.al., "The Egress Code for Human Move ment and Behavior in Emergency Evacu ations," Engineering for Crowd Safety (Smith, R.A., and Dickie, J.F., Eds.), Elsevier, 1993, pp. 361-370. 11. Takahashi, K., Tanaka, T. and Kose, S., "An Evacuation Model for Use in Fire Safety Design of Buildings," Proceedings of The Second International Symposium on Fire Safety Science, 1988, pp. 551- 560. 12. G2 Reference Manual, Version 3.0, Gensym Corporation, Cambridge, MA. 13. XVT Reference Manual, Version 3.0 XVT Software Inc., Boulder, CO. 14. Galea, E.R., "On the Field Modeling Approach to the Simulation of Enclosure Fires, Journal of Fire Protection Engineering, Vol. 1, No. 1, 1989, pp. 11-22. 15. Purser, D.A., "Toxicity Assessment of Combustion Products," SFPE Handbook of Fire Protection Engineering, National Fire Protection Association, Quincy, MA, pp. 1-200 - 1-245, 1988. 16. Hankin, B.D., and Wright, R.A., "Pas senger Flows in Subways," Operational Research Quarterly, Vol. 9, 1958, pp. 81-88. 17. HMSO, The Building Regulations 1991 - Approved Document B, section B 1 (1992 edition), HMSO publications, London, pp. 9-40. 18. Polus A., Schofer, J.L., and Ushpiz, A., "Pedestrian Flow and Level of Service," Journal of Transportation Engineering, Vol. 109, 1983, pp. 46-47. 19. Muir, H., Marrison, C., and Evans, A., "Aircraft Evacuations: the Effect of Passenger Motivation and Cabin Con figuration Adjacent to the Exit," CAA Paper 89019, ISBN 0 86039 406 9, 1989. 20. Muir, H., Private communication to appear as a CAA report, 1996.

Multilevel mesh partitioning for heterogeneous communication networks

Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem for distributing unstructured meshes onto parallel computers. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. To date these algorithms have been used almost exclusively to minimise the cut edge weight in the graph with the aim of minimising the parallel communication overhead, but recently there has been a perceived need to take into account the communications network of the parallel machine. For example the increasing use of SMP clusters (systems of multiprocessor compute nodes with very fast intra-node communications but relatively slow inter-node networks) suggest the use of hierarchical network models. Indeed this requirement is exacerbated in the early experiments with meta-computers (multiple supercomputers combined together, in extreme cases over inter-continental networks). In this paper therefore, we modify a multilevel algorithm in order to minimise a cost function based on a model of the communications network. Several network models and variants of the algorithm are tested and we establish that it is possible to successfully guide the optimisation to reflect the chosen architecture.

A reconfigurable component model using reflection

Providing a method of transparent communication and interoperation between distributed software is a requirement for many organisations and several standard and non-standard infrastructures exist for this purpose. Component models do more than just provide a plumbing mechanism for distributed applications, they provide a more controlled interoperation between components. There are very few component models however that have support for advanced dynamic reconfigurability. This paper describes a component model which provides controlled and constrained transparent communication and inter-operation between components in the form of a hierarchical component model. At the same time, the model contains support for advanced run-time reconfigurability of components. The process and benefits of designing a system using the presented model are discussed. A way in which reflective techniques and component frameworks can work together to produce dynamic adaptable systems is explained.