Probability Distribution of Ratio of China Aviation Network Edge Vertices Degree and Its Evolutionary Trace Based on Complex Network

In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of ratio of China aviation network edge vertices degree were studied based on the statistics data of China civil aviation network in 1988, 1994, 2001, 2008 and 2015. According to the theory and method of complex network, the network system was constructed with the city where the airport was located as the network node and the route between cities as the edge of the network. Based on the statistical data, the ratio of edge vertices degree in China aviation network in 1988, 1994, 2001, 2008 and 2015 were calculated. Using the probability statistical analysis method and regression analysis approach, it was found that the ratio of edge vertices degree had linear probability distribution and the two parameters of the probability distribution had linear evolution trace.

Probability Distribution of China Aviation Network Average Degree of Edge Vertices and Its Evolutionary Trace Based on Complex Network

In order to reveal the complex network characteristics and evolution principle of China aviation network, the probability distribution and evolution trace of average degree of edge vertices of China aviation network were studied based on the statistics data of China civil aviation network in 1988, 1994, 2001, 2008 and 2015. According to the theory and method of complex network, the network system was constructed with the city where the airport was located as the network node and the route between cities as the edge of the network. Based on the statistical data, the average degrees of edge vertices in China aviation network in 1988, 1994, 2001, 2008 and 2015 were calculated. Using the probability statistical analysis method and regression analysis approach, it was found that the average degree of edge vertices had the probability distribution of normal function and the position parameters and scale parameters of the probability distribution had linear evolution trace.

The k-Error Linear Complexity and the Linear Complexity for pq^n-Periodic Binary Sequences

The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd（p-1, q-1） = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.

On k-Error Linear Complexity of Some Explicit Nonlinear Pseudorandom Sequences

Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences, we study the stability on linear complexity of two classes of explicit inversive generators and two classes of explicit nonlinear generators. We present some lower bounds in theory on the k-error linear complexity of these explicit generatol＇s, which further improve the cryptographic properties of the corresponding number generators and provide very useful information when they are applied to cryptography.

THE 2-ERROR LINEAR COMPLEXITY OF 2~n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2~n-1

Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.

Onset of Linear Instability in a Complex Plasma with Cairns Distributed Electrons

A rigorous theoretical investigation of linear dust ion acoustic (DIA) solitary waves in an unmagnetized complex plasma consisting of ion and ion beam fluids, nonthermal electrons that are Cairns distributed and immobile dust particles were undertaken. It was found out that, for large beam speeds, three stable modes propagated as solitary waves in the beam plasma. These were the “Fast”, “Slow” and “Ion-acoustic” modes. For two stream instability to occur between ion and ion beam, it is shown that or when .

Probability Distribution of China Aviation Network Nearest Neighbor Average Degree and Its Evolutionary Trace Based on Complex Network

In order to reveal the complex network characteristics and evolution principle of China aviation network,the probability distribution and evolution trace of node nearest neighbor average degree of China aviation network were studied based on the statistics data of China civil aviation network in 1988,1994,2001,2008 and 2015.According to the theory and method of complex network,the network system was constructed with the city where the airport was located as the network node and the route between cities as the edge of the network.Based on the statistical data,the nearest neighbor average degrees of nodes in China aviation network in 1988,1994,2001,2008 and 2015 were calculated.Using the probability statistical analysis method,it was found that the nearest neighbor average degree had the probability distribution of normal function and the position parameters and scale parameters of the probability distribution had linear evolution trace.

Statistical Characteristics of the Complexity for Prime-Periodic Sequences

Using the fact that the factorization of x^N — 1 over GF(2) is especiallyexplicit, we completely establish the distributions and the expected values of the lineal complexityand the k-error linear complexity of the N-periodic sequences respectively,where N is an odd primeand 2 is a primitive root modulo N. The results show that there are a large percentage of sequenceswith both the linear complexity and the k-enor linear complexity not less than N, quite close totheir maximum possible values.

DISTRIBUTION OF ONE-ERROR LINEAR COMPLEXITY OF BINARY SEQUENCES FOR ARBITRARY PRIME PERIOD

Complexity measures for sequences, such as the linear complexity and the k-error linear complexity, play an important role in stream ciphers. This contribution studies the distribution of 1-error linear complexity of binary sequences with arbitrary prime period. For any odd prime N, the authors present all possible values of 1-error linear complexity of N-periodic binary sequences, and derive the exact formulas to count the number of N-periodic binary sequences with any given 1-error linear complexity.

Computing the k-error joint linear complexity of binary periodic multisequences

Complexity measures for multisequences over finite fields, such as the joint linear complexity and the k-error joint linear complexity, play an important role in cryptology. In this paper we study a fast algorithm, presented by Venkateswarlu A, to computer the k-error joint linear complexity of a binary periodic multisequence. In this paper, the aim is mainly to complement the theoretical derivation and proof of the existing algorithm. Moreover, our algorithm reduces computation.

A Complex Algorithm for Solving a Kind of Stochastic Programming

Considering that the probability distribution of random variables in stochastic programming usually has incomplete information due to a perfect sample data in many real applications, this paper discusses a class of two-stage stochastic programming problems modeling with maximum minimum expectation compensation criterion (MaxEMin) under the probability distribution having linear partial information (LPI). In view of the nondifferentiability of this kind of stochastic programming modeling, an improved complex algorithm is designed and analyzed. This algorithm can effectively solve the nondifferentiable stochastic programming problem under LPI through the variable polyhedron iteration. The calculation and discussion of numerical examples show the effectiveness of the proposed algorithm.

利用互子带滤波器和稀疏特性的多通道线性预测语音去混响方法

多通道线性预测是最为流行的语音去混响方法之一,现有相关研究大多利用子带谱减模型在每一个频带独立地获取期望信号,但这忽略了不同子带之间的相互影响。本文提出一种利用互子带谱减模型的多通道线性预测语音去混响方法。相比于大多数方法采用的子带谱减模型,本文方法采用的互子带谱减模型能够利用互子带滤波器来对不同子带之间的相互影响进行建模。本文方法利用复广义高斯分布建模期望信号,相比于常用的高斯分布,复广义高斯分布能够通过调整形状参数来描述语音信号的稀疏特性。在最大似然估计框架下,将语音去混响转化为关于互子带滤波器和子带滤波器的优化问题;并且基于替代最小化方法推导了保证收敛的优化算法。在不同混响时间、不同通道、不同声源和传声器距离情况下的一系列语音去混响实验验证了本文方法的性能显著优于传统去混响算法。

混沌非线性反馈密码序列的理论设计和有限精度实现

本文利用一类特殊的一维分段线性混沌系统，来产生具有均匀不变分布函数和δ自相关函数特性的连续混沌信号，这类连续混沌信号经过不可逆变换可生成具有理想保密性的二进制混沌密码序列．本文分析了该混沌系统的有限精度效应并提出一类ｍ序列扰动实现方法．与传统密码序列相比，混沌非线性反馈密码序列不仅具有丰富的源泉，而且设计异常方便，性能易于控制．

换流变压器出线装置电场分布与绝缘结构优化

在复合电压作用下,换流变压器出线装置的电场分布不均匀。为此,根据实际结构建立了电场仿真模型,分析出线装置在交流、直流及极性反转电压作用下的电场分布,以及温度对其电场分布的影响。采用非线性绝缘材料并通过几何形状优化法实现了对出线装置电场分布的均化。研究表明:交流电压下,出线装置上的最大电场强度出现在均压球附近的油隙中;直流电压下,出线装置的最大电场强度出现在均压球上表面的绝缘层中。在极性反转电压下,由于空间电荷的作用,变压器油承担较高的电场强度。随着温度的降低,变压器油和绝缘纸板中的电场分布越趋不均匀,采用非线性绝缘材料可有效改善出线装置中的电场分布。

基于线路修正传输极限和交流分布因子的ATC快速计算

根据现有在线应用线性分布因子法计算可用传输容量(ATC)的缺点,利用复数潮流考虑无功的影响,根据π型等值线路复数潮流轨迹和视在功率极限轨迹的交点得出计及无功的传输极限;根据基态雅可比矩阵,计算传输合同对节点电压的影响,再利用π型等值线路中线路潮流对两端节点电压的偏导,计算节点电压变化对线路潮流的影响;采用线路故障的节点功率注入模拟方法,得到考虑基态潮流的交流功率传输分布因子。并根据flowgate的剩余容量和分布因子计算ATC。定义flowgate为线路热极限和线路故障2种情况,分别计算基态潮流和考虑线路紧急故障情况下的区域间ATC值,并与线性分布因子法和重复潮流法(RPF)计算结果相比较。IEEE30节点系统计算结果表明,该算法快速准确,满足在线计算和分析要求。

新一类广义自缩序列的最小周期

讨论新的一类广义自缩序列的最小周期,在许多情形下证明了它们的最小周期达到最大(即为2n-1)。

周期序列的统计特性

本文介绍了周期序列的线性复杂度的数学期望和方差的一个新的求法 ,并对给定最小周期的序列的线性复杂度的分布、数学期望和方差进行了研究。

一种改进的Weibull分布杂波仿真方法

针对目前Weibull分布杂波仿真中没有考虑线性滤波器物理可实现性问题,首先深入研究了该杂波模型的统计特性及其ZMNL仿真方法;在此基础上,引入最小相位特性与复倒谱技术,提出了一种物理可实现的滤波器产生方法,同时详细阐述了物理可实现Weibull分布杂波随机序列产生的流程;最后,进行了仿真实验,仿真结果证明了该方法的准确性和有效性。该方法产生的杂波可用于雷达信号模拟、雷达图像分析及雷达最优信号处理器设计。

一种改进的复合K分布杂波仿真方法

针对目前复合K分布杂波仿真中没有考虑线性滤波器物理可实现性的问题,首先深入研究了该杂波模型的统计特性及其ZMNL仿真方法;在此基础上,引入最小相位特性与复倒谱技术,提出了一种物理可实现的滤波器产生方法,同时详细阐述了物理可实现复合K分布杂波随机序列产生的流程;最后,进行了仿真实验,仿真结果证明了该方法的准确性和有效性。该方法产生的杂波可用于雷达信号模拟、雷达图像分析及雷达最优信号处理器的设计。

带均匀分布权值的最短路问题

最短路问题是网络设计中的一个基本问题,当前研究工作都基于边的权值是确定的这一假设。论文研究边的权值是一区间数时的最短路问题,利用优化理论,建立了目标函数系数在区间上均匀分布的模糊线性整数规划模型。通过引入正、负理想点概念,将模型转化为具有确定系数的单目标优化问题,给出了求解算法,并证明了算法的时间复杂性是多项式时间的。仿真实例说明了模型和算法的有效性。