@incollection{noKey,
  abstract = {The application of ubiquitous and social computational systems shows a rapidly increasing trend in our everyday environments: Enhancing social interactions and communication in both online and real-world settings is an important issue in a broad range of application contexts. This chapter describes the development of ubiquitous and social software for enhancing social networking. The Connect-U demonstrator features a class of such applications. In particular, it comprises the Conferator and MyGroup applications for enabling smarter social interactions in the context of conferences and working groups. We describe the applied socio-technical design process, and discuss experiences and lessons learned.},
  author = {Atzmueller, Martin and Behrenbruch, Kay and Hoffmann, Axel and Kibanov, Mark and Macek, Bjoern-Elmar and Scholz, Christoph and Skistims, Hendrik and Söllner, Matthias and Stumme, Gerd},
  booktitle = {Socio-technical Design of Ubiquitous Computing Systems},
  doi = {10.1007/978-3-319-05044-7_15},
  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan Marco and Roßnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},
  interhash = {324a07604f0e107ca3f147a4a12a171a},
  intrahash = {9708321a82ff6f1b2dd9e5509399f169},
  isbn = {978-3-319-05043-0},
  language = {English},
  pages = {261-275},
  publisher = {Springer International Publishing},
  title = {Connect-U: A System for Enhancing Social Networking},
  url = {http://dx.doi.org/10.1007/978-3-319-05044-7_15},
  year = 2014
}

@inproceedings{SIAS:14a,
  address = {New York, NY, USA},
  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proc. 25th ACM Conference on Hypertext and Social Media},
  interhash = {0d109dea7c2d5bab0fdd68d212fb88cd},
  intrahash = {9eae843cffe35355caf37658c8c391c5},
  optpages = {245-254},
  publisher = {ACM Press},
  title = {{On the Predictability of Talk Attendance at Academic Conferences}},
  year = 2014
}

@inbook{ABHKMSSSS:14,
  address = {Heidelberg, Germany},
  author = {Atzmueller, Martin and Behrenbruch, Kay and Hoffmann, Axel and Kibanov, Mark and Macek, Bjoern-Elmar and Scholz, Christoph and Skistims, Hendrik and Söllner, Matthias and Stumme, Gerd},
  chapter = {{Connect-U: A System for Enhancing Social Networking}},
  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan-Marco and Roßnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},
  interhash = {a3e215f96a328486628a4c9e3b5917b0},
  intrahash = {55fca5af1fe9313324d9ee570e57fbe2},
  publisher = {Springer Verlag},
  title = {{Socio-technical Design of Ubiquitous Computing Systems}},
  year = 2014
}

@inbook{SMADS:14,
  address = {Heidelberg, Germany},
  author = {Scholz, Christoph and Macek, Bjoern-Elmar and Atzmueller, Martin and Doerfel, Stephan and Stumme, Gerd},
  chapter = {{Mining Social Links for Ubiquitous Knowledge Engineering}},
  editor = {David, Klaus and Geihs, Kurt and Leimeister, Jan-Marco and Roßnagel, Alexander and Schmidt, Ludger and Stumme, Gerd and Wacker, Arno},
  interhash = {892e8ce5c72e6e47c51974cbdbcdcd71},
  intrahash = {1cd46cc57f2a578d26d512d17f2b04b2},
  publisher = {Springer Verlag},
  title = {{Socio-technical Design of Ubiquitous Computing Systems}},
  year = 2014
}

@article{MAHS:14,
  author = {Mitzlaff, Folke and Atzmueller, Martin and Hotho, Andreas and Stumme, Gerd},
  interhash = {61a66cc068526af6e6b2a3b629d72346},
  intrahash = {46f7a831481ba0761e10798be044f691},
  journal = {Journal of Social Network Analysis and Mining},
  number = 216,
  title = {{The Social Distributional Hypothesis}},
  volume = 4,
  year = 2014
}

@inproceedings{TAKS:14,
  address = {Wageningen, The Netherlands},
  author = {Thiele, Lisa and Atzmueller, Martin and Kauffeld, Simone and Stumme, Gerd},
  booktitle = {Proc. Measuring Behavior},
  interhash = {cbfc02b8d436fb395c0207677d9afe03},
  intrahash = {db2582a5ca1a0a91ac9378f8dfcb7d8d},
  title = {{Subjective versus Objective Captured Social Networks: Comparing Standard Self-Report Questionnaire Data with Observational RFID Technology Data}},
  year = 2014
}

@article{SAS:14c,
  author = {Scholz, Christoph and Atzmueller, Martin and Stumme, Gerd},
  interhash = {56c79f29ee5d2631ded291a39f7952db},
  intrahash = {b1d72d24278760d72fb0774543cfdb06},
  journal = {Journal of Social Network Analysis and Mining},
  number = 217,
  title = {{Predictability of Evolving Contacts and Triadic Closure in Human Face-to-Face Proximity Networks}},
  volume = 4,
  year = 2014
}

@inproceedings{SIAS:14b,
  address = {Aachen, Germany},
  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
  booktitle = {Proc. LWA 2014 (KDML Special Track)},
  interhash = {036eeb2c7b6ae2bab0be93301dd15abf},
  intrahash = {653db2c6705c15c8fd9afe0536982a62},
  publisher = {RTWH Aachen University},
  title = {{On the Predictability of Talk Attendance at Academic Conferences (Extended Abstract, Resubmission)}},
  year = 2014
}

@article{doerfel2014cores,
  author = {Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd},
  interhash = {3d526c314b8a04d7cbd06b5e48f1dfe8},
  intrahash = {2e56580361b37f1fe1501735ab05eafe},
  journal = {Transactions on Intelligent Systems and Technology},
  publisher = {ACM},
  title = {The Role of Cores in Recommender Benchmarking for Social Bookmarking Systems},
  year = 2014
}

@article{SIAS:14c,
  author = {Scholz, Christoph and Illig, Jens and Atzmueller, Martin and Stumme, Gerd},
  interhash = {6a81e1de99a936c7b641546e284af20f},
  intrahash = {3c8f0d99481312cf1543184948366b94},
  journal = {CoRR},
  opturl = {http://arxiv.org/abs/1407.0613},
  title = {{On the Predictability of Talk Attendance at Academic Conferences (Extended Version)}},
  volume = {abs/1407.0613},
  year = 2014
}

@inproceedings{ATSK:14,
  address = {London, UK},
  author = {Atzmueller, Martin and Thiele, Lisa and Stumme, Gerd and Kauffeld, Simone},
  booktitle = {Proceedings of the 2014 International Smart University Workshop (SmartU 2014), London, UK},
  interhash = {02bf7855560ff6708ea11e8c320d90dc},
  intrahash = {35b065d3afc739bc42118a3b85ea57d0},
  optpages = {1--12},
  title = {{Evolution and Dynamics of Student Interaction on Networks of Face-to-Face Proximity}},
  year = 2014
}

@article{PhysRevE.90.032804,
  author = {Ke, Qing and Ahn, Yong-Yeol},
  doi = {10.1103/PhysRevE.90.032804},
  interhash = {b6567439f34586ac3aec90b5065db043},
  intrahash = {2a8d6bfbb99517ce9dbcf120d4e2135e},
  journal = {Phys. Rev. E},
  month = sep,
  number = 3,
  numpages = {7},
  pages = 032804,
  publisher = {American Physical Society},
  title = {Tie strength distribution in scientific collaboration networks},
  url = {http://link.aps.org/doi/10.1103/PhysRevE.90.032804},
  volume = 90,
  year = 2014
}

@book{nbling2012namen,
  address = {Tübingen},
  author = {Nübling, Damaris and Fahlbusch, Fabian and Heuser, Rita},
  interhash = {750cccff95abefaa27424acc5c348ab8},
  intrahash = {b4f0e65ae85fc6e2d36aefd5ef3ef7e9},
  isbn = {9783823366850 3823366858},
  publisher = {Narr},
  refid = {789771672},
  title = {Namen : Eine Einführung in die linguistische Onomastik},
  url = {http://www.amazon.de/Namen-Eine-Einf%C3%BChrung-die-Onomastik/dp/3823366858/ref=pd_sim_b_1?ie=UTF8&refRID=1C6A2MX31P9A2VM9HG76},
  year = 2012
}

@misc{clauset2007powerlaw,
  abstract = {Power-law distributions occur in many situations of scientific interest and
have significant consequences for our understanding of natural and man-made
phenomena. Unfortunately, the detection and characterization of power laws is
complicated by the large fluctuations that occur in the tail of the
distribution -- the part of the distribution representing large but rare events
-- and by the difficulty of identifying the range over which power-law behavior
holds. Commonly used methods for analyzing power-law data, such as
least-squares fitting, can produce substantially inaccurate estimates of
parameters for power-law distributions, and even in cases where such methods
return accurate answers they are still unsatisfactory because they give no
indication of whether the data obey a power law at all. Here we present a
principled statistical framework for discerning and quantifying power-law
behavior in empirical data. Our approach combines maximum-likelihood fitting
methods with goodness-of-fit tests based on the Kolmogorov-Smirnov statistic
and likelihood ratios. We evaluate the effectiveness of the approach with tests
on synthetic data and give critical comparisons to previous approaches. We also
apply the proposed methods to twenty-four real-world data sets from a range of
different disciplines, each of which has been conjectured to follow a power-law
distribution. In some cases we find these conjectures to be consistent with the
data while in others the power law is ruled out.},
  author = {Clauset, Aaron and Shalizi, Cosma Rohilla and Newman, M. E. J.},
  doi = {10.1137/070710111},
  interhash = {2e3bc5bbd7449589e8bfb580e8936d4b},
  intrahash = {7da1624e601898dd74df839ce2daeb24},
  note = {cite arxiv:0706.1062Comment: 43 pages, 11 figures, 7 tables, 4 appendices; code available at  http://www.santafe.edu/~aaronc/powerlaws/},
  title = {Power-law distributions in empirical data},
  url = {http://arxiv.org/abs/0706.1062},
  year = 2007
}

@book{imhof1997kassel,
  address = {Petersberg},
  author = {Imhof, Michael},
  interhash = {de66d716b992246867a2b172b1986f47},
  intrahash = {13c55b9ef55e43c9885f0b01e5605032},
  isbn = {3932526074 9783932526077},
  publisher = {Imhof},
  refid = {43830809},
  title = {Kassel : Stadtführer},
  url = {http://www.amazon.de/Kassel-Stadtf%C3%BChrer-Michael-Imhof/dp/3932526074/ref=sr_1_1?s=books&ie=UTF8&qid=1435743690&sr=1-1&keywords=kassel},
  year = 1997
}

@article{Nutanong:2011:IHD:2002974.2002978,
  abstract = {The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at least one point in Y. Formally, the Hausdorff distance HausDist(X, Y) can be computed as the Max-Min distance from X to Y, i.e., find the maximum of the distance from an element in X to its nearest neighbor (NN) in Y. Although this is similar to the closest pair and farthest pair problems, computing the Hausdorff distance is a more challenging problem since its Max-Min nature involves both maximization and minimization rather than just one or the other. A traditional approach to computing HausDist(X, Y) performs a linear scan over X and utilizes an index to help compute the NN in Y for each x in X. We present a pair of basic solutions that avoid scanning X by applying the concept of aggregate NN search to searching for the element in X that yields the Hausdorff distance. In addition, we propose a novel method which incrementally explores the indexes of the two sets X and Y simultaneously. As an example application of our techniques, we use the Hausdorff distance as a measure of similarity between two trajectories (represented as point sets). We also use this example application to compare the performance of our proposed method with the traditional approach and the basic solutions. Experimental results show that our proposed method outperforms all competitors by one order of magnitude in terms of the tree traversal cost and total response time.},
  acmid = {2002978},
  author = {Nutanong, Sarana and Jacox, Edwin H. and Samet, Hanan},
  doi = {10.14778/2002974.2002978},
  interhash = {431cfc6757195ff943dc064d42e3dc57},
  intrahash = {065b9da64ffb2abff443d8d9ff24abb2},
  issn = {2150-8097},
  issue_date = {May 2011},
  journal = {Proc. VLDB Endow.},
  month = may,
  number = 8,
  numpages = {12},
  pages = {506--517},
  publisher = {VLDB Endowment},
  title = {An Incremental Hausdorff Distance Calculation Algorithm},
  url = {http://dx.doi.org/10.14778/2002974.2002978},
  volume = 4,
  year = 2011
}

@inproceedings{4587819,
  abstract = {We present a statistical learning approach for finding recreational trails in aerial images. While the problem of recognizing relatively straight and well defined roadways in digital images has been well studied in the literature, the more difficult problem of extracting trails has received no attention. However, trails and rough roads are less likely to be adequately mapped, and change more rapidly over time. Automated tools for finding trails will be useful to cartographers, recreational users and governments. In addition, the methods developed here are applicable to the more general problem of finding linear structure. Our approach combines local estimates for image pixel trail probabilities with the global constraint that such pixels must link together to form a path. For the local part, we present results using three classification techniques. To construct a global solution (a trail) from these probabilities, we propose a global cost function that includes both global probability and path length. We show that the addition of a length term significantly improves trail finding ability. However, computing the optimal trail becomes intractable as known dynamic programming methods do not apply. Thus we describe a new splitting heuristic based on Dijkstra's algorithm. We then further improve upon the results with a trail sampling scheme. We test our approach on 500 challenging images along the 2500 mile continental divide mountain bike trail, where assumptions prevalent in the road literature are violated.},
  author = {Morris, S. and Barnard, K.},
  booktitle = {Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on},
  doi = {10.1109/CVPR.2008.4587819},
  interhash = {4886e90202778766c8832765ff291e44},
  intrahash = {bcec19c981718168825ca203b6935204},
  issn = {1063-6919},
  month = {June},
  pages = {1-8},
  title = {Finding trails},
  url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=4587819},
  year = 2008
}

@book{bertin1982graphische,
  address = {Berlin [u.a.]},
  author = {Bertin, Jacques},
  editor = {Scharfe, Wolfgang},
  format = {book},
  interhash = {56d32ca92eb46979a4c431cbec5c7f77},
  intrahash = {94690148e35427e798ee0a7a29b282ce},
  isbn = {3110069008},
  partauthors = {<div class="authornolink">Scharfe, Wolfgang</div><a class="link authorlink" href="https://hds.hebis.de/ubks/Author/Home?author=Scharfe%2C+Wolfgang">Scharfe, Wolfgang</a> (Bearb.)},
  primaryauthor = {Bertin, Jacques},
  publisher = {de Gruyter},
  shorttitle = {Graphische Darstellungen und die graphische Weiterverarbeitung der Information},
  subtitle = {Jacques Bertin. Übers. u. bearb. von Wolfgang Scharfe},
  title = {Graphische Darstellungen und die graphische Weiterverarbeitung der Information},
  titlestatement = {Jacques Bertin. Übers. u. bearb. von Wolfgang Scharfe},
  uniqueid = {HEB034827080},
  url = {http://scans.hebis.de/HEBCGI/show.pl?03482708_toc.pdf},
  year = 1982
}

@book{bertin1974graphische,
  address = {Berlin [u.a.]},
  author = {Bertin, Jacques},
  editor = {Jensch, Georg},
  format = {book},
  interhash = {90ae920b0fee7923b0cd706518810d3c},
  intrahash = {5f010e60591984ca2ea25d5a3e74de0b},
  isbn = {3110036606},
  partauthors = {<div class="authornolink">Jensch, Georg</div><a class="link authorlink" href="https://hds.hebis.de/ubks/Author/Home?author=Jensch%2C+Georg">Jensch, Georg</a> (Bearb.)},
  primaryauthor = {Bertin, Jacques},
  publisher = {de Gruyter},
  shortsubtitle = {: Diagramme, Netze, Karten},
  shorttitle = {Graphische Semiologie : Diagramme, Netze, Karten},
  subtitle = {Diagramme, Netze, Karten / Jacques Bertin. Übers. u. bearb. nach d. 2. franz. Aufl. von Georg Jensch ...},
  title = {Graphische Semiologie : Diagramme, Netze, Karten},
  titlestatement = {Jacques Bertin. Übers. u. bearb. nach d. 2. franz. Aufl. von Georg Jensch ...},
  uniqueid = {HEB034827188},
  url = {http://scans.hebis.de/HEBCGI/show.pl?03482718_toc.pdf},
  year = 1974
}

@electronic{stuckenschmidt2009modular,
  abstract = {<p>This book constitutes a collection of research achievements mature enough to provide a firm and reliable basis on modular ontologies. It discusses the recent concepts, theories and techniques for knowledge modularization.</p> Summary hebis},
  address = {Berlin, Heidelberg},
  edition = {1st ed. 2009},
  editor = {Stuckenschmidt, Heiner and Parent, Christine and Spaccapietra, Stefano},
  format = {ebook},
  interhash = {abaa570522edef36c2903af8e99c8423},
  intrahash = {2c6ceaad4f961cb093c4dd40d414540d},
  isbn = {9783642019074},
  partauthors = {<div class="authornolink">Stuckenschmidt, Heiner</div><a class="link authorlink" href="https://hds.hebis.de/ubks/Author/Home?author=Stuckenschmidt%2C+Heiner">Stuckenschmidt, Heiner</a>  (Herausgeber) <div class="authornolink">Parent, Christine</div><a class="link authorlink" href="https://hds.hebis.de/ubks/Author/Home?author=Parent%2C+Christine">Parent, Christine</a>  (Herausgeber) <div class="authornolink">Spaccapietra, Stefano</div><a class="link authorlink" href="https://hds.hebis.de/ubks/Author/Home?author=Spaccapietra%2C+Stefano">Spaccapietra, Stefano</a>  (Herausgeber)},
  publisher = {Springer Berlin Heidelberg},
  series = {Theoretical Computer Science and General Issues},
  shortsubtitle = {: Concepts, Theories and Techniques for Knowledge Modularization},
  shorttitle = {Modular Ontologies : Concepts, Theories and Techniques for Knowledge Modularization},
  subtitle = {Concepts, Theories and Techniques for Knowledge Modularization / edited by Heiner Stuckenschmidt, Christine Parent, Stefano Spaccapietra},
  title = {Modular Ontologies : Concepts, Theories and Techniques for Knowledge Modularization},
  titlestatement = {edited by Heiner Stuckenschmidt, Christine Parent, Stefano Spaccapietra},
  uniqueid = {HEB213395150},
  url = {https://doi.org/10.1007/978-3-642-01907-4},
  year = 2009
}