3 Search Results for "Frank, Andrew U."

Document
DOI: 10.4230/OASIcs.ICCSW.2012.116
A Quantitative Study of Social Organisation in Open Source Software Communities

Authors: Marcelo Serrano Zanetti, Emre Sarigöl, Ingo Scholtes, Claudio Juan Tessone, and Frank Schweitzer

Published in: OASIcs, Volume 28, 2012 Imperial College Computing Student Workshop

Abstract
The success of open source projects crucially depends on the voluntary contributions of a sufficiently large community of users. Apart from the mere size of the community, interesting questions arise when looking at the evolution of structural features of collaborations between community members. In this article, we discuss several network analytic proxies that can be used to quantify different aspects of the social organisation in social collaboration networks. We particularly focus on measures that can be related to the cohesiveness of the communities, the distribution of responsibilities and the resilience against turnover of community members. We present a comparative analysis on a large-scale dataset that covers the full history of collaborations between users of $14$ major open source software communities. Our analysis covers both aggregate and time-evolving measures and highlights differences in the social organisation across communities. We argue that our results are a promising step towards the definition of suitable, potentially multi-dimensional, resilience and risk indicators for open source software communities.
Cite as

Marcelo Serrano Zanetti, Emre Sarigöl, Ingo Scholtes, Claudio Juan Tessone, and Frank Schweitzer. A Quantitative Study of Social Organisation in Open Source Software Communities. In 2012 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 28, pp. 116-122, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{serranozanetti_et_al:OASIcs.ICCSW.2012.116,
  author =	{Serrano Zanetti, Marcelo and Sarig\"{o}l, Emre and Scholtes, Ingo and Tessone, Claudio Juan and Schweitzer, Frank},
  title =	{{A Quantitative Study of Social Organisation in Open Source Software Communities}},
  booktitle =	{2012 Imperial College Computing Student Workshop},
  pages =	{116--122},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-48-4},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{28},
  editor =	{Jones, Andrew V.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2012.116},
  URN =		{urn:nbn:de:0030-drops-37748},
  doi =		{10.4230/OASIcs.ICCSW.2012.116},
  annote =	{Keywords: open source software, mining software repositories, social networks}
}
Document
DOI: 10.4230/DagSemProc.09161.7
Why Is Cartographic Generalization So Hard?

Authors: Andrew U. Frank

Published in: Dagstuhl Seminar Proceedings, Volume 9161, Generalization of spatial information (2009)

Abstract
I remember first presentations about cartographic generalizations (Spiess 1971), where tools for generalization were shown, but the conclusions stated, more or less clearly, that fully automated cartographic generalization was not possible. There has been an impressive stream of research documenting methods to generalize maps. The consensus today seems to be that automated tools under control of a cartographer are the most effective means (Buttenfield et al. 1991; Weibel 1995). In this contribution some fundamental aspects of map making, including generalizations are analyzed. Map generalization is studied by most map producers, especially the National Mapping Agencies, because they have to maintain maps at different scale and it appears economical to derive a map at smaller from a map of a larger scale by an automated process. Equally important is the production of maps at arbitrary scales for the illustration of web pages. These tasks are the backdrop for the following abstract analysis.
Cite as

Andrew U. Frank. Why Is Cartographic Generalization So Hard?. In Generalization of spatial information. Dagstuhl Seminar Proceedings, Volume 9161, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{frank:DagSemProc.09161.7,
  author =	{Frank, Andrew U.},
  title =	{{Why Is Cartographic Generalization So Hard?}},
  booktitle =	{Generalization of spatial information},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9161},
  editor =	{S\'{e}bastien Musti\`{e}re and Monika Sester and Frank van Harmelen and Peter van Oosterom},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09161.7},
  URN =		{urn:nbn:de:0030-drops-21363},
  doi =		{10.4230/DagSemProc.09161.7},
  annote =	{Keywords: Cartographic Generalization, AI-Hard, NP-Hard}
}
Document
DOI: 10.4230/DagSemProc.05151.9
Temporal information extraction from legal documents

Authors: Frank Schilder and Andrew McCulloh

Published in: Dagstuhl Seminar Proceedings, Volume 5151, Annotating, Extracting and Reasoning about Time and Events (2005)

Abstract
The aim of this paper is to analyze what kinds of temporal information can be found in different types of legal documents. In particular, it provides a comparison of different legal document types (case law, statute or transactional document) andit discusses how one can do further reasoning with the extracted temporal information.
Cite as

Frank Schilder and Andrew McCulloh. Temporal information extraction from legal documents. In Annotating, Extracting and Reasoning about Time and Events. Dagstuhl Seminar Proceedings, Volume 5151, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{schilder_et_al:DagSemProc.05151.9,
  author =	{Schilder, Frank and McCulloh, Andrew},
  title =	{{Temporal information extraction from legal documents}},
  booktitle =	{Annotating, Extracting and Reasoning about Time and Events},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5151},
  editor =	{Graham Katz and James Pustejovsky and Frank Schilder},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05151.9},
  URN =		{urn:nbn:de:0030-drops-3139},
  doi =		{10.4230/DagSemProc.05151.9},
  annote =	{Keywords: Extraction of temporal information, temporal reasoning, legal documents}
}
  • Refine by Author
  • 1 Frank, Andrew U.
  • 1 McCulloh, Andrew
  • 1 Sarigöl, Emre
  • 1 Schilder, Frank
  • 1 Scholtes, Ingo
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 1 AI-Hard
  • 1 Cartographic Generalization
  • 1 Extraction of temporal information
  • 1 NP-Hard
  • 1 legal documents
  • Show More...

  • Refine by Type
  • 3 document

  • Refine by Publication Year
  • 1 2005
  • 1 2009
  • 1 2012

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

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