ANALOGICAL AND NEURAL COMPUTING LABORATORY

1

ANALOGICAL AND NEURAL COMPUTING LABORATORY

Head of the Laboratory: T. Roska, Science Advisors (with D.Sc.): A. Radványi, T. Szirányi, P. Szolgay Senior Researchers (with Ph.D.): P. Földesy, L. Kék, L. Orzó, Cs. Rekeczky, I. Szatmári, Sz. Tőkés, Á. Zarándy ;part time: Keresztes, J. Levendovszky, J. Klimó Research associates: D. Bálya, V. Gál, I. Petrás, Z. Szlávik, L. Török Ph.D. Students: Cs. Benedek, Gy. Cserey, Z. Fodróczy, T. Harczos, K. Karacs, A. Kis, A. Lázár

RESEARCH PROJECTS and HIGHLIGHTS

The major motivating research themes in the field of cellular wave computing and sensory computing systems, for the new 3-year period starting this year, are as follows: • The extension of sensory computing studies to tactile and auditory systems • Proactive-adaptive CNN sensory computing modes • Immune response inspired cellular wave computing • Multimodal, multichannel, and multispectral fusion algoritms and navigation • Multichannel neuro-inspired sensory algorithms • High-speed spatio-temporal event recignition

The main results in 2004 were as follows:

• A new algorithmic platform was developed for the tasks related to multimodal sensing and navigation

• A real-time multichannel mammalian retinal implementation was developed on the Bi-i camera-computer, and a simple version of it was tested at the USC in Los Angeles on two patients with retinal implants (a collaborative efforts with the Harvard University, as well as, Pázmány University)

• New spatio-temporal synchronization pattern classes have been identified in Oscillatory CNN dynamics (a collaborative effort with U.C. Berkeley)

• An optical criptographic hardware/software system was developed based on Laptop size CNN optical computer (POAC)

• A new class of spatio-temporal chaotic attractors has identified and measured on ACE 16k visual microprocessor chips

• New collision avoidance algorithms were developed • A new biometric algorithm was developed for person identification The main application-oriented projects • The major R&D project, called telesense has been completed with innovations in

Echocardiographic image analysis, Tactile sensing, Multicamera surveillance systems, and in multi-target tracking

2

CO-OPERATING LABORATORIES The co-operating laboratories mentioned in our publications have been as follows. With the laboratories below we have made continuous common work. The closest co-operation has been made with Jedlik Laboratories of Pázmány University, Budapest The Material Science Research Institute, MFA, Hungarian Academy of Sciences, Budapest The Nonlinear Electronics Laboratory of Professor L.O.Chua at the University of California

at Berkeley The Analog Integrated Circuit Design Laboratory of Professor Ángel Rodríguez-Vázquez at

the University of Seville The Neurobiology Laboratory of Professor J. Hámori, at Semmelweis University of Medicine

in Budapest The Vision Research Laboratory of Professor F. Werblin at the University of California at

Berkeley The Neural Circuits Laboratory of Botond Roska at the Harvard University, Cambridge, MA Active, project- and contract-related collaboration has been made with The Laboratory of Professor Pier Paolo Civalleri at the Technical University of Torino The Systems and Control Laboratory of Professor Luigi Fortuna at the University of Catania The Laboratory of Professor Joos Vandewalle at the ESAT Laboratories in Leuven (Katolieke

Universiteit Leuven) The Department of Information Technology at the University of Veszprém The Division of Dr. Á.Tahy of St. Francis Hospital in Budapest The Division of A. Szathmáry at Gy. Gottsegen Hospital in Budapest In addition, with the Laboratories below, we have made useful contacts and/or started joint

work The Laboratory of Professor Ronald Tetzlaff, at Goethe University, Frankfurt The Laboratory of Dr. J. Zerubia at INRIA, Sophia - Antipolis, France The Image Processing Laboratory at the University of Leipzig, Germany The Optical Engineering Laboratory at the University of Joensuui, Finland PUBLICATIONS Journals 1. BÁLYA, D. - PETRÁS, I. - ROSKA, T. - CARMONA, R. - RODRÍGUEZ-

VÁZQUEZ, A.: Implementing the multilayer retinal model on the complex-cell CNN-UM chip prototype.

International Journal of Bifurcation and Chaos. 14 (2) : 427-451. (2004) N 1.014 2. BÁLYA, D.: Sudden global spatial-temporal change detection and its applications. Journal of Circuits, Systems and Computers. 12 (6) : 845-856. (2003) 0.047

3

3. CARMONA-GALÁN, R. - JIMÉNEZ-GARRIDO, F. - DOMÍNGUEZ-MATA, C. M. - DOMÍNGUEZ-CASTRO, R. - ESPEJO MEANA, S. - PETRÁS, I. - RODRÍGUEZ-VÁZQUEZ, Á.: Second-order neural core for bioinspired focal-plane dynamic image processing in CMOS.

IEEE Transactions on Circuits and Systems - I: Regular Papers. 51 (5) : 913-925. (2004) N 1.061

4. CZÚNI, L. - HANIS, A. - KOVÁCS, L. - KRÁNICZ, B. - LICSÁR, A. - SZIRÁNYI, T. - KAS, I. - KOVÁCS, G. - MANNO, S.: A digital motion picture restoration system for film archives.

SMPTE Motion Imaging Journal. 113 (5-6) : 170-176. (2004) 0.083 5. GÁL, V. - GRÜN, S. - TETZLAFF, R.: Analysis of multidimensional neural activity

via CNN-UM. International Journal of Neural Systems. 13 (6) : 479-487. (2003) N 6. GÁL, V. - HÁMORI, J. - ROSKA, T. - BÁLYA, D. - BOROSTYÁNKŐI, Zs. -

BRENDEL, M. - LOTZ, K. - NÉGYESSY, L. - ORZÓ, L. - PETRÁS, I. - REKECZKY, Cs. - TAKÁCS, J. - VENETIÁNER, P. - VIDNYÁNSZKY, Z. - ZARÁNDY, Á.: Receptive field atlas and related CNN models.

International Journal of Bifurcation and Chaos. 14 (2) : 551-584. (2004) 1.014 7. HIDVÉGI, T. - KERESZTES, P. - SZOLGAY, P.: Enhanced emulated digital CNN-

UM (CASTLE) arithmetic cores. Journal of Circuits, Systems, and Computers. 12 (6) : 711-738. (2003) 0.047 8. KOVÁCS, Gy. - GULYÁS, B. - SAVIC, I. - PERRETT, D. I. - CORNWELL, R. E. -

LITTLE, A. C. - JONES, B. C. -BURT, D. M. - GÁL, V. - VIDNYÁNSZKY, Z.: Smelling human sex hormone-like compounds affects face gender judgment of men.

Neuroreport. 15 (8) : 1275-1277. (2004) N 2.503 9. NAGY, Z. - SZOLGAY, P.: Fast and efficient multi-layer CNN-UM emulator using

FPGA. Periodica Polytechnica. Ser. Electrical Engineering. 47 (1-2) : 57-70. (2003) 10. PETRÁS, I. - REKECZKY, Cs. - ROSKA, T. - CARMONA, R. - JIMÉNEZ-

GARRIDO, F. - RODRÍGUEZ-VÁZQUEZ, A.: Exploration of spatial-temporal dynamic phenomena in a 32×32-cell stored program two-layer CNN universal machine chip prototype.

Journal of Circuits, Systems, and Computers. 12 (6) : 691-710. (2003) N 0.047 11. REKECZKY, Cs. - SZATMÁRI, I. - BÁLYA, D. - TÍMÁR, G. - ZARÁNDY, Á.:

Cellular multiadaptive analogic achitecture: a computational framework for UAV applications.

IEEE Transactions on Circuits and Systems - I: Regular Papers. 51 (5) : 864-884. (2004) 1.061

12. TÍMÁR, G. - KARACS, K. - REKECZKY, Cs.: Analogic preprocessing and segmentation algorithms for offline handwriting recognition.

Journal of Circuits, Systems, and Computers. 12 (6) : 783-804. (2003) 0.047 13. TŐKÉS, Sz. - ORZÓ, L. - AYOUB, A. - ROSKA, T.: Flexibly programmable opto-

electronic analogic CNN computer (POAC) implementation applying an efficient, unconventional optical correlator architecture.

Journal of Circuits, Systems and Computers. 12 (6) : 739-767. (2003) 0.047 14. TÖRÖK, L. - ROSKA, T.: Stability of multi-layer cellular neural/non-linear networks. International Journal of Bifurcation and Chaos. 14 (10) : 3567-3586. (2004) 1.014

4

15. VILARIÑO, D. L. - REKECZKY, Cs.: Implementation of a pixel-level snake algorithm on a CNN-UM based chip set architecture.

IEEE Transactions on Circuits and Systems - I: Regular Papers. 51 (5) : 885-891. (2004) N 1.061

16. WAGNER, R. - ZARÁNDY, Á. - ROSKA, T.: Adaptive perception with locally adaptable sensor array.

IEEE Transactions on Circuits and Systems - I: Regular Papers. 51 (5) : 1014-1023. (2004) 1.061

17. ZARÁNDY, Á. - REKECZKY, Cs. - FÖLDESY, P. - SZATMÁRI, I.: The new framework of applications: the Aladdin system.

Journal of Circuits, Systems, and Computers. 12 (6) : 769-781. (2003) 0.047 Conference papers 18. AYOUB, A. - TŐKÉS, Sz. - ORZÓ, L. - ROSKA, T.: Evolution of the programmable

optical array computer (POAC). In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular

neural networks and their applications. Budapest, 2004. (Eds.: T. Roska, M. Gili, B. Shi, Á. Zarándy.)

Budapest, IEEE, 2004. pp. 64-69. 19. AYOUB, A. - TŐKÉS, Sz.: The first version of the optical programmable

array/analogic computer (POAC) template library. In: MWSCAS 2003. 46th IEEE international Midwest symposium on circuits and

systems. Cairo, 2003. Piscataway, IEEE, 2004. 1-4. p. CD 20. BÁLYA, D. - TÍMÁR, G. - CSEREY, Gy. - ROSKA, T.: A new computational model

for CNN-UMS and its computational complexity. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular

neural networks and their applications. Budapest, 2004. (Eds.: T. Roska, M. Gili, B. Shi, Á. Zarándy)

Budapest, IEEE, 2004. pp. 100-105. 21. BÁLYA, D. - TÍMÁR, G. - SZATMÁRI, I. - REKECZKY, Cs.: Efficient off-line

feature selection strategies for on-line classifier systems. In: IEEE international joint conference on neural networks. Proceedings.

IJCNN’04. Budapest, 2004. Vol. 1. Piscataway, IEEE, 2004. pp. 171-176. 22. BÁLYA, D.: Mapping propositional and multi-valued logic rule-based expert systems

to the CNN-UM. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 237-242. 23. BÁLYA, D. - PETRÁS, I. - REKECZKY, Cs.: Pattern formation on the prototype

complex-cell CNN-UM chip (CACE1K). In: ISCAS ’04. Proceedings of the 2004 IEEE international symposium on circuits

and systems. Vancouver, 2004. Vol. 3. Piscataway, IEEE, 2004. pp. 53-56.

5

24. BEKE, L. - NAGY, Z. - SZOLGAY, P.: Low-cost CNN-UM global analogic programming unit implementation on FPGA.

In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular neural networks and their applications. Budapest, 2004. (Eds.: T. Roska, M. Gili, B. Shi, Á. Zarándy.)

Budapest, IEEE, 2004. pp. 28-33. 25. BENEDEK Cs. - SZIRÁNYI T.: Személyek követése a járásminta számítógépes

analízisével. In: Képfeldolgozók és alakfelismerők IV. konferenciája. Miskolc-Tapolca, 2004. Miskolc, 2004. NJSzT, pp. 14-19. 26. CSEREY, Gy. - POROD, W. - ROSKA, T.: An artificial immune system based visual

analysis model and its real-time terrain surveillance application. In: Artificial immune systems. Third international conference, ICARIS 2004.

Catania, 2004. (Eds. G. Nicosia et al.) Berlin, Springer, 2004. pp. 250-262. (Lecture notes in computer science 3239.) N 0.515 27. CSEREY, Gy. - FALUS, A. - POROD, W. - ROSKA, T.: An artificial immune system

for visual applications with CNN-UM. In: ISCAS ’04. Proceedings of the 2004 IEEE international symposium on circuits

and systems. Vancouver, 2004. Vol. 3. Piscataway, IEEE, 2004. pp. 17-20. N 28. CSEREY, Gy. - FALUS, A. - POROD, W. - ROSKA, T.: Feature extraction CNN

algorithms for artificial immune systems. In: IEEE international joint conference on neural networks. Proceedings.

IJCNN’04. Budapest, 2004. Vol. 1. Piscataway, IEEE, 2004. pp. 147-152. N 29. CZÚNI, L. - CSÁSZÁR, G. - HANIS, A. - KOVÁCS, L. - LICSÁR, A. - SZIRÁNYI,

T.: Semi automatic digital motion picture restoration system with learning capabilities. In: Learning for adaptable visual systems (LAVS 04). Satellite workshop to ICPR

2004. Cambridge, 2004. Cambridge, IAPR, 2004. pp. 1-8. (CD) N 30. FÖLDESY, P.: Trends in design of massively parallel coprocessors implemented in

digital ASICs. In: IEEE international joint conference on neural networks. Proceedings.

IJCNN’04. Budapest, 2004. Vol. 4. Piscataway, IEEE, 2004. pp. 3131-3135. 31. GACSÁDI, A. - SZOLGAY, P.: A variational method for image denoising, by using

cellular neural networks. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 213-218. 32. HAVASI, L. - BENEDEK, Cs. - SZLÁVIK, Z. - SZIRÁNYI, T.: Extracting structural

fragments of overlapping pedestrians. In: Visualization, imaging, and image processing. Proceedings of the 4th IASTED

international conference. Marbella, 2004. (Ed.: J. J. Villanieva.) Anaheim, Acta Pr., 2004. pp. 943-948.

6

33. HAVASI, L. - SZLÁVIK, Z.: Symmetry feature extraction and "understanding". In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 255-260. 34. HILLIER, D. - BINZBERGER, V. - VILARINO, D. L. - REKECZKY, Cs.:

Topographic cellular active contour techniques: comparison of different approaches. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 249-254. N 35. KARACS, K. - ROSKA, T.: Holistic feature extraction from handwritten words on

wave computers. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 364-369. 36. KÉK, L.: Toward optimized time-multiplexed CNN processing. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 106-110. 37. KIS, A. - KOVÁCS, F. - SZOLGAY, P.: Analogic CNN algorithms for textile quality

control based on optical and tactile sensory inputs. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 208-212. 38. KOVÁCS, L. - SZIRÁNYI, T.: Coding of stroke-based animations. In: WSCG’ 2004. Winter school of computer graphics. Plzen, 2004. (Eds.: R.

Scopigno, V. Skala.) Plzen, Science Pr., 2004. pp. 81-84. 39. KOVÁCS, L. - SZIRÁNYI, T.: Efficient coding of stroke-rendered paintings. In: ICPR 2004. 17th international conference on pattern recognition. Cambridge,

2004. Vol. 2. (Eds. J. Kittler, M. Petrou, M. Nixon.) Los Alamitos, IEEE, 2004. pp. pp. 835-838. 40. KOVÁCS, L. - SZIRÁNYI, T.: Painterly rendering controlled by multiscale image

features. In: SCCG 2004. Spring conference on computer graphics. Proceedings. Budmerice,

2004. (Ed.: A. Pasko.) Bratislava, 2004. pp. 183-190. 41. KOZMA, P. - KOCSÁRDI, S. - SONKOLY, P. - SZOLGAY, P.: Seismic wave

propagation modeling on emulated digital CNN-UM architecture. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 376-380.

7

42. LÁZÁR, K. A. - WAGNER, R. - BÁLYA, D. - ROSKA, T.: Functional representations of retina channels via the RefineC retina simulator.


Budapest, IEEE, 2004. pp. 333-338. 43. LICSÁR, A. - SZIRÁNYI, T.: Dynamic training of hand gesture recognition system. In: ICPR 2004. 17th international conference on pattern recognition. Cambridge,

2004. Vol. 4. (Eds. J. Kittler, M. Petrou, M. Nixon.) Los Alamitos, IEEE, 2004. pp. 971-974. 44. LICSÁR, A. - SZIRÁNYI, T.: Hand gesture recognition in camera-projector system. In: Computer vision in human-computer interaction. ECCV 2004, workshop on

HCI. Prague, 2004. (Eds.: N. Sebe, M. S. Lew, T. S. Huang.) Berlin, Springer, 2004. pp. 83-93. (Lecture notes in computer science 3058.) 0.515 45. MCRAVEN, J. - SCHEUTZ, M. - CSEREY, Gy. - ANDRONACHE, V. - POROD,

W.: Fast detection and tracking of faces in uncontrolled environments for autonomous robots using the CNN-UM.


Budapest, IEEE, 2004. pp. 196-201. N 46. NAGY, Z. - SZOLGAY, P.: Emulated digital CNN-UM implementation of a

barotropic ocean model. In: IEEE international joint conference on neural networks. Proceedings.

IJCNN’04. Budapest, 2004. Vol. 4. Piscataway, IEEE, 2004. pp. 3137-3142. 47. NAGY, Z. - SZOLGAY, Zs. - SZOLGAY, P.: Tactile sensor modeling by using

emulated digital CNN-UM. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 399-404. 48. ORZÓ, L. - ROSKA, T.: A CNN image-compression algorithm for improved

utilization of on-chip resources. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 297-302. 49. PETRÁS, I. - ROSKA, T.: CNN as curve shortening flow computer. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular



8

50. REKECZKY, Cs. - BINZBERGER, V. - HILLIER, D. - CZEILINGER, Zs. - SOÓS, G. - CSEREY, Gy. - KÉK, L. - VILARINO, D. L.: A diagnostic echocardiography system boosted by CNN technology.


Budapest, IEEE, 2004. pp. 243-248. N 51. REKECZKY, Cs. - ZARÁNDY, Á.: Bi-i: a standalone cellular vision system. Part II:

Topographic and non-topographic algorithms and related applications. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 10-15. 52. REKECZKY, Cs. - TÍMÁR, G. - BÁLYA, D. - SZATMÁRI, I. - ZARÁNDY, Á.:

Topographic and non-topographic neural network based computational platform for UAV applications.

In: IEEE international joint conference on neural networks. Proceedings. IJCNN’04. Budapest, 2004. Vol. 3.

Piscataway, IEEE, 2004. pp. 1763-1768. 53. SCHEUTZ, M. - MCRAVEN, J. - CSEREY, Gy.: Fast, reliable, adaptive, bimodal

people tracking for indoor environments. In: IROS 2004. Proceedings of the international conference on intelligent robots and

systems. Sendai, 2004. Piscataway, IEEE, 2004. pp. 1-6. N 54. SZABÓ, T. - SZOLGAY, P.: Morphological and wave segmentation by cellular neural

networks. In: NEUREL-2004. 7th seminar on neural network applications in electrical

engineering. Belgrade, 2004. Piscataway, IEEE, 2004. pp. 109-112. p. 55. SZLÁVIK, Z. - HAVASI, L. - SZIRÁNYI, T.: Estimation of common groundplane

based on co-motion statistics. In: Image analysis and recognition. International conference ICIAR 2004. Porto,

2004. Part 2. (Eds.: A. Campilho, M. Kamel.) Berlin, Springer, 2004. pp. 347-354. (Lecture notes in computer science 3212.) 0.515 56. SZLÁVIK, Z. - SZIRÁNYI, T.: Face analysis using CNN-UM. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 190-195. 57. SZLÁVIK, Z. - HAVASI, L. - SZIRÁNYI, T.: Finding matching points based on

motion-statistics from two views. In: Képfeldolgozók és alakfelismerők IV. konferenciája. Miskolc-Tapolca, 2004. Miskolc, NJSzT, 2004. pp. 284-290. 58. SZLÁVIK, Z. - HAVASI, L. - SZIRÁNYI, T.: Image matching based on co-motion

statistics. In: 3DPVT 2004. 2nd international symposium on 3D data processing, visualization,

and transmission. Thessaloniki, 2004. (Eds.: Y. Aloimonos, G. Taubin.) New York, IEEE, 2004. 1-8. p. (CD)

9

59. TÍMÁR, G. - BÁLYA, D.: Regular small-world cellular neural networks: key properties and experiments.

In: ISCAS ’04. Proceedings of the 2004 IEEE international symposium on circuits and systems. Vancouver, 2004. Vol. 3.

Piscataway, IEEE, 2004. pp. 69-72. 60. TŐKÉS, Sz. - ORZÓ, L. - AYOUB, A. - ROSKA, T.: Laptop POAC: a compact

optical implementation of CNN-UM. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 70-75. 61. TŐKÉS, Sz. - ORZÓ, L. - AYOUB, A. - ROSKA, T.: POAC (programmable optical

array computer) applied for target recognition and tracking. In: Military remote sensing. London, 2004. Proceedings of SPIE European

symposium on optics/photonics in security and defense. (Eds.: G. W. Kamerman, D. V. Willetts.)

Bellingham, SPIE, 2004. pp. 154-165. (Proceedings of SPIE 5613.) 62. TÖRÖK, L. - ZARÁNDY, Á. - ROSKA, T.: Bayesian incorporation of multiple scales

in optical flow estimation. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 309-314. 63. TÖRÖK, L. - KISH, L. B.: Integro-differential stochastic resonance. In: Fluctuations and noise in biological, biophysical, and biomedical systems II.

Canary Islands, 2004. (Eds.: D. Abbott et al.) Bellingham, SPIE, 2004. pp. 149-159. (Proceedings of SPIE 5467.) 64. VILARINO, D. L. - REKECZKY, Cs.: Efficient hardware-oriented cellular active

contours. In: ISCAS ’04. Proceedings of the 2004 IEEE international symposium on circuits

and systems. Vancouver, 2004. Vol. 3. Piscataway, IEEE, 2004. pp. 33-36. N 65. VILARINO, D. L. - REKECZKY, Cs.: Shortest path problem with pixel level snakes:

application to robot path planning. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 135-140. N 66. WAGNER, R. - ZARÁNDY, Á. - ROSKA, T.: Adaptive perception with locally-

adaptable sensor array. In: IEEE international joint conference on neural networks. Proceedings.

IJCNN’04. Budapest, 2004. Vol. 1. Piscataway, IEEE, 2004. pp. 159-164.

10

67. WAGNER, R. - ZARÁNDY, Á. - ROSKA, T.: High dynamic range perception with spatially variant exposure.


Budapest, IEEE, 2004. pp. 303-308. 68. ZARÁNDY, Á. - REKECZKY, Cs.: Bi-i: a standalone cellular vision system. Part I.

Architecture and ultra high frame rate processing examples. In: CNNA 2004. Proceedings of the 8th IEEE international workshop on cellular


Budapest, IEEE, 2004. pp. 4-9. 69. GERENCSÉR, L. - HILL, S. D. - VÁGÓ, Zs. - VINCZE, Z.: Discrete optimization,

SPSA and Markov chain Monte Carlo methods. In: Proceedings of the 2004 American control conference. Boston, 2004. Boston, AACC, 2004. pp. 3814-3819.

70. HILL, S. D. - GERENCSÉR, L. - VÁGÓ, Zs.: Stochastic approximation on discrete sets using simultaneous difference approximations. In: Proceedings of the 2004 American control conference. Boston, 2004. Boston, AACC, 2004. pp. 2795-2798.

71. GERENCSÉR, L. - RÁSONYI, M. - VÁGÓ, Zs.:Controlled Lyapunov-exponents with applications. In: 43rd IEEE conference on decision and control. Paradise Island, Bahamas, 2004. Piscataway, IEEE, 2004. pp. 2550-2554.

Research reports 72. AYOUB, A. - TŐKÉS, Sz. - ORZÓ, L.: A review of the programmable optical array

computer (POAC). Budapest, MTA SZTAKI, 2004. 23 p. (Research report of the Analogical and Neural Computing Laboratory DNS-2-2004.) 73. SZÁLKA, Zs. - SOÓS, G. - HILLIER, D. - REKECZKY, Cs.: Qualitative and

quantitative wall-motion analysis on 2D echocardiograms. Budapest, MTA SZTAKI, 2004. 27 p. (Research report of the Analogical and Neural Computing Laboratory DNS-8-2004.) 74. TÖRÖK, L. - ZARÁNDY, Á.: Analog VLSI based Bayesian multi-scale optical flow

estimation. Budapest, MTA SZTAKI, 2004. 21 p. (Research report of the Analogical and Neural Computing Laboratory DNS-7-2004.) 75. ZEFFER, T.: A two-dimensional CMOS sensor array. Budapest, MTA SZTAKI, 2004. 6 p. (Research report of the Analogical and Neural Computing Laboratory DNS-4-2004.)

Editorial works 76. ROSKA, T. - GILLI, M. - SHI, B. - ZARÁNDY, Á. (eds.): CNNA 2004. Proceedings

of the 8th IEEE international workshop on cellular neural networks and their applications. Budapest, 2004.

Budapest, IEEE, 2004. 496 p.

11

77. AYOUB, A. - TŐKÉS, Sz. (compiled ed.): Literature collection of the programmable optical array/analogic computer (POAC).

Budapest, MTA SZTAKI, 2004. 363 p. (Research report of the Analogical and Neural Computing Laboratory.) Edited special issue 78. GILLI, M. - ROSKA, T. - ZARÁNDY, Á. (eds.): CNN technology and visual

microprocessors. Part 2. Journal of Circuits, Systems, and Computers. 12 (6) : 675-856. (2003) N 0.047 79. SHI, B. E. - ARENA, P. - ZARÁNDY, Á. (eds.): Special issue on CNN technology

and active wave computing. IEEE Transactions on Circuits and Systems - I: Regular Papers. 51 (5) : 849-

1035. (2004) N 1.061

RESEARCH GRANTS

National Grants: Project title: Sensing Computers and Telepresence (TeleSense)

National Scientific Research Foundation (KFHAT) Principal Investigator: Cs. Rekeczky

Grant No.: NKFP 2/035/2001 Duration: October 2001 - July 2004

Project title: Implementation of an emulated digital CNN-UM processor array and its

applications National Committee for Technological Development (OMFB)

Principal Investigator: P. Szolgay Grant No.: IKTA-00002/2002 Duration: August 2002 – July 2004

Project title: Optical correlator based document-security system

National Committee for Technological Development (OMFB) Principal Investigator: Sz. Tőkés

Grant No.: IKTA-00109/2002 Duration: January 2003 – March 2005

Project title: Sensing – understanding topographic computers – bioinspired

architectures and electronic implementations Hungarian National Foundation (OTKA)

Principal Investigator: Csaba Rekeczky Grant No.: TS 040858 Duration: May 2002 – December 2004

Project title: Programmable optoelectronic array processors (POAC) and their

applications Hungarian National Foundation (OTKA)

12

Principal Investigator: Sz. Tőkés Grant No.: T 043136 ELE Duration: January 2003 – December 2005

Project title: Unmanned Aerial Surveillance and Navigation (ALFA)

National Scientific Research Foundation (KFHAT) Principal Investigator: Cs. Rekeczky

Grant No.: NKFP 2/046/2004 Duration: December 2004 – December 2006

International and foreign grants Project title: Focal Plane Adaptive Sensor-Supercomputer Technologies with Retina-

like Multi-channel Visual Processing Office of Naval Research, USA

Principal Investigator: T. Roska Partners: Inst. Microelectronics Seville and Harvard University

(US Co-Principal Investigator L.O. Chua, U.C. Berkeley) Grant No: N00014-02-1-0884 Duration: July 2002 – October 2005

Project title: Life-Like Object Detection for Collision Avoidance using Spatio -

Temporal Image Processing (LOCUST) EU Fifth Framework Projects

Principal Investigator: Á. Rodríguez-Vázquez (CNM-CSIC, Sevilla) Partners: Á. Zarándy (MTA SZTAKI, Budapest), Volvo Car Corp. (Göteborg),

University of Newcastle (U.K.) Grant No: IST-2001-38097 Duration: (Nov 2002)- June 2003 – October 2005

Project title: Multimedia Understanding through Semantics, Computation and

Learning (MUSCLE) – Network of Excellence EU Sixth Framework Programme

Principal Investigator: Bruno Le Dantec (GEIE ERCIM, France) Partners: T. Szirányi (MTA SZTAKI, Budapest) and a Consortium

Grant No: FP6-507752 Duration: November 2003 – November 2007

Project title: Cameras as Multifunctional Sensors for Automated Processes

(MultiSens) EU Sixth Framework Programme

Principal Investigator: Friedrich Mader (Profactor GmbH, Austria) Partners: G. Bártfai (MTA SZTAKI, Budapest) and a Consortium

Grant No: FP6-512668 Duration: June 2004 - October 2006

13

THEORETICAL COMPUTER SCIENCE RESEARCH GROUP

RESEARCH PROJECTS (E. Csuhaj-Varjú, Gy. Vaszil)

Distributed systems of language processors Joint work with M. H. ter Beek (Pisa), H. Bordihn (Potsdam), R. Gramatovici (Bucharest), J. Dassow (Magdeburg), Gh. Paun (Sevilla) Competence of individuals is a significant property in cooperation with problem solving agents. Continuing our research in context-free cooperating distributed (CD) grammar systems, where the grammars are formal language theoretic models for cooperating problem solving agents, we examined the power of different cooperation protocols based on the actual competence of the cooperating component. The competence level of a grammar on a string is the number of different non-terminals the component is able to rewrite. The obtained results demonstrate that in case the components are enabled (disabled) to rewrite the sentential form according to a certain, prescribed level of competence, then even a very small constant level of competence is sufficient to obtain the computational power of the Turing machines. If the components are probabilistic grammars, i.e., they represent agents with probabilistic behavior and use a cooperation protocol where each grammar must work as long as it is competent on the sentential form, it can be shown that systems with at most two productions in any component are also computationally complete devices. As a theme for future investigations, we also have started to study context-free CD grammar systems where the components use protocols based on dynamically changing competence conditions. One of the most important areas in formal language theory and natural language processing is syntactic analysis or parsing. Based on a subclass of context-free languages, called LL(k) languages, playing an important role in the theory of syntactic analysis, we introduced LL(k) CD grammar systems by extending the LL(k) condition, i.e., the condition of efficient parsing with a k symbol look-ahead, to CD grammar systems. When each grammar must perform m derivation steps consecutively, the language class obtained contains all context-free LL(k) languages. Moreover, we constructed a parsing algorithm which analyses the words of these languages efficiently, i.e., in O(n log n) steps where n is the length of the word to be parsed. Dialogue systems are used in various applications having human-machine interfaces or which model human dialogues. However, usual dialogue systems address very specific topics and actions and hardly can be taken as models for other applications. With these considerations, we have introduced and studied the following types of automata systems: audiences of push-down automata, i.e., systems that mutually agree on a given text, constructive dialogue systems, i.e., systems that not only agree on the dialogue but also contribute with new texts to the initial discourse, tolerant dialogue systems, i.e. systems that are able to ignore some parts of the dialogue.

Grammar Systems Week 2004 The group organized the International Workshop “Grammar Systems Week 2004”, July 5-9, 2004.

14

The on-line proceedings of the workshop was published by MTA SZTAKI, edited by Erzsébet Csuhaj-Varjú, and György Vaszil. Selected papers of the workshop will be published as a special issue of Fundamenta Informaticae, edited by Erzsébet Csuhaj-Varjú, Gheorghe Paun and György Vaszil as guest editors.

Bio-inspired models of computing Joint work with D. Besozzi (Milan), H. Bordihn (Potsdam), J. Dassow (Magdeburg), O. H. Ibarra (Santa Barbara, California), G. Mauri (Milan), Gh. Paun (Sevilla), C. Zandron (Milan).

Our investigations concerning biologically motivated language theoretic models were conducted in several directions and we obtained significant results in these areas.

P systems or membrane systems Membrane systems or P systems are the abstract models of living cells. We characterized the classes of languages described by P automata, i.e., accepting P systems with communication rules only. Motivated by some properties of natural computing systems, we studied computational complexity classes with a certain restriction on the use of the available workspace in the course of computations and related these to the language classes described by P automata. It was shown that if the rules of the P system are applied sequentially, then the accepted language class is strictly included in the class of languages accepted by one-way Turing machines with a logarithmically bounded workspace, and if the rules are applied in the maximal parallel manner, then a class of context-sensitive languages is obtained.

We have studied P systems with gemmation of mobile membranes, variants of P systems defining a new kind of communication between membranes inspired by certain, well-known biological processes in living cells. We have shown that these constructs are not only as powerful as the Turing machines, but economic computational devices as well: depending on the type of the P system, systems with three or four of membranes suffice to obtain computational completeness.

We have obtained a significant result concerning one of the most important variants of the model, called P systems with symport/antiport rules. In these systems the objects present in the regions are only allowed to move through the membranes from one region to another one, by using communication rules called symport/antiport rules associated to the regions. A symport rule specifies a multiset of objects that might travel through a given membrane in a given direction, an antiport rule specifies two multisets of objects which might simultaneously travel through a given membrane in the opposite directions. P systems with symport/antiport were shown to be able to generate any recursively enumerable set of numbers. We proved that three membranes are sufficient to obtain this power and this is currently the best known upper bound. We have started a systematic investigation of the relationship between the theory of grammar systems and membrane systems. We have defined the counterpart of some well-known cooperation protocols in cooperating distributed grammar systems for P system with string objects. The power of the obtained classes of P systems was investigated, in comparison with families of languages generated by grammars in the Chomsky hierarchy or by CD grammar systems.

15

We have also studied the relationship of membrane systems and parallel communicating (PC) grammar systems by introducing MPC systems, a class of computing devices which can be considered, at the same time, as PC grammar systems using multi-sets of strings and as tissue-like P systems using string-objects and communicating by request. It was shown that these constructs are as powerful as the Turing machines. Regarding their computational efficiency, we have also demonstrated how some well-known NP complete problems can be solved by these computational devices in linear time. Bio-operations defined over multisets We investigated finite string collections represented by multisets of strings and variants of splicing, a string operation motivated by the recombinant behavior of DNA. These constructs represent some populations of organisms (agents), dynamically changing according to some types of evolution rules. It was proved that for any natural number n there are sets of strings of these string collections which cannot be obtained if the cardinality of the initial string population is less than n. We also have shown that the choice of the variant of the splicing operation is significant, depending on the sequential or parallel application of rules, the obtained classes of sets of multisets are pairwise incomparable. We also have started the study of the equivalence classes of words and their distances defined by the operations characteristic to the recombination of DNA molecules found in simple unicellular organisms, called ciliates. The complexity of some algorithmic decidability questions related to the equivalence classes determined by two different words was investigated. In this framework we also examined some properties of languages obtained from the equivalence classes of words by iterated applications of ciliate operations. PUBLICATIONS 1. BESOZZI, D. - MAURI, G. - VASZIL, Gy. - ZANDRON, C.: Collapsing hierarchies

of parallel rewriting P systems without target conflicts. In: Membrane computing. International workshop WMC 2003. Revised papers.

Tarragona, 2003. (Eds.: C. Martín-Vide et al.) Berlin, Springer, 2004. pp. 55-69. (Lecture notes in computer science series 2933.) N 0.515 2. BESOZZI, D. - CSUHAJ-VARJÚ, E. - MAURI, G. - ZANDRON, C.: Size and power

of extended gemmating P systems. In: Second brainstorming week on membrane computing. Sevilla, 2004. (Eds.: Gh.

Paun et a.l) Sevilla, Univ. of Sevilla, 2004. pp. 92-101. University of Sevilla. Department of Computer Sciences and Artificial Intelligence TR

01/2004.) N 3. BORDIHN, H. - VASZIL, Gy.: CD grammar systems with LL(k) conditions. In: Proceedings of grammar systems week 2004. Budapest, 2004. (Eds.: E. Csuhaj-

Varjú, Gy. Vaszil.) Budapest, MTA SZTAKI, 2004. pp. 95-112. N

16

4. CSUHAJ-VARJÚ, E.: Grammar systems. In: Formal languages and applications. (Eds.: C. Martin-Vide, V. Mitrana, Gh.

Paun.) Berlin, Springer, 2004. pp. 276-310. (Studies in fuzzyness and soft computing 148.) 5. CSUHAJ-VARJÚ, E.: Grammar systems: a short survey. In: Proceedings of grammar systems week 2004. Budapest, 2004. (Eds.: E. Csuhaj-

Varjú, Gy. Vaszil.) Budapest, MTA SZTAKI, 2004. pp. 141-157. 6. CSUHAJ-VARJÚ, E.: Networks of standard Watson-Crick D0L systems with

incomplete information communication. In: Theory is forever. Essays Dedicated to Arto Salomaa on the occasion of his 70th

birthday. (Eds.: J. Karhumaki et al.) Berlin, Springer, 2004. pp. 35-48. (Lecture notes in computer science series 3113.) 0.515 7. CSUHAJ-VARJÚ, E. - IBARRA, O. H. - VASZIL, Gy.: On the computational

complexity of P automata. In: DNA 10. Tenth international meeting on DNA computing. Preliminary

proceedings. Milano, 2004. (Eds.: C. Ferretti, G. Mauri, C. Zandron.) Milano, University of Milano-Bicocca, 2004. pp. 97-106. N 8. CSUHAJ-VARJÚ, E. - DASSOW, J.: On the size of components of probabilistic

cooperating distributed grammar systems. In: Theory is forever. Essays Dedicated to Arto Salomaa on the occasion of his 70th

birthday. (Eds.: J. Karhumaki et al.) Berlin, Springer, 2004. pp. 49-59. (Lecture notes in computer science series 3113.) N 0.515 9. CSUHAJ-VARJÚ, E.: P automata: models, results, research topics. In: Pre-proceedings of fifth workshop on membrane computing. WMC5. Milano,

2004. (Eds.: G. Mauri, Gh. Paun, C. Zandron.) Milano, Universita di Milano-Bicocca, 2004. pp. 1-11. 10. CSUHAJ-VARJÚ, E. - SALOMAA, A. : The power of networks of Watson-Crick

D0L systems. In: Aspects of molecular computing. Essays dedicated to Tom Head, on the occasion

of his 70th birthday. (Eds.: N. Jonoska, Gh. Paun, G. Rozenberg.) Berlin, Springer, 2004. pp. 106-118. (Lecture notes in computer science series 2950.) N 0.515 11. CSUHAJ-VARJÚ, E. - VASZIL, Gy.: Reducing the size of extended gemmating P

systems. In: Pre-proceedings of fifth workshop on membrane computing. WMC5. Milano,

2004. (Eds.: G. Mauri, Gh. Paun, C. Zandron.) Milano, Universita di Milano-Bicocca, 2004. pp. 208-220. 12. DASSOW, J. - VASZIL, Gy.: Multiset splicing systems. BioSystems. 74 : 1-7. (2004) N 0.971 13. TER BEEK, M. H. - CSUHAJ-VARJÚ, E. - HOLZER, M. - VASZIL, Gy.: On

competence in CD grammar systems. In: Developments in language theory. 8th international conference. DLT 2004.

Auckland, 2004. (Eds.: C. S. Calude, E. Calude, M. J. Dinneen.) Berlin, Springer, 2004. pp. 76-88. (Lecture notes in computer science series 3340.) N 0.515

17

14. TER BEEK, M. H. - CSUHAJ-VARJÚ, E. - MITRANA, V.: Teams of pushdown automata.

International Journal of Computer Mathematics. 81 (2) : 141-156. (2004) N 0.226 15. TER BEEK, M. H. - CSUHAJ-VARJÚ, E. - MITRANA, V.: Teams of pushdown

automata. In: Perspectives of system informatics. (Eds.: M. Broy, A. V. Zamulin.) Berlin, Springer, 2004. pp. 329-337. (Lecture notes in computer science series 2890.) N 0.515 16. VASZIL, Gy.: On the size of P systems with minimal symport/antiport. In: Pre-proceedings of fifth workshop on membrane computing. WMC5. Milano,

2004. (Eds.: G. Mauri, Gh. Paun, C. Zandron.) Milano, Universita di Milano-Bicocca, 2004. pp. 422-431. 17. CSUHAJ-VARJÚ, E. - VASZIL, Gy. (eds.): Proceedings of grammar systems week

2004. Budapest, 2004. Budapest, MTA SZTAKI, 2004. 327 p. http://www.sztaki.hu/tcs/reports.html

PUBLICATIONS TO APPEAR 1* BESOZZI, D. – CSUHAJ-VARJÚ, E. – MAURI, G. – ZANDRON, C.: Size and

power of extended gemmating P systems. Soft Computing, to appear. 2* CSUHAJ-VARJÚ, E.: P automata: Models, results, research topics.

In: Proceedings of Fifth Workshop on Membrane Computing, WMC5, Universita di Milano-Bicocca, Italy, June 14-16, 2004. Lecture Notes in Computer Science series, Springer-Verlag Berlin Heidelberg, to appear.

3* CSUHAJ-VARJÚ, E. – DASSOW, J.: A remark on evolutionary systems. Discrete Applied Mathematics, to appear.

4* CSUHAJ-VARJÚ, E. – IBARRA, O. H. – VASZIL, GY.: On the computational complexity of P automata. In: DNA 10, Tenth International Meeting on DNA Computing. Proceedings. Lecture Notes in Computer Science series, Springer-Verlag Berlin Heidelberg, to appear.

5* CSUHAJ-VARJÚ, E. – MARTÍN-VIDE, C. – MITRANA, V.: Hybrid networks of evolutionary processors are computationally complete. Acta Informatica, to appear.

6* CSUHAJ-VARJÚ, E. – VASZIL, GY.: Reducing the size of extended gemmating P systems. In: Proceedings of Fifth Workshop on Membrane Computing, WMC5, Universita di Milano-Bicocca, Italy, June 14-16, 2004. Lecture Notes in Computer Science series, Springer-Verlag Berlin Heidelberg, to appear.

7* CSUHAJ-VARJÚ, E. – WOTSCHKE, D. (GUEST EDITORS): Descriptional Complexity of Formal Systems, Budapest, Hungary, 12-14 July 2003. Special issue of Theoretical Computer Science, to appear.

8* VASZIL, GY.: On the size of P systems with minimal symport/antiport. In: Proceedings of Fifth Workshop on Membrane Computing, WMC5, Universita di Milano-Bicocca, Italy, June 14-16, 2004. Lecture Notes in Computer Science series, Springer-Verlag Berlin Heidelberg, to appear.

9* VASZIL, GY.: On the descriptional complexity of some rewriting mechanisms regulated by context conditions Theoretical Computer Science, to appear.

18

RESEARCH GRANTS Project title: MolCoNet-A thematic network on molecular computing Site manager: E. Csuhaj-Varjú, Participant: Gy. Vaszil Grant No.: IST-2001-32008 Duration: 2001-2004 Project title: HUN-TING-EU Centre of Excellence project in information technology, computer science and control, Workpackage 5. Supervisor: E. Csuhaj-Varjú, Participant: Gy. Vaszil Contract No.: ICA1-CT-2000-70025 Duration: 2001-2004 Project title: Distributed models of molecular computation Hungarian Scientific Research Fund (OTKA) Supervisor: Gy. Vaszil Grant No.: F 037567 Duration: 2002-2005 Project title: Bio-inspired computation: formal language theoretic models Hungarian Scientific Research Fund (OTKA) Supervisor: E. Csuhaj-Varjú, Participants: J. Csima, Gy. Vaszil Grant No.: T 042529 Duration: 2003-2006

19

LABORATORY OF ENGINEERING AND MANAGEMENT

INTELLIGENCE GROUP OF APPLICATION OF AI METHODS IN ENGINEERING

RESEARCH PROJECTS A. Márkus, T. Kis, J. Váncza L. Gulyás, A. Kovács, P. Egri Ph. D. students Research is focused on various combinatorial optimization and artificial intelligence methods – specifically linear and constraint programming, search methods and agent technology – and their applications in production engineering and management. The main areas of our current interest are production planning and scheduling, as well as computer-aided process planning. We investigate also the methodology of agent-based simulation and its application in modeling social behavior. We have developed an integrated framework for production planning and scheduling which unifies the capacity and the material flow-oriented aspects of these problems [7,15,4*,9*]. The planning and scheduling levels are integrated by a novel aggregation method [10]. A tree-partitioning method has been developed to aggregate elementary operations and, hence, to build up the aggregate planning model [13]. Albeit on two different levels of aggregation, both planning and scheduling problems are captured as resource-constrained project scheduling problems. However, the actual models and solution techniques are different: the long-term planning problem is solved by a branch-and-cut algorithm that is based on new polyhedral results and fast separation algorithms [2*]. For solving detailed scheduling problems, we have taken a constraint programming approach. In this new framework, we introduced the notion of freely completable partial solutions to characterize constraint satisfaction problems with components relatively easy to solve and are only loosely connected to the remaining parts of the problem [9,11,12]. This concept has been applied in scheduling so as to exploit the structural properties of large, real-life job-shop scheduling problems [11,12,14]. The above results have been validated in course of a large-scale Hungarian R&D project on “Digital Factories, Production Networks” in different industrial problem instances. Our pilot production planner system has been deployed at a major multinational manufacturing company. Recent books on resource-constrained project scheduling are reviewed in [5*]. A new direction of research is generalized flow shop scheduling: a review on exact solution methods for solving the multiprocessor flow shop problem has been prepared [3*]. In international cooperation, we obtained new complexity results for the preemptive open shop scheduling problems with multiprocessor operations. In particular, these results made the borderline between polynomial and NP hard cases sharper [10*]. We continued earlier work on variable upper bound flow models as well. The new results were presented at [8], and are submitted for publication [11*].

20

A traditional research theme of the group is computer-aided process planning (CAPP) [1]. In international cooperation, we reviewed the state-of-the of CAPP methods in the domain of sheet metal bending [8*]. We have continued modeling complex social and economic systems with agent-based simulation [3]. Using this method, we have investigated the time-varying effects of nested choice trees in a problem of multi-modal transportation networks in urban systems [6*,7*]. Building on our toolset for participatory simulations, we have also studied the mutual effects of human participation in an artificial auction (stock market) setting with learning agents [2,1*]. We developed simulations to prove that the open-ended evolution of species can be achieved by computational systems [5,6]. Finally, we have investigated a novel 3 Person Iterated Prisoner’s Dilemma game in a spatial, evolutionary context [4]. PUBLICATIONS 1. DÉPINCÉ, P. H. - LANÇON, N. - VÁNCZA, J.: Sequencing for process planning by

genetic algorithms. In: Recent advances in integrated design and manufacturing in mechanical

engineering. (Eds.: G. Gogu et al.) Boston, Kluwer, 2003. pp. 33-42. N 2. GULYÁS, L. - ADAMCSEK, B.: Charting the market: fundamental and chartist

strategies in a participatory stock market experiment. In: EES 2004. Experiments in economic sciences - new approaches to solving real-

world problems. International conference. Okayama and Kyoto, 2004. Okayama, 2004. pp. 1-16. 3. GULYÁS, L.: Generation of robust networks with optimization under budget

constraints. In: IWES’04. Proceedings of the 5th international workshop on emergent synthesis.

Budapest, 2004. (Eds.: K. Ueda, L. Monostori, A. Márkus.) Budapest, MTA SZTAKI, 2004. pp. 27-32. 4. GULYÁS, L. - PLATKOWSKI, T.: On evolutionary 3-person prisoner’s dilemma

games on 2-D lattice. In: Cellular automata. 6th international conference on cellular automata for research

and industry. ACRI 2004. Amsterdam, 2004. (Eds: P.M. A. Sloot, B. Chopard, A. G. Hoekstra.)

Berlin, Springer, 2004. pp. 831-840. (Lecture notes in computer science 3305.) N 0.515 5. KAMPIS, G. - GULYÁS, L.: Emergence out of interaction: a phenotype based model

of species evolution. In: IWES’04. Proceedings of the 5th international workshop on emergent synthesis.

Budapest, 2004. (Eds.: K. Ueda, L. Monostori, A. Márkus.) Budapest, MTA SZTAKI, 2004. pp. 7-12. N 6. KAMPIS, G. - GULYÁS, L.: Sustained evolution from changing interaction. In: Artificial life IX. Proceedings of the ninth international conference on the

simulation and synthesis of living systems. Boston, 2004. (Eds.: J. Pollack et al.) Cambridge, MIT Pr., 2004. pp. 328-333. N 7. KIS, T. - ERDŐS, G. - MÁRKUS, A. - VÁNCZA, J.: A project-oriented decision

support system for production planning in make-to-order manufacturing. ERCIM News. (58) : 66-67.

21

8. KIS, T.: On the complexity of the car sequencing problem. Operations Research Letters. 32 : 331-335. (2004) 0.449 9. KOVÁCS, A.: A dominance framework for constraint programming. In: Proceedings of the 11th PhD mini-symposium. Budapest, 2004. Budapest, Budapest Univ. of Technology and Economics, 2004. pp. 26-27. 10. KOVÁCS, A.: A novel approach to aggregate scheduling in project-oriented

manufacturing. Projects and Profits. (Oct.) : 73-80. (2004) 11. KOVÁCS, A. - VÁNCZA, J.: Completable Partial solutions in constraint

programming and constraint-based scheduling. In: Principles and practice of constraint programming. 10th international

conference, CP 2004. Toronto, 2004. (Ed.: M. Wallace.) Berlin, Springer, 2004. pp. 332-346. (Lecture notes in computer science 3258.) 0.515 12. KOVÁCS, A. - VÁNCZA, J.: Completable partial solutions in constraint

programming and constraint-based scheduling. In: CSCLP04. Joint annual workshop of ERCIM/CoLogNet on constraint solving and

constraint logic programming. Lausanne, 2004. (Eds.: B. Faltings, F. Fages, F. Rossi, A. Petcu.)

Lousanne, 2004. pp. 244-257. 13. KOVÁCS, A. - KIS, T.: Partitioning of trees for minimizing height and cardinality. Information Processing Letters. 89 : 181-185. (2004) 0.473 14. KOVÁCS, A. - MÁRKUS, A. - VÁNCZA, J.: Structural exploration of constraint-

based scheduling problems. In: Proceedings of the 37th CIRP international seminar on manufacturing systems.

Digital enterprises, production networks. Budapest, 2004. (Ed.: L. Monostori.) Budapest, MTA SZTAKI, 2004. pp. 433-439. 15. VÁNCZA, J. - KIS, T. - KOVÁCS, A.: Aggregation - the key to integrating

production planning and scheduling. CIRP Annals. 53 (1) : 377-380. (2004) 0.974 EDITORIAL WORKS APT, K. R. - FAGES, F. - ROSSI, F.- SZEREDI, P. - VÁNCZA, J. (eds.): Recent

advances in constraints. Joint ERCIM/CoLogNET international workshop. Budapest, 2003.

Berlin, Springer, 2004. 284 p. (Lecture notes in computer science 3010.) N 0.515 UEDA, K. - MONOSTORI, L. - MÁRKUS, A. (eds.): IWES’04. Proceedings of the

5th international workshop on emergent synthesis. Budapest, 2004. Budapest, MTA SZTAKI, 2004. 147 p. PUBLICATIONS TO APPEAR Journals 1* GULYÁS, L., ADAMCSEK, B., KISS, Á.: An Early Agent-Based Stock Market:

Replication and Participation, Rendiconti Per Gli Studi Economici Quantitativi, Volume unico, 47-71. (2004)

22

2* KIS, T.: A Branch-And-Cut Algorithm for Scheduling of Projects with Variable-Intensity Activities. Mathematical Programming, in print.

3* KIS, T., PESCH, E.: A Review of Exact Solution Methods for the Non-Preemptive Multiprocessor Flowshop Problem. European Journal of Operational Research, 164: 592-608 (2005)

4* EGRI, P., KOVÁCS, A., MÁRKUS, A., VÁNCZA, J.: Project-Oriented Approach to Production Planning and Scheduling in Make-To-Order Manufacturing. Production Systems and Information Engineering, accepted.

5* KIS, T., Project scheduling: a Review of Recent Books, Operations Research Letters, 33: 105-110 (2005)

Conference proceedings and edited books 6* DUGUNDJI, E.R., GULYÁS, L.: Socio-Dynamic Discrete Choice on Networks: Multi-

agent simulation of social & spatial interaction effects in residential & transportation mode choice, In: 10th World Conference on Transport Research, Istanbul, Turkey, 4-8 July 2004.

7* DUGUNDJI, E.R., GULYÁS, L.: Dynamic Discrete Behavioral Choice on Networks: The Nested Logit Model - Analytical Results and Empirical Application, In: XXIV International Sunbelt Social Network Conference, Portoroz, Slovenia. 2004.

PUBLICATIONS SUBMITTED 8* DUFLOU, J. R., VÁNCZA, J., AERENS, R.: Computer Aided Process Planning for

Sheet Metal Bending: A State of the Art, Computers in Industry, submitted. 9* KOVÁCS, A., EGRI, P., VÁNCZA, J.: Integrated Production Planning and Scheduling

in Make-to-order Manufacturing, Gépgyártástechnológia, (in Hungarian) submitted. 10* DE WERRA, D., KIS, T., KUBIAK, W., Preemptive Open Shop Scheduling with

Multiprocessors: Polynomial Cases and Applications, submitted. 11* KIS T., On the Single Node Variable Upper Bound Flow Model with Allowed

Configurations, submitted.

RESEARCH GRANTS Project title: Digital Factories, Production Networks National Office for Research and Technology, Ministry of Education (OM) Supervisor: L. Monostori NKFP grant No: 2/040/2001 Duration: 2001-2004 Project title: VITAL: Real-time, Cooperative Enterprises National Office for Research and Technology, Ministry of Education (OM) Supervisor: L. Monostori NKFP grant No: 2/010/2004 Duration: 2004-2007

23

Project title: Virtual Research Lab for a Knowledge Community in Production Network of Excellence 6th FP, EU Supervisor: L. Monostori Grant No: NMP2-CT-2004-507487 Duration: 2004-2007 Project title: Project Scheduling Approach to Production Planning Hungarian Scientific Research Fund (OTKA) Supervisor: J. Váncza OTKA grant No: T 046509 Duration: 2004-2007

24

Computer Integrated Manufacturing Research Laboratory (CIMLab)

MEMBERS OF THE LABORATORY

KOVÁCS György L., Head of the Lab., MEZGÁR István, HAIDEGGER Géza, KOPÁCSI Sándor, NACSA János, BÍRÓ Zsolt DROZDIK Szilveszter, SÁRKÖZY Ferenc , KEUL Zsolt, BÁMER Balázs, ANUFRIEV Alexander

RESEARCH PROJECTS

The list of our research themes shows that the influence of joint European projects is increasing, consequently, we have to work according to EC priorities. This means a step-by- step change towards e-business and other e-activities. On the other hand, our national project activities increased, too. We effectively co-operate with several other units of our Institute in some projects. Most of our research results were published or are under publication (see the appropriate lists). Our research/development themes in 2004 were as follows: I. The Laboratory deals with the application of different methods (object oriented approach, concurrent engineering, co-operating agents, etc.) for the evaluation, quality control, design, planning, simulation, animation, scheduling and real-time control tasks of intelligent, flexible manufacturing systems and cells (CNC, FMS, FMC). Programming is done to test all theories by means of traditional and expert systems, using a real-time intelligent environment. II. We investigate some control problems of (intelligent) manufacturing systems. The control of manufacturing systems is managed by means of real-time systems, based on the G2 intelligent, real-time, OO environment. Research is carried out on the common problems of manufacturing system design and control system design. III. We continued the Europe driven direction of our research in the field of distributed design networks for SMEs. This is a field belonging to a specific type of virtual (or extended) enterprise. This work was started in the frames of ESPRIT Framework IV. and V. (PLENT, FLUENT and WHALES projects) and its main goal is to harmonize the activities of co-operating SMEs for production/service purposes. IV. After a successful conclusion of a joint project (Nuclear Power Plant, Paks, Systems and Control Laboratory at SZTAKI and Erőterv Ltd.) to solve certain IT control problems at the Nuclear Power Plant, using the G2 intelligent software framework (a Decision Support System with several intelligent functions were defined, designed, evaluated and implemented to improve the reliability and safety of the 120/400 kV substation of the Power Plant) a new R&D work is started to make a similar purpose, more advanced system taking into consideration the enlargement of the substation with a new 400 kV line to Pécs. V. Our Laboratory was involved in different, EU Fifth Framework projects with partners from all over Europe. The EWISME project started in late 2003 to assist SME-s in better using their IT resources. Several dozens of SME-s are trained and coached to apply novel

25

management and IT solutions for becoming innovatative and more successful on international markets. The project will have been concluded by a conference in Budapest, March 2005. VI. A new research theme has been added to the profile, the research of the impacts of wireless communication systems on networked enterprises. The wireless technology together with the connected theme of trust and security management is of great importance in networked architectures (e.g. also in virtual enterprises). This theme – among other things – pushes us towards e-business as main direction. VII. Two NKFT Széchenyi IT projects were completed in 2004 with the participation of our Laboratory, and several partners from SZTAKI and elsewhere. In the Digital Factory project our task was mainly the establishment of tele-presence, customer witness and virtual reality possibilities at industrial sites. The application of IMUTA (Interactive Multimedia software frame-system) and of business modeling for the demonstration of the above goals is our main result in the project. In the FilmSaver (DIMORF: Digital Motion Picture Restoration System) project we were responsible for the project management and for certain PR and software tasks including web-site development. Using the DIMORF project results we took active part in the successful restoration of the first Hungarian Color Movie film, Ludas Matyi (1949). The film was projected in the Hungarian Television, it will be shown in movies and will be distributed/sold in the form of a DVD. VIII. In our NKFP Széchenyi project supported by the OMFB (Ministry of Education) we work on networked interpreter-conference systems with the leadership of Digiton Ltd. Remote translators, interpreters and remote participants are enabled to run efficient multi-participant negotiations and discussions, workshops or conferences,- overcoming the barrier of being at a distant location. On-line multimedia services are also provided. Computer-aided conference organization and management support the developed Global Conference Technology. IX. Our Laboratory was very active in the Centre of Excellence (HUN-TING EU contract ICAI-CT-2000-70025) project in four ways: 1. Project management, 2. Receiving visitors, 3. Establishing virtual laboratories, 4. Other activities. All details can be found in the project reports sent to Brussels. This project ended in December 2004, and final administrative reports are due in early 2005.

X. Our joint project with Akita prefecture (Japan) on DICOM design was successfully running by sending some R&D results to Japan which are under evaluation now. XI. Some EU 6th Framework projects started in 2004 with our active participation, which will have real R&D results only later on: There are 2 STREP projects (FOKSai /AI solutions for SMEs/ and COSPA /Open Source Programing and Open Data Standards for Public Administration/), there is one IP (P2P: Pig to Pork – IT applications), and of two NoEs (EURON-2 /robotics/ and CO-DESNET /supply chain/). In all projects we have several European and some Hungarian partners. We were rather active in preparing further EU proposals with a large number of national and international partners. Several submitted proposals are still under evaluation, and we have also received some feedback on rejected ones. Our commitment to work with international consortia is unbiased.

26

We took an active part in promoting EU R&D, in pushing SME-s for cooperation and also in the preparatory work of the EU 7th Framework Programme. XII. Leonardo project started with German, Irish and Polish partners (eBEP) to apply e-learning solutions for teaching car dismountling management, procedures and technique. Several industrial SME-s are the target users of the planned e-learning solution.

PUBLICATIONS 1. ANUFRIEV, A.: Business modelling as a tool for interactive multimedia applications. In: ISDA 2004. IEEE 4th international conference on intelligent systems design and

application. Budapest, 2004. Vol. 1. (Ed.: I. Rudas.)

Budapest, IEEE, 2004. pp. 303-308. 2. BÁMER, B.: Design and operation of a Java based distributed media processing

system. In: ISDA 2004. IEEE 4th international conference on intelligent systems design and


Budapest, IEEE, 2004. pp. 297-301. 3. DROZDIK, S.: IMUTA - a framework for integration. In: ISDA 2004. IEEE 4th international conference on intelligent systems design and


Budapest, IEEE, 2004. pp. 293-295. 4. HAIDEGGER, G. - DROZDIK, Sz. - BÁMER, B. - KOVÁCS, G. L. - SÁRKÖZY, F.

- NACSA, J. - BÍRÓ, Zs. - KOPÁCSI, S. - BORIL, Zs. - SZALAY, T. - ANUFRIEV, A.: Interactive multimedia test scenarios in digital factory projects.

In: Proceedings of the 37th CIRP international seminar on manufacturing systems. Digital enterprises, production networks. Budapest, 2004. (Ed.: L. Monostori.)

Budapest, MTA SZTAKI, 2004. pp. 449-455. 5. KOPÁCSI, S. - KOVÁCS, G. L. - STOKIC, D. - CAMPOS, A. R.: Classification of

ideas in an industrial innovation management system. In: The symposium on professional practice in AI. 18th IFIP world computer

congress. Toulouse, 2004. (Eds.: E. Mercier-Laurent, J. Debenham.) Toulouse, IFIP, 2004. pp. pp. 21-30. N 6. KOVÁCS, G. L. - KAS, I. - MANNO, S. - CZÚNI, L. - SZIRÁNYI, T. - HANIS, A.:

A complete solution for motion picture restoration: scanning, processing, recording. In: ACS’ 04. IFAC multitrack conference on advanced control strategies for social

and economic systems. Vienna, 2004. Session SM1. Vienna, Vienna Univ. of Technology, 2004. pp. 1-6. (CD) 7. KOVÁCS, G. L. - KAS, I. - MANNO, S. - CZÚNI, L. - SZIRÁNYI, T.: An intelligent

solution for motion picture restoration. In: The symposium on professional practice in AI. 18th IFIP world computer

congress. Toulouse, 2004. (Eds.: E. Mercier-Laurent, J. Debenham.) Toulouse, IFIP, 2004. pp. 177-186. 8. KOVÁCS, G. L. - HAIDEGGER, G. - POPA, A.: Multimedia technologies provide

test scenarios in a national research project. In: ISDA 2004. IEEE 4th international conference on intelligent systems design and



27

9. KOVÁCS, G. L. - DROZDIK, S. - ZULIANI, P. - SUCCI, G. C.: Open source

software and open data standards in public administration. In: ICCC 2004. Second IEEE international conference on computational cybernetics.

Vienna, 2004. (Eds.: W. Elmenreich, W. Haidinger, J. A. Tenreiro Machado.) Vienna, ICCC, 2004. pp. 421-428. N 10. KOVÁCS, G. L. - DROZDIK, S. - ZULIANI, P. - SUCCI, G. C.: Open source

software for the public administration. In: CSIT’2004. Proceedings of the workshop computer science and information

technologies. Budapest, 2004. Vol. 1. Ufa, Ufa State Aviation Technical University, 2004. pp. 1-8. N 11. MEZGÁR, I.: Impacts of wireless networking technologies on distributed production

systems. In: Proceedings of the 37th CIRP international seminar on manufacturing systems.

Digital enterprises, production networks. Budapest, 2004. (Ed.: L. Monostori.) Budapest, MTA SZTAKI, 2004. pp. 343-350. 12. MEZGÁR, I.: Novel networking technologies for collaborative networked

organizations. In: Virtual enterprises and collaborative networks. IFIP 18th world computer

congress. Toulouse, 2004. (Ed.: L. M. Camarinha-Matos.) Boston, Kluwer, 2004. pp. 397-406. 13. NACSA, J.: Intelligent wearable computer application using a knowledge server. In: ISDA 2004. IEEE 4th international conference on intelligent systems design and

application. Budapest, 2004. Vol. 1. (Ed.: I. Rudas.) Budapest, IEEE, 2004. pp. 315-318. 14. SÁRKÖZY, F.: Some solutions for an interpreter enabled multimedia conferencing

system. In: ISDA 2004. IEEE 4th international conference on intelligent systems design and


Budapest, IEEE, 2004. pp. 309-313. 15. CZÚNI, L. - HANIS, A. – KOVÁCS, L. - KRÁNICZ, B. - LICSÁR, A. - SZIRÁNYI,

T. - KAS, I. - KOVÁCS, G. - MANNO, S.: A digital motion picture restoration system for film archives. SMPTE Motion Imaging Journal. 113 (5-6) : 170-176. (2004)

RESEARCH GRANTS Project title: HUN-TING

EU Fifth Framework Project-Centre of Excellence Supervisor: Haidegger, G. Duration: 2001-2004 Project title: P2P

EU VI. Framework IP Project Supervisor: Mezgar, I. Duration: 2004-2006

28

Project title: CO-DESNET EU VI. Framework NoE Project Supervisor: Kovacs, G.L. Duration: 2004-2006 Project title: COSPA

EU VI. Framework STREP Project Supervisors: Drozdik, Sz. and Kovacs, G.L. Duration: 2004-2006 Project title: FOKSai

EU VI. Framework STREP Project Supervisors: Kopacsi, S. and Kovács, G. L. Duration: 2004-2006 Project title: eBEP

EU VI. Framework Leonardo Project Supervisor: Haidegger, G. Duration: 2004-2006 Project title: PAKS

Paks Nuclear Power Plant, industrial project Supervisosr: Nacsa, J. and Kovács, G. L. Duration: 2003-2005 Project title: FilmSaver for Archives (DIMORF)

NKFP Széchenyi Project Supervisors: Kovács, G. L. and Kas, I. Duration: 2001-2004 Project title: Digital Factory

NKFP Széchenyi Project Supervisors: Monostori, L. and Kovács, G. L. and Haidegger, G. Duration: 2001-2004 Project title: GCN

NKFP Széchenyi Project (led by Digiton Ltd.) Supervisors: Haidegger, G., Kovács, G. L. and Sárközy, F. Duration: 2002-2005 Project title: AKITA

Joint Hungarian-Japanese Project Supervisors: Kovács, G. L. and Sárközy, F. Duration: 2001-2004 Project title: EURON-2

European NoE in Robotics Supervisor: Kovács, G. L. Duration: 2004-2006

29

Project title: Sim-Serv European NoE in Simulation

Supervisor: Kovács, G. L. Duration: 2001-2004 Project title: Application of the Knowledge Server Concept for wearable computers BOLYAI JÁNOS Research Grant Supervisor: Nacsa J. Duration: 2003-2005 Project title: Theoretical support of manufacturing-, production- and process-

management BOLYAI JÁNOS Research Grant Supervisor: Biró Zs. Duration: 2002-2004

30

GEOMETRIC MODELING AND COMPUTER VISION LABORATORY

Benkő, P. (part-time), Chetverikov, D. (head), Ekárt, A. (January-June), Kós, G. (part-time), Renner, G., Várady, T. (part-time); 4 PhD students: Jankó, Zs., Hajder, L., Megyesi, Z., Szobonya, L. ERCIM fellow: Renaud Péteri. RESEARCH PROJECTS 1. REVERSE ENGINEERING 1.1. Segmentation and flattening of triangular meshes Segmentation is a key issue in reverse engineering. This process is relatively simple if point regions are bounded by sharp edges, and highly complicated when smoothly connected regions need to be separated. A direct segmentation method has been developed [1], which is based on a hierarchy of tests. By applying the tests, a large point cloud can be robustly split into smaller subregions, until no further subdivision is needed. The tests are based on local estimates of various geometric and statistical quantities. Flattening means deforming a 3D mesh into a plane, while topology needs to be preserved and distortions must be minimized. Flattening is performed by using a weighting system. The already known systems have been deduced as special cases of a common system, and have been generalized for arbitrary dimensions. 1.2 Designing curves on surfaces Curves on surfaces are important design elements in CAGD. A method was presented to explicitly compute these curves, and practical solutions were provided for improving the efficiency of the implementation [19]. Because of the high degree of exact curves on surfaces, good approximations are important from practical point of view. Two approximate solutions were elaborated. The first starts from the exact solution, and simplifies it by degree reduction, the second extends conventional least-squares approximations by incorporating the geometry of the surface as well. 1.3. Prosthetic applications The project aimed at developing new types of knee prosthetics and support their surgery by computer was continued. Methods were developed for the stable estimation of the contact points between cartilage surfaces, and tools were given for the morphological analysis of the active surfaces of condyles. 2. COMPUTER VISION 2.1. Structure from motion For the affine camera model, shape and motion data can be factorised directly from the measurement matrix constructed from 2D image points coordinates. However, classical algorithms for Structure from Motion (SfM) are not robust: measurement outliers, i.e.,

31

incorrectly detected or matched feature points may destroy the result. A novel robust SfM algorithm [8,9] based on the Least Trimmed Squares and real (not affine) motion data has been proposed, which is more efficient than the existing robust methods in two aspects: it better separates outliers from inliers, and it is applicable to highly contaminated data when the outlier ratio exceeds 50%. The problem of 3D motion segmentation based on SfM has also been addressed. 2.2. Photo-realistic scene reconstruction The Laboratory has been working on several projects related to the automatic fusion and high-level interpretation of 2D and 3D sensor data for building rich models of real-world objects and scenes. A major research goal is building photorealistic 3D models based on multi-modal sensor data. Based on genetic optimisation, a new method has been developed [10-12] for the automatic registration of two images showing an object, to a 3D surface model of the object obtained by direct measurement with a 3D scanner. The method extends the notion of photo-consistency to uncalibrated cameras, which gives the user more freedom and convenience in acquiring the images. It includes a novel flattening-based algorithm for the correct blending of overlapping texture maps. Genetic optimisation has also been successfully used for automatic alignment and simultaneous optimal parameter setting in the case of two partially overlapping, measured 3D surfaces at arbitrary orientation [13]. 2.3. Wide-baseline stereo New results have been obtained in wide-baseline stereo [14-16] when the two views of a scene are widely separated and differ significantly. Correspondences between periodic regions were used to compute a rough affine alignment of the two images, find a sufficient number of precise feature point correspondences, build the epipolar geometry and rectify the two images [16]. A novel dense matching procedure [14,15] was then applied which is based on affine region growing. The procedure accounts for affine distortion of the local features typical for wide-baseline stereo images. New methods have been developed for the optimal automatic selection of seed points, 3D rotation-invariant depth discontinuity detection, and the interpolation of unfilled regions. This computational process results in a hole-free and dense disparity map providing 3D measurements for most of the mutually visible image points. 2.4. Analysis of dynamic texture The processing, description and recognition of dynamic (time-varying) textures are new exciting areas of texture analysis. Many real-world textures are dynamic textures whose recognition and retrieval from a video database should be based on both dynamic and static features. Under the supervision of Chetverikov, Renaud Péteri who was an ERCIM Fellow at SZTAKI in 2004, started research on dynamic texture characterisation and recognition. A method for extracting features revealing some fundamental structural properties of dynamic textures was developed [2*]. The features are based on the normal flow and spatio-temporal texture regularity evaluated for the image sequence. Their discriminative ability was successfully demonstrated in a complete classification process.

32

3. OTHER TOPICS 3.1. Genetic programming and its applications A detailed analysis of the impact of problem difficulty on code growth in genetic programming has been made [6]. A new data structure for genetic programming has been created which makes statistics-based analysis of the dynamics of genetic programs fast and easy [3, 4]. In most real life problems when a decision is to be made, one has to take more than one criterion into consideration. The criteria are of different importance and may be conflicting. In multi-criteria decision problems many values must be assigned, such as the importance of the different criteria and the values of the alternatives with respect to subjective criteria. Since the assignment of weights and alternative values with respect to subjective criteria is approximate, it would be preferable either to get a stable solution or to obtain a solution with reasonable stability. A method based on genetic programming has been developed [6*] that produces decision functions better than the commonly used ones. PUBLICATIONS 1. BENKŐ, P. - VÁRADY, T.: Segmentation methods for smooth point regions of

conventional engineering objects. Computer-Aided Design. 36 : 511-523. (2004) 1.036 2. CHETVERIKOV, D. - MEGYESI, Z. - JANKÓ, Zs.: Finding region correspondences

for wide baseline stereo. In: ICPR 2004. 17th international conference on pattern recognition. Cambridge,

2004. Vol. 4. (Eds. J. Kittler, M. Petrou, M. Nixon.) Los Alamitos, IEEE, 2004. pp. 276-279. 3. EKÁRT, A. - GUSTAFSON, S.: A data structure for improved GP analysis via

efficient computation and visualisation of population measures. In: EUROGP’2004. European conference on genetic programming. Coimbra, 2004.

(Eds.: M. Keijzer et al.) Berlin, Springer, 2004. pp. 35-46. (Lecture notes in computer science 3003.) N 0.515 4. EKÁRT, A.:Analysing the emerging properties of genetic programs through the itrees

of populations. In: IWES’04. Proceedings of the 5th international workshop on emergent synthesis.

Budapest, 2004. (Eds.: K. Ueda, L. Monostori, A. Márkus.) Budapest, MTA SZTAKI, 2004. pp. 61-66. 5. EKÁRT, A. - MÁRKUS, A.: Using genetic programming and decision trees for

generating structural descriptions of four bar mechanisms. Artificial Intelligence for Engineering Design, Analysis and Manufacturing. 17

(3 ): 205-220. (2003) 0.645 6. GUSTAFSON, S. - EKÁRT, A. - BURKE, E. - KENDALL, G.: Problem difficulty

and code growth in genetic programming. Genetic Programming and Evolvable Machines. 5 (3) : 271-290. (2004) N

33

7. HAJDER L. - KARDOS I. - CHETVERIKOV D. - RENNER G.: Aktív kontúrok és Fast Marching eljárás alkalmazása az orvosi képfeldolgozásban. (Active contours and fast marching methods in medical image processing, in Hungarian)

In: Képfeldolgozók és alakfelismerők IV. konferenciája. Miskolc-Tapolca, 2004. Miskolc, NJSzT, 2004. pp. 90-96. 8. HAJDER, L. - CHETVERIKOV, D. - VAJK, I.: Robust structure from motion by

outlier rejection. In: Képfeldolgozók és alakfelismerők IV. konferenciája. Miskolc-Tapolca, 2004. Miskolc, NJSzT, 2004. pp. 83-89. 9. HAJDER, L. - CHETVERIKOV, D. - VAJK, I.: Robust structure from motion under

weak perspective. In: 3DPVT 2004. 2nd international symposium on 3D data processing, visualization,

and transmission. Thessaloniki, 2004. (Eds.: Y. Aloimonos, G. Taubin.) New York, IEEE, 2004. 1-8. p. (CD) 10. JANKÓ, Zs. - CHETVERIKOV, D.: Photo-consistency based registration of an

uncalibrated image pair to a 3D surface model using genetic algorithm. In: 3DPVT 2004. 2nd international symposium on 3D data processing, visualization,

and transmission. Thessaloniki, 2004. (Eds.: Y. Aloimonos, G. Taubin.) New York, IEEE, 2004. 1-7. p. (CD) 11. JANKÓ, Zs. - CHETVERIKOV, D.: Precise registration based on photo-consistency. In: Képfeldolgozók és alakfelismerők IV. konferenciája. Miskolc-Tapolca, 2004. Miskolc, NJSzT, 2004. pp. 137-143. 12. JANKÓ, Zs. - CHETVERIKOV, D.: Registration of an uncalibrated image pair to a

3D surface model. In: ICPR 2004. 17th international conference on pattern recognition. Cambridge,

2004. Vol. 2. (Eds. J. Kittler, M. Petrou, M. Nixon.) Los Alamitos, IEEE, 2004. pp. 208-211. 13. LOMONOSOV, E. - CHETVERIKOV, D. - EKÁRT, A.: Fully automatic, robust and

precise alignment of measured 3D surfaces for arbitrary orientations. In: Digital imaging in media and education. 28th workshop of the Austrian

Association for Pattern Recognition.Hagenberg, 2004. Wien, OCG, 2004. pp. 39-46. ([email protected] 179.) N 14. MEGYESI, Z. - CHETVERIKOV, D.: Affine propagation for surface reconstruction

in wide baseline stereo. In: ICPR 2004. 17th international conference on pattern recognition. Cambridge,

2004. Vol. 4. (Eds. J. Kittler, M. Petrou, M. Nixon.) Los Alamitos, IEEE, 2004. pp. 76-79. 15. MEGYESI, Zs. - CHETVERIKOV, D.: Enhanced surface reconstruction from wide

baseline images. In: 3DPVT 2004. 2nd international symposium on 3D data processing, visualization,

and transmission. Thessaloniki, 2004. (Eds.: Y. Aloimonos, G. Taubin.) New York, IEEE, 2004. 1-7. p. (CD) 16. MEGYESI, Z. - CHETVERIKOV, D. - JANKÓ, Zs.. Wide baseline stereo. From

pixels to 3D model. In: Képfeldolgozók és alakfelismerők IV. konferenciája. Miskolc-Tapolca, 2004. Miskolc, NJSzT, 2004. pp. 185-190.

34

17. NOVÁK, N. - MEGYESI, Z.: Building 3D models using calibrated stereo and structured light.

In: Képfeldolgozók és alakfelismerők IV. konferenciája. Miskolc-Tapolca, 2004. Miskolc, NJSzT, 2004. pp. 213-220. 18. PONGRÁCZ, F. - RENNER, G.: Volume and surface models from CT/MR images. In: Képfeldolgozók és alakfelismerők IV. konferenciája. Miskolc-Tapolca, 2004. Miskolc, 2004. NJSzT, pp. 244-251. 19. RENNER, G. - WEISS, V.: Exact and approximate computation of B-spline curves on

surfaces. Computer-Aided Design. 36 (4) : 351-362. (2004) N 1.036 20. RENNER, G: Genetic algorithms in Computer-Aided Design. Computer-Aided Design and Applications. 1 (1-4) : 691-700. (2004) 21. RENNER, G. - SZOBONYA, L.: Reverse engineering of free-form objects with

geometric constraints. In: Proceedings of the 37th CIRP international seminar on manufacturing systems.

Digital enterprises, production networks. Budapest, 2004. (Ed.: L. Monostori.) Budapest, MTA SZTAKI, 2004. pp. 297-302. PUBLICATIONS TO APPEAR 1* RENNER, G., STROUD, I.A.,: Techniques for the calculation of medial surfaces of

solids. Int. Journal of Computer Applications in Technology. 2* PÉTERI, R., and D.CHETVERIKOV.,: Qualitative characterization of dynamic

textures for video retrieval. Proc. International Conference on Computer Vision and Graphics (ICCVG), Warsaw, 2004, to appear in Kluwer series on Computational Imaging and Vision.

3* M.S.FLOATER, G. KÓS and M.REIMERS: Mean value coordinates in 3D. Computer Aided Geometric Design.

4* M.S. FLOATER, K.HORMANN and G.KÓS: A general construction of barycentric coordinates over convex polygons. Advances in Comp. Math.

5* CHETVERIKOV, D., D.STEPANOV and P.KRSEK: Robust Euclidean alignment of 3D point sets: the Trimmed Iterative Closest Point algorithm. Image and Vision Computing. 23 (3): 299-309. (2005).

6* EKÁRT, A.; NÉMETH, S.Z.: Stability Analysis of Tree Structured Decision Functions. European Journal of Operational Research. 160 (3): 676-695. (2005)

RESEARCH GRANTS Project title: Efficient and user-friendly reverse engineering of complex, free-form

objects in the automotive industry (ADREN) Ministry of Education (OM) Supervisors: G. Renner & T. Várady Grant no.: ALK/00108/2002

Duration: 2002-2004

35

Project title: Stereotactic and navigational operative management of the knee based on

3D computed image of the joint geometry National Research and Development Project (NRDP) Supervisors: G. Renner & Gy. Szántó NRDP Grant no.: NKFP-1B-0009/2002

Duration: 2002-2005 Project title: Experimental investigation of the mechanical structure of cartilage by MR

imaging Hungarian National Science Foundation (OTKA) Supervisor: G. Renner OTKA Grant no.: T37889 Duration: 2002-2005 Project title: Photorealistic scene reconstruction Hungarian National Science Foundation (OTKA) Supervisor: D. Chetverikov OTKA Grant no.: T 038355 Duration: 2002-2004 Project title: Multimedia Understanding through Semantics, Computation and Learning (MUSCLE) EU FP6 Network of Excellence Supervisor: D. Chetverikov (with T. Szirányi) Grant no.: FP6-507752 Duration: 2004-2007

36

INFORMATICS LABORATORY I. RESEARCH PROJECT (Benczúr A., Bodon, F., Demetrovics, J., Fogaras, D., Friedl, K., Ivanyos, G., Lukács, A., Rácz, B., Rónyai, L., Sarlós, T., Schneider, Cs., Szőnyi, T., Uher, M.) COMPUTER SCIENCE 1. Algebra and computation a. Quantum computations Together with our collaborators at the Laboratioire de Recherche en Informatique, CNRS--Universitè de Paris Sud, we continued the work on quantum algorithms for group theoretical problems. We have a new algorithm for testing multiplication tables of finite groups. The method runs in time polynomial in the logarithm of the size of the table and recognizes, with high probability, the multiplication tables which are far (with respect to a suitable notion of distance) from the multiplication table of an Abelian group. Our paper on the subject has been accepted for presentation/publication at the prestigious conference ACM STOC'2005. b. Polynomial functions on finite sets The study of Gröbner bases and standard monomials of finite point sets was continued. We considered the lexicographic standard monomials of the ideal of polynomials vanishing on a fixed finite point sets. The standard monomials, being a basis of polynomial functions on the point set, are useful in many contexts, from theoretical applications to simple interpolation problems. With the aid of a combinatorial game, which we call the lex game, we managed to characterize the set of lexicographic standard monomials as the set of "winning configurations" of the game. This characterization leads to a novel algorithm to compute the standard monomials, which is apparently faster than the previous methods. In fact, in many interesting cases it runs in linear time, therefore, it is optimal as far as asymptotic time requirement is considered. The lex game also allowed us to obtain a (theoretical) description of the standard monomials of some combinatorially interesting sets of points. 2. Data mining and applied algorithms The research activities of our group include data mining, Web search and applied graph algorithms in general, with special emphasis on clustering and similarity search with special stress on mining text, Web server logs and drug molecule databases. a. Searching the Web Our research group built an experimental search engine with the first use as the intranet search engine of the Hungarian Telecom. The engine forms an infrastructure and a testbed for further research as well as a flexible base that meets industry requirements with an emphasis on

37

integrating natural language processing tools for Hungarian language - a language with a particularly complicated grammar, which causes the biggest difficulty for a search engine designer. Popular search engines, such as Google, use the information encoded in the hyperlink structure to rank the quality of Web pages. We obatined new results for similarity search and personalized ranking based on the hyperlink structure. To approximate the problems in question Monte Carlo methods were used. We note that both the similarity matrix and the personalized ranking matrix have size quadratic in the number of Web pages. Since currently several billion of Web pages exist, naive approaches for the above problems would exceed the storage capacities available. b. Web log analysis Massification of the use of the Internet has made automatic knowledge extraction form web log files a necessity. We designed and implemented an experimental web log mining architecture with advanced storage and data mining components. The aim of the system is to give a flexible base for web usage mining of large-scale Internet sites. In our experiments we use the web server logs of the largest Hungarian Web portal [origo] (www.origo.hu) that, among other things, provides online news and magazines, community pages, software downloads, free e-mail, as well as, a search engine. The portal is of a size of over 130,000 pages and receives 6,500,000 HTML hits on a typical workday, producing 2.5 GB of raw server logs that remains a size of 400 MB per day even after cleaning and preprocessing, thus overrunning the storage space capabilities of typical commercial systems. The system includes several modules to provide a complete service for web log handling and analysis. The modules for collecting and filtering provide the preprocessed data for the advanced modules of a refined storing system and an OLAP-like statistical unit. The statistical unit provides a fast on-line service for basic statistical aggregation and detailed short-term queries. Notice that an OLAP architecture design for weblog mining is a challenging task. The storage is designed to provide a base for long-term storage in a form appropriate for direct processing by data mining algorithms. A novel preprocessing and high density compression technique for log files is introduced. c. Text mining Text classification may be supervised on unsupervised. In the former case topics can be learnt from precompiled examples; in the latter case that is both semantically and algorithmically more difficult, we have no information to guide the classification process. We propose a new method that selects 4-5 key words from each document without any external information; based on the key words classification can be performed with the same or even improved accuracy as for the full text. d. Vertex connectivity augmentation Edge augmentation forms a subclass of network design problems where one wants to improve on the various connectivity properties of a network by installing the least possible number of new edges. Typically, we require a minimum value k for _edge_ or _node_ connectivity

38

implying that the network remains connected after a failure of less than k edges or nodes, respectively. We give an algorithm for increasing undirected node connectivity. The algorithm is a novel combination of shortest augmenting path and partial ordered set techniques and is the first candidate of a practical algorithm for the problem. At the same time of acceptance for the conference proceedings, the result is invited for publication in a special issue of the ACM Transaction on Algorithms. RESEARCH GRANTS Project title: Resources for Quantum Information (RESQ) Supervisor (at SZTAKI): Ivanyos, G.

Grant no.: IST-2001-37559 Duration: 2003-2005

Project title: Efficient algorithms Supervisor: Demetrovics, J.

OTKA Grant no.: T 042706 Duration: 2003-2006.

Project Title: Data Riddle Supervisor: Benczúr, A.A., Lukács, A.

Hungarian Ministry of Education Grant no OM-2-0017/2002 Duration: 2002-2004.

PROJECT Project Title: Data mining in chemical databases Supervisor: Lukács, A.

Richter contract Duration: November 2003 - May 2004.

II. RESEARCH PROJECT DISCRETE AND COMPUTATIONAL GEOMETRY (Szabó, L.) Discrete and computational geometry is an important part of modern mathematics. The theory owes its early developement to its aesthetic appeal and its classical flavor, but more recently, some of its themes have been found closely related to rapidly developing areas of computer science. This year we have concentrated on the following problems. Minkowski arrangement of spheres. Let µ be a non-negative number not greater than 1. Consider an arrangement K of spheres in the d-dimensional Euclidean space. With each sphere K of K associate a concentric sphere of radius µ times the radius of K. We call this sphere the µ-kernel of K. The arrangement K is said to be a Minkowski arrangement of order µ if no sphere of K overlaps the µ-kernel of another sphere. We gave upper estimates for the density of d-dimesional Minkowski sphere arrangements of order µ with positive homogenity for all µ�d.

39

Spherical point sets. Let ak denote the minimum radius of a spherical cap containing k points with pairwise spherical distance at least π/3. The exact value of ak is determined only for k�6. We determined the exact value of a7 and showed that the extremal configuration is unique. This quantity seems to be important in certain problems concerning sphere packings in which each sphere is touched by a given number of spheres (k-neighbour sphere packings). III. RESEARCH PROJECT (Györfi, L., Antos, A., Pintér, M., György, A., Linder, T.) NONPARAMETRIC STATISTICS We characterized the large deviation behaviour of Hellinger distance restricted to partition. The results can be applied for calculating the Bahadur efficiency of nonparametric tests. We accomplished and submitted our work on a simpler proof for a sharper minimax lower bound of the expected distortion redundancy of empirical vector quantizers with two, three or more levels and on the analogous lower bound for the restricted class of distributions with uniformly bounded densities. Extending our results to zero-delay lossy coding schemes, we investigated new universal low-complexity lossy compression schemes with a delay constraint for encoding sequences with piecewise different behavior (sources like this appear in many applications of practical interest, e.g., speech signals). In this way each sequence can be compressed asymptotically, as well as, if we used the best coding method which can adaptively change the applied quantizer from time to time. We applied universal prediction techniques for constructing low-complexity universal lossy source codes. We studied the approximation of block-Markov sources with higher order Markov sources, and proved that the divergence rate between the source and its approximation vanishes exponentially fast as the memory of the model increases. This result was applied to analyze the performance of bit-based compression algorithms on byte aligned sources. From a practical point of view, our results enable the application of binary universal source codes (for byte-aligned sources, as well), which may exploit the computational advantages resulting from operating on a small alphabet. (Note that industry standard compression algorithms are byte-based and perform poorly on not byte-aligned sources.) We derived analytic expressions for error probabilities for space-time coded channels and designed joint source-channel coding schemes. Ongoing work focuses on establishing performance bounds for causal universal entropy coded source coding for dependent sources. PUBLICATIONS 1. ANTOS, A. - GYÖRFI, L. - GYÖRGY, A.: Improved convergence rates in empirical

vector quantizer design. In: ISIT 2004. Proceedings 2004 International symposium on information theory.

Chicago, 2004. Piscataway, IEEE. pp. 301.

40

2. ANTOS A. - PINTÉR M.: Nemparaméteres függvénybecslések. (Nonparametric function estimation, in Hungarian) Alkalmazott Matematikai Lapok. 21 (1) : 99-129. (2004) 3. BADDELEY, R. W. - PRAEGER, C. E. - SCHNEIDER, Cs.: Transitive simple

subgroups of wreath products in product action. Journal of the Australian Mathematical Society. 77 (1) : 55-72. (2004) N 0.404 4. BENCZÚR A. - CSALOGÁNY K. - FOGARAS D. - FRIEDMAN E. - RÁCZ B. -

SARLÓS T. - UHER M. - WINDHAGER E.: Magyar nyelvű tartalom a világhálón. In: Információs társadalom internet információtechnika. (Szerk.: Szeli K.) Budapest, INFINIT-BME ITTK, 2004. pp. 48-55. (Kutatási jelentés 26.) 5. BÖRÖCZKY, K. - SZABÓ, L.: Minkowski arrangements of spheres. Monatshefte für Mathematik. 141 : 11-19. (2004) 0.403 6. DEMETROVICS, J. - MOLNÁR, A. - THALHEIM, B: Graphical and spreadsheet

reasoning for sets of functional dependencies. Kiel, Christian-Albrechts-Univ., 2004. 71 p. (Christian-Albrechts-Universität. Institut für Informatik und Praktische Mathematik

0404.) 7. DEMETROVICS, J. - MOLNÁR, A. - THALHEIM, B: Graphical reasoning for sets

of functional dependencies. In: Conceptual Modeling - ER 2004. 23rd international conference on conceptual

modeling. Proceedings. Shanghai, 2004. (Eds.: P. Atzeni et. al.) Berlin, Springer, 2004. pp. 166-179. (Lecture notes in computer science 3288.) N 0.515 8. DEMETROVICS J. - SALI A.: Relációs adatmodell tervezés. In: Informatikai algoritmusok. 1. köt. (Szerk.: Iványi A.) Budapest, ELTE Eötvös K., 2004. pp. 503-535. 9. FARKAS, A. - GYÖRGY, A. - RÓZSA, P.: On the spectrum of pairwise comparison

matrices. Linear Algebra and its Applications. 385 : 443-462. (2004) 0.656 10. FOGARAS, D. - RÁCZ, B.: A scalable randomized method to compute link-based

similarity rank on the web graph. In: Current trends in database technology - EDBT 2004. Workshops PhD, DataX,

PIM, P2P&DB, and ClustWeb. Heraklion, 2004. (Eds.: W. Lindner et al.) Berlin, Springer, 2004. pp. 557-567. (Lecture notes in computer science 3268.) 0.515 11. FOGARAS, D.: Ranking the pages of the world wide web. Periodica Polytechnica. Ser. Electrical Engineering. 48 (1-2) : 5-10. (2004) 12. FOGARAS, D. - RÁCZ, B.: Towards scaling fully personalized pageRank. In: Algorithms and models for the web-graph. Third international workshop,

WAW 2004. Proceedings. Rome, 2004. (Ed.: S. Leonardi.) Berlin, Springer, 2004. pp. 105-117. (Lecture notes in computer science 3243.) 0.515 13. GYÖRFI, L.: Large deviations of Hellinger distance on partitions. In: Mathematics and computer science III. Algorithms, trees, combinatorics and

probabilities. (Eds.: M. Drmota et al.) Basel, Birkhäuser, 2004. pp. 531-537. (Trends in mathematics.)

41

14. GYÖRGY, A. - LINDER, T. - LUGOSI, G.: A ''follow the perturbed leader''-type algorithm for zero-delay quantization of individual sequences.

In: DCC ’04. Proceedings of the 2004 IEEE data compression conference. Snowbird, 2004. New York, IEEE, 2004. pp. 342-351.

15. GYÖRGY, A. - LINDER, T. - LUGOSI, G.: Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding.

IEEE Transactions on Signal Processing. 52 : 2337-2347. (2004). 1.458 16. GYÖRGY, A. - LINDER, T. - LUGOSI, G.: Efficient algorithms and minimax

bounds for zero-delay lossy source coding. In: ISIT 2004. Proceedings 2004 International symposium on information theory. Chicago, 2004. Piscataway, IEEE. pp. 463. 17. HEGEDŰS, G. - NAGY, A. - RÓNYAI, L.: Gröbner bases for permutations and

oriented trees. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös

Nominatae. Sectio Computatorica. 23 : 137-148. (2004) 18. RÁCZ, B. - LUKÁCS, A.: High density compression of log files. In: DCC ’04. Proceedings of the 2004 IEEE data compression conference. Snowbird,

2004. New York, IEEE, 2004. pp. 557. 19. RÁCZ, B.: nonordfp: an FP-growth variation without rebuilding the FP-tree. In: FIMI’04. Workshop on frequent itemset mining implementations. Proceedings.

Brighton, 2004. (Eds.: R. Bayardo, B. Goethals, M. J. Zaki.) Brighton, 2004. pp. 41-46. 20. SCHÖNHOFEN, P. - CHARAF, H.: Sentence-based document size reduction. In: ClusWEB 2004. Clustering information over the web. Proceedings. Heraklion,

2004. Heraklion, 2004. pp. 77-86.

42

APPLIED MATHEMATICS LABORATORY STOCHASTIC SYSTEMS RESEARCH GROUP Head: L. Gerencsér

Financial mathematics

(E. Berlinger, L.Carassus, L. Gerencsér, L. Györfi, Z. Mátyás, Gy. Michaletzky, G. Molnár-Sáska, G. Morvai, Zs. Orlovits, M. Rásonyi, J. Száz, L. Stettner, Cs. Szepesvári, Zs. Vágó)

Arbitrage and large markets: In the theory of large financial markets it is widely conceived that there exist pricing measures exactly when there is no arbitrage in an appropriate, asymptotic sense. A result like this has been obtained in [10] for a class of models well-known in economic theory. An overview on recent results in large financial markets (including those of the author’s) is presented in [6*]. Applications of control theory to finance : The existence of optimal portfolio strategies and related risk-neutral pricing operators have been established in [11] and [5*] in co-operation with Lukasz Stettner (IMPAN, Warsaw Mathematical Institute of the Polish Academy of Sciences). In co-operation with Laurence Carassus (Université Paris 7) M. Rásonyi proved the continuity of optimal strategies with respect to investors’ preference relations. These results are based on those of [5*]. It has been conjectured that as risk-aversion of agents tends to infinity their respective utility prices (assigned to a contingent claim) tend to the superreplication (risk-free) price of the given claim. Up to now only very special cases of this conjecture have been shown. A further result of the above collaboration is a proof of this conjecture in a fairly general setting. The above collaboration has partly been financed by the EU Centre of Excellence Programme. Behavioral finance : A stochastic feedback model for financial markets was proposed [3], in which the agent's decision is based on his beliefs of the price dynamics and his behavior reflecting his attitude, such as risk aversion or risk preference. A variety of behaviors of economic players is described by experimental psychologists, see, e.g., the famous paper of Kahnemann and Tversky, 1986. When a new agent enters the market, his/her anticipations and actions alter the market dynamics and a genuinely closed loop system arises. The market is in equilibrium if the agent’s beliefs no longer change the market dynamics. A data-driven real-time procedure to find the equilibrium price predictor has been developed. The convergence of the resulting stochastic approximation procedure was analyzed by using the techniques developed by Benveniste, Metivier and Priouret, and the conditions for convergence have been verified. Simulation results for various behaviors such as rational behavior, loss aversion and risk-seeking behavior were also presented. By using market dynamics fitted to real data and simple AR predictors, the quick convergence of parameter processes was established in all of our test examples.

43

The single-agent model was extended to a comprehensive multi-player stock market model [2]. In this case the market dynamics is completely determined by stock market regulations (for the rules used currently at the Budapest Stock Exchange) and the transaction requests of the agents. Bid prices emerged as a new and essential element of the behavior. Various sources of randomness were considered such as threshold dependent actions, random bid prices and exogenous white noise. Initial experiments for the computation of the optimal growth rates belonging to two different behaviors (rational behavior and loss aversion) have been carried out. As preliminary findings, we noted that the wealth processes of non-rational players admit much higher variability than those of rational players. Stochastic volatility models for financial time series : The log-returns of a stock exhibits a so-called volatility clustering phenomena: long periods of low volatility are followed by short periods of high volatility. A typical figure for log-returns is given in the following Figure, an SP 500 daily data for 4 years (1997-2001):

It follows that the conditional variance is time-varying, a fact not true for linear processes. The first basic non-linear stochastic volatility model, due to R. Engle, is the so-called ARCH process, in which volatility is modelled with the help of a stochastic non-linear feedback system driven by observed log-returns. A useful extension is the GARCH model. GARCH processes have been applied also for estimating the volatility of index returns, and for modelling the joint dynamics of futures contracts. A key problem is the estimation of the parameters of a GARCH model. The strong consistency of the quasi log-likelihood function has been established under very weak conditions by Berkes et al. We have taken a different route: by assuming stronger conditions on the driving noise and extending the techniques for ARMA processes, we have derived strong approximation results both for the standard quasi-maximum-likelihood estimator and also for its fixed gain version. A basic problem is to detect structural changes in the market, which is reflected in changes of the GARCH parameters. There are several methods for detecting these changes such as hypothesis testing, or asymptotic and bootstrap tests. A change point detection method for GARCH processes, inspired by similar results for ARMA processes and leading to a kind of Hinkley detector with appropriately defined residuals has been developed in [5].

Student loan systems: A stochastic model for the Hungarian student loan system has been developed. The creditor's risk was investigated in terms of the two basic control parameters of the model, the risk premium and the repayment quotient. Some special features of the Hungarian system, such as self-financing and writing off the debt at retirement, were also incorporated into the model. The dependence of the creditor’s profit and the borrower’s welfare on basic intervention parameters was analyzed by using a number of simulation

44

examples. The findings allow for a reasonable choice of parameters, which makes the system sustainable for the lender and attractive for the borrower. A typical debt profile is given in the figure:

Logoptimal portfolios: Logoptimal portfolios, ensuring the maximal growth rate of the wealth process, with transaction costs, an extension of the basic model of Cover, have been studied. This has led us to a hard MDP (Markov Decision Process) problem. A direct approach would be to develop on-line data driven procedures. This has led to the sub-problem of estimating the conditional expectation of any day’s return given the past. A result of Györfi et al. states that there is no universal method for getting a strong consistent solution to this problem. Partial results for Gaussian processes have been obtained by Schafer, and the results of the latter have been extended to a wider class of Gaussian processes. Recent results on control-Lyapunov-exponents of random matrix products have been applied to optimizing the logarithmic growth rate of currency portfolios under minimal conditions on the exchange rate matrix. The theory has been reaffirmed by simulation results, [6]. Hidden Markov Models (L. Gerencsér, I. Kmecs, Gy. Michaletzky, G. Molnár-Sáska, T. Szilágyi, Zs. Vágó) Estimation of HMM-s : Hidden Markov Models (HMM-s) are widely used due to their flexibility in modelling dynamical phenomena in engineering, physics and economy. A basic problem in the theory of Hidden Markov Models is the estimation of the dynamics of the process. A tight connection between the estimation theory of HMM-s and linear stochastic systems have been established in [2*], via the realization techniques of V. Borkar, and the theory of L-mixing processes. As a byproduct, conditions for non-linear stochastic systems are given under which an L-mixing input generates an L-mixing output. In establishing the above connection a key role is played by what is called uniform exponential stability of the filter process. The results of [2*] have been extended to general compact state-space usage. These results have been applied to derive a strong approximation theorem for the estimates of HMM-parameters, [2*]. Another basic problem is to detect structural changes in the model. A change point detection method for HMM-s has been developed along the lines described above for GARC processes in [4]. An inflection in the on-line Hinkley statistics gives a clue for a change, see the figure below:

45

Quantized Gaussian linear models: We have investigated the identification of quantized Gaussian linear models. Our primary interest is in the estimation of quantized Gaussian ARMA-processes for speech restoration in mobile communication. This leads to integration in dimension 320 for a special MCMC (Markov Chain Monte Carlo) has been developed. The identifiability issue has been settled in [7*]. For static models, given by quantized linear regression, an effective real-time recursive estimation method, a randomized EM (Expectation Maximization) method has been developed and analyzed.

Stochastic adaptive control and optimization (L. Gerencsér, S. Hill, Gy. Michaletzky, Zs. Vágó) Recursive estimation: Some risk sensitive estimation of multivariable linear stochastic systems have been introduced and investigated. This is a genuinely recursive estimation method with a weight matrix as a design parameter. The optimal weight matrix has been determined by using results from stochastic realization theory [4*]. More application to a basic result on the strong approximation of recursive estimators leading to an exact characterization of the loss in performance in stochastic adaptive control have been developed in [3*]. SPSA in discrete optimization: The minimization of quadratic functions over a set of grid-points with integer coordinates is a basic problem in resource allocation for network design. We have further improved an MCMC (Markov-Chain Monte-Carlo) method in which the initial Markov Chain is generated by the SPSA (simultaneous perturbation stochastic approximation) method by a careful choice truncations, averaging and acceptance probabilities ([7], [9], [1*]). PUBLICATIONS 1. BOLLA, M. - MOLNÁR-SÁSKA, G.: Optimization problems for weighted graphs

and related correlation estimates. Discrete Mathematics. 282 (1-3) : 23-33. (2004) 0.303 2. GERENCSÉR, L. - MÁTYÁS, Z.: A behavioral stock market model. In: Stochastic finance 2004. Autumn school and international conference. Lisbon,

2004. Lisbon, CIM, ISEG, 2004. pp. 1-7. (CD) 3. GERENCSÉR, L. - MÁTYÁS, Z.: A system theoretic approach to behavioral finance. In: 43rd IEEE conference on decision and control. Paradise Island, Bahamas,

2004. Piscataway, IEEE, 2004. pp. 335-339.

46

4. GERENCSÉR, L. - MOLNÁR-SÁSKA, G.: Change detection of Hidden Markov models.

In: 43rd IEEE conference on decision and control. Paradise Island, Bahamas, 2004.

Piscataway, IEEE, 2004. pp. 1754-1758. 5. GERENCSÉR, L. - MOLNÁR-SÁSKA, G. - ORLOVITS, Zs.: Change-detection of

Hidden Markov models and GARCH processes. In: Stochastic finance 2004. Autumn school and international conference. Lisbon,

2004. Lisbon, CIM, ISEG, 2004. pp. 1-12. (CD) 6. GERENCSÉR, L. - RÁSONYI, M. - VÁGÓ, Zs.: Controlled Lyapunov-exponents

with applications. In: 43rd IEEE conference on decision and control. Paradise Island, Bahamas,

2004. Piscataway, IEEE, 2004. pp. 2550-2554. 7. GERENCSÉR, L. - HILL, S. D. - VÁGÓ, Zs. - VINCZE, Z.: Discrete optimization,

SPSA and Markov chain Monte Carlo methods. In: Proceedings of the 2004 American control conference. Boston, 2004. Boston, AACC, 2004. pp. 3814-3819. N 8. GERENCSÉR, L. - MÁTYÁS, Z.- MOLNÁR-SÁSKA, G. - ORLOVITS, Zs.:

Statistical theory of non-linear stochastic systems. I. Budapest, MTA SZTAKI, 2004. 30 p. 9. HILL, S. D. - GERENCSÉR, L. - VÁGÓ, Zs.: Stochastic approximation on discrete

sets using simultaneous difference approximations. In: Proceedings of the 2004 American control conference. Boston, 2004. Boston, AACC, 2004. pp. 2795-2798. N 10. RÁSONYI, M.: Arbitrage pricing theory and risk-neutral measures. Decisions in Economics and Finance. 27 : 109-123. (2004) 11. RÁSONYI, M. - STETTNER, L.: Utility maximization in discrete-time financial

market models. In: Stochastic finance 2004. Autumn school and international conference. Lisbon,

2004. Lisbon, CIM, ISEG, 2004. pp. 1-4. (CD) N PUBLICATIONS TO APPEAR: 1* HILL, S. D. – GERENCSÉR. L. - VÁGÓ, Zs.: Discrete Stochastic Approximation via

Simultaneous Difference Approximation. American Control Conference 2005, June 8 – June 10, Portland, Oregon, USA, submitted.

2* GERENCSÉR, L. – MICHALETZKY, GY. – MOLNÁR-SÁSKA, G. – TUSNÁDY, G.: A new approach for the statistical analysis of Hidden Markov Models. IEEE Trans. Automatic Control, under revision

3* GERENCSÉR, L.: A representation theorem for recursive estimators. SIAM Journal on Control and Optimization. Accepted for publication.

4* GERENCSÉR, L. - MICHALETZKY, Gy. - VÁGÓ, Zs.: Risk-sensitive identification of linear stochastic systems. Mathematics of Control, Signals and Systems. Accepted for publication.

5* RÁSONYI,M. – STETTNER, L.: On utility maximization in discrete-time market models. Annals of Applied Probability, Accepted for publication.

47

6* RÁSONYI, M.: Arbitrage on large financial markets (in Hungarian). SIGMA, accepted for publication.

7* SZEIDL, Á. – GERENCSÉR, L. – MICHALETZKY, GY.: Quantized Gaussian ARMA identification. Systems and Control Letters, accepted for publication.

RESEARCH GRANT

Project title: Stochastic Systems and Modelling Financial Markets Hungarian National Science Foundation (OTKA) Supervisor: L. Gerencsér OTKA grant No.: T047193 Duration: 2002-2006

48

GROUP OF DISCRETE STRUCTURES RESEARCH PROJECTS (A. Gyárfás, M. Ruszinkó, G. Sárközy, J. Lehel) Applications of the Szemerédi Lemma. One of the strongest tools in structural graph theory is the Szemerédi Lemma. A well-known expert in this field, Gábor Sárközy, joined recently our team. Putting together our skills, we solved exactly [*10] the longstanding open problem of the Ramsey number of the paths when three colors are used. The 35-page long proof combines earlier results of Ramsey type with matching theory and the Szemerédi Lemma. Similar methods were used in [*11] and in [*10], where we investigated an analogue of the Gerencsér-Gyárfás Theorem.

Ramsey Theory. Further Ramsey type questions were also investigated, e.g., an extension of the famous Ruzsa-Szemerédi Theorem is obtained in by Sárközy, Gallai’s methods are used in [3]. The results in [*2-*5, *7] are obtained by using classical methods and anti-Ramsey questions are investigated in [*21].

Codes. A applied line of our investigations is coding theory. In [*23] we investigated

identifying codes in random graphs and gave sharp thresholds for their existence. In [1,*1] we got bounds on single user identifying superimposed codes and put further efforts to get better bounds on regular superimposed codes [*19]. The important Johnson bound is generalized in [*13].

Extremal Graph and Hypergpaph Problems. In general, we continued to investigate

extremal problems in graphs and hypergraphs co-operating with internationally recognized institutions and co-authors, e,g., [2-4,6,*6,*8-*9, *14-*18]. Most of our papers are published in top international scientific journals . PUBLICATIONS 1. BALISTER, P. N. - GYŐRI, E. - LEHEL, J. - SCHELP, R. H.: Longest paths in

circular arc graphs. Combinatorics, Probability and Computing. 13 (3) : 311-317. (2004) N 0.407 2. CSŰRÖS, M. - RUSZINKÓ, M. : Single user tracing superimposed codes. In: ISIT 2004. Proceedings 2004 International symposium on information theory.

Chicago, 2004. Piscataway, IEEE. pp. 253. 3. GYÁRFÁS, A. - SIMONYI, G. : Edge colorings of complete graphs without

tricolored triangles. Journal of Graph Theory. 46 (3) : 211-216. (2004) 0.289 4. GYÁRFÁS, A. - JENSEN, T. - STIEBITZ, M.: On graphs with strongly independent

color-classes. Journal of Graph Theory. 46 (1) : 1-14. (2004) N 0.289 5. KUBICKI, G. - LEHEL, J. - MORAYNE, M.: An asymptotic ratio in the complete

binary tree. Order. 20 (2) : 91-97. (2003) N 0.267

49

6. BACSÓ, G. - GRAVIER, S. - GYÁRFÁS, A. - PREISSMANN, M. - SEBŐ, A.: Coloring the maximal cliques of graphs.

SIAM Journal on Discrete Mathematics. 17 (3) : 361-376. (2004) N 0.725 PUBLICATIONS TO APPEAR 1* CSÜRÖS, M. – RUSZINKÓ, M. : Single user tracing and disjointly

superimposed codes. IEEE Transactions on Information Theory (accepted) 2* BALISTER, P. – LEHEL, J. – SCHELP, R.H.: Ramsey unsaturated and saturated graphs. Journal of Graph Theory (accepted) 3* GYÁRFÁS, A. – HUBENKO, A. : Semistrong edge coloring of graphs. Journal of graph Theory (accepted) SUBMITTED IN 2004: 4* BALISTER, P. – GYÁRFÁS, A. - LEHEL, J. – SCHELP, R.H.: Mono-multi bipartite Ramsey numbers, designs, and matrices. Journal of

Combinatorial theory A 5* BALISTER, P. – GYÁRFÁS, A. - LEHEL, J. – SCHELP, R.H.: Finding a monochromatic subgraph or a rainbow path. Journal of Graph Theory 6* CROPPER, M. - GYÁRFÁS, A. - LEHEL, J.: Comparing the Hall ratio. Discrete

Mathematics 7* BOLLOBÁS, B. - GYÁRFÁS, A.: Highly connected monochromatic subgraphs.

Discrete Mathematics 8* BOLLOBÁS, B. - GYÁRFÁS, A. - LEHEL, J. - SCOTT, A.: Maximum directed

cuts in acyclic digraphs 9* FÜREDI, Z. - GYÁRFÁS, A. – SIMONYI, G.: Connected matchings and

Hadwiger’s conjecture. Combinatorics Probability and Computing

10* GYÁRFÁS, A. - RUSZINKÓ, M. - SÁRKÖZY, G.N. - SZEMERÉDI, E.: Three-color Ramsey numbers for paths. Combinatorica

11* SÁRKÖZY, G.N. – SELKOW, S.: On an anti-Ramsey problem of Burr, Erdős, Graham and T. Sós. Journal of Graph Theory 12* SÁRKÖZY, G.N. – SELKOW, S.: Distributing vertices along a Hamiltonian cycle in

Dirac graphs.Graphs and Combinatorics 13* SÁRKÖZY, A. – SÁRKÖZY, G.N.: On partial block designs with large blocks.

Discrete Mathematics SUBMITTED BEFORE 2004: 14* FÜREDI, Z. - RUSZINKÓ, M.: Large Convex Cones in Hypercubes.

Discrete Applied Mathematics, special volume on General Theory of Information Transfer and Combinatorics (Accepted)

15* KUBICKI, G. – LEHEL, J. – MORAYNE, M.: Counting Chains and Antichains in the complete binary tree Ars Combinatoria (Accepted)

16* GYÁRFÁS, A. – JACOBSON, M. - KEZDY, A. – LEHEL, J.: Odd cycles and theta cycles in hypergraphs Discrete Mathematics (Accepted)

50

17* CHANG, P. – HUTCHINSON, W. – JACOBSON, M. – LEHEL, J.: The visibility number of graphs. SIAM Journal on Discrete Mathematics

18* SÁRKÖZY, G.N. – SELKOW, S.: On a Turán-type hypergraph problem of Brown, Erdős and T. Sós. Discrete Mathematics

IN PREPARATION: 19* FÜREDI, Z. - RUSZINKÓ,M.: Regular Superimposed codes. 20* BOHMAN, T. - FRIEZE, A. - MARTIN, R. - RUSZINKÓ, M. - SMYTH, C.: On

Randomly Generated Intersecting Hypergraphs II. 21* BOHMAN, T. - FRIEZE, A. - MARTIN, R. – RUSZINKÓ, M. - SMYTH, C.:

Polychromatic cliques and related questions. 22* GYÖRFI, L. - GYŐRI, S. – LACZAY, B. - RUSZINKÓ, M.: Lecture Notes on

Multiple Access. 23* FRIEZE, A. - MARTIN, R. - MONCEL, J. - RUSZINKÓ, M. - SMYTH, C.: Codes

Identifying Sets of Vertices in Random Networks 24* GYÁRFÁS, A. - RUSZINKÓ, M. - SÁRKÖZY, G.N. - SZEMERÉDI, E.: Tripartite

Ramsey numbers for paths. RESEARCH GRANTS Project title: Combinatorial Computer Science Hungarian National Science Foundation (OTKA) Supervisor: M. Ruszinkó OTKA Grant No.: T038198 Duration: 2002-2005 Project title: Extremal, average and Computational Aspects of Discrete Structures NATO Collaborative Research Grant Supervisor: Alan Frieze (Carnegie Mellon University, USA) Duration: 2001- Project title: Analysis and Coding for Multiple Access Channels

Dept. of the Navy Grant (Office of Naval Research), No.: N00014-04-1-4034 Supervisor: M. Ruszinkó

Duration: 2004

51

LABORATORY OF OPERATIONS RESEARCH AND DECISION SYSTEMS

RESEARCH PROJECTS I. OPERATIONS RESEARCH (K. Balla, S. Bozóki, J. Fülöp, Cs. Mészáros, S. Z. Németh, M. Prill, T. Rapcsák) Equilibrium systems and smooth optimization (S. Z. Németh, T. Rapcsák) In paper [*17], some properties of the spaces of paths are studied in order to define and characterize the local convexity of sets belonging to smooth manifolds and the local convexity of functions defined on the local convex sets of smooth manifolds. The Fenchel problem of level sets reformulated by Roberts and Varberg in their book titled "Convex functions" (1973, p. 271) is as follows: "What "nice" conditions on a nested family of convex sets will ensure that it is the family of level sets of convex functions?". The aim of the paper is to draw attention to this structural question of convex analysis and to survey some results in different directions [*16]. The Fenchel problem of level sets in the smooth case is solved by deducing a new and "nice" geometric necessary and sufficient condition for the existence of a smooth convex function with the level sets of a given smooth pseudoconvex function. The main theorem is based on a general differential geometric tool, the geometry of paths defined on smooth manifolds. This approach provides a new view on the convexlike and generalized convexlike mappings in the image analysis, and on a complete geometric characterization of a new subclass of pseudoconvex functions originated from analytical mechanics [*18]. In [25], the aim is to show that interesting and important statistical problems containing the principal component analysis, statistical visualization and singular value decomposition, furthermore, the matrix spectral theorem, the characterization of the structural stability of dynamical systems and many other ones lead to the minimization of a smooth function on a Stiefel manifold where the question is to find optimal orthogonal matrices. Optimization on Stiefel manifolds was discussed by Rapcsák in earlier papers, and some global optimization methods were considered and tested on Stiefel manifolds. In [*3,*4], test functions are given with known global optimum points and their optimal function values. A restriction, which leads to a discretization of the problem is suggested, which results in a problem equivalent to the well-known assignment problem. In [*5], the problem considered is as follows: given C⊂ Rn and F: C→ Rn differentiable, find f: C→ R differentiable such that ||∇f(x)||-1 ∇f(x)= ||F (x)||-1 F(x) for all x∈C. Conditions for f to be pseudoconvex or convex are given. The results are applied to the differentiable case of the revealed preference problem.

52

Scalar derivatives and scalar asymptotic derivatives were applied to fixed point theory and complementarity problems. The results are presented in [8,*9] and a monograph is in preparation [*10]. Some extensions of a famous fixed point theorem of Altman are obtained and their applications are described. Conditions for the non-existence of the exceptional family of elements expressed in terms of the scalar derivatives were given. They provide with the solvability of a complementarity problem. Differential- algebraic equations (K. Balla) We considered differential-algebraic equations and their adjoints with well matched leading coefficients in parallel. Associated with tractability indices up to 2, DAEs were decomposed and the inherent and the essentially underlying ODEs were segregated, respectively. Criteria ensuring the decomposition and taking the adjoint to commute were formulated. Hamiltonian systems were studied, as well [*1]. Another class of self-adjoint problems was investigated in [1]. General linear boundary value problems for DAEs up to index 2 are considered in [3]. Game theory (J. Fülöp, M. Prill) Negotiations to reduce greenhouse gas accumulation in the atmosphere are modeled as extensive games of perfect information. Various solution concepts, such as Nash equilibrium, reaction function equilibrium, correlated equilibrium and bargaining solutions are applied, analyzed and computed. Special reduction techniques are used when the size of the game tree becomes excessive. A new solution concept, the tree-correlated equilibrium is also introduced. The main features of an Excel add-in designed to compute various solutions are briefly described and a sample policy analysis for a special negotiating scenario is discussed [*8]. Large-Scale Optimization (Cs. Mészáros) Research was continued on interior point methods for large-scale optimization problems. Implementation techniques for quadratic optimization with separable convex quadratic constraints were developed. We used our existing methods for the underlying linear algebra kernels [*12]. We developed efficient techniques for interior point methods which exploit the features of modern computer hardware. II. DECISION SYSTEMS Multiattribute decision making (S. Bozóki, S. Z. Németh, T. Rapcsák) In [7], it is shown that the singular value decomposition is a good tool to provide a theoretically well formulated solution both for the scaling and consistency problems in a major multiattribute decision model, the Analytic Hierarchy Process. The Least Squares Method Problem in the AHP has been solved for 3x3,...,8x8 matrices. Resultant method, generalized resultant method and homotopy method were used. Numerical results have been used for comparative analysis of weighting methods.

53

Environmental modeling (K. Balla, S. Márton, T. Rapcsák) We summarized the background theory and described an air pollution model as applied to a composting plant. Two technologies of the composting process were compared. The model was based upon the Hungarian Standards. The region was analyzed from both the meteorological and the geomorphologic points of view [*2].

Event-oriented GIS (B. Mihályi) The usual GIS applications do not allow the representation and examination of dynamic processes (e.g. social, environmental procedures). The programs are object-oriented and are able to manage static matters, only. The event-oriented GIS tries to resolve this imperfection of the current GIS softwares. A pilot project is under development. The role of maps in military operations

Maps have a great influence on military operation planning. Sometimes, the lack of maps or imprecise maps can cause military blunders. Research aims at gathering examples of military disasters based on poor operation planning and insufficient maps. The effects of maps are stronger than historians have thought to be so far. Up to now, this approach of military operation planning has been absolutely neglected [18,20]. The siege of Budapest in 1944-45 Although several historians have dealt with the siege of Budapest, there have remained many unknown details. The research project aims at unravelling the defence system of Budapest at the end of 1944 [9,22,23,24] that was uncovered in former studies.

III. APPLICATIONS (S. Bozóki, J. Fülöp, G. Kéri, S. Márton, Cs. Mészáros, K. Móczár, M. Prill, T. Rapcsák, I. Selmeczy) Together with the members of the Department of Operations Research and Decision Systems, the members of the Laboratory took part in the application of mathematical and software engineering results related to decision systems.

Decision systems and environmental modeling (S. Bozóki, J. Fülöp, G. Kéri, S. Márton, Cs. Mészáros, K. Móczár, M. Prill, T. Rapcsák, I. Selmeczy) In MAVIR (Hungarian Power System Operator Company), we have participated in the evaluation of several tenders by using our WINGDSS methodology and software.

54

For the development of the collaborative communication and knowledge organisation model of academic research in on-line technological environment, we took part in the elaboration of an efficient collaborative evaluation and knowledge organisation system, in the analysis of feedback mechanisms in off-line and on-line communities, and in the analysis of the role of feedback mechanisms in the emergence of communities. A group decision support system for multiattribute decision making and environmental modeling software tools based on GIS databases were planned and are now under development. It includes various evaluation, weighting and tree aggregation methods. Furthermore, a powerful sensitivity analysis is also implemented in the software. PUBLICATIONS 1. ABRAMOV, A. A. - BALLA, K. - UL’YANOVA, V. I. - YUKHNO, I. S.: A

nonlinear self-adjoint spectral problem for differential-algebraic equations. Differential Equations. 39 (7) : 913-925. (2003) N 0.243 2. BALLA, K. - MÁRTON, S. - RAPCSÁK, T.: Air pollution modeling in action. Budapest, MTA SZTAKI, 2004. 11 p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-5.) 3. BALLA, K. - MÄRZ, R.: Linear boundary value problems for differential algebraic

equations. Miskolc Mathematical Notes. 5 (1) : 3-18. (2004) N 4. BALOG J. - CSENDES T. - RAPCSÁK T.: Globális optimalizálás Stiefel-

sokaságokon - egy érdekes diszkretizálási eredmény. Budapest, MTA SZTAKI, 2004. 14 p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-10.) 5. BÁRDOSI V. - KISS G. - KISS M. - RAPCSÁK T.: Kísérlet magyar szavak

jelentéshasonlóságának meghatározására a Magyar szókincstár segítségével. Budapest, MTA SZTAKI, 2004. [11] p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-8.) 6. CROUZEIX, J.-P. - RAPCSÁK, T.: Integrability of pseudomonotone differentiable

maps and the revealed preference problem. Budapest, MTA SZTAKI, 2004. 23 p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-11.) N 7. GASS, S. I. - RAPCSÁK, T.: Singular value decomposition in AHP. European Journal of Operational Research. 154 (3) : 573-584. (2004) N 0.605 8. ISAC, G. - NÉMETH, S. Z.: Scalar derivatives and scalar asymptotic derivatives. An

Altman type fixed point theorem on convex cones and some applications. Journal of Mathematical Analysis and Applications. 290 : 452-468. (2004) N 0.473 9. JUHÁSZ, A. - MIHÁLYI, B.: Budapest védelmi vonalainak rekonstrukciója (1944).

(The reconstruction of the defence lines of Budapest (1944), in Hungarian) In: Magyarok a II. világháborúban. Szakkönyvgyűjtemény. (Hungarians in the 2nd world war, in Hungarian) Budapest, Arcanum, 2004. CD-ROM

55

10. KÉRI, G. - ÖSTERGARD, P. R. J.: Bounds for covering codes over large alphabets. Revised version.

Budapest, MTA SZTAKI, 2004. 24 p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-3.) N 11. KÉRI, G.: Classification of 2 and 3 dimensional MDS codes for 4<=q<=32. Budapest, MTA SZTAKI, 2004. 20 p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-4.) 12. KÉRI, G.: Classification of MDS codes by exhaustive computer search. Revised

version. Budapest, MTA SZTAKI, 2004. 8 p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-2.) 13. KÉRI, G. - ÖSTERGARD, P. R. J.: Further results on the covering radius of small

codes. Revised version. Budapest, MTA SZTAKI, 2004. 14 p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-1.) N 14. KÉRI, G. - KISVÖLCSEY, Á.: On computing the Hamming distance. Acta Cybernetica. 16 : 443-449. (2004) 15. KÉRI, G.: On the number of large complete arcs in PG(2, q), 23<=q<=32. Budapest, MTA SZTAKI, 2004. 12 p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-7.) 16. KÉRI, G.: Types of superregular matrices and the sizes of complete arcs in PG(r, q),

q<=19, 2<=r<=q-2. Budapest, MTA SZTAKI, 2004. 16 p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-6.) 17. MÉSZÁROS, Cs.: On the performance of the Cholesky factorization in interior point

methods on Pentium 4 processors. Budapest, MTA SZTAKI, 2004. 9 p. (Working paper of the Laboratory of Operations Research and Decision Systems.

(LORDS) WP04-9.) 18. MIHÁLYI, B.: Tájfutó térképek alkalmazása csatatérkutatásnál. (The application of

orienting maps in battlefield research, in Hungarian) Tájoló. 22 (2) : 26. (2004)

19. MIHÁLYI, B. - GUSZLEV, A. - ZENTAI L.: Helyfüggő szolgáltatások. (Location based services, in Hungarian) Térinformatika. (márc.) : 28. (2004)

20. MIHÁLYI, B.: Térképek szerepe a hadszíntéren. Katonai baklövések (1914-18). (Military blunders, in Hungarian) Geodézia és Kartográfia. 56 (7) : 30-33. (2004)

21. MIHÁLYI, B. - JUHÁSZ., A.,: II. alkalmazott informatika konferencia. (On the 2nd Conference on applied informatics, in Hungarian) Geodézia és Kartográfia. 56 (9) : 23. (2004)

56

22. MIHÁLYI, B.: Budapest ostromának kartográfiai feldolgozása (Budapest ostroma térképpel együtt). (The cartographic approach of the siege of Budapest (1944-45, in Hungarian) In: Magyarok a II. világháborúban. Szakkönyvgyűjtemény. (Hungarians in the 2nd world war, in Hungarian) Budapest, Arcanum, 2004. CD-ROM

23. MIHÁLYI, B.: Budapest légi ellátása. (The air supply of Budapest, in Hungarian) In: Magyarok a II. világháborúban. Szakkönyvgyűjtemény. (Hungarians in the 2nd world war, in Hungarian) Budapest, Arcanum, 2004. CD-ROM

24. MIHÁLYI, B.: Budapest erőd. (Budapest fortress, in Hungarian) In: Magyarok a II. világháborúban. Szakkönyvgyűjtemény. (Hungarians in the 2nd world war, in Hungarian) Budapest, Arcanum, 2004. CD-ROM

25. RAPCSÁK, T.: Some optimization problems in multivariate statistics. Journal of Global Optimization. 28 : 217-228. (2004) 0.559 PUBLICATIONS TO APPEAR *1 BALLA, K. - LINH, V. H.: Adjoint Pairs of Differential-Algebraic Equations and

Hamiltonian Systems. Applied Numerical Mathematics. (in print) *2 BALLA, K. - MÁRTON, S. - RAPCSÁK, T.: Air Pollution Modeling

in Action. In: Proceedings of the NATO ARW on Advances in Air Pollution Modeling for Environmental Security. NATO Science Series IV – Earth and Environmental Sciences. Springer. (in print)

*3 BALOGH, J. - CSENDES, T. – RAPCSÁK, T.: Some global optimization problems on Stiefel manifolds. Journal of Global Optimization. (in print)

*4 BALOGH, J. - CSENDES, T. – RAPCSÁK, T.: Globális optimalizálás Stiefel-sokaságokon - egy érdekes diszkretizálási eredmény. Alkalmazott Matematikai Lapok. (Global optimization on Stiefel manifolds - an interesting discretization result, in Hungarian) (accepted)

*5 CROUZEIX, J.-P. - RAPCSÁK, T.: Integrability of pseudomonotone differentiable maps and the revealed preference problem. Journal of Convex Analysis. (accepted)

*6 EKÁRT, A. - NÉMETH, S.Z.: Stability of tree structured decision functions. European Journal of Operational Research. 160: 676-695 (2005)

*7 FERREIRA, O.P. - NÉMETH, S.Z. - LUCAMBIO PEREZ, L.R.: Singularities of monotone vector fields and an extragradient-type algorithm. Journal of Global Optimization. (in print)

*8 FORGÓ, F. - FÜLÖP, J. - PRILL, M.: Game theoretic models for climate change negotiations. European Journal of Operational Research. 160: 252-267 (2005)

*9 ISAC, G. - NÉMETH, S.Z.: Duality in multivalued complementarity theory by using inversions and scalar derivatives. Journal of Global Optimization. (accepted)

*10 ISAC, G. - NÉMETH, S.Z.: Scalar derivatives, asymptotic scalar derivatives and their applications. Kluwer Academic Publishers, Boston. (accepted book proposal)

*11 KÉRI, G. - ÖSTERGARD, P.R.J.: Bounds for covering codes over large alphabets, Designs, Codes and Cryptography. (in print)

*12 MÉSZÁROS, CS.: On the Cholesky factorization in interior point methods, Computers and Mathematics with Applications. (accepted)

57

*13 MIHÁLYI, B.: A galamboktól a repülőgépekig. Geodézia és Kartográfia. 2004, 12 (in print) (From pigeons to aeroplanes, in Hungarian).

*14 MIHÁLYI, B.: Hermann Göring atlasza. Geodézia és Kartográfia. 2005, 1. (in print) (Hermann Göring’s atlas, in Hungarian).

*15 NÉMETH, S.Z.: Scalar derivatives in Hilbert spaces. Positivity. (accepted) *16 RAPCSÁK, T.: Survey on the Fenchel problem of level sets. In: Variational analysis

and applications. (Eds.: Giannessi, F. - Maugeri, A.) Kluwer Academic Publishers, Boston. (in print)

*17 RAPCSÁK, T.: Local convexity on smooth manifolds. Journal of Optimization Theory and Applications. (accepted)

*18 RAPCSÁK, T.: Fenchel problem of level sets. Journal of Optimization Theory and Applications. (accepted)

RESEARCH GRANTS Project title: Modern mathematical tools for decision support systems Hungarian Scientific Research Fund (OTKA) Supervisor: T. Rapcsák OTKA grant No: T043276 Duration: 2003-06 Project title: Software development for decision making and environmental modelling

based on GIS database Ministry of Education (Oktatási Minisztérium, OMFB) Supervisor: T. Rapcsák OMFB grant No: 00578/2003 Duration: 2002-04 Project title: Modeling of decision in economics Hungarian Scientific Research Fund (OTKA) Supervisor: J. Temesi OTKA grant No: T043241 Duration: 2003-06

58

PARALLEL AND DISTRIBUTED SYSTEMS

LABORATORY RESEARCH PROJECTS P. Kacsuk, G. Dózsa, J. Kovács, Zs. Németh, N. Podhorszki, R. Lovas, Z. Balaton, G. Gombás, G. Hermann, J. Patvarczki, CS. Németh, Z. Farkas (4 months), G. Vida (4 months), T. Boczkó 11 months). Part-time members: A. Marosi, Cs. Kujbus, D. Drótos, N. Purger, (10 months), G. Sipos, Sz. Illés, (6 months), B. Vécsei (6 months), G. Vida ( 4 months), G. Fodor (5 months), Z. Farkas (8 months), (co-operative education: G.- Vida, 8 months).

The activity of the Laboratory in 2004 focused on the following areas:

1. Development of the integrated P-GRADE Grid program environment combining our diverse results. Supporting long-running parallel programs in the ClusterGrid with checkpointing mechanism in P-GRADE.

2. Development of the Portal version of P-GRADE 3. Adaptation of the EGEE Grid infrastructure and its extension with the P-GRADE

Portal and with the Mercury monitoring system. Installation of a server machine with P-GRADE Portal to access the EGEE Grid.

4. Development of the JiniGrid prototype system 5. Specification of a Grid system for SETI-like applications 6. Collaboration in e-science OGSA testbed project (UK) 7. Specification of the collaborative version of the P-GRADE Portal 8. Dissemination and teaching of the Grid technology all over Hungary 9. Participation in international Grid forums

1. Integrated P-GRADE for Grid program development In the previous year we achieved several results related to Grid programming, but those were available in different prototypes only:

• checkpointing in P-GRADE • Integration of P-GRADE with the Condor job management system • Integration of P-GRADE with Globus-2-based Grids • MPICH-G2 code generation within P-GRADE • Prototype of a workflow development system in P-GRADE

This year all the results have been integrated into a stable and robust P-GRADE software that may be used by the whole Hungarian Grid community (P-GRADE version 8.3). The system now supports several different configurations of the available computational hardware from single computers through clusters to general Grid infrastructures: 1. Desktop configuration 2. Dedicated cluster configuration 3. Non-dedicated cluster configuration 4. Condor Grid configuration

59

5. Globus Grid configuration with batch execution mode 6. Globus Grid configuration with interactive, MPICH-G2 execution 7. Thick workflow configuration 8. Thin workflow configuration An installation program has been developed for the easy installation and configuration of the rather complex P-GRADE environment. The installer asks for the available configurations and checks whether they are properly working. Provided that system administrators install the necessary software needed for a given configuration, a user can easily install and configure P-GRADE. The P-GRADE version 8.3 is publicly available with a 30-day trial licence at

http://www.lpds.sztaki.hu/index.php?load=pgrade/registration.php The next task was the extension of P-GRADE with checkpointing mechanism for the Hungarian ClusterGrid infrastructure, which allows saving the state of long running parallel programs in the ClusterGrid (which is active only at nights) and their continuation the following night. 2. Development of the Portal version of P-GRADE A new portal has been developed for making easy access to Grid services of P-GRADE (named P-GRADE Portal) possible. It allows a user by using a web browser to graphically design a workflow, upload it to the portal server, download her Grid certificate to the portal server, execute the workflow in the Grid with the Grid certificate, monitor and visualise the status and progress of the workflow and its components, and to let the portal automatically deliver input and output files to the right places for workflow execution. The P-GRADE Portal makes it possible to create complex workflows and to execute them in the Grid. The portal has been connected to several Grid implementations:

• first generation Grid system: Hungarian ClusterGrid, • second generation Grid: Hungarian SuperGrid, LHC Grid (EGEE, SEE-GRID projects

and HunGrid infrastructure) • third generation Grid: UK OGSA Testbed

P-GRADE Portal is publicly available at http://www.lpds.sztaki.hu/pgportal/ 3. HunGrid Grid infrastructure The largest European Grid project, the EGEE (Enabling Grid for E-sciencE) has currently the largest Grid infrastructure with more than 9000 processors. In contrast to the current infrastructure of the Hungarian ClusterGrid, EGEE is available 24 hours a day and it also includes storage elements to store very large databases and files. Together with the RMKI (Institute for Particle Physics), the EGEE/LCG-2 has been adapted and installed in Hungary, which is a major step in promoting Grid culture in the country. The connection of the 100 processors of RMKI and the 28 processors of the SZTAKI form the current HunGrid infrastructure but it will be extended soon to ELTE, the University of Veszprém, the University of Szeged and the KKKI (Institute of Chemistry). HunGrid is an extension of the EGEE infrastructure. The new elements are the P GRADE Portal and the Mercury monitoring system. HunGrid can be accessed and used conveniently and easily by the portal. Mercury allows the monitoring of the performance of the applications.

60

4. Development of the JiniGrid prototype system To support Java programs and also to explore the possibilities in the service-oriented Grid technology we have been working on the Jini-based JGrid system together with the University of Veszprém. JGrid is based on different technologies other than Grid implementations, therefore, the portal had to be severely redesigned. 5. Specification of a Grid system for SETI-like applications To create a Grid system that can be easily deployed at research and educational institutes and that enables to harvest the idle computational power of the PCs there we have designed a specific Grid system for applications that are similar to the well-known SETI@home project. We have studied this theme and we found that the BOINC system can be deployed for this task. We have tested BOINC in our Laboratory. The next tasks in 2005 will be to create a testbed based on this software. 6. Collaboration with UK e-science OGSA testbed project Besides six British partners, SZTAKI is the only non-British partner involved in UK e-science OGSA testbed project to examine the applicability of the OGSA standard. We explore how the P-GRADE Portal can be integrated with the latest Grid technologies, and this work may bring appreciation to the Hungarian Grid developments within Great Britain, which supports e-science R&D in Europe the most. Another effort was to integrate our portal with the GEMLCA technology of Wesminster University to deploy legacy applications on the Grid without any modification to the existing code. 7. Specification of the collaborative version of the P-GRADE Portal One of the highest potentials in workflow applications is the support for collaborative work where different Virtual Organisations (VO) can dynamically join and share their computational power for the execution of a common large Grid application. This is a brand new subject in this field. We have specified the collaborative version of the P-GRADE Portal where the current editor must be modified for the collaborative editing of an application and its execution on the dynamically organised collection of VOs. 8. The dissemination and teaching of Grid technology in Hungary Our Laboratory works on the wide-spread of Grid technology all over Hungary that, besides the infrastructure developments, includes education. We Grid tutorials held in 2004 at the joint conference of DAPSYS and EuroPVM/MPI in Budapest and at the University of Szeged. We created the program “Proposal for a nation-wide Grid program” together with the partners of the Hungarian Grid Competence Center. 9. Participation in international Grid forums P-GRADE and P-GRADE Portal have been successfully demonstrated at the exhibitions at the International Supercomputer Exhibition in Heidelberg, 22-25. June and at the Supercomputing’04 conference and exhibition in Pittsburgh. Our participation in the EGEE and SEEGRID projects enabled the realisation of the HunGrid infrastructure. We have collaborations in UK e-science OGSA testbed project, as well as, with Reading University. The EU-CoreGrid project is a network of excellence project for research in next generation grids, while the GridCoord project aims at coordinating the research and educational activities of different countries in Europe.

61

PUBLICATIONS

Journals 1. JUHÁSZ, Z. - SIPOS, G.: A Jini technology-based service grid. ERCIM News. (59) : 29-30. (2004) 2. JEFFERY, K. - KACSUK, P.: Grids: the next generation. ERCIM News. (59) : 12-15. (2004) N 3. KACSUK, P. - KISS, T. - GOYENECHE, A. - DELAITRE, T. - FARKAS, Z. -

BOCZKÓ, T.: A high-level grid application environment to grid-enable legacy code. ERCIM News. (59) : 44-45. (2004) N 4. KACSUK, P. - DÓZSA, G. - KOVÁCS, J. - LOVAS, R. - PODHORSZKI, N. -

BALATON, Z. - GOMBÁS, G.: P-GRADE: a grid programing environment. Journal of Grid Computing. 1 (2 ) :171-197. (2003)

Conference papers 5. DÓZSA, G.: High performance application execution scenarios in P-GRADE. In: Recent advances in parallel virtual machine and message passing interface.

11th European PVM/MPI user’s group meeting. Proceedings. Budapest, 2004. (Eds.: D. Kranzlmüller, P. Kacsuk, J. Dongarra.)

Berlin, Springer, 2004. pp. 8. (Lecture notes in computer science 3241.) 0.515 6. GOURGOULIS. A. - TERSTYÁNSZKY, G. - KACSUK, P. - WINTER, S.:

Workflow management in a grid environment. In: MicroCAD 2004. International computer science conference. Miskolc, 2004.

(Eds.: L. Lehoczky, L. Kalmár.) Miskolc, Miskolci Egyetem, 2004. pp. 125-132. N 7. HERMANN, G. - CZIFRUS, Sz.: Case study of the easy parallelization of a Monte-

Carlo simulation program with the P-GRADE development tool. In: MicroCAD 2004. International scientific conference. Miskolc, 2004. (Eds.: L.

Lehoczky, L. Kalmár.) Miskolc, Miskolci Egyetem, 2004. pp. 165-170. 8. KACSUK, P.: P-GRADE. A high-level grid applications development environment. In.: DCABES 2004. International symposium on distributed computing and

applications to business, engineering and science. Proceedings. Wuhan, 2004. Vol. 1. (Ed.: G. Quingping.)

Wuhan, Hubei Science and Technology Pr., 2004. pp.. 1-6. 9. KACSUK, P. - GOYENECHE, A. - DELAITRE, T. - KISS, T. - FARKAS, Z. -

BOCZKÓ, T.: High-level grid application environment to use legacy codes as OGSA grid services.

In: Fifth IEEE/ACM international workshop on grid computing. Pittsburgh, 2004. (Ed.: R. Buyya.)

Los Alamitos, IEEE, 2004. pp. 428-435. N

62

10. KACSUK, P. - KÓNYA, B. - STEFÁN, P.: Production Grid systems and their programming.

In: Recent advances in parallel virtual machine and message passing interface. 11th European PVM/MPI user’s group meeting. Proceedings. Budapest, 2004. (Eds.: D. Kranzlmüller, P. Kacsuk, J. Dongarra.)

Berlin, Springer, 2004. pp. 13. (Lecture notes in computer science 3241.) 0.515 11. KOVÁCS, J. - KACSUK, P.: A migration framework for executing parallel programs

in the grid. In: Grid computing. Second european acrossGrids conference. AxGrids 2004,

Cyprus, 2004. (Ed.: M. D. Dikaiakos.) Berlin, Springer, 2004. pp. 80-89. (Lecture notes in computer science 3165.) 0.515

12. KOVÁCS, J. - KACSUK, P.: Improving fault-tolerant execution for parallel applications under condor.

In: MicroCAD 2004. International scientific conference. Miskolc, 2004. (Eds.: L. Lehoczky, L. Kalmár.)

Miskolc, Miskolci Egyetem, 2004. 251-256. 13. LOVAS, R. - KACSUK, P. - LAGZI, I. - TURÁNYI, T.: Unified development

solution for cluster and grid computing and its application in chemistry. In: Computational science and its applications - ICCSA 2004. International

conference. Proceedings. Assisi, 2004. Part II (Eds.: A. Lagana et al.) Berlin, Springer, 2004. pp. 226-235. (Lecture notes in computer science 3044.) 0.515 14. LOVAS, R. - DÓZSA, G. - KACSUK, P. - PODHORSZKI, N. - DRÓTOS, D.:

Workflow support for complex grid applications. Integrated and portal solutions. In: Grid computing. Second european acrossGrids conference. AxGrids 2004,

Cyprus, 2004. (Ed.: M. D. Dikaiakos.) Berlin, Springer, 2004. pp. 129-138. (Lecture notes in computer science 3165.) 0.515 15. NÉMETH, Cs. - DÓZSA, G. - LOVAS, R. - KACSUK, P: The P-GRADE grid portal. In: Computational science and its applications - ICCSA 2004. International

conference. Proceedings.Assisi, 2004. Part II (Eds.: A. Lagana et al.) Berlin, Springer, 2004. pp. 10-19. (Lecture notes in computer science 3044.) 0.515 16. NÉMETH, Zs.: Grid performance, grid benchmarks, grid metrics. In: 3rd Cracow grid workshop. Cracow, 2003. Cracow, 2003. pp. 34-41. 17. NÉMETH, Zs. - GOMBÁS, G. - BALATON, Z.: Performance evaluation on grids:

Directions, issues, and open problems. In: Proceedings of the 12 th Euromicro conference on parallel, distributed and

network-based processing. A Coruna, 2004. Los Alamitos, IEEE, 2004. pp. 290-297. 18. PATVARCZKI, J. - DÓZSA, G. - KACSUK, P.: The Hungarian Supercomputing

Grid in the actual practice. In: MIPRO 2004. 27th international convention. Proceedings. Opatija, 2004. (Eds.:

Biljanovic, P., Skala, K.) Rijeka, MIPRO, 2004. pp. 203-207.

63

19. PATVARCZKI J.: A Magyar Szuperszámitógép Grid tapasztalatainak bemutatása. In: Networkshop 2004. Győr, 2004. Győr, Szécshenyi István Egyetem, 2004. pp. 1-8. (CD) http://nws.iif.hu/ncd2004/docs/0nj/nj102.htm 20. PATVARCZKI, J.: Practical study of the hungarian supercomputing Grid. In: MicroCAD 2004. International scientific conference. Miskolc, 2004. (Eds.: L.

Lehoczky, L. Kalmár.) Miskolc, Miskolci Egyetem, 2004. pp. 359-364. 21. PODHORSZKI, N. - BALATON, Z. - GOMBÁS, G.: Monitoring message-passing

parallel applications in the grid with GRM and Mercury monitor. In: Grid computing. Second european acrossGrids conference. AxGrids 2004,

Cyprus, 2004. (Ed.: M. D. Dikaiakos.) Berlin, Springer, 2004. pp. 179-181. (Lecture notes in computer science 3165.) 0.515 22. SIPOS, G. - KACSUK, P.: Connecting condor pools into computational grids by Jini. In: Grid computing. Second European acrossGrids conference. AxGrids 2004,

Cyprus, 2004. (Ed.: M. D. Dikaiakos.) Berlin, Springer, 2004. pp. 110-113. (Lecture notes in computer science 3165.) 0.515 23. SIPOS, G. - KACSUK, P.: The PROVE trace visualisation tool as a grid service. In: Computational science and its applications - ICCSA 2004. International

conference. Proceedings. Assisi, 2004. Part II (Eds.: A. Lagana et al.) Berlin, Springer, 2004. pp. 37-45. (Lecture notes in computer science 3044.) 0.515 24. SIPOS, G. - KACSUK, P.: Using Jini to connect condor pools into a computational

grid. In: MIPRO 2004. 27th international convention. Proceedings. Opatija,. 2004. (Eds.:

P. Biljanovic, K. Skala.) Rijeka, MIPRO, 2004. pp. 197-202. 25. VÉCSEI, B. - LOVAS, R.: Debugging method for parallel programs based on Petri-

net representation. In: MicroCAD 2004. International scientific conference. Miskolc, 2004. (Eds.: L.

Lehoczky, L. Kalmár.) Miskolc, Miskolci Egyetem, 2004. pp. 413-420. 26. VIDA, G.: Mapping algorithms for parallel programming. In: MicroCAD 2004. International scientific conference. Miskolc, 2004. (Eds.: L.

Lehoczky, L.Kalmár.) Miskolc, Miskolci Egyetem, 2004. pp. 421-426. Research reports 27. GERNDT, M. - WISMÜLLER, R. - BALATON, Z. - GOMBÁS, G. - KACSUK, P. -

NÉMETH, Zs. - PODHORSZKI, N. - TRUONG, H. L. - FAHRINGER, T. - BUBAK, M. - LAURE, E. - MARGALEF, T.: Performance tools for the Grid. State of the art and future. (Ed.: Gerndt, M.)

Aachen, Shaker, 2004. 36 p. (Research report series 30.) N

64

Editorial works 28. KRANZLMÜLLER, D. - KACSUK, P. - DONGARRA, J. (eds.): Recent advances in

parallel virtual machine and message passing interface. 11th European PVM/MPI user’s group meeting. Proceedings. Berlin, Springer, 2004. 453 p. (Lecture notes in computer science 3241.)

RESEARCH GRANTS Project title: DataGrid – Research and Technological Development for an International

Data Grid Comission of the European Communities, FRAMEWORK V Project

Supervisor in Hungary: P. Kacsuk Grant No.: IST-2000-25182 Duration: 2001-2004 (March)

Project title: Automatic Performance Analysis: Real Tools (APART-2) Supervisor in Hungary: P. Kacsuk

Grant No.: IST-2000-28077 Duration: 2001-2004

Project title: GridLab - A Grid Application Toolkit and Testbed Supervisor in Hungary: P. Kacsuk

Grant No.: ST-2001-32133 Duration: 2002-2005

Project title: Enabling Grids for E-Science in Europe (EGEE) Supervisor in Hungary: P. Kacsuk

Grant No.: 508833 Duration: 2004-2006

Project title: South Eastern European GRid-enabled eInfrastructure Development –

SEE-GRID Supervisor in Hungary: P. Kacsuk


Project title: Core-Grid Supervisor in Hungary: P. Kacsuk


Project title: GRIDCOORD Supervisor in Hungary: P. Kacsuk


65

Project title: Grid Performance Analysis Supervisor: P. Kacsuk

Grant No.: OMFB-00646/2003 Duration: 2003-2004

Project title: Execution Environment Based on Jini Supervisor: P. Kacsuk


Project title: Chemistry GRID and its Application for Air Pollution Forecast Supervisor: P. Kacsuk


Project title: Development of Hungarian Grid System Supervisor: P. Kacsuk

Grant No.: 4671/1/2003 Duration: 2003-2005

Project title: Hungarian SuperCluster Project Supervisor: (G. Dózsa), P. Stefán


Project title: Performance analysis and optimisation of grid applications

Hungarian National Science Foundation (OTKA) Supervisor: P. Kacsuk

Grant No.: T 042459 Duration: 2003-2005

66

SYSTEMS AND CONTROL LABORATORY

RESEARCH PROJECTS (T. Bartha, Cs. Bányász, J. Bokor, A. Edelmayer, Z. Fazekas, P. Gáspár, L. Keviczky, B. Kulcsár, S. Molnár, L. Nádai, C. C. Obi, L. Palkovics, T. Péni, G. Rödönyi, F. Schipp, A. Soumelidis, Z. Szabó, I. Szászi, I. Varga) CONTROL THEORY Combined identification and control (Cs. Bányász, J. Bokor, P. Gáspár, L. Keviczky, L. Palkovics, Z. Szabó)

The usually followed R, S, T forms, generally applied in MPC algorithms, can be easily used for parameter estimation and the direct formulation of self-tuning regulators. However, the detailed comparison of the pole-placement and predictor-based controllers showed that the d-step ahead predictors "quasi-linear" in the parameters are very redundant considering the unknown parameters. The polynomials strongly depend on the design and optimization parameters. Therefore, a new structure was constructed to help the direct identification of the plant (to avoid the redundant over-parametrization) under the constraint of a special pole-placement controller in the framework of the GTDOF scheme. This new topology clearly shows the special part of the controller, which depends on our design goals only (for IS processes) and also on the invariant process factor (for IU processes). This method can be interpreted as a direct reformulation of the classical adaptive MPC providing minimal number of parameters to be estimated in a GTDOF control design problem [23], [22]. Robust control (J. Bokor, Cs. Bányász, P. Gáspár, L. Keviczky)

For LTI dynamic open-loop stable time-delay processes the robust stability condition was investigated for such cases, when the model uncertainty is caused by the time-delay mismatch only. New necessary and sufficient conditions were introduced in the form of simple analitic inequalities. It was also investigated, how these conditions depend on the performance design requirements [14], [13].

It is a well known methodology to use the state variable representations (SVR) of LTI dynamic SISO systems. The SVR proved to be excellent tool to implement both LQG control and pole placement design. The practical applicability required to introduce the observers, which make this methodology widely applied even for large scale and higher dimension plants. It was shown that this classical methodology is good for the stabilization of unstable LTI processes, however the reachable closed-loop performance is limited by the numerator of the process. If a high performance controller design is required, then a more sophisticated, two step procedure must be used [15] (This paper received the “Best Paper Award” on the XV Int. Conference on Systems Science in Wroclaw).

67

Nonlinear control (Cs. Bányász, L. Keviczky)

Horowitz stated that all TDOF control systems are equal. In our former works it was found that special versions of these systems have definite advantages to others and help to understand the operation of the whole control process. This, so-called GTDOF, topology was one of these advantageous forms and several interesting results have been reached to help control engineers in their practice. In our recent paper [21] a very simple and "clever" version of the GTDOF structure was introduced first, where the controller shows two parts. The first depends on the design parameters, the invariant process factors and their optimal attenuation. The second depends only on the model of the plant. This controller topology was then extended for nonlinear plants having factorable process models. For special factorable nonlinear processes it was possible to eliminate the nonlinearity from the closed loop exactly. An iterative controller refinement scheme was also formulated, which can be used for off-line iterative combined identification and control solution tuning the nonlinear controller [16], [12]. FAULT DETECTION IN DYNAMIC SYSTEMS Fault tolerant and reconfigurable control (A. Edelmayer, J. Bokor, T. Bartha, I. Szászi, Z. Szabó)

The themes of research are reliability, availability and safety of technical processes and their control systems. These themes are closely related to both the process and its control systems and they are addressed during design, start-up, operation, maintenance and repair. In a recent paper [4] the classical detection filter design problem is considered as an input reconstruction problem that is viewed as a dynamic inversion problem. This approach is based on the existence of the left inverse and arrives at detector architectures whose outputs are the fault signals while the inputs are the measured system inputs and outputs and possibly their derivatives. A view of the inversion-based input reconstruction with special emphasis on the aspects of fault detection and isolation by using invariant subspaces and the results of classical geometrical systems theory is provided. The applicability of the idea to fault reconstruction is demonstrated through examples. Advanced signal and image processing methods (J. Bokor, Z. Fazekas, F. Schipp, A. Soumelidis)

The group’s traditional research interest and research activity in the field of signal and systems theory has been not just retained, but also somewhat extended. It now includes the processing of visual data. Primarily, the mathematical modelling techniques of the group’s traditional research field are used for this purpose. This new direction was inspired by the needs of diverse application areas ranging from the control of smart vehicles to biomedical visual measurements.

68

The main activities that were characteristic in this year are as follow: • Continuing research in the field of signals and systems theory, and processing

methods based upon rational orthogonal bases, product bases, and Blaschke-type wavelet constructions [6], [7], [8], [*11].

• Image processing methods for detection objects (e.g., obstacles, lane markings, pedestrians, vehicles on a road) in the 3D space.

• Representation techniques of smooth, sphere- or ellipsoid-like surfaces. This area has been motivated by the field of ophthalmology, where the Zernike-type representations have become popular in describing the optical properties and aberrations of the eye. Research on efficient algorithms for computing such representations, as well as, constructing and computing other representations that are optimal in some predefined sense was carried out during the report period. For example, Chebishev-type representations and their modifications were studied and applied to corneal surface description [*12].

• Research on visual measurements of reflective 3D surfaces was also motivated by diagnostical needs of ophthalmologists. The group started looking into the differential-geometrical modelling methods of such surfaces, and into the surface-reconstruction algorithms. Related image and signal processing methods were also studied and developed to overcome the deficiencies of known measurement methods.

The results achieved these research activities will be utilized in the R&D projects that has been initiated in this year. LTV, LPV and bilinear systems (J. Bokor, A. Edelmayer, Z. Szabó, P. Gáspár)

In the approach of the problems of nonlinear control systems, the special representation of nonlinearities in form of LPV formulations has gained increasing attention in the past years. Research results achieved in the theory of LPV systems related to system concepts, invertability questions and their applications to the solution of the tracking problems were published in the papers [3], [11], [19]. Linear Hybrid Systems

(J. Bokor, G. Stikkel, Z. Szabó, P. Gáspár)

In the past years the theory and design of linear hybrid systems have gained increasing importance. Reconfigurable control systems, more precisely, switching between different controllers generates a lot of theoretical and practical questions related to stability, performance and implementation. Research results concerning controllability issues were published in [9].

69

APPLICATIONS INTEGRATED CONTROL SYSTEM FOR ROAD VEHICLE Intelligent and Autonomous Vehicle Systems (J. Bokor, L. Palkovics, P. Gáspár, T. Bartha, A. Soumelidis, I. Varga) An integrated control mechanism is proposed, creating balance between different active components in order to increase the performance behavior and safety of vehicles. The control mechanism includes an active suspension, active anti-roll bars, and an active brake. The role of the active suspension system is to improve passenger comfort and guarantee the suspension working space. The role of the active anti-roll bars is to generate a stabilizing moment in order to balance the overturning moments generated during maneuvers. By using the brake system the rollover prevention may be guaranteed, since it reduces directly the lateral tire forces and decelerates the vehicle. In the integrated control mechanism the model for control design is constructed in a Linear Parameter Varying (LPV) structure. The control design is based on parameter dependent Lyapunov functions (PDLF). In the control design the performance specifications both for rollover and suspension problems, the model uncertainties and the fault information of the FDI filter are also taken into consideration. For more details, see [5], [20], [19]. Commercial Vehicle Fleet Management System (J. Bokor, L. Palkovics, P. Gáspár, A. Soumelidis, G. Szederkényi, T. Péni, G. Rödönyi) The main objectives of the project are to elaborate the theory and methods of intelligent supervision, control and communication systems installed on vehicles, and an associated information service system for fleet management, and to elaborate prototype systems with the information system for fleet management. The development of the information service as part of the fleet management system that collects, analyses and evaluates databases sent by the individual vehicles extends the utility of the installed vehicle systems and represent a significant added value to its application. This system integrates the capabilities of recent mobile telecommunication, the sensory and data measurement systems on the vehicle into a unified framework and has the feature to maintain a permanent communication among the data acquisition and control modules allocated on the vehicles of transportation companies. It can also supervise and control the transportation processes, assist the driver in decision making, support the coordination of transport activities and it provides with an information database for all participants possessing the particular unit on the vehicle.

Research in this area was directed towards the cooperative control of autonomous vehicles. The aim was to construct a distributed hierarchical control framework and inter-vehicle communication topology for a fleet of highly automated road vehicles to be able to perform complex maneuvering tasks, such as trajectory tracking, safe navigation among obstacles and motion in different prescribed formations. As a solution a two-level hierarchical control structure was proposed where the local vehicle controllers, which depend on the particular vehicle dynamics, constitute the low level subsystem. On the high level the distributed cooperative control methods take place, which are constructed according to the prescribed task, and are independent from the vehicle they operate on. In the control structure we elaborated the dynamic inversion based trajectory tracking controller is used as a low-level controller and a passivity based distributed control algorithm is proposed as a high-level

70

control component. In parallel with the theoretical research above a development of an in-door model platform was started for testing and demonstrating the different cooperative control strategies. This platform consists of three radio controlled vehicle models equipped with powerful embedded onboard computer, sensors, digital camera and a wireless communication interface. The platform is able to realize centralized and fully decentralized control algorithms and it meets hard real-time requirements [27], [28], [*8]. Realization of digital control systems: implementations in intelligent unmanned vehicles (J. Bokor, A. Edelmayer, P. Gáspár, B. Kulcsár, C. C. Obi, G. Rödönyi, A. Soumelidis) The application of embedded computers and operational systems in sensing, measurement, data acquisition, control, and detection entered in the implementation phase in association with problems arising in the field of unmanned intelligent vehicles. Unmanned vehicle models – cars, as well as planes – have been built, and several control system elements have been developed incorporating both embedded board computers and “land” control stations communicating by applying wireless digital schemes. The spectrum of the embedded platforms applied (and planned to apply) is spread from microcontrollers, through digital signal processors, to high complexity embedded computers applying embedded operational systems; CAN and Ethernet network, as well as wireless LAN, and Bluetooth are applied for communication. The board electronics is complemented with several sensors including GPS, inertial and operational state sensors, as well as video cameras, optionally. A single vehicle model serves as an experimental base for investigating positioning, navigation, tracking, maneuvering, and stabilization problems; furthermore, a group of the vehicle models may be applied in cooperative control experiments. The experimental set including unmanned vehicle models, measurement, control, and communication elements is developed and expanded continuously according to the requirements arising from several research activities of the Laboratory, e.g., control theory, signal processing, fault detection, etc. [11], [24], [27], [28], [30], [29], [*8], [*9], [*10].

I&C refurbishment project (T. Bartha, J. Bokor, A. Soumelidis, I. Varga) In the past few years the lifetime extension of units has been started at Paks Nuclear Power Plant. As a part of the preparatory work related to this process, our Laboratory has made a large-scale literature overview on the national and international standards, as well as suggested and implemented examples. Based on the results of the overview, a proposal for the new NPP I&C systems’ informatics architecture and network topology has been made.

Status and actual risk monitoring in a NPP Reactor Protection System (RPS) (T. Bartha, J. Bokor, A. Edelmayer, I. Varga) One of the advantages of using computerized IC systems in Paks Nuclear Power Plant is the possibility for continuous monitoring of the plants’ state. In the case of safety-critical subsystems (such as the Reactor Protection System, RPS) one of the most important measures of quality is the reliability of the systems. When designing systems like this, the realization and maintenance of safety parameters is essential, therefore, these parameters have been numerically expressed. Processing the status information of about the components of the RPS

71

and integrating it in a fault-tree reliability model, a model that follows the system’s actual state may be obtained. By evaluating the model, the degree of the system’s degradation can be numerically determined. This degradation indicator gives important information about the impact of the occurred errors on the further operability of the whole system.

Our Laboratory developed a concept and a prototype implementation for a risk monitoring solution in NPP protection system. The solution comprises two main functions: the Status Monitoring System and the Risk Monitoring System. Our further work is directed towards the possible improvements to enhance system performance and shorten the response time [10], [32], [*1], [*13].

PUBLICATIONS Books 1. BARTHA T. - CSERTÁN Gy. - GYAPAY Sz. - MAJZIK I. - PATARICZA A. – VARRÓ

D.: Formális módszerek az informatikában. (Szerk.: Pataricza, A.) Budapest, Typotex, 2004. 312 p.

2. HANGOS, K. M. - BOKOR, J. - SZEDERKÉNYI, G.: Analysis and control of nonlinear process systems. London, Springer, 2004. 308 p.

Journals 3. BOKOR, J. - BALAS, G.: Detection filter design for LPV systems - a geometric

approach. Automatica. 40 : 511-518. (2004) N 1.683

4. EDELMAYER, A. - BOKOR, J. - SZABÓ, Z.- SZIGETI, F.: Input reconstruction by means of system inversion: a geometric approach to fault detection and isolation in nonlinear systems. International Journal of Applied Mathematics and Computer Science. 14 (2) : 189-199. (2004)

5. GÁSPÁR, P. - SZÁSZI, I. - BOKOR, J.: The design of a combined control structure to prevent the rollover of heavy vehicles. European Journal of Control. 10 : 148-162. (2004) 0.829

6. PAP, M. - SCHIPP, F. Discrete approximation on the sphere. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica. 22 : 299-315. (2003)

7. SCHIPP, F. - PAP, M.: Interpolation by rational functions. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica. 24 : 223-237. (2004)

8. SCHIPP, F.: On orthonormal product systems. Acta Mathematica Academiae Peadagogicae Nyíregyháziensis. 20 : 185-206. (2004)

9. STIKKEL, G. - BOKOR, J. - SZABÓ, Z.: Necessary and sufficient condition for the controllability of switching linear hybrid systems. Automatica. 40 : 1093-1097. (2004) 1.683

72

10. VARGA, I. - BARTHA T. - SOUMELIDIS, A.: On-line testing of the reactor protection system in the Paks nuclear power plant. ERCIM News. 56 : 33-34. (2004)

Conference papers 11. BALAS, G. - BOKOR, J. - SZABÓ, Z.: Tracking of continuous LPV systems using

dynamic inversion. In: 43rd IEEE conference on decision and control. Paradise Island, Bahamas, 2004. Piscataway, IEEE, 2004. pp. 2929-2933. (CD) N

12. BÁNYÁSZ, Cs. - KEVICZKY, L.: An iterative nonlinear controller refinement scheme. In: 6th IFAC symposium on nonlinear control systems. NOLCOS'04. Preprint. Stuttgart, 2004. Vol. 1. (Ed.: F. Allgöwer.) Stuttgart, IFAC, 2004. pp. 173-178.

13. BÁNYÁSZ, Cs. - KEVICZKY, L.: On selection of time-delay in adaptive regulators. In: IFAC workshop on adaptation and learning in control and signal processing. (ALCOSP'04). Yokohama, 2004. Yokohama, 2004. pp. 853-857. (CD)

14. BÁNYÁSZ, Cs. - KEVICZKY, L.: Robust stability limit of time-delay systems. In: Proceedings of the 2004 American control conference. Boston, 2004. Boston, AACC, 2004. pp. 5428-5432.

15. BÁNYÁSZ, Cs. - KEVICZKY, L.: State-feedback solutions via transfer function representations. In: Proceedings of the 15th international conference on systems science. Wroclaw, 2004. Vol. 1. (Eds.: Z. Bubnicki, A. Grzech.) Wroclaw, Oficyna Wydawnicza Politechniki Wroclawskiej, 2004. pp. 218-229.

16. BÁNYÁSZ, Cs. - KEVICZKY, L.: Structural considerations for two-degree of freedom nonlinear control systems. In: 12th Mediterranean conference on control and automation. MED 2004. Kusadasi, 2004. Kusadasi, IEEE, 2004. pp. 1-6. (CD)

17. GÁSPÁR, P. - SZÁSZI, I. - BOKOR, J.: Active suspension design using LPV control. In: IFAC symposium on advances in automotive control. Proceedings. Preprints. Salerno, 2004. Salerno, IFAC, 2004. pp. 1-6. (CD)

18. GÁSPÁR, P. - SZABÓ, Z. - BOKOR, J.: Identification of vehicle models and road roughness estimation. In: 5th IFAC/EURON symposium on intelligent autonomous vehicles. Lisboa, 2004. Lisboa, 2004. pp. 1-6. (CD)

19. GÁSPÁR, P. - SZÁSZI, I. - BOKOR, J.: Improving rollover stability with active suspensions by using an LPV method. In: 5th IFAC/EURON symposium on intelligent autonomous vehicles. Lisboa, 2004. Lisboa, 2004. pp. 1-6. (CD)

73

20. GÁSPÁR, P. - SZÁSZI, I. - BOKOR, J.: Rollover stability control for heavy vehicles by using LPV model. In: IFAC symposium on advances in automotive control. Proceedings. Preprints. Salerno, Italy, 2004. Salerno, IFAC, 2004. pp. 1-6. (CD)

21. KEVICZKY, L. - BÁNYÁSZ, Cs.: Combined modeling and control using a GTDOF scheme. In: Proceedings of the international conference on modeling, simulation and visualization methods. MSV'04. Las Vegas, 2004. (Eds.: H. R. Hrabnik, R. Joshua.) Proceedings of the international conference on algorithmic mathematics. AMCS’04. Las Vegas, 2004. (Eds.: H. R. Hrabnik et al.) Las Vegas, CSREA Press, 2004. pp.214-220.

22. KEVICZKY, L. - BÁNYÁSZ, Cs.: New structural considerations for model predictive and iterative control. In: Proceedings of the 15th international conference on systems science. Wroclaw, 2004. Vol. 1. (Eds.: Z. Bubnicki, A. Grzech.) Wroclaw, Oficyna Wydawnicza Politechniki Wroclawskiej, 2004. pp. 129-140.

23. KEVICZKY, L. - BÁNYÁSZ, Cs.: Optimal structure for model predictive control. In: IFAC workshop on adaptation and learning in control and signal processing. (ALCOSP'04). Yokohama, 2004. Yokohama, 2004. pp. 621-626. (CD)

24. KULCSÁR, B. - BOKOR, J.: Robust LPV detection filter design using geometric approach. In: 12th Mediterranean conference on control and automation. MED 2004. Kusadasi, 2004. Kusadasi, IEEE, 2004. pp. 1-5. (CD)

25. NÁDAI, L. - KÓCZY, L. T. - VÁRLAKI P.: Optimal sampling in single photon counting using fuzzy logic. In: World automation congress of the fifth international symposium on soft computing for industry. Seville, 2004. Sevilla, 2004. pp. 1-6. (CD)

26. NÁDAI, L.- KÓCZY, L. T. - VÁRLAKI, P.: Optimizing sampling time in single photon counting experiments. In: World automation congress of the fifth international symposium on soft computing for industry. Seville, 2004. Seville, IEEE, 2004. pp. 1-6. (CD)

27. PÉNI, T. - BOKOR J.: Trajectory tracking control for a class of LPV systems based on dynamic inversion and passivity. In: Proccedings of the WSEAS/IASME conferenses. Corfu, 2004. Corfu, 2004. pp. 1-9. (CD)

28. PÉNI, T. - SZEDERKÉNYI, G. - BOKOR, J. - HANGOS, K.M.: Dynamic invrsion based velocity tracking control of road vehicles. In: 6th IFAC symposium on nonlinear control systems. NOLCOS'04. Preprint. Stuttgart, 2004. Vol. 3. (Ed:: F. Allgöwer.) Stuttgart, IFAC, 2004. pp. 1199-1204.

29. RÖDÖNYI, G. - BOKOR, J.: Identification of LPV steering models of a truck. In: 5th international PhD workshop on systems and control: a young generation viewpoint. Balatonfüred, 2004. Balatonfüred, 2004. pp. 1-6. (CD)

74

30. RÖDÖNYI, G. - BOKOR, J. Identification of LPV vehicle models for steering control involving asymmetric front wheel braking. In: 6th IFAC symposium on nonlinear control systems. NOLCOS'04. Preprint. Stuttgart, 2004. Vol. 2. (Ed.: F. Allgöwer.) Stuttgart, IFAC, 2004. pp. 663-668.

31. VARGA, I. - KULCSÁR, B. - BOKOR, J.: General moving horizon estimation of traffic systems. In: 12th Mediterranean conference on control and automation. MED 2004. Kusadasi, 2004. Kusadasi, IEEE, 2004. pp. 1-5. (CD)

32. VARGA, I. - BARTHA T. - SZABÓ, G. - KISS, B.: Status and actual risk monitoring in a NPP reactor protection system. In: Probabilistic safety assesment and management. PSAM7 - ESREL’04. Berlin, 2004. Vol. 5. (Eds.: C. Spitzer, U. Schmocker, V. N. Dang.) Berlin, Springer, 2004. pp. 2654-2659.

33. VÁRLAKI P. - NÁDAI, L. - BULLA, M. - SZAKÁL, A.: A new stochastic framework for modelling optical communication systems. In: WSEAS conferences ASCOMS, TELEINFO, AEE, MCP and ICAP 2004. Proceedings. Cancun, 2004. (Eds.: D. Iracleous, N. Mastorakis, A. Zemliak.) Cancun, WSEAS, 2004. pp. 1-4.(CD)

Research reports 34. KULCSÁR, B.: Report on receding horizon state estimation tools (RHET) under

MATLAB. Budapest, MTA SZTAKI, 2004. 23 p. (Technical report SCL-006/2004.)

PhD dissertation

SZÁSZI, I.: Design of fault detection and isolation filters for reconfigurable control systems. PhD. Budapest, BME, 2003. 128 p.

Submitted and accepted 1* BARTHA, T. - VARGA, I. – SOUMELIDIS, A. - SZABO, G.: Implementation of a

testing and diagnostic concept for an NPP reactor protection system. 5th European Dependable Computing Conference. EDCC-5. (accepted)

2* PALKOVICS, L.: Identification and control problems in vehicle system design In: ERNSI International Workshop, System Identification. Dobogókő, Hungary. October 4-6, 2004.

3* GASPAR, P., - SZABO, Z. - BOKOR, J.: Brake control combined with prediction to prevent the rollover of heavy vehicles. IFAC World Congress. Praha. 2005. (accepted)

75

4* GASPAR, P., - SZASZI, I. - BOKOR, J.: Reconfigurable control structure to prevent the rollover of heavy vehicles. Control Engineering Practice. 13 : 699-711. (2005)

5* KULCSÁR, B. - BOKOR, J.: Robust fault detection filter design method for LPV systems. 9th MINI Conference on vehicle system dynamics, identification and anomalies VSDIA 2004. Budapest, Hungary, 2004. November (in press)

6* KULCSÁR B.- VARGA I. - BOKOR J.: Modern közúti forgalomirányítás I. A forgalmi paraméterek becslése. Városi közlekedés. (in press)

7* KULCSÁR B. - BÉCSI, T. – VARGA, I.: Estimation of dynamic origin destination matrix of traffic systems. Periodica Polytechnica, series in Transport, 2004. (in press).

8* PÉNI, T. – BOKOR, J.: Formation stabilization of nonlinear vehicles based on dynamic inversion and passivity. IFAC World Congress 2005 (accepted)

9* RÖDÖNYI, G. - BOKOR, J.: Identification of an LPV vehicle model based on experimental data for brake-steering control. 16th IFAC World Congress. Prague, Czech Republic. 2005 (accepted)

10* RÖDÖNYI, G. - BOKOR, J. - PALKOVICS, L.: Identification of a heavy-truck dynamics. In: ERNSI Workshop. Dobogókő, Hungary. October 4-6, 2004.

11* SCHIPP, F. - PAP, M.: Malmquist-Takenaka systems over the set of quaternions. Pure Mathematics and Applications. (to appear)

12* SOUMELIDIS, A. - FAZEKAS, Z. - SCHIPP, F. - NÉMETH, J.: Surface description for cornea topography using modified Chebyshev-polynomials. 16th IFAC World Congress. Prague, July 4-8. 2005. (accepted)

13* SZABÓ, G. - VARGA, I. - BARTHA, T.: Állapotmonitorozási és megbízhatósági információk integrálása erőművi informatikai rendszerekben.

Acta Agraria Kaposváriensis (2004) Vol 8 No 3, 1-19, University of Kaposvár (in print)

14* VARGA, I. - KULCSÁR, B. - BOKOR, J.: Traffic light control using moving horizon estimation. 9th MINI Conference on vehicle system dynamics, identification and anomalies. VSDIA-2004. Budapest, Hungary 8-10 November, 2004.(in press)

15* VARGA, I. - KULCSÁR, B. - BOKOR, J.: Simulation of turning rates in traffic systems. In: 16th European simulation symposium. ESS-2004. Budapest, Hungary, October 17-20, 2004.

RESEARCH GRANTS Project title: Modeling and reconfigurable control of linear parameter varying systems Hungarian National Science Foundation (OTKA) Supervisor: J. Bokor OTKA grant No.: T 043111 Duration: 2003–2005 Project title: Investigation of the theoretically reachable best control algorithms Hungarian National Science Foundation (OTKA) Supervisor: L. Keviczky OTKA grant No.: T 046220 Duration: 2004–2007

76

PROCESS CONTROL RESEARCH GROUP

K. M. Hangos, A. Magyar, E. Németh, B. Pongrácz, G. Szederkényi (group members) P. Ailer, I. T. Cameron, G. D. Ingram, R. Lakner, A. Leitold, H. Németh, T. Péni, Sz. Rozgonyi, T. Schné, Zs. Tuza (external group members) Dynamic process models are derived from the 1st law of thermodynamics constrained by equalities and optimality-type inequalities derived from the 2nd law. With this understanding, it is possible to use process knowledge to determine the dynamic system properties of process systems and to design better controllers therefrom. Our recent book, published this year [A], summarizes the results in the field of analysis and control of nonlinear process systems. Computer-Aided Process Modelling The notion of minimal process models, with respect to a size index satisfying the same modelling goal, has been introduced as an extension of minimal state-space models [9*].

The integrating frameworks of the multi-scale modelling of complex process systems have been investigated [4]. A novel diagnostic goal-driven modelling approach has been proposed and an intelligent diagnostic system based thereon is reported in [11*], [10] and [18].

Analysis and control of nonlinear process systems We have examined the possibilities of describing quasi-polynomial and Lotka-Volterra models in generalized dissipative form. It was shown that Lotka-Volterra system is globally stable with a formerly known entropy-like Lyapunov function candidate if and only if there exists a local dissipative-Hamiltonian description of the system in the neighbourhood of the equilibrium point with a quadratic Hamiltonian function [6].

The quasi-polynomial representation of process models and its use in stability analysis has been investigated. We have developed a method for the estimation of guaranteed quadratic stability neighborhood using linear matrix inequalities. The application of the method has been illustrated by simple process model examples [8].

It has been shown that an important type of time-reparametrization problem in quasi-polynomial systems is equivalent to the feasibility of a suitably constructed bilinear matrix inequality where the unknowns are the coefficients of the Lyapunov function and the exponents in the time-reparametrization transformation [8*].

Analysis and control of nonlinear mechanical-process systems

Based on a previously developed simple dynamic model of a low-power gas-turbine, LPV analysis and controller design for the turbine are reported in [14] and [13].

A model-based feed-forward controller has been designed for a single protection valve for pneumatic brake systems [5], [11]. A systematic model simplification procedure has been developed and applied to the protection valve in [10*].

77

PUBLICATIONS Book 1. HANGOS, K. M. - BOKOR, J. - SZEDERKÉNYI, G.: Analysis and control of

nonlinear process systems. London, Springer, 2004. 308 p.

Journals 2. HANGOS, K. M. - SZEDERKÉNYI, G. - TUZA, Zs.: The effect of model

simplification assumptions on the differential index of lumped process models. Computers and Chemical Engineering. 28 : 129-137. (2004) 1.251

3. HANGOS, K. M. - SZEDERKÉNYI, G.: Process systems: theory and applications from different aspects. ERCIM News. 56 : 35-36. (2004)

4. INGRAM, G. D. - CAMERON, I. T. - HANGOS, K. M.: Classification and analysis of integrating frameworks in multiscale modelling. Chemical Engineering Science. 59 : 2171-2187. (2004) N 1.562

5. NÉMETH, H. - PALKOVICS, L. - HANGOS, K. M.: Feedforward bang-bang control design for electro-pneumatic protection valves. Periodica Polytechnica. Series of Transportation Engineering. 32 (1-2) : 3-20. (2004)

6. SZEDERKÉNYI, G. - HANGOS, K. M.: Global stability and quadratic Hamiltonian structure in Lotka-Volterra and quasi-polynomial systems. Physics Letters. A 324 (5-6) : 437-445. (2004) 1.324

Conference papers 7. INGRAM, G. D. - LEITOLD, A. - HANGOS, K. M.: Structural analysis of the

computational properties of QP-DAE systems. In: ESCAPE-14 conference. Lisbon, 2004. Lisbon, 2004. pp. 1-7. N

8. MAGYAR, A. - SZEDERKÉNYI, G. - HANGOS, K. M.: Quadratic stability of process systems in generalized Lotka-Volterra form. In: 6th IFAC symposium on nonlinear control systems. NOLCOS 2004. Preprint. Stuttgart, 2004. Vol. 1. (Ed.: F. Allgöwer.) Suttgart, IFAC, 2004. pp. 357-362.

9. MAGYAR, A. - HANGOS, K. M.: Stability analysis and feedback design for QP systems. In: 5th international PhD workshop on systems and control. a young generation viewpoint. Balatonfüred, 2004. Balatonfüred, 2004. pp. 1-5. (CD)

10. NÉMETH, E.: Diagnostic goal driven modelling and simulation of multiscale process systems. In: 5th international PhD workshop on systems and control. a young generation viewpoint. Balatonfüred, 2004. Balatonfüred, 2004. pp. 1-6. (CD)

78

11. NÉMETH, H. - PALKOVICS, L. - HANGOS, K. M.: Feedforward pressure limiter control for mechatronic air management systems. In: 7th international symposium on advanced vehicle control. AVEC’04. Arnhein, 2004. Arnhein, 2004. pp. 1-6.

12. PÉNI, T. - SZEDERKÉNYI, G. - BOKOR, J. - HANGOS, K.M.: Dynamic invrsion based velocity tracking control of road vehicles. In: 6th IFAC symposium on nonlinear control systems. NOLCOS'04. Preprint. Stuttgart, 2004. Vol. 3. (Ed:: F. Allgöwer.) Stuttgart, IFAC, 2004. pp. 1199-1204.

13. PONGRÁCZ, B. - AILER, P. - SZEDERKÉNYI, G. - HANGOS, K. M.: Nonlinear zero dynamics analysis and control of a low power gas turbine. In: 5th international PhD workshop on systems and control: a young generation viewpoint. Balatonfüred, 2004. Balatonfüred, 2004. pp. 1-5. (CD)

14. PONGRÁCZ, B. - AILER, P. - SZEDERKÉNYI, G. - HANGOS, K. M.: Stability of zero dynamics of a low-power gas turbine. In: 12th Mediterranean conference on control and automation. MED 2004. Kusadasi, 2004. Kusadasi, IEEE, 2004. pp. 1-5. (CD)

15. SCHNÉ, T. - HANGOS, K.: Zero dynamics of SISO quasi polynomial systems. In: 5th international PhD workshop on wystems and control: a young generation viewpoint. Balatonfüred, 2004. Balatonfüred, 2004. pp. 1-6. (CD)

16. SZEDERKÉNYI, G. - MAGYAR, A.: Time reparametrization and global stability of quasi-polynomial (QP) systems. In: 5th international PhD workshop on systems and control: a young generation viewpoint. Balatonfüred, 2004. Balatonfüred, 2004. pp. 1-5. (CD)

Research reports 17. KOVÁCS. Á. - NÉMETH, E. - HANGOS, K. M.: Coloured Petri net model of a

simple runway. Budapest, MTA SZTAKI, 2004. 27 p. (Research report SCL-001/2004.)

18. NÉMETH, E. - HANGOS, K. M.: Multi-scale process model description by generalized hierarchical CPN models. Budapest, MTA SZTAKI, 2004. 19 p. (Research report SCL-002/2004.)

19. PONGRÁCZ, B. - INGRAM, G. - HANGOS, K. M.: The structure and analysis of QP- DAE system models. Budapest, MTA SZTAKI, 2004. 37 p. (Research report SCL-004/2004.) N

20. SCHNÉ, T. - HANGOS, K.: Zero dynamics of SISO quasi-polynomial systems. Budapest, MTA SZTAKI, 2004. 17 p. (Technical report SCL-005/2004.)

79

21. FAZEKAS, Cs. - KOZMANN, Gy. - HANGOS, K. M.: Hierarchical modelling in biology: A systematic build-up of a limb model. Budapest, MTA SZTAKI, 2004. 50 p. (Technical report SCL-003/2004.)

Ph.D. Dissertations and Diploma thesis:

NÉMETH, H.: Nonlinear modelling and control for a mechatronic protection valve. PhD Dissertations, Budapest University of Technology and Economics, Hungary, 2004. MAGYAR, A.: Stability of generalized Lotka-Volterra systems. Diploma work, University of Veszprém, 2004.

Submitted/Accepted:

1* NÉMETH, E. – LAKNER, R. – HANGOS, K. M. – CAMERON, I. T.: Prediction-

based diagnosis and loss prevention using qualitative multi-scale models. Accepted to ESCAPE-15. 2005.

2* PONGRÁCZ, B. – AILER, P. – SZEDERKÉNYI, G. – HANGOS, K. M.: Nonlinear zero dynamics analysis and control of a low power gas turbine. Accepted in ASME Journal of Engineering for Gas Turbines and Power. 2005.

3* FAZEKAS, CS. – KOZMANN, GY. – HANGOS, K. M.: Hierarchical modelling in biology: systematic building of limb models. Accepted to IFAC World Congress 2005.

4* MAGYAR, A. – SZEDERKÉNYI, G. – HANGOS, K. M.: Quasi-polynomial system representation for the analysis and control of nonlinear systems. Accepted to IFAC World Congress 2005.

5* KOVÁCS, Á. – NÉMETH, E. – HANGOS, K. M.: Modeling and optimization of runway traffic flow using coloured Petri nets. Accepted to The 5th International Conference on Control and Automation 2005.

6* AILER, P. – SZEDERKÉNYI, G – PONGRÁCZ, B.: Constrained control of a low power industrial gas turbine based on input-output linearization. Accepted to The 5th International Conference on Control and Automation 2005.

7* NÉMETH, E. – LAKNER, R. – HANGOS, K. M. – CAMERON, I. T.: Prediction-based diagnosis and loss prevention using multi-scale model-based reasoning. Accepted to The 18th International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems. 2005.

8* LAKNER, R. - HANGOS, K.M. – Cameron, I. T..: On minimal models of process systems. Chemical Engineering Science. 60 (4) : 1127-1142. (2005)

9* NÉMETH, H. - PALKOVICS, L. - HANGOS, K. M.: Unified model simplification procedure applied to a single protection valve. Control Engineering Practice. 13 (3) : 315-326. (2005)

10* SZEDERKÉNYI, G. - HANGOS, K. – MAGYAR, A.: Ont he time-reparametrization of quasi-polynomial systems. Physics Letters. A 334 (4) : 228-294. (2005)

80

11* NÉMETH, E. - CAMERON, I.T. - HANGOS, K.M.: Diagnostic goal driven modelling and simulation of multiscale process systems. Computers and Chemical Engineering. (in press)

RESEARCH GRANTS Project title: Modelling and Control of Dynamic Process Systems Hungarian National Science Foundation (OTKA) Supervisor: K. Hangos OTKA grant No.: T042710 Duration: 2003–2006 Project title: Analysis Based Control of Nonlinear Dynamic Systems Hungarian National Science Foundation (OTKA) Supervisor: G. Szederkényi OTKA grant No.: F046223 Duration: 2004–2007 Project title: Multiscale Process Modelling for Intelligent Control Australian Research Council (ARC) Supervisor: K. Hangos ARC grant No.: LX0348222 Duration: 2004–2006

81

COMBINATORIAL COMPUTER SCIENCE RESEARCH GROUP

RESEARCH PROJECTS (Zs. Tuza, G. Bacsó) Graph coloring joint work with J. Kratochvíl (Praha) and M. Voigt (Ilmenau)

Graph colorings of restricted types such as list colorings (where a set of admissible colors is given for each vertex) have been investigated, and the extendability of partial colorings with a given number of colors, under the assumption that no monochromatic pair of adjacent vertices may occur. Such kind of problems are motivated by scheduling, frequency assignment, etc. The main directions in our research are the time complexity of deciding whether a feasible coloring exists, and sufficient conditions ensuring the existence of a feasible coloring. We have also considered the problem in more general settings where a given number of colors has to be assigned to each vertex simultaneously, or the subgraph induced by each color class has to satisfy a given property. Some of the multicoloring methods work for hypergraphs as well.

Perfect graphs Uniquely colorable perfect graphs are interesting in themselves, independently of the status of the Strong Perfect Graph Conjecture (that has been, perhaps, recently proved). They can help, e.g., in the coloring algorithm of perfect graphs. Our investigations aim at finding a combinatorial characterization for them. We have found some combinatorial-type conclusions of unique colorability for some (not too small) classes of perfect graphs. Furthermore, the connection with ear structures of graphs has become clear. Another subject is the question of the perfectness of graphs obtained from the cyclically oriented triangles of a directed graph. The near-factorizations of groups is a subject in group theory, which has an interesting link to perfect graphs. We have found surprising new algebraic examples, starting from graphs.

Dominating subgraphs joint work partly with O. Favaron (Paris), M. Voigt (Ilmenau), P. D. Vestergaard (Aalborg) and D. Michalak (Zielona Góra)

Given a class D of graphs, the problem is to describe the graphs each of whose connected induced subgraphs has some dominating subgraph belonging to D. Earlier, we found charac-terizations in terms of forbidden induced subgraphs for various classes D (paths, connected bipartite or complete-bipartite graphs, etc.). General results have also been proved on the structure of minimal non-D-dominated graphs. Finally, a method has been developed yielding a complete description of minimal forbidden induced, connected subgraphs. A related problem is to explore similarities and differences between connected domination and general domination where the subgraph to be found is not necessarily connected. Also, the relationship between dominations within distances one and two has been investigated.

Steiner systems and block designs joint work partly with M. Gionfriddo, S. Milici, L. Milazzo and G. Quattrocchi (Catania)

This project on the theory of combinatorial designs started about a decade ago. In our recent work we deal with the existence of blocking sets, and the extremal properties of arcs. The former are point sets which meet all blocks but contain none of them as a subset; while the

82

latter share at most two elements with each block. The more general structures of G-designs have also been considered.

Hypergraph coloring partly joint work with L. Milazzo (Catania) V. I. Voloshin (Troy) and Cs. Bujtás (Veszprém)

Given a pair of finite set systems, H=(C,D), where C and D have the same point set X, the problem is to partition X into as many subsets as possible in such a way that each member of C should meet some partition class in more than one point, while no partition class should contain any member of D. This new direction in hypergraph theory is interesting not only in the theoretical setting but also because of its motivations in biology. We have investigated the problem of determining which conditions ensure that the extremal partition be unique. In the case of uniform hypergraphs, the possible partitions have been characterized. A related problem is when the requirements on C and D admit no feasible partition. We have studied the question in symmetric configurations, too.

Graph algorithms joint work with C. Bazgan, Y. Manoussakis, M. Santha and D. Vanderpooten (Paris)

This fruitful co-operation has included various subjects, e.g., some properties of edge partitions in graphs, network routings, tournaments, the existence of vertex partitions of graphs under degree conditions, etc. Besides structural results, emphasis is put on the study of approximation algorithms, including the design of polynomial-time approximation schemes and proofs of non-approximability.

Process control joint work with K. M. Hangos and G. Szederkényi

We study some structural properties of dynamic process systems given with their state space model, applying graph-theoretic methods. New results have been achieved on the selection of optimal control structures and on model simplification. One of our goals is to describe some classes of instances where optimal solutions can be found in polynomial time. Our recent work also includes the analysis of the effect of simplifying model transformations on the differential index of model equations.

Scheduling theory joint work with E. Angelelli, R. Mansini and M. G. Speranza (Brescia) and Á. B. Nagy (Veszprém)

Multiprocessor scheduling problems are investigated by means of graph theoretic models, with emphasis on comparability graph augmentations. Recent activity also includes the design and analysis of on-line algorithms, e.g., where lower and upper bounds are known on the sizes of items to be scheduled. Problem instances with precedence constraints have also been studied.

PUBLICATIONS 1. ANGELELLI, E. - NAGY, Á. B. - SPERNAZA, M. G. - TUZA, Zs.: The on-line

multiprocessor scheduling problem with known sum of the tasks. Journal of Scheduling. 7 : 421-428. (2004) N 0.702

83

2. BACSÓ, G. - GRAVIER, S. - GYÁRFÁS, A. - PREISSMANN, M. - SEBŐ, A.: Coloring the maximal cliques of graphs.

SIAM Journal on Discrete Mathematics. 17 (3) : 361-376. (2004) N 0.725 3. BACSÓ, G. - TUZA, Zs.: Graphs without induced P5 and C5. Discussiones Mathematicae Graph Theory. 24 : 503-507. (2004) 4. GÖRING, F. - HARANT, J. - HEXEL, E. - TUZA, Zs.: On short cycles through

prescribed vertices of a graph. Discrete Mathematics. 286 : 67-74. (2004) N 0.303 5. MANSINI, R. - SPERNAZA, M. G. - TUZA, Zs.: Scheduling groups of tasks with

precedence constraints on three dedicated processors. Discrete Applied Mathematics. 134 : 141-168. (2004) N 0.503 6. NOVÁK, Á. B. - BÉRCES, M. - LUDÁNYI, Z. - TUZA, Zs.: A temporal extension of

a spatial relational model. In: INES 2004. IEEE international conference on intelligent engineering systems.

Cluj-Napoca, 2004. Cluj-Napoca, IEEE, 2004. pp. 585-589. 7. NOVÁK, Á. B. - BÉRCES, M. - LUDÁNYI, Z. - TUZA, Zs.: On the Interoperability

problems of the spatiotemporal relational model, PLAT. In: ICCC 2004. 2nd IEEE international conference on computational cybernetics.

Proceedings. Vienna, 2004. (Eds.: W. Elmenreich, W. Haidinger, J. A. Tenreiro Machado.)

Vienna, IEEE, 2004. pp. 415-420. 8. QUATTROCCHI, G. - TUZA, Zs.: Partition of C4-designs into minimum and

maximum number of P3-designs. Graphs and Combinatorics. 20 (4) : 531-540. (2004) N 0.159 9. TUZA, Zs.: Further topics in graph coloring. In: Handbook of graph theory. (Eds.: J. L. Gross, J. Yellen.) Boca Raton, CRC Pr., 2004. pp. 365-388. (Discrete mathematics and its applications.) 10. TUZA, Zs.: Graph coloring. In: Handbook of graph theory. (Eds.: J. L. Gross, J. Yellen.) Boca Raton, CRC Pr., 2004. pp. 341-364. (Discrete mathematics and its applications.) 11. HANGOS, K. M. - SZEDERKÉNYI, G. - TUZA, Zs.: The effect of model

simplification assumptions on the differential index of lumped process models. Computers and Chemical Engineering. 28 : 129-137. (2004)

PUBLICATIONS TO APPEAR

1* BACSÓ, G. – MICHALAK, D. – TUZA, Zs.: Dominating bipartite subgraphs in graphs. Discussiones Mathematicae Graph Theory (in print)

2* BACSÓ, G. – TÁLOS, A. – TUZA, Zs.: Graph domination in distance two. (in print) 3* TUZA, Zs.: Strong branchwidth and local transversals. Discrete Applied Mathe-

matics (in print) 4* ANGELELLI, E. – SPERANZA, M. G. – TUZA, Zs.: Semi on-line scheduling on

three processors with known sum of the tasks. Journal of Scheduling (accepted) 5* BACSÓ, G. – TUZA, Zs. – VOIGT, M.: Characterization of graphs dominated by

paths of bounded length. Discrete Mathematics (accepted)

84

6* DEOGUN, J. S. – LI, L. – SCOTT, S. D. – TUZA, Zs.: Weighted edge-decompositions of graphs. Journal of Combinatorial Mathematics and Combina-torial Computing (accepted)

7* DEOGUN, J. S. – TUZA, Zs.: Graph-theoretic methods. In: Formal Methods in Computer Science (M. Ferenczi et al., eds.) (accepted)

8* ANDERSEN, L. D. – TUZA, Zs. – VESTERGAARD, P.D.: Largest non-unique subgraphs. Tecnical Report R-2004-33, Aalborg University. (submitted)

9* BACSÓ, G.: Complete description of forbidden subgraphs in the structural domina-tion problem. (submitted)

10* BACSÓ, G.: Perfectly orderable graphs and unique colorability. (submitted) 11* BACSÓ, G. – HÉTHELYI, L. – P. SZIKLAI, P.: New near-factorizations of finite

groups (submitted) 12* BACSÓ, G. – KOUIDER, M.: Dominating subgraphs with prescribed structure.

(submitted) 13* BACSÓ, G. – TUZA, Zs.: Graph perfectness and triangle families of directed multi-

graphs. (submitted) 14* BACSÓ, G. – TUZA, Zs.: A method to find the color cost of generalized interval

graphs. (submitted) 15* BAZGAN, C. – TUZA, Zs. – VANDERPOOTEN, D.: The satisfactory partition

problem. (submitted) 16* BAZGAN, C. – TUZA, Zs. – VANDERPOOTEN, D.: Complexity and approximation

of satisfactory partition problems. (submitted) 17* BAZGAN, C. – TUZA, Zs. – VANDERPOOTEN, D.: Efficient algorithms for

decomposing graphs under degree constraints. (submitted) 18* BAZGAN, C. – TUZA, Zs. – VANDERPOOTEN, D.: Degree-constrained decom-

positions of graphs: bounded treewidth and planarity. (submitted) 19* HANGOS, K. M. – TUZA, Zs.: Stability of process systems with controlled mass

convection network. (submitted) 20* HANGOS, K. M. – TUZA, Zs. – YEO, A.: Some complexity problems on Single

Input Double Output controllers. (submitted) 21* IDZIK, A. – TUZA, Zs. – ZHU, X.: Cut-vertices in edge-coloured graphs.

(submitted) 22* SZANISZLÓ, Zs. – TUZA, Zs.: Lower bound on the profile of degree pairs in cross-

intersecting set systems. (submitted) 23* TUZA, Zs.: Dom(D) = Forb(F). (submitted)

RESEARCH GRANT Project title: Modelling and control of dynamic process systems

Hungarian Scientific Research Fund (OTKA) Supervisor: K. M. Hangos

Member: Zs. Tuza Grant No.: T 042710 Duration: 2003-06

85

MACHINE LEARNING AND HUMAN COMPUTER INTERFACES RESEARCH GROUP

Reinforcement Learning, Control (L. Kocsis, Cs. Szepesvári, P. Torma, W.D. Smart) Markovian Decision Problems, Control and Filtering of Stochastic Systems: Q-learning is one of the best known reinforcement learning methods. Yet, it’s convergence properties when used in conjuction with function approximators are largely unknown. We have proposed a modificiation of the gradient-based Q-learning algorithm and proved that the modified algorithm converges with probability one to the neighborhood of the optimal Q-function [1]. This is the first known generic result for the convergence of Q-learning for continuous state-space Markovian Decision Problems. We have continued our work on filtering of non-linear stochastic systems. Our main focus is on particle filtering and systems where observations are noisy, but the level of this observation noise is much lower than the level of noise of the dynamics. In this situation, paradoxically, the canonical particle filter (SIR) performs very poorly. We have proposed a two-stage particle filter that was shown both analytically and experimentally to outperform previous particle-filter modifications aimed to solve this paradox [2]. Learning in Games: An Omaha Hi-Lo Poker program was developed to serve as test bench for learning algorithms. We have introduced a general-purpose algorithm, RSPSA, for tuning game parameters. RSPSA combines Simultaneous Perturbation Stochastic Approximation (SPSA) with Resilient Backpropagation (RPROP). The experiments in poker have shown that the new algorithm can improve a game-playing program significantly, and the method proved to be competitive with alternative tuning algorithms.

Autonomous Driving: The aim of inverse reinforcement learning (IRL) algorithms is to recover an unknown reward function using behaviour traces of an expert. The learnt reward function can then be used for finding a policy by means of some reinforcement learning algorithm, the main underlying assumption being that this allows for better generalizations to unseen situations than if a policy were learnt directly from the expert traces. We have investigated IRL algorithms for controlling cars in simulated environments. Initial experiments show that the learnt policies can often perform better than the ones learnt by imitation, though the algorithms seem to be sensitive the features used as the basis of learning.

Machine Learning (A. Kocsor, K. Kornél, Cs. Szepesvári)

Feature Extraction Methods: We have proposed a supervised feature extraction method aimed at uncovering the ‘principle manifold’ underlying classification and/or regression problems [1,3]. The method has been tested on several standard datasets and was shown to outperform alternative feature extraction methods (e.g. PCA, LDA). The new method successively identifies `important’ components using a deflation approach: in each step it aims at finding the maximally informative direction in a deflated space.

86

Artificial Intelligence (Cs. Szepesvári) Search: We have defined a new class of search problems and have given an algorithm that solves this problem [4]. The performance of the new algorithm was tested on a real-life domain (segmentation of character strings). The new problem is called the “Shortest Path Discovery Problem”. The problem is to find the shortest path in a weighted graph where the costs of the edges are initially unknown, but the algorithm may query the cost of the edges. It is assumed that querying the cost of an edge is expensive and the aim is to find the shortest path with the minimum number of queries.

PUBLICATIONS 1. KOCSOR, A. - KOVÁCS, K. - SZEPESVÁRI, Cs.: Margin maximizing discriminant

analysis. In: Machine Learning. ECML 2004. 15th European Conference in Machine

Learning. Pisa, 2004. (Eds.: J.F. Boulicaut et al.) Berlin, Springer, 2004. pp. 227-238. (Lecture Notes in Computer Science 3201.) 0.515 2. SZEPESVÁRI, Cs. - SMART, W. D.: Interpolation-based Q-learning. In: ICML 2004. Proceedings of the 21th International Conference on Machine

Learning. Banff, 2004. (Eds.: R. Greiner, D. Schuurmans.) New York, ACM, 2004. pp. 791-798. N 3. SZEPESVÁRI, Cs. - KOCSOR, A. - KOVÁCS, K.: Kernel machine based feature

extraction algorithms for regression problems. In: ECAI 2004. 16th European Conference on Artificial Intelligence. Valencia, 2004.

(Eds.: R. López de Mántaras, L. Saitta.) Amsterdam, IOS Pr., 2004. pp. 1091-1092. (Frontiers in Artificial Intelligence and Applications 110.) 4. SZEPESVÁRI, Cs.: Shortest path discovery problems: a framework, algorithms and

experimental results. In: AAAI-04/IAAI-04. 19th National Conference on Artificial intelligence (AAAI-

04). 16th Innovative Applications of Artificial Intelligence (IAAI-04). Proceedings. San Jose, 2004.

Menlo Park, AAAI Pr., MIT Pr., 2004. pp. 550-555. 5. TORMA, P. - SZEPESVÁRI, Cs.: Enhancing particle filters using local likelihood

sampling. In: Computer vision. ECCV 2004. 8th European Conference on Computer Vision.

Praque, 2004. Part 1. (Eds.: T. Pajdla, J. Matas.) Berlin, Springer, 2004. pp. 16-27. (Lecture Notes in Computer Science 3021.) 0.515

87

GRANTS, AWARDS

Project title: Unsupervised modelling of natural languages and applications in office environments

National Office for Reseach and Technology Supervisor: Cs. Szepesvári Fixed duration contract, NKFP 2/051/2005 Duration: 2005-2007 Project title: Next generation data-mining using high-performance parallel distributed

systems Agency for research fund management and research exploitation (KPI) Supervisor: Cs. Szepesvári Fixed duration contract, GVOP AKF, GVOP-3.1.1.-2004-05-0145/3.0 Duration: 2005-2007

88

COGNITIVE VISION GROUP RESEARCH PROJECTS P. Baranyi, Z. Petres, B. Reskó, A. Gaudia, P. Várkonyi, A. Róka, Á. Csapó 1. Cognitive Vision, Intelligent Contouring Within the field of cognitive vision we have thoroughly studied the mammalian cerebral cortex with a special respect on the regions responsible for primary visual processing (V1). The studied biological structures were modeled from an information processing point of view. The proposed model is of a neural structure and functionality similar to that of the visual cortex, which is able to recognize the image contours in an intelligent way. This contouring makes the recognition of the lines of a certain orientation or length, curves or simple shapes possible. The model is based on the structure of inter-neuronal connectivity only, and the contouring task does not require any algorithm. 2. Intelligent Space based Robot Programming The Intelligent Space concept refers to a distributed sensory intelligence. We have developed a distributed multi-camera system that is able to track the motion of objects and provide 3D motion information, such as time dependent 3D position and orientation. There are several possible applications of the developed system. In cooperation with PPM, a Norwegian company, we have integrated the developed system with industrial robots. The motion captured by our system can be transferred into industrial robots, which perform the same motion. This method allows for considerably shortening the programming time of industrial robots, which makes it economic to apply them to low batch number production applications. 3. Tensor Product Transformation We have proposed a designing method of an output feedback control strategy to the prototypical aeroelastic wing section which is used for the theoretical as well as experimental analysis of two-dimensional aeroelastic behavior and exhibits limit cycle oscillation without control effort. The control strategy is based on a state feedback controller, developed in preliminary works, values. The main objective of the research is the observer design based on a recently introduced design methodology which is a combination of the TP model transformation and the feasibility test of linear matrix inequalities. The main novelty from a theoretical point of view is that the TP model transformation is not applicable for observer design in its published form. We have also shown that an observer design needs the inverse of the conditions, derived for the controller design of the convex hull resulted by the TP model transformation. Therefore, the method, as an extension of the TP model transformation is capable of generating a proper convex hull for the observer design. Finally, we have validated the extended TP model transformation via output feedback control design to the prototypical aeroelastic wing section.

89

PUBLICATIONS 1. BARANYI, P. - KÓCZY, L. T. - GEDEON, T. D.: A generalized concept for fuzzy

rule interpolation. IEEE Transactions on Fuzzy Systems. 12 (6) : 820-837. (2004) 1.690 2. BARANYI, P. - MICHELBERGER, P.: Global asymptotic stabilization of the

aeroelastic wing section: a TP model transformation based approach. In: FUZZ-IEEE 2004. IEEE international conference on fuzzy systems. Budapest,

2004. Piscataway, IEEE, 2004. pp. 1063-1068. (CD) 3. BARANYI, P. - MICHELBERGER, P. - VÁRKONYI-KÓCZY, A.: Numerical

control design for aeroelastic systems. In: SAMI 2004. 2nd Slovakian-Hungarian joint symposium on applied machine

intelligence. Herl’any, 2004. Herl’any, 2004. pp. 43-50. 4. BARANYI, P.: Observer design via TP model transformation. In: INES 2004. IEEE international conference on intelligent engineering systems.

Cluj-Napoca, 2004. Cluj-Napoca, IEEE, 2004. pp. 470-475. 5. BARANYI, P. - VÁRKONYI-KÓCZY, A. R. - PETRES, Z.: Reference signal

following control design of the TORA system: a TP model transformation based approach.

In: CONTROLO 2004. Proceedings of the 6th Portuguese conference on automatic control. Faro, 2004. (Ed.: A. E. Ruano.)

Faro, 2004. pp. 85-90. 6. BARANYI, P. - VÁRLAKI, P.: TP model transformation as a uniform way for

observer design. In: CSIT’2004. Proceedings of the workshop computer science and information

technologies. Budapest, 2004. Vol. 2. Ufa, Ufa State Aviation Technical University, 2004. pp. 87-93. 7. BARANYI, P.: TP model transformation as a way to LMI-based controller design. IEEE Transactions on Industrial Electronics. 51 (2) : 387-400. (2004) 0.816 8. BARANYI, P. - YAM, Y.: TP model transformation based observer design to 2-D

aeroelastic sytem. Acta Polytechnica Hungarica. Journal of Applied Sciences at Budapest Tech

Hungary. 1 (2) : 63-77. (2004) 9. BARANYI, P. - KORONDI, P. - PATTON, R. J. - HASHIMOTO, H.: Trade-off

between approximation accuracy and complexity for TS fuzzy models. Asian Journal of Control. 6 (1) : 21-33. (2004) 10. BARANYI, P. - YAM, Y.: Uniform observer design for linear parameter varying

systems. In: Proceedings of the 5th international symposium of Hungarian researchers on

computational intelligence. Budapest, 2004. Budapest, BME, 2004. pp. 371-381. 11. KOVÁCS, Sz. - BARANYI, P.: Reduction of the dynamic state-space in fuzzy Q-

learning. In: FUZZ-IEEE 2004. IEEE international conference on fuzzy systems. Budapest,

2004. Vol. 2. Piscataway, IEEE, 2004. pp. 1075-1080.

90

12. PETRES, Z. - RESKÓ, B. - BARANYI, P.: Reference signal control of the TORA system: a TP model transformation based approach.

In: FUZZ-IEEE 2004. IEEE international conference on fuzzy systems. Budapest, 2004.

Piscataway, IEEE, 2004. pp. 1081-1085. (CD) 13. TIKK, D. - BARANYI, P. - PATTON, R. J.: On the approximation properties of TP

model forms. In: FUZZ-IEEE 2004. IEEE international conference on fuzzy systems. Budapest,

2004. Piscataway, IEEE, 2004. pp. 1069-1074. (CD) 14. YAM, Y. - LEE W. M. - BARANYI, P.: On application of grid point sampling and

SVD consolidation approach. In: FUZZ-IEEE 2004. IEEE international conference on fuzzy systems. Budapest,

2004. Piscataway, IEEE, 2004. pp. 1057-1062. (CD)

91

APPENDIX 1.

EDUCATIONAL ACTIVITIES a. Graduate courses CORVINUS University of Budapest Balla, K.: Dynamic models Department of Decisions in Economics, 2 hours/week, 2nd semester of 2003/2004 Fülöp, J., Prill, M.: Optimization models Department of Decisions in Economics, 4 hours/week, 1st semester of 2004/2005 Rapcsák, T. and Bozóki, S.: Multiattribute decision models

Department of Decisions in Economics, 4 hours/week, 2nd semester of 2003/2004

Budapest University of Technology and Economics Antos, A.: Information Theory

For foreign students in English, Faculty of Electrical Engineering and Informatics, 4 hours/week, 1st semester of 2004/2005

Baranyi, P.: Digital Design, and Informatics II. Faculty of Economic and Social Sciences, M.Sc. lectures, 4 hours/week, 2nd semester of 2003/2004, 1st semester of 2004/2005

Baranyi, P.: Informatics I. II. Faculty of Electric Engineering and Informatics, M.Sc. lectures, 4 hours/week, 2nd semester of 2003/2004, 1st semester of 2004/2005

Baranyi, P.: Digital Design Faculty of Electric Engineering and Informatics, M.Sc. lectures, 4 hours/week, 1st semester of 2004/2005

Bartha, T.: Design of Information Infrastructure Laboratory Faculty of Measurement and Information Systems, 4 hours/week, 2nd semester of 2003/2004

Bartha, T.: Lecture on Design of Information Systems Infrastructure Dept. of Measurement and Information Systems, 4 hours/week, 2nd semester of

2003/2004 Bokor, J.: Control Systems I. and Control Systems I-II Faculty of Transportation Engineering, Automation Dept. of Transportation

Engineering, M.Sc. lectures, 3 hours/week, 1st semester of 2004/2005 Csetverikov, D.: Industrial image analysis

Mechanical Engineering, 2 hours/week 1st semester of 2004/2005, 2nd semester of 2003/2004

Gáspár, P.: Control Systems II Faculty of Transportation Engineering, Automation Dept. of Transportation

Engineering, M.Sc. lectures and excercises, 30 hours/course, 2nd semester of 2003/2004

Györfi, L. :Queueing Faculty of Electrical Engineering and Informatics, 4 hours/week, 2nd semester of 2003/2004

92

Györfi, L.: Information theory Faculty of Electrical Engineering and Informatics, 4 hours/week, 1st semester of 2004/2005

Ivanyos, G.: Algebraic and arithmetical algorithms Faculty of Natural Sciences, Dept. of Algebra, regular course, 2 hours/week 2nd semester of 2003/2004

Keviczky, L.: Lecture on Control Theory Faculty of Electrical Engineering, Dept. of Automation, 3 hours/week, 1st semester

of 2004/2005 Kis, T., Váncza, J.: Combinatorial Auctions, Individual Laboratory Work Faculty of Informatics, 2nd semester of 2003/2004, 1st semester of 2004/2005 Kis, T., Kovács, A.: Multiprocessor Flowshop Scheduling Individual Laboratory Work, Faculty of Electrical Engineering and Informatics, 2

hours/week, 1st semester of 2004/2005 Kovács, A.: Distributed Intelligent Systems Laboratory Faculty of Electrical Engineering and Informatics, 2 hours/week, 2nd semester of

2003/2004 Kovács, A.: System Techniques Laboratory Faculty of Electrical Engineering and Informatics, 2 hours/week, 2nd semester of

2003/2004 Kovács, A.: Artificial Intelligence Faculty of Electrical Engineering and Informatics, 2 hours/week, assistant, 1st

semester of 2004/2005 Kovács, G.L., Mezgár, I., Kopácsi, S., Haidegger, G., Nacsa, J.: Manufacturing

automation Faculty of Transportation, Department of Machine Technology, 1st semester of 2004/2005

Kovács, G.L., Mezgár, I., Kopácsi, S., Haidegger, G., Nacsa, J.: Manufacturing system design Faculty of Mechanical Eng., Department of Manufacturing Systems Technology, 2nd semester of 2003/2004

Kovács, G.L., Haidegger, G., Nacsa, J., Drozdik, S.: CIM systems and FMS systems Electrical Engineering Faculty, Department of Electronic Technology, Oct, Nov, Dec, 2003

Kulcsár, B.: Control Systems I., II. Faculty of Transportation Engineering, Automation Dept. of Transportation

Engineering, M.Sc. Seminar, 2 hours/week, 1st semester of 2004/2005, 2nd semester of 2003/2004

Márkus, A., Váncza, J.: Introduction to Artificial Intelligence I.-II. Faculty of Mechanical Engineering, 2 hours/week, 2nd semester of 2003/2004, 1st

semester 2004/2005 Molnár-Sáska, G.: Seminar on applied mathematics Institute of Mathematics, 2 hours/week, 1st semester of 2004/2005 Molnár-Sáska, G.: Statistics Institute of Mathematics, 2 hours/week, 1st semester of 2004/2005 Monostori, L., Haidegger, G., Kovács, Gy., Mezgár, I., Váncza, J.: Information

Management in Production Systems Faculty of Mechanical Engineering, 2 hours/week, 1st semester 2004/2005 Monostori, L., Váncza, J.: Production Planning and Control Faculty of Mechanical Engineering, 4 hours/week, 1st semester of 2004/2005

93

Németh, Zs.: Parallel Programming International Education Center, B.Sc. course in English, 4 hours/week, 2nd semester of 2003/2004

Obi, C.C.: Seminar on Control Theory II. Faculty of Transportation Engineering, Automation Dept. of Transportation Engineering, Teaching assistantship in M.Sc. Lectures, 1 hours/week, 1st semester of 2003/2004

Obi, C.C.: Control Theory Laboratory Faculty of Transportation Engineering, Automation Dept. of Transportation Engineering, Teaching assistantship in M.Sc. Lectures, 1 hours/week, 1st semester of 2003/2004

Pintér, M.: Probability Theory Faculty of Electrical Engineering and Informatics, 4 hours/week, 1st semester of 2004/2005

Rapcsák, T., Bozóki, S.: Decision support methods Department of Transportation Engineering, 1st semester of 2004/2005

Rácz, B.: Algebra 2 hours/week, 1st semester of 2004/2005, 2nd semester of 2003/2004 Rácz, B.: Elements of Computer Science 2 hours/week, spring 2004 Renner, G.: CAD Technologies I. Mechanical Engineering, 2 hours/week, 1st semester of 2004/2005 Renner, G.: Integrated engineering Mechanical Engineering, 2 hours/week, 1st semester of 2004/2005 (in English) Renner, G., Mezgár, I.: CAD Technologies II., Inst. Of Machine Elements, 1 hours/week 2nd semester of 2003/2004 Reskó, B.: Informatics Tutor French Section , M.Sc. practice, 2nd semester of 2003/2004 Rónyai, L.: Number Theory

Faculty of Natural Sciences, Dept. of Algebra, regular course, 2 hours/week, 1st semester of 2004/2005

Rónyai, L.: Algorithms (recital session) Faculty of Natural Sciences, Dept. of Algebra, regular course, 2 hours/week, 2nd semester of 2003/2004

Szászi, I.: Control systems I.-II. Faculty of Transportation Engineering, Department of Control and Transport Automation, M.Sc. Seminar, 2 hours/week, 2nd semester of 2003/2004 and 1st semester of 2004/2005

Varga, I.: Traffic automation I-II. Faculty of Transportation Engineering, Department of Control and Transport Automation, M.Sc. lectures, 2 hours/week, 2nd semester of 2003/2004 and 1st semester of 2004/2005

Eötvös Loránd University of Sciences Benczúr, A.: Combinatorial optimization Faculty of Natural Sciences, Dept. of Operations Research, regular course, 2

hours/week, 2nd semester of 2003/2004 Benczúr, A.: The mathematics of networks and the WWW

94

Faculty of Natural Sciences, Dept. of Computer Science, special course, 2 hours/week, 1st semester of 2004/2005

Benczúr, A.: Recital session to the preceding course 2 hours/week, 2nd semester of 2003/2004, 1st semester of 2004/2005 Egri, P.: Compiler Construction I. 2 hours/week, 1st semester of 2004/2005 Kacsuk, P.: Grid Computing

Faculty of Natural Sciences, Department of Computer Science, 2 hours/week, 2nd semester of 2003/2004, 1st semester of 2004/2005

University of Miskolc Balla, K.: Analysis I-II

Mathematical Institute, 4 hours/week, 1st semester of 2004/2005 and 2nd semester of 2003/2004

Kacsuk, P. : Parallel and Distributed systems I.-II. Faculty of Engineering, Department of Informatics, 2 hours/week, 1st semester of 2004/2005 and 2nd semester of 2003/2004

University of Veszprém Hangos, K.M.: Computer controlled systems (in English) Institute of Informatics and Electrical Engineering, Dept. of Computer Science, 4

hours/week, 2nd semester of 2003/2004 Hangos, K.M.: Lecture on Advanced Control Methods Institute of Informatics and Electrical Engineering, Dept. of Computer Science, 4

hours/week, 2nd semester of 2003/2004 Hangos, K.M.: Lecture on Process Modelling Institute of Informatics and Electrical Engineering, Dept. of Computer Science, 2

hours/week, 1st semester of 2004/2005 Hangos, K.M.: System identification Institute of Informatics and Electrical Engineering, Dept. of Computer Science, 2

hours/week, 1st semester of 2004/2005 Németh, E.: Teaching Assistentship in Intelligent Control Systems Institute of Informatics and Electrical Engineering, Dept. of Computer Science, 2

hours/week, 2nd semester of 2003/2004 Németh, E.: Teaching Assistentship in Artifical Intelligence

Institute of Informatics and Electrical Engineering, Dept. of Computer Science, 1 hours/week, 2nd semester of 2003/2004

Szirányi, T.: Image processing Institute of Informatics and Electrical Engineering, Dept. of Information

Technology, lectures partly in English, (2 hours + 2 seminars) /week, 1st semester of 2004/2005

Szirányi, T.: Biometrics in Personal Identifications Institute of Informatics and Electrical Engineering, Dept. of Information

Technology, lectures 4 hours/week, 2nd semester of 2003/2004

95

Szolgay, P.: Applications of Cellular Neural Networks Institute of Informatics and Electrical Engineering, Dept. of Information

Technology, 4 hours/week, 1st semester of 2004/2005 Szolgay, P.: Applications of Cellular Neural Networks Faculty of Engineering, Dept. of Information Technology, lectures 2 hours/week,

2nd semester of 2003/2004 Szolgay, P.: Electronic operators-neural networks Faculty of Information Technology, 2 hours/week, 2nd semester of 2003/2004 Szolgay, P.: Design methodology based on programmable digital VLSI circuits Institute of Informatics and Electrical Engineering, Dept. of Information

Technology, lectures (2 hours + 1 seminars) /week, 1st semester of 2004/2005 Szolgay, P.: Digital Systems and Computer Architectures Institute of Informatics and Electrical Engineering, Dept. of Information

Technology, lectures 4 hours/week, 2nd semester of 2003/2004 Tuza, Zs.: Combinatorial methods Faculty of Information technology, 4 hours/week, 2nd semester of 2003/2004 Tuza, Zs.: Combinatorial algorithms Faculty of Information Technology, 4 hours/week, 2nd semester of 2003/2004 Pázmány Péter University Gerencsér, L.: Information and coding theory Faculty of Information Technology, 2 hours/week, 2nd semester of 2003/2004 Hangos, K. M., Szederkényi, G.: Lecture on System Identification Faculty of Information Technology, 2 hours/week, 1st semester of 2004/2005 Mátyás, Z.: Probability theory problems classes Faculty of Information Technology, 2 hours/week, 1st semester of 2004/2005 Molnár-Sáska, G.: Probability theory and statistics Faculty of Information Technology, 2 hours/week, 1st semester of 2004/2005 Orlovits, Zs.: Analysis Faculty of Information Technology, 2 hours/week, 1st semester of 2004/2005 Pongrácz, B.: Teaching Assistentship in Computer Controlled Systems Faculty of Information Technology, 2 hours/week, 2nd semester of 2003/2004 Pongrácz, B.: Teaching Assistentship in System Identification Faculty of Information Technology, 2 hours/week, 1st semester of 2004/2005 Rásonyi, M.: Stochastic processes Faculty of Information Technology, 2 hours/week, 1st semester of 2004/2005 Rásonyi, M.: Probability theory and statistics (lecturer) Faculty of Information Technology, 2 hours/week, 1st semester of 2004/2005 Roska, T.: Analogic Cellular Computers and Visual Microprocessors

Faculty of Information Technology, 4 hours/week, 1st semester of 2004/2005 and 2nd semester of 2003/2004

Roska, T.: Nonlinear Dynamical Systems Faculty of Information Technology , 4 hours/week, 1st semester of 2004/2005 and 2nd semester of 2003/2004

Szederkényi, G.: Lecture on Computer Controlled Systems Faculty of Information Technology, 2 hours/week, 2nd semester of 2003/2004 Szirányi, T.: Image processing

96

Faculty of Information Technology, (2 hours + 2 seminars) /week, 1st semester of 2004/2005

Szirányi, T.: Biometric methods Faculty of Information Technology, 2 hours/week, 2nd semester of 2003/2004, 1st

semester of 2004/2005 Tuza , Zs.: Discrete mathematics and algebra Department of Information Technology, 3 hours/week, 2nd semester of 2003/2004 Vágó, Zs.: Mathematical Analysis

Faculty of Information Technology, 2 hours/week, 2nd semester of 2003/2004, 1st semester of 2004/2005

University of West Hungary Szabó, L.: Optimization algorithms

Lectures for informatics students, 4 hours/week, 2nd semester of 2003/2004 Szabó, L.: Theory of algorithms Lectures for informatics students, 4 hours/week, 1st semester of 2004/2005 Szabó, L.: Theory of databases Lectures for informatics students, 4 hours/week, 1st semester of 2004/2005 István Széchenyi University, Győr Keviczky, L.: lecture on Hypermedia Systems and Applications Dept. of Informatics, 2 hours/week, 2nd semester of 2003/2004 College International, Budapest Semesters Program Ruszinko, M.: Graph Theory

3 hours/week, 2nd semester of 2003/2004 Gyárfás, A.: Combinatorics 3 hours/week, 2nd semester of 2003/2004 Queens’ University, Kingston, ON, Canada György, A.: Telecommunication and Data Network Modeling (in English)

Dept. of Mathematics and Statistics, regular course, 3 hours/week, 2nd semester of 2003/2004

University of Memphis Gyárfás, A.: Ideas in Mathematics 6 hours/week, (two courses) 2nd semester of 2003/2004

97

b. Postgraduate courses

Eötvös Loránd University of Sciences Benczúr, A.: Lectures on the mathematics of the WWW Dept. of Computer Science, 2 hours/week, 1st semester of 2004/2005 Benczúr, A., Grolmusz, V., Lukács, A.: Data mining seminar Dept. of Computer Science, 2 hours/week, 1st semester of 2004/2005, 2nd semester

of 2003/2004 Gerencsér, L.: Statistical theory of non-linear stochastic systems I. II. Faculty of Natural Sciences, 2 hours/week, 2nd semester of 2003/2004, 1st semester of

2004/2005 Lukács, A.: Data mining II. Dept. of Computer Science, 2 hours/week, 2nd semester of 2003/2004 Lukács, A.: Introduction to data mining Dept. of Computer Science, 2 hours/week, 1st semester of 204/2005 Renner, G.: Lectures on Surface reconstruction

For Ph.D. students, Doctoral Program of Informatics, 2nd semester of 2003/2004 and 1st semester of 2004/2005

Budapest University of Technology and Economics Baranyi, P.: Computational Intelligence in System Design Faculty of Electric Engineering and Informatics, Ph.D. lectures, 4 hours/week, 1st

semester of 2004/2005 Bokor, J.: Multivariable control systems (in English) Faculty of Transportation Engineering, Automation Dept. of Transportation

Engineering, Ph.D. lectures, 4 hours/week, 2nd semester of 2003/2004 Friedl, K., Ivanyos, G., Rónyai L.: Quantum computing and randomized algorithms.

Faculty of Natural Sciences, Department of Algebra, 2 hours/week, 1st semester of 2004/2005

Friedl, K., Ivanyos, G., Rónyai L.: Selected topics on algorithms II. Faculty of Electrical Engineering, Department of Computer Science and Information Theory, 2 hours/week, 2nd semester of 2003/2004

Gáspár, P.: Modern Control Theory Faculty of Transportation Engineering, Automation Dept. of Transportation Engineering, Ph.D. course, 20 hours/course, 2nd semester of 2003/2004

Györfi, L.: Statistics of Traffic Measurements Faculty of Electrical Engineering and Informatics, 4 hours/week, 1st semester of 2004/2005

Hangos, K.M.: Lecture on Nonlinear Systems and Control Theory Faculty of Natural Sciences, Dept. of Mathematical Analysis, 2 hours/week, 1st semester of 2004/2005

Kulcsár, B.: Multivariable Control Systems (in English) Faculty of Transportation Engineering, Automation Dept. of Transportation Engineering, Ph.D. lectures, 1 hours/week, 2nd semester of 2003/2004

Monostori, L.: Intelligent techniques in manufacturing Faculty of Mechanical Engineering, 2 hours/week 2nd semester of 2002/2003, 1st

semester of 2003/2004

98

Monostori, L.: Artificial neural networks and their applications Faculty of Mechanical Engineering, 2 hours/week 1st semester of 2003/2004 Renner, G.: Lectures on Computer Methods in Machine Design for Ph.D. students, Doctoral Program of Mechanical Engineering, 2nd semester of

2003/2004 and 1st semester of 2004/2005 Soumelidis, A.: Electronic Measurement and Control Systems Ph.D. lectures, 3 hours/week, 1st semester of 2004/2005 Szászi, I.: Multivariable Control Systems (in English)

Faculty of Transportation Engineering, Automation Dept. of Transportation Engineering, Ph.D. Seminars, 2 hours/week, 2nd semester of 2003/2004

University of Veszprém Hangos, K.M.: Lecture on Artificial Intelligence in Engineering

Faculty of Informatics and Electrical Engineering, Ph.D. school on “Informatics”, Intensive course, 2nd semester of 2003/2004

Hangos, K.M.: Lecture on Advanced Process Modelling and Model Analysis Faculty of Informatics and Electrical Engineering, Ph.D. school on “Informatics”, Intensive course, 1nd semester of 2004/2005

University of Szeged Rónyai, L.: Selected algorithms

Faculty of Natural Sciences, Dept. of Computer Science, 2 hours/week, 1st semester of 2004/2005

István Széchenyi University, Győr Keviczky, L.: Accreditation of the Technical Informatics Session and Accreditation of the

Ph.D. School Queen’s University, Kingston, ON, Canada György, A.: Telecommunication and Data Network Modeling (in English)

Dept. of Mathematics and Statistics, regular course, 3 hours/week, 2nd semester of 2003/2004

99

c. Ph.D students Balaton, Z.: Dynamic Process Management in Grid Environment

Supervisor: Vajda, F. Bíró, I.: Clustering of high dimensional data sets (2003-2006)

Supervisor: Lukács, A. Bozóki, S.: Least squares method in AHP (2001-2004) Supervisor: Rapcsák, T. Buti, B.: Nonlinear Dynamics in Electromechanical Systems (2001-2004) Supervisor: Nagy, I. Csalogány, K.: Mathematics of the WWW (2002-2005)

Supervisor: Benczúr, A. Csáji, B.: Neurodynamic Programming (2001-2004) Supervisor: Monostori, L. Cserey, Gy.: Motion tracking and image diagnostic (2001-2004) Supervisor: Roska, T., Rekeczky, Cs. Deák, F.: Advanced CNC Programming of Machine Tools Supervisor: Váncza, J. Egri, P.: Agent Technologies in Managing Production Networks Supervisor: Váncza, J. Felszeghy, B.: Polynomial functions on finite poin sets (2004-2007) Supervisor: Rónyai, L. Fogaras, D.: Algorithmic aspects of optional networks (2000-2004)

Supervisor: Friedl, K. Fodróczi, Z.: Auditory event detection (2002-2005)

Supervisor: Radványi, A. Friedman, E.: Mathematics of the WWW (2001-2004) Supervisor: Benczúr, A. Gáspár, Cs.: Frequent itemsets mining (2003-2006)

Supervisor: Lukács, A. Gombás, G.: Grid Monitoring and Information Systems (2001-2004) Supervisor: Kacsuk, P. Gulyás, L.: Applications of multi-agent systems (1999-2002)

Supervisor: Váncza, J. Győri, S.: Multiple access OR channel (2002-2005)

Supervisor: Györfi, L. Hajder, L.: Motion tracking and analysis of nonrigid 3D objects (2002-) Supervisor: Csetverikov, D. Hanis, A.: Movie Scene Analysis (2001-2004) Supervisor: Szirányi, T. Havasi, L.: Képi mozgáselemzés (2003-2006) Supervisor: Szirányi, T. Hegedűs, G.: Algebraic methods in discrete mathematics (2001-2004)

Supervisor: Rónyai, L. Hillier, D.: Idegrendszeri folyamatok funkcionális modellezése többrétegű CNN

architektúrán (2003-2006) Supervisor: Rekeczky, Cs. Ingram, G.: Hierarchical process modelling

Supervisor: Hangos, K.

100

Jankó, Zs.: Photorealistic scene reconstruction (2001-2005) Supervisor: Csetverikov, D. Karacs, K.: Combined understanding via geometry and human language technology

(2001-04) Supervisor: Roska, T. Kertész, A.: Workflow scheduling in GRID systems Supervisor: Kacsuk, P. Kis, A.: Taktikus érzékelés, processzálás (2002-2005) Supervisor: Szolgay, P. Kovács, A.: Constraint Programming in Large-Scalen Planning and Scheduling Supervisor: Váncza, J. Kovács, J.: Dynamic behaviour of parallel programs in the GRID environment

Supervisor: Kacsuk, P. Kovács, L.: Művészi hatások képelemzés segítségével (2002-2005) Supervisor: Szirányi, T. Kozma, P.: CNN Technology on Color Images (2000-20004) Supervisor: Szolgay, P. Kulcsár, B.: Aircraft modelling and control (1999-)

Supervisor: Bokor, J. Kurdi, Zs.Zs.: Multy-layer biometric identification based on life-cycle characteristics of

behavioural and physical parameters (2004-) Supervisor: Mezgár, I. Laczay, B.: Multiple access ADDER channel (2002-2005)

Supervisor: Györfi, L. Lázár, A. K.: Képfeldolgozás neuromorf módon: alak, szín, mélység és mozgás elemzése

(2003-2006) Supervisor: Roska, T. Lázár, K.:

Supervisor: Csuhaj-Varjú, E. Licsár, A.: Human-computer interface through Biometric characteristics (2001-2004) Supervisor: Szirányi, T. Lukács, L.: Data mining (2004-2007) Supervisor: Lukács, A. Magyar, A.: Modelling and control of nonlinear process systems (2004-2007) Supervisor: Hangos, K. Mátyás, Z.: Behaviour models of financial markets (2002-)

Supervisor: Gerencsér, L. Megyesi, Z.: Image analysis problems in scene reconstruction (2001-2004) Supervisor: Csetverikov, D. Molnár-Sáska, G.: Hidden Markov processes in financial modelling (1999-) Supervisor: Gerencsér, L., Bolla, M. Mozsári, A.: Hyperactivity (2002-2005) Supervisor: Roska, T. Nagy, A.: Algebraic aspects of computation (2003-2006)

Supervisor: Rónyai, L., Ivanyos, G. Nagy, Z.: Emulated CNNUM on FPGS (2000-2004) Supervisor: Szolgay, P. Németh, E.: Modelling and control of discrete event systems using hierarchical Petri nets

Supervisor: Hangos, K.

101

Obi, C.C.: Control of Autonomous Vehicles Supervisor: Bokor, J.

Ottucsák, Gy.: Prediction (2004-2007) Supervisor: Györfi, L. Orlovits, Zs.: Statistical estimation of economic time series

Supervisor: Gerencsér, L. Petres, Z.: Technical Modeling of Cognitive Systems (2004-2007) Supervisor: Baranyi, P. Péni, T.: Nonlinear parameter detection Supervisor: Bokor, J. Pongrácz, B.: Analysis and control of nonlinear process systems described by differential and

algebraic equations Supervisor: Hangos, K. Reskó, B.: Technical Modeling of Cognitive Vision (2004-2007) Supervisor: Baranyi, P. Richter, J.: Algorithmic aspects of optical networks (2003-2006) Supervisor: Friedl, K. Rozgonyi, Sz.: Modelling and conrol of hybrid (switching) process systems (2004-2007) Supervisor: Hangos, K. Rödönyi, G.: Control of LPV systems Supervisor: Bokor, J. Sarlós, T.: Mathematics of the WWW (2003-2006)

Supervisor: Benczúr, A. Schné, T.: Modelling, control and diagnosis of nonlinear process systems (2003-2006) Supervisor: Hangos, K. Sidló, Cs.: Datawarehouses for data mining (2003-2006)

Supervisor: Lukács, A. Sipos, G.: Integrating P-GRADE with service-oriented GRID systems

Supervisor: Kacsuk, P. Szabó, T.: Evolutionary Algorithms in CNN Technology (2000-2004)

Supervisor: Szolgay, P. Szobonya, L.: Reconstruction of free-form surfaces with geometric constraints (2001-2004) Supervisor: Renner, G. Tímár, G.: High-speed Multi-target Tracking and its Applications (2001-2004) Supervisor: Roska, T., Rekeczky, Cs. Torma, P.: Vision based tracking

Supervisor: Szepesvári, Cs. Uher, M.: Mathematics of the WWW (2002-2005)

Supervisor: Benczúr, A. Varga, I.: Advanced controller strategies for traffic control systems and related methods of

their implementation Supervisor: Bokor, J.

Varga, D.: Data Mining (2004-2007) Supervisor: Lukács, A. Varró, G.: Quantum algorithms (2003-2006)

Supervisor: Friedl, K. Wagner, R.: Látórendszer modellezés (2002-2005) Supervisor: Roska, T., Zarándy, Á. Windhager, E.: Searching the Web (2002-2005)

Supervisor: Benczúr, A.

102

APPENDIX 2.

SCIENTIFIC ACTIVITIES

Memberships in international committees International Federation of Automatic Control (IFAC)

Lifetime Advisor (T. Vámos) Chairman of Policy Committee (L. Keviczky) Vice-Chairman Technical Board (J. Bokor) TC on Robust Control (J. Bokor) TC on Fault Detection, Supervision and Safety of Technical Processes, SAFEPROCESS

(J. Bokor, A. Edelmayer) TC on Manufacturing Modelling, Management and Control, M3C ( L. Monostori (Chairman), G. Haidegger, G.L. Kovács) TC on Manufacturing Plant Control (L. Monostori) TC on Stochastic Systems (L. Gerencsér, vice chair) TC in Power Plants and Power Systems (I. Nagy) Hungarian NMO (Cs. Bányász, secretary, J. Bokor, A. Edelmayer,

G. Haidegger, L. Keviczky, G.L. Kovács, L. Monostori)

International Federation of Information Processing (IFIP)

TC 5. (Gy. Kovács) WG5.7 Special Interest Group on Advanced Techniques in Production Planning &

Control (L. Monostori)

Institute of Electrical and Electronics Engineers (IEEE )

IEEE Fellow (J. Demetrovics, T. Vámos) IEEE CAS Society, TC on Cellular neural networks and Array Computing (T. Roska, chairman, P. Szolgay, Á. Zarándy, Cs. Rekeczky) IEEE CAS Society, TC on Multimedia Circuits and Systems (T. Roska) IEEE CAS Society, TC on Nonlinear Circuits and Systems (T. Roska) IEEE Computer Society (L. Monostori) IEEE Computers and Control System Society (T. Bartha, J. Bokor, A. Edelmayer, Z.

Fazekas, P. Gáspár, L. Keviczky, A. Soumelidis, Z. Szabó,) IEEE Information Theory Society (Cs. Bányász) IEEE Control Systems Society Committee on Stochastic Systems (L. Genecsér)

103

International Institution for Production Engineering Research (CIRP)

Member (L. Monostori) Corresponding member (A. Márkus, J. Váncza) Scientific Technical Committee on Optimisation of Manufacturing Systems

(L. Monostori, Vice Chair)

International Academies Academia Europaea (T. Roska) European Academy of Sciences and Arts (L. Keviczky) European Academy of Sciences and Arts (T. Roska) Swedish Royal Academy of Engineering Sciences (L. Keviczky)

Other International Organizations

American Mathematical Society (K. Balla) Association for Logic Programming (S. Kopácsi) Austrian Computer Society (ÖCG) (T. Vámos, Honorary Member) Austrian Society for Cybernetic Studies (ÖSGK) (T. Vámos, Honorary Member) Central European Grid (P. Kacsuk, council member) European Research Consortium for Informatics and Mathematics (ERCIM), Board of

Directors (P. Inzelt), Executive Committee (L. Monostori) ERCIM Working Group on Control and Systems (L. Gerencsér, chairman) ERNSI European Network for System Identification (L. Gerencsér) Danube Adria Association for Automation and Metrology (DAAAM) International

Committee (L. Monostori) European Union Control Association, Hungarian representative (J. Bokor) European Association for Theoretical Computer Science (EATCS) (E. Csuhaj-Varjú,

Gy. Vaszil) European Molecular Computing Consortium (E. Csuhaj-Varjú, Gy. Vaszil, member) Executive Jury of Innovation in Informatics (CASE-EU) (L. Keviczky, member) International Committee of Measurement and Instrumentation (ICMI)

(member L. Monostori) International Society of Applied Intelligence (ISAI) (I. Mezgár, Vice President L.

Monostori) International Society for Difference Equations and their Applications (K. Balla) International Measurement Confederation (IMEKO) TC on Technical Diagnostics

(L. Monostori) Joint Research Center EU (L. Keviczky, member of the Board of Governors) Jury of the International Denise Gabor Prize (L. Keviczky, chairman) Grand Jury of Marie Curie Excellence Awards (L. Keviczky, member) Mathematical Programming Society (T. Rapcsák) NATO Research and Technology Board (J. Bokor) Society for Industrial and Applied Mathematics (SIAM) (K. Balla ) Tensor Society (T. Rapcsák)

104

Membership in Editorial Boards

Artificial Intelligence in Engineering (T. Vámos) Central European Journal of Operational Research (CEJOR) (T. Rapcsák) CIRP Annals (L. Monostori) Combinatorica (Technical Editor, T. Szőnyi) Computers in Industry, Elsevier (L. Monostori, Associate Editor) Computer and Artificial Intelligence, Slovak Academy of Science (P. Kacsuk) Computer Aided Design and Applications (G. Renner) Computer Aided Design (T. Várady) Control Systems Archive (L. Keviczky) Control and Optimization SIAM J (L. Gerencsér) Cybernetics and Systems (T. Vámos) Decision Support Systems (T. Vámos) Discrete Mathematics and Theoretical Computer Science - Electronic Journal

(Zs. Tuza) Discussiones Mathematicae, Graph Theory (Zs. Tuza) ERCIM News (E. Csuhaj-Varjú) Fuzzy Sets and Systems (T. Vámos) Grammars (Kluwer) (E. Csuhaj-Varjú) IEEE Transactions on Image Processing (T. Szirányi) IEEE Transactions on Automatic Control (L. Gerencsér) IEEE Transactions on Circuits and Systems: Fundamental Theory and Applications

(Special Issue Editor: Á. Zarándy) International Journal of Agile Manufacturing (IJAM) (I. Mezgár) International Journal of Advanced Manufacturing Systems (IJAMS) (I. Mezgár) International Journal of Applied Mathematics and Computer Science (A. Edelmayer) International Journal of Pattern Recognition and Artificial Intelligence (D.Csetverikov, associate editor) International Journal Circuit Theory and Applications (T. Roska) International Journal of Simulation Modelling (IJSM) (L. Monostori) International Journal of Studies in Informatics and Control (G.L. Kovács) International Journal on Web and Grid Services (P. Kacsuk) International Abstracts of Operations Research (J. Fülöp) Journal of Emerging Mechanical Engineering Technology (G.L. Kovács, I.Mezgár) Journal of the Franklin Institute (T. Roska) Journal on Circuits, Systems and Computers, Special Issue Editor (Cs. Rekeczky) Journal of Computational Science and Engineering (P. Kacsuk) Journal of Grid Computing, Kluwer (P.Kacsuk) Journal of Global Optimization (T. Rapcsák)

Journal of Optimization Theory and Applications (T. Rapcsák) Machine Graphics & Vision (D. Chetverikov) Mathematical and Physical Journal for Secondary Schools (G. Kós) Modelling and Simulation (L. Keviczky, editorial board) Neural Processing Letters (T. Roska) Parallel and Distributed Computing Practices, Nova Science Publishers (P. Kacsuk)

Production Engineering and Computer, International Journal (L. Monostori) Publications of the Faculty of Electrical Engineering, University of Belgrade, Series

Mathematics (Zs. Tuza)

105

Pure and Applied Mathematics (T. Rapcsák) Membership in Hungarian Academy of Sciences boards and committees

Automation and Computer Science Committee (L. Monostori, G. Renner, T. Várady, J. Váncza secretary)

Board of Natural Sciences (J. Demetrovics, Chairman) Computer and Automation Committee (P. Kacsuk) Computer Science Committee, (chair J. Demetrovics, L. Rónyai, E. Csuhaj-Varjú) Committee for Operations Research (L. Gerencsér) Committee of International Relations (L. Keviczky, co-chairman) Council of Research Institutions (L. Monostori) Information Technology Committee (P. Kacsuk) Informatics and Computer Science Committee (E. Csuhaj-Varjú) Mathematics Committee (J. Demetrovics ) Material Sciences and Technology Committee (G.L. Kovács, G. Haidegger) Meteorological Committee (T. Rapcsák) Operations Research Committee (T. Rapcsák, chair, J. Fülöp) Rerresentative of Doctors in the General Assembly (E. Csuhaj-Varjú)

Membership in other Hungarian boards and committees

Alkalmazott Matematikai Lapok (J. Demetrovics, T. Rapcsák, L. Rónyai, L. Gerencsér) Acta Mathematica Hungarica (J. Demetrovics, L. Rónyai) Acta Cybernetica (J. Demetrovics) Advisory Board of International Dennis Gabor Fellowship (P. Baranyi) Automation Committee of the GTE (Scientific Society of Mechanical Engineers) (G.L. Kovács, I. Mezgár, G. Haidegger) Bolyai János Mathematical Society (K. Balla) Board of the Soros Foundation, Hungary (T. Vámos) Committee for Mathematics at Higher Education Accreditation Committee (K. Balla) Committee for Mathematics at the Hungarian Scientific Research Fund (T. Rapcsák) Doctorate Board of the Technical University of Budapest (J. Bokor) Doctorate Board of the Mechanical Engineering Dept. of the University of Miskolc (G.L. Kovács) Doctorate Board and Doctoral School in Informatics, Eötvös Loránd University

(E. Csuhaj-Varjú) Doctorate Board of Mathematics (T. Rapcsák) Doctoral School on Manufacturing Sciences, BME, Faculty of Mechanical Engineering

(L. Monostori) Doctoral School on Information Sciences, University of Veszprém (L. Monostori) Expert Committee on the Future and Applications of Computer Networks

(G.L. Kovács, G. Haidegger) Formal Methods in Computer Science, VEAB Committee (Zs. Tuza) GTE Manufacturing Systems Division (G. Haidegger, secretary) Habilitation Committee in Applied Mathematics of the Budapest University of

Technology and Economics (T. Rapcsák, K. Balla) Habilitation Committee of Natural Sciences at University of Debrecen (T. Rapcsák)

106

Habilitation Committee at Corvinus University of Budapest (T. Rapcsák) Habilitation Committee of the Technical University of Budapest (J. Bokor) Habilitation Committee of the Technical University of Budapest, Faculty

of Mechanical Engineering (L. Monostori) Hungarian Accreditation Board (J. Bokor) Hungarian Association of Image Processing and Pattern Recognition (D. Chetverikov) Hungarian CERN Committee (Advisory Board P. Kacsuk) Hungarian Doctorate Board (J. Bokor) Hungarian Electronic Journal (K. Balla) Hungarian Grid Competence Centre (P. Kacsuk, director) Hungarian Habilitation Committee (J. Bokor) Hungarian National Science Foundation Board (till May) (L. Keviczky) Hungarian National Science Foundation, Committee of Metallurgy and Manufacturing

(J. Bokor) Hungarian Operations Research Society (T. Rapcsák president, J. Fülöp, secretary,

S. Bozóki, Cs. Mészáros, M. Prill, Zs. Vágó, S.Z. Németh, G. Kéri, S. Márton) Hungarian Society of Measurements and Automation (L. Keviczky, co-president) John von Neumann Computer Society (P. Kacsuk, L. Gulyás) John von Neumann Computer Society (Honorary Chairman: T. Vámos) John von Neumann Computer Society, Computer Graphics and Geometry (G. Renner,

Chairman) Journal on Scientific Inquiry L. Keviczky) Jozsef Hatvany Doctoral School on Information Sciences, University of Miskolc

(P. Kacsuk, L. Monostori) Manufacturing Processes Committee (GTE) (I. Mezgár, secretary) Mathematical Notes, Miskolc (Zs. Tuza) Matematikai Lapok (L. Rónyai) Monitoring Board, National development Office (L. Keviczky) Presidium of the Hungarian Academy of Sciences (L. Keviczky) Science and Technology Policy Advisory Committee of Prime Minister (L. Keviczky) Scientific Board of Central European University, Hungary (T. Vámos) Seminar for Applied Mathematics, Budapest University of Technology and Economics

(G. Molnár-Sáska, secretary) Szigma (J. Fülöp)

107

APPENDIX 3

DEGREES AND AWARDS Keviczky, L. Széchenyi Award in 2004 Kovács, G.L. was awarded the Silver Core of IFIP Kemény, Zs. was awarded the Ph.D. degree Petrás, I. was awarded the Ph.D. degree Bálya, D. was awarded the Ph.D. degree Baranyi, P. got a position of Associate Professor at the Budapest University of Technology

and Economics Chetverikov, D. obtained the title Doctor of Academy (D. Sc.), from the Hungarian

Academy of Sciences. György, A. was awarded a Bolyai Scholarship for 2004-07.

György, A..: ended the tenure of his NATO Science Fellowship at the Department of Mathematics and Statistics, Queen’s University, Kingston, Canada (2003-04).

Gáspár, P. was awarded a Bolyai Scholarship for 2004-07. Szepesvári, Cs. was awarded a Bolyai Scholarship for 2004-07. In 2004 the award of the Research Division (AKE) in 2004 was given to: György, A. Kis, T. Petrás, I. Friedl. K. Csuhaj-Varjú, E. In 2004 the Ph.D. award of the Research Division (AKE) in 2004 was given to: Hilier, D. Csáji, B.

Pongrácz, B.

ANALOGICAL AND NEURAL COMPUTING LABORATORY

Documents

Transcript of ANALOGICAL AND NEURAL COMPUTING LABORATORY