期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
New algorithm for variable-rate linear broadcast network coding 被引量:1
1
作者 夏寅 张惕远 黄佳庆 《Journal of Central South University》 SCIE EI CAS 2011年第4期1193-1199,共7页
To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding ker... To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding kernels is to adjust heterogeneous network to possible link failures. Linear algebra, graph theory and group theory are applied to construct one series of global encoding kernels which are applicable to all source rates. The effectiveness and existence of such global encoding kernels are proved. Based on 2 information flow, the algorithm of construction is explicitly given within polynomial time O(|E| |T|.ω^2max), and the memory complexity of algorithm is O(|E|). Both time and memory complexity of this algorithm proposed can be O(ωmax) less than those of algorithms in related works. 展开更多
关键词 network coding variable-rate linear broadcast heterogeneous network code construction algorithm
在线阅读 下载PDF
Freights loading optimization with balanced and unconcentrated loading constraints
2
作者 朱向 雷定猷 张英贵 《Journal of Central South University》 SCIE EI CAS 2014年第8期3386-3395,共10页
The optimization of high density and concentrated-weight freights loading requires an even distribution of the freight's weight and unconcentrated loading on the floor of the car.Based on the characteristics of co... The optimization of high density and concentrated-weight freights loading requires an even distribution of the freight's weight and unconcentrated loading on the floor of the car.Based on the characteristics of concentrated-weight category freights,an improvement method is put forward to build freight towers and a greedy-construction algorithm is utilized based on heuristic information for the initial layout.Then a feasibility analysis is performed to judge if the balanced and unconcentrated loading constrains are reached.Through introducing optimization or adjustment methods,an overall optimal solution can be obtained.Experiments are conducted using data generated from real cases showing the effectiveness of our approach: volume utility ratio of 90.4% and load capacity utility ratio of 86.7% which is comparably even to the packing of the general freights. 展开更多
关键词 loading layout balancing constraint concentrated loading bending moment construction algorithm
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部