---
_id: '8268'
abstract:
- lang: eng
text: The overall aim of this paper is a proposal how to bridge the gap between
formal specification techniques developed in research projects and semi--formal
or informal specifications used in industrial practice. The main idea to overcome
these problems is to develop graphical support for formal methods in order to
increase acceptance by practitioners and to provide means for integration of formal
and semi--formal methods. More specifically suitable concepts will be developed
to combine algebraic specifications, Petri Nets, and Graph Grammars with each
other and with distinguished graphical components to be used by industrial partners.
author:
- first_name: Bernhard
full_name: Bardohl, Bernhard
last_name: Bardohl
- first_name: Roswitha
full_name: Bardohl, Roswitha
last_name: Bardohl
- first_name: Paulo
full_name: Castro, Paulo
last_name: Castro
- first_name: Hartmut
full_name: Ehrig, Hartmut
last_name: Ehrig
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
- first_name: Leila
full_name: Ribeiro, Leila
last_name: Ribeiro
- first_name: Daltro
full_name: Nunes, Daltro
last_name: Nunes
- first_name: Alfio
full_name: Martini, Alfio
last_name: Martini
citation:
ama: 'Bardohl B, Bardohl R, Castro P, et al. GRAPHIT: Graphical Support and Integration
of Formal and Semiformal Methods for Software Specification and Development. In:
Proceedings of the 3rd German-Brazilian Workshop on Information Technology
(1995), Berlin (Germany). Vol 26. Bilateral Seminars of the International
Bureau. Forschungszentrum Jülich GmbH; 1995.'
apa: 'Bardohl, B., Bardohl, R., Castro, P., Ehrig, H., Heckel, R., Ribeiro, L.,
… Martini, A. (1995). GRAPHIT: Graphical Support and Integration of Formal and
Semiformal Methods for Software Specification and Development. In Proceedings
of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin
(Germany) (Vol. 26). Forschungszentrum Jülich GmbH.'
bibtex: '@inproceedings{Bardohl_Bardohl_Castro_Ehrig_Heckel_Ribeiro_Nunes_Martini_1995,
series={Bilateral Seminars of the International Bureau}, title={GRAPHIT: Graphical
Support and Integration of Formal and Semiformal Methods for Software Specification
and Development}, volume={26}, booktitle={Proceedings of the 3rd German-Brazilian
Workshop on Information Technology (1995), Berlin (Germany)}, publisher={Forschungszentrum
Jülich GmbH}, author={Bardohl, Bernhard and Bardohl, Roswitha and Castro, Paulo
and Ehrig, Hartmut and Heckel, Reiko and Ribeiro, Leila and Nunes, Daltro and
Martini, Alfio}, year={1995}, collection={Bilateral Seminars of the International
Bureau} }'
chicago: 'Bardohl, Bernhard, Roswitha Bardohl, Paulo Castro, Hartmut Ehrig, Reiko
Heckel, Leila Ribeiro, Daltro Nunes, and Alfio Martini. “GRAPHIT: Graphical Support
and Integration of Formal and Semiformal Methods for Software Specification and
Development.” In Proceedings of the 3rd German-Brazilian Workshop on Information
Technology (1995), Berlin (Germany), Vol. 26. Bilateral Seminars of the International
Bureau. Forschungszentrum Jülich GmbH, 1995.'
ieee: 'B. Bardohl et al., “GRAPHIT: Graphical Support and Integration of
Formal and Semiformal Methods for Software Specification and Development,” in
Proceedings of the 3rd German-Brazilian Workshop on Information Technology
(1995), Berlin (Germany), 1995, vol. 26.'
mla: 'Bardohl, Bernhard, et al. “GRAPHIT: Graphical Support and Integration of Formal
and Semiformal Methods for Software Specification and Development.” Proceedings
of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin
(Germany), vol. 26, Forschungszentrum Jülich GmbH, 1995.'
short: 'B. Bardohl, R. Bardohl, P. Castro, H. Ehrig, R. Heckel, L. Ribeiro, D. Nunes,
A. Martini, in: Proceedings of the 3rd German-Brazilian Workshop on Information
Technology (1995), Berlin (Germany), Forschungszentrum Jülich GmbH, 1995.'
date_created: 2019-03-04T11:52:19Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
intvolume: ' 26'
language:
- iso: eng
publication: Proceedings of the 3rd German-Brazilian Workshop on Information Technology
(1995), Berlin (Germany)
publisher: Forschungszentrum Jülich GmbH
series_title: Bilateral Seminars of the International Bureau
status: public
title: 'GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods
for Software Specification and Development'
type: conference
user_id: '52534'
volume: 26
year: '1995'
...
---
_id: '8269'
abstract:
- lang: eng
text: Currently existing graph grammar-based specification languages have serious
problems with supporting any kind of “specification-in-the-large” activities.
More precisely, they have deficiencies with respect to modeling hierarchical data
structures or specifying meta activities like manipulation of graph schemata.
Furthermore, already proposed graph grammar module concepts are still too abstract
to be useful in practice. Our contribution addresses these problems by introducing
a new hierarchical graph data model with an infinite number of schema, meta-schema,
etc. layers. It forms the base for a forthcoming concrete modular graph grammar
specification language where in addition information hiding aspects like explicit
export and import interfaces are expressible.
author:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Andy
full_name: Schürr, Andy
last_name: Schürr
citation:
ama: 'Engels G, Schürr A. Encapsulated Hierarchical Graphs, Graph Types, and Meta
Types. In: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph
Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy). Electronic Notes
in Theoretical Computer Science. Amsterdam, The Netherlands: Elsevier; 1995:101-109.
doi:http://dx.doi.org/10.1016/S1571-0661(05)80186-0'
apa: 'Engels, G., & Schürr, A. (1995). Encapsulated Hierarchical Graphs, Graph
Types, and Meta Types. In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop
on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy) (pp.
101–109). Amsterdam, The Netherlands: Elsevier. http://dx.doi.org/10.1016/S1571-0661(05)80186-0'
bibtex: '@inproceedings{Engels_Schürr_1995, place={Amsterdam, The Netherlands},
series={Electronic Notes in Theoretical Computer Science}, title={Encapsulated
Hierarchical Graphs, Graph Types, and Meta Types}, DOI={http://dx.doi.org/10.1016/S1571-0661(05)80186-0},
booktitle={Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA 1995), Volterra (Italy)}, publisher={Elsevier}, author={Engels,
Gregor and Schürr, Andy}, year={1995}, pages={101–109}, collection={Electronic
Notes in Theoretical Computer Science} }'
chicago: 'Engels, Gregor, and Andy Schürr. “Encapsulated Hierarchical Graphs, Graph
Types, and Meta Types.” In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop
on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), 101–9.
Electronic Notes in Theoretical Computer Science. Amsterdam, The Netherlands:
Elsevier, 1995. http://dx.doi.org/10.1016/S1571-0661(05)80186-0.'
ieee: G. Engels and A. Schürr, “Encapsulated Hierarchical Graphs, Graph Types, and
Meta Types,” in Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph
Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), 1995, pp. 101–109.
mla: Engels, Gregor, and Andy Schürr. “Encapsulated Hierarchical Graphs, Graph Types,
and Meta Types.” Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on
Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), Elsevier,
1995, pp. 101–09, doi:http://dx.doi.org/10.1016/S1571-0661(05)80186-0.
short: 'G. Engels, A. Schürr, in: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
Elsevier, Amsterdam, The Netherlands, 1995, pp. 101–109.'
date_created: 2019-03-04T11:52:20Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1016/S1571-0661(05)80186-0
language:
- iso: eng
page: 101-109
place: Amsterdam, The Netherlands
publication: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA 1995), Volterra (Italy)
publisher: Elsevier
series_title: Electronic Notes in Theoretical Computer Science
status: public
title: Encapsulated Hierarchical Graphs, Graph Types, and Meta Types
type: conference
user_id: '52534'
year: '1995'
...
---
_id: '8270'
author:
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
- first_name: Annika
full_name: Wagner, Annika
last_name: Wagner
citation:
ama: 'Heckel R, Wagner A. Ensuring Consistency of Conditional Graph Grammars - A
constructive Approach. In: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop
on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy). Vol
2. Electronic Notes in Theoretical Computer Science. Elsevier; 1995:118-126. doi:http://dx.doi.org/10.1016/S1571-0661(05)80188-4'
apa: Heckel, R., & Wagner, A. (1995). Ensuring Consistency of Conditional Graph
Grammars - A constructive Approach. In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)
(Vol. 2, pp. 118–126). Elsevier. http://dx.doi.org/10.1016/S1571-0661(05)80188-4
bibtex: '@inproceedings{Heckel_Wagner_1995, series={Electronic Notes in Theoretical
Computer Science}, title={Ensuring Consistency of Conditional Graph Grammars -
A constructive Approach}, volume={2}, DOI={http://dx.doi.org/10.1016/S1571-0661(05)80188-4},
booktitle={Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA 1995), Volterra (Italy)}, publisher={Elsevier}, author={Heckel,
Reiko and Wagner, Annika}, year={1995}, pages={118–126}, collection={Electronic
Notes in Theoretical Computer Science} }'
chicago: Heckel, Reiko, and Annika Wagner. “Ensuring Consistency of Conditional
Graph Grammars - A Constructive Approach.” In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
2:118–26. Electronic Notes in Theoretical Computer Science. Elsevier, 1995. http://dx.doi.org/10.1016/S1571-0661(05)80188-4.
ieee: R. Heckel and A. Wagner, “Ensuring Consistency of Conditional Graph Grammars
- A constructive Approach,” in Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
1995, vol. 2, pp. 118–126.
mla: Heckel, Reiko, and Annika Wagner. “Ensuring Consistency of Conditional Graph
Grammars - A Constructive Approach.” Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
vol. 2, Elsevier, 1995, pp. 118–26, doi:http://dx.doi.org/10.1016/S1571-0661(05)80188-4.
short: 'R. Heckel, A. Wagner, in: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
Elsevier, 1995, pp. 118–126.'
date_created: 2019-03-04T11:52:21Z
date_updated: 2022-01-06T07:03:53Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1016/S1571-0661(05)80188-4
intvolume: ' 2'
language:
- iso: eng
page: 118-126
publication: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA 1995), Volterra (Italy)
publisher: Elsevier
series_title: Electronic Notes in Theoretical Computer Science
status: public
title: Ensuring Consistency of Conditional Graph Grammars - A constructive Approach
type: conference
user_id: '52534'
volume: 2
year: '1995'
...
---
_id: '8354'
author:
- first_name: H.-Hugo
full_name: Kremer, H.-Hugo
id: '15280'
last_name: Kremer
citation:
ama: 'Kremer H-H. Existenzgründung. In: Braukmann U, Diettrich A, Kremer H-H, Sloane
PFE, Stickling E, eds. Meisterprüfung - Lernen für die Praxis - Unternehmensführung
1. 1st ed. Düsseldorf; 1995:19-94.'
apa: Kremer, H.-H. (1995). Existenzgründung. In U. Braukmann, A. Diettrich, H.-H.
Kremer, P. F. E. Sloane, & E. Stickling (Eds.), Meisterprüfung - Lernen
für die Praxis - Unternehmensführung 1 (1st ed., pp. 19–94). Düsseldorf.
bibtex: '@inbook{Kremer_1995, place={Düsseldorf}, edition={1}, title={Existenzgründung},
booktitle={Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1}, author={Kremer,
H.-Hugo}, editor={Braukmann, U. and Diettrich, A. and Kremer, H.-H. and Sloane,
P.F.E. and Stickling, E.Editors}, year={1995}, pages={19–94} }'
chicago: Kremer, H.-Hugo. “Existenzgründung.” In Meisterprüfung - Lernen für
die Praxis - Unternehmensführung 1, edited by U. Braukmann, A. Diettrich,
H.-H. Kremer, P.F.E. Sloane, and E. Stickling, 1st ed., 19–94. Düsseldorf, 1995.
ieee: H.-H. Kremer, “Existenzgründung,” in Meisterprüfung - Lernen für die Praxis
- Unternehmensführung 1, 1st ed., U. Braukmann, A. Diettrich, H.-H. Kremer,
P. F. E. Sloane, and E. Stickling, Eds. Düsseldorf, 1995, pp. 19–94.
mla: Kremer, H. Hugo. “Existenzgründung.” Meisterprüfung - Lernen für die Praxis
- Unternehmensführung 1, edited by U. Braukmann et al., 1st ed., 1995, pp.
19–94.
short: 'H.-H. Kremer, in: U. Braukmann, A. Diettrich, H.-H. Kremer, P.F.E. Sloane,
E. Stickling (Eds.), Meisterprüfung - Lernen für die Praxis - Unternehmensführung
1, 1st ed., Düsseldorf, 1995, pp. 19–94.'
date_created: 2019-03-06T11:11:56Z
date_updated: 2022-01-06T07:03:53Z
department:
- _id: '211'
edition: '1'
editor:
- first_name: U.
full_name: Braukmann, U.
last_name: Braukmann
- first_name: A.
full_name: Diettrich, A.
last_name: Diettrich
- first_name: H.-H.
full_name: Kremer, H.-H.
last_name: Kremer
- first_name: P.F.E.
full_name: Sloane, P.F.E.
last_name: Sloane
- first_name: E.
full_name: Stickling, E.
last_name: Stickling
language:
- iso: ger
page: 19-94
place: Düsseldorf
publication: Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1
status: public
title: Existenzgründung
type: book_chapter
user_id: '44715'
year: '1995'
...
---
_id: '16510'
abstract:
- lang: eng
text: In an array of coupled oscillators, synchronous chaos may occur in
the sense that all the oscillators behave identically although the corresponding
motion is chaotic. When a parameter is varied this fully symmetric dynamical state
can lose its stability, and the main purpose of this paper is to investigate which
type of dynamical behavior is expected to be observed once the loss of stability
has occurred. The essential tool is a classification of Lyapunov exponents based
on the symmetry of the underlying problem. This classification is crucial in the
derivation of the analytical results but it also allows an efficient computation
of the dominant Lyapunov exponent associated with each symmetry type. We show
how these dominant exponents determine the stability of invariant sets possessing
various instantaneous symmetries, and this leads to the idea of symmetry breaking
bifurcations of chaotic attractors. Finally, the results and ideas are illustrated
for several systems of coupled oscillators.
author:
- first_name: Philip J.
full_name: Aston, Philip J.
last_name: Aston
- first_name: Michael
full_name: Dellnitz, Michael
last_name: Dellnitz
citation:
ama: Aston PJ, Dellnitz M. Symmetry Breaking Bifurcations of Chaotic Attractors.
International Journal of Bifurcation and Chaos. 1995:1643-1676. doi:10.1142/s021812749500123x
apa: Aston, P. J., & Dellnitz, M. (1995). Symmetry Breaking Bifurcations of
Chaotic Attractors. International Journal of Bifurcation and Chaos, 1643–1676.
https://doi.org/10.1142/s021812749500123x
bibtex: '@article{Aston_Dellnitz_1995, title={Symmetry Breaking Bifurcations of
Chaotic Attractors}, DOI={10.1142/s021812749500123x},
journal={International Journal of Bifurcation and Chaos}, author={Aston, Philip
J. and Dellnitz, Michael}, year={1995}, pages={1643–1676} }'
chicago: Aston, Philip J., and Michael Dellnitz. “Symmetry Breaking Bifurcations
of Chaotic Attractors.” International Journal of Bifurcation and Chaos,
1995, 1643–76. https://doi.org/10.1142/s021812749500123x.
ieee: P. J. Aston and M. Dellnitz, “Symmetry Breaking Bifurcations of Chaotic Attractors,”
International Journal of Bifurcation and Chaos, pp. 1643–1676, 1995.
mla: Aston, Philip J., and Michael Dellnitz. “Symmetry Breaking Bifurcations of
Chaotic Attractors.” International Journal of Bifurcation and Chaos, 1995,
pp. 1643–76, doi:10.1142/s021812749500123x.
short: P.J. Aston, M. Dellnitz, International Journal of Bifurcation and Chaos (1995)
1643–1676.
date_created: 2020-04-15T07:23:50Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '101'
doi: 10.1142/s021812749500123x
language:
- iso: eng
page: 1643-1676
publication: International Journal of Bifurcation and Chaos
publication_identifier:
issn:
- 0218-1274
- 1793-6551
publication_status: published
status: public
title: Symmetry Breaking Bifurcations of Chaotic Attractors
type: journal_article
user_id: '15701'
year: '1995'
...
---
_id: '16532'
author:
- first_name: M
full_name: Dellnitz, M
last_name: Dellnitz
- first_name: C
full_name: Heinrich, C
last_name: Heinrich
citation:
ama: Dellnitz M, Heinrich C. Admissible symmetry increasing bifurcations. Nonlinearity.
1995:1039-1066. doi:10.1088/0951-7715/8/6/009
apa: Dellnitz, M., & Heinrich, C. (1995). Admissible symmetry increasing bifurcations.
Nonlinearity, 1039–1066. https://doi.org/10.1088/0951-7715/8/6/009
bibtex: '@article{Dellnitz_Heinrich_1995, title={Admissible symmetry increasing
bifurcations}, DOI={10.1088/0951-7715/8/6/009},
journal={Nonlinearity}, author={Dellnitz, M and Heinrich, C}, year={1995}, pages={1039–1066}
}'
chicago: Dellnitz, M, and C Heinrich. “Admissible Symmetry Increasing Bifurcations.”
Nonlinearity, 1995, 1039–66. https://doi.org/10.1088/0951-7715/8/6/009.
ieee: M. Dellnitz and C. Heinrich, “Admissible symmetry increasing bifurcations,”
Nonlinearity, pp. 1039–1066, 1995.
mla: Dellnitz, M., and C. Heinrich. “Admissible Symmetry Increasing Bifurcations.”
Nonlinearity, 1995, pp. 1039–66, doi:10.1088/0951-7715/8/6/009.
short: M. Dellnitz, C. Heinrich, Nonlinearity (1995) 1039–1066.
date_created: 2020-04-15T08:25:12Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '101'
doi: 10.1088/0951-7715/8/6/009
language:
- iso: eng
page: 1039-1066
publication: Nonlinearity
publication_identifier:
issn:
- 0951-7715
- 1361-6544
publication_status: published
status: public
title: Admissible symmetry increasing bifurcations
type: journal_article
user_id: '15701'
year: '1995'
...
---
_id: '16542'
author:
- first_name: M
full_name: Dellnitz, M
last_name: Dellnitz
- first_name: I
full_name: Melbourne, I
last_name: Melbourne
citation:
ama: Dellnitz M, Melbourne I. A note on the shadowing lemma and symmetric periodic
points. Nonlinearity. 1995:1067-1075. doi:10.1088/0951-7715/8/6/010
apa: Dellnitz, M., & Melbourne, I. (1995). A note on the shadowing lemma and
symmetric periodic points. Nonlinearity, 1067–1075. https://doi.org/10.1088/0951-7715/8/6/010
bibtex: '@article{Dellnitz_Melbourne_1995, title={A note on the shadowing lemma
and symmetric periodic points}, DOI={10.1088/0951-7715/8/6/010},
journal={Nonlinearity}, author={Dellnitz, M and Melbourne, I}, year={1995}, pages={1067–1075}
}'
chicago: Dellnitz, M, and I Melbourne. “A Note on the Shadowing Lemma and Symmetric
Periodic Points.” Nonlinearity, 1995, 1067–75. https://doi.org/10.1088/0951-7715/8/6/010.
ieee: M. Dellnitz and I. Melbourne, “A note on the shadowing lemma and symmetric
periodic points,” Nonlinearity, pp. 1067–1075, 1995.
mla: Dellnitz, M., and I. Melbourne. “A Note on the Shadowing Lemma and Symmetric
Periodic Points.” Nonlinearity, 1995, pp. 1067–75, doi:10.1088/0951-7715/8/6/010.
short: M. Dellnitz, I. Melbourne, Nonlinearity (1995) 1067–1075.
date_created: 2020-04-15T08:46:30Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '101'
doi: 10.1088/0951-7715/8/6/010
language:
- iso: eng
page: 1067-1075
publication: Nonlinearity
publication_identifier:
issn:
- 0951-7715
- 1361-6544
publication_status: published
status: public
title: A note on the shadowing lemma and symmetric periodic points
type: journal_article
user_id: '15701'
year: '1995'
...
---
_id: '16550'
author:
- first_name: Michael
full_name: Dellnitz, Michael
last_name: Dellnitz
- first_name: Michael
full_name: Field, Michael
last_name: Field
- first_name: Martin
full_name: Golubitsky, Martin
last_name: Golubitsky
- first_name: Jun
full_name: Ma, Jun
last_name: Ma
- first_name: Andreas
full_name: Hohmann, Andreas
last_name: Hohmann
citation:
ama: Dellnitz M, Field M, Golubitsky M, Ma J, Hohmann A. Cycling Chaos. International
Journal of Bifurcation and Chaos. 1995:1243-1247. doi:10.1142/s0218127495000909
apa: Dellnitz, M., Field, M., Golubitsky, M., Ma, J., & Hohmann, A. (1995).
Cycling Chaos. International Journal of Bifurcation and Chaos, 1243–1247.
https://doi.org/10.1142/s0218127495000909
bibtex: '@article{Dellnitz_Field_Golubitsky_Ma_Hohmann_1995, title={Cycling Chaos},
DOI={10.1142/s0218127495000909},
journal={International Journal of Bifurcation and Chaos}, author={Dellnitz, Michael
and Field, Michael and Golubitsky, Martin and Ma, Jun and Hohmann, Andreas}, year={1995},
pages={1243–1247} }'
chicago: Dellnitz, Michael, Michael Field, Martin Golubitsky, Jun Ma, and Andreas
Hohmann. “Cycling Chaos.” International Journal of Bifurcation and Chaos,
1995, 1243–47. https://doi.org/10.1142/s0218127495000909.
ieee: M. Dellnitz, M. Field, M. Golubitsky, J. Ma, and A. Hohmann, “Cycling Chaos,”
International Journal of Bifurcation and Chaos, pp. 1243–1247, 1995.
mla: Dellnitz, Michael, et al. “Cycling Chaos.” International Journal of Bifurcation
and Chaos, 1995, pp. 1243–47, doi:10.1142/s0218127495000909.
short: M. Dellnitz, M. Field, M. Golubitsky, J. Ma, A. Hohmann, International Journal
of Bifurcation and Chaos (1995) 1243–1247.
date_created: 2020-04-15T09:04:16Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '101'
doi: 10.1142/s0218127495000909
language:
- iso: eng
page: 1243-1247
publication: International Journal of Bifurcation and Chaos
publication_identifier:
issn:
- 0218-1274
- 1793-6551
publication_status: published
status: public
title: Cycling Chaos
type: journal_article
user_id: '15701'
year: '1995'
...
---
_id: '16551'
abstract:
- lang: eng
text: Spiral patterns have been observed experimentally, numerically, and
theoretically in a variety of systems. It is often believed that these spiral
wave patterns can occur only in systems of reaction–diffusion equations. We show,
both theoretically (using Hopf bifurcation techniques) and numerically (using
both direct simulation and continuation of rotating waves) that spiral wave patterns
can appear in a single reaction–diffusion equation [ in u(x, t)] on a disk, if
one assumes "spiral" boundary conditions (ur = muθ).
Spiral boundary conditions are motivated by assuming that a solution is infinitesimally
an Archimedian spiral near the boundary. It follows from a bifurcation analysis
that for this form of spirals there are no singularities in the spiral pattern
(technically there is no spiral tip) and that at bifurcation there is a steep
gradient between the "red" and "blue" arms of the spiral.
author:
- first_name: Michael
full_name: Dellnitz, Michael
last_name: Dellnitz
- first_name: Martin
full_name: Golubitsky, Martin
last_name: Golubitsky
- first_name: Andreas
full_name: Hohmann, Andreas
last_name: Hohmann
- first_name: Ian
full_name: Stewart, Ian
last_name: Stewart
citation:
ama: Dellnitz M, Golubitsky M, Hohmann A, Stewart I. Spirals in Scalar Reaction–Diffusion
Equations. International Journal of Bifurcation and Chaos. 1995:1487-1501.
doi:10.1142/s0218127495001149
apa: Dellnitz, M., Golubitsky, M., Hohmann, A., & Stewart, I. (1995). Spirals
in Scalar Reaction–Diffusion Equations. International Journal of Bifurcation
and Chaos, 1487–1501. https://doi.org/10.1142/s0218127495001149
bibtex: '@article{Dellnitz_Golubitsky_Hohmann_Stewart_1995, title={Spirals in Scalar
Reaction–Diffusion Equations}, DOI={10.1142/s0218127495001149},
journal={International Journal of Bifurcation and Chaos}, author={Dellnitz, Michael
and Golubitsky, Martin and Hohmann, Andreas and Stewart, Ian}, year={1995}, pages={1487–1501}
}'
chicago: Dellnitz, Michael, Martin Golubitsky, Andreas Hohmann, and Ian Stewart.
“Spirals in Scalar Reaction–Diffusion Equations.” International Journal of
Bifurcation and Chaos, 1995, 1487–1501. https://doi.org/10.1142/s0218127495001149.
ieee: M. Dellnitz, M. Golubitsky, A. Hohmann, and I. Stewart, “Spirals in Scalar
Reaction–Diffusion Equations,” International Journal of Bifurcation and Chaos,
pp. 1487–1501, 1995.
mla: Dellnitz, Michael, et al. “Spirals in Scalar Reaction–Diffusion Equations.”
International Journal of Bifurcation and Chaos, 1995, pp. 1487–501, doi:10.1142/s0218127495001149.
short: M. Dellnitz, M. Golubitsky, A. Hohmann, I. Stewart, International Journal
of Bifurcation and Chaos (1995) 1487–1501.
date_created: 2020-04-15T09:05:30Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '101'
doi: 10.1142/s0218127495001149
language:
- iso: eng
page: 1487-1501
publication: International Journal of Bifurcation and Chaos
publication_identifier:
issn:
- 0218-1274
- 1793-6551
publication_status: published
status: public
title: Spirals in Scalar Reaction–Diffusion Equations
type: journal_article
user_id: '15701'
year: '1995'
...
---
_id: '16566'
author:
- first_name: Dany
full_name: Breslauer, Dany
last_name: Breslauer
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Devdatt P.
full_name: Dubhashi, Devdatt P.
last_name: Dubhashi
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison
model lower bounds to the parallel-random-access-machine. Information Processing
Letters. 1995:103-110. doi:10.1016/s0020-0190(97)00032-x
apa: Breslauer, D., Czumaj, A., Dubhashi, D. P., & Meyer auf der Heide, F. (1995).
Transforming comparison model lower bounds to the parallel-random-access-machine.
Information Processing Letters, 103–110. https://doi.org/10.1016/s0020-0190(97)00032-x
bibtex: '@article{Breslauer_Czumaj_Dubhashi_Meyer auf der Heide_1995, title={Transforming
comparison model lower bounds to the parallel-random-access-machine}, DOI={10.1016/s0020-0190(97)00032-x},
journal={Information Processing Letters}, author={Breslauer, Dany and Czumaj,
Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}, year={1995},
pages={103–110} }'
chicago: Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer
auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.”
Information Processing Letters, 1995, 103–10. https://doi.org/10.1016/s0020-0190(97)00032-x.
ieee: D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming
comparison model lower bounds to the parallel-random-access-machine,” Information
Processing Letters, pp. 103–110, 1995.
mla: Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the
Parallel-Random-Access-Machine.” Information Processing Letters, 1995,
pp. 103–10, doi:10.1016/s0020-0190(97)00032-x.
short: D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information
Processing Letters (1995) 103–110.
date_created: 2020-04-15T11:28:35Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1016/s0020-0190(97)00032-x
language:
- iso: eng
page: 103-110
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
status: public
title: Transforming comparison model lower bounds to the parallel-random-access-machine
type: journal_article
user_id: '15415'
year: '1995'
...
---
_id: '16611'
author:
- first_name: Martin
full_name: Golubitsky, Martin
last_name: Golubitsky
- first_name: Jerrold
full_name: Marsden, Jerrold
last_name: Marsden
- first_name: Ian
full_name: Stewart, Ian
last_name: Stewart
- first_name: Michael
full_name: Dellnitz, Michael
last_name: Dellnitz
citation:
ama: 'Golubitsky M, Marsden J, Stewart I, Dellnitz M. The constrained Liapunov-Schmidt
procedure and periodic orbits. In: Normal Forms and Homoclinic Chaos. Providence,
Rhode Island; 1995. doi:10.1090/fic/004/05'
apa: Golubitsky, M., Marsden, J., Stewart, I., & Dellnitz, M. (1995). The constrained
Liapunov-Schmidt procedure and periodic orbits. In Normal Forms and Homoclinic
Chaos. Providence, Rhode Island. https://doi.org/10.1090/fic/004/05
bibtex: '@inbook{Golubitsky_Marsden_Stewart_Dellnitz_1995, place={Providence, Rhode
Island}, title={The constrained Liapunov-Schmidt procedure and periodic orbits},
DOI={10.1090/fic/004/05}, booktitle={Normal
Forms and Homoclinic Chaos}, author={Golubitsky, Martin and Marsden, Jerrold and
Stewart, Ian and Dellnitz, Michael}, year={1995} }'
chicago: Golubitsky, Martin, Jerrold Marsden, Ian Stewart, and Michael Dellnitz.
“The Constrained Liapunov-Schmidt Procedure and Periodic Orbits.” In Normal
Forms and Homoclinic Chaos. Providence, Rhode Island, 1995. https://doi.org/10.1090/fic/004/05.
ieee: M. Golubitsky, J. Marsden, I. Stewart, and M. Dellnitz, “The constrained Liapunov-Schmidt
procedure and periodic orbits,” in Normal Forms and Homoclinic Chaos, Providence,
Rhode Island, 1995.
mla: Golubitsky, Martin, et al. “The Constrained Liapunov-Schmidt Procedure and
Periodic Orbits.” Normal Forms and Homoclinic Chaos, 1995, doi:10.1090/fic/004/05.
short: 'M. Golubitsky, J. Marsden, I. Stewart, M. Dellnitz, in: Normal Forms and
Homoclinic Chaos, Providence, Rhode Island, 1995.'
date_created: 2020-04-16T08:02:13Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '101'
doi: 10.1090/fic/004/05
language:
- iso: eng
place: Providence, Rhode Island
publication: Normal Forms and Homoclinic Chaos
publication_identifier:
isbn:
- '9780821803264'
- '9781470429720'
publication_status: published
status: public
title: The constrained Liapunov-Schmidt procedure and periodic orbits
type: book_chapter
user_id: '15701'
year: '1995'
...
---
_id: '16704'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary
networks. In: STACS 95. Berlin, Heidelberg; 1995. doi:10.1007/3-540-59042-0_81'
apa: Meyer auf der Heide, F., & Vöcking, B. (1995). A packet routing protocol
for arbitrary networks. In STACS 95. Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_81
bibtex: '@inbook{Meyer auf der Heide_Vöcking_1995, place={Berlin, Heidelberg}, title={A
packet routing protocol for arbitrary networks}, DOI={10.1007/3-540-59042-0_81},
booktitle={STACS 95}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold},
year={1995} }'
chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing
Protocol for Arbitrary Networks.” In STACS 95. Berlin, Heidelberg, 1995.
https://doi.org/10.1007/3-540-59042-0_81.
ieee: F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary
networks,” in STACS 95, Berlin, Heidelberg, 1995.
mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol
for Arbitrary Networks.” STACS 95, 1995, doi:10.1007/3-540-59042-0_81.
short: 'F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.'
date_created: 2020-04-16T13:36:32Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-59042-0_81
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 95
publication_identifier:
isbn:
- '9783540590422'
- '9783540491750'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A packet routing protocol for arbitrary networks
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16705'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with
triple-logarithmic delay. In: Lecture Notes in Computer Science. Berlin,
Heidelberg; 1995. doi:10.1007/3-540-60313-1_133'
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Shared memory
simulations with triple-logarithmic delay. In Lecture Notes in Computer Science.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133
bibtex: '@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg},
title={Shared memory simulations with triple-logarithmic delay}, DOI={10.1007/3-540-60313-1_133},
booktitle={Lecture Notes in Computer Science}, author={Czumaj, Artur and Meyer
auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared
Memory Simulations with Triple-Logarithmic Delay.” In Lecture Notes in Computer
Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60313-1_133.
ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations
with triple-logarithmic delay,” in Lecture Notes in Computer Science, Berlin,
Heidelberg, 1995.
mla: Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.”
Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.
short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer
Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-16T13:40:52Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-60313-1_133
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540603139'
- '9783540449133'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Shared memory simulations with triple-logarithmic delay
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16706'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Martin
full_name: Storch, Martin
last_name: Storch
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size
and slowdown for universal parallel networks. In: Proceedings of the Seventh
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95.
; 1995. doi:10.1145/215399.215430'
apa: Meyer auf der Heide, F., Storch, M., & Wanka, R. (1995). Optimal trade-offs
between size and slowdown for universal parallel networks. In Proceedings of
the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA
’95. https://doi.org/10.1145/215399.215430
bibtex: '@inproceedings{Meyer auf der Heide_Storch_Wanka_1995, title={Optimal trade-offs
between size and slowdown for universal parallel networks}, DOI={10.1145/215399.215430},
booktitle={Proceedings of the seventh annual ACM symposium on Parallel algorithms
and architectures - SPAA ’95}, author={Meyer auf der Heide, Friedhelm and Storch,
Martin and Wanka, Rolf}, year={1995} }'
chicago: Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal
Trade-Offs between Size and Slowdown for Universal Parallel Networks.” In Proceedings
of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’95, 1995. https://doi.org/10.1145/215399.215430.
ieee: F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal trade-offs between
size and slowdown for universal parallel networks,” in Proceedings of the seventh
annual ACM symposium on Parallel algorithms and architectures - SPAA ’95,
1995.
mla: Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and
Slowdown for Universal Parallel Networks.” Proceedings of the Seventh Annual
ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995,
doi:10.1145/215399.215430.
short: 'F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995.'
date_created: 2020-04-16T13:47:15Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1145/215399.215430
language:
- iso: eng
publication: Proceedings of the seventh annual ACM symposium on Parallel algorithms
and architectures - SPAA '95
publication_identifier:
isbn:
- '0897917170'
publication_status: published
status: public
title: Optimal trade-offs between size and slowdown for universal parallel networks
type: conference
user_id: '15415'
year: '1995'
...
---
_id: '16707'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Improved optimal shared memory
simulations, and the power of reconfiguration. In: Proceedings Third Israel
Symposium on the Theory of Computing and Systems. ; 1995. doi:10.1109/istcs.1995.377051'
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Improved optimal
shared memory simulations, and the power of reconfiguration. Proceedings Third
Israel Symposium on the Theory of Computing and Systems. https://doi.org/10.1109/istcs.1995.377051
bibtex: '@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Improved
optimal shared memory simulations, and the power of reconfiguration}, DOI={10.1109/istcs.1995.377051},
booktitle={Proceedings Third Israel Symposium on the Theory of Computing and Systems},
author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker},
year={1995} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved
Optimal Shared Memory Simulations, and the Power of Reconfiguration.” In Proceedings
Third Israel Symposium on the Theory of Computing and Systems, 1995. https://doi.org/10.1109/istcs.1995.377051.
ieee: 'A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared
memory simulations, and the power of reconfiguration,” 1995, doi: 10.1109/istcs.1995.377051.'
mla: Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the
Power of Reconfiguration.” Proceedings Third Israel Symposium on the Theory
of Computing and Systems, 1995, doi:10.1109/istcs.1995.377051.
short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel
Symposium on the Theory of Computing and Systems, 1995.'
date_created: 2020-04-16T13:49:13Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1109/istcs.1995.377051
language:
- iso: eng
publication: Proceedings Third Israel Symposium on the Theory of Computing and Systems
publication_identifier:
isbn:
- '0818669152'
publication_status: published
status: public
title: Improved optimal shared memory simulations, and the power of reconfiguration
type: conference
user_id: '15415'
year: '1995'
...
---
_id: '16717'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional
tori. In: Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg;
1995. doi:10.1007/3-540-60618-1_77'
apa: Meyer auf der Heide, F., & Westermann, M. (1995). Hot-potato routing on
multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77
bibtex: '@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg},
title={Hot-potato routing on multi-dimensional tori}, DOI={10.1007/3-540-60618-1_77},
booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der
Heide, Friedhelm and Westermann, Matthias}, year={1995} }'
chicago: Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing
on Multi-Dimensional Tori.” In Graph-Theoretic Concepts in Computer Science.
Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60618-1_77.
ieee: F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional
tori,” in Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg,
1995.
mla: Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing
on Multi-Dimensional Tori.” Graph-Theoretic Concepts in Computer Science,
1995, doi:10.1007/3-540-60618-1_77.
short: 'F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer
Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-17T07:46:18Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-60618-1_77
language:
- iso: eng
place: Berlin, Heidelberg
publication: Graph-Theoretic Concepts in Computer Science
publication_identifier:
isbn:
- '9783540606185'
- '9783540484875'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Hot-potato routing on multi-dimensional tori
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16874'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
- first_name: Wolfgang
full_name: Dittrich, Wolfgang
last_name: Dittrich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms:
c-optimal multisearch for an extension of the BSP model. In: Lecture Notes
in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_131'
apa: 'Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1995). Truly efficient
parallel algorithms: c-optimal multisearch for an extension of the BSP model.
In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_131'
bibtex: '@inbook{Bäumker_Dittrich_Meyer auf der Heide_1995, place={Berlin, Heidelberg},
title={Truly efficient parallel algorithms: c-optimal multisearch for an extension
of the BSP model}, DOI={10.1007/3-540-60313-1_131},
booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich,
Wolfgang and Meyer auf der Heide, Friedhelm}, year={1995} }'
chicago: 'Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide.
“Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of
the BSP Model.” In Lecture Notes in Computer Science. Berlin, Heidelberg,
1995. https://doi.org/10.1007/3-540-60313-1_131.'
ieee: 'A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel
algorithms: c-optimal multisearch for an extension of the BSP model,” in Lecture
Notes in Computer Science, Berlin, Heidelberg, 1995.'
mla: 'Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch
for an Extension of the BSP Model.” Lecture Notes in Computer Science,
1995, doi:10.1007/3-540-60313-1_131.'
short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer
Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-27T13:59:05Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '63'
doi: 10.1007/3-540-60313-1_131
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540603139'
- '9783540449133'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Truly efficient parallel algorithms: c-optimal multisearch for an extension
of the BSP model'
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '10610'
author:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Bernhard
full_name: Rinner, Bernhard
last_name: Rinner
- first_name: Reinhold
full_name: Weiss, Reinhold
last_name: Weiss
citation:
ama: Platzner M, Rinner B, Weiss R. Exploiting Parallelism in Constraint Satisfaction
for Qualitative Simulation. JUCS Journal of Universal Computer Science.
1995;12:811-820.
apa: Platzner, M., Rinner, B., & Weiss, R. (1995). Exploiting Parallelism in
Constraint Satisfaction for Qualitative Simulation. J.UCS Journal of Universal
Computer Science, 12, 811–820.
bibtex: '@article{Platzner_Rinner_Weiss_1995, title={Exploiting Parallelism in Constraint
Satisfaction for Qualitative Simulation}, volume={12}, journal={J.UCS Journal
of Universal Computer Science}, publisher={Springer}, author={Platzner, Marco
and Rinner, Bernhard and Weiss, Reinhold}, year={1995}, pages={811–820} }'
chicago: 'Platzner, Marco, Bernhard Rinner, and Reinhold Weiss. “Exploiting Parallelism
in Constraint Satisfaction for Qualitative Simulation.” J.UCS Journal of Universal
Computer Science 12 (1995): 811–20.'
ieee: M. Platzner, B. Rinner, and R. Weiss, “Exploiting Parallelism in Constraint
Satisfaction for Qualitative Simulation,” J.UCS Journal of Universal Computer
Science, vol. 12, pp. 811–820, 1995.
mla: Platzner, Marco, et al. “Exploiting Parallelism in Constraint Satisfaction
for Qualitative Simulation.” J.UCS Journal of Universal Computer Science,
vol. 12, Springer, 1995, pp. 811–20.
short: M. Platzner, B. Rinner, R. Weiss, J.UCS Journal of Universal Computer Science
12 (1995) 811–820.
date_created: 2019-07-10T09:23:10Z
date_updated: 2022-01-06T06:50:47Z
department:
- _id: '78'
extern: '1'
intvolume: ' 12'
language:
- iso: eng
page: 811-820
publication: J.UCS Journal of Universal Computer Science
publisher: Springer
status: public
title: Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation
type: journal_article
user_id: '398'
volume: 12
year: '1995'
...
---
_id: '11757'
abstract:
- lang: eng
text: Clustering techniques have been integrated at different levels into the training
procedure of a continuous-density hidden Markov model (HMM) speech recognizer.
These clustering techniques can be used in two ways. First acoustically similar
states are tied together. It will help to reduce the number of parameters but
also allow to train otherwise rarely seen states together with more robust ones
(state-tying). Secondly densities are clustered across states, this reduces the
number of densities while at the same time keeping the best performances of our
recognizer (density-clustering). We have applied these techniques both to word-based
small-vocabulary and phoneme-based large-vocabulary recognition tasks. On the
WSJ task, we could achieve a reduction of the word error rate by 7%. On the TI/NIST-connected
digit task, the number of parameters was reduced by a factor 2-3 while keeping
the same string error rate.
author:
- first_name: Christian
full_name: Dugast, Christian
last_name: Dugast
- first_name: Peter
full_name: Beyerlein, Peter
last_name: Beyerlein
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
citation:
ama: 'Dugast C, Beyerlein P, Haeb-Umbach R. Application of Clustering Techniques
to Mixture Density Modelling for Continuous-Speech Recognition. In: ICASSP,
Detroit. ; 1995.'
apa: Dugast, C., Beyerlein, P., & Haeb-Umbach, R. (1995). Application of Clustering
Techniques to Mixture Density Modelling for Continuous-Speech Recognition. In
ICASSP, Detroit.
bibtex: '@inproceedings{Dugast_Beyerlein_Haeb-Umbach_1995, title={Application of
Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition},
booktitle={ICASSP, Detroit}, author={Dugast, Christian and Beyerlein, Peter and
Haeb-Umbach, Reinhold}, year={1995} }'
chicago: Dugast, Christian, Peter Beyerlein, and Reinhold Haeb-Umbach. “Application
of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition.”
In ICASSP, Detroit, 1995.
ieee: C. Dugast, P. Beyerlein, and R. Haeb-Umbach, “Application of Clustering Techniques
to Mixture Density Modelling for Continuous-Speech Recognition,” in ICASSP,
Detroit, 1995.
mla: Dugast, Christian, et al. “Application of Clustering Techniques to Mixture
Density Modelling for Continuous-Speech Recognition.” ICASSP, Detroit,
1995.
short: 'C. Dugast, P. Beyerlein, R. Haeb-Umbach, in: ICASSP, Detroit, 1995.'
date_created: 2019-07-12T05:27:40Z
date_updated: 2022-01-06T06:51:08Z
department:
- _id: '54'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://groups.uni-paderborn.de/nt/pubs/1995/ICASSP_1995_Haeb_paper.pdf
oa: '1'
publication: ICASSP, Detroit
status: public
title: Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech
Recognition
type: conference
user_id: '44006'
year: '1995'
...
---
_id: '11764'
abstract:
- lang: eng
text: Today speech recognition of a small vocabulary can be realized so cost-effectively
that the technology can penetrate into consumer electronics. But, as first applications
that failed on the market show, it is by no means obvious how to incorporate voice
control in a user interface. This paper addresses the issue of how to design a
voice control so that the user perceives it as a benefit. User interface guidelines
that are adapted or specific to voice control are presented. Then the process
of designing a voice control in the user-centred approach is described. By means
of two examples, the car stereo and telephone answering machine, it is shown how
this is turned into practice.
author:
- first_name: Stephan
full_name: Gamm, Stephan
last_name: Gamm
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
citation:
ama: Gamm S, Haeb-Umbach R. User interface design of voice controlled consumer electronics.
Philips Journal of Research. 1995.
apa: Gamm, S., & Haeb-Umbach, R. (1995). User interface design of voice controlled
consumer electronics. Philips Journal of Research.
bibtex: '@article{Gamm_Haeb-Umbach_1995, title={User interface design of voice controlled
consumer electronics}, journal={Philips Journal of Research}, author={Gamm, Stephan
and Haeb-Umbach, Reinhold}, year={1995} }'
chicago: Gamm, Stephan, and Reinhold Haeb-Umbach. “User Interface Design of Voice
Controlled Consumer Electronics.” Philips Journal of Research, 1995.
ieee: S. Gamm and R. Haeb-Umbach, “User interface design of voice controlled consumer
electronics,” Philips Journal of Research, 1995.
mla: Gamm, Stephan, and Reinhold Haeb-Umbach. “User Interface Design of Voice Controlled
Consumer Electronics.” Philips Journal of Research, 1995.
short: S. Gamm, R. Haeb-Umbach, Philips Journal of Research (1995).
date_created: 2019-07-12T05:27:48Z
date_updated: 2022-01-06T06:51:08Z
department:
- _id: '54'
language:
- iso: eng
publication: Philips Journal of Research
status: public
title: User interface design of voice controlled consumer electronics
type: journal_article
user_id: '44006'
year: '1995'
...