---
_id: '25126'
abstract:
- lang: eng
  text: Motivated by the prospect of computing agents that explore unknown environments
    and construct convex hulls on the nanoscale, we investigate the capabilities and
    limitations of a single deterministic finite automaton robot in the three-dimensional
    hybrid model for programmable matter. In this model, active robots move on a set
    of passive tiles, called configuration, with the geometric shape of rhombic dodecahedra
    on the adjacency graph of the face-centered cubic sphere-packing. We show that
    the exploration problem is equally hard in the hybrid model and in three-dimensional
    mazes, in which tiles have the shape of cubes and are positioned at the vertices
    of $\mathbb{Z}^3$. Thereby, a single robot with a constant number of pebbles cannot
    solve this problem in the hybrid model on arbitrary configurations. We provide
    algorithms for a robot with two pebbles that solve the exploration problem in
    the subclass of compact configurations of size $n$ in $\O(n^3)$ rounds. Further,
    we investigate the robot's capabilities of detection and hull construction in
    terms of restricted orientation convexity. We show that a robot without any pebble
    can detect strong $\O$-convexity in $\O(n)$ rounds, but cannot detect weak $\O$-convexity,
    not even if provided with a single pebble. Assuming that a robot can construct
    tiles from scratch and deconstruct previously constructed tiles, we show that
    the strong $\O$-hull of any given configuration of size $n$ can be constructed
    in $\O(n^4)$ rounds, even if the robot cannot distinguish constructed from native
    tiles.
author:
- first_name: David Jan
  full_name: Liedtke, David Jan
  id: '55557'
  last_name: Liedtke
citation:
  ama: Liedtke DJ. <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>.; 2021.
  apa: Liedtke, D. J. (2021). <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>.
  bibtex: '@book{Liedtke_2021, title={Exploration and Convex Hull Construction in
    the Three-Dimensional Hybrid Model}, author={Liedtke, David Jan}, year={2021}
    }'
  chicago: Liedtke, David Jan. <i>Exploration and Convex Hull Construction in the
    Three-Dimensional Hybrid Model</i>, 2021.
  ieee: D. J. Liedtke, <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>. 2021.
  mla: Liedtke, David Jan. <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>. 2021.
  short: D.J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model, 2021.
date_created: 2021-09-29T12:37:39Z
date_updated: 2022-01-06T06:56:53Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: local
  content_type: application/pdf
  creator: liedtke
  date_created: 2021-09-29T12:34:47Z
  date_updated: 2021-09-29T12:34:47Z
  file_id: '25128'
  file_name: Master - Thesis.pdf
  file_size: 10114825
  relation: main_file
file_date_updated: 2021-09-29T12:34:47Z
has_accepted_license: '1'
keyword:
- Robot Exploration
- Finite Automaton
- Hybrid Model for Programmable Matter
- Convex Hull
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model
type: mastersthesis
user_id: '55557'
year: '2021'
...
---
_id: '22309'
abstract:
- lang: eng
  text: Approximate computing (AC) has acquired significant maturity in recent years
    as a promising approach to obtain energy and area-efficient hardware. Automated
    approximate accelerator synthesis involves a great deal of complexity on the size
    of design space which exponentially grows with the number of possible approximations.
    Design space exploration of approximate accelerator synthesis is usually targeted
    via heuristic-based search methods. The majority of existing frameworks prune
    a large part of the design space using a greedy-based approach to keep the problem
    tractable. Therefore, they result in inferior solutions since many potential solutions
    are neglected in the pruning process without the possibility of backtracking of
    removed approximate instances. In this paper, we address the aforementioned issue
    by adopting Monte Carlo Tree Search (MCTS), as an efficient stochastic learning-based
    search algorithm, in the context of automated synthesis of approximate accelerators.
    This enables the synthesis frameworks to deeply subsamples the design space of
    approximate accelerator synthesis toward most promising approximate instances
    based on the required performance goals, i.e., power consumption, area, or/and
    delay. We investigated the challenges of providing an efficient open-source framework
    that benefits analytical and search-based approximation techniques simultaneously
    to both speed up the synthesis runtime and improve the quality of obtained results.
    Besides, we studied the utilization of machine learning algorithms to improve
    the performance of several critical steps, i.e., accelerator quality testing,
    in the synthesis framework. The proposed framework can help the community to rapidly
    generate efficient approximate accelerators in a reasonable runtime.
author:
- first_name: Muhammad
  full_name: Awais, Muhammad
  id: '64665'
  last_name: Awais
  orcid: https://orcid.org/0000-0003-4148-2969
- first_name: Marco
  full_name: Platzner, Marco
  last_name: Platzner
citation:
  ama: 'Awais M, Platzner M. MCTS-Based Synthesis Towards Efficient Approximate Accelerators.
    In: <i>Proceedings of IEEE Computer Society Annual Symposium on VLSI</i>. IEEE;
    2021:384-389.'
  apa: Awais, M., &#38; Platzner, M. (2021). MCTS-Based Synthesis Towards Efficient
    Approximate Accelerators. <i>Proceedings of IEEE Computer Society Annual Symposium
    on VLSI</i>, 384–389.
  bibtex: '@inproceedings{Awais_Platzner_2021, title={MCTS-Based Synthesis Towards
    Efficient Approximate Accelerators}, booktitle={Proceedings of IEEE Computer Society
    Annual Symposium on VLSI}, publisher={IEEE}, author={Awais, Muhammad and Platzner,
    Marco}, year={2021}, pages={384–389} }'
  chicago: Awais, Muhammad, and Marco Platzner. “MCTS-Based Synthesis Towards Efficient
    Approximate Accelerators.” In <i>Proceedings of IEEE Computer Society Annual Symposium
    on VLSI</i>, 384–89. IEEE, 2021.
  ieee: M. Awais and M. Platzner, “MCTS-Based Synthesis Towards Efficient Approximate
    Accelerators,” in <i>Proceedings of IEEE Computer Society Annual Symposium on
    VLSI</i>, Tampa, Florida USA (Virtual), 2021, pp. 384–389.
  mla: Awais, Muhammad, and Marco Platzner. “MCTS-Based Synthesis Towards Efficient
    Approximate Accelerators.” <i>Proceedings of IEEE Computer Society Annual Symposium
    on VLSI</i>, IEEE, 2021, pp. 384–89.
  short: 'M. Awais, M. Platzner, in: Proceedings of IEEE Computer Society Annual Symposium
    on VLSI, IEEE, 2021, pp. 384–389.'
conference:
  end_date: 2021-07-09
  location: Tampa, Florida USA (Virtual)
  name: IEEE Computer Society Annual Symposium on VLSI
  start_date: 2021-07-07
date_created: 2021-06-14T14:05:17Z
date_updated: 2022-01-06T06:55:31Z
department:
- _id: '78'
keyword:
- Approximate computing
- Design space exploration
- Accelerator synthesis
language:
- iso: eng
page: 384-389
publication: Proceedings of IEEE Computer Society Annual Symposium on VLSI
publisher: IEEE
status: public
title: MCTS-Based Synthesis Towards Efficient Approximate Accelerators
type: conference
user_id: '64665'
year: '2021'
...
---
_id: '9708'
abstract:
- lang: eng
  text: Increased interconnectedness of multiple actors and digital resources in service
    eco-systems offer new opportunities for service innovation. In digitally transforming
    eco-systems, organizations need to explore and exploit innovation simultaneously,
    which is defined as ambidexterity. However, research on ambidextrous service innovation
    is scarce. We provide a systematic literature review based on the concepts of
    ambidexterity, offering two contributions. First, research strands are disconnected,
    emphasizing either exploration or exploitation of service innovation, despite
    an organizations’ need to accelerate innovation cycles of exploring and exploiting
    services. Second, a new framework for ambidextrous service innovation is provided,
    inspired by the dynamism and generative mechanisms of the ontologically related
    concept of organizational routines. The framework adopts the perspective of a
    mutually constitutive relationship between exploring new and exploiting current
    resources, activities, and knowledge. The findings remedy the scattered literature
    through a coherent perspective on service innovation that responds to organizations’
    needs and guides future research.
author:
- first_name: Verena
  full_name: Wolf, Verena
  id: '23633'
  last_name: Wolf
citation:
  ama: 'Wolf V. Ambidexterity in Service Innovation Research: A Systematic Literature
    Review. In: <i>Proceedings of the 14th International Conference on Wirtschaftsinformatik</i>.
    Siegen, Germany; 2019.'
  apa: 'Wolf, V. (2019). Ambidexterity in Service Innovation Research: A Systematic
    Literature Review. In <i>Proceedings of the 14th International Conference on Wirtschaftsinformatik</i>.
    Siegen, Germany.'
  bibtex: '@inproceedings{Wolf_2019, place={Siegen, Germany}, title={Ambidexterity
    in Service Innovation Research: A Systematic Literature Review}, booktitle={Proceedings
    of the 14th International Conference on Wirtschaftsinformatik}, author={Wolf,
    Verena}, year={2019} }'
  chicago: 'Wolf, Verena. “Ambidexterity in Service Innovation Research: A Systematic
    Literature Review.” In <i>Proceedings of the 14th International Conference on
    Wirtschaftsinformatik</i>. Siegen, Germany, 2019.'
  ieee: 'V. Wolf, “Ambidexterity in Service Innovation Research: A Systematic Literature
    Review,” in <i>Proceedings of the 14th International Conference on Wirtschaftsinformatik</i>,
    Siegen, Germany, 2019.'
  mla: 'Wolf, Verena. “Ambidexterity in Service Innovation Research: A Systematic
    Literature Review.” <i>Proceedings of the 14th International Conference on Wirtschaftsinformatik</i>,
    2019.'
  short: 'V. Wolf, in: Proceedings of the 14th International Conference on Wirtschaftsinformatik,
    Siegen, Germany, 2019.'
conference:
  location: Siegen, Germany
  name: 14th International Conference on Wirtschaftsinformatik
date_created: 2019-05-08T13:39:19Z
date_updated: 2022-01-06T07:04:18Z
department:
- _id: '526'
keyword:
- Exploration
- Exploitation
- Service Innovation
- Organizational Routines
- Ambidexterity
language:
- iso: eng
place: Siegen, Germany
publication: Proceedings of the 14th International Conference on Wirtschaftsinformatik
quality_controlled: '1'
status: public
title: 'Ambidexterity in Service Innovation Research: A Systematic Literature Review'
type: conference
user_id: '23633'
year: '2019'
...
---
_id: '16853'
abstract:
- lang: eng
  text: State-of-the-art frameworks for generating approximate circuits usually rely
    on information gained through circuit synthesis and/or verification to explore
    the search space and to find an optimal solution. Throughout the process, a large
    number of circuits may be subject to processing, leading to considerable runtimes.
    In this work, we propose a search which takes error bounds and pre-computed impact
    factors into account to reduce the number of invoked synthesis and verification
    processes. In our experimental results, we achieved speed-ups of up to 76x while
    area savings remain comparable to the reference search method, simulated annealing.
author:
- first_name: Linus Matthias
  full_name: Witschen, Linus Matthias
  id: '49051'
  last_name: Witschen
- first_name: Hassan
  full_name: Ghasemzadeh Mohammadi, Hassan
  id: '61186'
  last_name: Ghasemzadeh Mohammadi
- first_name: Matthias
  full_name: Artmann, Matthias
  last_name: Artmann
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search:
    A Fast Technique for the Synthesis of Approximate Circuits. <i>Fourth Workshop
    on Approximate Computing (AxC 2019)</i>.'
  apa: 'Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., &#38; Platzner, M.
    (n.d.). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.
    <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.'
  bibtex: '@article{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner, title={Jump Search:
    A Fast Technique for the Synthesis of Approximate Circuits}, journal={Fourth Workshop
    on Approximate Computing (AxC 2019)}, author={Witschen, Linus Matthias and Ghasemzadeh
    Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco} }'
  chicago: 'Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann,
    and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate
    Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>, n.d.'
  ieee: 'L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump
    Search: A Fast Technique for the Synthesis of Approximate Circuits,” <i>Fourth
    Workshop on Approximate Computing (AxC 2019)</i>. .'
  mla: 'Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis
    of Approximate Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.'
  short: L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, Fourth
    Workshop on Approximate Computing (AxC 2019) (n.d.).
date_created: 2020-04-25T08:02:07Z
date_updated: 2022-01-06T06:52:57Z
ddc:
- '006'
department:
- _id: '78'
file:
- access_level: closed
  content_type: application/pdf
  creator: witschen
  date_created: 2020-04-25T08:00:35Z
  date_updated: 2020-04-25T08:00:35Z
  file_id: '16854'
  file_name: AxC19_paper_3.pdf
  file_size: 152806
  relation: main_file
  success: 1
file_date_updated: 2020-04-25T08:00:35Z
has_accepted_license: '1'
keyword:
- Approximate computing
- parameter selection
- search space exploration
- verification
- circuit synthesis
language:
- iso: eng
page: '2'
project:
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Fourth Workshop on Approximate Computing (AxC 2019)
publication_status: accepted
status: public
title: 'Jump Search: A Fast Technique for the Synthesis of Approximate Circuits'
type: preprint
user_id: '49051'
year: '2019'
...
---
_id: '2200'
author:
- first_name: Tobias
  full_name: Kenter, Tobias
  id: '3145'
  last_name: Kenter
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Christian
  full_name: Plessl, Christian
  id: '16153'
  last_name: Plessl
  orcid: 0000-0001-5728-9982
- first_name: Michael
  full_name: Kauschke, Michael
  last_name: Kauschke
citation:
  ama: 'Kenter T, Platzner M, Plessl C, Kauschke M. Performance Estimation Framework
    for Automated Exploration of CPU-Accelerator Architectures. In: <i>Proc. Int.
    Symp. on Field-Programmable Gate Arrays (FPGA)</i>. ACM; 2011:177-180. doi:<a
    href="https://doi.org/10.1145/1950413.1950448">10.1145/1950413.1950448</a>'
  apa: Kenter, T., Platzner, M., Plessl, C., &#38; Kauschke, M. (2011). Performance
    Estimation Framework for Automated Exploration of CPU-Accelerator Architectures.
    <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>, 177–180. <a
    href="https://doi.org/10.1145/1950413.1950448">https://doi.org/10.1145/1950413.1950448</a>
  bibtex: '@inproceedings{Kenter_Platzner_Plessl_Kauschke_2011, place={New York, NY,
    USA}, title={Performance Estimation Framework for Automated Exploration of CPU-Accelerator
    Architectures}, DOI={<a href="https://doi.org/10.1145/1950413.1950448">10.1145/1950413.1950448</a>},
    booktitle={Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)}, publisher={ACM},
    author={Kenter, Tobias and Platzner, Marco and Plessl, Christian and Kauschke,
    Michael}, year={2011}, pages={177–180} }'
  chicago: 'Kenter, Tobias, Marco Platzner, Christian Plessl, and Michael Kauschke.
    “Performance Estimation Framework for Automated Exploration of CPU-Accelerator
    Architectures.” In <i>Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>,
    177–80. New York, NY, USA: ACM, 2011. <a href="https://doi.org/10.1145/1950413.1950448">https://doi.org/10.1145/1950413.1950448</a>.'
  ieee: 'T. Kenter, M. Platzner, C. Plessl, and M. Kauschke, “Performance Estimation
    Framework for Automated Exploration of CPU-Accelerator Architectures,” in <i>Proc.
    Int. Symp. on Field-Programmable Gate Arrays (FPGA)</i>, 2011, pp. 177–180, doi:
    <a href="https://doi.org/10.1145/1950413.1950448">10.1145/1950413.1950448</a>.'
  mla: Kenter, Tobias, et al. “Performance Estimation Framework for Automated Exploration
    of CPU-Accelerator Architectures.” <i>Proc. Int. Symp. on Field-Programmable Gate
    Arrays (FPGA)</i>, ACM, 2011, pp. 177–80, doi:<a href="https://doi.org/10.1145/1950413.1950448">10.1145/1950413.1950448</a>.
  short: 'T. Kenter, M. Platzner, C. Plessl, M. Kauschke, in: Proc. Int. Symp. on
    Field-Programmable Gate Arrays (FPGA), ACM, New York, NY, USA, 2011, pp. 177–180.'
date_created: 2018-04-03T15:08:13Z
date_updated: 2023-09-26T13:45:04Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1145/1950413.1950448
keyword:
- design space exploration
- LLVM
- partitioning
- performance
- estimation
- funding-intel
language:
- iso: eng
page: 177-180
place: New York, NY, USA
publication: Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)
publication_identifier:
  isbn:
  - 978-1-4503-0554-9
publisher: ACM
quality_controlled: '1'
status: public
title: Performance Estimation Framework for Automated Exploration of CPU-Accelerator
  Architectures
type: conference
user_id: '15278'
year: '2011'
...
---
_id: '37007'
abstract:
- lang: eng
  text: UML is widely applied for the specification and modeling of software and some
    studies have demonstrated that it is applicable for HW/SW codesign. However, in
    this area there is still a big gap from UML modeling to SystemC-based verification
    and synthesis environments. This paper presents an efficient approach to bridge
    this gap in the context of Systems-on-a-Chip (SoC) design. We propose a framework
    for the seamless integration of a customized SysML entry with code generation
    for HW/SW cosimulation and high-level FPGA synthesis. For this, we extended the
    SysML UML profile by SystemC and synthesis capabilities. Two case studies demonstrate
    the applicability of our approach.
author:
- first_name: Fabian
  full_name: Mischkalla, Fabian
  last_name: Mischkalla
- first_name: Da
  full_name: He, Da
  last_name: He
- first_name: Wolfgang
  full_name: Müller, Wolfgang
  id: '16243'
  last_name: Müller
citation:
  ama: 'Mischkalla F, He D, Müller W. Closing the Gap between UML-based Modeling and
    Simulation of Combined HW/SW Systems. In: <i>Proceedings of DATE’10</i>. IEEE;
    2010. doi:<a href="https://doi.org/10.1109/DATE.2010.5456990">10.1109/DATE.2010.5456990</a>'
  apa: Mischkalla, F., He, D., &#38; Müller, W. (2010). Closing the Gap between UML-based
    Modeling and Simulation of Combined HW/SW Systems. <i>Proceedings of DATE’10</i>.
    2010 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE
    2010), Dresden. <a href="https://doi.org/10.1109/DATE.2010.5456990">https://doi.org/10.1109/DATE.2010.5456990</a>
  bibtex: '@inproceedings{Mischkalla_He_Müller_2010, place={Dresden}, title={Closing
    the Gap between UML-based Modeling and Simulation of Combined HW/SW Systems},
    DOI={<a href="https://doi.org/10.1109/DATE.2010.5456990">10.1109/DATE.2010.5456990</a>},
    booktitle={Proceedings of DATE’10}, publisher={IEEE}, author={Mischkalla, Fabian
    and He, Da and Müller, Wolfgang}, year={2010} }'
  chicago: 'Mischkalla, Fabian, Da He, and Wolfgang Müller. “Closing the Gap between
    UML-Based Modeling and Simulation of Combined HW/SW Systems.” In <i>Proceedings
    of DATE’10</i>. Dresden: IEEE, 2010. <a href="https://doi.org/10.1109/DATE.2010.5456990">https://doi.org/10.1109/DATE.2010.5456990</a>.'
  ieee: 'F. Mischkalla, D. He, and W. Müller, “Closing the Gap between UML-based Modeling
    and Simulation of Combined HW/SW Systems,” presented at the 2010 Design, Automation
    &#38; Test in Europe Conference &#38; Exhibition (DATE 2010), Dresden, 2010, doi:
    <a href="https://doi.org/10.1109/DATE.2010.5456990">10.1109/DATE.2010.5456990</a>.'
  mla: Mischkalla, Fabian, et al. “Closing the Gap between UML-Based Modeling and
    Simulation of Combined HW/SW Systems.” <i>Proceedings of DATE’10</i>, IEEE, 2010,
    doi:<a href="https://doi.org/10.1109/DATE.2010.5456990">10.1109/DATE.2010.5456990</a>.
  short: 'F. Mischkalla, D. He, W. Müller, in: Proceedings of DATE’10, IEEE, Dresden,
    2010.'
conference:
  location: Dresden
  name: 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)
date_created: 2023-01-17T09:12:35Z
date_updated: 2023-01-17T09:12:44Z
department:
- _id: '672'
doi: 10.1109/DATE.2010.5456990
keyword:
- Unified modeling language
- Field programmable gate arrays
- Bridges
- Helium
- Real time systems
- Operating systems
- Documentation
- Application software
- XML
- Space exploration
language:
- iso: eng
place: Dresden
publication: Proceedings of DATE’10
publication_identifier:
  eisbn:
  - 978-3-9810801-6-2
publisher: IEEE
status: public
title: Closing the Gap between UML-based Modeling and Simulation of Combined HW/SW
  Systems
type: conference
user_id: '5786'
year: '2010'
...