Reaching Approximate Byzantine Consensus with Multi-hop Communication

We address the problem of reaching consensus in the presence of Byzantine faults. In particular, we are interested in investigating the impact of messages relay on the network connectivity for a correct iterative approximate Byzantine consensus algorithm to exist. The network is modeled by a simple directed graph. We assume a node can send messages to another node that is up to $l$ hops away via forwarding by the intermediate nodes on the routes, where $l\in \mathbb{N}$ is a natural number. We characterize the necessary and sufficient topological conditions on the network structure. The tight conditions we found are consistent with the tight conditions identified for $l=1$, where only local communication is allowed, and are strictly weaker for $l>1$. Let $l^*$ denote the length of a longest path in the given network. For $l\ge l^*$ and undirected graphs, our conditions hold if and only if $n\ge 3f+1$ and the node-connectivity of the given graph is at least $2f+1$ , where $n$ is the total number of nodes and $f$ is the maximal number of Byzantine nodes; and for $l\ge l^*$ and directed graphs, our conditions is equivalent to the tight condition found for exact Byzantine consensus. Our sufficiency is shown by constructing a correct algorithm, wherein the trim function is constructed based on investigating a newly introduced minimal messages cover property. The trim function proposed also works over multi-graphs.Comment: 24 pages, 1 figure. arXiv admin note: text overlap with arXiv:1203.188

Using Social Media to Identify Gentrification in the Creative City: A Case Study of Pittsburgh, PA

http://www.gis.ku.edu/gisday/2013/Platinum Sponsors KU Institute for Policy & Social Research Gold Sponsors Bartlett & West KU Department of Geography KU Libraries State of Kansas Data Access and Support Center (DASC) Silver Sponsors Kansas Biological Survey KU Center for Global & International Studies KU Environmental Studies Program Bronze Sponsors Global Information Systems KU Center for Remote Sensing of Ice Sheets (CReSIS) TREKK Design Group, LL

River Discharge, in State of the Climate in 2008

The global mean temperature in 2008 was slightly cooler than that in 2007; however, it still ranks within the 10 warmest years on record. Annual mean temperatures were generally well above average in South America, northern and southern Africa, Iceland, Europe, Russia, South Asia, and Australia. In contrast, an exceptional cold outbreak occurred during January across Eurasia and over southern European Russia and southern western Siberia. There has been a general increase in land-surface temperatures and in permafrost temperatures during the last several decades throughout the Arctic region, including increases of 1° to 2°C in the last 30 to 35 years in Russia. Record setting warm summer (JJA) air temperatures were observed throughout Greenland

Researching ‘bogus’ asylum seekers, ‘illegal’ migrants and ‘crimmigrants’

Both immigration and criminal laws are, at their core, systems of inclusion and exclusion. They are designed to determine whether and how to include individuals as members of society or exclude them from it, thereby, creating insiders and outsiders (Stumpf 2006). Both are designed to create distinct categories of people — innocent versus guilty, admitted versus excluded or, as majority would say, ‘legal’ versus ‘illegal’ (Stumpf 2006). Viewed in that light, perhaps it is not surprising that these two areas of law have become inextrica- bly connected in the official discourses. When politicians and policy makers (and also law enforcement authorities and tabloid press) seek to raise the barriers for non-citizens to attain membership in society, it is unremarkable that they turn their attention to an area of the law that similarly func- tions to exclude the ‘other’ — transforming immigrants into ‘crimmigrants’.1 As a criminological researcher one then has to rise up to the challenges of disentangling these so-called officially constructed (pseudo) realities, and breaking free from a continued dominance of authoritative discourses, and developing an alternative understanding of ‘crimmigration’ by connecting the processes of criminal is ation and ‘other ing’ with poverty, xe no-racism and other forms of social exclusion (see Institute of Race Relations 1987; Richmond 1994; Fekete 2001; Bowling and Phillips 2002; Sivanandan 2002; Weber and Bowling 2004)

U.S. River Discharge for 2008 in State of the Climate in 2008

The global mean temperature in 2008 was slightly cooler than that in 2007; however, it still ranks within the 10 warmest years on record. Annual mean temperatures were generally well above average in South America, northern and southern Africa, Iceland, Europe, Russia, South Asia, and Australia. In contrast, an exceptional cold outbreak occurred during January across Eurasia and over southern European Russia and southern western Siberia. There has been a general increase in land-surface temperatures and in permafrost temperatures during the last several decades throughout the Arctic region, including increases of 1° to 2°C in the last 30 to 35 years in Russia. Record setting warm summer (JJA) air temperatures were observed throughout Greenland

The effect of network structure on phase transitions in queuing networks

Recently, De Martino et al have presented a general framework for the study of transportation phenomena on complex networks. One of their most significant achievements was a deeper understanding of the phase transition from the uncongested to the congested phase at a critical traffic load. In this paper, we also study phase transition in transportation networks using a discrete time random walk model. Our aim is to establish a direct connection between the structure of the graph and the value of the critical traffic load. Applying spectral graph theory, we show that the original results of De Martino et al showing that the critical loading depends only on the degree sequence of the graph -- suggesting that different graphs with the same degree sequence have the same critical loading if all other circumstances are fixed -- is valid only if the graph is dense enough. For sparse graphs, higher order corrections, related to the local structure of the network, appear.Comment: 12 pages, 7 figure