---
_id: '18347'
abstract:
- lang: eng
text: "The validation of material flow models as well as the selection of promising
strategies for the generation of a successful experiment plan is a time-consuming
process. A new approach is presented, which supports the simulation expert in
his working process by giving him the opportunity to modify the simulated simulation
run and afterwards compare the effects of his modification with the original setting,
online and in one user interface, implemented by switching the visualizations
between the simulation runs or opening up to 5 parallel 3D windows. The method
developed therefore clones existing simulation runs online and allows the navigation
within these existing simulation runs. The method has been implemented and is
validated by a test model, which describes in detail the new working process of
a modeler. New research questions are derived from this work, which will define
following working steps.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: 'Christoph '
full_name: 'Laroque, Christoph '
last_name: Laroque
- first_name: 'Daniel '
full_name: 'Huber, Daniel '
last_name: Huber
- first_name: 'Jens '
full_name: 'Krokowski, Jens '
last_name: Krokowski
- first_name: 'Bengt '
full_name: 'Mueck, Bengt '
last_name: Mueck
- first_name: 'Michael '
full_name: 'Kortenjan, Michael '
last_name: Kortenjan
- first_name: Mark
full_name: Aufenanger, Mark
last_name: Aufenanger
- first_name: Wilhelm
full_name: ' Dangelmaier, Wilhelm'
last_name: ' Dangelmaier'
citation:
ama: 'Fischer M, Laroque C, Huber D, et al. Interactive Refinement of a Material
Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment.
In: European Simulation and Modelling Conference (ESM 2007). ; 2007:499--505.'
apa: Fischer, M., Laroque, C., Huber, D., Krokowski, J., Mueck, B., Kortenjan, M.,
… Dangelmaier, W. (2007). Interactive Refinement of a Material Flow Simulation
Model by Comparing Multiple Simulation Runs in one 3D Environment. In European
Simulation and Modelling Conference (ESM 2007) (pp. 499--505).
bibtex: '@inproceedings{Fischer_Laroque_Huber_Krokowski_Mueck_Kortenjan_Aufenanger_
Dangelmaier_2007, title={Interactive Refinement of a Material Flow Simulation
Model by Comparing Multiple Simulation Runs in one 3D Environment}, booktitle={European
Simulation and Modelling Conference (ESM 2007)}, author={Fischer, Matthias and
Laroque, Christoph and Huber, Daniel and Krokowski, Jens and Mueck, Bengt and
Kortenjan, Michael and Aufenanger, Mark and Dangelmaier, Wilhelm}, year={2007},
pages={499--505} }'
chicago: Fischer, Matthias, Christoph Laroque, Daniel Huber, Jens Krokowski,
Bengt Mueck, Michael Kortenjan, Mark Aufenanger, and Wilhelm Dangelmaier. “Interactive
Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation
Runs in One 3D Environment.” In European Simulation and Modelling Conference
(ESM 2007), 499--505, 2007.
ieee: M. Fischer et al., “Interactive Refinement of a Material Flow Simulation
Model by Comparing Multiple Simulation Runs in one 3D Environment,” in European
Simulation and Modelling Conference (ESM 2007), 2007, pp. 499--505.
mla: Fischer, Matthias, et al. “Interactive Refinement of a Material Flow Simulation
Model by Comparing Multiple Simulation Runs in One 3D Environment.” European
Simulation and Modelling Conference (ESM 2007), 2007, pp. 499--505.
short: 'M. Fischer, C. Laroque, D. Huber, J. Krokowski, B. Mueck, M. Kortenjan,
M. Aufenanger, W. Dangelmaier, in: European Simulation and Modelling Conference
(ESM 2007), 2007, pp. 499--505.'
date_created: 2020-08-26T09:23:24Z
date_updated: 2022-01-06T06:53:29Z
ddc:
- '004'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T09:22:47Z
date_updated: 2020-08-26T09:22:47Z
file_id: '18348'
file_name: ESM07_final.pdf
file_size: 389588
relation: main_file
success: 1
file_date_updated: 2020-08-26T09:22:47Z
has_accepted_license: '1'
language:
- iso: eng
page: 499--505
publication: European Simulation and Modelling Conference (ESM 2007)
status: public
title: Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple
Simulation Runs in one 3D Environment
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18349'
author:
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: 'Christoph '
full_name: ' Laroque, Christoph '
last_name: ' Laroque'
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Dangelmaier W, Laroque C, Fischer M. Ein ganzheitlicher Ansatz zur immersiven
3D-Materialflusssimulation innerhalb der Digitalen Fabrik. In: Augmented &
Virtual Reality in Der Produktentstehung. Vol 209. Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2007:95-110.'
apa: Dangelmaier, W., Laroque, C., & Fischer, M. (2007). Ein ganzheitlicher
Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik.
Augmented & Virtual Reality in Der Produktentstehung, 209, 95–110.
bibtex: '@inproceedings{Dangelmaier_ Laroque_Fischer_2007, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Ein ganzheitlicher Ansatz zur
immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik}, volume={209},
booktitle={Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Dangelmaier, Wilhelm and Laroque,
Christoph and Fischer, Matthias}, year={2007}, pages={95–110}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Dangelmaier, Wilhelm, Christoph Laroque, and Matthias Fischer. “Ein Ganzheitlicher
Ansatz Zur Immersiven 3D-Materialflusssimulation Innerhalb Der Digitalen Fabrik.”
In Augmented & Virtual Reality in Der Produktentstehung, 209:95–110.
Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2007.
ieee: W. Dangelmaier, C. Laroque, and M. Fischer, “Ein ganzheitlicher Ansatz zur
immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik,” in Augmented
& Virtual Reality in der Produktentstehung, 2007, vol. 209, pp. 95–110.
mla: Dangelmaier, Wilhelm, et al. “Ein Ganzheitlicher Ansatz Zur Immersiven 3D-Materialflusssimulation
Innerhalb Der Digitalen Fabrik.” Augmented & Virtual Reality in Der Produktentstehung,
vol. 209, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007,
pp. 95–110.
short: 'W. Dangelmaier, C. Laroque, M. Fischer, in: Augmented & Virtual Reality
in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2007, pp. 95–110.'
date_created: 2020-08-26T09:30:58Z
date_updated: 2022-01-06T06:53:29Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 209'
language:
- iso: eng
page: 95-110
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb
der Digitalen Fabrik
type: conference
user_id: '5786'
volume: 209
year: '2007'
...
---
_id: '1840'
author:
- first_name: Dereje H.
full_name: Woldegebreal, Dereje H.
last_name: Woldegebreal
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Woldegebreal DH, Karl H. Multiple-Access Relay Channel with Network Coding
and Non-Ideal Source-Relay Channels. In: 2007 4th International Symposium on
Wireless Communication Systems. IEEE; 2007. doi:10.1109/iswcs.2007.4392437'
apa: Woldegebreal, D. H., & Karl, H. (2007). Multiple-Access Relay Channel with
Network Coding and Non-Ideal Source-Relay Channels. In 2007 4th International
Symposium on Wireless Communication Systems. IEEE. https://doi.org/10.1109/iswcs.2007.4392437
bibtex: '@inproceedings{Woldegebreal_Karl_2007, title={Multiple-Access Relay Channel
with Network Coding and Non-Ideal Source-Relay Channels}, DOI={10.1109/iswcs.2007.4392437},
booktitle={2007 4th International Symposium on Wireless Communication Systems},
publisher={IEEE}, author={Woldegebreal, Dereje H. and Karl, Holger}, year={2007}
}'
chicago: Woldegebreal, Dereje H., and Holger Karl. “Multiple-Access Relay Channel
with Network Coding and Non-Ideal Source-Relay Channels.” In 2007 4th International
Symposium on Wireless Communication Systems. IEEE, 2007. https://doi.org/10.1109/iswcs.2007.4392437.
ieee: D. H. Woldegebreal and H. Karl, “Multiple-Access Relay Channel with Network
Coding and Non-Ideal Source-Relay Channels,” in 2007 4th International Symposium
on Wireless Communication Systems, 2007.
mla: Woldegebreal, Dereje H., and Holger Karl. “Multiple-Access Relay Channel with
Network Coding and Non-Ideal Source-Relay Channels.” 2007 4th International
Symposium on Wireless Communication Systems, IEEE, 2007, doi:10.1109/iswcs.2007.4392437.
short: 'D.H. Woldegebreal, H. Karl, in: 2007 4th International Symposium on Wireless
Communication Systems, IEEE, 2007.'
date_created: 2018-03-27T13:00:30Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '75'
doi: 10.1109/iswcs.2007.4392437
publication: 2007 4th International Symposium on Wireless Communication Systems
publication_identifier:
isbn:
- '9781424409785'
- '9781424409792'
publication_status: published
publisher: IEEE
status: public
title: Multiple-Access Relay Channel with Network Coding and Non-Ideal Source-Relay
Channels
type: conference
user_id: '15572'
year: '2007'
...
---
_id: '1842'
author:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Karl H. Optimizing sleeping intervals in preamble sampling MAC for WSNs. In:
Bern / Switzerland: Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference;
2007.'
apa: 'Karl, H. (2007). Optimizing sleeping intervals in preamble sampling MAC for
WSNs. Bern / Switzerland: Communication in Distributed Systems (KiVS), 2007 ITG-GI
Conference.'
bibtex: '@inproceedings{Karl_2007, place={Bern / Switzerland}, title={Optimizing
sleeping intervals in preamble sampling MAC for WSNs}, publisher={Communication
in Distributed Systems (KiVS), 2007 ITG-GI Conference}, author={Karl, Holger},
year={2007} }'
chicago: 'Karl, Holger. “Optimizing Sleeping Intervals in Preamble Sampling MAC
for WSNs.” Bern / Switzerland: Communication in Distributed Systems (KiVS), 2007
ITG-GI Conference, 2007.'
ieee: H. Karl, “Optimizing sleeping intervals in preamble sampling MAC for WSNs,”
2007.
mla: Karl, Holger. Optimizing Sleeping Intervals in Preamble Sampling MAC for
WSNs. Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference,
2007.
short: 'H. Karl, in: Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference,
Bern / Switzerland, 2007.'
date_created: 2018-03-27T13:11:08Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '75'
place: Bern / Switzerland
publisher: Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference
status: public
title: Optimizing sleeping intervals in preamble sampling MAC for WSNs
type: conference
user_id: '15572'
year: '2007'
...
---
_id: '18572'
abstract:
- lang: eng
text: "We present random sampling algorithms that with probability at least 1 − δ
compute a (1 ±ε)-approximation of the clustering coefficient and of the number
of bipartite clique subgraphs of a graph given as an incidence stream of edges.
The space used by our algorithm to estimate the clustering coefficient is inversely
related to the clustering coefficient of the network itself. The space used by
our algorithm to compute the number K 3,3 of bipartite cliques is proportional
to the ratio between the number of K 1,3 and K 3,3 in the graph.\r\n\r\nSince
the space complexity depends only on the structure of the input graph and not
on the number of nodes, our algorithms scale very well with increasing graph size.
Therefore they provide a basic tool to analyze the structure of dense clusters
in large graphs and have many applications in the discovery of web communities,
the analysis of the structure of large social networks and the probing of frequent
patterns in large graphs.\r\n\r\nWe implemented both algorithms and evaluated
their performance on networks from different application domains and of different
size; The largest instance is a webgraph consisting of more than 135 million nodes
and 1 billion edges. Both algorithms compute accurate results in reasonable time
on the tested instances."
author:
- first_name: Luciana S.
full_name: Buriol, Luciana S.
last_name: Buriol
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Buriol LS, Frahling G, Leonardi S, Sohler C. Estimating Clustering Indexes
in Data Streams. In: Proceedings of the 15th European Symposium on Algorithms
(ESA). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer;
2007:618-632. doi:10.1007/978-3-540-75520-3_55'
apa: 'Buriol, L. S., Frahling, G., Leonardi, S., & Sohler, C. (2007). Estimating
Clustering Indexes in Data Streams. In Proceedings of the 15th European Symposium
on Algorithms (ESA) (Vol. 4698, pp. 618–632). Berlin, Heidelberg: Springer.
https://doi.org/10.1007/978-3-540-75520-3_55'
bibtex: '@inproceedings{Buriol_Frahling_Leonardi_Sohler_2007, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Estimating Clustering Indexes
in Data Streams}, volume={4698}, DOI={10.1007/978-3-540-75520-3_55},
booktitle={Proceedings of the 15th European Symposium on Algorithms (ESA)}, publisher={Springer},
author={Buriol, Luciana S. and Frahling, Gereon and Leonardi, Stefano and Sohler,
Christian}, year={2007}, pages={618–632}, collection={Lecture Notes in Computer
Science} }'
chicago: 'Buriol, Luciana S., Gereon Frahling, Stefano Leonardi, and Christian Sohler.
“Estimating Clustering Indexes in Data Streams.” In Proceedings of the 15th
European Symposium on Algorithms (ESA), 4698:618–32. Lecture Notes in Computer
Science. Berlin, Heidelberg: Springer, 2007. https://doi.org/10.1007/978-3-540-75520-3_55.'
ieee: L. S. Buriol, G. Frahling, S. Leonardi, and C. Sohler, “Estimating Clustering
Indexes in Data Streams,” in Proceedings of the 15th European Symposium on
Algorithms (ESA), 2007, vol. 4698, pp. 618–632.
mla: Buriol, Luciana S., et al. “Estimating Clustering Indexes in Data Streams.”
Proceedings of the 15th European Symposium on Algorithms (ESA), vol. 4698,
Springer, 2007, pp. 618–32, doi:10.1007/978-3-540-75520-3_55.
short: 'L.S. Buriol, G. Frahling, S. Leonardi, C. Sohler, in: Proceedings of the
15th European Symposium on Algorithms (ESA), Springer, Berlin, Heidelberg, 2007,
pp. 618–632.'
date_created: 2020-08-28T12:46:05Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
doi: 10.1007/978-3-540-75520-3_55
intvolume: ' 4698'
language:
- iso: eng
page: 618-632
place: Berlin, Heidelberg
publication: Proceedings of the 15th European Symposium on Algorithms (ESA)
publication_identifier:
isbn:
- '9783540755197'
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Estimating Clustering Indexes in Data Streams
type: conference
user_id: '15415'
volume: 4698
year: '2007'
...
---
_id: '18655'
abstract:
- lang: eng
text: We study graph properties which are testable for bounded degree graphs in
time independent of the input size. Our goal is to distinguish between graphs
having a predetermined graph property and graphs that are far from every graph
having that property. It is believed that almost all, even very simple graph properties
require a large complexity to be tested for arbitrary (bounded degree) graphs.
Therefore in this paper we focus our attention on testing graph properties for
special classes of graphs. We call a graph family non-expanding if every graph
in this family is not a weak expander (its expansion is O(1/log2 n), where n is
the graph size). A graph family is hereditary if it is closed under vertex removal.
Similarly, a graph property is hereditary if it is closed under vertex removal.
Next, we call a graph property Π to be testable for a graph family F if for every
graph G ε F, in time independent of the size of G we can distinguish between the
case when G satisfies property Π and when it is far from every graph satisfying
property Π. In this paper we prove thatIn the bounded degree graph model, any
hereditary property is testable if the input graph belongs to a hereditary and
non-expanding family of graphs.As an application, our result implies that, for
example, any hereditary property (e.g., k-colorability, H-freeness, etc.) is testable
in the bounded degree graph model for planar graphs, graphs with bounded genus,
interval graphs, etc. No such results have been known before and prior to our
work, in the bounded degree graph model very few graph properties have been known
to be testable for any graph classes.
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: 'Sohler C, Czumaj A. On Testable Properties in Bounded Degree Graphs. In: Proceedings
of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07). ; 2007:494-501.'
apa: Sohler, C., & Czumaj, A. (2007). On Testable Properties in Bounded Degree
Graphs. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms
(SODA’07) (pp. 494–501).
bibtex: '@inproceedings{Sohler_Czumaj_2007, title={On Testable Properties in Bounded
Degree Graphs}, booktitle={Proceedings of the 17th ACM-SIAM Symposium on Discrete
Algorithms (SODA’07)}, author={Sohler, Christian and Czumaj, Artur}, year={2007},
pages={494–501} }'
chicago: Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded
Degree Graphs.” In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms
(SODA’07), 494–501, 2007.
ieee: C. Sohler and A. Czumaj, “On Testable Properties in Bounded Degree Graphs,”
in Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07),
2007, pp. 494–501.
mla: Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded Degree
Graphs.” Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms
(SODA’07), 2007, pp. 494–501.
short: 'C. Sohler, A. Czumaj, in: Proceedings of the 17th ACM-SIAM Symposium on
Discrete Algorithms (SODA’07), 2007, pp. 494–501.'
date_created: 2020-08-31T07:40:36Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 494-501
publication: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'07)
publication_identifier:
isbn:
- '9780898716245'
status: public
title: On Testable Properties in Bounded Degree Graphs
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18656'
abstract:
- lang: eng
text: In the StrSort model [2], the input is given as a stream, e.g. a sequence
of points, and an algorithm can perform (a) streaming and (b) sorting passes to
process the stream. A streaming pass reads the input stream from left to right
and writes an output stream, which is the input of the next pass. A sorting pass
is a black box operation that sorts a stream according to some partial order.
In this paper, we develop algorithms for two basic geometric problems in the StrSort
model. At first, we propose a divide-and-conquer algorithm that computes the convex
hull of a point set in 2D in O(log2 n) passes using O(1) memory. Then we give
a StrSort algorithm to compute a (1+ε)-spanner for a point set in Rd for constant
d and constant epsilon that uses O(logd-1 n) passes and O(log n) space. This result
implies a (1+ε)-approximation of the Euclidean minimum spanning tree in Rd, for
constant d and ε.
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Christiane
full_name: Lammersen, Christiane
last_name: Lammersen
citation:
ama: 'Sohler C, Lammersen C. StrSort Algorithms for Geometric Problems. In: Proceedings
of the 23rd European Workshop on Computational Geometry (EWCG). ; 2007:69-72.'
apa: Sohler, C., & Lammersen, C. (2007). StrSort Algorithms for Geometric Problems.
In Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)
(pp. 69–72).
bibtex: '@inproceedings{Sohler_Lammersen_2007, title={StrSort Algorithms for Geometric
Problems}, booktitle={Proceedings of the 23rd European Workshop on Computational
Geometry (EWCG)}, author={Sohler, Christian and Lammersen, Christiane}, year={2007},
pages={69–72} }'
chicago: Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric
Problems.” In Proceedings of the 23rd European Workshop on Computational Geometry
(EWCG), 69–72, 2007.
ieee: C. Sohler and C. Lammersen, “StrSort Algorithms for Geometric Problems,” in
Proceedings of the 23rd European Workshop on Computational Geometry (EWCG),
2007, pp. 69–72.
mla: Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric
Problems.” Proceedings of the 23rd European Workshop on Computational Geometry
(EWCG), 2007, pp. 69–72.
short: 'C. Sohler, C. Lammersen, in: Proceedings of the 23rd European Workshop on
Computational Geometry (EWCG), 2007, pp. 69–72.'
date_created: 2020-08-31T07:49:02Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 69-72
publication: Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)
status: public
title: StrSort Algorithms for Geometric Problems
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18660'
author:
- first_name: 'Christian '
full_name: 'Sohler, Christian '
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: 'Sohler C, Czumaj A. Testing Expansion in Bounded-Degree Graphs. In: Proceedings
of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS).
; 2007:570-578.'
apa: Sohler, C., & Czumaj, A. (2007). Testing Expansion in Bounded-Degree Graphs.
In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer
Science (FOCS) (pp. 570–578).
bibtex: '@inproceedings{Sohler_Czumaj_2007, title={Testing Expansion in Bounded-Degree
Graphs}, booktitle={Proceedings of the 48th Annual IEEE Symposium on Foundations
of Computer Science (FOCS)}, author={Sohler, Christian and Czumaj, Artur}, year={2007},
pages={570–578} }'
chicago: Sohler, Christian , and Artur Czumaj. “Testing Expansion in Bounded-Degree
Graphs.” In Proceedings of the 48th Annual IEEE Symposium on Foundations of
Computer Science (FOCS), 570–78, 2007.
ieee: C. Sohler and A. Czumaj, “Testing Expansion in Bounded-Degree Graphs,” in
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
(FOCS), 2007, pp. 570–578.
mla: Sohler, Christian, and Artur Czumaj. “Testing Expansion in Bounded-Degree Graphs.”
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
(FOCS), 2007, pp. 570–78.
short: 'C. Sohler, A. Czumaj, in: Proceedings of the 48th Annual IEEE Symposium
on Foundations of Computer Science (FOCS), 2007, pp. 570–578.'
date_created: 2020-08-31T07:55:45Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 570 - 578
publication: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer
Science (FOCS)
status: public
title: Testing Expansion in Bounded-Degree Graphs
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18662'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: 'Sohler C, Czumaj A. Small Space Representations for Metric Min-Sum k-Clustering
and their Applications. In: Proceedings of the 24th International Symposium
on Theoretical Aspects of Computer Science (STACS’07). ; 2007:536-548.'
apa: Sohler, C., & Czumaj, A. (2007). Small Space Representations for Metric
Min-Sum k-Clustering and their Applications. In Proceedings of the 24th International
Symposium on Theoretical Aspects of Computer Science (STACS’07) (pp. 536–548).
bibtex: '@inproceedings{Sohler_Czumaj_2007, title={Small Space Representations for
Metric Min-Sum k-Clustering and their Applications}, booktitle={Proceedings of
the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)},
author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={536–548} }'
chicago: Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric
Min-Sum k-Clustering and Their Applications.” In Proceedings of the 24th International
Symposium on Theoretical Aspects of Computer Science (STACS’07), 536–48, 2007.
ieee: C. Sohler and A. Czumaj, “Small Space Representations for Metric Min-Sum k-Clustering
and their Applications,” in Proceedings of the 24th International Symposium
on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–548.
mla: Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric
Min-Sum k-Clustering and Their Applications.” Proceedings of the 24th International
Symposium on Theoretical Aspects of Computer Science (STACS’07), 2007, pp.
536–48.
short: 'C. Sohler, A. Czumaj, in: Proceedings of the 24th International Symposium
on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–548.'
date_created: 2020-08-31T07:59:05Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 536-548
publication: Proceedings of the 24th International Symposium on Theoretical Aspects
of Computer Science (STACS'07)
status: public
title: Small Space Representations for Metric Min-Sum k-Clustering and their Applications
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18665'
abstract:
- lang: eng
text: 'We present a novel analysis of a random sampling approach for four clustering
problems in metric spaces: k-median, k-means, min-sum k-clustering, and balanced
k-median. For all these problems, we consider the following simple sampling scheme:
select a small sample set of input points uniformly at random and then run some
approximation algorithm on this sample set to compute an approximation of the
best possible clustering of this set. Our main technical contribution is a significantly
strengthened analysis of the approximation guarantee by this scheme for the clustering
problems.The main motivation behind our analyses was to design sublinear-time
algorithms for clustering problems. Our second contribution is the development
of new approximation algorithms for the aforementioned clustering problems. Using
our random sampling approach, we obtain for these problems the first time approximation
algorithms that have running time independent of the input size, and depending
on k and the diameter of the metric space only. © 2006 Wiley Periodicals, Inc.
Random Struct. Alg., 2007A preliminary extended abstract of this work appeared
in Proceedings of the 31st Annual International Colloquium on Automata, Languages
and Programming (ICALP), pp. 396407, 2004.'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: Sohler C, Czumaj A. Sublinear-time approximation algorithms for clustering
via random sampling. Random Structures & Algorithms. 2007;30(1-2):226--
256.
apa: Sohler, C., & Czumaj, A. (2007). Sublinear-time approximation algorithms
for clustering via random sampling. Random Structures & Algorithms,
30(1–2), 226-- 256.
bibtex: '@article{Sohler_Czumaj_2007, title={Sublinear-time approximation algorithms
for clustering via random sampling}, volume={30}, number={1–2}, journal={Random
Structures & Algorithms}, author={Sohler, Christian and Czumaj, Artur}, year={2007},
pages={226-- 256} }'
chicago: 'Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms
for Clustering via Random Sampling.” Random Structures & Algorithms
30, no. 1–2 (2007): 226-- 256.'
ieee: C. Sohler and A. Czumaj, “Sublinear-time approximation algorithms for clustering
via random sampling,” Random Structures & Algorithms, vol. 30, no.
1–2, pp. 226-- 256, 2007.
mla: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms
for Clustering via Random Sampling.” Random Structures & Algorithms,
vol. 30, no. 1–2, 2007, pp. 226-- 256.
short: C. Sohler, A. Czumaj, Random Structures & Algorithms 30 (2007) 226--
256.
date_created: 2020-08-31T08:03:52Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
intvolume: ' 30'
issue: 1-2
language:
- iso: eng
page: 226 -- 256
publication: Random Structures & Algorithms
status: public
title: Sublinear-time approximation algorithms for clustering via random sampling
type: journal_article
user_id: '15415'
volume: 30
year: '2007'
...
---
_id: '18668'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Morteza
full_name: Monemizahdeh, Morteza
last_name: Monemizahdeh
- first_name: Dan
full_name: Feldman, Dan
last_name: Feldman
citation:
ama: 'Sohler C, Monemizahdeh M, Feldman D. A PTAS for k-means clustering based on
weak coresets. In: Proceedings of the 23rd Annual Symposium on Computational
Geometry (SoCG’07). ; 2007:11-18.'
apa: Sohler, C., Monemizahdeh, M., & Feldman, D. (2007). A PTAS for k-means
clustering based on weak coresets. In Proceedings of the 23rd annual symposium
on computational geometry (SoCG’07) (pp. 11–18).
bibtex: '@inproceedings{Sohler_Monemizahdeh_Feldman_2007, title={A PTAS for k-means
clustering based on weak coresets}, booktitle={Proceedings of the 23rd annual
symposium on computational geometry (SoCG’07)}, author={Sohler, Christian and
Monemizahdeh, Morteza and Feldman, Dan}, year={2007}, pages={11–18} }'
chicago: Sohler, Christian, Morteza Monemizahdeh, and Dan Feldman. “A PTAS for K-Means
Clustering Based on Weak Coresets.” In Proceedings of the 23rd Annual Symposium
on Computational Geometry (SoCG’07), 11–18, 2007.
ieee: C. Sohler, M. Monemizahdeh, and D. Feldman, “A PTAS for k-means clustering
based on weak coresets,” in Proceedings of the 23rd annual symposium on computational
geometry (SoCG’07), 2007, pp. 11–18.
mla: Sohler, Christian, et al. “A PTAS for K-Means Clustering Based on Weak Coresets.”
Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07),
2007, pp. 11–18.
short: 'C. Sohler, M. Monemizahdeh, D. Feldman, in: Proceedings of the 23rd Annual
Symposium on Computational Geometry (SoCG’07), 2007, pp. 11–18.'
date_created: 2020-08-31T08:10:11Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 11-18
publication: Proceedings of the 23rd annual symposium on computational geometry (SoCG'07)
status: public
title: A PTAS for k-means clustering based on weak coresets
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18669'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Gereon
full_name: Frahling, Gereon
last_name: Frahling
citation:
ama: 'Sohler C, Czumaj A, Frahling G. Efficient kinetic data structures for MaxCut.
In: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG).
; 2007:157-160.'
apa: Sohler, C., Czumaj, A., & Frahling, G. (2007). Efficient kinetic data structures
for MaxCut. In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG) (pp. 157–160).
bibtex: '@inproceedings{Sohler_Czumaj_Frahling_2007, title={Efficient kinetic data
structures for MaxCut}, booktitle={Proceedings of the 19th Canadian Conference
on Computational Geometry (CCCG)}, author={Sohler, Christian and Czumaj, Artur
and Frahling, Gereon}, year={2007}, pages={157–160} }'
chicago: Sohler, Christian, Artur Czumaj, and Gereon Frahling. “Efficient Kinetic
Data Structures for MaxCut.” In Proceedings of the 19th Canadian Conference
on Computational Geometry (CCCG), 157–60, 2007.
ieee: C. Sohler, A. Czumaj, and G. Frahling, “Efficient kinetic data structures
for MaxCut,” in Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG), 2007, pp. 157–160.
mla: Sohler, Christian, et al. “Efficient Kinetic Data Structures for MaxCut.” Proceedings
of the 19th Canadian Conference on Computational Geometry (CCCG), 2007, pp.
157–60.
short: 'C. Sohler, A. Czumaj, G. Frahling, in: Proceedings of the 19th Canadian
Conference on Computational Geometry (CCCG), 2007, pp. 157–160.'
date_created: 2020-08-31T08:12:53Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 157-160
publication: Proceedings of the 19th Canadian Conference on Computational Geometry
(CCCG)
status: public
title: Efficient kinetic data structures for MaxCut
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '2214'
abstract:
- lang: eng
text: We present a randomized block-level storage virtualization for arbitrary heterogeneous
storage systems that can distribute data in a fair and redundant way and can adapt
this distribution in an efficient way as storage devices enter or leave the system.
More precisely, our virtualization strategies can distribute a set of data blocks
among a set of storage devices of arbitrary non-uniform capacities so that a storage
device representing x% of the capacity in the system will get x% of the data (as
long as this is in principle possible) and the different copies of each data block
are stored so that no two copies of a data block are located in the same device.
Achieving these two properties is not easy, and no virtualization strategy has
been presented so far that has been formally shown to satisfy fairness and redundancy
while being time- and space-eflcient and allowing an efficient adaptation to a
changing set of devices.
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Sascha
full_name: Effert, Sascha
last_name: Effert
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant
data placement. In: IEEE International Conference on Distributed Computing
Systems (ICDCS). ; 2007.'
apa: Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007).
Dynamic and redundant data placement. IEEE International Conference on Distributed
Computing Systems (ICDCS).
bibtex: '@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic
and redundant data placement}, booktitle={IEEE International Conference on Distributed
Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer
auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }'
chicago: Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian
Scheideler. “Dynamic and Redundant Data Placement.” In IEEE International Conference
on Distributed Computing Systems (ICDCS), 2007.
ieee: A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic
and redundant data placement,” 2007.
mla: Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International
Conference on Distributed Computing Systems (ICDCS), 2007.
short: 'A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE
International Conference on Distributed Computing Systems (ICDCS), 2007.'
date_created: 2018-04-05T07:08:35Z
date_updated: 2022-01-06T06:55:27Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-13T10:01:42Z
date_updated: 2018-04-13T10:01:42Z
file_id: '2339'
file_name: ICDCS07.pdf
file_size: 164121
relation: main_file
file_date_updated: 2018-04-13T10:01:42Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: IEEE International Conference on Distributed Computing Systems (ICDCS)
status: public
title: Dynamic and redundant data placement
type: conference
urn: '22147'
user_id: '15415'
year: '2007'
...
---
_id: '21776'
author:
- first_name: B.
full_name: Krevert, B.
last_name: Krevert
- first_name: T. B.
full_name: Dang, T. B.
last_name: Dang
- first_name: R.
full_name: Weise, R.
last_name: Weise
- first_name: H.
full_name: Fricke, H.
last_name: Fricke
- first_name: Gitta
full_name: Domik, Gitta
id: '90'
last_name: Domik
- first_name: W.
full_name: Buchert, W.
last_name: Buchert
citation:
ama: 'Krevert B, Dang TB, Weise R, Fricke H, Domik G, Buchert W. Ein plattformunabhängiges
Softwaretool für die schnelle Qualitätskontrolle von Transmissions- und dynamischen
Emissionsdaten in der PET. In: 45. Jahrestagung Der DGN. ; 2007.'
apa: Krevert, B., Dang, T. B., Weise, R., Fricke, H., Domik, G., & Buchert,
W. (2007). Ein plattformunabhängiges Softwaretool für die schnelle Qualitätskontrolle
von Transmissions- und dynamischen Emissionsdaten in der PET. In 45. Jahrestagung
der DGN.
bibtex: '@inproceedings{Krevert_Dang_Weise_Fricke_Domik_Buchert_2007, title={Ein
plattformunabhängiges Softwaretool für die schnelle Qualitätskontrolle von Transmissions-
und dynamischen Emissionsdaten in der PET}, booktitle={45. Jahrestagung der DGN},
author={Krevert, B. and Dang, T. B. and Weise, R. and Fricke, H. and Domik, Gitta
and Buchert, W.}, year={2007} }'
chicago: Krevert, B., T. B. Dang, R. Weise, H. Fricke, Gitta Domik, and W. Buchert.
“Ein Plattformunabhängiges Softwaretool Für Die Schnelle Qualitätskontrolle von
Transmissions- Und Dynamischen Emissionsdaten in Der PET.” In 45. Jahrestagung
Der DGN, 2007.
ieee: B. Krevert, T. B. Dang, R. Weise, H. Fricke, G. Domik, and W. Buchert, “Ein
plattformunabhängiges Softwaretool für die schnelle Qualitätskontrolle von Transmissions-
und dynamischen Emissionsdaten in der PET,” in 45. Jahrestagung der DGN,
2007.
mla: Krevert, B., et al. “Ein Plattformunabhängiges Softwaretool Für Die Schnelle
Qualitätskontrolle von Transmissions- Und Dynamischen Emissionsdaten in Der PET.”
45. Jahrestagung Der DGN, 2007.
short: 'B. Krevert, T.B. Dang, R. Weise, H. Fricke, G. Domik, W. Buchert, in: 45.
Jahrestagung Der DGN, 2007.'
date_created: 2021-04-25T17:17:25Z
date_updated: 2022-01-06T06:55:13Z
department:
- _id: '65'
language:
- iso: eng
publication: 45. Jahrestagung der DGN
status: public
title: Ein plattformunabhängiges Softwaretool für die schnelle Qualitätskontrolle
von Transmissions- und dynamischen Emissionsdaten in der PET
type: conference
user_id: '14955'
year: '2007'
...
---
_id: '2209'
author:
- first_name: Vinay
full_name: Aggarwal, Vinay
last_name: Aggarwal
- first_name: Anja
full_name: Feldmann, Anja
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P2P users cooperate for
improved performance? ACM Computer Commucation Review. 2007. doi:10.1145/1273445.1273449
apa: Aggarwal, V., Feldmann, A., & Scheideler, C. (2007). Can ISPs and P2P users
cooperate for improved performance? ACM Computer Commucation Review. https://doi.org/10.1145/1273445.1273449
bibtex: '@article{Aggarwal_Feldmann_Scheideler_2007, title={Can ISPs and P2P users
cooperate for improved performance?}, DOI={10.1145/1273445.1273449},
journal={ACM Computer Commucation Review}, author={Aggarwal, Vinay and Feldmann,
Anja and Scheideler, Christian}, year={2007} }'
chicago: Aggarwal, Vinay, Anja Feldmann, and Christian Scheideler. “Can ISPs and
P2P Users Cooperate for Improved Performance?” ACM Computer Commucation Review,
2007. https://doi.org/10.1145/1273445.1273449.
ieee: V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate
for improved performance?,” ACM Computer Commucation Review, 2007.
mla: Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?”
ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.
short: V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review
(2007).
date_created: 2018-04-05T06:08:43Z
date_updated: 2022-01-06T06:55:25Z
department:
- _id: '79'
doi: 10.1145/1273445.1273449
publication: ACM Computer Commucation Review
status: public
title: Can ISPs and P2P users cooperate for improved performance?
type: journal_article
user_id: '15504'
year: '2007'
...
---
_id: '7778'
citation:
ama: 'Engels G, Opdyke B, C. Schmidt D, Weil F, eds. Proceedings of the 10th
International Conference on Model Driven Engineering Languages and Systems (MoDELS
2007), Nashville, TN (USA). Vol 4735. Berlin/Heidelberg: Springer; 2007. doi:http://dx.doi.org/10.1007/978-3-540-75209-7'
apa: 'Engels, G., Opdyke, B., C. Schmidt, D., & Weil, F. (Eds.). (2007). Proceedings
of the 10th International Conference on Model Driven Engineering Languages and
Systems (MoDELS 2007), Nashville, TN (USA) (Vol. 4735). Berlin/Heidelberg:
Springer. http://dx.doi.org/10.1007/978-3-540-75209-7'
bibtex: '@book{Engels_Opdyke_C. Schmidt_Weil_2007, place={Berlin/Heidelberg}, series={LNCS},
title={Proceedings of the 10th International Conference on Model Driven Engineering
Languages and Systems (MoDELS 2007), Nashville, TN (USA)}, volume={4735}, DOI={http://dx.doi.org/10.1007/978-3-540-75209-7},
publisher={Springer}, year={2007}, collection={LNCS} }'
chicago: 'Engels, Gregor, B. Opdyke, D. C. Schmidt, and F. Weil, eds. Proceedings
of the 10th International Conference on Model Driven Engineering Languages and
Systems (MoDELS 2007), Nashville, TN (USA). Vol. 4735. LNCS. Berlin/Heidelberg:
Springer, 2007. http://dx.doi.org/10.1007/978-3-540-75209-7.'
ieee: 'G. Engels, B. Opdyke, D. C. Schmidt, and F. Weil, Eds., Proceedings of
the 10th International Conference on Model Driven Engineering Languages and Systems
(MoDELS 2007), Nashville, TN (USA), vol. 4735. Berlin/Heidelberg: Springer,
2007.'
mla: Engels, Gregor, et al., editors. Proceedings of the 10th International Conference
on Model Driven Engineering Languages and Systems (MoDELS 2007), Nashville, TN
(USA). Vol. 4735, Springer, 2007, doi:http://dx.doi.org/10.1007/978-3-540-75209-7.
short: G. Engels, B. Opdyke, D. C. Schmidt, F. Weil, eds., Proceedings of the 10th
International Conference on Model Driven Engineering Languages and Systems (MoDELS
2007), Nashville, TN (USA), Springer, Berlin/Heidelberg, 2007.
date_created: 2019-02-19T18:39:05Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1007/978-3-540-75209-7
editor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: B.
full_name: Opdyke, B.
last_name: Opdyke
- first_name: D.
full_name: C. Schmidt, D.
last_name: C. Schmidt
- first_name: F.
full_name: Weil, F.
last_name: Weil
intvolume: ' 4735'
language:
- iso: eng
place: Berlin/Heidelberg
publisher: Springer
series_title: LNCS
status: public
title: Proceedings of the 10th International Conference on Model Driven Engineering
Languages and Systems (MoDELS 2007), Nashville, TN (USA)
type: conference_editor
user_id: '52534'
volume: 4735
year: '2007'
...
---
_id: '7779'
citation:
ama: Pleuß A, Van den Bergh J, Hußmann H, Sauer S, Görlich D, eds. Proceedings
of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces
(MDDAUI ’07), Nashville, Tennessee (USA). Vol 297. University of Aachen; 2007.
apa: Pleuß, A., Van den Bergh, J., Hußmann, H., Sauer, S., & Görlich, D. (Eds.).
(2007). Proceedings of the MoDELS 2007 Workshop on Model Driven Development
of Advanced User Interfaces (MDDAUI ’07), Nashville, Tennessee (USA) (Vol.
297). University of Aachen.
bibtex: '@book{Pleuß_Van den Bergh_Hußmann_Sauer_Görlich_2007, series={CEUR Workshop
Proceedings}, title={Proceedings of the MoDELS 2007 Workshop on Model Driven Development
of Advanced User Interfaces (MDDAUI ’07), Nashville, Tennessee (USA)}, volume={297},
publisher={University of Aachen}, year={2007}, collection={CEUR Workshop Proceedings}
}'
chicago: Pleuß, Andreas, Jan Van den Bergh, Heinrich Hußmann, Stefan Sauer, and
Daniel Görlich, eds. Proceedings of the MoDELS 2007 Workshop on Model Driven
Development of Advanced User Interfaces (MDDAUI ’07), Nashville, Tennessee (USA).
Vol. 297. CEUR Workshop Proceedings. University of Aachen, 2007.
ieee: A. Pleuß, J. Van den Bergh, H. Hußmann, S. Sauer, and D. Görlich, Eds., Proceedings
of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces
(MDDAUI ’07), Nashville, Tennessee (USA), vol. 297. University of Aachen,
2007.
mla: Pleuß, Andreas, et al., editors. Proceedings of the MoDELS 2007 Workshop
on Model Driven Development of Advanced User Interfaces (MDDAUI ’07), Nashville,
Tennessee (USA). Vol. 297, University of Aachen, 2007.
short: A. Pleuß, J. Van den Bergh, H. Hußmann, S. Sauer, D. Görlich, eds., Proceedings
of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces
(MDDAUI ’07), Nashville, Tennessee (USA), University of Aachen, 2007.
date_created: 2019-02-19T18:40:19Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
editor:
- first_name: Andreas
full_name: Pleuß, Andreas
last_name: Pleuß
- first_name: Jan
full_name: Van den Bergh, Jan
last_name: Van den Bergh
- first_name: Heinrich
full_name: Hußmann, Heinrich
last_name: Hußmann
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
- first_name: Daniel
full_name: Görlich, Daniel
last_name: Görlich
intvolume: ' 297'
language:
- iso: eng
publisher: University of Aachen
series_title: CEUR Workshop Proceedings
status: public
title: Proceedings of the MoDELS 2007 Workshop on Model Driven Development of Advanced
User Interfaces (MDDAUI '07), Nashville, Tennessee (USA)
type: conference_editor
user_id: '52534'
volume: 297
year: '2007'
...
---
_id: '7958'
author:
- first_name: Tim
full_name: Schattkowsky, Tim
last_name: Schattkowsky
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Alexander
full_name: Förster, Alexander
last_name: Förster
citation:
ama: 'Schattkowsky T, Engels G, Förster A. A Model-Based Approach for Platform-Independent
Binary Components with Precise Timing and Fine-Grained Concurrency. In: Proceedings
of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007).
Washington, DC, USA: IEEE Computer Society; 2007:286ff. doi:http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22'
apa: 'Schattkowsky, T., Engels, G., & Förster, A. (2007). A Model-Based Approach
for Platform-Independent Binary Components with Precise Timing and Fine-Grained
Concurrency. In Proceedings of the 40th Annual Hawaii International Conference
on System Sciences (HICSS 2007) (p. 286ff.). Washington, DC, USA: IEEE Computer
Society. http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22'
bibtex: '@inproceedings{Schattkowsky_Engels_Förster_2007, place={Washington, DC,
USA}, title={A Model-Based Approach for Platform-Independent Binary Components
with Precise Timing and Fine-Grained Concurrency}, DOI={http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22},
booktitle={Proceedings of the 40th Annual Hawaii International Conference on System
Sciences (HICSS 2007)}, publisher={IEEE Computer Society}, author={Schattkowsky,
Tim and Engels, Gregor and Förster, Alexander}, year={2007}, pages={286ff.} }'
chicago: 'Schattkowsky, Tim, Gregor Engels, and Alexander Förster. “A Model-Based
Approach for Platform-Independent Binary Components with Precise Timing and Fine-Grained
Concurrency.” In Proceedings of the 40th Annual Hawaii International Conference
on System Sciences (HICSS 2007), 286ff. Washington, DC, USA: IEEE Computer
Society, 2007. http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22.'
ieee: T. Schattkowsky, G. Engels, and A. Förster, “A Model-Based Approach for Platform-Independent
Binary Components with Precise Timing and Fine-Grained Concurrency,” in Proceedings
of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007),
2007, p. 286ff.
mla: Schattkowsky, Tim, et al. “A Model-Based Approach for Platform-Independent
Binary Components with Precise Timing and Fine-Grained Concurrency.” Proceedings
of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007),
IEEE Computer Society, 2007, p. 286ff., doi:http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22.
short: 'T. Schattkowsky, G. Engels, A. Förster, in: Proceedings of the 40th Annual
Hawaii International Conference on System Sciences (HICSS 2007), IEEE Computer
Society, Washington, DC, USA, 2007, p. 286ff.'
date_created: 2019-02-21T11:56:25Z
date_updated: 2022-01-06T07:03:48Z
department:
- _id: '66'
doi: http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22
language:
- iso: eng
page: 286ff.
place: Washington, DC, USA
publication: Proceedings of the 40th Annual Hawaii International Conference on System
Sciences (HICSS 2007)
publisher: IEEE Computer Society
status: public
title: A Model-Based Approach for Platform-Independent Binary Components with Precise
Timing and Fine-Grained Concurrency
type: conference
user_id: '52534'
year: '2007'
...
---
_id: '7960'
author:
- first_name: Jochen
full_name: Küster, Jochen
last_name: Küster
- first_name: Ksenia
full_name: Ryndina, Ksenia
last_name: Ryndina
- first_name: Harald
full_name: Gall, Harald
last_name: Gall
citation:
ama: 'Küster J, Ryndina K, Gall H. Generation of Business Process Models for Object
Life Cycle Compliance. In: Proceedings of the Conference on Business Process
Management (BPM 2007), Brisbane (Australia). Vol 4714. LNCS. Berlin/Heidelberg:
Springer; 2007:165-181. doi:https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13'
apa: 'Küster, J., Ryndina, K., & Gall, H. (2007). Generation of Business Process
Models for Object Life Cycle Compliance. In Proceedings of the conference on
Business Process Management (BPM 2007), Brisbane (Australia) (Vol. 4714, pp.
165–181). Berlin/Heidelberg: Springer. https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13'
bibtex: '@inproceedings{Küster_Ryndina_Gall_2007, place={Berlin/Heidelberg}, series={LNCS},
title={Generation of Business Process Models for Object Life Cycle Compliance},
volume={4714}, DOI={https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13},
booktitle={Proceedings of the conference on Business Process Management (BPM 2007),
Brisbane (Australia)}, publisher={Springer}, author={Küster, Jochen and Ryndina,
Ksenia and Gall, Harald}, year={2007}, pages={165–181}, collection={LNCS} }'
chicago: 'Küster, Jochen, Ksenia Ryndina, and Harald Gall. “Generation of Business
Process Models for Object Life Cycle Compliance.” In Proceedings of the Conference
on Business Process Management (BPM 2007), Brisbane (Australia), 4714:165–81.
LNCS. Berlin/Heidelberg: Springer, 2007. https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13.'
ieee: J. Küster, K. Ryndina, and H. Gall, “Generation of Business Process Models
for Object Life Cycle Compliance,” in Proceedings of the conference on Business
Process Management (BPM 2007), Brisbane (Australia), 2007, vol. 4714, pp.
165–181.
mla: Küster, Jochen, et al. “Generation of Business Process Models for Object Life
Cycle Compliance.” Proceedings of the Conference on Business Process Management
(BPM 2007), Brisbane (Australia), vol. 4714, Springer, 2007, pp. 165–81, doi:https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13.
short: 'J. Küster, K. Ryndina, H. Gall, in: Proceedings of the Conference on Business
Process Management (BPM 2007), Brisbane (Australia), Springer, Berlin/Heidelberg,
2007, pp. 165–181.'
date_created: 2019-02-21T11:56:27Z
date_updated: 2022-01-06T07:03:48Z
department:
- _id: '66'
doi: https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13
intvolume: ' 4714'
language:
- iso: eng
page: 165-181
place: Berlin/Heidelberg
publication: Proceedings of the conference on Business Process Management (BPM 2007),
Brisbane (Australia)
publisher: Springer
series_title: LNCS
status: public
title: Generation of Business Process Models for Object Life Cycle Compliance
type: conference
user_id: '52534'
volume: 4714
year: '2007'
...
---
_id: '7961'
author:
- first_name: Andreas
full_name: Pleuß, Andreas
last_name: Pleuß
- first_name: Jan
full_name: Van den Bergh, Jan
last_name: Van den Bergh
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
- first_name: Heinrich
full_name: Hußmann, Heinrich
last_name: Hußmann
- first_name: Alexander
full_name: Bödcher, Alexander
last_name: Bödcher
citation:
ama: 'Pleuß A, Van den Bergh J, Sauer S, Hußmann H, Bödcher A. Model Driven Development
of Advanced User Interfaces (MDDAUI) - MDDAUI’06 Workshop Report. In: MoDELS
2006 Workshops. Vol 4364. LNCS. Berlin/Heidelberg: Springer; 2007:101-105.
doi:http://dx.doi.org/10.1007/978-3-540-69489-2_13'
apa: 'Pleuß, A., Van den Bergh, J., Sauer, S., Hußmann, H., & Bödcher, A. (2007).
Model Driven Development of Advanced User Interfaces (MDDAUI) - MDDAUI’06 Workshop
Report. In MoDELS 2006 Workshops (Vol. 4364, pp. 101–105). Berlin/Heidelberg:
Springer. http://dx.doi.org/10.1007/978-3-540-69489-2_13'
bibtex: '@inproceedings{Pleuß_Van den Bergh_Sauer_Hußmann_Bödcher_2007, place={Berlin/Heidelberg},
series={LNCS}, title={Model Driven Development of Advanced User Interfaces (MDDAUI)
- MDDAUI’06 Workshop Report}, volume={4364}, DOI={http://dx.doi.org/10.1007/978-3-540-69489-2_13},
booktitle={MoDELS 2006 Workshops}, publisher={Springer}, author={Pleuß, Andreas
and Van den Bergh, Jan and Sauer, Stefan and Hußmann, Heinrich and Bödcher, Alexander},
year={2007}, pages={101–105}, collection={LNCS} }'
chicago: 'Pleuß, Andreas, Jan Van den Bergh, Stefan Sauer, Heinrich Hußmann, and
Alexander Bödcher. “Model Driven Development of Advanced User Interfaces (MDDAUI)
- MDDAUI’06 Workshop Report.” In MoDELS 2006 Workshops, 4364:101–5. LNCS.
Berlin/Heidelberg: Springer, 2007. http://dx.doi.org/10.1007/978-3-540-69489-2_13.'
ieee: A. Pleuß, J. Van den Bergh, S. Sauer, H. Hußmann, and A. Bödcher, “Model Driven
Development of Advanced User Interfaces (MDDAUI) - MDDAUI’06 Workshop Report,”
in MoDELS 2006 Workshops, 2007, vol. 4364, pp. 101–105.
mla: Pleuß, Andreas, et al. “Model Driven Development of Advanced User Interfaces
(MDDAUI) - MDDAUI’06 Workshop Report.” MoDELS 2006 Workshops, vol. 4364,
Springer, 2007, pp. 101–05, doi:http://dx.doi.org/10.1007/978-3-540-69489-2_13.
short: 'A. Pleuß, J. Van den Bergh, S. Sauer, H. Hußmann, A. Bödcher, in: MoDELS
2006 Workshops, Springer, Berlin/Heidelberg, 2007, pp. 101–105.'
date_created: 2019-02-21T11:56:28Z
date_updated: 2022-01-06T07:03:48Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1007/978-3-540-69489-2_13
intvolume: ' 4364'
language:
- iso: eng
page: 101-105
place: Berlin/Heidelberg
publication: MoDELS 2006 Workshops
publisher: Springer
series_title: LNCS
status: public
title: Model Driven Development of Advanced User Interfaces (MDDAUI) - MDDAUI'06 Workshop
Report
type: conference
user_id: '52534'
volume: 4364
year: '2007'
...