一种新的多信息融合算法——比亲算法的提出

根据D-S理论在证据完全对立的情况下失效的原因，考虑证据间基本可信度分配函数(BPA)值在证据中所占比重以及相关程度两个方面对证据合成的影响，在D-S理论框架基础上构建了一种新的多信息融合算法——比亲算法。通过与两篇D-S理论应用论文中的实例进行比较表明：在证据不相对立的情况下，新算法与-S理论应用的结果是一致的；当证据对立时，新算法则具有纠错功能而优于D-S理论。结果验证了这种算法的可行性、有效性及实用性。     

A Conflict Detection Scheme for Concurrency Control of R-tree

1　ＩｎｔｒｏｄｕｃｔｉｏｎＡｓｏｎｅｏｆｔｈｅｍｏｓｔｉｍｐｏｒｔａｎｔｍｕｌｔｉｄｉｍｅｎｓｉｏｎａｌｄａｔａｓｔｒｕｃｔｕｒｅｓ,ｓｅｖｅｒａｌｖａｒｉａｔｉｏｎｓｏｆＲ ｔｒｅｅｓｈａｖｅｂｅｅｎｐｒｏｐｏｓｅｄｆｏｒａｒａｔｈｅｒｌｏｎｇｔｉｍｅ[1～ 9] ,ｂｕｔｍｏｓｔｏｆｔｈｅｍｈａｖｅｎｏｔｂｅｅｎｕｓｅｄｉｎｅｘｉｓｔｉｎｇＤＢＭＳ .Ｔｈｅｍａｉｎｒｅａｓｏｎｉｓｔｈｅｌａｃｋｏｆａｐｐｌｉｃａｂｌｅ ｐｒｏｔｏｃｏｌｓｔｏｇｕａｒａｎｔｅｅｔｈｅｃｏｎｓｉｓｔｅｎｃｙｉｎｔｈｅｐｒ…     

智能测控系统中的RS485总线和CAN总线

20世纪80年代德国Bosch公司成功开发出控制器局域网(CAN)总线,为分布式控制系统实现各节点之间实时、可靠的数据通信提供了强有力的技术支持,其成功应用于工业机动控制、铁路引擎控制单元、船用电子设备、医用设备、复杂传感器等诸多领域.而基于RS485总线的网络分布式测控系统,由于具有结构简单、抗干扰能力强、传输距离远、成本低等优点,因此被广泛应用于工业现场.文中简要介绍了RS485和CAN总线特点,给出了CAN总线应用于测控网络的构建方法,同时针对RS485总线网络中的通讯冲突问题,寻求了一种有效的解决办法.     

Assessing elementary algebra with STACK

This paper concerns computer aided assessment (CAA) of mathematics in which a computer algebra system (CAS) is used to help assess students' responses to elementary algebra questions. Using a methodology of documentary analysis, we examine what is taught in elementary algebra. The STACK CAA system, http://www.stack.bham.ac.uk/, which uses the CAS Maxima, is taken as a case study with which to test the implementation of the ideas developed in this paper. The general characteristics needed from a CAS for the application of computer aided assessment, or computer based learning is discussed. In particular the need for consistently implemented noun forms of elementary arithmetic operations, together with their traditional verb forms is identified.     

Intersecting a simple mixed integer set with a vertex packing set

We consider a mixed integer set that results from the intersection of a simple mixed integer set with a vertex packing set from a conflict graph. This set arises as a relaxation of the feasible set of mixed integer problems such as inventory routing problems. We derive families of strong valid inequalities that consider the structures of the simple mixed integer set and the vertex packing set simultaneously.     

Trace level detection and identification of nitro‐based explosives by surface‐enhanced Raman spectroscopy

Methods for rapid identification of explosives and their associated compounds at trace level quantities are needed for security screening applications. In this paper, we apply the surface‐enhanced Raman spectroscopy (SERS) to detect and identify traces (as low as tens of pg) of pentaerythritol tetranitrate (PETN), ethylene glycol dinitrate (EGDN), cyclotrimethylene‐trinitramine (RDX) and trinitrotoluene (TNT) using commercially available substrates (Klarite®, Renishaw diagnostics). High quality spectra were achieved within 10 s with a compact Raman spectrometer. Principal component analysis (PCA) of the data was performed to understand what factors affected the spectral variation across the samples. It was found that 76% of the spectral variation was explained by the first three PCs. Score plots for these components showed that the energetic materials can be clearly classified on the basis of SERS spectra also at trace level quantity. Our measurements further demonstrate the potential for using SERS as fast, in situ analytical tool for safety devices, with a sensitivity which competes and, in some cases, overcomes other techniques. Copyright © 2013 John Wiley & Sons, Ltd.     

A cluster based mobility prediction scheme for ad hoc networks

The ad hoc networks are completely autonomous wireless networks where all the users are mobile. These networks do not work on any infrastructure and the mobiles communicate either directly or via other nodes of the network by establishing routes. These routes are prone to frequent ruptures because of nodes mobility. If the future movement of the mobile can be predicted in a precise way, the resources reservation can be made before be asked, which enables the network to provide a better QoS. In this aim, we propose a virtual dynamic topology, which on one hand, will organize the network as well as possible and decreases the impact of mobility, and on the other hand, is oriented user mobility prediction. Our prediction scheme uses the evidence theory of Dempster–Shafer in order to predict the future position of the mobile by basing itself on relevant criteria. These ones are related to mobility and network operation optimisation. The proposed scheme is flexible and can be extended to a general framework. To show the relevance of our scheme, we combine it with a routing protocol. Then, we implemented the prediction-oriented topology and the prediction scheme which performs on it. We implemented also a mobility prediction based routing protocol. Simulations are made according to a set of elaborate scenarios.     

证据推理的组合规则研究

对不精确、不完整信息系统的决策规则,证据理论提供了一种卓有成效的处理方法.从应用的角度出发,人们提出了修正的证据推理组合规则.为了能对各种证据推理组合规则有深刻理解,以证据理论为基础,对各种组合规则进行了深入的研究,分析了不同情况下各证据组合规则解决冲突问题的能力.接着给出了一种基于证据的条件概率指派合成方法,并证明了其有效性.最后,对各种证据组合规则的适用范围进行了比较.     

黑客攻击行为分析与网络安全管理平台的系统组成

介绍了黑客攻击的主要方式,提出了应急响应的对策,重点论述了入侵检测系统（IDS）和计算机取证技术,并对网络安全管理平台的构建和系统组成提出了自己的思路。     

用于多信道无线网络的综合链路速率分配算法

This paper presents a link allocation and rate assignment algorithm for multi-channel wireless networks. The objective is to reduce network conflicts and guarantee the fairness among links. We first design a new network model. With this network model, the multi-channel wireless network is divided into several subnets according to the number of channels. Based on this, we present a link allocation algorithm with time complexity O(l2 ) to allocate all links to subnets. This link allocation algorithm adopts conflict matrix to minimize the network contention factor. After all links are allocated to subnets, the rate assignment algorithm to maximize a fairness utility in each subnet is presented. The rate assignment algorithm adopts a near-optimal algorithm based on dual decomposition and realizes in a distributed way. Simulation results demonstrate that, compared with IEEE 802. 11b and slotted seeded channel hopping algorithm, our algorithm decreases network conflicts and improves the network throughput significantly.