---
_id: '24029'
abstract:
- lang: eng
text: In this paper we present the system and circuit level analysis and feasibility
study of applying microwave Radio Frequency Identification (RFID) systems with
multipleinput multiple-output (MIMO) reader technology for tracking machining
tools in multipath fading conditions of production environments. In the proposed
system the MIMO reader interrogates single-antenna tags, and a high RFID frequency
of 5.8 GHz is chosen to reduce the size of the reader's antenna array. According
to the requirements dictated by the performed system analysis at 5.8 GHz, a low
power fully integrated analog frontend (AFE) is designed and fabricated in a standard
65-nm CMOS technology for low power passive transponders. Performance of the Differential
Drive Rectifier (DDR) topology as the core of the energy harvesting unit is investigated
in detail. A multi-stage DDR power scavenging unit is dimensioned to provide a
1.2 V rectified voltage for 20-30 kQ load range, with a high power conversion
efficiency (PCE) for high frequency and low input power level signals. The rectified
voltage is then converted to a 1 V regulated voltage for the AFE and the baseband
processor with 30 to 50 μW of estimated power consumption. Transistors with standard
threshold voltage (VT) have been used for implementation. Measurements of the
fabricated multi-stage configuration of the circuit show a maximum PCE of 68.8%
at -12.46 dBm, and an input quality factor (Q-factor) of approximately 10. Amplitude-shift
keying (ASK) demodulator and backscattering modulator with 80% modulation index,
operating according to EPC-C1G2 protocol are applied for data transfer. The AFE
consumes less than 1 μW in the reading mode. The AFE tag chip is 0.55 × 0.58 mm
2 .
author:
- first_name: Sanaz
full_name: Haddadian, Sanaz
id: '59648'
last_name: Haddadian
- first_name: Christoph
full_name: Scheytt, Christoph
id: '37144'
last_name: Scheytt
orcid: '0000-0002-5950-6618 '
citation:
ama: Haddadian S, Scheytt C. Analysis, Design and Implementation of a Fully Integrated
Analog Front-End for Microwave RFIDs at 5.8 GHz to be Used with Compact MIMO Readers.
IEEE Journal of Radio Frequency Identification. Published online 2020:1-1.
doi:10.1109/JRFID.2020.3009741
apa: Haddadian, S., & Scheytt, C. (2020). Analysis, Design and Implementation
of a Fully Integrated Analog Front-End for Microwave RFIDs at 5.8 GHz to be Used
with Compact MIMO Readers. IEEE Journal of Radio Frequency Identification,
1–1. https://doi.org/10.1109/JRFID.2020.3009741
bibtex: '@article{Haddadian_Scheytt_2020, title={Analysis, Design and Implementation
of a Fully Integrated Analog Front-End for Microwave RFIDs at 5.8 GHz to be Used
with Compact MIMO Readers}, DOI={10.1109/JRFID.2020.3009741},
journal={IEEE Journal of Radio Frequency Identification}, author={Haddadian, Sanaz
and Scheytt, Christoph}, year={2020}, pages={1–1} }'
chicago: Haddadian, Sanaz, and Christoph Scheytt. “Analysis, Design and Implementation
of a Fully Integrated Analog Front-End for Microwave RFIDs at 5.8 GHz to Be Used
with Compact MIMO Readers.” IEEE Journal of Radio Frequency Identification,
2020, 1–1. https://doi.org/10.1109/JRFID.2020.3009741.
ieee: 'S. Haddadian and C. Scheytt, “Analysis, Design and Implementation of a Fully
Integrated Analog Front-End for Microwave RFIDs at 5.8 GHz to be Used with Compact
MIMO Readers,” IEEE Journal of Radio Frequency Identification, pp. 1–1,
2020, doi: 10.1109/JRFID.2020.3009741.'
mla: Haddadian, Sanaz, and Christoph Scheytt. “Analysis, Design and Implementation
of a Fully Integrated Analog Front-End for Microwave RFIDs at 5.8 GHz to Be Used
with Compact MIMO Readers.” IEEE Journal of Radio Frequency Identification,
2020, pp. 1–1, doi:10.1109/JRFID.2020.3009741.
short: S. Haddadian, C. Scheytt, IEEE Journal of Radio Frequency Identification
(2020) 1–1.
date_created: 2021-09-09T11:50:22Z
date_updated: 2025-02-13T14:33:24Z
department:
- _id: '58'
doi: 10.1109/JRFID.2020.3009741
language:
- iso: eng
page: 1-1
publication: IEEE Journal of Radio Frequency Identification
status: public
title: Analysis, Design and Implementation of a Fully Integrated Analog Front-End
for Microwave RFIDs at 5.8 GHz to be Used with Compact MIMO Readers
type: journal_article
user_id: '59648'
year: '2020'
...
---
_id: '24026'
abstract:
- lang: eng
text: In this paper we present a new system concept for an optoelectronic wireless
phased array system. Like in a conventional phased array system with optical carrier
distribution, optical fibers are used to distribute the carrier from the basestation
to the wireless frontends. However in contrast to prior concepts, we propose to
use an optical IQ return path from the wireless frontends back to the basestation.
Furthermore, we reuse the optical carrier signal for the IQ return path which
allows to avoid local oscillator lasers in the wireless frontends and reduces
the hardware effort significantly. The system concept allows to integrate all
components of an optoelectronic wireless frontend in a single chip using silicon
photonics technology.
author:
- first_name: Stephan
full_name: Kruse, Stephan
id: '38254'
last_name: Kruse
- first_name: Christian
full_name: Kress, Christian
id: '13256'
last_name: Kress
- first_name: Christoph
full_name: Scheytt, Christoph
id: '37144'
last_name: Scheytt
orcid: https://orcid.org/0000-0002-5950-6618
- first_name: Heiko G.
full_name: Kurz, Heiko G.
last_name: Kurz
- first_name: Thomas
full_name: Schneider, Thomas
last_name: Schneider
citation:
ama: 'Kruse S, Kress C, Scheytt C, Kurz HG, Schneider T. Analysis and Simulation
of a Wireless Phased Array System with Optical Carrier Distribution and an Optical
IQ Return Path. In: GeMiC 2020 - German Microwave Conference. ; 2020.'
apa: Kruse, S., Kress, C., Scheytt, C., Kurz, H. G., & Schneider, T. (2020).
Analysis and Simulation of a Wireless Phased Array System with Optical Carrier
Distribution and an Optical IQ Return Path. GeMiC 2020 - German Microwave Conference.
bibtex: '@inproceedings{Kruse_Kress_Scheytt_Kurz_Schneider_2020, place={Cottbus,
Germany}, title={Analysis and Simulation of a Wireless Phased Array System with
Optical Carrier Distribution and an Optical IQ Return Path}, booktitle={GeMiC
2020 - German Microwave Conference}, author={Kruse, Stephan and Kress, Christian
and Scheytt, Christoph and Kurz, Heiko G. and Schneider, Thomas}, year={2020}
}'
chicago: Kruse, Stephan, Christian Kress, Christoph Scheytt, Heiko G. Kurz, and
Thomas Schneider. “Analysis and Simulation of a Wireless Phased Array System with
Optical Carrier Distribution and an Optical IQ Return Path.” In GeMiC 2020
- German Microwave Conference. Cottbus, Germany, 2020.
ieee: S. Kruse, C. Kress, C. Scheytt, H. G. Kurz, and T. Schneider, “Analysis and
Simulation of a Wireless Phased Array System with Optical Carrier Distribution
and an Optical IQ Return Path,” 2020.
mla: Kruse, Stephan, et al. “Analysis and Simulation of a Wireless Phased Array
System with Optical Carrier Distribution and an Optical IQ Return Path.” GeMiC
2020 - German Microwave Conference, 2020.
short: 'S. Kruse, C. Kress, C. Scheytt, H.G. Kurz, T. Schneider, in: GeMiC 2020
- German Microwave Conference, Cottbus, Germany, 2020.'
date_created: 2021-09-09T11:50:18Z
date_updated: 2025-02-25T06:02:48Z
department:
- _id: '58'
- _id: '230'
language:
- iso: eng
place: Cottbus, Germany
publication: GeMiC 2020 - German Microwave Conference
related_material:
link:
- relation: research_paper
url: https://ieeexplore.ieee.org/document/9080232
status: public
title: Analysis and Simulation of a Wireless Phased Array System with Optical Carrier
Distribution and an Optical IQ Return Path
type: conference
user_id: '38254'
year: '2020'
...
---
_id: '34841'
abstract:
- lang: eng
text: "We give an exact formula for the number of G-extensions of local function
fields Fq((t)) for finite abelian groups G up to a conductor bound. As an application
we give a lower bound for the corresponding counting problem by discriminant.\r\n"
author:
- first_name: Jürgen
full_name: Klüners, Jürgen
id: '21202'
last_name: Klüners
- first_name: Raphael
full_name: Müller, Raphael
last_name: Müller
citation:
ama: Klüners J, Müller R. The conductor density of local function fields with abelian
Galois group. Journal of Number Theory. 2020;212:311-322. doi:10.1016/j.jnt.2019.11.007
apa: Klüners, J., & Müller, R. (2020). The conductor density of local function
fields with abelian Galois group. Journal of Number Theory, 212,
311–322. https://doi.org/10.1016/j.jnt.2019.11.007
bibtex: '@article{Klüners_Müller_2020, title={The conductor density of local function
fields with abelian Galois group}, volume={212}, DOI={10.1016/j.jnt.2019.11.007},
journal={Journal of Number Theory}, publisher={Elsevier BV}, author={Klüners,
Jürgen and Müller, Raphael}, year={2020}, pages={311–322} }'
chicago: 'Klüners, Jürgen, and Raphael Müller. “The Conductor Density of Local Function
Fields with Abelian Galois Group.” Journal of Number Theory 212 (2020):
311–22. https://doi.org/10.1016/j.jnt.2019.11.007.'
ieee: 'J. Klüners and R. Müller, “The conductor density of local function fields
with abelian Galois group,” Journal of Number Theory, vol. 212, pp. 311–322,
2020, doi: 10.1016/j.jnt.2019.11.007.'
mla: Klüners, Jürgen, and Raphael Müller. “The Conductor Density of Local Function
Fields with Abelian Galois Group.” Journal of Number Theory, vol. 212,
Elsevier BV, 2020, pp. 311–22, doi:10.1016/j.jnt.2019.11.007.
short: J. Klüners, R. Müller, Journal of Number Theory 212 (2020) 311–322.
date_created: 2022-12-22T10:50:03Z
date_updated: 2025-06-13T08:18:30Z
department:
- _id: '102'
doi: 10.1016/j.jnt.2019.11.007
external_id:
arxiv:
- '1904.02573 '
intvolume: ' 212'
keyword:
- Algebra and Number Theory
language:
- iso: eng
page: 311-322
publication: Journal of Number Theory
publication_identifier:
issn:
- 0022-314X
publication_status: published
publisher: Elsevier BV
status: public
title: The conductor density of local function fields with abelian Galois group
type: journal_article
user_id: '82981'
volume: 212
year: '2020'
...
---
_id: '60386'
abstract:
- lang: eng
text: 'We propose a novel approach to represent maps between two discrete
surfaces of the same genus and to minimize intrinsic mapping distortion. Our maps
are well-defined at every surface point and are guaranteed to be continuous bijections
(surface homeomorphisms). As a key feature of our approach, only the images of
vertices need to be represented explicitly, since the images of all other points
(on edges or in faces) are properly defined implicitly. This definition is via
unique geodesics in metrics of constant Gaussian curvature. Our method is built
upon the fact that such metrics exist on surfaces of arbitrary topology, without
the need for any cuts or cones (as asserted by the uniformization theorem). Depending
on the surfaces'' genus, these metrics exhibit one of the three classical geometries:
Euclidean, spherical or hyperbolic. Our formulation handles constructions in all
three geometries in a unified way. In addition, by considering not only the vertex
images but also the discrete metric as degrees of freedom, our formulation enables
us to simultaneously optimize the images of these vertices and images of all other
points.'
author:
- first_name: Patrick
full_name: Schmidt, Patrick
last_name: Schmidt
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
- first_name: Janis
full_name: Born, Janis
last_name: Born
- first_name: Leif
full_name: Kobbelt, Leif
last_name: Kobbelt
citation:
ama: Schmidt P, Campen M, Born J, Kobbelt L. Inter-surface maps via constant-curvature
metrics. ACM Transactions on Graphics. 2020;39(4). doi:10.1145/3386569.3392399
apa: Schmidt, P., Campen, M., Born, J., & Kobbelt, L. (2020). Inter-surface
maps via constant-curvature metrics. ACM Transactions on Graphics, 39(4).
https://doi.org/10.1145/3386569.3392399
bibtex: '@article{Schmidt_Campen_Born_Kobbelt_2020, title={Inter-surface maps via
constant-curvature metrics}, volume={39}, DOI={10.1145/3386569.3392399},
number={4}, journal={ACM Transactions on Graphics}, publisher={Association for
Computing Machinery (ACM)}, author={Schmidt, Patrick and Campen, Marcel and Born,
Janis and Kobbelt, Leif}, year={2020} }'
chicago: Schmidt, Patrick, Marcel Campen, Janis Born, and Leif Kobbelt. “Inter-Surface
Maps via Constant-Curvature Metrics.” ACM Transactions on Graphics 39,
no. 4 (2020). https://doi.org/10.1145/3386569.3392399.
ieee: 'P. Schmidt, M. Campen, J. Born, and L. Kobbelt, “Inter-surface maps via constant-curvature
metrics,” ACM Transactions on Graphics, vol. 39, no. 4, 2020, doi: 10.1145/3386569.3392399.'
mla: Schmidt, Patrick, et al. “Inter-Surface Maps via Constant-Curvature Metrics.”
ACM Transactions on Graphics, vol. 39, no. 4, Association for Computing
Machinery (ACM), 2020, doi:10.1145/3386569.3392399.
short: P. Schmidt, M. Campen, J. Born, L. Kobbelt, ACM Transactions on Graphics
39 (2020).
date_created: 2025-06-26T07:18:18Z
date_updated: 2025-07-14T12:48:27Z
department:
- _id: '969'
doi: 10.1145/3386569.3392399
extern: '1'
intvolume: ' 39'
issue: '4'
language:
- iso: eng
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
- 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Inter-surface maps via constant-curvature metrics
type: journal_article
user_id: '117512'
volume: 39
year: '2020'
...
---
_id: '60385'
abstract:
- lang: eng
text: We present a mesh generation algorithm for the curvilinear triangulation
of planar domains with piecewise polynomial boundary. The resulting mesh consists
of regular, injective higher-order triangular elements and precisely conforms
with the domain's curved boundary. No smoothness requirements are imposed on the
boundary. Prescribed piecewise polynomial curves in the interior, like material
interfaces or feature curves, can be taken into account for precise interpolation
by the resulting mesh's edges as well. In its core, the algorithm is based on
a novel explicit construction of guaranteed injective Bézier triangles with certain
edge curves and edge parametrizations prescribed. Due to the use of only rational
arithmetic, the algorithm can optionally be performed using exact number types
in practice, so as to provide robustness guarantees.
alternative_title:
- precise higher-order meshing of curved 2D domains
author:
- first_name: Manish
full_name: Mandad, Manish
last_name: Mandad
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: Mandad M, Campen M. Bézier guarding. ACM Transactions on Graphics. 2020;39(4).
doi:10.1145/3386569.3392372
apa: Mandad, M., & Campen, M. (2020). Bézier guarding. ACM Transactions on
Graphics, 39(4). https://doi.org/10.1145/3386569.3392372
bibtex: '@article{Mandad_Campen_2020, title={Bézier guarding}, volume={39}, DOI={10.1145/3386569.3392372}, number={4},
journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery
(ACM)}, author={Mandad, Manish and Campen, Marcel}, year={2020} }'
chicago: Mandad, Manish, and Marcel Campen. “Bézier Guarding.” ACM Transactions
on Graphics 39, no. 4 (2020). https://doi.org/10.1145/3386569.3392372.
ieee: 'M. Mandad and M. Campen, “Bézier guarding,” ACM Transactions on Graphics,
vol. 39, no. 4, 2020, doi: 10.1145/3386569.3392372.'
mla: Mandad, Manish, and Marcel Campen. “Bézier Guarding.” ACM Transactions on
Graphics, vol. 39, no. 4, Association for Computing Machinery (ACM), 2020,
doi:10.1145/3386569.3392372.
short: M. Mandad, M. Campen, ACM Transactions on Graphics 39 (2020).
date_created: 2025-06-26T07:16:40Z
date_updated: 2025-07-14T12:48:24Z
department:
- _id: '969'
doi: 10.1145/3386569.3392372
extern: '1'
intvolume: ' 39'
issue: '4'
language:
- iso: eng
publication: ACM Transactions on Graphics
publication_identifier:
issn:
- 0730-0301
- 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Bézier guarding
type: journal_article
user_id: '117512'
volume: 39
year: '2020'
...
---
_id: '60383'
abstract:
- lang: eng
text: AbstractThe problem of seamless parametrization
of surfaces is of interest in the context of structured quadrilateral mesh generation
and spline‐based surface approximation. It has been tackled by a variety of approaches,
commonly relying on continuous numerical optimization to ultimately obtain suitable
parameter domains. We present a general combinatorial seamless parameter domain
construction, free from the potential numerical issues inherent to continuous
optimization techniques in practice. The domains are constructed as abstract polygonal
complexes which can be embedded in a discrete planar grid space, as unions of
unit squares. We ensure that the domain structure matches any prescribed parametrization
singularities (cones) and satisfies seamlessness conditions. Surfaces of arbitrary
genus are supported. Once a domain suitable for a given surface is constructed,
a seamless and locally injective parametrization over this domain can be obtained
using existing planar disk mapping techniques, making recourse to Tutte's classical
embedding theorem.
author:
- first_name: Jiaran
full_name: Zhou, Jiaran
last_name: Zhou
- first_name: Changhe
full_name: Tu, Changhe
last_name: Tu
- first_name: Denis
full_name: Zorin, Denis
last_name: Zorin
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: Zhou J, Tu C, Zorin D, Campen M. Combinatorial Construction of Seamless Parameter
Domains. Computer Graphics Forum. 2020;39(2):179-190. doi:10.1111/cgf.13922
apa: Zhou, J., Tu, C., Zorin, D., & Campen, M. (2020). Combinatorial Construction
of Seamless Parameter Domains. Computer Graphics Forum, 39(2), 179–190.
https://doi.org/10.1111/cgf.13922
bibtex: '@article{Zhou_Tu_Zorin_Campen_2020, title={Combinatorial Construction of
Seamless Parameter Domains}, volume={39}, DOI={10.1111/cgf.13922},
number={2}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Zhou,
Jiaran and Tu, Changhe and Zorin, Denis and Campen, Marcel}, year={2020}, pages={179–190}
}'
chicago: 'Zhou, Jiaran, Changhe Tu, Denis Zorin, and Marcel Campen. “Combinatorial
Construction of Seamless Parameter Domains.” Computer Graphics Forum 39,
no. 2 (2020): 179–90. https://doi.org/10.1111/cgf.13922.'
ieee: 'J. Zhou, C. Tu, D. Zorin, and M. Campen, “Combinatorial Construction of Seamless
Parameter Domains,” Computer Graphics Forum, vol. 39, no. 2, pp. 179–190,
2020, doi: 10.1111/cgf.13922.'
mla: Zhou, Jiaran, et al. “Combinatorial Construction of Seamless Parameter Domains.”
Computer Graphics Forum, vol. 39, no. 2, Wiley, 2020, pp. 179–90, doi:10.1111/cgf.13922.
short: J. Zhou, C. Tu, D. Zorin, M. Campen, Computer Graphics Forum 39 (2020) 179–190.
date_created: 2025-06-26T06:52:07Z
date_updated: 2025-07-14T12:48:19Z
department:
- _id: '969'
doi: 10.1111/cgf.13922
extern: '1'
intvolume: ' 39'
issue: '2'
language:
- iso: eng
page: 179-190
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
- 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Combinatorial Construction of Seamless Parameter Domains
type: journal_article
user_id: '117512'
volume: 39
year: '2020'
...
---
_id: '60382'
article_number: '102862'
author:
- first_name: Manish
full_name: Mandad, Manish
last_name: Mandad
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: Mandad M, Campen M. Efficient piecewise higher-order parametrization of discrete
surfaces with local and global injectivity. Computer-Aided Design. 2020;127.
doi:10.1016/j.cad.2020.102862
apa: Mandad, M., & Campen, M. (2020). Efficient piecewise higher-order parametrization
of discrete surfaces with local and global injectivity. Computer-Aided Design,
127, Article 102862. https://doi.org/10.1016/j.cad.2020.102862
bibtex: '@article{Mandad_Campen_2020, title={Efficient piecewise higher-order parametrization
of discrete surfaces with local and global injectivity}, volume={127}, DOI={10.1016/j.cad.2020.102862},
number={102862}, journal={Computer-Aided Design}, publisher={Elsevier BV}, author={Mandad,
Manish and Campen, Marcel}, year={2020} }'
chicago: Mandad, Manish, and Marcel Campen. “Efficient Piecewise Higher-Order Parametrization
of Discrete Surfaces with Local and Global Injectivity.” Computer-Aided Design
127 (2020). https://doi.org/10.1016/j.cad.2020.102862.
ieee: 'M. Mandad and M. Campen, “Efficient piecewise higher-order parametrization
of discrete surfaces with local and global injectivity,” Computer-Aided Design,
vol. 127, Art. no. 102862, 2020, doi: 10.1016/j.cad.2020.102862.'
mla: Mandad, Manish, and Marcel Campen. “Efficient Piecewise Higher-Order Parametrization
of Discrete Surfaces with Local and Global Injectivity.” Computer-Aided Design,
vol. 127, 102862, Elsevier BV, 2020, doi:10.1016/j.cad.2020.102862.
short: M. Mandad, M. Campen, Computer-Aided Design 127 (2020).
date_created: 2025-06-26T06:50:22Z
date_updated: 2025-07-14T12:48:16Z
department:
- _id: '969'
doi: 10.1016/j.cad.2020.102862
extern: '1'
intvolume: ' 127'
language:
- iso: eng
publication: Computer-Aided Design
publication_identifier:
issn:
- 0010-4485
publication_status: published
publisher: Elsevier BV
status: public
title: Efficient piecewise higher-order parametrization of discrete surfaces with
local and global injectivity
type: journal_article
user_id: '117512'
volume: 127
year: '2020'
...
---
_id: '21267'
author:
- first_name: Lea
full_name: Budde, Lea
id: '32443'
last_name: Budde
- first_name: Carsten
full_name: Schulte, Carsten
id: '60311'
last_name: Schulte
- first_name: Heike M.
full_name: Buhl, Heike M.
id: '27152'
last_name: Buhl
- first_name: Andreas
full_name: Muehling, Andreas
last_name: Muehling
citation:
ama: Budde L, Schulte C, Buhl HM, Muehling A. Understanding and Explaining Digital
Artefacts - the Role of a Duality (Accepted Paper - Digital Publication Follows).
Seventh International Conference on Learning and Teaching in Computing and
Engineeringe. Published online 2020.
apa: Budde, L., Schulte, C., Buhl, H. M., & Muehling, A. (2020). Understanding
and Explaining Digital Artefacts - the Role of a Duality (Accepted Paper - Digital
Publication Follows). Seventh International Conference on Learning and Teaching
in Computing and Engineeringe.
bibtex: '@article{Budde_Schulte_Buhl_Muehling_2020, title={Understanding and Explaining
Digital Artefacts - the Role of a Duality (Accepted Paper - Digital Publication
Follows)}, journal={Seventh International Conference on Learning and Teaching
in Computing and Engineeringe}, publisher={(IEEE)}, author={Budde, Lea and Schulte,
Carsten and Buhl, Heike M. and Muehling, Andreas}, year={2020} }'
chicago: Budde, Lea, Carsten Schulte, Heike M. Buhl, and Andreas Muehling. “Understanding
and Explaining Digital Artefacts - the Role of a Duality (Accepted Paper - Digital
Publication Follows).” Seventh International Conference on Learning and Teaching
in Computing and Engineeringe, 2020.
ieee: L. Budde, C. Schulte, H. M. Buhl, and A. Muehling, “Understanding and Explaining
Digital Artefacts - the Role of a Duality (Accepted Paper - Digital Publication
Follows),” Seventh International Conference on Learning and Teaching in Computing
and Engineeringe, 2020.
mla: Budde, Lea, et al. “Understanding and Explaining Digital Artefacts - the Role
of a Duality (Accepted Paper - Digital Publication Follows).” Seventh International
Conference on Learning and Teaching in Computing and Engineeringe, (IEEE),
2020.
short: L. Budde, C. Schulte, H.M. Buhl, A. Muehling, Seventh International Conference
on Learning and Teaching in Computing and Engineeringe (2020).
date_created: 2021-02-24T09:18:36Z
date_updated: 2025-08-12T07:15:23Z
department:
- _id: '67'
- _id: '427'
keyword:
- ⛔ No DOI found
language:
- iso: eng
project:
- _id: '114'
grant_number: '438445824'
name: 'TRR 318 - A04: TRR 318 - Integration des technischen Modells in das Partnermodell
bei der Erklärung von digitalen Artefakten (Teilprojekt A04)'
publication: Seventh International Conference on Learning and Teaching in Computing
and Engineeringe
publisher: (IEEE)
status: public
title: Understanding and Explaining Digital Artefacts - the Role of a Duality (Accepted
Paper - Digital Publication Follows)
type: journal_article
user_id: '90826'
year: '2020'
...
---
_id: '15266'
author:
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Ivan
full_name: Jovanovikj, Ivan
id: '39187'
last_name: Jovanovikj
orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Kai
full_name: Biermeier, Kai
id: '55908'
last_name: Biermeier
orcid: 0000-0002-2879-2359
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
orcid: 0000-0003-3084-0409
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: Yigitbas E, Jovanovikj I, Biermeier K, Sauer S, Engels G. Integrated Model-driven
Development of Self-adaptive User Interfaces . International Journal on Software
and Systems Modeling (SoSyM). Published online 2020.
apa: Yigitbas, E., Jovanovikj, I., Biermeier, K., Sauer, S., & Engels, G. (2020).
Integrated Model-driven Development of Self-adaptive User Interfaces . International
Journal on Software and Systems Modeling (SoSyM).
bibtex: '@article{Yigitbas_Jovanovikj_Biermeier_Sauer_Engels_2020, title={Integrated
Model-driven Development of Self-adaptive User Interfaces }, journal={International
Journal on Software and Systems Modeling (SoSyM)}, publisher={Springer}, author={Yigitbas,
Enes and Jovanovikj, Ivan and Biermeier, Kai and Sauer, Stefan and Engels, Gregor},
year={2020} }'
chicago: Yigitbas, Enes, Ivan Jovanovikj, Kai Biermeier, Stefan Sauer, and Gregor
Engels. “Integrated Model-Driven Development of Self-Adaptive User Interfaces
.” International Journal on Software and Systems Modeling (SoSyM), 2020.
ieee: E. Yigitbas, I. Jovanovikj, K. Biermeier, S. Sauer, and G. Engels, “Integrated
Model-driven Development of Self-adaptive User Interfaces ,” International
Journal on Software and Systems Modeling (SoSyM), 2020.
mla: Yigitbas, Enes, et al. “Integrated Model-Driven Development of Self-Adaptive
User Interfaces .” International Journal on Software and Systems Modeling (SoSyM),
Springer, 2020.
short: E. Yigitbas, I. Jovanovikj, K. Biermeier, S. Sauer, G. Engels, International
Journal on Software and Systems Modeling (SoSyM) (2020).
date_created: 2019-12-10T11:31:55Z
date_updated: 2025-09-10T11:41:54Z
department:
- _id: '66'
- _id: '534'
language:
- iso: eng
main_file_link:
- url: https://doi.org/10.1007/s10270-020-00777-7
publication: International Journal on Software and Systems Modeling (SoSyM)
publisher: Springer
status: public
title: 'Integrated Model-driven Development of Self-adaptive User Interfaces '
type: journal_article
user_id: '8447'
year: '2020'
...
---
_id: '16726'
author:
- first_name: Hadi
full_name: Razzaghi Kouchaksaraei, Hadi
id: '60845'
last_name: Razzaghi Kouchaksaraei
- first_name: Ashwin Prasad
full_name: Shivarpatna Venkatesh, Ashwin Prasad
id: '66637'
last_name: Shivarpatna Venkatesh
- first_name: Amey
full_name: Churi, Amey
last_name: Churi
- first_name: Marvin
full_name: Illian, Marvin
id: '44169'
last_name: Illian
orcid: 0009-0007-2992-8346
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Razzaghi Kouchaksaraei H, Shivarpatna Venkatesh AP, Churi A, Illian M, Karl
H. Dynamic Provisioning of Network Services on Heterogeneous Resources. In: European
Conference on Networks and Communications (EUCNC 2020).'
apa: Razzaghi Kouchaksaraei, H., Shivarpatna Venkatesh, A. P., Churi, A., Illian,
M., & Karl, H. (n.d.). Dynamic Provisioning of Network Services on Heterogeneous
Resources. European Conference on Networks and Communications (EUCNC 2020).
European Conference on Networks and Communications (EUCNC 2020).
bibtex: '@inproceedings{Razzaghi Kouchaksaraei_Shivarpatna Venkatesh_Churi_Illian_Karl,
title={Dynamic Provisioning of Network Services on Heterogeneous Resources}, booktitle={European
Conference on Networks and Communications (EUCNC 2020)}, author={Razzaghi Kouchaksaraei,
Hadi and Shivarpatna Venkatesh, Ashwin Prasad and Churi, Amey and Illian, Marvin
and Karl, Holger} }'
chicago: Razzaghi Kouchaksaraei, Hadi, Ashwin Prasad Shivarpatna Venkatesh, Amey
Churi, Marvin Illian, and Holger Karl. “Dynamic Provisioning of Network Services
on Heterogeneous Resources.” In European Conference on Networks and Communications
(EUCNC 2020), n.d.
ieee: H. Razzaghi Kouchaksaraei, A. P. Shivarpatna Venkatesh, A. Churi, M. Illian,
and H. Karl, “Dynamic Provisioning of Network Services on Heterogeneous Resources,”
presented at the European Conference on Networks and Communications (EUCNC 2020).
mla: Razzaghi Kouchaksaraei, Hadi, et al. “Dynamic Provisioning of Network Services
on Heterogeneous Resources.” European Conference on Networks and Communications
(EUCNC 2020).
short: 'H. Razzaghi Kouchaksaraei, A.P. Shivarpatna Venkatesh, A. Churi, M. Illian,
H. Karl, in: European Conference on Networks and Communications (EUCNC 2020),
n.d.'
conference:
end_date: 2020-06-18
name: European Conference on Networks and Communications (EUCNC 2020)
start_date: 2020-06-15
date_created: 2020-04-20T09:36:53Z
date_updated: 2026-05-20T08:45:06Z
department:
- _id: '34'
language:
- iso: eng
project:
- _id: '23'
name: 5G Programmable Infrastructure Converging disaggregated neTwork and compUte
Resources
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '1'
name: SFB 901
publication: European Conference on Networks and Communications (EUCNC 2020)
publication_status: accepted
quality_controlled: '1'
status: public
title: Dynamic Provisioning of Network Services on Heterogeneous Resources
type: conference
user_id: '44169'
year: '2020'
...
---
_id: '19523'
abstract:
- lang: eng
text: "We study the problem of learning choice functions, which play an important\r\nrole
in various domains of application, most notably in the field of economics.\r\nFormally,
a choice function is a mapping from sets to sets: Given a set of\r\nchoice alternatives
as input, a choice function identifies a subset of most\r\npreferred elements.
Learning choice functions from suitable training data comes\r\nwith a number of
challenges. For example, the sets provided as input and the\r\nsubsets produced
as output can be of any size. Moreover, since the order in\r\nwhich alternatives
are presented is irrelevant, a choice function should be\r\nsymmetric. Perhaps
most importantly, choice functions are naturally\r\ncontext-dependent, in the
sense that the preference in favor of an alternative\r\nmay depend on what other
options are available. We formalize the problem of\r\nlearning choice functions
and present two general approaches based on two\r\nrepresentations of context-dependent
utility functions. Both approaches are\r\ninstantiated by means of appropriate
neural network architectures, and their\r\nperformance is demonstrated on suitable
benchmark tasks."
author:
- first_name: Karlson
full_name: Pfannschmidt, Karlson
last_name: Pfannschmidt
- first_name: Pritha
full_name: Gupta, Pritha
last_name: Gupta
- first_name: Eyke
full_name: Hüllermeier, Eyke
last_name: Hüllermeier
citation:
ama: 'Pfannschmidt K, Gupta P, Hüllermeier E. Learning Choice Functions: Concepts
and Architectures. arXiv:190110860. 2019.'
apa: 'Pfannschmidt, K., Gupta, P., & Hüllermeier, E. (2019). Learning Choice
Functions: Concepts and Architectures. ArXiv:1901.10860.'
bibtex: '@article{Pfannschmidt_Gupta_Hüllermeier_2019, title={Learning Choice Functions:
Concepts and Architectures}, journal={arXiv:1901.10860}, author={Pfannschmidt,
Karlson and Gupta, Pritha and Hüllermeier, Eyke}, year={2019} }'
chicago: 'Pfannschmidt, Karlson, Pritha Gupta, and Eyke Hüllermeier. “Learning Choice
Functions: Concepts and Architectures.” ArXiv:1901.10860, 2019.'
ieee: 'K. Pfannschmidt, P. Gupta, and E. Hüllermeier, “Learning Choice Functions:
Concepts and Architectures,” arXiv:1901.10860. 2019.'
mla: 'Pfannschmidt, Karlson, et al. “Learning Choice Functions: Concepts and Architectures.”
ArXiv:1901.10860, 2019.'
short: K. Pfannschmidt, P. Gupta, E. Hüllermeier, ArXiv:1901.10860 (2019).
date_created: 2020-09-17T10:53:38Z
date_updated: 2022-01-06T06:54:06Z
department:
- _id: '7'
- _id: '355'
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: arXiv:1901.10860
status: public
title: 'Learning Choice Functions: Concepts and Architectures'
type: preprint
user_id: '13472'
year: '2019'
...
---
_id: '19945'
abstract:
- lang: eng
text: Many PDEs (Burgers' equation, KdV, Camassa-Holm, Euler's fluid equations,
…) can be formulated as infinite-dimensional Lie-Poisson systems. These are Hamiltonian
systems on manifolds equipped with Poisson brackets. The Poisson structure is
connected to conservation properties and other geometric features of solutions
to the PDE and, therefore, of great interest for numerical integration. For the
example of Burgers' equations and related PDEs we use Clebsch variables to lift
the original system to a collective Hamiltonian system on a symplectic manifold
whose structure is related to the original Lie-Poisson structure. On the collective
Hamiltonian system a symplectic integrator can be applied. Our numerical examples
show excellent conservation properties and indicate that the disadvantage of an
increased phase-space dimension can be outweighed by the advantage of symplectic
integration.
article_type: original
author:
- first_name: Robert I
full_name: McLachlan, Robert I
last_name: McLachlan
- first_name: Christian
full_name: Offen, Christian
id: '85279'
last_name: Offen
orcid: https://orcid.org/0000-0002-5940-8057
- first_name: Benjamin K
full_name: Tapley, Benjamin K
last_name: Tapley
citation:
ama: McLachlan RI, Offen C, Tapley BK. Symplectic integration of PDEs using Clebsch
variables. Journal of Computational Dynamics. 2019;6(1):111-130. doi:10.3934/jcd.2019005
apa: McLachlan, R. I., Offen, C., & Tapley, B. K. (2019). Symplectic integration
of PDEs using Clebsch variables. Journal of Computational Dynamics, 6(1),
111–130. https://doi.org/10.3934/jcd.2019005
bibtex: '@article{McLachlan_Offen_Tapley_2019, title={Symplectic integration of
PDEs using Clebsch variables}, volume={6}, DOI={10.3934/jcd.2019005},
number={1}, journal={Journal of Computational Dynamics}, publisher={American Institute
of Mathematical Sciences (AIMS)}, author={McLachlan, Robert I and Offen, Christian
and Tapley, Benjamin K}, year={2019}, pages={111–130} }'
chicago: 'McLachlan, Robert I, Christian Offen, and Benjamin K Tapley. “Symplectic
Integration of PDEs Using Clebsch Variables.” Journal of Computational Dynamics
6, no. 1 (2019): 111–30. https://doi.org/10.3934/jcd.2019005.'
ieee: R. I. McLachlan, C. Offen, and B. K. Tapley, “Symplectic integration of PDEs
using Clebsch variables,” Journal of Computational Dynamics, vol. 6, no.
1, pp. 111–130, 2019.
mla: McLachlan, Robert I., et al. “Symplectic Integration of PDEs Using Clebsch
Variables.” Journal of Computational Dynamics, vol. 6, no. 1, American
Institute of Mathematical Sciences (AIMS), 2019, pp. 111–30, doi:10.3934/jcd.2019005.
short: R.I. McLachlan, C. Offen, B.K. Tapley, Journal of Computational Dynamics
6 (2019) 111–130.
date_created: 2020-10-06T16:44:07Z
date_updated: 2022-01-06T06:54:15Z
department:
- _id: '636'
doi: 10.3934/jcd.2019005
extern: '1'
intvolume: ' 6'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.aimsciences.org/article/doi/10.3934/jcd.2019005
oa: '1'
page: 111-130
publication: Journal of Computational Dynamics
publication_identifier:
issn:
- 2158-2505
publisher: American Institute of Mathematical Sciences (AIMS)
status: public
title: Symplectic integration of PDEs using Clebsch variables
type: journal_article
user_id: '85279'
volume: 6
year: '2019'
...
---
_id: '24053'
abstract:
- lang: eng
text: "We overview the 3-year Meteracom project which\r\nwill provide traceability
to the SI for THz communication\r\nmeasurement parameters. The key objectives
are to develop new\r\nmetrological methods to characterize the measurement systems,\r\nsystem
components and propagation channels. The final\r\nobjective is to develop metrology
for functionality and signal\r\nintegrity of THz communication systems; particularly
device\r\ndiscovery and beam tracking, determination of physical layer\r\nparameters
for digital transmission and real-time performance\r\nevaluation."
author:
- first_name: David
full_name: Humphreys, David
last_name: Humphreys
- first_name: Mladen
full_name: Berekovic, Mladen
last_name: Berekovic
- first_name: Ingmar
full_name: Kallfass, Ingmar
last_name: Kallfass
- first_name: Christoph
full_name: Scheytt, Christoph
id: '37144'
last_name: Scheytt
- first_name: Thomas
full_name: Kuerner, Thomas
last_name: Kuerner
- first_name: Admela
full_name: Jukan, Admela
last_name: Jukan
- first_name: Thomas
full_name: Schneider, Thomas
last_name: Schneider
- first_name: Thomas
full_name: Kleine-Ostmann, Thomas
last_name: Kleine-Ostmann
- first_name: Martin
full_name: Koch, Martin
last_name: Koch
- first_name: Reiner
full_name: Thomae, Reiner
last_name: Thomae
citation:
ama: 'Humphreys D, Berekovic M, Kallfass I, et al. An overview of the Meteracom
Project. In: Proc. 43-Nd Meeting of the Wireless World Research Forum (WWRF)",.
; 2019.'
apa: Humphreys, D., Berekovic, M., Kallfass, I., Scheytt, C., Kuerner, T., Jukan,
A., Schneider, T., Kleine-Ostmann, T., Koch, M., & Thomae, R. (2019). An overview
of the Meteracom Project. Proc. 43-Nd Meeting of the Wireless World Research
Forum (WWRF)",.
bibtex: '@inproceedings{Humphreys_Berekovic_Kallfass_Scheytt_Kuerner_Jukan_Schneider_Kleine-Ostmann_Koch_Thomae_2019,
place={London, England}, title={An overview of the Meteracom Project}, booktitle={Proc.
43-nd Meeting of the Wireless World Research Forum (WWRF)",}, author={Humphreys,
David and Berekovic, Mladen and Kallfass, Ingmar and Scheytt, Christoph and Kuerner,
Thomas and Jukan, Admela and Schneider, Thomas and Kleine-Ostmann, Thomas and
Koch, Martin and Thomae, Reiner}, year={2019} }'
chicago: Humphreys, David, Mladen Berekovic, Ingmar Kallfass, Christoph Scheytt,
Thomas Kuerner, Admela Jukan, Thomas Schneider, Thomas Kleine-Ostmann, Martin
Koch, and Reiner Thomae. “An Overview of the Meteracom Project.” In Proc. 43-Nd
Meeting of the Wireless World Research Forum (WWRF)",. London, England, 2019.
ieee: D. Humphreys et al., “An overview of the Meteracom Project,” 2019.
mla: Humphreys, David, et al. “An Overview of the Meteracom Project.” Proc. 43-Nd
Meeting of the Wireless World Research Forum (WWRF)", 2019.
short: 'D. Humphreys, M. Berekovic, I. Kallfass, C. Scheytt, T. Kuerner, A. Jukan,
T. Schneider, T. Kleine-Ostmann, M. Koch, R. Thomae, in: Proc. 43-Nd Meeting of
the Wireless World Research Forum (WWRF)", London, England, 2019.'
date_created: 2021-09-09T12:26:07Z
date_updated: 2022-01-06T06:56:06Z
department:
- _id: '58'
language:
- iso: eng
place: London, England
publication: Proc. 43-nd Meeting of the Wireless World Research Forum (WWRF)",
related_material:
link:
- relation: confirmation
url: https://www.wwrf.ch/files/content%20wwrf/meetings/past%20events/wwrf43/presentations%20wwrf43/Metaracom%20Project.pdf
status: public
title: An overview of the Meteracom Project
type: conference
user_id: '15931'
year: '2019'
...
---
_id: '24058'
abstract:
- lang: eng
text: Embedded systems require a high energy efficiency in combination with an optimized
performance. As such, Bit Manipulation Instructions (BMIs) were introduced for
x86 and ARMv8 to improve the runtime efficiency and power dissipation of the compiled
software for various applications. Though the RISC-V platform is meanwhile widely
accepted for embedded systems application, its instruction set architecture (ISA)
currently still supports only two basic BMIs.We introduce ten advanced BMIs for
the RISC-V ISA and implemented them on Berkeley's Rocket CPU [1], which we synthesized
for the Artix-7 FPGA and the TSMC 65nm cell library. Our RISC-V BMI definitions
are based on an analysis and combination of existing x86 and ARMv8 BMIs. Our Rocket
CPU hardware extensions show that RISC-V BMI extensions have no negative impact
on the critical path of the execution pipeline. Our software evaluations show
that we can, for example, expect a significant impact for time and power consuming
cryptographic applications.
author:
- first_name: Bastian
full_name: Koppelmann, Bastian
id: '25260'
last_name: Koppelmann
- first_name: Peer
full_name: Adelt, Peer
id: '5603'
last_name: Adelt
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Christoph
full_name: Scheytt, Christoph
id: '37144'
last_name: Scheytt
citation:
ama: 'Koppelmann B, Adelt P, Müller W, Scheytt C. RISC-V Extensions for Bit Manipulation
Instructions. In: 29th International Symposium on Power and Timing Modeling,
Optimization and Simulation (PATMOS). ; 2019. doi:10.1109/PATMOS.2019.8862170'
apa: Koppelmann, B., Adelt, P., Müller, W., & Scheytt, C. (2019). RISC-V Extensions
for Bit Manipulation Instructions. 29th International Symposium on Power and
Timing Modeling, Optimization and Simulation (PATMOS). https://doi.org/10.1109/PATMOS.2019.8862170
bibtex: '@inproceedings{Koppelmann_Adelt_Müller_Scheytt_2019, place={Rhodos, Griechenland},
title={RISC-V Extensions for Bit Manipulation Instructions}, DOI={10.1109/PATMOS.2019.8862170},
booktitle={29th International Symposium on Power and Timing Modeling, Optimization
and Simulation (PATMOS)}, author={Koppelmann, Bastian and Adelt, Peer and Müller,
Wolfgang and Scheytt, Christoph}, year={2019} }'
chicago: Koppelmann, Bastian, Peer Adelt, Wolfgang Müller, and Christoph Scheytt.
“RISC-V Extensions for Bit Manipulation Instructions.” In 29th International
Symposium on Power and Timing Modeling, Optimization and Simulation (PATMOS).
Rhodos, Griechenland, 2019. https://doi.org/10.1109/PATMOS.2019.8862170.
ieee: 'B. Koppelmann, P. Adelt, W. Müller, and C. Scheytt, “RISC-V Extensions for
Bit Manipulation Instructions,” 2019, doi: 10.1109/PATMOS.2019.8862170.'
mla: Koppelmann, Bastian, et al. “RISC-V Extensions for Bit Manipulation Instructions.”
29th International Symposium on Power and Timing Modeling, Optimization and
Simulation (PATMOS), 2019, doi:10.1109/PATMOS.2019.8862170.
short: 'B. Koppelmann, P. Adelt, W. Müller, C. Scheytt, in: 29th International Symposium
on Power and Timing Modeling, Optimization and Simulation (PATMOS), Rhodos, Griechenland,
2019.'
conference:
end_date: 2019.07.03
start_date: 2019.07.01
date_created: 2021-09-09T12:26:14Z
date_updated: 2022-01-06T06:56:06Z
department:
- _id: '58'
doi: 10.1109/PATMOS.2019.8862170
language:
- iso: eng
place: Rhodos, Griechenland
publication: 29th International Symposium on Power and Timing Modeling, Optimization
and Simulation (PATMOS)
related_material:
link:
- relation: confirmation
url: https://ieeexplore.ieee.org/document/8862170
status: public
title: RISC-V Extensions for Bit Manipulation Instructions
type: conference
user_id: '15931'
year: '2019'
...
---
_id: '24060'
abstract:
- lang: ger
text: 'In diesem Artikel stellen wir eine Methode zur nicht-invasiven dynamischen
Speicher- und IO-Analyse mit QEMU für sicherheitskritische eingebettete Software
für die RISC-V Befehlssatzarchitektur vor. Die Implementierung basiert auf einer
Erweiterung des Tiny Code Generator (TCG) des quelloffenen CPU-Emulators QEMU
um die dynamische Identifikation von Zugriffen auf Datenspeicher sowie auf an
die CPU angeschlossene IO-Geräte. Wir demonstrieren die Funktionalität der Methode
anhand eines Versuchsaufbaus, bei dem eine Schließsystemkontrolle mittels serieller
UART-Schnittstelle an einen RISC-V-Prozessor angebunden ist. Dieses Szenario zeigt,
dass ein unberechtigter Zugriff auf die UART-Schnittstelle frühzeitig aufgedeckt
und ein Angriff auf eine Zugangskontrolle somit endeckt werden kann. '
author:
- first_name: Peer
full_name: Adelt, Peer
id: '5603'
last_name: Adelt
- first_name: Bastian
full_name: Koppelmann, Bastian
id: '25260'
last_name: Koppelmann
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Christoph
full_name: Scheytt, Christoph
id: '37144'
last_name: Scheytt
citation:
ama: 'Adelt P, Koppelmann B, Müller W, Scheytt C. Analyse sicherheitskritischer
Software für RISC-V Prozessoren. In: MBMV 2019-22.Workshop Methoden Und Beschreibungssprachen
Zur Modellierung Und Verifikation von Schaltungen Und Systemen (MBMV 2019).
; 2019.'
apa: Adelt, P., Koppelmann, B., Müller, W., & Scheytt, C. (2019). Analyse sicherheitskritischer
Software für RISC-V Prozessoren. MBMV 2019-22.Workshop Methoden Und Beschreibungssprachen
Zur Modellierung Und Verifikation von Schaltungen Und Systemen (MBMV 2019).
bibtex: '@inproceedings{Adelt_Koppelmann_Müller_Scheytt_2019, place={Kaiserslautern,
DE}, title={Analyse sicherheitskritischer Software für RISC-V Prozessoren}, booktitle={MBMV
2019-22.Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation
von Schaltungen und Systemen (MBMV 2019)}, author={Adelt, Peer and Koppelmann,
Bastian and Müller, Wolfgang and Scheytt, Christoph}, year={2019} }'
chicago: Adelt, Peer, Bastian Koppelmann, Wolfgang Müller, and Christoph Scheytt.
“Analyse Sicherheitskritischer Software Für RISC-V Prozessoren.” In MBMV 2019-22.Workshop
Methoden Und Beschreibungssprachen Zur Modellierung Und Verifikation von Schaltungen
Und Systemen (MBMV 2019). Kaiserslautern, DE, 2019.
ieee: P. Adelt, B. Koppelmann, W. Müller, and C. Scheytt, “Analyse sicherheitskritischer
Software für RISC-V Prozessoren,” 2019.
mla: Adelt, Peer, et al. “Analyse Sicherheitskritischer Software Für RISC-V Prozessoren.”
MBMV 2019-22.Workshop Methoden Und Beschreibungssprachen Zur Modellierung Und
Verifikation von Schaltungen Und Systemen (MBMV 2019), 2019.
short: 'P. Adelt, B. Koppelmann, W. Müller, C. Scheytt, in: MBMV 2019-22.Workshop
Methoden Und Beschreibungssprachen Zur Modellierung Und Verifikation von Schaltungen
Und Systemen (MBMV 2019), Kaiserslautern, DE, 2019.'
conference:
end_date: 2019.04.08
start_date: 2019.04.08
date_created: 2021-09-09T12:26:16Z
date_updated: 2022-01-06T06:56:06Z
department:
- _id: '58'
language:
- iso: eng
place: Kaiserslautern, DE
publication: MBMV 2019-22.Workshop Methoden und Beschreibungssprachen zur Modellierung
und Verifikation von Schaltungen und Systemen (MBMV 2019)
publication_identifier:
isbn:
- 978-3-8007-4945-4
related_material:
link:
- relation: confirmation
url: https://www.vde-verlag.de/proceedings-de/454945007.html
status: public
title: Analyse sicherheitskritischer Software für RISC-V Prozessoren
type: conference
user_id: '15931'
year: '2019'
...
---
_id: '24061'
author:
- first_name: Peer
full_name: Adelt, Peer
id: '5603'
last_name: Adelt
- first_name: Bastian
full_name: Koppelmann, Bastian
id: '25260'
last_name: Koppelmann
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Christoph
full_name: Scheytt, Christoph
id: '37144'
last_name: Scheytt
- first_name: Benedikt
full_name: Driessen, Benedikt
last_name: Driessen
citation:
ama: 'Adelt P, Koppelmann B, Müller W, Scheytt C, Driessen B. QEMU for Dynamic Memory
Analysis of Security Sensitive Software. In: 2nd International Workshop on
Embedded Software for Industrial IoT in Conjunction with DATE 2019. ; 2019:32-34.'
apa: Adelt, P., Koppelmann, B., Müller, W., Scheytt, C., & Driessen, B. (2019).
QEMU for Dynamic Memory Analysis of Security Sensitive Software. 2nd International
Workshop on Embedded Software for Industrial IoT in Conjunction with DATE 2019,
32–34.
bibtex: '@inproceedings{Adelt_Koppelmann_Müller_Scheytt_Driessen_2019, place={Florence,
Italy}, title={QEMU for Dynamic Memory Analysis of Security Sensitive Software},
booktitle={ 2nd International Workshop on Embedded Software for Industrial IoT
in conjunction with DATE 2019}, author={Adelt, Peer and Koppelmann, Bastian and
Müller, Wolfgang and Scheytt, Christoph and Driessen, Benedikt}, year={2019},
pages={32–34} }'
chicago: Adelt, Peer, Bastian Koppelmann, Wolfgang Müller, Christoph Scheytt, and
Benedikt Driessen. “QEMU for Dynamic Memory Analysis of Security Sensitive Software.”
In 2nd International Workshop on Embedded Software for Industrial IoT in Conjunction
with DATE 2019, 32–34. Florence, Italy, 2019.
ieee: P. Adelt, B. Koppelmann, W. Müller, C. Scheytt, and B. Driessen, “QEMU for
Dynamic Memory Analysis of Security Sensitive Software,” in 2nd International
Workshop on Embedded Software for Industrial IoT in conjunction with DATE 2019,
2019, pp. 32–34.
mla: Adelt, Peer, et al. “QEMU for Dynamic Memory Analysis of Security Sensitive
Software.” 2nd International Workshop on Embedded Software for Industrial
IoT in Conjunction with DATE 2019, 2019, pp. 32–34.
short: 'P. Adelt, B. Koppelmann, W. Müller, C. Scheytt, B. Driessen, in: 2nd International
Workshop on Embedded Software for Industrial IoT in Conjunction with DATE 2019,
Florence, Italy, 2019, pp. 32–34.'
date_created: 2021-09-09T12:26:18Z
date_updated: 2022-01-06T06:56:06Z
department:
- _id: '58'
language:
- iso: eng
page: 32-34
place: Florence, Italy
publication: ' 2nd International Workshop on Embedded Software for Industrial IoT
in conjunction with DATE 2019'
related_material:
link:
- relation: confirmation
url: https://www.researchgate.net/publication/334258953_QEMU_for_Dynamic_Memory_Analysis_of_Security_Sensitive_Software
status: public
title: QEMU for Dynamic Memory Analysis of Security Sensitive Software
type: conference
user_id: '15931'
year: '2019'
...
---
_id: '24063'
abstract:
- lang: eng
text: It its current Version 3.1.0 QEMU supports RISC-V RV32GC and RV64GC software
emulation in user and full system mode. We will first give an overview of the
current state of the QEMU RISC-V implementation. Thereafter, we will present the
DecodeTree tool, which will be available with the next QEMU release. DecodeTree
is a code generator included in QEMU that can generate the program logic for extracting
and decoding opcodes and operands from a formal instruction list of the target
architecture. This enables the structured implementation of just-in-time compilations
to guarantee that the QEMU implementation meets the ISA specification. As such,
we completely replaced the existing RISC-V RV32GC and RV64GC implementations by
DecodeTree generations in the next official QEMU release, which is expected in
spring 2019. We will demonstrate the DecodeTree applications by the example of
RISC-V ISA subset configurations.
author:
- first_name: Peer
full_name: Adelt, Peer
id: '5603'
last_name: Adelt
- first_name: Bastian
full_name: Koppelmann, Bastian
id: '25260'
last_name: Koppelmann
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Christoph
full_name: Scheytt, Christoph
id: '37144'
last_name: Scheytt
citation:
ama: 'Adelt P, Koppelmann B, Müller W, Scheytt C. QEMU Support for RISC-V: Current
State and Future Releases. 2nd International Workshop on RISC-V Research Activities.
2019;(Presentation).'
apa: 'Adelt, P., Koppelmann, B., Müller, W., & Scheytt, C. (2019). QEMU Support
for RISC-V: Current State and Future Releases. 2nd International Workshop on
RISC-V Research Activities, (Presentation).'
bibtex: '@article{Adelt_Koppelmann_Müller_Scheytt_2019, title={QEMU Support for
RISC-V: Current State and Future Releases}, volume={(Presentation)}, journal={2nd
International Workshop on RISC-V Research Activities}, author={Adelt, Peer and
Koppelmann, Bastian and Müller, Wolfgang and Scheytt, Christoph}, year={2019}
}'
chicago: 'Adelt, Peer, Bastian Koppelmann, Wolfgang Müller, and Christoph Scheytt.
“QEMU Support for RISC-V: Current State and Future Releases.” 2nd International
Workshop on RISC-V Research Activities (Presentation) (2019).'
ieee: 'P. Adelt, B. Koppelmann, W. Müller, and C. Scheytt, “QEMU Support for RISC-V:
Current State and Future Releases,” 2nd International Workshop on RISC-V Research
Activities, vol. (Presentation), 2019.'
mla: 'Adelt, Peer, et al. “QEMU Support for RISC-V: Current State and Future Releases.”
2nd International Workshop on RISC-V Research Activities, vol. (Presentation),
2019.'
short: P. Adelt, B. Koppelmann, W. Müller, C. Scheytt, 2nd International Workshop
on RISC-V Research Activities (Presentation) (2019).
date_created: 2021-09-09T12:26:20Z
date_updated: 2022-01-06T06:56:06Z
department:
- _id: '58'
language:
- iso: eng
publication: 2nd International Workshop on RISC-V Research Activities
related_material:
link:
- relation: confirmation
url: https://www.edacentrum.de/veranstaltungen/risc-v/2019/programm
status: public
title: 'QEMU Support for RISC-V: Current State and Future Releases'
type: journal_article
user_id: '15931'
volume: (Presentation)
year: '2019'
...
---
_id: '3287'
abstract:
- lang: eng
text: "For optimal placement and orchestration of network services, it is crucial\r\nthat
their structure and semantics are specified clearly and comprehensively\r\nand
are available to an orchestrator. Existing specification approaches are\r\neither
ambiguous or miss important aspects regarding the behavior of virtual\r\nnetwork
functions (VNFs) forming a service. We propose to formally and\r\nunambiguously
specify the behavior of these functions and services using\r\nQueuing Petri Nets
(QPNs). QPNs are an established method that allows to\r\nexpress queuing, synchronization,
stochastically distributed processing delays,\r\nand changing traffic volume and
characteristics at each VNF. With QPNs,\r\nmultiple VNFs can be connected to complete
network services in any structure,\r\neven specifying bidirectional network services
containing loops.\r\n We discuss how management and orchestration systems can
benefit from our\r\nclear and comprehensive specification approach, leading to
better placement of\r\nVNFs and improved Quality of Service. Another benefit of
formally specifying\r\nnetwork services with QPNs are diverse analysis options,
which allow valuable\r\ninsights such as the distribution of end-to-end delay.
We propose a tool-based\r\nworkflow that supports the specification of network
services and the automatic\r\ngeneration of corresponding simulation code to enable
an in-depth analysis of\r\ntheir behavior and performance."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schneider SB, Sharma A, Karl H, Wehrheim H. Specifying and Analyzing Virtual
Network Services Using Queuing Petri Nets. In: 2019 IFIP/IEEE International
Symposium on Integrated Network Management (IM). Washington, DC, USA: IFIP;
2019:116--124.'
apa: 'Schneider, S. B., Sharma, A., Karl, H., & Wehrheim, H. (2019). Specifying
and Analyzing Virtual Network Services Using Queuing Petri Nets. In 2019 IFIP/IEEE
International Symposium on Integrated Network Management (IM) (pp. 116--124).
Washington, DC, USA: IFIP.'
bibtex: '@inproceedings{Schneider_Sharma_Karl_Wehrheim_2019, place={Washington,
DC, USA}, title={Specifying and Analyzing Virtual Network Services Using Queuing
Petri Nets}, booktitle={2019 IFIP/IEEE International Symposium on Integrated Network
Management (IM)}, publisher={IFIP}, author={Schneider, Stefan Balthasar and Sharma,
Arnab and Karl, Holger and Wehrheim, Heike}, year={2019}, pages={116--124} }'
chicago: 'Schneider, Stefan Balthasar, Arnab Sharma, Holger Karl, and Heike Wehrheim.
“Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.”
In 2019 IFIP/IEEE International Symposium on Integrated Network Management
(IM), 116--124. Washington, DC, USA: IFIP, 2019.'
ieee: S. B. Schneider, A. Sharma, H. Karl, and H. Wehrheim, “Specifying and Analyzing
Virtual Network Services Using Queuing Petri Nets,” in 2019 IFIP/IEEE International
Symposium on Integrated Network Management (IM), Washington, DC, USA, 2019,
pp. 116--124.
mla: Schneider, Stefan Balthasar, et al. “Specifying and Analyzing Virtual Network
Services Using Queuing Petri Nets.” 2019 IFIP/IEEE International Symposium
on Integrated Network Management (IM), IFIP, 2019, pp. 116--124.
short: 'S.B. Schneider, A. Sharma, H. Karl, H. Wehrheim, in: 2019 IFIP/IEEE International
Symposium on Integrated Network Management (IM), IFIP, Washington, DC, USA, 2019,
pp. 116--124.'
conference:
end_date: 2019-04-12
location: Washington, DC, USA
name: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)
start_date: 2019-04-08
date_created: 2018-06-18T15:23:18Z
date_updated: 2022-01-06T06:59:09Z
ddc:
- '040'
department:
- _id: '77'
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2019-01-07T12:38:35Z
date_updated: 2019-01-07T12:38:35Z
file_id: '6504'
file_name: ris_preprint.pdf
file_size: 497528
relation: main_file
file_date_updated: 2019-01-07T12:38:35Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://dl.ifip.org/db/conf/im/im2019/188490.pdf
oa: '1'
page: 116--124
place: Washington, DC, USA
project:
- _id: '3'
name: SFB 901 - Project Area B
- _id: '11'
name: SFB 901 - Subproject B3
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '28'
grant_number: '761493'
name: 5G Development and validation platform for global industry-specific network
services and Apps
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
publication: 2019 IFIP/IEEE International Symposium on Integrated Network Management
(IM)
publisher: IFIP
status: public
title: Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets
type: conference
user_id: '35343'
year: '2019'
...
---
_id: '3585'
abstract:
- lang: eng
text: Existing approaches and tools for the generation of approximate circuits often
lack generality and are restricted to certain circuit types, approximation techniques,
and quality assurance methods. Moreover, only few tools are publicly available.
This hinders the development and evaluation of new techniques for approximating
circuits and their comparison to previous approaches. In this paper, we first analyze
and classify related approaches and then present CIRCA, our flexible framework
for search-based approximate circuit generation. CIRCA is developed with a focus
on modularity and extensibility. We present the architecture of CIRCA with its
clear separation into stages and functional blocks, report on the current prototype,
and show initial experiments.
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Hassan
full_name: Ghasemzadeh Mohammadi, Hassan
id: '61186'
last_name: Ghasemzadeh Mohammadi
- 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
id: '398'
last_name: Platzner
citation:
ama: 'Witschen LM, Wiersema T, Ghasemzadeh Mohammadi H, Awais M, Platzner M. CIRCA:
Towards a Modular and Extensible Framework for Approximate Circuit Generation.
Microelectronics Reliability. 2019;99:277-290. doi:10.1016/j.microrel.2019.04.003'
apa: 'Witschen, L. M., Wiersema, T., Ghasemzadeh Mohammadi, H., Awais, M., &
Platzner, M. (2019). CIRCA: Towards a Modular and Extensible Framework for Approximate
Circuit Generation. Microelectronics Reliability, 99, 277–290. https://doi.org/10.1016/j.microrel.2019.04.003'
bibtex: '@article{Witschen_Wiersema_Ghasemzadeh Mohammadi_Awais_Platzner_2019, title={CIRCA:
Towards a Modular and Extensible Framework for Approximate Circuit Generation},
volume={99}, DOI={10.1016/j.microrel.2019.04.003},
journal={Microelectronics Reliability}, publisher={Elsevier}, author={Witschen,
Linus Matthias and Wiersema, Tobias and Ghasemzadeh Mohammadi, Hassan and Awais,
Muhammad and Platzner, Marco}, year={2019}, pages={277–290} }'
chicago: 'Witschen, Linus Matthias, Tobias Wiersema, Hassan Ghasemzadeh Mohammadi,
Muhammad Awais, and Marco Platzner. “CIRCA: Towards a Modular and Extensible Framework
for Approximate Circuit Generation.” Microelectronics Reliability 99 (2019):
277–90. https://doi.org/10.1016/j.microrel.2019.04.003.'
ieee: 'L. M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, and M. Platzner,
“CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit Generation,”
Microelectronics Reliability, vol. 99, pp. 277–290, 2019.'
mla: 'Witschen, Linus Matthias, et al. “CIRCA: Towards a Modular and Extensible
Framework for Approximate Circuit Generation.” Microelectronics Reliability,
vol. 99, Elsevier, 2019, pp. 277–90, doi:10.1016/j.microrel.2019.04.003.'
short: L.M. Witschen, T. Wiersema, H. Ghasemzadeh Mohammadi, M. Awais, M. Platzner,
Microelectronics Reliability 99 (2019) 277–290.
date_created: 2018-07-20T14:08:49Z
date_updated: 2022-01-06T06:59:25Z
department:
- _id: '78'
doi: 10.1016/j.microrel.2019.04.003
intvolume: ' 99'
keyword:
- Approximate Computing
- Framework
- Pareto Front
- Accuracy
language:
- iso: eng
page: 277-290
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Microelectronics Reliability
publication_identifier:
issn:
- 0026-2714
publication_status: published
publisher: Elsevier
status: public
title: 'CIRCA: Towards a Modular and Extensible Framework for Approximate Circuit
Generation'
type: journal_article
user_id: '49051'
volume: 99
year: '2019'
...
---
_id: '2916'
author:
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
citation:
ama: Brauer S. Complexity of single-swap heuristics for metric facility location
and related problems. Theoretical Computer Science. 2019;754:88-106. doi:10.1016/j.tcs.2018.04.048
apa: Brauer, S. (2019). Complexity of single-swap heuristics for metric facility
location and related problems. Theoretical Computer Science, 754,
88–106. https://doi.org/10.1016/j.tcs.2018.04.048
bibtex: '@article{Brauer_2019, title={Complexity of single-swap heuristics for metric
facility location and related problems}, volume={754}, DOI={10.1016/j.tcs.2018.04.048},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Brauer,
Sascha}, year={2019}, pages={88–106} }'
chicago: 'Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility
Location and Related Problems.” Theoretical Computer Science 754 (2019):
88–106. https://doi.org/10.1016/j.tcs.2018.04.048.'
ieee: S. Brauer, “Complexity of single-swap heuristics for metric facility location
and related problems,” Theoretical Computer Science, vol. 754, pp. 88–106,
2019.
mla: Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems.” Theoretical Computer Science, vol. 754, Elsevier,
2019, pp. 88–106, doi:10.1016/j.tcs.2018.04.048.
short: S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
date_created: 2018-05-25T11:10:36Z
date_updated: 2022-01-06T06:58:46Z
department:
- _id: '64'
doi: 10.1016/j.tcs.2018.04.048
intvolume: ' 754'
language:
- iso: eng
page: 88-106
project:
- _id: '45'
name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
status: public
title: Complexity of single-swap heuristics for metric facility location and related
problems
type: journal_article
user_id: '13291'
volume: 754
year: '2019'
...