29,603 research outputs found
Asynchronous Graph Pattern Matching on Multiprocessor Systems
Pattern matching on large graphs is the foundation for a variety of
application domains. Strict latency requirements and continuously increasing
graph sizes demand the usage of highly parallel in-memory graph processing
engines that need to consider non-uniform memory access (NUMA) and concurrency
issues to scale up on modern multiprocessor systems. To tackle these aspects,
graph partitioning becomes increasingly important. Hence, we present a
technique to process graph pattern matching on NUMA systems in this paper. As a
scalable pattern matching processing infrastructure, we leverage a
data-oriented architecture that preserves data locality and minimizes
concurrency-related bottlenecks on NUMA systems. We show in detail, how graph
pattern matching can be asynchronously processed on a multiprocessor system.Comment: 14 Pages, Extended version for ADBIS 201
The processing of ambiguous sentences by first and second language learners of English
This study compares the way English-speaking children and adult second language learners of English resolve relative clause attachment ambiguities in sentences such as The dean liked the secretary of the professor who was reading a letter. Two groups of advanced L2 learners of English with Greek or German as their L1 participated in a set of off-line and on-line tasks. While the participants ' disambiguation preferences were influenced by lexical-semantic properties of the preposition linking the two potential antecedent NPs (of vs. with), there was no evidence that they were applying any structure-based ambiguity resolution strategies of the type that have been claimed to influence sentence processing in monolingual adults. These findings differ markedly from those obtained from 6 to 7 yearold monolingual English children in a parallel auditory study (Felser, Marinis, & Clahsen, submitted) in that the children's attachment preferences were not affected by the type of preposition at all. We argue that whereas children primarily rely on structure-based parsing principles during processing, adult L2 learners are guided mainly by non-structural informatio
Syntactic Computation as Labelled Deduction: WH a case study
This paper addresses the question "Why do WH phenomena occur with the particular cluster of properties observed across languages -- long-distance dependencies, WH-in situ, partial movement constructions, reconstruction, crossover etc." These phenomena have been analysed by invoking a number of discrete principles and categories, but have so far resisted a unified treatment.
The explanation proposed is set within a model of natural language understanding in context, where the task of understanding is taken to be the incremental building of a structure over which the semantic content is defined. The formal model is a composite of a labelled type-deduction system, a modal tree logic, and a set of rules for describing the process of interpreting the string as a set of transition states. A dynamic concept of syntax results, in which in addition to an output structure associated with each string (analogous to the level of LF), there is in addition an explicit meta-level description of the process whereby this incremental process takes place.
This paper argues that WH-related phenomena can be unified by adopting this dynamic perspective. The main focus of the paper is on WH-initial structures, WH in situ structures, partial movement phenomena, and crossover phenomena. In each case, an analysis is proposed which emerges from the general characterisatioan of WH structures without construction-specific stipulation.Articl
Programming Telepathy: Implementing Quantum Non-Locality Games
Quantum pseudo-telepathy is an intriguing phenomenon which results from the
application of quantum information theory to communication complexity. To
demonstrate this phenomenon researchers in the field of quantum communication
complexity devised a number of quantum non-locality games. The setting of these
games is as follows: the players are separated so that no communication between
them is possible and are given a certain computational task. When the players
have access to a quantum resource called entanglement, they can accomplish the
task: something that is impossible in a classical setting. To an observer who
is unfamiliar with the laws of quantum mechanics it seems that the players
employ some sort of telepathy; that is, they somehow exchange information
without sharing a communication channel. This paper provides a formal framework
for specifying, implementing, and analysing quantum non-locality games
Cognitive constraints and island effects
Competence-based theories of island effects play a central role in generative grammar, yet the graded nature of many syntactic islands has never been properly accounted for. Categorical syntactic accounts of island effects have persisted in spite of a wealth of data suggesting that island effects are not categorical in nature and that nonstructural manipulations that leave island structures intact can radically alter judgments of island violations. We argue here, building on work by Paul Deane, Robert Kluender, and others, that processing factors have the potential to account for this otherwise unexplained variation in acceptability judgments.
We report the results of self-paced reading experiments and controlled acceptability studies that explore the relationship between processing costs and judgments of acceptability. In each of the three self-paced reading studies, the data indicate that the processing cost of different types of island violations can be significantly reduced to a degree comparable to that of nonisland filler-gap constructions by manipulating a single nonstructural factor. Moreover, this reduction in processing cost is accompanied by significant improvements in acceptability. This evidence favors the hypothesis that island-violating constructions involve numerous processing pressures that aggregate to drive processing difficulty above a threshold, resulting in unacceptability. We examine the implications of these findings for the grammar of filler-gap dependencies
Strong Complementarity and Non-locality in Categorical Quantum Mechanics
Categorical quantum mechanics studies quantum theory in the framework of
dagger-compact closed categories.
Using this framework, we establish a tight relationship between two key
quantum theoretical notions: non-locality and complementarity. In particular,
we establish a direct connection between Mermin-type non-locality scenarios,
which we generalise to an arbitrary number of parties, using systems of
arbitrary dimension, and performing arbitrary measurements, and a new stronger
notion of complementarity which we introduce here.
Our derivation of the fact that strong complementarity is a necessary
condition for a Mermin scenario provides a crisp operational interpretation for
strong complementarity. We also provide a complete classification of strongly
complementary observables for quantum theory, something which has not yet been
achieved for ordinary complementarity.
Since our main results are expressed in the (diagrammatic) language of
dagger-compact categories, they can be applied outside of quantum theory, in
any setting which supports the purely algebraic notion of strongly
complementary observables. We have therefore introduced a method for discussing
non-locality in a wide variety of models in addition to quantum theory.
The diagrammatic calculus substantially simplifies (and sometimes even
trivialises) many of the derivations, and provides new insights. In particular,
the diagrammatic computation of correlations clearly shows how local
measurements interact to yield a global overall effect. In other words, we
depict non-locality.Comment: 15 pages (incl. 5 appendix). To appear: LiCS 201
- âŚ