检索结果-内蒙古大学图书馆

Coreference is not always either/or: psycholinguistic evidence for near-identity

LANGUAGE COGNITION AND NEUROSCIENCE 2014年第7期29卷 844-855页

作者： Recasens, Marta Tolchinsky, Liliana Antonia Marti, M. Univ Barcelona Dept Linguist Barcelona Spain

Coreference has been traditionally defined dichotomously as identity-of-reference or non-identity-of-reference. Here, we consider the existence of a near-identity category for referential relations that are neither coreferent nor non-coreferent. We present a three-task experiment on the interpretation of the identity relationship between the referents of noun phrases in English and in Catalan. The experiment collected the judgements and reaction times (RTs) of 70 English speakers and 34 Catalan speakers to investigate the reality of a near-identity category that undermines the traditional dichotomous approach to coreference. The results show that whereas some referential relations are classified as either identity or non-identity by the majority of participants, there is a third class of relations for which the judgements are split between identity and non-identity. This third class of relations also shows a longer RT. This evidence supports the conclusion that it does not suffice to distinguish between identity-of-reference and non-identity- of-reference, but that it is psychologically plausible to assume a middle-ground category of near-identity to include those referential relations on which participants disagree as to whether they are coreferent. In addition, the results allow to conclude that near-identity relations involve higher processing complexity. The fact that this is true for both English and Catalan points towards the cross-linguistic nature of near-identical referents.

关键词： coreference near-identity reference processing complexity

来源：评论

学校读者我要写书评

暂无评论

processing covert dependencies: an SAT study on Mandarin wh-in-situ questions

引用

JOURNAL OF EAST ASIAN LINGUISTICS 2014年第2期23卷 207-232页

作者： Xiang, Ming Dillon, Brian Wagers, Matt Liu, Fengqin Guo, Taomei Univ Chicago Dept Linguist Chicago IL 60637 USA Univ Massachusetts Amherst MA 01003 USA Univ Calif Santa Cruz Santa Cruz CA 95064 USA Beijing Normal Univ State Key Lab Cognit Neurosci & Learning Beijing 100875 Peoples R China

In wh-in-situ languages like Mandarin Chinese, in which the wh-phrase remains in a canonical argument position in wh-questions, syntactic theories generally posit that a covert dependency between the in-situ position and a clause-initial syntactic operator must nonetheless hold at logical form. Wh-in-situ languages and wh-fronted languages are in this way abstractly similar. This paper investigates whether the processing of Mandarin wh-in-situ questions indeed involves constructing a long-distance dependency. Using the multiple-response speed-accuracy tradeoff (SAT) paradigm, we show that Chinese wh-in-situ questions incur more processing costs than their non-wh counterparts. Furthermore, the length of the covert dependency affects only processing accuracy, but not processing speed. This pattern suggests a content-addressable memory process underlying the construction of wh-in-situ dependencies, similar to overt long distance dependencies in English.

关键词： Wh-in-situ Chinese Long distance dependencies Covert dependencies Memory mechanisms processing complexity

来源：评论

学校读者我要写书评

暂无评论

complexity reduced zero-forcing beamforming in massive MIMO systems

Complexity reduced zero-forcing beamforming in massive MIMO ...

引用

Information Theory and Applications Workshop (ITA)

作者： Park, Chan-Sic Byun, Yong-Suk Bokiye, Aman Miesso Lee, Yong-Hwan Seoul Natl Univ Sch Elect Engn Seoul 151600 South Korea Seoul Natl Univ INMC Seoul 151600 South Korea

ISBN: (纸本)9781479935901

Data gathering is one of the most popular applications in multi-hop wireless sensor networks. Since resources are limited, it is important to efficiently allocate the resource Massive multi-input multi-output (m-MIMO) systems can provide a high degree of freedom in signal transmission, enabling to simultaneously serve a number of users with high transmissin capacity. Conventional zero-forcing beamforming (ZFBF) techniques can transmit multi-user signal while completely canceling out interbeam interference. However, they may have implementation difficulty when applied to m-MIMO systems mainly due to hugh processing complexity. In this paper, we design a complexity reduced ZFBF scheme by means of sequential interference cancellation. We first determine the beam weight according to the use of conventional maximum ratio transmission (MRT) scheme and calculate the corresponding interbeam interference. We calculate so-called an interference cancellation vector by sequentially cancelling out a predetermined number of interference sources in an order of the strongest interference. Finally, we determine the beam weight by adding the interference cancellation vector to the MRT beam weight. The number of interbeam interferences to be cancelled out can be pre-determined taking into consideration of the processing complexity and required performance. As the number of interbeam interferences to be cancelled out increases, the performance of the proposed scheme approaches to that of ZFBF. The numerical and simulation results show that the proposed scheme can achieve about 90% capacity of ZFBF while requiring 2 similar to 7% processing complexity of ZFBF in various operating environments with the use of 32 128 transmit antennas.

关键词： massive MIMO spatial multiplexing scheme zero-forcing beamforming maximum ratio transmission inter-beam interference processing complexity

来源：评论

学校读者我要写书评

暂无评论

Multi-byte Pattern Matching using Stride-k DFA for High Speed Deep Packet Inspection 17

Multi-byte Pattern Matching using Stride-<i>k</i> DFA for Hi...

引用

IEEE 17th International Conference on Computational Science and Engineering (CSE)

作者： Najam, Maleeha Younis, Usman Rasool, Raihan Ur Natl Univ Sci & Technol Sch Elect Engn & Comp Sci H-12 Islamabad 44000 Pakistan King Faisal Univ Dept Comp Sci Al Hufuf Saudi Arabia

ISBN: (纸本)9781479979813

Deep packet inspection (DPI) is one of the crucial tasks in modern intrusion detection and intrusion prevention systems. It allows the inspection of packet payload using patterns. Modern DPI based systems use regular expressions to define these patterns. Deterministic finite automata (DFA) is considered to be an ideal choice for performing regular expression matching due to its O(1) processing complexity. However, DFAs consume large memory to store its state transition table, but this problem gets worsened when stride level of the DFA is increased. Though, increasing stride level brings significant increase in the overall speedup of the matching engine but as a tradeoff it consumes large memory. In this paper, we present stride-k speculative parallel pattern matching (SPPM), a technique in which a packet is first split up into two chunks and then multiple bytes per chunk are inspected at a time using stride-k DFA. Furthermore, we present a stride-k DFA compression technique using alphabet compression table (ACT) to reduce the memory requirements of stride-k DFA. We have implemented the single threaded algorithm for stride-2 SPPM. Results show that the use of stride-2 SPPM can overall increase the pattern matching speed by up to 30% as compared to traditional DFA matching, and a significant reduction of over 70% in the number of iterations required for packet processing. Secondly, over 65% reduction in the number of transitions has been achieved using ACT for stride-2 DFA implementation.

关键词： computational complexity deterministic automata finite automata pattern matching security of data ACT alphabet compression table deterministic finite automata high speed deep packet inspection intrusion detection system intrusion prevention system multibyte pattern matching processing complexity regular expression matching stride-2 SPPM stride-k DFA compression technique stride-k speculative parallel pattern matching Automata Educational institutions Indexes Inspection Memory management Parallel processing Pattern matching DFA alphabet compression deep packet inspection multi-byte matching regular expressions

来源：评论

学校读者我要写书评

暂无评论

Data from eye-tracking corpora as evidence for theories of syntactic processing complexity

引用

COGNITION 2008年第2期109卷 193-210页

作者： Demberg, Vera Keller, Frank Univ Edinburgh Sch Informat Edinburgh EH8 9AB Midlothian Scotland

We evaluate the predictions of two theories of syntactic processing complexity, dependency locality theory (DLT) and surprisal, against the Dundee Corpus, which contains the eye-tracking record of 10 participants reading 51,000 words of newspaper text. Our results show that DLT integration cost is not a significant predictor of reading times for arbitrary words in the corpus. However, DLT successfully predicts reading times for nouns. We also find evidence for integration cost effects at auxiliaries, not predicted by DLT. For surprisal, we demonstrate that an unlexicalized formulation of surprisal can predict reading times for arbitrary words in the corpus. Comparing DLT integration cost and surprisal, we find that the two measures are uncorrelated, which suggests that a complete theory will need to incorporate both aspects of processing complexity. We conclude that eye-tracking corpora, which provide reading time data for naturally occurring, contextualized sentences, can complement experimental evidence as a basis for theories of processing complexity. (c) 2008 Elsevier B.V. All rights reserved.

关键词： Eye-tracking Corpus data processing complexity Dependency locality theory Surprisal

来源：评论

学校读者我要写书评

暂无评论

A novel fountain code-based mobile IPTV multicast system architecture over WiMAX network

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2012年第1期23卷 161-172页

作者： Joo, Hyunchul Yoon, Changwoo Um, Tai-Won Song, Hwangjun POSTECH Pohang Univ Sci & Technol Pohang 790784 South Korea ETRI Broadcasting & Telecommun Convergence Res Lab Taejon 305700 South Korea

In this paper, we present a novel fountain code-based mobile IPTV multicast system architecture over WiMAX network. In the proposed system, the transmission algorithm at a base station determines the control parameters of a fountain-encoded IPTV multicast stream adaptively to the wireless link states of subscribers in order to provide a stable IPTV service with minimum resource usage on WiMAX network, and the channel grouping algorithm at a server makes near-optimal channel grouping based on channel selection preferences to pursue an effective tradeoff between the channel zapping time and the processing complexity of a subscriber. Finally, experimental results are provided to show the performance of the proposed system. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Mobile IPTV WiMAX Fountain code Channel zapping time processing complexity Resource usage Decoding failure rate Quality of experience Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

QoE-aware Mobile IPTV Multicast System over WiMAX Network

QoE-aware Mobile IPTV Multicast System over WiMAX Network

引用

IEEE Consumer Communications and Networking Conference (CCNC)

作者： Joo, Hyunchul Song, Hwangjun POSTECH Pohang Univ Sci & Technol Div IT Convergence Engn Pohang 790784 South Korea

ISBN: (纸本)9781457720710

In this work, we present a QoE-aware mobile IPTV multicast system over WiMAX network. In the proposed system, the adaptive transmission algorithm at a base station determines the control parameters of a fountain-encoded IPTV multicast stream adaptively to the wireless link states of subscribers in order to provide a stable IPTV multicast service with minimum resource usage on WiMAX network, and the channel grouping algorithm at a server makes near-optimal channel grouping based on channel selection preferences in order to pursue an effective tradeoff between the channel zapping time and the processing complexity of a subscriber. Finally, experimental results are provided to show the performance of the proposed system.

关键词： component Mobile IPTV WiMAX Fountain code Channel grouping Channel zapping time processing complexity

来源：评论

学校读者我要写书评

暂无评论

Analysis and mitigation of antenna effects on wideband wireless channel

引用

ELECTRONICS LETTERS 2010年第16期46卷 1159-U92页

作者： Sipal, V. Allen, B. Edwards, D. Univ Oxford Dept Engn Sci Oxford OX1 3PJ England

Provided is an alternative physical interpretation of the wireless channel impulse response using the knowledge of the antenna impulse responses. As a result, it can be shown that the clusters in the popular Saleh-Valenzuela model actually represent one multipath component only, not several rays as is often assumed. This knowledge has a significant impact on receiver architecture since the number of fingers in a rake receiver can be reduced significantly, for some systems by a factor of up to eight. The drawback of the method is an increase in processing complexity in each finger, but it is anticipated that the overall processing complexity in the receiver will be reduced.

关键词： Saleh-Valenzuela model antenna effects antenna impulse response antennas multipath channels multipath component processing complexity radio receivers rake receiver receiver architecture transient response wideband wireless channel wireless channel impulse response wireless channels

来源：评论

学校读者我要写书评

暂无评论

Hybrid flow shop scheduling: A survey

引用

COMPUTERS & INDUSTRIAL ENGINEERING 1999年第1-2期37卷 57-61页

作者： Linn, R Zhang, W Hong Kong Univ Sci & Technol Dept Ind Engn & Engn Management Kowloon Peoples R China

Extensive work has been done in hybrid flow shop scheduling. This paper reviews the state of art and discusses in details their contributions. The review is concluded with suggestions for future research directions. (... 详细信息

关键词： hybrid flow shop scheduling processing complexity scheduling criterion branch and bound heuristics

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of MSP: Feature-Rich High-speed Transport Protocol

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 1993年第6期1卷 740-753页

作者： La Porta, Thomas F. Schwartz, Mischa AT&T Bell Labs Holmdel NJ 07733 USA Columbia Univ Dept Elect Engn New York NY 10027 USA Columbia Univ Ctr Telecommun Res New York NY 10027 USA

This paper presents a performance analysis of the Multistream Protocol (MSP), a feature-rich flexible transport protocol designed to meet the needs of high-performance applications. The analysis presents the advantages and disadvantages of the implementation of several different protocol mechanisms, such as packet or block mode data transfer. The analysis is based on the processing complexity associated with executing each protocol function. Results show that a feature-rich transport protocol can be implemented in which the protocol control processing overhead is not prohibitive to providing high performance to an application. Instead, the benefits of a "lean" protocol are achieved because the protocol services better fit application requirements. Also, the primary bottleneck for data transfer is shown to be the complexity associated with error control, which can be reduced through the technique of transmitting packets in blocks.

关键词： Packet Switching Performance Evaluation Protocols Performance Analysis Multistream Protocol Transport Protocol Block Mode Data Transfer Packet Mode Data Transfer processing complexity Protocol Control processing Overhead Packet Transmission Error Control Performance Analysis Transport Protocols Process Control Streaming Media Parallel Architectures Error Correction Neck Formal Verification

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：