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

A Straight construction algorithm for a Delay Invariant Convolutional Network Coding on Cyclic Networks

IEEE ACCESS 2022年 10卷 102421-102431页

作者： Zhao, Xubo Li, Xiaoping China Univ Petr Coll Sci Qingdao 266580 Shandong Peoples R China

Delay invariant convolutional network codes (abbreviated DI-CNCs) can guarantee multicast communication at asymptotically optimal rates in networks with any delay profile. For a cyclic network, it has been shown that one can associate it with an acyclic network consisting of nodes in five layers, and the acyclic algorithm of F-linear multicast can be employed to construct a DI-F-CNC, as long as the field size is larger than the number of sinks in the cyclic network. In this paper, we present a directly feasible construction algorithm for a DI-F-CNC over a cyclic network. Complexity of code construction and theoretical guarantees of algorithm implementation are also investigated in detail. The advantage of the straight construction algorithm is that for an existing code, when some sink nodes and associated edges are added, our algorithm just modifies the new assigned coding coefficients in an efficient localized manner, without the necessity to construct again the code in its expanding network.

关键词： Network coding cyclic network delay invariant convolutional network codes construction algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel construction algorithm of the LDPC code for high-speed long-haul optical transmission systems

引用

OPTIK 2013年第18期124卷 3181-3186页

作者： Yuan Jianguo Xu Liang Jia Yuexing Tong Qingzhen Wang Yong Chongqing Univ Posts & Telecommun Key Lab Opt Fiber Commun Technol Chongqing 400065 Peoples R China

According to the transmission characteristics of high-speed long-haul optical transmission system, the main construction method of Low-Density Parity-Check (LDPC) code for optical transmission system is presented and a novel construction algorithm of LDPC code is proposed, the theoretical analysis shows that the parity check matrix of the LDPC code constructed by the proposed construction algorithm has no four-girth phenomenon, this is also theoretically proved out. Both the novel LDPC(3969,3720) code with 6.69% redundancy and the novel LDPC(8281,7920) code with 4.56% redundancy for optical transmission systems are constructed by using the presented construction method and proposed construction algorithm. The simulation results show that the net coding gain (NCG) of the two 'novel LDPC codes at the eighteenth iteration for the BER of 10(-12) are respectively 1.63 dB and 1.49 dB more than that of the RS(255,239) code in ITU-T G.975. Moreover, the decoding of the LDPC code in the hardware can parallel be implemented, so the decoding speed of the two novel LDPC codes are very rapid, the complexities of implementing the two novel LDPC codes, compared with the concatenated codes in ITU-T G.975.1, are relatively lower, furthermore, the hardware overhead and storage space can relatively be saved and the computation complexity can be reduced in implementing the hardware in the future. As a result, the two novel LDPC codes can better be suitable for high-speed long-haul optical transmission systems. (C) 2012 Elsevier GmbH. All rights reserved.

关键词： Low-Density Parity-Check (LDPC) code construction algorithm Net coding gain (NCG) Optical transmission system

来源：评论

学校读者我要写书评

暂无评论

A Hungarian penalty-based construction algorithm to minimize makespan and total flow time in no-wait flow shops

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2016年第0期98卷 373-383页

作者： Laha, Dipak Gupta, Jatinder N. D. Jadavpur Univ Dept Mech Engn Kolkata India Univ Alabama Coll Business Adm Huntsville AL 35899 USA

This paper presents a penalty-based construction algorithm for the no-wait flow shop scheduling problem with the objective of minimizing makespan and total flow time of jobs. The proposed method, derived from Hungarian penalty method originally used for the classic assignment problem is employed to generate an initial schedule of jobs, which is further improved by an insertion technique to obtain an optimal or near-optimal schedule. The results of computational experiments on a large number of test problems show that the proposed method performs significantly better than the state-of-the-art procedures while requiring comparable computational effort. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Scheduling No-wait flow shops Makespan Total flow time construction algorithm Hungarian penalty based heuristic Insertion heuristic Traveling salesman problem Optimization

来源：评论

学校读者我要写书评

暂无评论

An efficient basic convolutional network code construction algorithm on cyclic networks

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2013年第12期67卷 1072-1078页

作者： Zhao, Xubo Xidian Univ State Key Lab Integrated Serv Networks ISN Xian 710071 Peoples R China China Univ Petr Coll Sci Qingdao 266580 Peoples R China

Similar to acyclic networks, over cyclic networks, there also exist four classes of optimal convolutional network codes, which are referred to as basic convolutional network code (BCNC), convolutional dispersion (CD), convolutional broadcast (CB), and convolutional multicast (CM), respectively. And from the perspective of linear independence among the global encoding kernels (GEKs), BCNC is with the best strength. In this paper, we present an efficient construction algorithm for BCNC over cyclic networks. Our algorithm can positively provide the maximal required cardinality of the local encoding kernels (LEKs). Another advantage of this algorithm is that for an existing code, when some non-source nodes and associated edges are added, our algorithm can correspondingly modify the already assigned LEKs in a localized manner. And we can just reset the LEKs along some special flow paths educed by the added nodes and edges, rather than reconstructing the whole code in its expanding network. (C) 2013 Elsevier GmbH. All rights reserved.

关键词： Cyclic network Basic convolutional network coding Partial encoding kernel construction algorithm

来源：评论

学校读者我要写书评

暂无评论

A Neural Network construction algorithm which Maximizes the Likelihood Function

引用

Connection Science 1995年第2期7卷 147-166页

作者： Setiono, Rudy Department of Information Systems and Computer Science National University of Singapore Singapore 0511 Kent Ridge Singapore

A new method for constructing a feedforward neural network is proposed. The method starts with a single hidden unit and more units are added to the hidden layer one at a time until a network that completely recognizes all its input patterns is constructed. The novel idea about this method is that the network is trained to maximize a certain likelihood function and not to minimize the more widely used mean squared error function. We show that when a new hidden unit is added to the network, this likelihood function is guaranteed to increase and this increase ensures the finite termination of the method. We also provide a wide range of numerical results. The method was tested on the n-bit parity problems and the spiral problem. It was able to construct networks having less than n hidden units that solve the n-bit parity problems for n — 4, 5, 6, 7 and 8. The method was also tested on some real-world data and the networks it constructed were shown to be able to predict patterns not in the training set with more than 95% accuracy. © 1995, Taylor & Francis Group, LLC. All rights reserved.

关键词： construction algorithm Feedforward neural network maximum likelihood function quasi-Newton methods

来源：评论

学校读者我要写书评

暂无评论

Single-parameter estimation construction algorithm for Gm-APD ladar imaging through fog

引用

OPTICS COMMUNICATIONS 2021年 482卷 126558-126558页

作者： Liu, Di Sun, Jianfeng Gao, Shang Ma, Le Jiang, Peng Guo, Shihang Zhou, Xin Harbin Inst Technol Natl Key Lab Sci & Technol Tunable Laser Inst Optoelect Harbin 150001 Heilongjiang Peoples R China Sci & Technol Complex Syst Control & Intelligent Beijing 100074 Peoples R China

When imaging through fog using Geiger mode avalanche photon diode (Gm-APD) ladar, strong backscattering photons make it difficult to effectively extract an accurate target signal via the traditional peak-select algorithm. Single-parameter estimation (SPEA) is proposed in this paper to solve this problem. First, the physical properties of the gamma distribution model's characteristics are analyzed, and the model is improved based on Gm-APD ladar's counting characteristics. Next, a Monte Carlo simulation for photons propagating in fog is conducted. The SPEA's backscattering distribution has the highest correlation with the original backscattering photon distribution. Realistic imaging data are processed through fog, and the SPEA has the best recovering effect, achieving 71% recovery using 20,000 frames. This study demonstrates that the SPEA enables imaging through fog with Gm-APD ladar.

关键词： Gm-APD Imaging through fog Backscattering photon distribution model construction algorithm

来源：评论

学校读者我要写书评

暂无评论

An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays

引用

METRIKA 2007年第2期66卷 139-149页

作者： Angelopoulos, P. Evangelaras, H. Koukouvinos, C. Lappas, E. Natl Tech Univ Athens Dept Math GR-15773 Athens Greece

In this paper we present an effective algorithm for the construction and the identification of two-level nonisomorphic orthogonal arrays. Using this algorithm, we identify and list a full catalogue of nonisomorphic orthogonal arrays with parameters OA(24,7,2,t), OA(28,6,2,t) and OA(32,6,2,t), t >= 2. Some statistical properties of these designs are also considered.

关键词： orthogonal arrays isomorphism construction algorithm

来源：评论

学校读者我要写书评

暂无评论

construction of LDPC Codes for the Layered Decoding algorithm

引用

China Communications 2012年第7期9卷 99-107页

作者： Wang Da Dong Mingke Chen Chen Jin Ye Xiang Haige State Key Laboratory of Advanced Optical Communication Systems&Networks School of Electronics Engineering and Computer SciencePeking UniversityBeijing 100871P.R.China

Abstract： The layered decoding algorithm has been widely used in the implementation of Low Density Parity Check （LDPC） decoders, due to its high convergence speed. However, the pipeline operation of the layered decoder may introduce memory access conflicts, which heavily deteriorates the decoder throughput. To essentially deal with the issue of memory access conflicts,

关键词： LDPC codes construction algorithm PEG algorithm layered decoding algorithm memory access conflicts

来源：评论

学校读者我要写书评

暂无评论

Speeding-Up construction algorithms for the Graph Coloring Problem

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2022年第9期E105A卷 1241-1251页

作者： Kanahara, Kazuho Katayama, Kengo Tomita, Etsuji Okayama Univ Sci Dept Informat & Comp Engn Okayama 7000005 Japan Univ Electrocommun Adv Algorithms Res Lab Chofu Tokyo 1828585 Japan

The Graph Coloring Problem (GCP) is a fundamental combinatorial optimization problem that has many practical applications. Degree of SATURation (DSATUR) and Recursive Largest First (RLF) are well known as typical solution construction algorithms for GCP. It is necessary to update the vertex degree in the subgraph induced by uncolored vertices when selecting vertices to be colored in both DSATUR and RLF. There is an issue that the higher the edge density of a given graph, the longer the processing time. The purposes of this paper are to propose a degree updating method called Adaptive Degree Updating (ADU for short) that improves the issue, and to evaluate the effectiveness of ADU for DSATUR and RLF on DIMACS benchmark graphs as well as random graphs having a wide range of sizes and densities. Experimental results show that the construction algorithms with ADU are faster than the conventional algorithms for many graphs and that the ADU method yields significant speed-ups relative to the conventional algorithms, especially in the case of large graphs with higher edge density.

关键词： combinatorial optimization graph coloring problem construction algorithm DSATUR RLF

来源：评论

学校读者我要写书评

暂无评论

Research on Compressed Sensing Reconstruction algorithm in Complementary Space 17

Research on Compressed Sensing Reconstruction Algorithm in C...

引用

IEEE 17th International Conference on Communication Technology (ICCT)

作者： Liu Xinyue Zhao Zhigang Qingdao Univ Sch Comp Sci & Technol Qingdao Peoples R China

ISBN: (纸本)9781509039449

Complementary matching pursuit algorithm (CMP) is a complementary form of the matching pursuit algorithm (MP). The CMP algorithm eliminates N-1 mismatched atoms and retains the remaining matching atoms, thus achieving the purpose of selecting atoms. The existing orthogonal complementary matching algorithm (OCMP), which is an improved form of the complementary matching algorithm can more accurately reconstruct the signal. But the algorithm for increasing the orthogonal processing get only one atom per iteration so that the algorithm increases execution time. This paper proposes an algorithm to solve the above problem. The proposed algorithm which is based on the framework of complementary matching pursuit algorithm and combined the sparse adaptive matching pursuit algorithm selects multiple atoms by setting the iterative step size which is adjusted according to the execution of the algorithm. The proposed algorithm selects multiple atoms in each iteration so that it not only guarantees the reconstruction precision, but also reduces the running time of the algorithm. Experiments show that the proposed algorithm can reconstruct the signal in a shorter time and improve the reconstruction efficiency of the algorithm.

关键词： compressive sensing construction algorithm complementary matching variable step size sparsity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：