Bilingualism and the single route/dual route debate

The debate between single and dual route accounts of cognitive processes has been generated predominantly by the application of connectionist modeling techniques to two areas of psycholinguistics. This paper draws an analogy between this debate and bilingual language processing. A prominent question within bilingual word recognition is whether the bilingual has functionally separate lexicons for each language, or a single system able to recognize the words in both languages. Empirical evidence has been taken to support a model which includes two separate lexicons working in parallel (Smith, 1991; Gerard and Scarborough, 1989). However, a range of interference effects has been found between the bilingual’s two sets of lexical knowledge (Thomas, 1997a). Connectionist models have been put forward which suggest that a single representational resource may deal with these data, so long as words are coded according to language membership (Thomas, 1997a, 1997b, Dijkstra and van Heuven, 1998). This paper discusses the criteria which might be used to differentiate single route and dual route models. An empirical study is introduced to address one of these criteria, parallel access, with regard to bilingual word recognition. The study fails to find support for the dual route model

Plural morphology in compounding is not good evidence to support the dual mechanism model

The compounding phenomena is considered to be good evidence to support the dual mechanism model of morphological processing (Pinker & Prince, 1992). However evidence from initial neural net modeling has shown that a single route associative memory based account might provide an equally, if not more valid explanation of the treatment of plurals in compounds. Further neural net modeling and empirical work is proposed to test this single route accoun

Closed queueing networks under congestion: non-bottleneck independence and bottleneck convergence

We analyze the behavior of closed product-form queueing networks when the number of customers grows to infinity and remains proportionate on each route (or class). First, we focus on the stationary behavior and prove the conjecture that the stationary distribution at non-bottleneck queues converges weakly to the stationary distribution of an ergodic, open product-form queueing network. This open network is obtained by replacing bottleneck queues with per-route Poissonian sources whose rates are determined by the solution of a strictly concave optimization problem. Then, we focus on the transient behavior of the network and use fluid limits to prove that the amount of fluid, or customers, on each route eventually concentrates on the bottleneck queues only, and that the long-term proportions of fluid in each route and in each queue solve the dual of the concave optimization problem that determines the throughputs of the previous open network.Comment: 22 page

The locus of serial processing in reading aloud:Orthography-to-phonology computation or speech planning?

Dual-route theories of reading posit that a sublexical reading mechanism that operates serially and from left to right is involved in the orthography-to-phonology computation. These theories attribute the masked onset priming effect (MOPE) and the phonological Stroop effect (PSE) to the serial left-to-right operation of this mechanism. However, both effects may arise during speech planning, in the phonological encoding process, which also occurs serially and from left to right. In the present paper, we sought to determine the locus of serial processing in reading aloud by testing the contrasting predictions that the dual-route and speech planning accounts make in relation to the MOPE and the PSE. The results from three experiments that used the MOPE and the PSE paradigms in English are inconsistent with the idea that these effects arise during speech planning, and consistent with the claim that a sublexical serially operating reading mechanism is involved in the print-to-sound translation. Simulations of the empirical data on the MOPE with the dual route cascaded (DRC) and connectionist dual process (CDP++) models, which are computational implementations of the dual-route theory of reading, provide further support for the dual-route account.24 page(s

An O(nh) algorithm for dual-server coordinated en-route caching in tree networks

Dual-server coordinated en-route caching is important because of its basic features as multi-server en-route caching. In this paper, multi-server coordinated en-route caching is formulated as an optimization problem of minimizing total access cost, including transmission cost for all access demands and caching cost of all caches. We first discuss an algorithm for single-server en-route caching in tree networks and then show that this is a special case of another algorithm for dual-server en-route caching in tree networks whose time complexity is O(nh).Shihong Xu, Hong She

Is toric duality a Seiberg-like duality in (2+1)-d ?

We show that not all $(2+1)$ dimensional toric phases are Seiberg-like duals. Particularly, we work out superconformal indices for the toric phases of Fanos ${\cal{C}}_3$, ${\cal{C}}_5$ and ${\cal{B}}_2$. We find that the indices for the two toric phases of Fano ${\cal{B}}_2$ do not match, which implies that they are not Seiberg-like duals. We also take the route of acting Seiberg-like duality transformation on toric quiver Chern-Simons theories to obtain dual quivers. We study two examples and show that Seiberg-like dual quivers are not always toric quivers.Comment: 21 pages, 7 figures, to be published in JHE

Ads(3)/CFT(2) to Ads(2)/CFT(1)

It has been suggested that the quantum generalization of the Wald entropy for an extremal black hole is the logarithm of the ground state degeneracy of a dual quantum mechanics in a fixed charge sector. We test this proposal for supersymmetric extremal BTZ black holes for which there is an independent definition of the quantum entropy as the logarithm of the degeneracy of appropriate states in the dual 1+1 dimensional superconformal field theory. We find that the two proposals agree. This analysis also suggests a possible route to deriving the OSV conjecture.Comment: LaTeX file, 14 pages; v2: references added; v3: comments and refernces added; v4: expanded discussion on the role of cut-of