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

Keeping an eye on the violinist: motor experts show superior timing consistency in a visual perception task

PSYCHOLOGICAL RESEARCH-PSYCHOLOGISCHE FORSCHUNG 2010年第6期74卷 579-585页

作者： Woellner, Clemens Canal-Bruland, Rouwen Royal No Coll Mus Ctr Mus Performance Res Manchester M13 9RD Lancs England Vrije Univ Amsterdam Res Inst MOVE Fac Human Movement Sci NL-1081 BT Amsterdam Netherlands

Common coding theory states that perception and action may reciprocally induce each other. Consequently, motor expertise should map onto perceptual consistency in specific tasks such as predicting the exact timing of a musical entry. To test this hypothesis, ten string musicians (motor experts), ten non-string musicians (visual experts), and ten non-musicians were asked to watch progressively occluded video recordings of a first violinist indicating entries to fellow members of a string quartet. Participants synchronised with the perceived timing of the musical entries. Results revealed significant effects of motor expertise on perception. Compared to visual experts and non-musicians, string players not only responded more accurately, but also with less timing variability. These findings provide evidence that motor experts' consistency in movement execution-a key characteristic of expert motor performance-is mirrored in lower variability in perceptual judgements, indicating close links between action competence and perception.

关键词： coding theory VISUAL perception VIOLINISTS MUSIC -- Performance MOTOR ability

来源：评论

学校读者我要写书评

暂无评论

3D Scientific Data Mining in Ion Trajectories

3D Scientific Data Mining in Ion Trajectories

引用

3rd International Conference on Knowledge Discovery and Data Mining

作者： Sharif, J. M. Ngadi, M. A. Latiff, M. S. A. Jamil, M. Mahadi Abdul Univ Teknol Malaysia Dept Comp Syst & Commun Skudai 81310 Malaysia Univ Tun Hussein Onn Dept Elect Engn Parit Raja 86400 Malaysia

ISBN: (纸本)9780769539232

In physics, structure of glass and ion trajectories are essentially based on statistical analysis of data acquired through experimental measurement and computer simulation [1, 2]. Invariably, the details of the structure-transport relationships in the data have been mistreated in favour of ensemble average [3-5]. In this study, we demonstrate a visual approach of such relationship using surface-based visualisation schemes. In particular, we demonstrate a scientific datasets of simulated 3D time-varying model and examine the temporal correlation among ion trajectories. We propose a scheme that uses a three dimensional visual representation with colour scale for depicting the timeline events in ion trajectories and this scheme could be divided into two major part such as global and local time scale. With a collection of visual examples from this study, we demonstrate that this scheme may offer an effective tool for visually mining 3D timeline events of the ion trajectories. This work will potentially form a basis of a novel analysis tool for measuring the effectiveness of visual representation to assist physicist in identifying possible temporal association among complex and chaotic atom movements in ion trajectories.

关键词： spatial-temporal application colour scale coding theory visual representation

来源：评论

学校读者我要写书评

暂无评论

Tailoring inputs to achieve maximal neuronal firing

引用

JOURNAL OF MATHEMATICAL NEUROSCIENCE 2011年第2011期1卷 3-3页

作者： Wang, Jiaoyan Costello, Willie Rubin, Jonathan E. Beihang Univ Dept Dynam & Control Beijing 100191 Peoples R China Univ Toronto Dept Philosophy Toronto ON Canada Univ Pittsburgh Dept Math Pittsburgh PA 15260 USA

We consider the constrained optimization of excitatory synaptic input patterns to maximize spike generation in leaky integrate-and-fire (LIF) and theta model neurons. In the case of discrete input kicks with a fixed total magnitude, optimal input timings and strengths are identified for each model using phase plane arguments. In both cases, optimal features relate to finding an input level at which the drop in input between successive spikes is minimized. A bounded minimizing level always exists in the theta model and may or may not exist in the LIF model, depending on parameter tuning. We also provide analytical formulas to estimate the number of spikes resulting from a given input train. In a second case of continuous inputs of fixed total magnitude, we analyze the tuning of an input shape parameter to maximize the number of spikes occurring in a fixed time interval. Results are obtained using numerical solution of a variational boundary value problem that we derive, as well as analysis, for the theta model and using a combination of simulation and analysis for the LIF model. In particular, consistent with the discrete case, the number of spikes in the theta model rises and then falls again as the input becomes more tightly peaked. Under a similar variation in the LIF case, we numerically show that the number of spikes increases monotonically up to some bound and we analytically constrain the times at which spikes can occur and estimate the bound on the number of spikes fired.

关键词： NEURONS BOUNDARY value problems SIMULATION methods & models coding theory FUNCTIONS (Mathematics) MATHEMATICAL optimization

来源：评论

学校读者我要写书评

暂无评论

Abelian varieties in coding and cryptography

Abelian varieties in coding and cryptography

引用

IEEE Information theory Workshop (ITW)

作者： Blake, Ian F. Univ British Columbia Dept Elect & Comp Engn Vancouver BC V5Z 1M9 Canada

ISBN: (纸本)9781424482641

Algebraic curves over a finite field have played a central role in both coding theory and cryptography over the past three decades. In coding theory the use of algebraic curves led to the discovery of asymptotically good codes whose parameters lie above the Varshamov-Gilbert bound in certain cases while in cryptography the use of elliptic curves led to public key cryptosystems that are more efficient, in some sense, for a given level of security than integer factorization based ones. It would seem natural that the use of higher dimensional varieties might lead to even better results for both applications. Such has not so far been the case in any dramatic way. The purpose of this talk is to review the situation on the use of Abelian varieties in these two areas.

关键词： Abelian varieties Varshamov-Gilbert bound algebraic codes algebraic curves coding theory elliptic curves encoding integer factorization matrix decomposition public key cryptography public key cryptosystems

来源：评论

学校读者我要写书评

暂无评论

Non-binary LDPC-coded modulation for high-speed optical metro networks with backpropagation

Non-binary LDPC-coded modulation for high-speed optical metr...

引用

Conference on Optical Metro Networks and Short-Haul Systems II

作者： Arabaci, Murat Djordjevic, Ivan B. Saunders, Ross Marcoccia, Roberto M. Univ Arizona Dept Elect & Comp Engn 1230 E Speedway Blvd Tucson AZ 85721 USA Opnext Inc Los Gatos CA 95032 USA

ISBN: (纸本)9780819480170

To simultaneously mitigate the linear and nonlinear channel impairments in high-speed optical communications, we propose the use of non-binary low-density-parity-check-coded modulation in combination with a coarse backpropagation method. By employing backpropagation, we reduce the memory in the channel and in return obtain significant reductions in the complexity of the channel equalizer which is exponentially proportional to the channel memory. We then compensate for the remaining channel distortions using forward error correction based on non-binary LDPC codes. We propose non-binary-LDPC-coded modulation scheme because, compared to bit-interleaved binary-LDPC-coded modulation scheme employing turbo equalization, the proposed scheme lowers the computational complexity and latency of the overall system while providing impressively larger coding gains.

关键词： Optical metro networks optical communications backpropagation forward error correction (FEC) coding theory LDPC codes non-binary codes

来源：评论

学校读者我要写书评

暂无评论

Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate

Codes for Computationally Simple Channels: Explicit Construc...

引用

IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS)

作者： Guruswami, Venkatesan Smith, Adam Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA Penn State Univ Comp Sci & Engn Dept University Pk PA 16802 USA

ISBN: (纸本)9780769542447

In this paper, we consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter p and (b) the process which adds the errors can be described by a sufficiently "simple" circuit. Codes for such channel models are attractive since, like codes for standard adversarial errors, they can handle channels whose true behavior is unknown or varying over time. For three classes of channels, we provide explicit, efficiently encodable/decodable codes of optimal rate where only inefficiently decodable codes were previously known. In each case, we provide one encoder/decoder that works for every channel in the class. Unique decoding for additive errors: We give the first construction of a poly-time encodable/decodable code for additive (a.k.a. oblivious) channels that achieve the Shannon capacity 1 - H(p). List-decoding for online log-space channels: We give an efficient code with optimal rate (arbitrarily close to 1 H( p)) that recovers a short list containing the correct message with high probability for channels which read and modify the transmitted codeword as a stream, using at most O(log N) bits of workspace on transmissions of N bits. List-decoding for poly-time channels: For any constant c we give a similar list-decoding result for channels describable by circuits of size at most N-c, assuming the existence of pseudorandom generators.

关键词： Shannon capacity adversarial errors channel coding coding scheme coding theory communication complexity computationally bounded channel computationally bounded channels decoding error correction codes explicit constructions information theory list decoding message passing online logspace channel polytime encodable code pseudorandom generator pseudorandomness unique decoding

来源：评论

学校读者我要写书评

暂无评论

The syntactic structure of Locations, Goals, and Sources

引用

LINGUISTICS 2010年第5期48卷 1043-1081页

作者： Pantcheva, Marina University of Troms

In this article, I argue for a decomposition of the Path head in the syntactic structure for directional expressions. Based on crosslinguistic data showing that different types of paths are of different complexity and, crucially are subject to a morphological containment relationship, I propose a more detailed structure for directionals. I adopt the orthodox view that Goal paths are built on top of a locative Place projection. However, I suggest that Source paths are built on top of Goal paths. This is evidenced by the morphological makeup of Source-denoting elements in a variety of languages, where the Source marker morphologically contains the Goal marker Further, I explore the lexicalization of the decomposed Path structure I defend and test the predictions against the empirical domain of syncretisms between the spatial roles Source, Goal, and Location. I show that the decomposed Path structure and the lexicalization theory I adopt capture syncretism patterns that are widely attested among languages and ban those syncretism patterns that are unattested.

关键词： LINGUISTICS LANGUAGE & languages EXPRESSION SEMANTICS ENcoding AFFIXES (Grammar) ASYMMETRY (Linguistics) coding theory PERMUTATIONS

来源：评论

学校读者我要写书评

暂无评论

Machines that learn how to code open-ended survey data

引用

INTERNATIONAL JOURNAL OF MARKET RESEARCH 2010年第6期52卷 775-800页

作者： Esuli, Andrea Sebastiani, Fabrizio CNR Ist Sci & Tecnol Informaz I-56124 Pisa Italy

We describe an industrial-strength software system for automatically coding open-ended survey responses. The system is based on a learning metaphor, whereby automated verbatim coders are automatically generated by a general-purpose process that learns, from a user-provided sample of manually coded verbatims, the characteristics that new, uncoded verbatims should have in order to be attributed the codes in the codeframe. In this paper we discuss the basic workings of this software and present the results of experiments we have run on several datasets of real respondent data, in which we have compared the accuracy of the software against the accuracy of human coders.

关键词： CONSUMERS -- Attitudes COMPUTER software development MARKETING research SENTIMENT analysis CONSUMERS' preferences CONSUMER research CONSUMER science COMPUTATIONAL linguistics SURVEYS coding theory TEXT mining (Information retrieval) CONTENT analysis (Communication)

来源：评论

学校读者我要写书评

暂无评论

Knowledge Flows in Software Projects: An Empirical Investigation

引用

KNOWLEDGE AND PROCESS MANAGEMENT 2010年第4期17卷 205-220页

作者： Sandhawalia, Birinder Dalcherz, Darren Middlesex Univ London England

Software projects require tacit knowledge and shared contexts for creative problem solving. Existing knowledge management frameworks focus on codifying knowledge laying an emphasis on managing explicit knowledge, typically ignoring the tacit element. This research provides a framework that mobilises and integrates both tacit and explicit knowledge, and facilitates the flow of common knowledge to address unstructured situations in software projects. The framework is developed from empirical evidence gathered while conducting an extended case study at one of the world's largest software organisations. The research has implications for the knowledge management literature by establishing knowledge as something that is made resourceful by being competently mobilised and utilised, rather than by being managed through capture and storage. Thus, the paper attempts to fill a gap in the literature on a phenomenon that is increasingly becoming more relevant in empirical settings. Copyright (C) 2010 John Wiley & Sons, Ltd.

关键词： COMPUTER software PROBLEM solving KNOWLEDGE management EMPIRICAL research COMPUTER software industry CASE studies TACIT knowledge coding theory

来源：评论

学校读者我要写书评

暂无评论

Near‐Capacity Variable‐Length coding: Regular and Exit‐Chart‐Aided Irregular Designs

引用

2010年

作者： Lajos Hanzo FREng, FIEEE, FIET, DSc Robert G. Maunder BEng, PhD Jin Wang BE, ME, PhD Dr Lie‐Liang Yang BEng, PhD

ISBN: (数字)9780470666425

ISBN: (纸本)9780470665206

Recent developments such as the invention of powerful turbo-decoding and irregular designs, together with the increase in the number of potential applications to multimedia signal compression, have increased the importance of variable length coding (VLC). Providing insights into the very latest research, the authors examine the design of diverse near-capacity VLC codes in the context of wireless telecommunications. The book commences with an introduction to Information theory, followed by a discussion of Regular as well as Irregular Variable Length coding and their applications in joint source and channel coding. Near-capacity designs are created using Extrinsic Information Transfer (EXIT) chart analysis. The latest techniques are discussed, outlining radical concepts such as Genetic Algorithm (GA) aided construction of diverse VLC codes. The book concludes with two chapters on VLC-based space-time transceivers as well as on frequency-hopping assisted schemes, followed by suggestions for future work on the topic. Surveys the historic evolution and development of VLCs Discusses the very latest research into VLC codes Introduces the novel concept of Irregular VLCs and their application in joint-source and channel coding

关键词： coding theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：