342 research outputs found

    Functional Connectivity Reveals Which Language the “Control Regions” Control during Bilingual Production

    Get PDF
    Bilingual studies have revealed critical roles for the dorsal anterior cingulate cortex (dACC) and the left caudate nucleus (Lcaudate) in controlling language processing, but how these regions manage activation of a bilingual’s two languages remains an open question. We addressed this question by identifying the functional connectivity (FC) of these control regions during a picture-naming task by bimodal bilinguals who were fluent in both a spoken and a signed language. To quantify language control processes, we measured the FC of the dACC and Lcaudate with a region specific to each language modality: left superior temporal gyrus (LSTG) for speech and left pre/postcentral gyrus (LPCG) for sign. Picture-naming occurred in either a single- or dual-language context. The results showed that in a single-language context, the dACC exhibited increased FC with the target language region, but not with the non-target language region. During the dual-language context when both languages were alternately the target language, the dACC showed strong FC to the LPCG, the region specific to the less proficient (signed) language. By contrast, the Lcaudate revealed a strong connectivity to the LPCG in the single-language context and to the LSTG (the region specific to spoken language) in the dual-language context. Our findings suggest that the dACC monitors and supports the processing of the target language, and that the Lcaudate controls the selection of the less accessible language. The results support the hypothesis that language control processes adapt to task demands that vary due to different interactional contexts

    Infinite families of cyclic and negacyclic codes supporting 3-designs

    Full text link
    Interplay between coding theory and combinatorial tt-designs has been a hot topic for many years for combinatorialists and coding theorists. Some infinite families of cyclic codes supporting infinite families of 33-designs have been constructed in the past 50 years. However, no infinite family of negacyclic codes supporting an infinite family of 33-designs has been reported in the literature. This is the main motivation of this paper. Let q=pmq=p^m, where pp is an odd prime and m2m \geq 2 is an integer. The objective of this paper is to present an infinite family of cyclic codes over \gf(q) supporting an infinite family of 33-designs and two infinite families of negacyclic codes over \gf(q^2) supporting two infinite families of 33-designs. The parameters and the weight distributions of these codes are determined. The subfield subcodes of these negacyclic codes over \gf(q) are studied. Three infinite families of almost MDS codes are also presented. A constacyclic code over GF(44) supporting a 44-design and six open problems are also presented in this paper

    S-QGPU: Shared Quantum Gate Processing Unit for Distributed Quantum Computing

    Full text link
    We propose a distributed quantum computing (DQC) architecture in which individual small-sized quantum computers are connected to a shared quantum gate processing unit (S-QGPU). The S-QGPU comprises a collection of hybrid two-qubit gate modules for remote gate operations. In contrast to conventional DQC systems, where each quantum computer is equipped with dedicated communication qubits, S-QGPU effectively pools the resources (e.g., the communication qubits) together for remote gate operations, and thus significantly reduces the cost of not only the local quantum computers but also the overall distributed system. Moreover, S-QGPU's shared resources for remote gate operations enable efficient resource utilization. When not all computing qubits in the system require simultaneous remote gate operations, S-QGPU-based DQC architecture demands fewer communication qubits, further decreasing the overall cost. Alternatively, with the same number of communication qubits, it can support a larger number of simultaneous remote gate operations more efficiently, especially when these operations occur in a burst mode.Comment: 8 pages, 6 figure
    corecore