Research on technology of desktop virtualization based on SPICE protocol and its improvement solutions

Increasingly mature cloud computing technology promotes virtual desktop technology, which can solve many problems existing in traditional computing models. However, virtual desktop solutions introduce the thorny problem of how to deliver a real desktop experience to users, as if they are using it locally, especially when playing video. The SPICE （simple protocol for independent computing environments） virtual desktop solution provides several image compression algorithms to address this problem with the purpose of making virtual desktops as real as possible. Although different compression algorithms can contribute their own abilities to different images to a large extent, switching between them is a big problem that consumes a large amount of resources to detect the different type of image and also causes jitter of the virtual desktop. This paper proposes a new solution, called SPICEx, using the JPEG2000 compression algorithm with dynamic compression ratios to solve the problem and finally validates that the performance is better than that of SPICE. With better quality of user experience and also reducing bandwidth consumption, SPICEx solution is meaningful in virtual desktop fields and can be widely used.     

Probabilistic and interval reliability design of the composite pressure vessel

Considering the randomness or interval character of physical parameters and applied loads of composite pressure vessels (COPV), the COPV reliability-analyzing model is built. And then the computational expressions for the mean value, standard deviation and deviation of fiber stress are deduced by the random factor method. The probabilistic and interval reliability designs on COPV are implemented by utilizing the probabilistic method and interval method combined with the improved particle swarm optimization (PSO) algorithm, respectively. The influence of fluctuation of structure uncertain parameters on COPV design thickness is inspected. Finally, examples are given to demonstrate that both probabilistic and interval reliability methods can satisfy the safety requirement and both are of higher rationality than the traditional safety factor method. And probabilistic method has a lower relative error but a higher computational complexity contrasted with the interval method.     

电控柴油机分缸均衡控制算法及试验

柴油机各个气缸的进气量、喷油量、燃烧等存在差异,导致气缸间存在做功差异,直接影响柴油机转速的平稳性以及排放性能等。针对位置式电控柴油机,采用PI闭环控制,通过瞬时转速信号识别并计算各缸的工作差异,利用分缸均衡控制算法对油量进行补偿修正。试验结果显示低转速稳态工况转速波动由7 r/min降至3 r/min,各缸工作不均匀度由±5 r/min降至±2 r/min,在瞬态过程和高转速3 400 r/min时该算法仍然适用有效。     

基于改进Kendall-f算法的发电机定子温度分析

在线监测发电机定子温度可有效发现定子部分过热性故障,如何从检测的温度数据中提取反映定子故障预警的信息是目前国内外研究的热点。该文采用可变窗改进Kendall-f算法处理监测温度数据,提取其变化趋势特征信息;采用偏度分析提取监测温度异常值,从而正确诊断定子过热性故障,仿真分析及实验结果表明该方法有效提高了定子温度监测与预警的准确率。     

模具生产联合体加工作业统一调度问题的研究

模具生产联合体是由小规模企业组成的模具设计、制造联盟，由于设备、工装和人员分属于不同的加盟企业，其作业排序过程非常复杂。为此提出一种复合式模具生产联合体的生产排序方法：依据基本优先规则首先完成单一工序作业，然后对多工序作业用改进遗传算法进行工艺优化，求出最优解和次优解，再使用评价函数法选择最佳作业路线。该方法在生产试验中取得了良好的成效．能较好满足模具用户和加盟企业两方面的需要。     

Modeling of tool wear in drilling by statistical analysis and artificial neural network

The useful life of a cutting tool and its operating conditions largely control the economics of the machining operations. Hence, it is imperative that the condition of the cutting tool, particularly some indication as to when it requires changing, to be monitored. The drilling operation is frequently used as a preliminary step for many operations like boring, reaming and tapping, however, the operation itself is complex and demanding.

Back propagation neural networks were used for detection of drill wear. The neural network consisted of three layers input, hidden and output. Drill size, feed, spindle speed, torque, machining time and thrust force are given as inputs to the ANN and the flank wear was estimated. Drilling experiments with 8 mm drill size were performed by changing the cutting speed and feed at two different levels. The number of neurons in the hidden layer were selected from 1, 2, 3, …, 20. The learning rate was selected as 0.01 and no smoothing factor was used. The estimated values of tool wear were obtained by statistical analysis and by various neural network structures. Comparative analysis has been done between statistical analysis, neural network structures and the actual values of tool wear obtained by experimentation.     

Dual–primal proximal point algorithms for extended convex programming

This paper presents a class of dual–primal proximal point algorithms (PPAs) for extended convex programming with linear constraints. By choosing appropriate proximal regularization matrices, the application of the general PPA to the equivalent variational inequality of the extended convex programming with linear constraints can result in easy proximal subproblems. In theory, the sequence generated by the general PPA may fail to converge since the proximal regularization matrix is asymmetric sometimes. So we construct descent directions derived from the solution obtained by the general PPA. Different step lengths and descent directions are chosen with the negligible additional computational load. The global convergence of the new algorithms is proved easily based on the fact that the sequences generated are Fejér monotone. Furthermore, we provide a simple proof for the O(1/t) convergence rate of these algorithms.     

一种相控阵天线安装精度检测与校准

文中论述了一种相控阵雷达天线安装后的精度检测方法。按照雷达天线安装后的几何形态,采用光学测量仪器进行相关的数据采集,建立检测的数学模型,利用线性回归法以及最小二乘法进行数据拟合,计算出安装后雷达天线底面与水平面的最大夹角和天线边缘与正北方向的夹角,并进行了试验误差评估和分析,依据检测数据对雷达天线的水平和方位角度进行校...     

A novel artificial bee colony algorithm with Powell's method

Artificial bee colony (ABC) algorithm is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, we first propose a modified search equation which is applied to generate a candidate solution in the onlookers phase to improve the search ability of ABC. Further, we use the Powell's method as a local search tool to enhance the exploitation of the algorithm. The new algorithm is tested on 22 unconstrained benchmark functions and 13 constrained benchmark functions, and are compared with some other ABCs and several state-of-the-art algorithms. The comparisons show that the proposed algorithm offers the highest solution quality, fastest global convergence, and strongest robustness among all the contenders on almost all test functions.