---
_id: '747'
author:
- first_name: Sébastien
full_name: Auroux, Sébastien
id: '42575'
last_name: Auroux
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Auroux S, Karl H. Flexible reassignment of flow processing-aware controllers
in future wireless networks. In: 26th IEEE Annual International Symposium on
Personal, Indoor, and Mobile Radio Communications, PIMRC 2015, Hong Kong, China,
August 30 - September 2, 2015. ; 2015:1850--1855. doi:10.1109/PIMRC.2015.7343600'
apa: Auroux, S., & Karl, H. (2015). Flexible reassignment of flow processing-aware
controllers in future wireless networks. In 26th IEEE Annual International
Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2015, Hong
Kong, China, August 30 - September 2, 2015 (pp. 1850--1855). https://doi.org/10.1109/PIMRC.2015.7343600
bibtex: '@inproceedings{Auroux_Karl_2015, title={Flexible reassignment of flow processing-aware
controllers in future wireless networks}, DOI={10.1109/PIMRC.2015.7343600},
booktitle={26th IEEE Annual International Symposium on Personal, Indoor, and Mobile
Radio Communications, PIMRC 2015, Hong Kong, China, August 30 - September 2, 2015},
author={Auroux, Sébastien and Karl, Holger}, year={2015}, pages={1850--1855} }'
chicago: Auroux, Sébastien, and Holger Karl. “Flexible Reassignment of Flow Processing-Aware
Controllers in Future Wireless Networks.” In 26th IEEE Annual International
Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2015, Hong
Kong, China, August 30 - September 2, 2015, 1850--1855, 2015. https://doi.org/10.1109/PIMRC.2015.7343600.
ieee: S. Auroux and H. Karl, “Flexible reassignment of flow processing-aware controllers
in future wireless networks,” in 26th IEEE Annual International Symposium on
Personal, Indoor, and Mobile Radio Communications, PIMRC 2015, Hong Kong, China,
August 30 - September 2, 2015, 2015, pp. 1850--1855.
mla: Auroux, Sébastien, and Holger Karl. “Flexible Reassignment of Flow Processing-Aware
Controllers in Future Wireless Networks.” 26th IEEE Annual International Symposium
on Personal, Indoor, and Mobile Radio Communications, PIMRC 2015, Hong Kong, China,
August 30 - September 2, 2015, 2015, pp. 1850--1855, doi:10.1109/PIMRC.2015.7343600.
short: 'S. Auroux, H. Karl, in: 26th IEEE Annual International Symposium on Personal,
Indoor, and Mobile Radio Communications, PIMRC 2015, Hong Kong, China, August
30 - September 2, 2015, 2015, pp. 1850--1855.'
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:38Z
department:
- _id: '75'
doi: 10.1109/PIMRC.2015.7343600
ec_funded: '1'
page: 1850--1855
project:
- _id: '22'
call_identifier: FP7-ICT-2011-C
grant_number: '318115'
name: Connectivity management for eneRgy Optimised Wireless Dense works
publication: 26th IEEE Annual International Symposium on Personal, Indoor, and Mobile
Radio Communications, PIMRC 2015, Hong Kong, China, August 30 - September 2, 2015
status: public
title: Flexible reassignment of flow processing-aware controllers in future wireless
networks
type: conference
user_id: '15572'
year: '2015'
...
---
_id: '748'
author:
- first_name: Sébastien
full_name: Auroux, Sébastien
id: '42575'
last_name: Auroux
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Auroux S, Karl H. Efficient flow processing-aware controller placement in
future wireless networks. In: 2015 IEEE Wireless Communications and Networking
Conference, WCNC 2015, New Orleans, LA, USA, March 9-12, 2015. ; 2015:1787--1792.
doi:10.1109/WCNC.2015.7127739'
apa: Auroux, S., & Karl, H. (2015). Efficient flow processing-aware controller
placement in future wireless networks. In 2015 IEEE Wireless Communications
and Networking Conference, WCNC 2015, New Orleans, LA, USA, March 9-12, 2015
(pp. 1787--1792). https://doi.org/10.1109/WCNC.2015.7127739
bibtex: '@inproceedings{Auroux_Karl_2015, title={Efficient flow processing-aware
controller placement in future wireless networks}, DOI={10.1109/WCNC.2015.7127739},
booktitle={2015 IEEE Wireless Communications and Networking Conference, WCNC 2015,
New Orleans, LA, USA, March 9-12, 2015}, author={Auroux, Sébastien and Karl, Holger},
year={2015}, pages={1787--1792} }'
chicago: Auroux, Sébastien, and Holger Karl. “Efficient Flow Processing-Aware Controller
Placement in Future Wireless Networks.” In 2015 IEEE Wireless Communications
and Networking Conference, WCNC 2015, New Orleans, LA, USA, March 9-12, 2015,
1787--1792, 2015. https://doi.org/10.1109/WCNC.2015.7127739.
ieee: S. Auroux and H. Karl, “Efficient flow processing-aware controller placement
in future wireless networks,” in 2015 IEEE Wireless Communications and Networking
Conference, WCNC 2015, New Orleans, LA, USA, March 9-12, 2015, 2015, pp. 1787--1792.
mla: Auroux, Sébastien, and Holger Karl. “Efficient Flow Processing-Aware Controller
Placement in Future Wireless Networks.” 2015 IEEE Wireless Communications and
Networking Conference, WCNC 2015, New Orleans, LA, USA, March 9-12, 2015,
2015, pp. 1787--1792, doi:10.1109/WCNC.2015.7127739.
short: 'S. Auroux, H. Karl, in: 2015 IEEE Wireless Communications and Networking
Conference, WCNC 2015, New Orleans, LA, USA, March 9-12, 2015, 2015, pp. 1787--1792.'
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:38Z
department:
- _id: '75'
doi: 10.1109/WCNC.2015.7127739
ec_funded: '1'
page: 1787--1792
project:
- _id: '22'
call_identifier: FP7-ICT-2011-C
grant_number: '318115'
name: Connectivity management for eneRgy Optimised Wireless Dense works
publication: 2015 IEEE Wireless Communications and Networking Conference, WCNC 2015,
New Orleans, LA, USA, March 9-12, 2015
status: public
title: Efficient flow processing-aware controller placement in future wireless networks
type: conference
user_id: '15572'
year: '2015'
...
---
_id: '749'
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Dräxler S, Karl H. Specification of Complex Structures in Distributed Service
Function Chaining Using a YANG Data Model. CoRR. 2015.
apa: Dräxler, S., & Karl, H. (2015). Specification of Complex Structures in
Distributed Service Function Chaining Using a YANG Data Model. CoRR.
bibtex: '@article{Dräxler_Karl_2015, title={Specification of Complex Structures
in Distributed Service Function Chaining Using a YANG Data Model}, journal={CoRR},
author={Dräxler, Sevil and Karl, Holger}, year={2015} }'
chicago: Dräxler, Sevil, and Holger Karl. “Specification of Complex Structures in
Distributed Service Function Chaining Using a YANG Data Model.” CoRR, 2015.
ieee: S. Dräxler and H. Karl, “Specification of Complex Structures in Distributed
Service Function Chaining Using a YANG Data Model,” CoRR. 2015.
mla: Dräxler, Sevil, and Holger Karl. “Specification of Complex Structures in Distributed
Service Function Chaining Using a YANG Data Model.” CoRR, 2015.
short: S. Dräxler, H. Karl, CoRR (2015).
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:39Z
department:
- _id: '75'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1503.02442
oa: '1'
publication: CoRR
status: public
title: Specification of Complex Structures in Distributed Service Function Chaining
Using a YANG Data Model
type: preprint
user_id: '31764'
year: '2015'
...
---
_id: '750'
author:
- first_name: Martin
full_name: Dräxler, Martin
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: Dräxler M, Karl H. Dynamic Backhaul Network Configuration in SDN-based Cloud
RANs. CoRR. 2015.
apa: Dräxler, M., & Karl, H. (2015). Dynamic Backhaul Network Configuration
in SDN-based Cloud RANs. CoRR.
bibtex: '@article{Dräxler_Karl_2015, title={Dynamic Backhaul Network Configuration
in SDN-based Cloud RANs}, journal={CoRR}, author={Dräxler, Martin and Karl, Holger},
year={2015} }'
chicago: Dräxler, Martin, and Holger Karl. “Dynamic Backhaul Network Configuration
in SDN-Based Cloud RANs.” CoRR, 2015.
ieee: M. Dräxler and H. Karl, “Dynamic Backhaul Network Configuration in SDN-based
Cloud RANs,” CoRR. 2015.
mla: Dräxler, Martin, and Holger Karl. “Dynamic Backhaul Network Configuration in
SDN-Based Cloud RANs.” CoRR, 2015.
short: M. Dräxler, H. Karl, CoRR (2015).
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:39Z
department:
- _id: '75'
publication: CoRR
status: public
title: Dynamic Backhaul Network Configuration in SDN-based Cloud RANs
type: preprint
user_id: '15572'
year: '2015'
...
---
_id: '7568'
abstract:
- lang: eng
text: 'Today''s web search and big data analytics applications aim to address information
needs~(typically given in the form of search queries) ad-hoc on large numbers
of texts. In order to directly return relevant information instead of only returning
potentially relevant texts, these applications have begun to employ text mining.
The term text mining covers tasks that deal with the inference of structured high-quality
information from collections and streams of unstructured input texts. Text mining
requires task-specific text analysis processes that may consist of several interdependent
steps. These processes are realized with sequences of algorithms from information
extraction, text classification, and natural language processing. However, the
use of such text analysis pipelines is still restricted to addressing a few predefined
information needs. We argue that the reasons behind are three-fold: First, text
analysis pipelines are usually made manually in respect of the given information
need and input texts, because their design requires expert knowledge about the
algorithms to be employed. When information needs have to be addressed that are
unknown beforehand, text mining hence cannot be performed ad-hoc. Second, text
analysis pipelines tend to be inefficient in terms of run-time, because their
execution often includes analyzing texts with computationally expensive algorithms.
When information needs have to be addressed ad-hoc, text mining hence cannot be
performed in the large. And third, text analysis pipelines tend not to robustly
achieve high effectiveness on all texts, because their results are often inferred
by algorithms that rely on domain-dependent features of texts. Hence, text mining
currently cannot guarantee to infer high-quality information. In this thesis,
we contribute to the question of how to address information needs from text mining
ad-hoc in an efficient and domain-robust manner. We observe that knowledge about
a text analysis process and information obtained within the process help to improve
the design, the execution, and the results of the pipeline that realizes the process.
To this end, we apply different techniques from classical and statistical artificial
intelligence. In particular, we first develop knowledge-based approaches for an
ad-hoc pipeline construction and for an optimal execution of a pipeline on its
input. Then, we show theoretically and practically how to optimize and adapt the
schedule of the algorithms in a pipeline based on information in the analyzed
input texts in order to maximize execution efficiency. Finally, we learn patterns
in the argumentation structures of texts statistically that remain strongly invariant
across domains and that, thereby, allow for more robust analysis results in a
restricted set of tasks. We formally analyze all developed approaches and we implement
them as open-source software applications. Based on these applications, we evaluate
the approaches on established and on newly created collections of texts for scientifically
and industrially important text analysis tasks, such as financial event extraction
and fine-grained sentiment analysis. Our findings show that text analysis pipelines
can be designed automatically, which process only portions of text that are relevant
for the information need at hand. Through scheduling, the run-time efficiency
of pipelines can be improved by up to more than one order of magnitude while maintaining
effectiveness. Moreover, we provide evidence that a pipeline''s domain robustness
substantially benefits from focusing on argumentation structure in tasks like
sentiment analysis. We conclude that our approaches denote essential building
blocks of enabling ad-hoc large-scale text mining in web search and big data analytics
applications.'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: Wachsmuth H. Pipelines for Ad-Hoc Large-Scale Text Mining.; 2015.
apa: Wachsmuth, H. (2015). Pipelines for Ad-hoc Large-scale Text Mining.
bibtex: '@book{Wachsmuth_2015, title={Pipelines for Ad-hoc Large-scale Text Mining},
author={Wachsmuth, Henning}, year={2015} }'
chicago: Wachsmuth, Henning. Pipelines for Ad-Hoc Large-Scale Text Mining,
2015.
ieee: H. Wachsmuth, Pipelines for Ad-hoc Large-scale Text Mining. 2015.
mla: Wachsmuth, Henning. Pipelines for Ad-Hoc Large-Scale Text Mining. 2015.
short: H. Wachsmuth, Pipelines for Ad-Hoc Large-Scale Text Mining, 2015.
date_created: 2019-02-06T14:14:29Z
date_updated: 2022-01-06T07:03:39Z
department:
- _id: '66'
- _id: '600'
language:
- iso: eng
related_material:
link:
- relation: confirmation
url: https://webis.de/downloads/publications/papers/wachsmuth_2013.pdf
status: public
title: Pipelines for Ad-hoc Large-scale Text Mining
type: dissertation
user_id: '82920'
year: '2015'
...
---
_id: '8491'
author:
- first_name: 'Mahdi '
full_name: 'Derakhshanmanesh , Mahdi '
last_name: 'Derakhshanmanesh '
- first_name: 'Jürgen '
full_name: 'Ebert , Jürgen '
last_name: 'Ebert '
- first_name: 'Marvin '
full_name: 'Grieger, Marvin '
last_name: Grieger
citation:
ama: 'Derakhshanmanesh M, Ebert J, Grieger M. Challenges for Model-Integrating
Components. In: Proceedings of the 2nd International Workshop on Model-Driven
Engineering for Component-Based Software Systems Co-Located with ACM/IEEE 18th
International Conference on Model Driven Engineering Languages & Systems (MoDELS
2015). Vol 1463. CEUR Workshop Proceedings; 2015:6-11.'
apa: Derakhshanmanesh , M., Ebert , J., & Grieger, M. (2015). Challenges for
Model-Integrating Components. In Proceedings of the 2nd International Workshop
on Model-Driven Engineering for Component-Based Software Systems co-located with
ACM/IEEE 18th International Conference on Model Driven Engineering Languages &
Systems (MoDELS 2015) (Vol. 1463, pp. 6–11). CEUR Workshop Proceedings.
bibtex: '@inproceedings{Derakhshanmanesh _Ebert _Grieger_2015, title={Challenges
for Model-Integrating Components}, volume={1463}, booktitle={Proceedings of the
2nd International Workshop on Model-Driven Engineering for Component-Based Software
Systems co-located with ACM/IEEE 18th International Conference on Model Driven
Engineering Languages & Systems (MoDELS 2015)}, publisher={CEUR Workshop Proceedings},
author={Derakhshanmanesh , Mahdi and Ebert , Jürgen and Grieger, Marvin }, year={2015},
pages={6–11} }'
chicago: Derakhshanmanesh , Mahdi , Jürgen Ebert , and Marvin Grieger. “Challenges
for Model-Integrating Components.” In Proceedings of the 2nd International
Workshop on Model-Driven Engineering for Component-Based Software Systems Co-Located
with ACM/IEEE 18th International Conference on Model Driven Engineering Languages
& Systems (MoDELS 2015), 1463:6–11. CEUR Workshop Proceedings, 2015.
ieee: M. Derakhshanmanesh , J. Ebert , and M. Grieger, “Challenges for Model-Integrating
Components,” in Proceedings of the 2nd International Workshop on Model-Driven
Engineering for Component-Based Software Systems co-located with ACM/IEEE 18th
International Conference on Model Driven Engineering Languages & Systems (MoDELS
2015), 2015, vol. 1463, pp. 6–11.
mla: Derakhshanmanesh , Mahdi, et al. “Challenges for Model-Integrating Components.”
Proceedings of the 2nd International Workshop on Model-Driven Engineering for
Component-Based Software Systems Co-Located with ACM/IEEE 18th International Conference
on Model Driven Engineering Languages & Systems (MoDELS 2015), vol. 1463,
CEUR Workshop Proceedings, 2015, pp. 6–11.
short: 'M. Derakhshanmanesh , J. Ebert , M. Grieger, in: Proceedings of the 2nd
International Workshop on Model-Driven Engineering for Component-Based Software
Systems Co-Located with ACM/IEEE 18th International Conference on Model Driven
Engineering Languages & Systems (MoDELS 2015), CEUR Workshop Proceedings,
2015, pp. 6–11.'
date_created: 2019-03-08T14:15:26Z
date_updated: 2022-01-06T07:03:56Z
department:
- _id: '66'
intvolume: ' 1463'
language:
- iso: eng
page: 6-11
publication: Proceedings of the 2nd International Workshop on Model-Driven Engineering
for Component-Based Software Systems co-located with ACM/IEEE 18th International
Conference on Model Driven Engineering Languages & Systems (MoDELS 2015)
publisher: CEUR Workshop Proceedings
status: public
title: Challenges for Model-Integrating Components
type: conference
user_id: '52534'
volume: 1463
year: '2015'
...
---
_id: '8492'
author:
- first_name: 'Mahdi '
full_name: 'Derakhshanmanesh , Mahdi '
last_name: 'Derakhshanmanesh '
- first_name: 'Marvin '
full_name: 'Grieger, Marvin '
last_name: Grieger
citation:
ama: 'Derakhshanmanesh M, Grieger M. On Enabling Technologies for Longevity in
Software. In: Gemeinsamer Tagungsband Der Workshops Der Tagung Software Engineering
2015. Vol 1337. CEUR Workshop Proceedings; 2015:112-114.'
apa: Derakhshanmanesh , M., & Grieger, M. (2015). On Enabling Technologies for
Longevity in Software. In Gemeinsamer Tagungsband der Workshops der Tagung
Software Engineering 2015 (Vol. 1337, pp. 112–114). CEUR Workshop Proceedings.
bibtex: '@inproceedings{Derakhshanmanesh _Grieger_2015, title={On Enabling Technologies
for Longevity in Software}, volume={1337}, booktitle={Gemeinsamer Tagungsband
der Workshops der Tagung Software Engineering 2015}, publisher={CEUR Workshop
Proceedings}, author={Derakhshanmanesh , Mahdi and Grieger, Marvin }, year={2015},
pages={112–114} }'
chicago: Derakhshanmanesh , Mahdi , and Marvin Grieger. “On Enabling Technologies
for Longevity in Software.” In Gemeinsamer Tagungsband Der Workshops Der Tagung
Software Engineering 2015, 1337:112–14. CEUR Workshop Proceedings, 2015.
ieee: M. Derakhshanmanesh and M. Grieger, “On Enabling Technologies for Longevity
in Software,” in Gemeinsamer Tagungsband der Workshops der Tagung Software
Engineering 2015, 2015, vol. 1337, pp. 112–114.
mla: Derakhshanmanesh , Mahdi, and Marvin Grieger. “On Enabling Technologies for
Longevity in Software.” Gemeinsamer Tagungsband Der Workshops Der Tagung Software
Engineering 2015, vol. 1337, CEUR Workshop Proceedings, 2015, pp. 112–14.
short: 'M. Derakhshanmanesh , M. Grieger, in: Gemeinsamer Tagungsband Der Workshops
Der Tagung Software Engineering 2015, CEUR Workshop Proceedings, 2015, pp. 112–114.'
date_created: 2019-03-08T14:17:37Z
date_updated: 2022-01-06T07:03:56Z
department:
- _id: '66'
intvolume: ' 1337'
language:
- iso: eng
main_file_link:
- url: http://ceur-ws.org/Vol-1337/paper18.pdf
page: 112-114
publication: Gemeinsamer Tagungsband der Workshops der Tagung Software Engineering
2015
publisher: CEUR Workshop Proceedings
status: public
title: On Enabling Technologies for Longevity in Software
type: conference
user_id: '52534'
volume: 1337
year: '2015'
...
---
_id: '8493'
author:
- first_name: 'Mahdi '
full_name: 'Derakhshanmanesh , Mahdi '
last_name: 'Derakhshanmanesh '
- first_name: 'Marvin '
full_name: 'Grieger , Marvin '
last_name: 'Grieger '
- first_name: 'Jürgen '
full_name: 'Ebert, Jürgen '
last_name: Ebert
citation:
ama: 'Derakhshanmanesh M, Grieger M, Ebert J. On the Need for Transactional Models@Run.Time.
In: Proceedings of the 10th Workshop on Models@run.Time Co-Located with 18th
International Conference on Model Driven Engineering Languages and Systems (MODELS
2015). Vol 1474. CEUR Workshop Proceedings; 2015:21-30.'
apa: Derakhshanmanesh , M., Grieger , M., & Ebert, J. (2015). On the Need for
Transactional Models@Run.Time. In Proceedings of the 10th Workshop on Models@run.time
co-located with 18th International Conference on Model Driven Engineering Languages
and Systems (MODELS 2015) (Vol. 1474, pp. 21–30). CEUR Workshop Proceedings.
bibtex: '@inproceedings{Derakhshanmanesh _Grieger _Ebert_2015, title={On the Need
for Transactional Models@Run.Time}, volume={1474}, booktitle={Proceedings of the
10th Workshop on Models@run.time co-located with 18th International Conference
on Model Driven Engineering Languages and Systems (MODELS 2015)}, publisher={CEUR
Workshop Proceedings}, author={Derakhshanmanesh , Mahdi and Grieger , Marvin and
Ebert, Jürgen }, year={2015}, pages={21–30} }'
chicago: Derakhshanmanesh , Mahdi , Marvin Grieger , and Jürgen Ebert. “On the
Need for Transactional Models@Run.Time.” In Proceedings of the 10th Workshop
on Models@run.Time Co-Located with 18th International Conference on Model Driven
Engineering Languages and Systems (MODELS 2015), 1474:21–30. CEUR Workshop
Proceedings, 2015.
ieee: M. Derakhshanmanesh , M. Grieger , and J. Ebert, “On the Need for Transactional
Models@Run.Time,” in Proceedings of the 10th Workshop on Models@run.time co-located
with 18th International Conference on Model Driven Engineering Languages and Systems
(MODELS 2015), 2015, vol. 1474, pp. 21–30.
mla: Derakhshanmanesh , Mahdi, et al. “On the Need for Transactional Models@Run.Time.”
Proceedings of the 10th Workshop on Models@run.Time Co-Located with 18th International
Conference on Model Driven Engineering Languages and Systems (MODELS 2015),
vol. 1474, CEUR Workshop Proceedings, 2015, pp. 21–30.
short: 'M. Derakhshanmanesh , M. Grieger , J. Ebert, in: Proceedings of the 10th
Workshop on Models@run.Time Co-Located with 18th International Conference on Model
Driven Engineering Languages and Systems (MODELS 2015), CEUR Workshop Proceedings,
2015, pp. 21–30.'
date_created: 2019-03-08T14:19:42Z
date_updated: 2022-01-06T07:03:56Z
department:
- _id: '66'
intvolume: ' 1474'
language:
- iso: eng
page: 21-30
publication: Proceedings of the 10th Workshop on Models@run.time co-located with 18th
International Conference on Model Driven Engineering Languages and Systems (MODELS
2015)
publisher: CEUR Workshop Proceedings
status: public
title: On the Need for Transactional Models@Run.Time
type: conference
user_id: '52534'
volume: 1474
year: '2015'
...
---
_id: '986'
abstract:
- lang: eng
text: "The increasing amount of mobile traffic leads to a significantly higher energy
consumption of mobile networks that is mainly caused by the high number of required
base stations. One recent solution for this is based on a two-layered network
that uses long-range macro cells to provide a full coverage signaling overlay
and short-range small cells for fast data transmissions. These small cells can
be switched off when they are not needed and allow network-wide energy optimizations.\r\n\r\nThis
paper presents an architecture that extends existing mobile networks to integrate
a small cell layer that supports on-demand cell activation. We discuss how additional
small cells can be interconnected with existing core components and how they can
be controlled by a resource management component. \r\nFinally, a Wi-Fi based proof
of concept testbed implementation is presented that demonstrates the feasibility
of the approach."
accept: '1'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Karl H. An Architecture for Energy-aware On-demand Mobile Network
Management. In: Proceedings of the 5th Workshop on All Things Cellular: Operations,
Applications and Challenges. ; 2015.'
apa: 'Peuster, M., & Karl, H. (2015). An Architecture for Energy-aware On-demand
Mobile Network Management. In Proceedings of the 5th Workshop on All Things
Cellular: Operations, Applications and Challenges. London.'
bibtex: '@inproceedings{Peuster_Karl_2015, title={An Architecture for Energy-aware
On-demand Mobile Network Management}, booktitle={Proceedings of the 5th Workshop
on All Things Cellular: Operations, Applications and Challenges}, author={Peuster,
Manuel and Karl, Holger}, year={2015} }'
chicago: 'Peuster, Manuel, and Holger Karl. “An Architecture for Energy-Aware On-Demand
Mobile Network Management.” In Proceedings of the 5th Workshop on All Things
Cellular: Operations, Applications and Challenges, 2015.'
ieee: 'M. Peuster and H. Karl, “An Architecture for Energy-aware On-demand Mobile
Network Management,” in Proceedings of the 5th Workshop on All Things Cellular:
Operations, Applications and Challenges, London, 2015.'
mla: 'Peuster, Manuel, and Holger Karl. “An Architecture for Energy-Aware On-Demand
Mobile Network Management.” Proceedings of the 5th Workshop on All Things Cellular:
Operations, Applications and Challenges, 2015.'
short: 'M. Peuster, H. Karl, in: Proceedings of the 5th Workshop on All Things Cellular:
Operations, Applications and Challenges, 2015.'
conference:
location: London
name: 'Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications
and Challenges'
date_created: 2017-11-27T10:22:29Z
date_updated: 2019-01-03T13:18:55Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:06:06Z
date_updated: 2018-11-02T14:06:06Z
file_id: '5261'
file_name: p25-peuster.pdf
file_size: 1916017
open_access: 1
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:06:06Z
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/citation.cfm?id=2785973
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 'Proceedings of the 5th Workshop on All Things Cellular: Operations,
Applications and Challenges'
publication_status: published
status: public
title: An Architecture for Energy-aware On-demand Mobile Network Management
type: conference
user_id: '477'
year: '2015'
...
---
_id: '5207'
author:
- first_name: Li
full_name: Li, Li
last_name: Li
- first_name: Alexandre
full_name: Bartel, Alexandre
last_name: Bartel
- first_name: Tegawende F.
full_name: Bissyande, Tegawende F.
last_name: Bissyande
- first_name: Jacques
full_name: Klein, Jacques
last_name: Klein
- first_name: Yves
full_name: Le Traon, Yves
last_name: Le Traon
- first_name: Steven
full_name: Arzt, Steven
last_name: Arzt
- first_name: Siegfried
full_name: Rasthofer, Siegfried
last_name: Rasthofer
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Damien
full_name: Octeau, Damien
last_name: Octeau
- first_name: Patrick
full_name: McDaniel, Patrick
last_name: McDaniel
citation:
ama: 'Li L, Bartel A, Bissyande TF, et al. IccTA: Detecting Inter-Component Privacy
Leaks in Android Apps. In: 2015 International Conference on Software Engineering
(ICSE). ; 2015:280-291.'
apa: 'Li, L., Bartel, A., Bissyande, T. F., Klein, J., Le Traon, Y., Arzt, S., …
McDaniel, P. (2015). IccTA: Detecting Inter-Component Privacy Leaks in Android
Apps. In 2015 International Conference on Software Engineering (ICSE) (pp.
280–291).'
bibtex: '@inproceedings{Li_Bartel_Bissyande_Klein_Le Traon_Arzt_Rasthofer_Bodden_Octeau_McDaniel_2015,
title={IccTA: Detecting Inter-Component Privacy Leaks in Android Apps}, booktitle={2015
International Conference on Software Engineering (ICSE)}, author={Li, Li and Bartel,
Alexandre and Bissyande, Tegawende F. and Klein, Jacques and Le Traon, Yves and
Arzt, Steven and Rasthofer, Siegfried and Bodden, Eric and Octeau, Damien and
McDaniel, Patrick}, year={2015}, pages={280–291} }'
chicago: 'Li, Li, Alexandre Bartel, Tegawende F. Bissyande, Jacques Klein, Yves
Le Traon, Steven Arzt, Siegfried Rasthofer, Eric Bodden, Damien Octeau, and Patrick
McDaniel. “IccTA: Detecting Inter-Component Privacy Leaks in Android Apps.” In
2015 International Conference on Software Engineering (ICSE), 280–91, 2015.'
ieee: 'L. Li et al., “IccTA: Detecting Inter-Component Privacy Leaks in Android
Apps,” in 2015 International Conference on Software Engineering (ICSE),
2015, pp. 280–291.'
mla: 'Li, Li, et al. “IccTA: Detecting Inter-Component Privacy Leaks in Android
Apps.” 2015 International Conference on Software Engineering (ICSE), 2015,
pp. 280–91.'
short: 'L. Li, A. Bartel, T.F. Bissyande, J. Klein, Y. Le Traon, S. Arzt, S. Rasthofer,
E. Bodden, D. Octeau, P. McDaniel, in: 2015 International Conference on Software
Engineering (ICSE), 2015, pp. 280–291.'
date_created: 2018-10-31T12:59:44Z
date_updated: 2022-01-06T07:01:46Z
ddc:
- '000'
department:
- _id: '76'
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:10:22Z
date_updated: 2018-11-02T14:10:22Z
file_id: '5263'
file_name: lbb+15iccta.pdf
file_size: 206378
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:10:22Z
has_accepted_license: '1'
keyword:
- CROSSING
- ATTRACT
- ITSECWEBSITE
language:
- iso: eng
main_file_link:
- url: http://www.bodden.de/pubs/lbb+15iccta.pdf
page: 280-291
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: 2015 International Conference on Software Engineering (ICSE)
publication_identifier:
isbn:
- 978-1-4799-1934-5
status: public
title: 'IccTA: Detecting Inter-Component Privacy Leaks in Android Apps'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '5413'
author:
- first_name: Lukas
full_name: Funke, Lukas
last_name: Funke
citation:
ama: Funke L. An LLVM Based Toolchain for Transparent Acceleration of Digital
Image Processing Applications Using FPGA Overlay Architectures. Universität
Paderborn; 2015.
apa: Funke, L. (2015). An LLVM Based Toolchain for Transparent Acceleration of
Digital Image Processing Applications using FPGA Overlay Architectures. Universität
Paderborn.
bibtex: '@book{Funke_2015, title={An LLVM Based Toolchain for Transparent Acceleration
of Digital Image Processing Applications using FPGA Overlay Architectures}, publisher={Universität
Paderborn}, author={Funke, Lukas}, year={2015} }'
chicago: Funke, Lukas. An LLVM Based Toolchain for Transparent Acceleration of
Digital Image Processing Applications Using FPGA Overlay Architectures. Universität
Paderborn, 2015.
ieee: L. Funke, An LLVM Based Toolchain for Transparent Acceleration of Digital
Image Processing Applications using FPGA Overlay Architectures. Universität
Paderborn, 2015.
mla: Funke, Lukas. An LLVM Based Toolchain for Transparent Acceleration of Digital
Image Processing Applications Using FPGA Overlay Architectures. Universität
Paderborn, 2015.
short: L. Funke, An LLVM Based Toolchain for Transparent Acceleration of Digital
Image Processing Applications Using FPGA Overlay Architectures, Universität Paderborn,
2015.
date_created: 2018-11-07T15:10:35Z
date_updated: 2022-01-06T07:01:52Z
department:
- _id: '27'
- _id: '518'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: An LLVM Based Toolchain for Transparent Acceleration of Digital Image Processing
Applications using FPGA Overlay Architectures
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '5416'
author:
- first_name: Thomas
full_name: Löcke, Thomas
last_name: Löcke
citation:
ama: Löcke T. Instance-Specific Computing in Hard- and Software for Faster Solving
of Complex Problems. Universität Paderborn; 2015.
apa: Löcke, T. (2015). Instance-Specific Computing in Hard- and Software for
Faster Solving of Complex Problems. Universität Paderborn.
bibtex: '@book{Löcke_2015, title={Instance-Specific Computing in Hard- and Software
for Faster Solving of Complex Problems}, publisher={Universität Paderborn}, author={Löcke,
Thomas}, year={2015} }'
chicago: Löcke, Thomas. Instance-Specific Computing in Hard- and Software for
Faster Solving of Complex Problems. Universität Paderborn, 2015.
ieee: T. Löcke, Instance-Specific Computing in Hard- and Software for Faster
Solving of Complex Problems. Universität Paderborn, 2015.
mla: Löcke, Thomas. Instance-Specific Computing in Hard- and Software for Faster
Solving of Complex Problems. Universität Paderborn, 2015.
short: T. Löcke, Instance-Specific Computing in Hard- and Software for Faster Solving
of Complex Problems, Universität Paderborn, 2015.
date_created: 2018-11-07T16:06:53Z
date_updated: 2022-01-06T07:01:52Z
department:
- _id: '27'
- _id: '518'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Instance-Specific Computing in Hard- and Software for Faster Solving of Complex
Problems
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '5419'
author:
- first_name: Felix
full_name: Wallaschek, Felix
last_name: Wallaschek
citation:
ama: Wallaschek F. Accelerating Programmable Logic Controllers with the Use of
FPGAs. Universität Paderborn; 2015.
apa: Wallaschek, F. (2015). Accelerating Programmable Logic Controllers with
the use of FPGAs. Universität Paderborn.
bibtex: '@book{Wallaschek_2015, title={Accelerating Programmable Logic Controllers
with the use of FPGAs}, publisher={Universität Paderborn}, author={Wallaschek,
Felix}, year={2015} }'
chicago: Wallaschek, Felix. Accelerating Programmable Logic Controllers with
the Use of FPGAs. Universität Paderborn, 2015.
ieee: F. Wallaschek, Accelerating Programmable Logic Controllers with the use
of FPGAs. Universität Paderborn, 2015.
mla: Wallaschek, Felix. Accelerating Programmable Logic Controllers with the
Use of FPGAs. Universität Paderborn, 2015.
short: F. Wallaschek, Accelerating Programmable Logic Controllers with the Use of
FPGAs, Universität Paderborn, 2015.
date_created: 2018-11-07T16:14:30Z
date_updated: 2022-01-06T07:01:52Z
department:
- _id: '27'
- _id: '518'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
name: SFB 901 - Subproject C2
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Accelerating Programmable Logic Controllers with the use of FPGAs
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '6726'
author:
- first_name: Wojciech
full_name: Czerwinski, Wojciech
last_name: Czerwinski
- first_name: Wim
full_name: Martens, Wim
last_name: Martens
- first_name: Lorijn
full_name: van Rooijen, Lorijn
id: '58843'
last_name: van Rooijen
- first_name: Marc
full_name: Zeitoun, Marc
last_name: Zeitoun
citation:
ama: 'Czerwinski W, Martens W, van Rooijen L, Zeitoun M. A Note on Decidable Separability
by Piecewise Testable Languages. In: Fundamentals of Computation Theory - 20th
International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings.
; 2015:173-185. doi:10.1007/978-3-319-22177-9\_14'
apa: Czerwinski, W., Martens, W., van Rooijen, L., & Zeitoun, M. (2015). A Note
on Decidable Separability by Piecewise Testable Languages. In Fundamentals
of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland,
August 17-19, 2015, Proceedings (pp. 173–185). https://doi.org/10.1007/978-3-319-22177-9\_14
bibtex: '@inproceedings{Czerwinski_Martens_van Rooijen_Zeitoun_2015, title={A Note
on Decidable Separability by Piecewise Testable Languages}, DOI={10.1007/978-3-319-22177-9\_14},
booktitle={Fundamentals of Computation Theory - 20th International Symposium,
(FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings}, author={Czerwinski,
Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun, Marc}, year={2015},
pages={173–185} }'
chicago: Czerwinski, Wojciech, Wim Martens, Lorijn van Rooijen, and Marc Zeitoun.
“A Note on Decidable Separability by Piecewise Testable Languages.” In Fundamentals
of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland,
August 17-19, 2015, Proceedings, 173–85, 2015. https://doi.org/10.1007/978-3-319-22177-9\_14.
ieee: W. Czerwinski, W. Martens, L. van Rooijen, and M. Zeitoun, “A Note on Decidable
Separability by Piecewise Testable Languages,” in Fundamentals of Computation
Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19,
2015, Proceedings, 2015, pp. 173–185.
mla: Czerwinski, Wojciech, et al. “A Note on Decidable Separability by Piecewise
Testable Languages.” Fundamentals of Computation Theory - 20th International
Symposium, (FCT) 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, 2015,
pp. 173–85, doi:10.1007/978-3-319-22177-9\_14.
short: 'W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, in: Fundamentals
of Computation Theory - 20th International Symposium, (FCT) 2015, Gdańsk, Poland,
August 17-19, 2015, Proceedings, 2015, pp. 173–185.'
date_created: 2019-01-15T10:01:56Z
date_updated: 2022-01-06T07:03:17Z
department:
- _id: '66'
doi: 10.1007/978-3-319-22177-9\_14
extern: '1'
language:
- iso: eng
page: 173-185
publication: Fundamentals of Computation Theory - 20th International Symposium, (FCT)
2015, Gdańsk, Poland, August 17-19, 2015, Proceedings
status: public
title: A Note on Decidable Separability by Piecewise Testable Languages
type: conference
user_id: '58843'
year: '2015'
...
---
_id: '16449'
abstract:
- lang: eng
text: "We consider the following variant of the two dimensional gathering problem\r\nfor
swarms of robots: Given a swarm of $n$ indistinguishable, point shaped\r\nrobots
on a two dimensional grid. Initially, the robots form a closed chain on\r\nthe
grid and must keep this connectivity during the whole process of their\r\ngathering.
Connectivity means, that neighboring robots of the chain need to be\r\npositioned
at the same or neighboring points of the grid. In our model,\r\ngathering means
to keep shortening the chain until the robots are located\r\ninside a $2\\times
2$ subgrid. Our model is completely local (no global control,\r\nno global coordinates,
no compass, no global communication or vision, \\ldots).\r\nEach robot can only
see its next constant number of left and right neighbors on\r\nthe chain. This
fixed constant is called the \\emph{viewing path length}. All\r\nits operations
and detections are restricted to this constant number of robots.\r\nOther robots,
even if located at neighboring or the same grid point cannot be\r\ndetected. Only
based on the relative positions of its detectable chain\r\nneighbors, a robot
can decide to obtain a certain state. Based on this state\r\nand their local knowledge,
the robots do local modifications to the chain by\r\nmoving to neighboring grid
points without breaking the chain. These\r\nmodifications are performed without
the knowledge whether they lead to a global\r\nprogress or not. We assume the
fully synchronous $\\mathcal{FSYNC}$ model. For\r\nthis problem, we present a
gathering algorithm which needs linear time. This\r\nresult generalizes the result
from \\cite{hopper}, where an open chain with\r\nspecified distinguishable (and
fixed) endpoints is considered."
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: 'Andreas '
full_name: 'Cord-Landwehr, Andreas '
last_name: Cord-Landwehr
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering
a Closed Chain of Robots on a Grid. arXiv:151005454. 2015.
apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der
Heide, F. (2015). Gathering a Closed Chain of Robots on a Grid. ArXiv:1510.05454.
bibtex: '@article{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2015, title={Gathering
a Closed Chain of Robots on a Grid}, journal={arXiv:1510.05454}, author={Abshoff,
Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and
Meyer auf der Heide, Friedhelm}, year={2015} }'
chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung,
and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.”
ArXiv:1510.05454, 2015.
ieee: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide,
“Gathering a Closed Chain of Robots on a Grid,” arXiv:1510.05454. 2015.
mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.”
ArXiv:1510.05454, 2015.
short: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide,
ArXiv:1510.05454 (2015).
date_created: 2020-04-07T07:20:46Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1510.05454'
language:
- iso: eng
publication: arXiv:1510.05454
status: public
title: Gathering a Closed Chain of Robots on a Grid
type: preprint
user_id: '15415'
year: '2015'
...
---
_id: '16452'
abstract:
- lang: eng
text: "We consider the problem of dominating set-based virtual backbone used for\r\nrouting
in asymmetric wireless ad-hoc networks. These networks have non-uniform\r\ntransmission
ranges and are modeled using the well-established disk graphs. The\r\ncorresponding
graph theoretic problem seeks a strongly connected\r\ndominating-absorbent set
of minimum cardinality in a digraph. A subset of nodes\r\nin a digraph is a strongly
connected dominating-absorbent set if the subgraph\r\ninduced by these nodes is
strongly connected and each node in the graph is\r\neither in the set or has both
an in-neighbor and an out-neighbor in it.\r\nDistributed algorithms for this problem
are of practical significance due to\r\nthe dynamic nature of ad-hoc networks.
We present a first distributed\r\napproximation algorithm, with a constant approximation
factor and O(Diam)\r\nrunning time, where Diam is the diameter of the graph. Moreover
we present a\r\nsimple heuristic algorithm and conduct an extensive simulation
study showing\r\nthat our heuristic outperforms previously known approaches for
the problem."
author:
- first_name: 'Faisal N. '
full_name: 'Abu-Khzam, Faisal N. '
last_name: Abu-Khzam
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Schubert, Michael
last_name: Schubert
citation:
ama: Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks.
arXiv:151001866. 2015.
apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., & Schubert, M.
(2015). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-Hoc Networks. ArXiv:1510.01866.
bibtex: '@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2015, title={Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks},
journal={arXiv:1510.01866}, author={Abu-Khzam, Faisal N. and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2015} }'
chicago: Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide,
and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones
in Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.
ieee: F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation
and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks,”
arXiv:1510.01866. 2015.
mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
Backbones in Asymmetric Ad-Hoc Networks.” ArXiv:1510.01866, 2015.
short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, ArXiv:1510.01866
(2015).
date_created: 2020-04-07T12:22:48Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1510.01866'
language:
- iso: eng
publication: arXiv:1510.01866
status: public
title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
Ad-Hoc Networks
type: preprint
user_id: '15415'
year: '2015'
...
---
_id: '16460'
abstract:
- lang: eng
text: "Consider n nodes connected to a single coordinator. Each node receives an\r\nindividual
online data stream of numbers and, at any point in time, the\r\ncoordinator has
to know the k nodes currently observing the largest values, for\r\na given k between
1 and n. We design and analyze an algorithm that solves this\r\nproblem while
bounding the amount of messages exchanged between the nodes and\r\nthe coordinator.
Our algorithm employs the idea of using filters which,\r\nintuitively speaking,
leads to few messages to be sent, if the new input is\r\n\"similar\" to the previous
ones. The algorithm uses a number of messages that is\r\non expectation by a factor
of O((log {\\Delta} + k) log n) larger than that of\r\nan offline algorithm that
sets filters in an optimal way, where {\\Delta} is\r\nupper bounded by the largest
value observed by any node."
author:
- first_name: Alexander
full_name: Mäcker, Alexander
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F. Online Top-k-Position Monitoring
of Distributed Data Streams. In: Proceedings of the 29th International Parallel
and Distributed Processing Symposium (IPDPS). IEEE; 2015:357-364. doi:10.1109/IPDPS.2015.40'
apa: Mäcker, A., Malatyali, M., & Meyer auf der Heide, F. (2015). Online Top-k-Position
Monitoring of Distributed Data Streams. In Proceedings of the 29th International
Parallel and Distributed Processing Symposium (IPDPS) (pp. 357–364). IEEE.
https://doi.org/10.1109/IPDPS.2015.40
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_2015, title={Online
Top-k-Position Monitoring of Distributed Data Streams}, DOI={10.1109/IPDPS.2015.40},
booktitle={Proceedings of the 29th International Parallel and Distributed Processing
Symposium (IPDPS)}, publisher={IEEE}, author={Mäcker, Alexander and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm}, year={2015}, pages={357–364} }'
chicago: Mäcker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide.
“Online Top-k-Position Monitoring of Distributed Data Streams.” In Proceedings
of the 29th International Parallel and Distributed Processing Symposium (IPDPS),
357–64. IEEE, 2015. https://doi.org/10.1109/IPDPS.2015.40.
ieee: A. Mäcker, M. Malatyali, and F. Meyer auf der Heide, “Online Top-k-Position
Monitoring of Distributed Data Streams,” in Proceedings of the 29th International
Parallel and Distributed Processing Symposium (IPDPS), 2015, pp. 357–364.
mla: Mäcker, Alexander, et al. “Online Top-k-Position Monitoring of Distributed
Data Streams.” Proceedings of the 29th International Parallel and Distributed
Processing Symposium (IPDPS), IEEE, 2015, pp. 357–64, doi:10.1109/IPDPS.2015.40.
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the
29th International Parallel and Distributed Processing Symposium (IPDPS), IEEE,
2015, pp. 357–364.'
date_created: 2020-04-08T07:02:15Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1109/IPDPS.2015.40
external_id:
arxiv:
- '1410.7912'
language:
- iso: eng
page: 357-364
publication: Proceedings of the 29th International Parallel and Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Online Top-k-Position Monitoring of Distributed Data Streams
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '10615'
author:
- first_name: Abdullah Fathi
full_name: Ahmed, Abdullah Fathi
last_name: Ahmed
citation:
ama: Ahmed AF. Self-Optimizing Organic Cache. Paderborn University; 2015.
apa: Ahmed, A. F. (2015). Self-Optimizing Organic Cache. Paderborn University.
bibtex: '@book{Ahmed_2015, title={Self-Optimizing Organic Cache}, publisher={Paderborn
University}, author={Ahmed, Abdullah Fathi}, year={2015} }'
chicago: Ahmed, Abdullah Fathi. Self-Optimizing Organic Cache. Paderborn
University, 2015.
ieee: A. F. Ahmed, Self-Optimizing Organic Cache. Paderborn University, 2015.
mla: Ahmed, Abdullah Fathi. Self-Optimizing Organic Cache. Paderborn University,
2015.
short: A.F. Ahmed, Self-Optimizing Organic Cache, Paderborn University, 2015.
date_created: 2019-07-10T09:25:13Z
date_updated: 2022-01-06T06:50:47Z
department:
- _id: '78'
language:
- iso: eng
publisher: Paderborn University
status: public
supervisor:
- first_name: Paul
full_name: Kaufmann, Paul
last_name: Kaufmann
title: Self-Optimizing Organic Cache
type: mastersthesis
user_id: '3118'
year: '2015'
...
---
_id: '10624'
abstract:
- lang: eng
text: "The use of heterogeneous computing resources, such as graphics processing
units or other specialized co-processors, has become widespread in recent years
because of their performance and energy efficiency advantages. Operating system
approaches that are limited to optimizing CPU usage are no longer sufficient for
the efficient utilization of systems that comprise diverse resource types.\r\n\r\nEnabling
task preemption on these architectures and migration of tasks between different
resource types at run-time is not only key to improving the performance and energy
consumption but also to enabling automatic scheduling methods for heterogeneous
compute nodes.\r\n\r\nThis thesis proposes novel techniques for run-time management
of heterogeneous resources and enabling tasks to migrate between diverse hardware.
It provides fundamental work towards future operating systems by discussing implications,
limitations, and chances of the heterogeneity and introducing solutions for energy-
and performance-efficient run-time systems. Scheduling methods to utilize heterogeneous
systems by the use of a centralized scheduler are presented that show benefits
over existing approaches in varying case studies."
author:
- first_name: Tobias
full_name: Beisel, Tobias
last_name: Beisel
citation:
ama: 'Beisel T. Management and Scheduling of Accelerators for Heterogeneous High-Performance
Computing. Berlin: Logos Verlag Berlin GmbH; 2015.'
apa: 'Beisel, T. (2015). Management and Scheduling of Accelerators for Heterogeneous
High-Performance Computing. Berlin: Logos Verlag Berlin GmbH.'
bibtex: '@book{Beisel_2015, place={Berlin}, title={Management and Scheduling of
Accelerators for Heterogeneous High-Performance Computing}, publisher={Logos Verlag
Berlin GmbH}, author={Beisel, Tobias}, year={2015} }'
chicago: 'Beisel, Tobias. Management and Scheduling of Accelerators for Heterogeneous
High-Performance Computing. Berlin: Logos Verlag Berlin GmbH, 2015.'
ieee: 'T. Beisel, Management and Scheduling of Accelerators for Heterogeneous
High-Performance Computing. Berlin: Logos Verlag Berlin GmbH, 2015.'
mla: Beisel, Tobias. Management and Scheduling of Accelerators for Heterogeneous
High-Performance Computing. Logos Verlag Berlin GmbH, 2015.
short: T. Beisel, Management and Scheduling of Accelerators for Heterogeneous High-Performance
Computing, Logos Verlag Berlin GmbH, Berlin, 2015.
date_created: 2019-07-10T09:36:58Z
date_updated: 2022-01-06T06:50:48Z
department:
- _id: '78'
- _id: '27'
- _id: '518'
language:
- iso: eng
page: '183'
place: Berlin
project:
- _id: '30'
grant_number: 01|H11004
name: Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling
Models
publication_identifier:
isbn:
- 978-3-8325-4155-2
publisher: Logos Verlag Berlin GmbH
status: public
supervisor:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
title: Management and Scheduling of Accelerators for Heterogeneous High-Performance
Computing
type: dissertation
user_id: '3118'
year: '2015'
...
---
_id: '10668'
author:
- first_name: Hendrik
full_name: Hangmann, Hendrik
last_name: Hangmann
citation:
ama: Hangmann H. Evolution of Heat Flow Prediction Models for FPGA Devices.
Paderborn University; 2015.
apa: Hangmann, H. (2015). Evolution of Heat Flow Prediction Models for FPGA Devices.
Paderborn University.
bibtex: '@book{Hangmann_2015, title={Evolution of Heat Flow Prediction Models for
FPGA Devices}, publisher={Paderborn University}, author={Hangmann, Hendrik}, year={2015}
}'
chicago: Hangmann, Hendrik. Evolution of Heat Flow Prediction Models for FPGA
Devices. Paderborn University, 2015.
ieee: H. Hangmann, Evolution of Heat Flow Prediction Models for FPGA Devices.
Paderborn University, 2015.
mla: Hangmann, Hendrik. Evolution of Heat Flow Prediction Models for FPGA Devices.
Paderborn University, 2015.
short: H. Hangmann, Evolution of Heat Flow Prediction Models for FPGA Devices, Paderborn
University, 2015.
date_created: 2019-07-10T11:15:13Z
date_updated: 2022-01-06T06:50:49Z
department:
- _id: '78'
language:
- iso: eng
publisher: Paderborn University
status: public
supervisor:
- first_name: Paul
full_name: Kaufmann, Paul
last_name: Kaufmann
title: Evolution of Heat Flow Prediction Models for FPGA Devices
type: mastersthesis
user_id: '3118'
year: '2015'
...