Zimmermann, KarlHeinz
Overview
Works:  54 works in 139 publications in 2 languages and 1,099 library holdings 

Roles:  Author, Other, dg, dgs 
Publication Timeline
.
Most widely held works by
KarlHeinz Zimmermann
DNA computing models by
Zoya Ignatova(
)
17 editions published between 2008 and 2010 in English and held by 565 WorldCat member libraries worldwide
"DNA Computing Models begins with a comprehensive introduction to the field of DNA computing. This book emphasizes computational methods to tackle central problems of DNA computing, such as controlling living cells, building patterns, and generating nanomachines. DNA Computing Models presents laboratoryscale humanoperated models of computation, including a description of the first experiment of DNA computation conducted by Adleman in 1994. It provides molecularscale autonomous models of computation and addresses the design of computational devices working in living cells. It also addresses the important problem of proper word design for DNA computing." "DNA Computing Models is designed for researchers and advancedlevel students in computer science, bioengineering and molecular biology as a reference or secondary textbook. This book is also suitable for practitioners in industry."BOOK JACKET
17 editions published between 2008 and 2010 in English and held by 565 WorldCat member libraries worldwide
"DNA Computing Models begins with a comprehensive introduction to the field of DNA computing. This book emphasizes computational methods to tackle central problems of DNA computing, such as controlling living cells, building patterns, and generating nanomachines. DNA Computing Models presents laboratoryscale humanoperated models of computation, including a description of the first experiment of DNA computation conducted by Adleman in 1994. It provides molecularscale autonomous models of computation and addresses the design of computational devices working in living cells. It also addresses the important problem of proper word design for DNA computing." "DNA Computing Models is designed for researchers and advancedlevel students in computer science, bioengineering and molecular biology as a reference or secondary textbook. This book is also suitable for practitioners in industry."BOOK JACKET
An introduction to protein informatics by
KarlHeinz Zimmermann(
Book
)
5 editions published in 2003 in English and held by 171 WorldCat member libraries worldwide
"An Introduction to Protein Informatics is designed for a professional audience composed of researchers and practitioners within bioinformatics, molecular modeling, algorithm design, optimization, and pattern recognition. This book is also suitable as a graduatelevel text for students in computer science, mathematics, and biomedicine."Jacket
5 editions published in 2003 in English and held by 171 WorldCat member libraries worldwide
"An Introduction to Protein Informatics is designed for a professional audience composed of researchers and practitioners within bioinformatics, molecular modeling, algorithm design, optimization, and pattern recognition. This book is also suitable as a graduatelevel text for students in computer science, mathematics, and biomedicine."Jacket
An introduction to protein informatics by
KarlHeinz Zimmermann(
)
6 editions published in 2003 in English and held by 70 WorldCat member libraries worldwide
Protein informatics is a newer name for an already existing discipline. It encompasses the techniques used in bioinformatics and molecular modeling that are related to proteins. While bioinformatics is mainly concerned with the collection, organization, and analysis of biological data, molecular modeling is devoted to representation and manipulation of the structure of proteins. Protein informatics requires substantial prerequisites on computer science, mathematics, and molecular biology. The approach chosen here, allows a direct and rapid grasp on the subject starting from basic knowledge of algorithm design, calculus, linear algebra, and probability theory. An Introduction to Protein Informatics, a professional monograph will provide the reader a comprehensive introduction to the field of protein informatics. The text emphasizes mathematical and computational methods to tackle the central problems of alignment, phylogenetic reconstruction, and prediction and sampling of protein structure. An Introduction to Protein Informatics is designed for a professional audience, composed of researchers and practitioners within bioinformatics, molecular modeling, algorithm design, optimization, and pattern recognition. This book is also suitable as a graduatelevel text for students in computer science, mathematics, and biomedicine
6 editions published in 2003 in English and held by 70 WorldCat member libraries worldwide
Protein informatics is a newer name for an already existing discipline. It encompasses the techniques used in bioinformatics and molecular modeling that are related to proteins. While bioinformatics is mainly concerned with the collection, organization, and analysis of biological data, molecular modeling is devoted to representation and manipulation of the structure of proteins. Protein informatics requires substantial prerequisites on computer science, mathematics, and molecular biology. The approach chosen here, allows a direct and rapid grasp on the subject starting from basic knowledge of algorithm design, calculus, linear algebra, and probability theory. An Introduction to Protein Informatics, a professional monograph will provide the reader a comprehensive introduction to the field of protein informatics. The text emphasizes mathematical and computational methods to tackle the central problems of alignment, phylogenetic reconstruction, and prediction and sampling of protein structure. An Introduction to Protein Informatics is designed for a professional audience, composed of researchers and practitioners within bioinformatics, molecular modeling, algorithm design, optimization, and pattern recognition. This book is also suitable as a graduatelevel text for students in computer science, mathematics, and biomedicine
PipelineAutomaten by
KarlHeinz Zimmermann(
Book
)
6 editions published in 1987 in German and held by 26 WorldCat member libraries worldwide
6 editions published in 1987 in German and held by 26 WorldCat member libraries worldwide
Beiträge zur algebraischen Codierungstheorie mittels modularer Darstellungstheorie by
KarlHeinz Zimmermann(
Book
)
4 editions published in 1994 in German and held by 26 WorldCat member libraries worldwide
4 editions published in 1994 in German and held by 26 WorldCat member libraries worldwide
Coding theory via Groebner bases by Mehwish Saleemi(
)
1 edition published in 2012 in English and held by 16 WorldCat member libraries worldwide
1 edition published in 2012 in English and held by 16 WorldCat member libraries worldwide
Graphbased methods for the design of DNA computations by
Svetlana Torgasin(
)
2 editions published in 2011 in English and held by 16 WorldCat member libraries worldwide
Die Zuverlässigkeit von DNAbasierten Berechnungen hängt stark ab von den DNASequenzen, die die Informationseinheiten repräsentieren. Eine optimale Zusammensetzung derartiger Sequenzen wird mit konventionellen Rechenverfahren ermittelt. Als Maß für die Sequenzerstellung wird die freie Energie der Hybridizierung zweier DNAEinzelstränge herangezogen. Die Arbeit befasst sich mit zwei Kernpunkten in diesem Bereich. Erstens, mit dem Auffinden einer Sekundärstruktur eines DNA/DNAKomplexes mit minimaler freier Energie. Zu diesem Zweck wurde eine neue graphbasierte Darstellung von DNA/DNAKomplexen erarbeitet. Auf diesem Modell wurden zwei Berechnungsmethoden entwickelt, die auf dem Prinzip der dynamischen Programmierung beruhen. Zweitens, die Validierung der vorgegebenen Menge von DNAWörtern, die die Informationseinheiten eines mathematischen Problems kodieren. Die entwickelte Methode beruht auf der Abschätzung der freien Energie. Sie zielt auf DNABerechnungsmodelle ab, die zwei voneinander abhängige Arten von Informationseinheiten benutzen. Eine weitere Errungenschaft dieser Arbeit bezieht sich auf die Optimierung des Algorithmus' von FloydWarshall, der die kürzesten Wege zwischen je zwei Knoten in einem gewichteten Graphen liefert. Der entwickelte Ansatz führt zu einer Speicherreduktion für den Fall der bipartiten Graphen
2 editions published in 2011 in English and held by 16 WorldCat member libraries worldwide
Die Zuverlässigkeit von DNAbasierten Berechnungen hängt stark ab von den DNASequenzen, die die Informationseinheiten repräsentieren. Eine optimale Zusammensetzung derartiger Sequenzen wird mit konventionellen Rechenverfahren ermittelt. Als Maß für die Sequenzerstellung wird die freie Energie der Hybridizierung zweier DNAEinzelstränge herangezogen. Die Arbeit befasst sich mit zwei Kernpunkten in diesem Bereich. Erstens, mit dem Auffinden einer Sekundärstruktur eines DNA/DNAKomplexes mit minimaler freier Energie. Zu diesem Zweck wurde eine neue graphbasierte Darstellung von DNA/DNAKomplexen erarbeitet. Auf diesem Modell wurden zwei Berechnungsmethoden entwickelt, die auf dem Prinzip der dynamischen Programmierung beruhen. Zweitens, die Validierung der vorgegebenen Menge von DNAWörtern, die die Informationseinheiten eines mathematischen Problems kodieren. Die entwickelte Methode beruht auf der Abschätzung der freien Energie. Sie zielt auf DNABerechnungsmodelle ab, die zwei voneinander abhängige Arten von Informationseinheiten benutzen. Eine weitere Errungenschaft dieser Arbeit bezieht sich auf die Optimierung des Algorithmus' von FloydWarshall, der die kürzesten Wege zwischen je zwei Knoten in einem gewichteten Graphen liefert. Der entwickelte Ansatz führt zu einer Speicherreduktion für den Fall der bipartiten Graphen
Topics in abstract order geometry by
Wolfram Retter(
)
2 editions published between 2013 and 2014 in English and held by 16 WorldCat member libraries worldwide
An interval space is a set with a ternary relation satisfying some axioms that support the interpretation of the ternary relation as location of a point between two points. Some new concepts, including those of a topological, a quadrimodular and a quadrimedian interval space and a geodesic quadrimedian closure are developed. A sufficient criterion for embeddability of an interval space into a median metric space is proved. For two central structure theorems of analysis and algebra it is proved that analogues are valid for quadrimedian spaces, but do not hold in general for median spaces
2 editions published between 2013 and 2014 in English and held by 16 WorldCat member libraries worldwide
An interval space is a set with a ternary relation satisfying some axioms that support the interpretation of the ternary relation as location of a point between two points. Some new concepts, including those of a topological, a quadrimodular and a quadrimedian interval space and a geodesic quadrimedian closure are developed. A sufficient criterion for embeddability of an interval space into a median metric space is proved. For two central structure theorems of analysis and algebra it is proved that analogues are valid for quadrimedian spaces, but do not hold in general for median spaces
LWEbased encryption schemes and their applications in privacyfriendly data aggregation by
Daniela Becker(
)
2 editions published in 2018 in English and held by 15 WorldCat member libraries worldwide
Wir konstruieren neue Verschlüsselungssysteme basierend auf dem Learning With Errors Problem and lösen die folgenden Probleme: Durch datenschutzfreundliche Aggregation lassen sich Daten von mehreren Nutzern unter Wahrung ihrer Privatsphäre aggregieren ohne dem Aggregator zu vertrauen. Unsere Systeme verbessern sowohl Laufzeit als auch Bandbreite der Verschlüsselung, insbesondere die Entschlüsselung ist ca. 150 Mal schneller als zuvor. Überdies stellen wir die erste Lösung für datenschutzfreundliche Werbung auf sozialen Medien vor  unsere Architektur hat hohe Sicherheits und PrivacyGarantien und bietet kryptographische Beweise für die Korrektheit der Ergebnisse
2 editions published in 2018 in English and held by 15 WorldCat member libraries worldwide
Wir konstruieren neue Verschlüsselungssysteme basierend auf dem Learning With Errors Problem and lösen die folgenden Probleme: Durch datenschutzfreundliche Aggregation lassen sich Daten von mehreren Nutzern unter Wahrung ihrer Privatsphäre aggregieren ohne dem Aggregator zu vertrauen. Unsere Systeme verbessern sowohl Laufzeit als auch Bandbreite der Verschlüsselung, insbesondere die Entschlüsselung ist ca. 150 Mal schneller als zuvor. Überdies stellen wir die erste Lösung für datenschutzfreundliche Werbung auf sozialen Medien vor  unsere Architektur hat hohe Sicherheits und PrivacyGarantien und bietet kryptographische Beweise für die Korrektheit der Ergebnisse
Diskrete Mathematik by
KarlHeinz Zimmermann(
Book
)
3 editions published in 2006 in German and Undetermined and held by 14 WorldCat member libraries worldwide
3 editions published in 2006 in German and Undetermined and held by 14 WorldCat member libraries worldwide
Cooperative source seeking and level curve tracking for multiagent systems by Esteban Rosero(
)
1 edition published in 2016 in English and held by 14 WorldCat member libraries worldwide
In this thesis, the cooperative source seeking and the level curve tracking problem using a group of agents under an undirected constrained communication topology are addressed. To solve it, distributed control algorithms enabling agents to drive towards an unknown scalar field's source or to move along a desired scalar field's level curve are proposed. Each agent estimates a gradient direction based only on neighbouring agents' relative position information and scalar field's concentration values at their own location. The control algorithms presented are based on both a formation control component ( keeping agents in a desired geometric driving pattern) and a trajectory control component (steering agents in the source's direction or along the desired level curve). Along this work single and double integrators are considered, as well as linear time invariant (LTI) and nonholonomic systems. Stability conditions and simulation results are provided for single and double integrators, as well as for LTI systems
1 edition published in 2016 in English and held by 14 WorldCat member libraries worldwide
In this thesis, the cooperative source seeking and the level curve tracking problem using a group of agents under an undirected constrained communication topology are addressed. To solve it, distributed control algorithms enabling agents to drive towards an unknown scalar field's source or to move along a desired scalar field's level curve are proposed. Each agent estimates a gradient direction based only on neighbouring agents' relative position information and scalar field's concentration values at their own location. The control algorithms presented are based on both a formation control component ( keeping agents in a desired geometric driving pattern) and a trajectory control component (steering agents in the source's direction or along the desired level curve). Along this work single and double integrators are considered, as well as linear time invariant (LTI) and nonholonomic systems. Stability conditions and simulation results are provided for single and double integrators, as well as for LTI systems
Solving the maximum clique problem via DNA hairpin formation(
)
1 edition published in 2006 in English and held by 13 WorldCat member libraries worldwide
1 edition published in 2006 in English and held by 13 WorldCat member libraries worldwide
CobaltKomplexe eines funktionalisierten CyclopentadienylLiganden by
KarlHeinz Zimmermann(
)
2 editions published in 1990 in German and held by 13 WorldCat member libraries worldwide
2 editions published in 1990 in German and held by 13 WorldCat member libraries worldwide
Computability theory by
KarlHeinz Zimmermann(
)
12 editions published between 2011 and 2017 in English and held by 12 WorldCat member libraries worldwide
Why do we need a formalization of the notion of algorithm or effective computation? In order to show that a specific problem is algorithmically solvable, it is sufficient to provide an algorithm that solves it in a sufficiently precise manner. However, in order to prove that a problem is in principle not solvableby an algorithm, a rigorous formalism is necessary that allows mathematical proofs. The need for such a formalism became apparent in the studies of David Hilbert (1900) on the foundations of mathematics and Kurt Gödel (1931) on the incompleteness of elementary arithmetic. The first investigations in the field were conducted by the logicians Alonzo Church, Stephen Kleene, Emil Post, and Alan Turing in the early 1930s. They have provided the foundation of computability theory as a branch of theoretical computer science. The fundamental results established Turing computability as the correct formalization of the informal idea of effective calculation. The results have led to Church's thesis stating that "everything computable is computable by a Turing machine". The theory of computability has grown rapidly from its beginning. Its questions and methods are penetrating many other mathematical disciplines. Today, computability theory provides an important theoretical background for logicians, pure mathematicians, and computer scientists. Many mathematical problems are known to be undecidable such as the word problem for groups, the halting problem, and Hilbert's tenth problem. This book is a development of class notes for a twohour lecture including a onehour lab held for secondyear Bachelor students of Computer Science at the Hamburg University of Technology during the last two years
12 editions published between 2011 and 2017 in English and held by 12 WorldCat member libraries worldwide
Why do we need a formalization of the notion of algorithm or effective computation? In order to show that a specific problem is algorithmically solvable, it is sufficient to provide an algorithm that solves it in a sufficiently precise manner. However, in order to prove that a problem is in principle not solvableby an algorithm, a rigorous formalism is necessary that allows mathematical proofs. The need for such a formalism became apparent in the studies of David Hilbert (1900) on the foundations of mathematics and Kurt Gödel (1931) on the incompleteness of elementary arithmetic. The first investigations in the field were conducted by the logicians Alonzo Church, Stephen Kleene, Emil Post, and Alan Turing in the early 1930s. They have provided the foundation of computability theory as a branch of theoretical computer science. The fundamental results established Turing computability as the correct formalization of the informal idea of effective calculation. The results have led to Church's thesis stating that "everything computable is computable by a Turing machine". The theory of computability has grown rapidly from its beginning. Its questions and methods are penetrating many other mathematical disciplines. Today, computability theory provides an important theoretical background for logicians, pure mathematicians, and computer scientists. Many mathematical problems are known to be undecidable such as the word problem for groups, the halting problem, and Hilbert's tenth problem. This book is a development of class notes for a twohour lecture including a onehour lab held for secondyear Bachelor students of Computer Science at the Hamburg University of Technology during the last two years
Ökonomische Richtzahlen für Grundmittel der Güllewirtschaft by
KarlHeinz Zimmermann(
Book
)
2 editions published between 1973 and 1978 in German and held by 9 WorldCat member libraries worldwide
2 editions published between 1973 and 1978 in German and held by 9 WorldCat member libraries worldwide
Eine neue Richtungsanalyse und ihre Anwendung bei akustischen Messungen by
KarlHeinz Zimmermann(
Book
)
6 editions published between 1962 and 1963 in German and held by 8 WorldCat member libraries worldwide
6 editions published between 1962 and 1963 in German and held by 8 WorldCat member libraries worldwide
DBees a novel global algorithm for solving word sense disambiguation by
Sallam Abualhaija(
Book
)
1 edition published in 2016 in English and held by 7 WorldCat member libraries worldwide
1 edition published in 2016 in English and held by 7 WorldCat member libraries worldwide
Hinweise zur Gülleüberleitung by H Holjewilken(
Book
)
3 editions published in 1984 in German and held by 6 WorldCat member libraries worldwide
3 editions published in 1984 in German and held by 6 WorldCat member libraries worldwide
Mapping dynamic programming algorithms on graphics processing units by
Muhammad Kashif Hanif(
Book
)
2 editions published in 2014 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 2014 in English and held by 4 WorldCat member libraries worldwide
Algebraic statistics by
KarlHeinz Zimmermann(
)
2 editions published between 2015 and 2016 in English and held by 4 WorldCat member libraries worldwide
Algebraic statistics brings together ideas from algebraic geometry, commutative algebra, and combinatorics to address problems in statistics and its applications. Computer algebra provides powerful tools for the study of algorithms and software. However, these tools are rarely prepared to address statistical challenges and therefore new algebraic results need often be developed. This way of interplay between algebra and statistics fertilizes both disciplines. Algebraic statistics is a relatively new branch of mathematics that developed and changed rapidly over the last ten years. The seminal work in this field was the paper of Diaconis and Sturmfels (1998) introducing the notion of Markov bases for toric statistical models and showing the connection to commutative algebra. Later on, the connection between algebra and statistics spread to a number of different areas including parametric inference, phylogenetic invariants, and algebraic tools for maximum likelihood estimation. These connection were highlighted in the celebrated book Algebraic Statistics for Computational Biology of Pachter and Sturmfels (2005) and subsequent publications. In this report, statistical models for discrete data are viewed as solutions of systems of polynomial equations. This allows to treat statistical models for sequence alignment, hidden Markov models, and phylogenetic tree models. These models are connected in the sense that if they are interpreted in the tropical algebra, the famous dynamic programming algorithms (NeedlemanWunsch, Viterbi, and Felsenstein) occur in a natural manner. More generally, if the models are interpreted in a higher dimensional analogue of the tropical algebra, the polytope algebra, parametric versions of these dynamic programming algorithms can be established. Markov bases allow to sample data in a given fibre using Markov chain Monte Carlo algorithms. In this way, Markov bases provide a means to increase the sample size and make statistical tests in inferential statistics more reliable. We will calculate Markov bases using Groebner bases in commutative polynomial rings. The manuscript grew out of lectures on algebraic statistics held for Master students of Computer Science at the Hamburg University of Technology. It appears that the first lecture held in the summer term 2008 was the first course of this kind in Germany. The current manuscript is the basis of a fourhour introductory course. The use of computer algebra systems is at the heart of the course. Maple is employed for symbolic computations, Singular for algebraic computations, and R for statistical computations. The second edition at hand is just a streamlined version of the first one.$cen$dAbstract
2 editions published between 2015 and 2016 in English and held by 4 WorldCat member libraries worldwide
Algebraic statistics brings together ideas from algebraic geometry, commutative algebra, and combinatorics to address problems in statistics and its applications. Computer algebra provides powerful tools for the study of algorithms and software. However, these tools are rarely prepared to address statistical challenges and therefore new algebraic results need often be developed. This way of interplay between algebra and statistics fertilizes both disciplines. Algebraic statistics is a relatively new branch of mathematics that developed and changed rapidly over the last ten years. The seminal work in this field was the paper of Diaconis and Sturmfels (1998) introducing the notion of Markov bases for toric statistical models and showing the connection to commutative algebra. Later on, the connection between algebra and statistics spread to a number of different areas including parametric inference, phylogenetic invariants, and algebraic tools for maximum likelihood estimation. These connection were highlighted in the celebrated book Algebraic Statistics for Computational Biology of Pachter and Sturmfels (2005) and subsequent publications. In this report, statistical models for discrete data are viewed as solutions of systems of polynomial equations. This allows to treat statistical models for sequence alignment, hidden Markov models, and phylogenetic tree models. These models are connected in the sense that if they are interpreted in the tropical algebra, the famous dynamic programming algorithms (NeedlemanWunsch, Viterbi, and Felsenstein) occur in a natural manner. More generally, if the models are interpreted in a higher dimensional analogue of the tropical algebra, the polytope algebra, parametric versions of these dynamic programming algorithms can be established. Markov bases allow to sample data in a given fibre using Markov chain Monte Carlo algorithms. In this way, Markov bases provide a means to increase the sample size and make statistical tests in inferential statistics more reliable. We will calculate Markov bases using Groebner bases in commutative polynomial rings. The manuscript grew out of lectures on algebraic statistics held for Master students of Computer Science at the Hamburg University of Technology. It appears that the first lecture held in the summer term 2008 was the first course of this kind in Germany. The current manuscript is the basis of a fourhour introductory course. The use of computer algebra systems is at the heart of the course. Maple is employed for symbolic computations, Singular for algebraic computations, and R for statistical computations. The second edition at hand is just a streamlined version of the first one.$cen$dAbstract
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Ignatova, Zoya Author
 MartinezPerez, Israel Marck
 Technische Universität HamburgHarburg Institut für Rechnertechnologie
 Technische Universität HamburgHarburg Other Degree grantor
 Achtziger, Wolfgang 1965 Author
 Technische Universität Hamburg Institute of Embedded Systems Other Editor
 Ignatova, Zoya
 Retter, Wolfram Author
 Torgasin, Svetlana Author
 Saleemi, Mehwish Author
Useful Links
Associated Subjects
Bioinformatics Cheminformatics Chemistry Coding theory Computer algorithms Computer industry Computers Computer science Information theory Mathematical optimization Medicine Molecular computers Natural computation Optical pattern recognition ProteinsStructureComputer simulation ProteinsStructureMathematical models Statistics Systolic array circuits
Covers
Alternative Names
KarlHeinz Zimmermann Duits wiskundige
KarlHeinz Zimmermann German mathematician
KarlHeinz Zimmermann Informatikprofessor
KarlHeinz Zimmermann matemático alemán
KarlHeinz Zimmermann mathématicien allemand
KarlHeinz Zimmermann tysk matematikar
KarlHeinz Zimmermann tysk matematiker
Zimmermann, K.H. 1956
КарлХайнц Циммерман
Languages