Forwarding and optical indices of 4-regular circulant networks

An all-to-all routing in a graph G is a set of oriented paths of G, with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing R is the number of times it is used (in either direction) by paths of R, and the maximum load of an edge is denoted by $\pi (G,R)$. The edge-forwarding index $\pi (G)$ is the minimum of $\pi (G,R)$ over all possible all-to-all routings R, and the arc-forwarding index $\overrightarrow{\pi }(G)$ is defined similarly by taking direction into consideration, where an arc is an ordered pair of adjacent vertices. Denote by $w(G,R)$ the minimum number of colours required to colour the paths of R such that any two paths having an edge in common receive distinct colours. The optical index $w(G)$ is defined to be the minimum of $w(G,R)$ over all possible R, and the directed optical index $\overrightarrow{w}(G)$ is defined similarly by requiring that any two paths having an arc in common receive distinct colours. In this paper we obtain lower and upper bounds on these four invariants for 4-regular circulant graphs with connection set $\{\pm 1,\pm s\}$, $1<s<n/2$. We give approximation algorithms with performance ratio a small constant for the corresponding forwarding index and routing and wavelength assignment problems for some families of 4-regular circulant graphs.     

制造云服务组合柔性的四维属性测度方法

云制造环境下服务资源进行动态组合时不可避免地遇到内、外部环境的不确定性,这些不确定性因素直接影响到制造云服务组合的执行成本、效率和质量。为了有效提升制造云服务组合的柔性,需要对其柔性能力进行测度。在假定某待选云服务集中的各服务资源能够以不同的效率替代完成任务的基础上,建立了考虑制造云服务组合柔性的效率柔性、冗余柔性、路径柔性和任务柔性的四维属性测度方法。最后,结合具体算例对该方法的应用过程进行了分析。     

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.     

基于主成分的改进雷达图及其在综合评价中的应用

本文从可视化角度出发,在总结传统可视化方法因优点与不足的基础上,将主成分分析、因子分析与雷达图结合,改进了传统的可视化方法。并将新的可视化方法引入到综合评价中,提出了一种基于雷达图面积的综合评价模型,实例验证该种方法切实有效。     

基于云理论的我国光伏产业产能过剩评估研究

基于云理论的评价方法,构建指标体系,利用云重心理论求出各指标的云模型,计算与理想状态向量的加权偏离度,以此衡量我国光伏产业产能过剩程度.该评价理论提高了评价结果的准确性,评价结果与实际情况吻合,表明该评价指标与评价方法具有较强的可操作性和科学性,并就此对光伏产业产能过剩的治理,提出了政策建议.     

云制造平台加工能力分享调度优化研究

云制造平台加工能力分享的调度优化是云制造模式的核心运营问题。为提高云制造平台对参与能力分享企业资源的利用率,解决实际云制造需求环境下企业级制造资源调度问题,达到云制造平台动态实时的要求,以最小化工期和成本为目标函数,构建了基于平台并面向分享的云加工能力调度模型。为快速求解多个云任务订单的最优调度序列,引入任务简易编码和随机权重,设计了改进的二阶粒子群算法,并提出可分享加工能力时间窗的更新策略。最后,通过算例验证云制造平台加工能力调度机制的可行性和有效性。     

基于云模型的三维土工网防护边坡侵蚀稳定性综合评价

在分析各项影响因素分级标准的基础上,建立了三维土工网护坡侵蚀稳定性的综合评价体系.针对三维土工网边坡侵蚀稳定性分析中不确定性问题,将云模型理论引入到综合评判中,实现了定性与定量的不确定性转换.通过构建前件云发生器和后件云发生器,利用不确定推理,确定各项评价指标的具体分值.借助层次分析法与敏感度分析确定各项评价指标的权重,进而得出综合评价体系的整体得分.工程实例计算结果证实了模型的实用性和有效性,为三维土工网防护边坡侵蚀稳定性的评价提供了一条新的途径.     

四阶累积量的MUSIC算法在海流测向中的应用

针对高频地波雷达系统OSMAR2000海流测向中海流元数不易估计的问题，利用四阶谱累积量MUSIC算法的空间谱结构特点，采用试探法确定信号源数并估计信号源的位置．通过对模拟海流和实测数据的处理实验表明，利用该算法可以较准确地估计出海流元的个数和方位，并且比传统MUSIC方法获得更小的角度估计方差，有效地反演了海洋表面流信息．     

基于幅度统计多分辨率分析的SAR图像灰度压缩

基于幅度统计多分辨率分析的原理，针对SAR图像特殊的显示要求，提出了一种新的灰度压缩方法，解决了常规灰度级压缩方法不能很好保持原始图像数据直方图分布的问题，实验结果表明该方法能有效保证灰度压缩前后图像数据直方图分布形状的一致性，较好地保持原始图像的视觉特征。