TY - CONF AU - Borchmann, Daniel AU - Hanika, Tom A2 - Huchard, Marianne A2 - Kuznetsov, Sergei T1 - Some Experimental Results on Randomly Generating Formal Contexts. T2 - CLA PB - CEUR-WS.org CY - PY - 2016/ M2 - VL - 1624 IS - SP - 57 EP - 69 UR - http://dblp.uni-trier.de/db/conf/cla/cla2016.html#BorchmannH16 M3 - KW - L1 - SN - N1 - N1 - AB - ER - TY - GEN AU - Strobl, Martin A2 - T1 - On the issues with decentralized autonomous organizations JO - PB - AD - PY - 2016/ VL - IS - SP - EP - UR - http://martinstrobl.cz/papers/On%20the%20issues%20within%20the%20DAOs.pdf M3 - KW - L1 - N1 - N1 - AB - The 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. ER - TY - BOOK AU - A2 - Bala, Christian A2 - Müller, Klaus T1 - Abschied vom Otto Normalverbraucher moderne Verbraucherforschung: Leitbilder, Informationen, Konsum und Demokratie PB - Klartext-Verl. AD - Essen PY - 2015/ VL - IS - SP - EP - UR - http://www.worldcat.org/search?qt=worldcat_org_all&q=9783837509977 M3 - KW - L1 - SN - 3837509974 9783837509977 N1 - N1 - AB - ER - TY - GEN AU - Basler, Christoph A2 - T1 - Vergleich von Sortieralgorithmen JO - PB - AD - PY - 2014/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - ER - TY - GEN AU - Beer, Gerald A2 - T1 - Vergleich von Sortieralgorithmen JO - PB - AD - PY - 2014/06 VL - IS - SP - 1 EP - 13 UR - M3 - KW - L1 - N1 - N1 - AB - Es 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. ER - TY - GEN AU - Berndt, Maximilian A2 - Berndt, Maximilian T1 - Comparing Sorting Algorithms for Sorted and Unsorted Input JO - PB - AD - PY - 2014/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - ER - TY - JOUR AU - Heuser, Basler T1 - Bastian Heuser gelesen von Christoph Basler JO - PY - 2014/ VL - IS - SP - EP - UR - M3 - KW - L1 - SN - N1 - N1 - AB - ER - TY - GEN AU - Heuser, Bastian A2 - T1 - Sorting Algorithms - Comparison of Shell-, Merge- and Quicksort JO - PB - AD - PY - 2014/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - Our 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. ER - TY - GEN AU - Heuser, Bastian A2 - T1 - Sorting Algorithms - Comparison of Shell-, Merge- and Quicksort (2nd ed.) JO - PB - AD - PY - 2014/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - Our 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. ER - TY - GEN AU - Hruschka, Benedikt A2 - Hruschka, Benedikt T1 - Laufzeitvergleich von Vergleichsbasierten Sortieralgorithmen auf Sortieren und Unsortierten Datensätzen JO - PB - AD - PY - 2014/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - ER - TY - GEN AU - Bauer, Pascal A2 - T1 - Vergleich von Sortieralgorithmen JO - PB - AD - PY - 2013/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - ER - TY - GEN AU - Böttger, Sebastian A2 - T1 - Vergleich von Sortiertverfahren JO - PB - AD - PY - 2013/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - Gegenstand 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. ER - TY - GEN AU - Herwig, S A2 - T1 - Vergleiche von Sortieralgorithmen JO - PB - AD - PY - 2013/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - ER - TY - GEN AU - Iske, Andre A2 - T1 - Vergleich von Sortierverfahren JO - PB - AD - PY - 2013/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - In 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. ER - TY - THES AU - Lindner, Urs T1 - Marx und die Philosophie : wissenschaftlicher Realismus, ethischer Perfektionismus und kritische Sozialtheorie PY - 2013/ PB - SP - EP - UR - http://d-nb.info/1018402225/04 M3 - KW - L1 - N1 - N1 - AB - ER - TY - GEN AU - Löbig, Thorsten A2 - T1 - Analysis of asymptotically optimal comparison-based Sorting Algorithms JO - PB - AD - PY - 2013/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - ER - TY - GEN AU - Merz, Marcel A2 - T1 - Vergleich von Sortieralgorithmen JO - PB - AD - PY - 2013/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - ER - TY - GEN AU - Thiele, Mathias A2 - T1 - Laufzeitanalyse vergleichsbasierter Sortieralgorithmen JO - PB - AD - PY - 2013/ VL - IS - SP - EP - UR - M3 - KW - L1 - N1 - N1 - AB - ER - TY - CONF AU - Vig, Jesse AU - Sen, Shilad AU - Riedl, John A2 - T1 - Tagsplanations: explaining recommendations using tags T2 - IUI '09: Proceedings of the 13th International Conference on Intelligent User Interfaces PB - ACM CY - New York, NY, USA PY - 2009/ M2 - VL - IS - SP - 47 EP - 56 UR - http://portal.acm.org/citation.cfm?id=1502661 M3 - 10.1145/1502650.1502661 KW - L1 - SN - 978-1-60558-168-2 N1 - N1 - AB - While 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. ER - TY - CONF AU - Ames, Morgan AU - Naaman, Mor A2 - T1 - Why we tag: motivations for annotation in mobile and online media T2 - Proceedings of the SIGCHI conference on Human factors in computing systems PB - ACM CY - New York, NY, USA PY - 2007/ M2 - VL - IS - SP - 971 EP - 980 UR - http://doi.acm.org/10.1145/1240624.1240772 M3 - 10.1145/1240624.1240772 KW - L1 - SN - 978-1-59593-593-9 N1 - N1 - AB - Why 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.

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. ER -