Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-23T22:58:41.503Z Has data issue: false hasContentIssue false

FESTSCHRIFT FOR EROL GELENBE'S 70TH BIRTHDAY

Published online by Cambridge University Press:  18 May 2016

Nihal Pekergin*
Affiliation:
Laboratoire LACL, Université Paris-Est Créteil Val-de-Marne, 61 av. du Général de Gaulle, 94010 Créteil Cedex, France E-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This paper introduces a special collection of research contributions written to honour Professor Erol Gelenbe of his 70th birthday which was celebrated on September 20–25, 2015 at Imperial College in London where he holds the Dennis Gabor Professorship and is Head of the Intelligent Systems and Networks Group in the Department of Electrical and Electronic Engineering (see http://san.ee.ic.ac.uk/Gelenbe2015). All but three of the fourteen papers presented here were written by his students and descendants. These papers are centered on probability models related to computer systems and networks, an area where Erol plays a pioneering role in which he remains very active with many innovations and new directions that he has introduced in the last ten or twelve years. We first briefly review Erol's work in these areas, and then discuss each of the contributions that appear here together with their links to Erol's own published research.

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
Copyright © Cambridge University Press 2016

References

1.Abdelbaki, H.M., Hussain, K., & Gelenbe, E. (2001). A laser intensity image based automatic vehicle classification system. In 2001 IEEE Proceedings on Intelligent Transportation Systems, 2001, Oakland, USA, August 2001. IEEE, pp. 460465.Google Scholar
2.Akinwande, O.J., Bi, H., & Gelenbe, E. (2015). Managing crowds in hazards with dynamic grouping. IEEE Access 3: 10601070. [Online]. Available: http://dx.doi.org/10.1109/ACCESS.2015.2453341Google Scholar
3.Baccelli, F., Gelenbe, E., & Plateau, B. (1984). An end-to-end approach to the resequencing problem. Journal of the ACM 31(3): 474485. [Online]. Available: http://doi.acm.org/10.1145/828.1883Google Scholar
4.Chesnais, A., Gelenbe, E., & Mitrani, I. (1983). On the modeling of parallel access to shared data. Communications of the ACM 26(3): 196202. [Online]. Available: http://doi.acm.org/10.1145/358061.358073Google Scholar
5.Dimakis, N., Filippoupolitis, A., & Gelenbe, E. (2010). Distributed building evacuation simulator for smart emergency management. Computer Journal 53(9): 13841400. [Online]. Available: http://dx.doi.org/10.1093/comjnl/bxq012CrossRefGoogle Scholar
6.Fayolle, G., Gelenbe, E., Labetoulle, J., & Bastin, D. (1974). The stability problem of broadcast packet switching computer networks. Acta Informatica 4(1): 4953.Google Scholar
7.Fayolle, G., Gelenbe, E., & Labetoulle, J. (1977). Stability and optimal control of the packet switching broadcast channel. Journal of the ACM 24(3): 375386.Google Scholar
8.Filippoupolitis, A., Hey, L., Loukas, G., Gelenbe, E., & Timotheou, S. (2008). Emergency response simulation using wireless sensor networks. In Proceedings of the First International Conference on Ambient Media and Systems, Quebec, Canada, February 2008. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), p. 21.Google Scholar
9.Gelenbe, S.E. (1967). Regular expressions and checking experiments. Polytechnic Institute of Brooklyn N.Y.: Microwave Research Institute, September.Google Scholar
10.Gelenbe, S.E. (1969). On probabilistic automata with structural restrictions. In IEEE Conference Record of Tenth Annual Symposium on Switching and Automata Theory, Waterloo, Canada, November 1969.Google Scholar
11.Gelenbe, E. (1970). On languages defined by linear probabilistic automata. Information and Control 16(5): 487501.Google Scholar
12.Gelenbe, E. (1970). On the loop-free decomposition of stochastic finite-state systems. Information and Control 17(5): 474484.CrossRefGoogle Scholar
13.Gelenbe, S.E. (1971). A realizable model for stochastic sequential machines. IEEE Transactions on Computers C-20(2): 199204.Google Scholar
14.Gelenbe, E. (1971). The two-thirds rule for dynamic storage allocation under equilibrium. Information Processing Letters 1(2): 5960.Google Scholar
15.Gelenbe, E. (1973). The distribution of a program in primary and fast buffer storage. Commununications of the ACM 16(7): 431434.Google Scholar
16.Gelenbe, E. (1973). Minimizing wasted space in partitioned segmentation. Communnunications of the ACM 16(6): 343349.Google Scholar
17.Gelenbe, E. (1973). A unified approach to the evaluation of a class of replacement algorithms. IEEE Transactions on Computers 22(6): 611618.Google Scholar
18.Gelenbe, E. (1990). Stability of the random neural network model. Neural Computation 2(2): 239247.Google Scholar
19.Gelenbe, E. (1998). The spiked random neural network: nonlinearity, learning and approximation. In Proceedings of 1998 Fifth IEEE International Workshop on Cellular Neural Networks and Their Applications, London, UK, April 1998. IEEE, pp. 1419.Google Scholar
20.Gelenbe, E. (2000). The first decade of g-networks. European Journal of Operational Research 126(2): 231232.CrossRefGoogle Scholar
21.Gelenbe, E. (2003). Sensible decisions based on QOS. Computational Management Science 1(1): 114.Google Scholar
22.Gelenbe, E. (2007). Steady-state solution of probabilistic gene regulatory networks. Physical Review E 76(3): 031903.Google Scholar
23.Gelenbe, E. (2007). A diffusion model for packet travel time in a random multihop medium. ACM Transactions on Sensor Networks 3(2): 10.Google Scholar
24.Gelenbe, E. (2009). Steps toward self-aware networks. Communications of the ACM 52(7): 6675.Google Scholar
25.Gelenbe, E. (2009). Analysis of single and networked auctions. ACM Transactions on Internet Technology 9(2): 8.Google Scholar
26.Gelenbe, E. (2010). Search in unknown random environments. Physical Review E 82(6): 061112.Google Scholar
27.Gelenbe, E. (2014). Error and energy when communicating with spins. In 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP), Atlanta, USA, December 2014. IEEE, pp. 784787.CrossRefGoogle Scholar
28.Gelenbe, E. (2015). Errors and power when communicating with spins. IEEE Transactions on Emerging Topics Computing 3(4): 483488. [Online]. Available: http://doi.ieeecomputersociety.org/10.1109/TETC.2015.2446751Google Scholar
29.Gelenbe, E. & Cao, Y. (1998). Autonomous search for mines. European Journal of Operational Research 108(2): 319333.Google Scholar
30.Gelenbe, E., Feng, Y., Ranga, K., & Krishnan, R. (1996). Neural networks for volumetric mr imaging of the brain. In Proceedings of International Workshop on Neural Networks for Identification, Control, Robotics, and Signal/Image Processing, 1996, Venice, Italy, August 1996. IEEE, pp. 194202.Google Scholar
31.Gelenbe, E. & Fourneau, J.-M. (1999). Random neural networks with multiple classes of signals. Neural Computation 11(4): 953963.Google Scholar
32.Gelenbe, E., Harmanι, K., & Krolik, J. (1998). Learning neural networks for detection and classification of synchronous recurrent transient signals. Signal Processing 64(3): 233247.Google Scholar
33.Gelenbe, E. & Hebrail, G. (1986). A probability model of uncertainty in data bases. In Proceedings of the Second International Conference on Data Engineering, Los Angeles, USA, February 1986. IEEE Computer Society, pp. 328333.Google Scholar
34.Gelenbe, E. & Hussain, K. (2002). Learning in the multiple class random neural network. IEEE Transactions on Neural Networks 13(6): 12571267. [Online]. Available: http://dx.doi.org/10.1109/TNN.2002.804228CrossRefGoogle ScholarPubMed
35.Gelenbe, E., Hussain, K., & Kaptan, V. (2005). Simulating autonomous agents in augmented reality. Journal of Systems and Software 74(3): 255268.Google Scholar
36.Gelenbe, E. & Iasnogorodski, R. (1980). A queue with server of walking type (autonomous service). Annales de l'Institut Henri Poincaré. Section B, Calcul des Probabilités et Statistique 16(1): 6373.Google Scholar
37.Gelenbe, E. & Koçak, T. (2000). Area-based results for mine detection. IEEE Transactions on Geoscience and Remote Sensing 38(1): 1224.Google Scholar
38.Gelenbe, E. & Labed, A. (1998). G-networks with multiple classes of signals and positive customers. European Journal of Operational Research 108(2): 293305.Google Scholar
39.Gelenbe, E., Lichnewsky, A., & Stafylopatis, A. (1982). Experience with the parallel solutions of partial differential equations on a distributed computing system. IEEE Transactions on Computers 31(12): 11571164. [Online]. Available: http://doi.ieeecomputersociety.org/10.1109/TC.1982.1675939Google Scholar
40.Gelenbe, E. & Loukas, G. (2007). A self-aware approach to denial of service defence. Computer Networks 51(5): 12991314.Google Scholar
41.Gelenbe, E., Mao, Z.-W., & Li, Y.-D. (1999). Function approximation with spiked random networks. IEEE Transactions on Neural Networks 10(1): 39.Google Scholar
42.Gelenbe, E. & Mitrani, I. (1982). Control policies in CSMA local area networks: ethernet controls. ACM SIGMETRICS Performance Evaluation Review, ACM 11(4): 233240.Google Scholar
43.Gelenbe, E. & Morfopoulou, C. (2011). A framework for energy-aware routing in packet networks. The Computer Journal 54(6): 850859.Google Scholar
44.Gelenbe, E. & Morfopoulou, C. (2011). Routing and g-networks to optimise energy and quality of service in packet networks. In Energy-Efficient Computing and Networking. Berlin, Heidelberg: Springer, pp. 163173.Google Scholar
45.Gelenbe, E. & Muntz, R.R. (1976). Probabilistic models of computer systems: Part I (exact results). Acta Informatica 7(1): 3560.CrossRefGoogle Scholar
46.Gelenbe, E., Potier, D., Brandwajn, A., & Lenfant, J. (1973). Gestion optimale d’un ordinateur multiprogramme à mémoire virtuelle. In Fifth Conference on Optimization Techniques, Part 2, Rome, Italy, May 7–11, 1973, ser. Lecture Notes in Computer Science, eds Conti, R. & Ruberti, A.. vol. 4. Berlin, Heidelberg: Springer, pp. 132143.Google Scholar
47.Gelenbe, E. & Rossi, N. (1971). Uniform modular realizations and linear machines. IEEE Transactions on Computers 20(12): 16161617.CrossRefGoogle Scholar
48.Gelenbe, E. & Sevcik, K. (1979). Analysis of update synchronization for multiple copy data bases. IEEE Transactions on Computers 28(10): 737747.Google Scholar
49.Gelenbe, E. & Stafylopatis, A. (1991). Global behaviour of homogenous random systems. Applied Mathematical Modelling 15(10): 534541.Google Scholar
50.Gelenbe, E. & Sungur, M. (1994). Random network learning and image compression. In Neural Networks, 1994. IEEE World Congress on Computational Intelligence, Orlando, USA, 1994. IEEE, vol. 6, pp. 39963999.Google Scholar
51.Gelenbe, E., Sungur, M., Cramer, C., & Gelenbe, P. (1996). Traffic and video quality with adaptive neural compression. Multimedia Systems 4(6): 357369.Google Scholar
52.Gelenbe, E., Tiberio, P., & Boekhorst, J.C.A. (1973). Page size in demand-paging systems. Acta Informatica 3: 123.Google Scholar
53.Gelenbe, E. & Timotheou, S. (2008). Random neural networks with synchronized interactions. Neural Computation 20(9): 23082324.Google Scholar
54.Gelenbe, E. & Wu, F.-J. (2012). Large scale simulation for human evacuation and rescue. Computers & Mathematics with Applications 64(12): 38693880.Google Scholar
55.Gorbil, G., Abdelrahman, O.H., & Gelenbe, E. (2015). Modeling and analysis of RRC-based signaling storms in 3g networks. IEEE Transactions on Emerging Topics in Computing, Special Issue on Emerging Topics in Cyber Security 1: 114.Google Scholar
56.Gorbil, G. & Gelenbe, E. (2011). Opportunistic communications for emergency support systems. Procedia Computer Science 5: 3947.Google Scholar