The ProfessionAl Go annotation datasEt (PAGE)

The game of Go has been highly under-researched due to the lack of game records and analysis tools. In recent years, the increasing number of professional competitions and the advent of AlphaZero-based algorithms provide an excellent opportunity for analyzing human Go games on a large scale. In this paper, we present the ProfessionAl Go annotation datasEt (PAGE), containing 98,525 games played by 2,007 professional players and spans over 70 years. The dataset includes rich AI analysis results for each move. Moreover, PAGE provides detailed metadata for every player and game after manual cleaning and labeling. Beyond the preliminary analysis of the dataset, we provide sample tasks that benefit from our dataset to demonstrate the potential application of PAGE in multiple research directions. To the best of our knowledge, PAGE is the first dataset with extensive annotation in the game of Go. This work is an extended version of [1] where we perform a more detailed description, analysis, and application.Comment: Journal version of arXiv:2205.00254, under revie

PERFECT RECALL AND PRUNING IN GAMES WITH IMPERFECT INFORMATION 1

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/72986/1/j.1467-8640.1996.tb00256.x.pd

Déplier la structure communautaire d’un réseau en mesurant la proximité aux représentants de communauté

International audienceHow to find all overlapping communities in a complex network? That is, how to find all relevant groups of nodes in a linked dataset? No entirely satisfying solution to that important problem exists, having a criterion to decide which group is relevant and finding quickly these groups in large networks are bottlenecks. We found that in many networks the number of these groups is limited and that there exist, for each group, at least one node that can characterize it by itself: a node belonging only to that group and important within it. We call such a node a community representative. We develop an algorithm to find these overlapping communities. The community detection is done through measuring the proximities of all nodes to the representatives and then finding irregularities in the decrease of these values reflecting the presence of relevant groups. We show that our approach handles very large real-world networks and have comparable or even better performances compared to state of the art methods.Nous proposons un algorithme pour déplier la structure communautaire des grands graphes de terrain. L'algorithme est basé sur la détection de la communauté de chaque représentant communautaire : noeud contenu dans une seule communauté et important en son sein. Cette détection est faite avec une approche à base de mesure de proximité développée récemment. Par comparaison avec d'autres méthodes de l'état de l'art nous montrons que notre algorithme a des performances équivalentes voire meilleures et est capable de traiter les plus grands graphes de terrain

A linguistic geometry for space applications

We develop a formal theory, the so-called Linguistic Geometry, in order to discover the inner properties of human expert heuristics, which were successful in a certain class of complex control systems, and apply them to different systems. This research relies on the formalization of search heuristics of high-skilled human experts which allow for the decomposition of complex system into the hierarchy of subsystems, and thus solve intractable problems reducing the search. The hierarchy of subsystems is represented as a hierarchy of formal attribute languages. This paper includes a formal survey of the Linguistic Geometry, and new example of a solution of optimization problem for the space robotic vehicles. This example includes actual generation of the hierarchy of languages, some details of trajectory generation and demonstrates the drastic reduction of search in comparison with conventional search algorithms

The Courier, Volume 29, Issue 8, December 1, 1995

Stories: Student Run Art Gallery Looking For Permanent Home Student Government Plans To Do Less IC Hallway Enhancements In First Stages Of Development Silly Songwriter Dave Rudolf Back By Popular Demand ‘Beast’ Blasts Pyrotechnics Across Arts Center Mainstage Von Heidecke’s ‘The Nutcracker’ Comes To The Mainstage Soccer Ends Season Third At Nationals People: Dave Rudolf Michelle Downey Jenny Schwar

A linguistic geometry for 3D strategic planning

This paper is a new step in the development and application of the Linguistic Geometry. This formal theory is intended to discover the inner properties of human expert heuristics, which have been successful in a certain class of complex control systems, and apply them to different systems. In this paper we investigate heuristics extracted in the form of hierarchical networks of planning paths of autonomous agents. Employing Linguistic Geometry tools the dynamic hierarchy of networks is represented as a hierarchy of formal attribute languages. The main ideas of this methodology are shown in this paper on the new pilot example of the solution of the extremely complex 3D optimization problem of strategic planning for the space combat of autonomous vehicles. This example demonstrates deep and highly selective search in comparison with conventional search algorithms

Nucleus 1985

This is a digitized, downloadable version of the Newark College of Engineering Nucleus.https://digitalcommons.njit.edu/yearbooks/1048/thumbnail.jp

Poker Learner: Reinforcement Learning Applied to Texas Hold'em Poker

Bibliografia: p. 61-66Tese de Mestrado Integrado. Engenharia Informática e Computação. Universidade do Porto. Faculdade de Engenharia.. 201