Small sample improvements in the threshold cointegration test using residual-based moving block bootstrap

A residual-based moving block bootstrap procedure for testing the null hypothesis of linear cointegration versus cointegration with threshold effects is proposed. When the regressors and errors of the models are serially and contemporaneously correlated, our test compares favourably with the Sup LM test proposed by Gonzalo and Pitarakis. Indeed, shortcomings of the former motivated the development of our test. The small sample performance of the bootstrap test is investigated by Monte Carlo simulations, and the results show that the test performs better than the Sup LM test.     

Fault tolerant multiple event detection in a wireless sensor network

With an increasing acceptance of Wireless Sensor Networks (WSNs), the health of individual sensor is becoming critical in identifying important events in the region of interest. One of the key challenges in detecting event in a WSN is how to detect it accurately transmitting minimum information providing sufficient details about the event. At the same time, it is also important to devise a strategy to handle multiple events occurring simultaneously. In this paper, we propose a Polynomial-based scheme that addresses these problems of Event Region Detection (PERD) by having a aggregation tree of sensor nodes. We employ a data aggregation scheme, TREG (proposed in our earlier work) to perform function approximation of the event using a multivariate polynomial regression. Only coefficients of the polynomial (P$P$) are passed instead of aggregated data. PERD includes two components: event recognition and event report with boundary detection. This can be performed for multiple simultaneously occurring events. We also identify faulty sensor(s) using the aggregation tree. Performing further mathematical operations on the calculated P$P$ can identify the maximum (max) and minimum (min) values of the sensed attribute and their locations. Therefore, if any sensor reports a data value outside the [min, max] range, it can be identified as a faulty sensor. Since PERD is implemented over a polynomial tree on a WSN in a distributed manner, it is easily scalable and computation overhead is marginal. Results reveal that event(s) can be detected by PERD with error in detection remaining almost constant achieving a percentage error within a threshold of 10%$10\%$ with increase in communication range. Results also show that a faulty sensor can be detected with an average accuracy of 94%$94\%$ and it increases with increase in node density.     

基于最佳门限消噪语音增强一种新方法的研究与实践

针对软门限对信号噪声的滤除方法,在分析小波变换消噪原理和方法的基础上,具体分析了阈值对小波变换消噪的影响.提出了改进阈值的阈值函数,给出更好的滤波结果.实验表明这种改进的算法有效地提高了增强效果.     

一种基于支持向量机的模糊施肥预测方法研究

提出了一种利用支持向量机(SVM)学习算法提取模糊规则进而实现施肥预测的方法.对于农业施肥中常用的正交实验法,由于其数据均衡分散使得曲线拟合的回归预测方法效果不佳.提出了一种利用SVM学习样本数据,再利用隶属度来提取模糊规则,通过阈值和可信度来控制规则的激活和准确性的预测方法,这一方法不仅避免了回归预测所产生的误差,并且模糊规则更具有实际意义,从而大大提高了知识获取的能力.     

基于改进的最大类间方差算法的图像分割研究

每种图像分割方法都只利用了图像信息中的部分特征,必然带有局限性,因此只能针对各种实际应用领域的需求来适当选择所需的方法.比较了几种阈值分割和边缘检测算法,着重研究了最大类阃方差算法,并对其进行改进.针对不同的图像进行了仿真,对实验结果进行了分析、研究、比较.结果表明,改进的Otsu算法能有效地提高图像分割的质量.     

推算定位算法在拦截策略中的研究与应用

机器人足球比赛中,研究有效的拦截对方球员的进攻和防守是一项关键的战术,以往开发的拦截策略中存在"漏拦"和"错拦"等现象,造成拦截成功率很低.将推算定位(Dead Reckoning,DR)算法用到拦截策略的研究中,有效估算出对方球员和球的下一步动向,实施有效拦截,提高了比赛过程中拦截判断的精度.对DR算法中的阈值的确定进行了分析和改进,提出一种判据函数,有效地解决动态门选取的问题;针对算法执行和网络的延时给予了延时补偿,提高系统的实时性,使拦截能够快速准确地实现.利用DR算法推算出赛场球和球员的运动趋势,指导赛场策略的生成并和队员的动作与位置的部署.实验数据表明,方法具有很强的优越性.     

Water Gauge Image Denoising Model Based on Improved Adaptive Total Variation

As an important part of water level warning in water conservancy projects, often due to the influence of en-vironmental factors such as light and stains, the acquired water gauge images have sticky, broken and bright spot conditions, which affect the identification of water gauges. To solve this problem, a water gauge image denoising model based on improved adaptive total variation is proposed. Firstly, the regular term exponent in the adaptive total variational equation is changed to an inverse cosine function; secondly, the differential curvature is used to distinguish the image noise points and increase the smoothing strength at the noise points; finally, according to the characteristics of the gradient mode and adaptive gradient threshold after Gaussian filtering, the New model can adaptively denoise in the smooth area and protect the edge area, so as to have the characteristics of both edge-preserving denoising. The experimental results show that the new model has a great improvement in image vision, higher iteration efficiency and an average increase of 1.6 dB in peak signal-to-noise ratio, and an average increase of 9% in structural similarity, which is more beneficial to practical applications.     

MC/DC Test Data Generation Algorithm Based on Whale Genetic Algorithm

The automatic generation of test data is a key step in realizing automated testing. Most automated testing tools for unit testing only provide test case execution drivers and cannot generate test data that meets coverage requirements. This paper presents an improved Whale Genetic Algorithm for generating test data required for unit testing MC/DC coverage. The proposed algorithm introduces an elite retention strategy to avoid the genetic algorithm from falling into iterative degradation. At the same time, the mutation threshold of the whale algorithm is introduced to balance the global exploration and local search capabilities of the genetic algorithm. The threshold is dynamically adjusted according to the diversity and evolution stage of current population, which positively guides the evolution of the population. Finally, an improved crossover strategy is proposed to accelerate the convergence of the algorithm. The improved whale genetic algorithm is compared with genetic algorithm, whale algorithm and particle swarm algorithm on two benchmark programs. The results show that the proposed algorithm is faster for test data generation than comparison methods and can provide better coverage with fewer evaluations, and has great advantages in generating test data.     

Efficient chosen-ciphertext secure certificateless threshold key encapsulation mechanism

As a practical extension of our previous work on certificateless threshold cryptosystem, this paper proposes the first direct certificateless threshold key encapsulation mechanism that inherits the same trust level of the original scheme and removes the length limitation of a traditional public key encryption. Security against threshold chosen-ciphertext attacks are proved in a random oracle model under a new assumption. It tolerates the Type I adversary that can replace public keys and the Type II adversary that has access to the system’s master key. The implied encapsulation scheme is very efficient when compared to the most efficient schemes in a traditional public key cryptosystem, and it is slightly more efficient in terms of key length and encapsulation speed when compared to the identity-based cryptosystems that have the same ciphertext overhead. Finally, we describe several potential modifications of our scheme.