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

IEEE Symposium on Computers and Communications (ISCC)

作者： Bing Zhu Kenneth W. Shum Hui Li Shuo-Yen Robert Li Shenzhen Eng. Lab of Converged Networks Technology Peking University Institute of Network Coding Chinese University of Hong Kong Department of Information Engineering Chinese University of Hong Kong

Fractional repetition (FR) codes are a family of storage codes that provide efficient node repair at the minimum bandwidth regenerating point. Specifically, the repair process is exact and uncoded, but table-based. Existing constructions of FR codes are primarily based on combinatorial designs such as Steiner systems, resolvable designs, etc. In this paper, we present a new explicit construction of FR codes, which adopts the theory of uniform group divisible designs, termed GDDFR codes. Our codes achieve the storage capacity of random access and are available for a wide range of parameters. In addition, our techniques allow for constructing FR codes with parameters that are not covered by Steiner systems, which answers an open question put forward in prior work.

关键词： Maintenance engineering Decision support systems Educational institutions Bandwidth Complexity theory Equations Network coding

来源：评论

学校读者我要写书评

暂无评论

New MDS array code correcting multiple disk failures

New MDS array code correcting multiple disk failures

引用

2014 IEEE Global Communications Conference

作者： Hanxu Hou Kenneth W. Shum Minghua Chen Hui Li Shenzhen Eng. Lab of Converged Networks Technology Peking University Shenzhen Graduate School Department of Information Engineering The Chinese University of Hong Kong Institute of Network Coding Shenzhen Key Lab. of Network Coding Key Tech. and Application China

ISBN: (纸本)9781479935130

We present a new family of maximal-distance separable (MDS) array codes which can tolerate five disk failures. The encoding is based on bit-wise exclusive OR (XOR) and bit-wise cyclic shifts, and hence is amenable to practical implementation. Efficient repair method for correcting up to two disk failures is also given. The proposed coding scheme provides a larger spectrum of parameters, with comparable encoding and repairing complexities in compare with existing MDS array codes, such as the row-diagonal parity (RDP) code and the EVENODD code.

关键词： Arrays Polynomials Encoding Complexity theory Maintenance engineering Memory Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Fast Phase Retrieval and IQ Impairments Compensation of Twin-SSB Signal in Direct Detection System

Fast Phase Retrieval and IQ Impairments Compensation of Twin...

引用

2023 Opto-Electronics and Communications Conference, OECC 2023

作者： Cui, Xiuquan Yang, Yanfu Wang, Jianyu Fan, Linsheng Wu, Qi Harbin Institute of Technology Department of Electronic and Information Engineering Shenzhen518055 China Shanghai Jiao Tong University State Key Lab of Advanced Communication Systems and Networks Department of Electronic Engineering Shanghai200240 China

We propose a modified carrier-assisted phase retrieval (MCCA-PR) scheme based on Gerchberg-Saxton (GS) algorithm to reconstruct a twin-SSB signal fast, then compensate the transmitter IQ impairments with a widely line... 详细信息

ISBN: (纸本)9781665462136

关键词： Equalizers

来源：评论

学校读者我要写书评

暂无评论

General Self-repairing Codes for Distributed Storage Systems

General Self-repairing Codes for Distributed Storage Systems

引用

IEEE International Conference on Communications

作者： Hanxu Hou Hui Li Kenneth W. Shum Shenzhen Eng. Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Tech. and App. Shenzhen Graduate School Peking University Shenzhen China Institute of Network Coding The Chinese University of Hong Kong Shatin Hong Kong

In distributed storage systems, a data file is encoded and distributed to storage nodes, such that the data file can be recovered from some subsets of the nodes. Upon the failure of a storage node, we want to repair it efficiently by contacting and downloading some encoded bits from a small number of surviving nodes. Using projective-geometric self-repairing codes (PSRC), proposed by Oggier and Datta, one can repair a failed node by contacting only two nodes. However, in their construction, the number of storage nodes in the storage system is a large number, and thus the storage efficiency is low. In this paper, we investigate how to be more flexible in the number of storage nodes. The proposed code in this paper is called general projective geometric self-repairing codes (GPSRC). GPSRC reduces high redundancy of PSRC, while retains the basic property of PSRC. We present some methods for repairing a failed node, in which the number of contacted surviving nodes is flexible. These repairing methods provide tradeoff between repair-degree and repair-bandwidth.

关键词： Maintenance engineering Vectors Encoding Finite element analysis Bandwidth Galois fields Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Regenerating codes over a binary cyclic code

Regenerating codes over a binary cyclic code

引用

IEEE International Symposium on Information Theory

作者： Kenneth W. Shum Hanxu Hou Minghua Chen Huanle Xu Hui Li Institute of Network Coding the Chinese University of Hong Kong Department of Information Engineering the Chinese University of Hong Kong Shenzhen Eng. Lab of Converged Networks Tech. Peking University Shenzhen Graduate School

ISBN: (纸本)9781479951871

We present a design framework of regenerating codes for distributed storage systems which employ binary additions and bit-wise cyclic shifts as the basic operations. The proposed coding method can be regarded as a concatenation coding scheme with the outer code being a binary cyclic code, and the inner code a regenerating code utilizing the binary cyclic code as the alphabet set. The advantage of this approach is that encoding and repair of failed node can be done with low computational complexity. It is proved that the proposed coding method can achieve the fundamental tradeoff curve between the storage and repair bandwidth asymptotically when the size of the data file is large.

关键词： Maintenance engineering Encoding Polynomials Computational complexity Bandwidth Parity check codes Vectors

来源：评论

学校读者我要写书评

暂无评论

NPM: An Anti-attacking Analysis Model of the MTD system Based on Martingale Theory

NPM: An Anti-attacking Analysis Model of the MTD system Base...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Xin Yang Hui Li Han Wang Shenzhen Key Lab of Information Theory & Future Network Arch Future Network PKU Lab of National Major Research Infrastructure PKU Inst.of Big Data Technology Shenzhen Engineering Lab of Converged Networking Technology Huawei & PKU Jointly Engineering Lab of Future Network Based on SDN School of Electronic and Computer Engineering Peking University Shenzhen China

Moving target defense (MTD) techniques are effective solutions to improve the network security by continuously reconfiguring the system setting. On the other hand, continuously transforming also increase the cost of defenders, so it is important to analyze the effectiveness of MTDs compared with their cost. Current researches lack of analyzing the effectiveness by mathematical theory compared with analyzing by experiment. Motivated by the above, we propose a novel three-dimension model named NPM jointly use N-version programming, Poisson process, Markov chain and martingale theory to analyze the effectiveness of the proposed MTD model. Our analysis points out the difficulty for a successful adversary to defeat the MTD system, which is related to the system configuration, such as the number of executors and the judgment criterion in every node, the transforming period and rang of system MTD transformation. Finally, we give advices on the design of the system in the daily defense and the attacked defense, with the goal of guaranteeing security with minimal cost.

关键词： Security Analytical models Programming Markov processes Mathematical model Computers Computational modeling

来源：评论

学校读者我要写书评

暂无评论

BASIC regenerating code: Binary addition and shift for exact repair

BASIC regenerating code: Binary addition and shift for exact...

引用

IEEE International Symposium on Information Theory

作者： Hanxu Hou Kenneth W. Shum Minghua Chen Hui Li Peking University Beijing Beijing CN Institute of Network Coding Chinese University of Hong Kong Hong Kong China Department of Information Engineering Chinese University of Hong Kong Hong Kong China Shenzhen Engineering Laboratory of Converged Networks Technology Shenzhen Key Laboratory of Cloud Computing Technology and App. Shenzhen Graduate School Peking University Shenzhen China

ISBN: (纸本)9781479904440

Regenerating code is a class of storage codes that achieve the optimal trade-off between storage capacity and repair bandwidth, which are two important performance metrics in data storage systems. However, existing constructions of regenerating codes rely on expensive computational operations such as finite field multiplication. The high coding and repair complexity limit their applications in large-scale practical storage systems. In this paper, we show that it is possible to achieve the full potential of regenerating codes with low computational complexity. In particular, we propose a new class of regenerating codes, called BASIC codes, that can achieve two specific points (i.e., minimum-bandwidth and minimum-storage regenerating points) on the storage and repair bandwidth trade-off curve, using only binary addition and shift operations in the coding and repair processes. Although in this paper we focus on constructing and analyzing BASIC codes for two specific exact-repair settings, our framework can be generalized to develop BASIC codes for more general exact- and functional-repair regenerating codes.

关键词： Maintenance engineering Encoding Polynomials Vectors Symmetric matrices Bandwidth Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A NOVEL FRAMEWORK OF ONLINE NETWORK CODING FOR MULTICAST SWITCHES WITH CONSTRAINED BUFFERS

引用

Journal of Electronics(China) 2011年第4期28卷 460-467页

作者： Wang Wei Yu Li Zhu Guangxi Li Hui Wuhan National Laboratory for Optoelectronics Division of Communiction ＆ Intelligent NetworksDepartment of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China Shenzhen Key Lab of Cloud Computing Technology ＆ Application Shenzhen Graduate School Peking University Shenzhen 518055 China

Network coding is able to address output conflicts when fanout splitting is allowed for multicast ***,it successfully achieves a larger rate region than non-coding approaches in crossbar ***,network coding requires large coding buffers and a high computational cost on encoding and *** this paper,we propose a novel Online Network Coding framework called Online NC for multicast switches,which is adaptive to constrained ***,it enjoys a much lower decoding complexity by a Vandermonde matrix based approach,as compared to conven-tional randomized network coding Our approach realizes online coding with one coding algo-rithm that synchronizes buffering and ***,we significantly reduce requirements on buffer space,while also sustaining high *** confirm the superior advantages of our contributions using empirical studies.

关键词： Packet switching Multicast Network coding Vandermonde matrix

来源：评论

学校读者我要写书评

暂无评论

A novel framework of online network coding for multicast switches with constrained buffers

引用

Journal of Electronics 2011年第4期28卷 460-467页

作者： Wang, Wei Yu, Li Zhu, Guangxi Li, Hui Wuhan National Lab. for Optoelectronics Division of Communiction and Intelligent Networks Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China Shenzhen Key Lab of Cloud Computing Technology and Application Shenzhen Graduate School Peking University Shenzhen 518055 China Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China

Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching. Hence, it successfully achieves a larger rate region than non-coding approaches in crossbar switches. However, network coding requires large coding buffers and a high computational cost on encoding and decoding. In this paper, we propose a novel Online Network Coding framework called Online NC for multicast switches, which is adaptive to constrained buffers. Moreover, it enjoys a much lower decoding complexity O(n ²) by a Vandermonde matrix based approach, as compared to conventional randomized network coding O(n ³). Our approach realizes online coding with one coding algorithm that synchronizes buffering and coding. Therefore, we significantly reduce requirements on buffer space, while also sustaining high throughputs. We confirm the superior advantages of our contributions using empirical studies. © 2011 Science Press, Institute of Electronics, CAS and Springer-Verlag Berlin Heidelberg.

关键词： Multicast Network coding Packet switching Vandermonde matrix

来源：评论

学校读者我要写书评

暂无评论

Variational Inverting Network for Statistical Inverse Problems of Partial Differential Equations

引用

Journal of Machine Learning Research 2023年第1期24卷 1-60页

作者： Jia, Junxiong Wu, Yanni Li, Peijun Meng, Deyu School of Mathematics and Statistics Xi’an Jiaotong University Xi’an710049 China Department of Mathematics Purdue University West LafayetteIN47907 United States School of Mathematics and Statistics Ministry of Education Key Lab of Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China Peng Cheng Laboratory Guangdong Shenzhen518066 China Macau Institute of Systems Engineering Macau University of Science and Technology Taipa 999078 China

To quantify uncertainties in inverse problems of partial differential equations (PDEs), we formulate them into statistical inference problems using Bayes’ formula. Recently, well-justified infinite-dimensional Bayesian analysis methods have been developed to construct dimension-independent algorithms. However, there are three challenges for these infinite-dimensional Bayesian methods: prior measures usually act as regularizers and are not able to incorporate prior information efficiently;complex noises, such as more practical non-i.i.d. distributed noises, are rarely considered;and time-consuming forward PDE solvers are needed to estimate posterior statistical quantities. To address these issues, an infinite-dimensional inference framework has been proposed based on the infinite-dimensional variational inference method and deep generative models. Specifically, by introducing some measure equivalence assumptions, we derive the evidence lower bound in the infinite-dimensional setting and provide possible parametric strategies that yield a general inference framework called the Variational Inverting Network (VINet). This inference framework can encode prior and noise information from learning examples. In addition, relying on the power of deep neural networks, the posterior mean and variance can be efficiently and explicitly generated in the inference stage. In numerical experiments, we design specific network structures that yield a computable VINet from the general inference framework. Numerical examples of linear inverse problems of an elliptic equation and the Helmholtz equation are presented to illustrate the effectiveness of the proposed inference framework. ©2023 Junxiong Jia, Yanni Wu, Peijun Li, Deyu Meng.

关键词： Helmholtz equation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：