基于混沌级联的语音频域实时加密系统

针对现有语音实时保密通信系统中系统空载密钥泄漏现象导致容易遭受基于自适应同步控制方法攻击的问题,采用混沌级联对语音频域进行实时加、解密。该方案实现零密钥泄漏,有效抵御了基于自适应同步控制方法的攻击。系统测试分析结果表明,该方案是有效、安全的,优于基于单组混沌系统对时域的加密方法。     

多种通信网络及接口转换模块的研制

针对大系统中共存的多种通信网络和同种网络多种接口互相通信的需要,采用LPC2368SOC结合RTL-RTX实时操作系统,研制一个支持多种通信网络及接口互相转换的模块,实现以太网、串口网、CAN网（现场总线网）和USB之间的通信,以及RS232,RS422和RS485接口之间的通信。从线速上对网络转换速度进行定量分析,指出该模块使用时的极限约束条件。     

Explicit synchronisation of heterogeneous dynamics networks via three-layer communication framework

This paper addresses the explicit synchronisation of heterogeneous dynamics networks via three-layer communication framework. The main contribution is to propose an explicit synchronisation algorithm, in which the synchronisation errors of all the agents are decoupled. By constructing a three-layer node model, the proposed algorithm removes the assumptions that the topology is fixed and the synchronisation process is coupled. By introducing appropriate assumptions, the algorithm leads to a class of explicit synchronisation protocols based on the states of agents in different layers. It is proved in the sense of Lyapunov that, if the dwell time is larger than a threshold, the explicit synchronisation can be achieved for closed-loop heterogeneous dynamics networks under switching topologies. The results are further extended to the cases in which the switching topologies are only frequently but not always connected. Simulation results are presented with four single-link manipulators to verify the theoretical analysis.     

Prevalence and personality correlates of Facebook bullying among university undergraduates

The purpose of the present study was to examine the prevalence of cyber-bullying through Facebook in a sample of 226 Greek university undergraduates, and to explore whether big five personality characteristics, narcissism, as well as attitudes toward Facebook, technological knowledge and skills were predictive of such behavior. Participants completed a self-report questionnaire measuring the above constructs. Results indicated that almost one third of the sample reported Facebook bullying engagement at least once during the past month, with male students reporting more frequent involvement than females. Bullying through Facebook was predicted by low Agreeableness and more time spent on Facebook only for males, whereas for females none of the studied variables predicted engagement in Facebook bullying. Findings are discussed in terms of prevention and intervention strategies.     

基于跳频和同步捕获技术的水下无线通信技术研究

本文所阐述的水下无线技术即基于跳频技术和同步捕获技术的水声通信,由于声波在海水中的传播特性显著优越于电磁波和可见光,使得水声技术成为海洋高技术的主要研究领域之一 ,在国防领域也具有十分重要的研究意义.本文主要论述了水声通信中跳频技术和同步捕获技术的原理、具体算法的实现方案以及部分硬件设施的使用简述,并通过展示实验结果验证算法的可行性.     

基于一次密钥的数据加密算法优化

介绍了关于DES算法的一些研究情况, 分析了DES了算法的加密原理以及实现过程, 通过内容分析, 简单介绍了DES算法的几种改进方案, 通过分析它的加密过程以及几种改进方案, 进而提出了自己的一个改进思想即一次密钥的加密方案, 通过这个方案为DES算法的优化作一个参考.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

Necessary optimality conditions for fuzzy variational problems

The main aims of this study are to derive the fuzzy Euler-Lagrange conditions for both fuzzy unconstrained and constrained variational problems based on the concepts of differentiability and integrability of a fuzzy mapping that may be parameterized by the left and right-hand functions of its α-level sets.     

Scheduling gain for frequency-selective Rayleigh-fading channels with application to self-organizing packet scheduling

This paper investigates packet scheduling in the context of Self-Optimizing Networks, and demonstrates how to improve coverage dynamically by adjusting the scheduling strategy. We focus on α-fair schedulers, and we provide methods for calculating the scheduling gain, including several closed form formulas. Scheduling gain is analyzed for different fading models, with a particular focus on the frequency-selective channel. We then propose a coverage-capacity self-optimization algorithm based on α-fair schedulers. A use case illustrates the implementation of the algorithm and simulation results show that important coverage gains are achieved at the expense of very little computing power.