Forschungsbericht 2009

E-13 Rechnertechnologie

Kooperationen

• Entwicklung eines Betriebssystems für smart cards, PAV CARD GmbH
• High Speed spectral data acquisition and classification system, ZEUTEC Opto-Elektronik GmbH, Rendsburg, seit 2007.
• Iterative Numerische Methoden und Hardware-gestützte Rekonstruktion, Philips Technologie, seit 2006.
• Konzeption, Entwicklung und Fertigung von DSP-Halbleiterplatinenprototypen für den Bereich Sonar und Unterwasserkommunikation, ELAC Nautik, Kiel, seit 2004.
• Rechner-Infrastruktur für flexibles Sitzsystem, Bishop GmbH, HH, seit 2006.
• WISSENS- UND EREIGNISMUSTERGESTÜTZTE TECHNOLOGIE ZUR VORBEUGENDEN WARTUNG, (EADS) Airbus, 2003-2007.

Publikationen

Veröffentlichungen

• 4-11.001V
  

  F. Mayer-Lindenberg: A Parallel Computer based on Simple DSP Modules. Microprocessing and Microprogramming 41 (1995), 301-314

• 4-11.002V
  

  F. Mayer-Lindenberg: Kommunikation und Arbeitsteilung in einem experimentellen Parallelrechner. Interner Report, www.tu-harburg.de/ti6/forschung/pentagon

• 4-11.005V
  

  Rolf Wöhrmann and Ludger Solbach: Preprocessing for the automated transcription of polyphonic music: linking wavelet theory and auditory filtering. Revised reprint of the paper presented at the ICMC95 in Banff, Canada

• 4-11.006V
  

  Ludger Solbach and Rolf Wöhrmann: Sound Onset Localization and Partial Tracking in Gaussian White Noise. Paper presented at the ICMC-96 in Hongkong

• 4-11.007V
  

  Ludger Solbach, Rolf Wöhrmann and Jörg Kliewer: The complex-valued continuous wavelet transform as a preprocessor for auditory scene analysis. Revised reprint of the paper presented at the IJCAI-95 workshop on Computational Auditory Scene Analysis, Montreal

• 4-11.008V
  

  Ludger Solbach: Partial Tone Tracking and Onset Localization in Single Channel Audio Signal Mixes. 106th AES convention, Munich, 1999

• 4-11.009V
  

  Dr. Hartmut Weber: Navigation einfacher mobiler Roboter mit Handskizzen. Spektrum der Wissenschaft, Dossier 4/1998

• 4-11.010V
  

  F. Mayer-Lindenberg: Homogeneous Networks for Invariant processing. Interner Report

• 4-11.012V
  

  Otto Wohlmuth: A new Dense Group Graph Discovered by an Evolutionary Approach. Published at the 4. Workshop: Paralleles und Verteiltes Rechnen, Technische Universität Braunschweig, Institut für Wissenschaftliches Rechnen, Okt. 1996

• 4-11.013V
  

  Otto Wohlmuth: A General Method for the Configuration of Crossbar Networks. Published at the International Conference Signal Processing and Communication, Gran Canaria/Spain, Feb. 1998

• 4-11.014V
  

  O. Wohlmuth, F. Mayer-Lindenberg: A Method for the Embedding of Arbitrary Communication Topologies into configurable Parallel Computers. 1998 ACM Symposium on Applied Computing, Special Track on Coordination Models, Languages and Applications, Atlanta, Georgia/USA

• 4-11.015V
  

  O. Wohlmuth, F. Mayer-Lindenberg: Application-specific Configuration of Crossbar Networks Parallel Computers. Accepted at the IASTED International Conference on Networks and Communication Systems, 1998, Pittsburgh, PA, USA

• 4-11.016V
  

  F. Mayer-Lindenberg: Passive Crossbar Interconnection for Parallel DSP. SHARC'99 conference

• 4-11.017V
  

  F. Mayer-Lindenberg: A Parallel Computer based on Simple DSP Modules. Microprocessing and Microprogramming 41 (1995), 301-314

• 4-11.018V
  

  F. Mayer-Lindenberg: Kommunikation und Arbeitsteilung in einem experimentellen Parallelrechner. Interner Report, www.tu-harburg.de/ti6/forschung/pentagon

• 4-11.019V
  

  F. Mayer-Lindenberg: A large parallel system and its programmin einvironment. ICSPAT 1997, San Diego, USA

• 4-11.020V
  

  F. Mayer-Lindenberg: A Heterogeneous Parallel System Employing a Configurable Interconnection Network. PDCS 1997, Washington, USA

• 4-11.021V
  

  F. Mayer-Lindenberg: High Level Systesis Oriented Controll Architecture. ARCS'97, Rostock

• 4-11.022V
  

  F. Mayer-Lindenberg: The Design of an Efficient Stack Processor on a FPGA using a new HDL. IWLAS 1996, Grenoble

• 4-11.023V
  

  F. Mayer-Lindenberg: A Universal Architecture for Parallel Embedded Systems. PDPTA'98 Conference, Las Vegas/Nevada, USA

• 4-11.024V
  

  F. Mayer-Lindenberg: Crossbar Design for a Super FPGA Architecture. PACT'98, Paris/Frankreich

• 4-11.025V
  

  F. Mayer-Lindenberg: DRAM Coprocessor to the Super FPGA Architecture, preprint

• 4-11.026V
  

  F. Mayer-Lindenberg: A Common Interactive Programming Environment for Microprocessor and FPGA Programming. 1996 Workshop on Custom Computing of the GI/ITG, Chemnitzer Informatik-Berichte

• 4-11.027V
  

  F. Mayer-Lindenberg: A Design and Simulation Environment for Digital Systems. PDPTA'98 Conference, Las Vegas/Nevada, USA

• 4-11.028V
  

  F. Mayer-Lindenberg: Hardware to Software Mapping and Resource Allocation in a Programming Tool for Embedded Multiprocessor Systems. CASES'99

• 4-11.029V
  

  F. Mayer-Lindenberg: Programming mixed HW/SW systems. Internes Konzeptpapier ELLA-Report

• 4-11.030V
  

  K.-H. Zimmermann, R.A. Liebler: Combinatorial Sn-modules as codes. J.Algeb.Combinat, Vol. 4, 1995, 47-68

• 4-11.031V
  

  K.-H. Zimmermann: Hecke modules as linear block codes and block m-PSK modulation codes. Proc. 1995th IEEE Symp. Inform. Theory, Whistler, 1995

• 4-11.032V
  

  K.-H. Zimmermann: On generalizations of repeated-root cyclic codes. IEEE Trans. Inform. Theory, Vol. IT-42, 1996, 641-649

• 4-11.033V
  

  K.-H. Zimmermann: Linear mappings of n-dimensional uniform recurrences onto k-dimensional systolic arrays. J.VLSI Signal Processing Systems, Vol. 12, 1996, 187-202

• 4-11.034V
  

  K.-H. Zimmermann, W. Achtziger: Synthesizing regular arrays from single affine recurrences via quadratic and branching parametric linear programming. Parcella'96, Akademie Verlag, Leipzig, 1996, 224-231

• 4-11.035V
  

  K.-H. Zimmermann, W. Achtziger: A branching linear programming approach for the mapping of systems of n-dimensional affine recurrences onto k-dimensional systolic arrays. Proc. 4th Workshop PASA'96, World Scientific, Singapore 1997, 247-258

• 4-11.036V
  

  K.-H. Zimmermann, W. Achtziger: Findings space-time transformation for uniform recurrences via branching parametric linear programming. J. VLSI Signal Processing Systems, Vol. 15, 1997, 259-274

• 4-11.037V
  

  K.-H. Zimmermann: A unified lattice-based approach for the decomposition of systolic arrays via LSGP and LPGS. J. VLSI Signal Processing Systems, Vol. 17, 1997, 21-42

• 4-11.038V
  

  K.-H. Zimmermann, W. Achtziger: Optimal polynomial schedules for recurrence equations: An approach via non-smooth optimization. Proc. First Int. Workshop on Approximate Reasoning in Scheduling (ARS'97), (Ed.) W. Slany, Int. Comp. Sci. Conventions (ICSC), Academic Press, Millet, Alberta, Kanada, 1997, 4-10

• 4-11.039V
  

  K.-H. Zimmermann, W. Achtziger: On time optimal implementation of uniform recurrences onto array processors via quadratic programming. J. VLSI Signal Processing Systems, Vol. 19, 1998, 19-38

• 4-11.040V
  

  K.-H. Zimmermann, mehrere Co-Autoren: Codierungstheorie - Konstruktion und Anwendung linearer Codes. Springer Verlag, 1998

• 4-11.041V
  

  K.-H. Zimmermann: Parallelizing the search for good linear codes. ARCS'99: Workshops zur Architektur von Rechensystemen, Jena, 1999, 203-210

• 4-11.042V
  

  K.-H. Zimmermann, Koautor W. Achtziger: Optimal quadratic schedules for affine recurrence equations via nonsmooth optimization. J.VLSI Signal Processing Vol. 25, 2000, 235-260

• 4-11.043V
  

  K.-H. Zimmermann, Koautor Suresh Babu, New good codes via CQUEST - A system for the silicon search of linear codes. Proc. Alcoma'99, LNCS, Springer, 273-285, 2000

• 4-11.044V
  

  K.-H.Zimmermann: On optimal linear LSGP-partitioning strategies. Techn.Report 1-90, Princeton Universität, Princeton, NJ, 1990

• 4-11.045V
  

  K.-H.Zimmermann, W.Achtziger: A branching linear programming approach for the mapping of systems of n-dimensional affine recurrences onto k-dimensional systolic arrays. Techn. Report No. 172, Universität Erlangen-Nürnberg, 1996

• 4-11.046V
  

  K.-H.Zimmermann, W.Achtziger: Finding space-time transformations for uniform recurrences via branching parametric linear programming. Techn.Report No.168, Universität Erlangen-Nürnberg 1996

• 4-11.047V
  

  K.-H.Zimmermann, W. Achtziger: Synthesizing regular arrays from single affine recurrences via quadratic and branching parametric linear programming. Techn.Report No. 174, Universität Erlangen-Nürnberg 1996

• 4-11.048V
  

  K.-H.Zimmermann, W. Achtziger: On time optimal implementation of uniform recurrences onto array processors via quadratic programming. Techn.Report No.204, Universität Erlangen-Nürnberg, 1996

• 4-11.049V
  

  K.H.Zimmermann, W.Achtziger: On optimal piecewise linear schedules for LSGP- and LPGS-partitioning of array processors via quadratic programming. Techn.Report No. 202, Universität Erlangen-Nürnberg, 1996

• 4-11.050V
  

  K.-H.Zimmermann, W.Achtziger: The scheduling problem for recurrence equations: A computational approach via non-smooth optimization. Techn.Report No.200, Universität Erlangen-Nürnberg, 1996

• 4-11.051V
  

  K.-H.Zimmermann: Integral Hecke modules, integral generalized Reed-Muller codes and linear codes. Techn.Report No. 96.3, TU Hamburg-Harburg, 1996

• 4-11.052V
  

  K.-H.Zimmermann, versch. Co-Autoren: Das ELLA 2000 Mikrocontroller-Projekt, Techn.Report No. 97.1, TU Hamburg-Harburg, 1997

• 4-11.053V
  

  K.-H.Zimmermann: On a class of double coset codes. Techn.Report No.97.2, TU Hamburg-Harburg, 1997

• 4-11.054V
  

  K.-H.Zimmermann: Einführung in den Hardware-Entwurf mit ELLA. Techn.Report No.98.2, TU Hamburg-Harburg, 1998

• 4-11.055V
  

  K.-H.Zimmermann: Computing time-optimal quadratic schedules for affine recurrence equations. Techn.Report No.243, Universität Erlangen-Nürnberg, 1998

• 4-11.056V
  

  K.-H.Zimmermann: Optimal schedules for recurrence equations via continuous optimization methods. Reports and Skripts No.5, Universität Erlangen-Nürnberg, 1999

• 4-11.057V
  

  K.-H.Zimmermann: A short introduction to quaternary codes. Techn.Report No.99.3, TU Hamburg-Harburg, 1999

• 4-11.058V
  

  F. Mayer-Lindenberg: Techniques for an Integrated Development of Digital Systems based on Programmable Processors and configurable Logic. SSGRR 2000, L'Aquila/Italien

• 4-11.059V
  

  F. Mayer-Lindenberg: Distributed memory architecture for a network of simple CPUs. 9th Intern.Colloq.on Num.Analysis and Computer Science with Applications 2000, Plovdiv/Bulgarien

• 4-11.060V
  

  F. Mayer-Lindenberg: A Modell of Distributed Processes sutitable for Parallel Embedded Systems, PDCS'2000, Las Vegas/USA

• 4-11.061V
  

  K.-H. Zimmermann, Koautor A. Popp: On the Synthesis of Array Processors from Nested Loops with Affine Dependencies. Erscheint in Computer Physics Communications

• 4-11.062V
  

  K.-H. Zimmermann: DNA Algorithms for Binary Linear Codes. Techn. Report No. 2000.1, TU Hamburg-Harburg

• 4-11.064V
  

  Thomas, S., and Weberpals, H.: Requirements of Parallel Simulation on Parallel Architectures. Proc. Int. Seminar on Parallel Processing. Ghent, 2000.

• 4-11.065V
  

  S. Thomas and H. Weberpals:Adaptivity and parallelism in semiconductor device simulationIn: Proc. Int. conf. Parallel Comput. 2001, London (2001) in press

• 4-11.066V
  

  J. Köhnlein und H. WeberpalsSoftwarearchitektur verteilter 3D-SimulationssystemeGI Parallel-Algorithmen und Rechnerstrukturen 18 (2001)

• 4-11.067V
  

  Karl-Heinz Zimmermann, Suresh Babu:A General Decoding Scheme for Linear Codes over Galois Rings.IEEE Trans. Inform. Theory, Sept. 2001

• 4-11.068V
  

  Karl-Heinz Zimmermann, Wolfgang Achtziger:Optimal Piecewise Linear Schedules for LSGP- und LPGS-Decomposed Array Processors via Quadratic Programming.Computer Physics Communications, Vol. 139, 64-89, 2001

• 4-11.069V
  

  Karl-Heinz Zimmermann, Andreas Popp:On Loop Transformations of Nest Loops with Affine Dependencies.Computer Physics Communications, Vol. 139, 90-103, 2001

• 4-11.070V
  

  Karl-Heinz Zimmermann:On Applying Molecular Computation to Binary Linear Codes.IEEE Trans. Inform. Theory, Vol. 48, No. 2, 505-509, 2002

• 4-11.071V
  

  Karl-Heinz Zimmermann, Wolfgang Achtziger, Andreas Popp:Optimizing Linear Vector-valued Schedules for loop Nests.Proceedings PARS, München, 2001

• 4-11.072V
  

  Karl-Heinz ZimmermannEfficient DNA Sticker Algorithms for Graph Theoretic Problemserscheint in Computer Physics Communications

• 4-11.073V
  

  Karl-Heinz Zimmermann:The Patch Selection Problem and Discrete Stochastic Dynamic Programming.Techn. Report No. 01.1 der TU Hamburg-Harburg, Januar 2001

• 4-11.074V
  

  Karl-Heinz Zimmermann, Tina Lai

  A Software Platform for the DNA Sticker ModelTechn. Report No. 01.2 der TU Hamburg-Harburg, März 2001

• 4-11.075V
  

  S. Wallner, K. von der Heide:A Universal Processor for High Speed CommunicationProceedings of the International conference on Communications in Computing, CIC 2001, Las Vegas, Nevada USA, June 25-28 2001, CSREA Press, Vol. 1, pp. 86-92

• 4-11.076V
  

  P. Batra:Simultaneous point estimates for Newton's method,BIT 2002, Vol 42, No. 3, pp.467-476

• 4-11.077V
  

  Karl-Heinz Zimmermann: Efficient DANN sticker algorithms for NP-complete graph problems. Comp. Phys. Comm. 144 (2002), 297-309

• 4-11.078V
  

  Karl-Heinz Zimmermann: On applying molecular computation to binary linear codes. IEEE Trans. Inform. theory 48 (2002), 505-509

• 4-11.079V
  

  Markus Volkmer, Boris Banke: Pulse-induced masking of sonagrams for the enhancement of speech. Proceedings of XI European Signal processing Conference Vol. 1, 483-486, 2002

• 4-11.080V
  

  Jan Köhnlein: Secure Multicasting for Distributed Virtual Einvironments. G.Joubert et al (eds): Proc.Int. Seminar Parallel Computing - Grids and Applications, pp.107-122, Gent 2002

• 4-11.082V
  

  Markus Volkmer: "A pulsed neural network model of spectro-temporal receptive fields and population coding in auditory cortex"Proceedings of the Workshop on the Future of Neural Networks, FUNN2003 ,July 5th, 2003, Eindhoven, The Netherlands

• 4-11.083V
  

  Markus Volkmer: "Neural Speech Enhancement in the Time-Frequency Domain"Proceedings of the 2003 IEEE Signal Processing Society International Workshop on Neural Networks for Signal Processing, NNSP2003,September 17-19th, 2003, Toulouse, France,pp. 617IEEE Catalog Number: 03TH8718C, ISBN: 0-7803-8178-5, ISSN: 1089-3555

• 4-11.084V
  

  S. Wallner: "A Reconfigurable Multi-threaded Architecture Model", Eighth Asia-Pacific Computer Systems Architecture Conference, ACSAC'2003, Fukushima, Japan, 23-26 September 2003, A. Omondi & S. Sedukhin (eds.), Lecture Notes in Computer Science 2823, pp. 193-207, Springer 2003

• 4-11.085V
  

  Batra, Prashant: "On necessary conditions for Real Robust Stability"IEEE Transactions on Automatic Control, Vol. 48, No. 2, Februaray 2003, pp. 259-261

• 4-11.086V
  

  Batra, Prashant: "On Coefficient Diameters of Real Schur-Stable Polynomials"Proc. International IFAC Symposium RoCoND '03 Milano, June 2003, Pusblisher: Elsevier Science Ltd.

• 4-11.087V
  

  Batra, Prashant: "On upper Bounds for Real Proportional Stabilising Controllers"Proc. European Control Conference Cambridge, September 2003, Pusblisher: IEEE

• 4-11.088V
  

  Karl-Heinz Zimmermann: An Introduction to Protein InformaticsKluwer Int. Series in Eng. and comp. Sci., Vol. 749, 304pp., 2003

• 4-11.089V
  

  Karl-Heinz Zimmermann: A special purpose array processor architecture for the molecular dynamics simulation of point-mutated proteinsJ. VLSI Signal Processing, 35:297-309, 2003

• 4-11.090V
  

  Jan Köhnlein: "Security in a Peer-to-Peer Distributed Virtual Environment" To appear in: Proceedings of the ParCo2003 Conference, 2.-5. Sept 2003, Dresden (Germany)

• 4-11.092V
  
  • W. Achtziger, K.-H. Zimmermann: Optimization and parallelization of loop nests via linear vector-valued schedules. Techn. Report, No. 264, Uni Dortmund, 2004.

  • P. Batra: Bound for all coefficient diameters of real Schur-stable interval polynomials, IEEE Transactions on Automatic Control, vol.49, no.10, pp.1851-1852, 2004.

  • P. Batra: On Small Circles Containing the Zeros and Ones of Analytic Functions, Complex Variables: Theory and Applications, vol.49, no.11, pp.787-791, 2004.

  • P. Batra: Real interpolating units via positive functions, Proc. MTNS 2004, LEUWEN, BELGIUM, 2004.

  • P. Batra: A property of the nearly optimal root-bound, Journal of Computational and Applied Mathematics, vol.167 (2),pp.489-491, 2004.

  • M. Volkmer, S. Wallner: A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks, Proc. of the 2nd German Workshop on Mobile Ad-hoc Networks, WMAN 2004, Beiträge der 34. Jahrestagung der Gesellschaft für Informatik e.V. (GI)GI Jahrestagung Informatik 2004, 2. Deutscher Workshop über Mobile Ad-hoc Netzwerke (WMAN 2004), Ulm, Germany, 2004.

  • S. Wallner: A Configurable System-on-Chip Architecture for Embedded Devices, Ninth Asia-Pacific Computer Systems Architecture Conference (ACSAC'2004), Beijing, China, Sep. 7-9, Lecture Notes in Computer Science 3189, pp. 58-71, Springer, 2004.

  • S. Wallner: Configurable System-on-Chip Architecture with Descriptors for Dynamic Reconfiguration, In Proceedings of the 3rd International Conference on Embedded Systems and Applications (ESA'04), CSREA Press, Las Vegas, Volume 1, pp. 157-163, 2004.

  • S. Wallner: Design Methodology of a Configurable System-on-Chip Architecture, Proceedings of IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'04), Computer Society Press, Napa, CA, 2004.

  • P.Owotoki, A. Grimm: Convergence of clients of communications systems, in Proc. of the International Wireless Congress 2004: Systems & Applications, ZVEI Elektronika, ICM Munich, 2004.

  • A. Schaumburg: Authentication within Tree Parity Machine Rekeying, 1. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2004, Universität Mannheim, Reihe Informatik, Technical Report TR 2004-10, Stefan Lucks and Christopher Wolf eds. , p.13, 2004.

  • M. Volkmer: A pulsed neural network model of spectro-temporal receptive fields and population coding in auditory cortex (extended version), Natural Computing - An International Journal, 3 (2), Kluwer Academic Publishers, pp. 177-193, 2004.
    
    
    
• 4-11.094V
  
  • K.-H. Zimmermann: Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble. Computer Physics C ommunications, 165, 243-259, 2005.

  • K. Elssel, K.-H. Zimmermann: Two new nonlinear binary codes. IEEE Trans. Inform. Theory, 51, 1189-1190, 2005.

  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Self assembly of DNA molecules. Techn. Report, 05.1, TUHH, 2005.

  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: A programmable computing machine operating autonomously at the molecular scale. Techn. Report, 05.2 , TUHH, 2005.

  • P. Batra: Value-Restricted Functions and Robust Control Requirements, GAMM, Luxemburg, 2005.

  • B. Soudan, W. Adi, A. Hanoun: Novel secret-key IPR protection in FPGA environment, SOC Conference Proceedings, IEEE International, 2005.

  • B. Soudan, W. Adi, A. Hanoun: Customer-IP Provider Centric Secret-Key IPR Protection for FPGA IP Cores, IEEE 2005 Conference on Field-Programmable Technology (FPT), 2005.

  • S. Wallner: Micro-Task Processing in Heterogeneous Reconfigurable Systems, Journal of Computer Science and Technology (JCST), Special Section on Advanced Computer Systems Architecture (ACSAC), Vol. 20, No. 5, pp. 624-634, Springer Science, ISSN: 1000-9000 (Paper) 1860-4749 (Online), 2005.

  • S. Wallner: A Configurable System-on-Chip Architecture for Embedded and Real-Time Applications: Concepts, Design and Realization, Elsevier Journal of Systems Architecture, Vol. 51, Issues 6-7, pp. 350-367, 2005.

  • M. Volkmer, S. Wallner: Tree Parity Machine Rekeying Architectures, IEEE Transactions on Computers, Vol. 54 No. 4, pp. 421-427, IEEE Computer Society, 2005.

  • M. Volkmer, S. Wallner: A Key Establishment IP-Core for Ubiquitous Computing, Proceedings of the 1st International Workshop on Secure and Ubiquitous Networks, SUN'05 , Copenhagen Business School, Copenhagen, Denmark, IEEE Computer Society, pp. 241-245, ISBN 0-7695-2424-9, 2005.

  • M. Volkmer, S. Wallner: Lightweight Key Exchange and Stream Cipher based solely on Tree Parity Machines, ECRYPT (European Network of Excellence for Cryptology) Workshop on RFID and Lightweight Crypto, Graz University of Technology, Graz, Austria pp. 102-113, http://eprint.iacr.org/2005/232. 2005.

  • P. Owotoki, F. Mayer-Lindenberg: Degree of Confidence Measure for Integrating Non Monolithic Intelligence Models. in Proc. of the 3rd International Conference on Computational Intelligence, Robotics and Autonomous Systems (CIRAS), Singapore, 2005.

  • P. Owotoki: Embedded Intelligence in Wireless Sensor Networks, in Proc. of the Wireless Congress 2005, ZVEI Elektronika, Munich, 2005.

  • P. Owotoki, F. Mayer-Lindenberg: Comprehensible Hierarchical Intelligent (CHI) Framework for Monitoring and Preventive Maintenance of Aircraft Systems, in Proceedings of the 3rd IEEE WISES, Hamburg, 2005.

  • M. Volkmer, F. Grewe: Runners, Starting Lines and Mutual Distances: On the Security of Tree Parity Machine Key Exchange, 3. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2005, Technische Universität Darmstadt, Fachbereich Informatik, Technical Report No. TI-1/05, Ralf-Philipp Weinmann ed., p.5, 2005.

  • B. Saballus: Secure Group Communication in WLAN Ad-Hoc Networks with Tree Parity Machines, 2. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2005, Universität Ulm, Ulmer Informatik-Berichte Nr. 2005-02, K.U.Leuven, Technical Report ESAT-COSIC 2005-CW-1, Wolfgang Lindner and Christopher Wolf eds. , p.12, 2005.

  • N. Behroozi: Immediate Rekeying by Tree Parity Machines in a WLAN-System, 2. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2005, Universität Ulm, Ulmer Informatik-Berichte Nr. 2005-02, K.U.Leuven, Technical Report ESAT-COSIC 2005-CW-1, Wolfgang Lindner and Christopher Wolf eds. , p.10, 2005.

  • M. Volkmer, S. Wallner: Tree Parity Machine Rekeying Architectures for Embedded Security, http://eprint.iacr.org/2005/235, 2005.

  • M. Volkmer, S. Wallner: Lightweight Key Exchange and Stream Cipher based solely on Tree Parity Machines, ECRYPT (European Network of Excellence for Cryptology) Workshop on RFID and Lightweight Crypto, Graz University of Technology, Graz, Austria, pp. 102-113, http://eprint.iacr.org/2005/232, 2005.

  • M. Volkmer: Theoretical Analysis of a Time-Frequency-PCNN Auditory Cortex Model, The International Journal of Neural Systems, 15 (5), World Scientific Publishing Co. Pte Ltd, pp. 339-348, 2005.
    
    
• 4-11.096V
  
  • W. Adi, A. Hanoun, R. Ernst, B. Soudan : VLSI Design Exchange with Intellectual Property Protection in FPGA Environment Using both Secret and Public-Key Cryptography, ISVLSI, Karlsruhe, Germany, 2006.

  • A. Hanoun, W. Adi, F. Mayer-Lindenberg, B. Soudan: Fuzzy Modular Multiplication Architecture and Low Complexity IPR-Protection for FPGA Technology, ICFPT 2006, Bangkok, Thailand, 2006.

  • P. Batra: Subordination and Stabilization of Plant families, Proc. IFAC Symposium RoConD 06, IFAC Symposium Robust Control '06 - Toulouse, 2006.

  • P. Batra: Necessary stability conditions for differential-difference systems, GAMM, Berlin, 2006.

  • P. Batra: On upper bounds for proportional stabilizing controllers, ZAMM vol. 86,No.1, pp.78-84 ,2006.

  • A. Hanoun, W. Galjan, W.H. Krautschneider, F. Mayer-Lindenberg: Distributed Processor Network on Single Chip, ProRISC2006 Workshop, Veldhoven (The Netherlands), 2006.

  • F. Grewe, P. Owotoki: Automated Model Selection with AMSF in a Production Process of the Automotive Industry. 15th Workshop on Knowledge Discovery, Data Mining, and Machine Learning (KDML 2006) Hildesheim, Germany, 2006.

  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: An autonomous DNA model for finite state automata. Techn. Report, 06.1, TUHH, 2006.

  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Solving the maximum clique problem via DNA haiprin formation. Techn. Report, 06.3, TUHH, 2006.

  • I. Martinez-Perez, Z. Ignatova, Z. Gong, K.-H. Zimmermann: Solving the Hamiltonian path problem via DNA hairpin formation. Int. J. Bioinformatics Research Applications, 1:389-398, 2006.

  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: An autonomous DNA model for stochastic finite state automata. Techn. Report, 06.2, TUHH, 2006.

  • P. Owotoki, N. Manojlovic, F. Mayer-Lindenberg, E. Pasche: A Data Mining Approach for Capacity Building of Stakeholders in Integrated Flood Management, The Sixth IEEE International Conference on Data Mining (ICDM 2006) Hong Kong, China, 2006.

  • P. Owotoki, F. Mayer-Lindenberg: Transparency of Computational Intelligence Models, The Twenty-sixth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (A1-2006), Cambridge, U.K., 2006.

  • S. Mühlbach, M. Volkmer, S. Wallner: Encrypted and Authenticated Communication via Tree-Parity Machines in AMBA Bus Systems, 4. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2006, Ruhr-Universität Bochum, Horst-Görtz-Institut für IT-Sicherheit, Technical Report No. NDS-1/06, Ulrich Greveler (Hrsg.), p.10, 2006.

  • A. Ruttor, M. Volkmer: Theorie und Anwendungen von Tree Parity Machines für die Kryptographie, Kryptowochenende 2006 - Workshop über Kryptographie, Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2006, Universität Mannheim, Institut für Informatik, Technical Report TR-2006-013, Reihe Informatik, Frederik Armknecht, Dirk Stegemann (Hrsg.), p.20-22, 2006.

  • K. Tyss: Generatoren für echte Zufallszahlen auf FPGAs für eingebettete Systeme, 5. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2006, Universität Kassel, Fachbereich Mathematik/Informatik, Mathematische Schriften Kassel 06/06, Heiko Stamer (Hrsg.), p.4, 2006.

  • M. Volkmer, S. Wallner: Ein IP-Core Design für Schlüsselaustausch, Stromchiffre und Identifikation auf ressourcenbeschränkten Geräten, Workshop "Kryptographie in Theorie und Praxis", 3. Jahrestagung Fachbereich Sicherheit der Gesellschaft für Informatik O.-von-Guericke Universität Magdeburg, 20.-22. Februar 2006, Lecture Notes in Informatics (LNI) Vol. P-770, Bonner Köllen Verlag, pp. 294-298, 2006.

  • M. Volkmer: On proving Completeness, Soundness and Security of Authenticated Tree Parity Machine Key Exchange, 4. Krypto-Tag der Gesellschaft für Informatik e.V. - Fachgruppe KRYPTO 2006, Ruhr-Universität Bochum, Horst-Görtz-Institut für IT-Sicherheit, Technical Report No. NDS-1/06, Ulrich Greveler (Hrsg.), p.5, 2006.

  • M. Volkmer: Entity Authentication and Authenticated Key Exchange with Tree Parity Machines, http://eprint.iacr.org/2006/112, 2006.

  • M. Volkmer: A Pulsed Neural Network Model of Spectro-Temporal Receptive Fields and its Application to Speech Enhancement, Dissertation, Hamburg University of Technology, Mensch und Buch Verlag, Berlin, ISBN 3-86664-155-9 / 978-3-86664-155-6, 2006.

  • K.-H. Zimmermann: Diskrete Mathematik, BoD, Norderstedt, 300 S., 2006.

  • F. Mayer-Lindenberg: Design and Application of a scalable embedded systems architecture and related OS support, DSD 2006, Cavtat, Kroatien, 2006.

  • V. Beller, F. Mayer-Lindenberg: A floating point processor arry supporting a high-precision dot product, ICFPT 2006.
    
    
• 4-11.098V
  
  • P. Batra: On Goldberg's constant A_2, Computational Methods and Function Theory Vol. 7, No.1, pp.33-41, 2007
    

  • A. Hanoun, H. Manteuffel, F. Mayer-Lindenberg, W. Galjan: Architecture of a Pipelined Datapath Coarse-Grain Reconfigurable Coprocessor Array. 2007 IEEE Int Conf Signal Proc Comm, Dubai, United Arab Emirates, 2007.
    

  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Computational genes: A tool for molecular diagnosis and therapy of aberrant mutational phenotype. BMC Bioinformatics, 8:365, 2007
    

  • I. Martinez-Perez, W. Brandt, B. Thielmann, M. Wild, K.-H. Zimmermann: Parallel bioinspired algorithms for NP-complete graph problems on FPGA architectures. PARS, 2007.

  • B. Saballus, M. Volkmer, S. Wallner: Secure Group Communication in Ad-Hoc Networks using Tree Parity Machines, Proc. of the 4th Workshop on Mobile Ad-Hoc Networks (WMAN 2007), Bern, Schweiz, 2007.
    
    
• 4.11.104V
  
  • P. Batra: Newton's method and the computational complexity of the fundamental theorem of algebra. Electronic Notes in Theoretical Computer Science (ENTCS), 2008.
  • A.Hanoun, F. Mayer-Lindenberg, B.Soudan: Reconfigurable cell architecture for systolic and pipelined computing datapaths. Reconfig08, Mexico, 2008.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: DNA Computing Models. Springer, 300 p, 2008.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Computational genes. Wikipedia, 2008.
  • C.S. Bassoy, H. Manteuffel, F. Mayer-Lindenberg: SHARF: An FPGA-based customizable processor architecture. Int Conf Field Programmable Logic & Applications (FPL'09), 516-520, 2009.
  • C.S. Bassoy, W. Yang, S. Torgasin, K.-H. Zimmermann: Accelerating scalar-product based sequence alignment using graphics processor units. J Sig Proc Syst, 1939-8115 (online), 2009.
  • I. Martinez-Perez, W. Brandt, M. Wild, K.-H. Zimmermann: Bioinspired parallel algorithms for maximum clique problem on FPGA architectures. J Sig Proc Syst, 1939-8115 (online), 2009.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: An autonomous DNA model for finite state automata. Int J Bioinform Res App, Vol. 5, No. 1, 81-96, 2009.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Exploiting the features of finite state automata for biomolecular computing. J Recent Patents DNA & Gene Sequences, 3(2):130-138, 2009.
  • I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: DNA Computing Models. Springer, 300 p., chinese translation, 2009.
  • I. Martinez-Perez, K.-H. Zimmermann: Parallel bioinspired algorithms for NP complete graph problems. J Par Distr Comp, 69, 3:221-229, 2009.
  • O. Reyes, I. Kopitzke, K.-H. Zimmermann: Permutation parity machines for neural synchronization. J Physics A: Math Theor, 42, 195002, 2009.
  • O. Reyes K.-H. Zimmermann: Key exhange protocol using permutation parity machines. IJCCI 2009, 496-501, 2009.

Dissertationen

• 4-11.003D
  

  Henry Koplien: Spezifikationssprache für die Prädiktion des Zeitverhaltens von verteilten Systemen

• 4-11.004D
  

  Ludger Solbach: An Architecture for Robust Partial Tracking and Onset Localization in Single Channel Audio Signal Mixes

• 4-11.011D
  

  Otto Wohlmuth: Konzepte zur Konstruktion und anwendungsspezifischen Konfiguration von Prozessornetzwerken (2000)

• 4-11.063D
  

  Thomas, S.: Parallele Simulation auf adaptiven Gitterstrukturen am Beispiel von Halbleiterbauelementen. Dissertation, TUHamburg-Harburg, April 2000

• 4-11.077D
  

  Andreas Popp:Parallelisierung von Laufschleifen mit Hilfe unimodularer AbbildungenFebruar 2002

• 4-11.097D
  

  Israel Martinez-Perez: Biomolecular Computing Models for Graph Problems and Finite State Automata, 2007
  

• 4-11.078D
  

  Sebastian Wallner,Configurable System-on-Chip Architecture for Streaming and real-Time Applications in Embedded Devices, 2005

• 4-11.079D
  

  Rawat Siripokarpirom,Run-Time Reconfigurable Co-Emulation for Hardware-Assisted Functional Verification and test of FPGA Designs, 2006

• 4-11.080D
  

  Markus Volkmer, A Pulsed Neural Network Model of Spectro-Temporal Receptive Fields and its Application to Speech Enhancement, 2006

• 4-11.098D
  

  Peter Olatunde Owotoki, Transparent Computational Intelligence (CI) Models for Health States Monitoring of Complex Systems 2007

Habilitationen

• 4-11.300H
  

  P. Batra: Some Applications of Complex Analysis to Questions of Stability and Stabilizability, Habilitationsschrift, Hamburg, 2006.
  

Patente

• 4-11.100P
  

  M. Volkmer, S. Wallner, K.-H. Zimmermann: Tree Parity Machines - Ein Verfahren zum sicheren Datentransfer mittels neuronaler Netze. Deutsches Patent, 2005

• 4-11.101P
  

  F. Mayer-Lindenberg, Verfahren zur maschinenbefehl- und programmgestützten Steuerung von Prozessoren, 2007
  

• 4-11.102P
  

  I. Martinez-Perez, Z. Ignatova, K.-H. Zimmermann: Rechengene. Deutsches Patent, 2007