3 Search Results for "Nikolaus, Paul"

Document
DOI: 10.4230/LIPIcs.GIScience.2025.14
Guiding Geospatial Analysis Processes in Dealing with Modifiable Areal Unit Problems

Authors: Guoray Cai and Yue Hao

Published in: LIPIcs, Volume 346, 13th International Conference on Geographic Information Science (GIScience 2025)

Abstract
Geospatial analysis has been widely applied in different domains for critical decision making. However, the results of spatial analysis are often plagued with uncertainties due to measurement errors, choice of data representations, and unintended transformation artifacts. A well known example of such problems is the Modifiable Areal Unit Problem (MAUP) which has well documented effects on the outcome of spatial analysis on area-aggregated data. Existing methods for addressing the effects of MAUP are limited, are technically complex, and are often inaccessible to practitioners. As a result, analysts tend to ignore the effects of MAUP in practice due to lack of expertise, high cognitive loads, and resource limitations. To address these challenges, this paper proposes a machine-guidance approach to augment the analyst’s capacity in mitigating the effect of MAUP. Based on an analysis of practical challenges faced by human analysts, we identified multiple opportunities for the machine to guide the analysts by alerting to the rise of MAUP, assessing the impact of MAUP, choosing mitigation methods, and generating visual guidance messages using GIS functions and tools. For each of the opportunities, we characterize the behavior patterns and the underlying guidance strategies that generate the behavior. We illustrate the behavior of machine guidance using a hotspot analysis scenario in the context of crime policing, where MAUP has strong effects on the patterns of crime hotspots. Finally, we describe the computational framework used to build a prototype guidance system and identify a number of research questions to be addressed. We conclude by discussing how the machine guidance approach could be an answer to some of the toughest problems in geospatial analysis.
Cite as

Guoray Cai and Yue Hao. Guiding Geospatial Analysis Processes in Dealing with Modifiable Areal Unit Problems. In 13th International Conference on Geographic Information Science (GIScience 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 346, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{cai_et_al:LIPIcs.GIScience.2025.14,
  author =	{Cai, Guoray and Hao, Yue},
  title =	{{Guiding Geospatial Analysis Processes in Dealing with Modifiable Areal Unit Problems}},
  booktitle =	{13th International Conference on Geographic Information Science (GIScience 2025)},
  pages =	{14:1--14:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-378-2},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{346},
  editor =	{Sila-Nowicka, Katarzyna and Moore, Antoni and O'Sullivan, David and Adams, Benjamin and Gahegan, Mark},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GIScience.2025.14},
  URN =		{urn:nbn:de:0030-drops-238433},
  doi =		{10.4230/LIPIcs.GIScience.2025.14},
  annote =	{Keywords: Machine Guidance, Geo-Spatial Analysis, Modifiable Areal Unit Problem (MAUP)}
}
Document
Artifact
DOI: 10.4230/DARTS.9.1.3
Isospeed: Improving (min,+) Convolution by Exploiting (min,+)/(max,+) Isomorphism (Artifact)

Authors: Raffaele Zippo, Paul Nikolaus, and Giovanni Stea

Published in: DARTS, Volume 9, Issue 1, Special Issue of the 35th Euromicro Conference on Real-Time Systems (ECRTS 2023)

Abstract
(min,+) convolution is the key operation in (min,+) algebra, a theory often used to compute performance bounds in real-time systems. As already observed in many works, its algorithm can be computationally expensive, due to the fact that: i) its complexity is superquadratic with respect to the size of the operands; ii) operands must be extended before starting its computation, and iii) said extension is tied to the least common multiple of the operand periods. In this paper, we leverage the isomorphism between (min,+) and (max,+) algebras to devise a new algorithm for (min,+) convolution, in which the need for operand extension is minimized. This algorithm is considerably faster than the ones known so far, and it allows us to abate the computation times of (min,+) convolution by orders of magnitude.
Cite as

Raffaele Zippo, Paul Nikolaus, and Giovanni Stea. Isospeed: Improving (min,+) Convolution by Exploiting (min,+)/(max,+) Isomorphism (Artifact). In Special Issue of the 35th Euromicro Conference on Real-Time Systems (ECRTS 2023). Dagstuhl Artifacts Series (DARTS), Volume 9, Issue 1, pp. 3:1-3:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{zippo_et_al:DARTS.9.1.3,
  author =	{Zippo, Raffaele and Nikolaus, Paul and Stea, Giovanni},
  title =	{{Isospeed: Improving (min,+) Convolution by Exploiting (min,+)/(max,+) Isomorphism (Artifact)}},
  pages =	{3:1--3:4},
  journal =	{Dagstuhl Artifacts Series},
  ISSN =	{2509-8195},
  year =	{2023},
  volume =	{9},
  number =	{1},
  editor =	{Zippo, Raffaele and Nikolaus, Paul and Stea, Giovanni},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DARTS.9.1.3},
  URN =		{urn:nbn:de:0030-drops-180247},
  doi =		{10.4230/DARTS.9.1.3},
  annote =	{Keywords: Deterministic Network Calculus, min-plus algebra, max-plus algebra, performance, algorithms}
}
Document
DOI: 10.4230/LIPIcs.ECRTS.2023.12
Isospeed: Improving (min,+) Convolution by Exploiting (min,+)/(max,+) Isomorphism

Authors: Raffaele Zippo, Paul Nikolaus, and Giovanni Stea

Published in: LIPIcs, Volume 262, 35th Euromicro Conference on Real-Time Systems (ECRTS 2023)

Abstract
(min,+) convolution is the key operation in (min,+) algebra, a theory often used to compute performance bounds in real-time systems. As already observed in many works, its algorithm can be computationally expensive, due to the fact that: i) its complexity is superquadratic with respect to the size of the operands; ii) operands must be extended before starting its computation, and iii) said extension is tied to the least common multiple of the operand periods. In this paper, we leverage the isomorphism between (min,+) and (max,+) algebras to devise a new algorithm for (min,+) convolution, in which the need for operand extension is minimized. This algorithm is considerably faster than the ones known so far, and it allows us to reduce the computation times of (min,+) convolution by orders of magnitude.
Cite as

Raffaele Zippo, Paul Nikolaus, and Giovanni Stea. Isospeed: Improving (min,+) Convolution by Exploiting (min,+)/(max,+) Isomorphism. In 35th Euromicro Conference on Real-Time Systems (ECRTS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 262, pp. 12:1-12:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{zippo_et_al:LIPIcs.ECRTS.2023.12,
  author =	{Zippo, Raffaele and Nikolaus, Paul and Stea, Giovanni},
  title =	{{Isospeed: Improving (min,+) Convolution by Exploiting (min,+)/(max,+) Isomorphism}},
  booktitle =	{35th Euromicro Conference on Real-Time Systems (ECRTS 2023)},
  pages =	{12:1--12:24},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-280-8},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{262},
  editor =	{Papadopoulos, Alessandro V.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2023.12},
  URN =		{urn:nbn:de:0030-drops-180415},
  doi =		{10.4230/LIPIcs.ECRTS.2023.12},
  annote =	{Keywords: Deterministic Network Calculus, min-plus algebra, max-plus algebra, performance, algorithms}
}
  • Refine by Type
  • 3 Document/PDF
  • 1 Document/HTML

  • Refine by Publication Year
  • 1 2025
  • 2 2023

  • Refine by Author
  • 2 Nikolaus, Paul
  • 2 Stea, Giovanni
  • 2 Zippo, Raffaele
  • 1 Cai, Guoray
  • 1 Hao, Yue

  • Refine by Series/Journal
  • 2 LIPIcs
  • 1 DARTS

  • Refine by Classification
  • 2 Computer systems organization → Real-time systems
  • 2 Mathematics of computing → Mathematical software performance
  • 2 Networks → Network performance analysis
  • 1 Computing methodologies → Artificial intelligence
  • 1 Information systems → Geographic information systems
  • Show More...

  • Refine by Keyword
  • 2 Deterministic Network Calculus
  • 2 algorithms
  • 2 max-plus algebra
  • 2 min-plus algebra
  • 2 performance
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact