1,979 research outputs found
Entanglement Generation of Clifford Quantum Cellular Automata
Clifford quantum cellular automata (CQCAs) are a special kind of quantum
cellular automata (QCAs) that incorporate Clifford group operations for the
time evolution. Despite being classically simulable, they can be used as basic
building blocks for universal quantum computation. This is due to the
connection to translation-invariant stabilizer states and their entanglement
properties. We will give a self-contained introduction to CQCAs and investigate
the generation of entanglement under CQCA action. Furthermore, we will discuss
finite configurations and applications of CQCAs.Comment: to appear in the "DPG spring meeting 2009" special issue of Applied
Physics
MDCC: Multi-Data Center Consistency
Replicating data across multiple data centers not only allows moving the data
closer to the user and, thus, reduces latency for applications, but also
increases the availability in the event of a data center failure. Therefore, it
is not surprising that companies like Google, Yahoo, and Netflix already
replicate user data across geographically different regions.
However, replication across data centers is expensive. Inter-data center
network delays are in the hundreds of milliseconds and vary significantly.
Synchronous wide-area replication is therefore considered to be unfeasible with
strong consistency and current solutions either settle for asynchronous
replication which implies the risk of losing data in the event of failures,
restrict consistency to small partitions, or give up consistency entirely. With
MDCC (Multi-Data Center Consistency), we describe the first optimistic commit
protocol, that does not require a master or partitioning, and is strongly
consistent at a cost similar to eventually consistent protocols. MDCC can
commit transactions in a single round-trip across data centers in the normal
operational case. We further propose a new programming model which empowers the
application developer to handle longer and unpredictable latencies caused by
inter-data center communication. Our evaluation using the TPC-W benchmark with
MDCC deployed across 5 geographically diverse data centers shows that MDCC is
able to achieve throughput and latency similar to eventually consistent quorum
protocols and that MDCC is able to sustain a data center outage without a
significant impact on response times while guaranteeing strong consistency
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
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
SoccerStories: A Kick-off for Visual Soccer Analysis
This article presents SoccerStories, a visualization interface to support analysts in exploring soccer data and communicating interesting insights. Currently, most analyses on such data relate to statistics on individual players or teams. However, soccer analysts we collaborated with consider that quantitative analysis alone does not convey the right picture of the game, as context, player positions and phases of player actions are the most relevant aspects. We designed SoccerStories to support the current practice of soccer analysts and to enrich it, both in the analysis and communication stages. Our system provides an overview+detail interface of game phases, and their aggregation into a series of connected visualizations, each visualization being tailored for actions such as a series of passes or a goal attempt. To evaluate our tool, we ran two qualitative user studies on recent games using SoccerStories with data from one of the world's leading live sports data providers. The first study resulted in a series of four articles on soccer tactics, by a tactics analyst, who said he would not have been able to write these otherwise. The second study consisted in an exploratory follow-up to investigate design alternatives for embedding soccer phases into word-sized graphics. For both experiments, we received a very enthusiastic feedback and participants consider further use of SoccerStories to enhance their current workflow
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
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)
- âŠ