Buffalo Arts and Culture Organizations

Open Buffalo and Partnership for the Public Good collaboratively compiled a directory of organizations that promote social justice through locally based arts and cultural programmatic efforts. This directory has contact information, as well as the mission and social justice commitment of the various organizations

Country Snapshot Montenegro

A brief summary of the history and current status of religion in Montenegro

Country Snapshot Serbia

A brief summary of the history and current status of religion in Serbia

Local Government Website Updated Report Card

In 2017, the Buffalo Niagara Coalition for Open Government evaluated the websites of sixteen municipalities in Erie and Niagara County

Local Government Authority in Erie and Niagara County Website Report Card

In February of 2018, the Buffalo Niagara Coalition for Open Government evaluated the websites of fourteen local government Authorities in Erie and Niagara Count

Gossip in a Smartphone Peer-to-Peer Network

In this paper, we study the fundamental problem of gossip in the mobile telephone model: a recently introduced variation of the classical telephone model modified to better describe the local peer-to-peer communication services implemented in many popular smartphone operating systems. In more detail, the mobile telephone model differs from the classical telephone model in three ways: (1) each device can participate in at most one connection per round; (2) the network topology can undergo a parameterized rate of change; and (3) devices can advertise a parameterized number of bits about their state to their neighbors in each round before connection attempts are initiated. We begin by describing and analyzing new randomized gossip algorithms in this model under the harsh assumption of a network topology that can change completely in every round. We prove a significant time complexity gap between the case where nodes can advertise $0$ bits to their neighbors in each round, and the case where nodes can advertise $1$ bit. For the latter assumption, we present two solutions: the first depends on a shared randomness source, while the second eliminates this assumption using a pseudorandomness generator we prove to exist with a novel generalization of a classical result from the study of two-party communication complexity. We then turn our attention to the easier case where the topology graph is stable, and describe and analyze a new gossip algorithm that provides a substantial performance improvement for many parameters. We conclude by studying a relaxed version of gossip in which it is only necessary for nodes to each learn a specified fraction of the messages in the system.Comment: Extended Abstract to Appear in the Proceedings of the ACM Conference on the Principles of Distributed Computing (PODC 2017

Recommandations pour l\u27ouverture des données et des contenus culturels

Le réseau informel de personnes et d\u27organisations Open Glam (bibliothèques, archives et musées) cherche à favoriser l\u27ouverture des contenus conservés ou produits par les institutions culturelles. Le groupe de travail français a remis à la ministre de la Culture ce rapport qui aborde les enjeux relatifs aux démarches à l\u27œuvre dans les institutions culturelles françaises, souligne les principaux points de blocage freinant cette diffusion, et formule quelques préconisations et pistes d\u27évolution pour l\u27administration et le législateur, dans un esprit constructif de corésolution des problèmes