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

Spatiotemporal network coding of physiological mossy fiber inputs by the cerebellar granular layer

PLOS COMPUTATIONAL BIOLOGY 2017年第9期13卷 e1005754-e1005754页

作者： Sudhakar, Shyam Kumar Hong, Sungho Raikov, Ivan Publio, Rodrigo Lang, Claus Close, Thomas Guo, Daqing Negrello, Mario De Schutter, Erik Okinawa Inst Sci & Technol Computat Neurosci Unit Onna Son Okinawa Japan Univ Antwerp Lab Theoret Neurobiol & Neuroengn Antwerp Belgium Univ Michigan Dept Psychol Ann Arbor MI USA Bernstein Ctr Computat Neurosci Berlin Berlin Germany Erasmus MC Dept Neurosci Rotterdam Netherlands

The granular layer, which mainly consists of granule and Golgi cells, is the first stage of the cerebellar cortex and processes spatiotemporal information transmitted by mossy fiber inputs with a wide variety of firing patterns. To study its dynamics at multiple time scales in response to inputs approximating real spatiotemporal patterns, we constructed a largescale 3D network model of the granular layer. Patterned mossy fiber activity induces rhythmic Golgi cell activity that is synchronized by shared parallel fiber input and by gap junctions. This leads to long distance synchrony of Golgi cells along the transverse axis, powerfully regulating granule cell firing by imposing inhibition during a specific time window. The essential network mechanisms, including tunable Golgi cell oscillations, on-beam inhibition and NMDA receptors causing first winner keeps winning of granule cells, illustrate how fundamental properties of the granule layer operate in tandem to produce (1) well timed and spatially bound output, (2) a wide dynamic range of granule cell firing and (3) transient and coherent gating oscillations. These results substantially enrich our understanding of granule cell layer processing, which seems to promote spatial group selection of granule cell activity as a function of timing of mossy fiber input.

关键词： SPATIOTEMPORAL processes linear network coding GOLGI apparatus GRANULE cells CEREBELLAR cortex

来源：评论

学校读者我要写书评

暂无评论

network coding-based block acknowledgement scheme for wireless regenerative relay networks

引用

IET COMMUNICATIONS 2012年第16期6卷 2593-2601页

作者： Vien, Q. -T. Nguyen, H. X. Choi, J. Stewart, B. G. Tianfield, H. Glasgow Caledonian Univ Sch Engn & Built Environm Glasgow G4 0BA Lanark Scotland Middlesex Univ Sch Sci & Technol London NW4 4BT England Swansea Univ Sch Engn Swansea SA2 8PP W Glam Wales

This paper is concerned with block acknowledgement (ACK) mechanisms in wireless regenerative relay networks. In an N-relay network, a total of (2N + 1) block ACK packets is required to acknowledge the data transmission between source and destination nodes via the N-relay nodes. In this paper, the authors propose a block ACK scheme based on network coding (NC) to significantly reduce the ACK overheads by N block ACK packets. In addition, this achieves a reduction of N(N-1) computational operators. Particularly, we derive the error probability of the determination of the packets to be retransmitted at the source and relays, which shows that the NC-based scheme also improves the reliability of block ACK transmissions. Furthermore, asymptotic signal-to-noise (SNR) scenarios for forward links are considered and a general expression of error probability in multi-relay networks is derived for each SNR scenario. Finally, simulation results are presented to verify the analytical findings and demonstrate a lower number of data retransmissions for a higher system throughput.

关键词： linear network coding RELAY control systems WIRELESS communication systems DATA transmission systems ERROR probability

来源：评论

学校读者我要写书评

暂无评论

network coding in Node-Constrained Line and Star networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第7期57卷 4452-4468页

作者： Yazdi, S. M. Sadegh Tabatabaei Savari, Serap A. Kramer, Gerhard Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA Alcatel Lucent Bell Labs Murray Hill NJ 07974 USA

Line and star networks with both node and edge constraints are studied in the network coding framework. For line networks, the capacity region of the general multiple multicast problem is established. The coding theorem is based on a binary linear coding scheme, while the converse requires new upper bounds that improve on standard cut-based bounds. For star networks, the multiple unicast problem is examined. Capacity upper bounds are derived and a simple linear coding scheme is proposed which is based on the combinatorial optimization problem of cycle packing in directed graphs. The optimality of this scheme is established for a broad class of demands. The connection of node-constrained network coding in star networks, and index coding with side information is discussed and used to partially characterize the optimal linear code for general rates.

关键词： Index coding line network linear network coding network coding node-constrained network star network

来源：评论

学校读者我要写书评

暂无评论

Intrablock Interleaving for Batched network coding With Blockwise Adaptive Recoding

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY

引用

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY 2021年第4期2卷 1135-1149页

作者： Yin, Hoover H. F. Ng, Ka Hei Zhong, Allen Z. Yeung, Raymond W. Yang, Shenghao Chan, Ian Y. Y. N Hop Technol Ltd Hong Kong Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Peoples R China Chinese Univ Hong Kong Dept Phys Hong Kong Peoples R China Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China Ctr Perceptual & Interact Intelligence Ltd Hong Kong Peoples R China Chinese Univ Hong Kong Shenzhen Sch Sci & Engn Shenzhen 518172 Peoples R China Chinese Univ Hong Kong Shenzhen Shenzhen Key Lab IoT Intelligent Syst & Wireless Shenzhen 518172 Peoples R China Shenzhen Res Inst Big Data Shenzhen 518172 Peoples R China Chinese Univ Hong Kong Dept Econ Hong Kong Peoples R China

Batched network coding (BNC) is a low-complexity solution to network transmission in multi-hop packet networks with packet loss. BNC encodes the source data into batches of packets. As a network coding scheme, the intermediate nodes perform recoding on the received packets belonging to the same batch instead of just forwarding them. A recoding scheme that may generate more recoded packets for batches of a higher rank is also called adaptive recoding. Meanwhile, in order to combat burst packet loss, the transmission of a block of batches can be interleaved. Stream interleaving studied in literature achieves the maximum separation among any two consecutive packets of a batch, but permutes packets across blocks and hence cannot bound the buffer size and the latency. To resolve the issue of stream interleaver, we design an intrablock interleaver for adaptive recoding that can preserve the advantages of using a block interleaver when the number of recoded packets is the same for all batches. We use potential energy in classical mechanics to measure the performance of an interleaver, and propose an algorithm to optimize the interleaver with this performance measure. Our problem formulation and algorithm for intrablock interleaving are also of independent interest.

关键词： linear network coding adaptive recoding batched network codes interleaving

来源：评论

学校读者我要写书评

暂无评论

A Unified Adaptive Recoding Framework for Batched network coding

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY

引用

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY 2021年第4期2卷 1150-1164页

作者： Yin, Hoover H. F. Tang, Bin Ng, Ka Hei Yang, Shenghao Wang, Xishi Zhou, Qiaoqiao Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China N Hop Technol Ltd Hong Kong Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Peoples R China Nanjing Univ Natl Key Lab Novel Software Technol Nanjing 210008 Peoples R China Hohai Univ Key Lab Water Big Data Technol Minist Water Resources Nanjing 211100 Peoples R China Hohai Univ Sch Comp & Informat Nanjing 211100 Peoples R China Chinese Univ Hong Kong Dept Phys Hong Kong Peoples R China Chinese Univ Hong Kong Shenzhen Sch Sci & Engn Shenzhen 518172 Peoples R China Chinese Univ Hong Kong Shenzhen Shenzhen Key Lab IoT Intelligent Syst & Wireless Shenzhen 518172 Peoples R China Shenzhen Res Inst Big Data Shenzhen 518172 Peoples R China Natl Univ Singapore Sch Comp Dept Comp Sci Singapore Singapore

Batched network coding is a variation of random linear network coding which has low computational and storage costs. In order to adapt to random fluctuations in the number of erasures in individual batches, it is not optimal to recode and transmit the same number of packets for all batches. Different distributed optimization models, which are called adaptive recoding schemes, were formulated for this purpose. The key component of these optimization problems is the expected value of the rank distribution of a batch at the next network node, which is also known as the expected rank. In this paper, we put forth a unified adaptive recoding framework with an arbitrary recoding field size. We show that the expected rank functions are concave when the packet loss pattern is a stationary stochastic process, which covers but not limited to independent packet loss and Gilbert-Elliott packet loss model. Under this concavity assumption, we show that there always exists a solution which not only can minimize the randomness on the number of recoded packets but also can tolerate rank distribution errors due to inaccurate measurements or limited precision of the machine. We provide an algorithm to obtain such an optimal solution, and propose tuning schemes that can turn any feasible solution into a desired optimal solution.

关键词： linear network coding adaptive recoding batched network codes inner codes expected rank functions random matrices

来源：评论

学校读者我要写书评

暂无评论

Multi-objective evolutionary approach to coding-link cost trade-offs in network coding

引用

ELECTRONICS LETTERS 2012年第25期48卷 1595-1596页

作者： Ahn, C. W. Yoo, J. -C. Sungkyunkwan Univ Coll Informat & Commun Engn Suwon 440746 South Korea

Presented is a multi-objective evolutionary network coding algorithm which jointly handles the coding cost and link cost while achieving the target multicast rate in network coding. To this end, a generalised multi-objective fitness function is formulated first. A modified non-dominated sorting scheme is then developed to account for the unequal importance of the two objectives. Lastly, a diversity-preserving crowding method is devised to maintain the diversity of solutions in both the objective and decision spaces. The experimental results demonstrate the effectiveness of the proposed approach.

关键词： linear network coding network performance (Telecommunication) EVOLUTIONARY algorithms MULTICASTING (Computer networks) MULTICASTING protocols

来源：评论

学校读者我要写书评

暂无评论

Security against passive attacks on network coding system - A survey

引用

COMPUTER networkS 2018年第Jun.19期138卷 57-76页

作者： Liu, Yantao Morgan, Yasser Bohai Univ Jinzhou Peoples R China Univ Regina Regina SK Canada

network coding is a progressive information dissemination technology for network communications. Since its emergence at the turn of the millennium, network coding has reached more and more applications. In this survey article, we present a comprehensive review of the researches on secure network coding against passive attack. Studies in this area address problems such as: "If an eavesdropper can wiretap a few packets from a network coding system, how should the system be designed to protect useful information from being divulged?" According to protection strength, we establish a security hierarchy with four grades for network coding systems. For each grade, we collect and investigate existing schemes extensively. The essence of each scheme is expounded, such as key ideas, encryptions, or precoding matrix constructions, etc. Especially, the hardship of cryptanalysis is emphasized. Moreover, advantages and disadvantages are evaluated and compared between these schemes. In spite of single source networks, studies on theoretical possibilities and practical techniques for multisource networks are covered. Countermeasures against traffic analysis attacks are included. Finally, we suggest several open problems and promising methods for the future study. (C) 2018 Elsevier B.V. All rights reserved.

关键词： network security Passive attack Wiretap linear network coding

来源：评论

学校读者我要写书评

暂无评论

Optimal time allocation for two-way relay channel using physical-layer network coding

引用

IET COMMUNICATIONS 2014年第14期8卷 2469-2475页

作者： Cho, Dae-Soon Shim, Yeonggyu Park, Hyuncheol Korea Adv Inst Sci & Technol Dept Informat & Commun Engn Taejon 305701 South Korea ETRI Taejon 305700 South Korea Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305701 South Korea

This study proposes an optimal time allocation scheme for two-way relay channel (TWRC) using the physical-layer network coding (PNC). In other words, this study analytically determines the optimal transmit time durations for the first and the second time slot, which maximise the achievable sum rate under a sum time constraint for a given squared magnitude of the channel coefficients and transmit power values. Numerical results show that the achievable sum rate for the proposed optimal time allocation is greater than or equal to that for equal time allocation.

关键词： linear network coding ELECTRIC power transmission SCHEDULING RELAYING (Electric power systems) NUMERICAL analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient combination of polynomial time algorithm and subtree decomposition for network coding

引用

IET COMMUNICATIONS 2015年第17期9卷 2147-2152页

作者： Liu, Yantao Morgan, Yasser Bohai Univ Coll Engn Jinzhou Peoples R China Univ Regina Fac Engn & Appl Sci Regina SK S4S 0A2 Canada

Aiming at the inefficiency of polynomial time algorithm of linear network coding (NC) for multicast applications, the authors propose an improved algorithm which combines polynomial time algorithm with subtree decomposition. The algorithm is composed of five steps, including line graph transforming, subtree decomposition, static subtree set generating, assigning of global coding vector, and calculation of local coding vector. Subtree decomposition decreases network scale and coding complexity steeply, so it is an efficient algorithm of linear NC for multicast. An example is given to illustrate the implementation of the algorithm. Detailed analysis to algorithm complexity and a group of numerical experiments are made to show the efficiency of the algorithm.

关键词： trees (mathematics) network coding linear codes multicast communication polynomial time algorithm subtree decomposition linear network coding multicast application graph transforming static subtree set generation global coding vector assignment local coding vector calculation

来源：评论

学校读者我要写书评

暂无评论

Broadcasting with hard deadlines in wireless multihop networks using network coding

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2015年第5期15卷 983-999页

作者： Ostovari, Pouya Khreishah, Abdallah Wu, Jie Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA

Broadcasting with network coding mixes packets to minimize the number of transmissions, which improves the energy efficiency of wireless networks. On the other hand, delaying the transmissions increases coding opportunities at intermediate nodes, but increases the delay of packets. In this paper, we consider these two contradicting factors and study the problem of minimizing the number of transmissions in wireless networks while meeting the deadline constraints. We show that this problem is NP-complete;therefore, we provide a heuristic to solve it. First, we construct broadcasting trees, each of them rooted at one source. We then specify overlapping conditions based on the constructed trees, to determine the number of transmissions each node has to perform without the deadline constraints. Then, we partition the set of packets such that coding is performed among the packets of the same partition, which does not result in deadline misses. linear coding may not be applicable in some wireless networks because of its computational complexity. For these networks, we propose three XOR coding approaches, which rely only on local neighborhood information. Simulation results show that our techniques not only reduce the number of transmissions but also allow the majority of nodes to receive the packets on time. Copyright (c) 2013 John Wiley & Sons, Ltd.

关键词： broadcasting broadcast tree linear network coding local XOR coding energy efficiency deadline partial dominant pruning NP-completeness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：