106,559 research outputs found
Maker-Breaker games on random geometric graphs
No full textIn a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if, after all edges have been claimed, the graph induced by his edges has some desired property. We consider four Maker-Breaker games played on random geometric graphs. For each of our four games we show that if we add edges between n points chosen uniformly at random in the unit square by order of increasing edge-length then, with probability tending to one as n ∞, the graph becomes Maker-win the very moment it satisfies a simple necessary condition. In particular, with high probability, Maker wins the connectivity game as soon as the minimum degree is at least two; Maker wins the Hamilton cycle game as soon as the minimum degree is at least four; Maker wins the perfect matching game as soon as the minimum degree is at least two and every edge has at least three neighbouring vertices; and Maker wins the H-game as soon as there is a subgraph from a finite list of “minimal graphs.” These results also allow us to give precise expressions for the limiting probability that G(n, r) is Maker-win in each case, where G(n, r) is the graph on n points chosen uniformly at random on the unit square with an edge between two points if and only if their distance is at most r.</p
Author Diane Glancy discusses her first movie project and reads from a journal she is keeping about her experiences as a novice movie maker
No full textNoted author Diane Glancy discusses her first movie project and reads from a journal she is keeping about her experiences as a novice movie maker. After showing a clip from the still unfinished movie (not included here), she takes questions from the audience. Introduced by MSU Anthropology Professor Susan Applegate Krouse. Part of the Michigan State University Libraries' Michigan Writers Series
Maker-Breaker Strong Resolving Game
No full textLet be a graph with vertex set . A set is a \emph{strong resolving set} of if, for distinct , there exists such that either lies on a geodesic or lies on an geodesic in . In this paper, we study maker-breaker strong resolving game (MBSRG) played on a graph by two players, Maker and Breaker, where the two players alternately select a vertex of not yet chosen. Maker wins if he is able to choose vertices that form a strong resolving set of and Breaker wins if she is able to prevent Maker from winning in the course of MBSRG. We denote by the outcome of MBSRG played on . We obtain some general results on MBSRG and examine the relation between and , where denotes the outcome of the maker-breaker resolving game of . We determine the outcome of MBSRG played on some graph classes, including corona product graphs, Cartesian product graphs, and modular product graphs.15 pages, 0 figure
Maker-Breaker games on random geometric graphs
No full textIn a Maker-Breaker game on a graph G, Breaker and Maker alternately claim edges of G. Maker wins if, after all edges have been claimed, the graph induced by his edges has some desired property. We consider four Maker-Breaker games played on random geometric graphs. For each of our four games we show that if we add edges between n points chosen uniformly at random in the unit square by order of increasing edge-length then, with probability tending to one as n→∞, the graph becomes Maker-win the very moment it satisfies a simple necessary condition. In particular, with high probability, Maker wins the connectivity game as soon as the minimum degree is at least two; Maker wins the Hamilton cycle game as soon as the minimum degree is at least four; Maker wins the perfect matching game as soon as the minimum degree is at least two and every edge has at least three neighbouring vertices; and Maker wins the H-game as soon as there is a subgraph from a finite list of “minimal graphs.” These results also allow us to give precise expressions for the limiting probability that G(n, r) is Maker-win in each case, where G(n, r) is the graph on n points chosen uniformly at random on the unit square with an edge between two points if and only if their distance is at most r
Enactive Robot Assisted Didactics (ERAD): The Role of the Maker Movement
No full textThe aim of the presented work is to outline a theoretical approach to the integration of robots into didactic contexts, with a specific focus on enactive didactic processes. In the first part of the article we will discuss, respectively, the framework of social robotics and that of enaction. In the second section we will theorize about ways to combine these two frameworks into an effective “Enactive Robot Assisted Didactics”. The final discussion will reflect on the central position that robotic design plays in this cross-fertilization, and the out- standing role that the maker movement can play in this undertaking
Information provision and monitoring of the decision-maker in the presence of an appeal process
No full textWe consider a setting where a decision-maker has to resolve a dispute between
two parties. On demand of the losing party, the decision may be subject to review
by an appellate body. The decision-maker has discretionary power and may be
opportunistic. Depending on the institution design, information on the dispute is
provided either by the parties themselves or by an independent investigator. We
show that information provision by the parties generates more efficient monitoring
through appeals and less opportunism by the decision-maker than information
provision by the investigator. We discuss our results in light of the adversarialversus-
inquisitorial controversy
Bibliographie Hilarion G. Petzold 1958 – 2009 mit Anhang als Einführung
No full textDieses Archiv enthält die Gesamtbibliographie der Werke des Autors nebst einiger Texte „Über H. G. Petzold“ im Schlussteil der Bibliographie sowie einen Anhang mit einer Einführung in die Architektur des Werkes in seinem wissenslogischen Aufbau als Ausarbeitung seines „Tree of Science Modells“ (2007).This archive contains the complete bibliography of the author and some texts about H. G. Petzold, moreover an epilogue with an introduction to the architecture of the works in its epistemological structure and composition and as an elaborations of Petzold’s „Tree of Science Modell (2007).https://www.fpi-publikation.de/polyloge/01-2009-petzold-h-g-gesamtbibliographie-h-g-petzold-1958-2009-updating-november2009/peerReviewedpublishedVersio
Dispelling the Myths Behind First-author Citation Counts
No full textWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Maker-Breaker domination number
No full text20 pages, 5 figuresInternational audienceThe Maker-Breaker domination game is played on a graph G by Dominator and Staller. The players alternatively select a vertex of G that was not yet chosen in the course of the game. Dominator wins if at some point the vertices he has chosen form a dominating set. Staller wins if Dominator cannot form a dominating set. In this paper we introduce the Maker-Breaker domination number γ MB (G) of G as the minimum number of moves of Dominator to win the game provided that he has a winning strategy and is the first to play. If Staller plays first, then the corresponding invariant is denoted γ MB (G). Comparing the two invariants it turns out that they behave much differently than the related game domination numbers. The invariant γ MB (G) is also compared with the domination number. Using the Erd˝ os-Selfridge Criterion a large class of graphs G is found for which γ MB (G) > γ(G) holds. Residual graphs are introduced and used to bound/determine γ MB (G) and γ MB (G). Using residual graphs, γ MB (T) and γ MB (T) are determined for an arbitrary tree. The invariants are also obtained for cycles and bounded for union of graphs. A list of open problems and directions for further investigations is given
- …
