Low complexity quantum private queries protocol

Private information retrieval(PIR) is an important privacy protection issue of secure multi-party computation, but the PIR protocols based on classical cryptography are vulnerable because of new technologies,such as quantum computing and cloud computing. The quantum private queries(QPQ) protocols available, however, has a high complexity and is inefficient in the face of large database. This paper, based on the QKD technology which is mature now, proposes a novel QPQ protocol utilizing the key dilution and auxiliary parameter. Only N quits are required to be sent in the quantum channel to generate the raw key, then the straight k bits in the raw key are added bitwise to dilute the raw key, and a final key is consequently obtained to encrypt the database. By flexible adjusting of auxiliary parameters θ and k, privacy is secured and the query success ratio is improved. Feasibility and performance analyses indicate that the protocol has a high success ratio in first-trial query and is easy to implement, and that the communication complexity of O(N) is achieved.     

电信运营商信息安全管控架构及集中策略研究

本文对运营商信息安全集中管控架构演进和信息安全管控策略面临的问题进行了深入分析，提出了信息安全集中管控架构的演进方向建议及对信息安全监控策略工作优化的若干意见。     

采用信息增益率的混合入侵检测模型设计

针对现有混合入侵检测模型仅定性选取特征而导致检测精度较低的问题，同时为了充分结合误用检测模型和异常检测模型的优势，提出一种采用信息增益率的混合入侵检测模型.首先，利用信息增益率定量地选择特征子集，最大程度地保留样本信息；其次，采用余弦时变粒子群算法确定支持向量机参数构建误用检测模型，使其更好地平衡粒子在全局和局部的搜索能力，然后，选取灰狼算法确定单类支持向量机参数构建异常检测模型，以此来提高对最优参数的搜索效率和精细程度，综合提高混合入侵检测模型对攻击的检测效果；最后，通过两种数据集进行仿真实验，验证了所提混合入侵检测模型具有较好的检测性能.     

网络安全威胁因素及其常见网络安全技术分析

社会经济的快速发展促进了科学技术水平的显著提升，社会生产生活各个领域当中对计算机网络的应用程度不断提升，当前，网络已经成为了人们日常生活与工作的重要组成部分。为此，加强对网络安全等因素影响研究就显得格外重要。网络环境关系着用户的使用质量，更加影响人们的工作效率，加强对网络安全技术的研究时解决相关问题的核心内容。本文针对网络安全威胁因素以及常见的网络安全技术进行了简要分析。     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

Change detection in synthetic aperture radar images based on unsupervised artificial immune systems

In this paper, we propose a novel change detection method for synthetic aperture radar images based on unsupervised artificial immune systems. After generating the difference image from the multitemporal images, we take each pixel as an antigen and build an immune model to deal with the antigens. By continuously stimulating the immune model, the antigens are classified into two groups, changed and unchanged. Firstly, the proposed method incorporates the local information in order to restrain the impact of speckle noise. Secondly, the proposed method simulates the immune response process in a fuzzy way to get an accurate result by retaining more image details. We introduce a fuzzy membership of the antigen and then update the antibodies and memory cells according to the membership. Compared with the clustering algorithms we have proposed in our previous works, the new method inherits immunological properties from immune systems and is robust to speckle noise due to the use of local information as well as fuzzy strategy. Experiments on real synthetic aperture radar images show that the proposed method performs well on several kinds of difference images and engenders more robust result than the other compared methods.     

ECG heart beat classification method based on modified ABC algorithm

Electrocardiogram is the most commonly used tool for the diagnosis of cardiologic diseases. In order to help cardiologists to diagnose the arrhythmias automatically, new methods for automated, computer aided ECG analysis are being developed. In this paper, a Modified Artificial Bee Colony (MABC) algorithm for ECG heart beat classification is introduced. It is applied to ECG data set which is obtained from MITBIH database and the result of MABC is compared with seventeen other classifier's accuracy.In classification problem, some features have higher distinctiveness than others. In this study, in order to find higher distinctive features, a detailed analysis has been done on time domain features. By using the right features in MABC algorithm, high classification success rate (99.30%) is obtained. Other methods generally have high classification accuracy on examined data set, but they have relatively low or even poor sensitivities for some beat types. Different data sets, unbalanced sample numbers in different classes have effect on classification result. When a balanced data set is used, MABC provided the best result as 97.96% among all classifiers.Not only part of the records from examined MITBIH database, but also all data from selected records are used to be able to use developed algorithm on a real time system in the future by using additional software modules and making adaptation on a specific hardware.     

The implementation of a smartphone-based fall detection system using a high-level fuzzy Petri net

The falling down problem has become one of the very important issues of global public health in an aging society. The specific equipment was adopted as the detection device of falling-down in the early studies, but it is inconvenient for the elderly and difficult for future application. The smart phone more commonly used than the specific fall detection equipment is selected as a mobile device for human fall detection, and a fall detection algorithm is developed for this purpose. What the user has to do is to put the smart phone in his/her thigh pocket for falling down detection. The signals detected by the tri-axial G-sensor are converted into signal vector magnitudes as the basis of detecting a human body in a stalling condition. The Z-axis data sets are captured for identification of human body inclination and the occurrence frequencies at the peak of the area of use are used as the input parameters. A high-level fuzzy Petri net is used for the analysis and the development of identifying human actions, including normal action, exercising, and falling down. The results of this study can be used in the relevant equipments or in the field of home nursing.     

iM-SIMPLE: iMproved stable increased-throughput multi-hop link efficient routing protocol for Wireless Body Area Networks

Wireless Body Area Networks (WBANs) are envisaged to play crucial role in psychological, medical and non-medical applications. This paper presents iM-SIMPLE; a reliable, and power efficient routing protocol with high throughput for WBAN. We deploy sensor nodes on human body to measure the physiological parameters such as blood pressure, temperature, glucose, lactic acid, EMG, acceleration, pressure, and position. Data from sensors is forwarded to intermediate node, from where it is transmitted to sink. An end user can access the required information available at sink via internet. To minimize energy consumption of the network, we utilize multi-hop mode of communication. A cost function is introduced to select the forwarder; node with high residual energy and least distance to sink has minimum cost function value and is selected. Residual energy parameter balances the energy consumption among the sensor nodes, and least distance improves packet delivery to sink because of reduced less path loss. We formulate the minimum energy consumption and high throughput problems as an Integer Linear Program. In order to support mobility, we also consider two body postures. Simulation results confirm the performance advantage of iM-SIMPLE compared to contemporary schemes in terms of maximizing stability period and throughput of the network.