PUMA publications for /discussedhttps://puma.uni-kassel.de/discussedPUMA RSS feed for /discussed2024-03-19T06:04:31+01:00On the issues with decentralized autonomous organizationshttps://puma.uni-kassel.de/bibtex/29b49978ee41f86905ea60c888e0947da/2018-06-19T11:33:00+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Martin Strobl" itemprop="url" href="/author/Martin%20Strobl"><span itemprop="name">M. Strobl</span></a></span>. </span>(<em><span>2016<meta content="2016" itemprop="datePublished"/></span></em>)Tue Jun 19 11:33:00 CEST 2018On the issues with decentralized autonomous organizations2016The recent launch of the Ethereum blockchain platform has triggered the interest in the decentralized
autonomous organizations (DAOs). DAOs aim to become businesses residing on the blockchain, investing
their funds obtained through initial token offerings. These tokens entitle the owner to vote on investment
and management decisions of the DAO and to obtain eventual dividend. In this paper, I discuss
several issues that stem from the organizational design of the DAO, that can potentially lead to DAO’s
organizational and functional breakdown. While some originate in the voting mechanism itself, other
emerge through the misalignment of interest between the DAO and the project or service provider. I also
discuss the impact on the token price and a bit of a legal perspective on the matter.Some Experimental Results on Randomly Generating Formal Contexts.https://puma.uni-kassel.de/bibtex/28af414e45f306527e8316ac681fe7f08/2016-08-02T18:25:00+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Daniel Borchmann" itemprop="url" href="/author/Daniel%20Borchmann"><span itemprop="name">D. Borchmann</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Tom Hanika" itemprop="url" href="/author/Tom%20Hanika"><span itemprop="name">T. Hanika</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">CLA</span>, </em></span><em>Volume 1624 von CEUR Workshop Proceedings, </em><em>Seite <span itemprop="pagination">57-69</span>. </em><em><span itemprop="publisher">CEUR-WS.org</span>, </em>(<em><span>2016<meta content="2016" itemprop="datePublished"/></span></em>)Tue Aug 02 18:25:00 CEST 2016CLAconf/cla/201657-69CEUR Workshop ProceedingsSome Experimental Results on Randomly Generating Formal Contexts.16242016Abschied vom Otto Normalverbraucher moderne Verbraucherforschung: Leitbilder, Informationen, Konsum und Demokratiehttps://puma.uni-kassel.de/bibtex/24d7a57e5baf9566f11add583b07a59ec/2016-02-24T11:14:12+01:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="editor"><a title="Christian Bala" itemprop="url" href="/author/Christian%20Bala"><span itemprop="name">C. Bala</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="editor"><a title="Klaus Müller" itemprop="url" href="/author/Klaus%20M%c3%bcller"><span itemprop="name">K. Müller</span></a></span> (Hrsg.).
. </span><em><span itemprop="publisher">Klartext-Verl.</span>, </em><em>Essen, </em>(<em><span>2015<meta content="2015" itemprop="datePublished"/></span></em>)Wed Feb 24 11:14:12 CET 2016EssenAbschied vom Otto Normalverbraucher moderne Verbraucherforschung: Leitbilder, Informationen, Konsum und Demokratie2015Tagsplanations: explaining recommendations using tagshttps://puma.uni-kassel.de/bibtex/2ed47adb106d45bb3ac20dd78c603532e/2015-01-08T14:17:04+01:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Jesse Vig" itemprop="url" href="/author/Jesse%20Vig"><span itemprop="name">J. Vig</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Shilad Sen" itemprop="url" href="/author/Shilad%20Sen"><span itemprop="name">S. Sen</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="John Riedl" itemprop="url" href="/author/John%20Riedl"><span itemprop="name">J. Riedl</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">IUI '09: Proceedings of the 13th International Conference on Intelligent User Interfaces</span>, </em></span><em>Seite <span itemprop="pagination">47--56</span>. </em><em>New York, NY, USA, </em><em><span itemprop="publisher">ACM</span>, </em>(<em><span>2009<meta content="2009" itemprop="datePublished"/></span></em>)Thu Jan 08 14:17:04 CET 2015New York, NY, USAIUI '09: Proceedings of the 13th International Conference on Intelligent User Interfaces47--56Tagsplanations: explaining recommendations using tags2009While recommender systems tell users what items they might like, explanations of recommendations reveal why they might like them. Explanations provide many benefits, from improving user satisfaction to helping users make better decisions. This paper introduces tagsplanations, which are explanations based on community tags. Tagsplanations have two key components: tag relevance, the degree to which a tag describes an item, and tag preference, the user's sentiment toward a tag. We develop novel algorithms for estimating tag relevance and tag preference, and we conduct a user study exploring the roles of tag relevance and tag preference in promoting effective tagsplanations. We also examine which types of tags are most useful for tagsplanations.Why we tag: motivations for annotation in mobile and online mediahttps://puma.uni-kassel.de/bibtex/2bc08f76536610f3f376bece5f0b46ad5/2014-12-16T15:53:52+01:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Morgan Ames" itemprop="url" href="/author/Morgan%20Ames"><span itemprop="name">M. Ames</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Mor Naaman" itemprop="url" href="/author/Mor%20Naaman"><span itemprop="name">M. Naaman</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Proceedings of the SIGCHI conference on Human factors in computing systems</span>, </em></span><em>Seite <span itemprop="pagination">971--980</span>. </em><em>New York, NY, USA, </em><em><span itemprop="publisher">ACM</span>, </em>(<em><span>2007<meta content="2007" itemprop="datePublished"/></span></em>)Tue Dec 16 15:53:52 CET 2014New York, NY, USAProceedings of the SIGCHI conference on Human factors in computing systems971--980CHI '07Why we tag: motivations for annotation in mobile and online media2007Why do people tag? Users have mostly avoided annotating media such as photos -- both in desktop and mobile environments -- despite the many potential uses for annotations, including recall and retrieval. We investigate the incentives for annotation in Flickr, a popular web-based photo-sharing system, and ZoneTag, a cameraphone photo capture and annotation tool that uploads images to Flickr. In Flickr, annotation (as textual tags) serves both personal and social purposes, increasing incentives for tagging and resulting in a relatively high number of annotations. ZoneTag, in turn, makes it easier to tag cameraphone photos that are uploaded to Flickr by allowing annotation and suggesting relevant tags immediately after capture.</p> <p>A qualitative study of ZoneTag/Flickr users exposed various tagging patterns and emerging motivations for photo annotation. We offer a taxonomy of motivations for annotation in this system along two dimensions (sociality and function), and explore the various factors that people consider when tagging their photos. Our findings suggest implications for the design of digital photo organization and sharing applications, as well as other applications that incorporate user-based annotation.Sorting Algorithms - Comparison of Shell-, Merge- and Quicksort (2nd ed.)https://puma.uni-kassel.de/bibtex/2db02cebc086de0c136a600acb0acca50/2014-07-18T09:10:44+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Bastian Heuser" itemprop="url" href="/author/Bastian%20Heuser"><span itemprop="name">B. Heuser</span></a></span>. </span>(<em><span>2014<meta content="2014" itemprop="datePublished"/></span></em>)Fri Jul 18 09:10:44 CEST 201412Sorting Algorithms - Comparison of Shell-, Merge- and Quicksort (2nd ed.)2014Our amounts of data are growing rapidly, but we need to keep them in order. Resultingly one frequent issue is sorting this data. There are many sorting algorithms out there, which differ in their functionallity, stability, performance and space complexity. In this paper you will get to know three methods named Shell-, Merge- and Quicksort. Their special characteristics are explained and which to use when.Marx und die Philosophie : wissenschaftlicher Realismus, ethischer Perfektionismus und kritische Sozialtheoriehttps://puma.uni-kassel.de/bibtex/273b1d2dbe2403847af54c902f58724e6/2014-07-15T15:35:20+02:00<meta content="thesis" itemprop="educationalUse"/><span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Urs Lindner" itemprop="url" href="/author/Urs%20Lindner"><span itemprop="name">U. Lindner</span></a></span>. </span><em>Stuttgart, </em>(<em><span>2013<meta content="2013" itemprop="datePublished"/></span></em>)<em>Zugl.: Berlin, Freie Univ., Diss., 2010.</em>Tue Jul 15 15:35:20 CEST 2014Stuttgart1. Aufl.Zugl.: Berlin, Freie Univ., Diss., 2010Marx und die Philosophie : wissenschaftlicher Realismus, ethischer Perfektionismus und kritische Sozialtheorie2013Bastian Heuser gelesen von Christoph Baslerhttps://puma.uni-kassel.de/bibtex/21d3dda9131be1b081abb1143ea00c131/2014-07-15T15:31:40+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Basler Heuser" itemprop="url" href="/author/Basler%20Heuser"><span itemprop="name">B. Heuser</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"> </span>(<em><span>2014<meta content="2014" itemprop="datePublished"/></span></em>)Tue Jul 15 15:31:40 CEST 2014Bastian Heuser gelesen von Christoph Basler2014Laufzeitvergleich von Vergleichsbasierten Sortieralgorithmen auf Sortieren und Unsortierten Datensätzenhttps://puma.uni-kassel.de/bibtex/2d073268c29889e8b183ba8147ce706a8/2014-06-30T10:20:45+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Benedikt Hruschka" itemprop="url" href="/author/Benedikt%20Hruschka"><span itemprop="name">B. Hruschka</span></a></span>. </span>(<em><span>2014<meta content="2014" itemprop="datePublished"/></span></em>)Mon Jun 30 10:20:45 CEST 2014Laufzeitvergleich von Vergleichsbasierten Sortieralgorithmen auf Sortieren und Unsortierten Datensätzen2014Vergleich von Sortieralgorithmenhttps://puma.uni-kassel.de/bibtex/21672576bd8ea59eed89c3e6e57381a05/2014-07-01T21:04:52+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Gerald Beer" itemprop="url" href="/author/Gerald%20Beer"><span itemprop="name">G. Beer</span></a></span>. </span>(<em><span>22.06.2014<meta content="22.06.2014" itemprop="datePublished"/></span></em>)Tue Jul 01 21:04:52 CEST 2014061 -13Vergleich von SortieralgorithmenSeminar201422Es gibt viele verschiedene Sortieralgorithmen, die
alle unterschiedliche Laufzeiten und unterschiedlichen Speicherplatz benotigen.
Fur diese Arbeit wurden die drei Sortieralgorithmen InsertionSort, BubbleSort
und Quicksort ausgesucht, um sie auf Laufzeit und Speicherplatz
miteinander zu vergleichen. Auf den nachsten Seiten folgt ein kleiner
Uberblick uber Sortieralgorithmen im Allgemeinen. Danach werden
die drei Sortierverfahren vorgestellt und durch Experimente miteinander
verglichen. Als Ergebnis bleibt festzuhalten, dass InsertionSort und
BubbleSort bei (fast) sortierten Folgen eine bessere Laufzeit als QuickSort besitzen. Ansonsten erweist sich aber QuickSort als das schnellste
Sortierverfahren.Vergleich von Sortieralgorithmenhttps://puma.uni-kassel.de/bibtex/2e6bda3c45a3f32f92f41f2aac99cc739/2014-07-01T23:53:03+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Christoph Basler" itemprop="url" href="/author/Christoph%20Basler"><span itemprop="name">C. Basler</span></a></span>. </span>(<em><span>2014<meta content="2014" itemprop="datePublished"/></span></em>)Tue Jul 01 23:53:03 CEST 2014Vergleich von Sortieralgorithmen2014Sorting Algorithms - Comparison of Shell-, Merge- and Quicksorthttps://puma.uni-kassel.de/bibtex/25afc2968e62d28a1a318c77e9f4f8d22/2014-07-01T14:21:21+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Bastian Heuser" itemprop="url" href="/author/Bastian%20Heuser"><span itemprop="name">B. Heuser</span></a></span>. </span>(<em><span>2014<meta content="2014" itemprop="datePublished"/></span></em>)Tue Jul 01 14:21:21 CEST 201412Sorting Algorithms - Comparison of Shell-, Merge- and Quicksort2014Our amounts of data are growing rapidly, but we need to keep them in order. Resultingly one frequent issue is sorting this data. There are many sorting algorithms out there, which differ in their functionallity, stability, performance and space complexity. In this paper you will get to know three methods named Shell-, Merge- and Quicksort. Their special characteristics are explained and which to use when.Comparing Sorting Algorithms for Sorted and Unsorted Inputhttps://puma.uni-kassel.de/bibtex/24b8ad5987d785ece31ceb7baef18ac6d/2014-06-30T14:57:28+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Maximilian Berndt" itemprop="url" href="/author/Maximilian%20Berndt"><span itemprop="name">M. Berndt</span></a></span>. </span>(<em><span>2014<meta content="2014" itemprop="datePublished"/></span></em>)Mon Jun 30 14:57:28 CEST 2014Comparing Sorting Algorithms for Sorted and Unsorted Input2014Vergleich von Sortiertverfahrenhttps://puma.uni-kassel.de/bibtex/213fe0c4bf045dfad24b8e206e4f10b2c/2013-06-24T17:22:24+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sebastian Böttger" itemprop="url" href="/author/Sebastian%20B%c3%b6ttger"><span itemprop="name">S. Böttger</span></a></span>. </span>(<em><span>2013<meta content="2013" itemprop="datePublished"/></span></em>)Mon Jun 24 17:22:24 CEST 2013Vergleich von Sortiertverfahren2013Gegenstand dieser Arbeit ist der Vergleich der Sortierverfahren Radixsort,
Mergesort und Quicksort. Alle drei Algorithmen werden zunächst ausführlich
vorgestellt und ihre Funktionsweise erläutert. Dabei wird die Komplexität
und das resultierende Laufzeitverhalten theoretisch betrachtet und
die daraus entstehenden Vor- und Nachteile diskutiert. In einem Versuch
werden zudem alle drei Algorithmen unter realen Bedingungen auf einem
Computer getestet, um die theoretischen Betrachtungen zu untermauern.Vergleiche von Sortieralgorithmenhttps://puma.uni-kassel.de/bibtex/272020200333e343caf047c087b39fb3f/2013-06-24T14:08:13+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="S Herwig" itemprop="url" href="/author/S%20Herwig"><span itemprop="name">S. Herwig</span></a></span>. </span>(<em><span>2013<meta content="2013" itemprop="datePublished"/></span></em>)Mon Jun 24 14:08:13 CEST 2013Vergleiche von Sortieralgorithmen2013Analysis of asymptotically optimal comparison-based Sorting Algorithmshttps://puma.uni-kassel.de/bibtex/24fe8fa2b5700d2119f8e6ef3183f55df/2013-06-25T19:07:41+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Thorsten Löbig" itemprop="url" href="/author/Thorsten%20L%c3%b6big"><span itemprop="name">T. Löbig</span></a></span>. </span>(<em><span>2013<meta content="2013" itemprop="datePublished"/></span></em>)Tue Jun 25 19:07:41 CEST 2013Analysis of asymptotically optimal comparison-based Sorting Algorithms2013Vergleich von Sortieralgorithmenhttps://puma.uni-kassel.de/bibtex/27048deab881c40433b51374c9606a82e/2013-06-25T22:56:19+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Pascal Bauer" itemprop="url" href="/author/Pascal%20Bauer"><span itemprop="name">P. Bauer</span></a></span>. </span>(<em><span>2013<meta content="2013" itemprop="datePublished"/></span></em>)Tue Jun 25 22:56:19 CEST 2013Vergleich von Sortieralgorithmen2013Vergleich von Sortierverfahrenhttps://puma.uni-kassel.de/bibtex/23e1119ff7a8b6b7554919b72d5168637/2013-06-25T13:48:42+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Andre Iske" itemprop="url" href="/author/Andre%20Iske"><span itemprop="name">A. Iske</span></a></span>. </span>(<em><span>2013<meta content="2013" itemprop="datePublished"/></span></em>)Tue Jun 25 13:48:42 CEST 2013iske2013vergleichVergleich von Sortierverfahren2013In dieser Arbeit werden die drei vergleichsbasierten
Sortierverfahren BubbleSort, InsertionSort und QuickSort hinsichtlich
ihrer Laufzeit miteinander verglichen. Die Verfahren werden zunachst
vorgestellt und ihre Funktionsweise erklart. Anschlieend werden mittels
eines Java-Frameworks die Vergleichs- und Tauschoperationen fur
verschiedene Problemgroen experimentell ermittelt und analysiert.Laufzeitanalyse vergleichsbasierter Sortieralgorithmenhttps://puma.uni-kassel.de/bibtex/2ddad8d2bd5597e1ff07f7cf74536650b/2013-06-25T20:55:08+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Mathias Thiele" itemprop="url" href="/author/Mathias%20Thiele"><span itemprop="name">M. Thiele</span></a></span>. </span>(<em><span>2013<meta content="2013" itemprop="datePublished"/></span></em>)Tue Jun 25 20:55:08 CEST 2013Laufzeitanalyse vergleichsbasierter Sortieralgorithmen2013Vergleich von Sortieralgorithmenhttps://puma.uni-kassel.de/bibtex/244a73aa55d15cc950cf2539da99d6d8e/2013-06-24T11:18:51+02:00<span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marcel Merz" itemprop="url" href="/author/Marcel%20Merz"><span itemprop="name">M. Merz</span></a></span>. </span>(<em><span>2013<meta content="2013" itemprop="datePublished"/></span></em>)Mon Jun 24 11:18:51 CEST 2013Vergleich von Sortieralgorithmen2013