基于Dempster-Shafer证据理论的信任评估模型

从网格的动态性、分布性、不确定性等特征出发,参考社会学的人际信任关系结构,提出了一种基于Dempster-Shafer证据理论（简称D-S理论）的信任评估模型．该模型根据网格节点间的历史交易记录,给出“直接信任”的形式化描述,建立网格节点信任推荐机制,并利用D-S理论对证据进行组合,从而得到“间接信任”．然后将直接信任和间接信任进一步组合为“综合信任”,从而有效实现信任信息的融合．将本文提出的信任度评估方法应用到调度算法中,结果证明了该信任模型的可行件和实用件．     

The non-approximability of bicriteria network design problems

Let G be an undirected graph with two edge costs (c-cost and d-cost). We want to minimize the diameter of a spanning subgraph S (under d-cost) subject to the constraint that the total cost of the edges in S (with respect to c) does not exceed a given budget. We prove that this problem is non-approximable, even in some special cases. Similar results are proved if the stretch factor or the root stretch factor is considered instead of the diameter.     

Minimum cost multiflows in undirected networks

LetN = (G, T, c, a) be a network, whereG is an undirected graph,T is a distinguished subset of its vertices (calledterminals), and each edgee ofG has nonnegative integer-valuedcapacity c(e) andcost a(e). Theminimum cost maximum multi(commodity)flow problem (*) studied in this paper is to find ac-admissible multiflowf inG such that: (i)f is allowed to contain partial flows connecting any pairs of terminals, (ii) the total value off is as large as possible, and (iii) the total cost off is as small as possible, subject to (ii). This generalizes, on one hand, the undirected version of the classical minimum cost maximum flow problem (when |T| = 2), and, on the other hand, the problem of finding a maximum fractional packing ofT-paths (whena 0). Lovász and Cherkassky independently proved that the latter has a half-integral optimal solution.A pseudo-polynomial algorithm for solving (*) has been developed earlier and, as its consequence, the theorem on the existence of a half-integral optimal solution for (*) was obtained. In the present paper we give a direct, shorter, proof of this theorem. Then we prove the existence of a half-integral optimal solution for the dual problem. Finally, we show that half-integral optimal primal and dual solutions can be designed by a combinatorial strongly polynomial algorithm, provided that some optimal dual solution is known (the latter can be found, in strongly polynomial time, by use of a version of the ellipsoid method).This work was partially supported by Chaire municipale, Mairie de Grenoble, France.     

度量空间的k－映射像

Ｅ．Ｈａｌｆａｒ（［６］）引入了ｋ－映射概念，本文给出了度量空间ｋ－映像的一个内在刻划，并由此得到一些度量化定理。     

Network analysis of eigenvalue problem for multilayer dielectric waveguide consisting of arbitrary number of layers

In this paper, the eigenvalue problem of a multilayer dielectric waveguide consisting of arbitrary number of layers is solved by the microwave network method. A general program with the function of computer graphics has been developed for analyzing the dispersion characteristics and the electromagnetic field distributions of an N layer dielectric waveguide. As examples of practical applications of the program, first, the dispersions and field patterns for the planar waveguides with refractive index of parabolic and exponential profiles are analyzed. Secondly, the procedure of mode conversion and mode separation in dielectric branching waveguides is vividly demonstrated through analyzing the field distributions of asymmetric multilayer dielectric structures and the general rules of mode conversion are discussed. The examples show that the present method possesses the advantages of versatility, rapidity, simplicity and accuracy.     

Enhanced Optical Image Verification Based on Joint Transform Correlator Adopting Fourier Hologram

In this paper two new architectures for optical image verification are proposed. Both architectures are based on conventional joint transform correlators (JTCs) adopting a Fourier hologram and can significantly improve the recovered image quality. First, an input phase-only function is Fourier transformed and then interferes with a reference wave that is diffracted from a plane wave incident on another random phase mask. Second, two phase-only functions are placed at the two input sides of a beamsplitter such that the interference pattern of their Fourier transforms can be detected. To obtain a predefined target image in the output plane, one of the input phase functions is iteratively retrieved by the use of the projection onto constraint sets algorithm. Simulation results show that the less mean squared error and better image quality are obtained for both the binary and grayscale images.     

Quantum secret sharing between multiparty and multiparty with four states

A protocol of quantum secret sharing between multiparty and multiparty with four states was presented. It was shown that this protocol can nullify the Trojan horse attack with a multi-photon signal, the fake-signal attack with Einstein-Podolsky-Rosen pairs, the attack with single photons, and the attack with invisible photons. In addition, the upper bounds of the average success probabilities were given for dishonest agent eavesdropping encryption using the fake-signal attack with any two-particle entangled states. Supported by the National Natural Science Foundation of China (Grant No. 10671054), the Key Project of Science and Technology Research of Education Ministry of China (Grant No. 207011) and the Natural Science Foundation of Hebei Province, China (Grant Nos. A2005000140 and 07M006)     

国家关键基础设施电磁恢复力

随着国家关键基础设施建设规模和信息化水平的提升,其在高空电磁脉冲、有意电磁干扰和地磁暴等强电磁环境下的电磁安全逐渐受到了国内外的关注。强电磁环境属于小概率、高风险事件,其影响机理和评估方法与雷电、系统内过电压等常规电磁事件有较大不同,采用期望风险指标的常规可靠性分析方法难以有效评估管理强电磁环境相关风险。从电磁恢复力视角出发,提出了关键基础设施电磁安全的三棱锥模型,并重点以电网为例,探讨关键基础设施电磁恢复力的内涵和外延,并对开展电磁恢复力研究提出建议。     

物理隔离网络电磁漏洞研究

物理隔离网络的电磁攻击手段, 其主要目标是建立与外部互联网的隐蔽连接通道。近年来跨越物理隔离网络的方法和工具被陆续公开, 相应的分析方法和检测手段也逐步被国内外安全团队提出。掌握漏洞才能掌握网络安全的主动权, 对比网络安全漏洞, 电磁漏洞定义为能对设备或系统造成损害的电磁因素。以物理隔离网络为例, 电磁漏洞主要指的是网络的硬件和系统缺陷, 利用这些缺陷可以直接建立或通过植入恶意软件建立能突破物理隔离的电磁信号的信息收、发隐蔽通道。通过广泛的漏洞挖掘与验证, 从物理信号类型、信息传递方向、信号生成与作用机理、漏洞利用方式以及漏洞检测方法上提出物理隔离网络电磁漏洞分类方法; 通过综合借鉴网络安全漏洞、电磁信息安全检测、物理隔离隐蔽通道等领域的研究方法, 提出电磁漏洞的研究方法; 从深化主动检测、群智漏洞挖掘、网络电磁安全融合、大数据监测等角度, 提出了物理隔离网络电磁漏洞库的建立方法。     

Ranking the spreading influence in complex networks

Identifying the node spreading influence in networks is an important task to optimally use the network structure and ensure the more efficient spreading in information. In this paper, by taking into account the shortest distance between a target node and the node set with the highest k$k$-core value, we present an improved method to generate the ranking list to evaluate the node spreading influence. Comparing with the epidemic process results for four real networks and the Barabási–Albert network, the parameterless method could identify the node spreading influence more accurately than the ones generated by the degree k$k$, closeness centrality, k$k$-shell and mixed degree decomposition methods. This work would be helpful for deeply understanding the node importance of a network.