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.     

A social interaction system based on cloud computing for mobile video telephony

As the use of smartphones become popular,people heavily depend on smartphone applications to deal with their social activities.For this reason,traditional message texting between mobile applications does not fulfill the versatile requirements of social networking.Many mobile applications use multimodality to deliver multimedia messages including sticker,voice and photo message,video call,and snap movie to enhance the communicative capability.However,without face-to-face interaction,people may fail to detect the other side’s non-verbal social behavior such as fine-grain facial expressions,body movements,or hand gesture.During social interaction,non-verbal behavior conveys information about the involved individuals and help the speakers express their social emotion in an implicit way.It is so important for real-world face-to-face interaction but is often blocked on the mobile telephony.To cope with this problem,we propose an afective computing model to assist the representation of social emotion and then help the progress of social interaction on the mobile telephony.In this model,for the purpose of real-time afective analysis,we delegate the computing loading to the cloud side service and enhance the system’s scalability and availability.The result of this experiment approves the feasibility of our system design for the applications of social intelligent.Also,the system provides a research framework of the social intelligent system on the mobile telephony.     

Differentially private data fusion and deep learning Framework for Cyber–Physical–Social Systems: State-of-the-art and perspectives

The modern technological advancement influences the growth of the cyber–physical system and cyber–social system to a more advanced computing system cyber–physical–social system (CPSS). Therefore, CPSS leads the data science revolution by promoting tri-space information resource from a single space. The establishment of CPSSs increases the related privacy concerns. To provide privacy on CPSSs data, various privacy-preserving schemes have been introduced in the recent past. However, technological advancement in CPSSs requires the modifications of previous techniques to suit its dynamics. Meanwhile, differential privacy has emerged as an effective method to safeguard CPSSs data privacy. To completely comprehend the state-of-the-art developments and learn the field’s research directions, this article provides a comprehensive review of differentially private data fusion and deep learning in CPSSs. Additionally, we present a novel differentially private data fusion and deep learning Framework for Cyber–Physical–Social Systems , and various future research directions for CPSSs.     

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.     

An automatic parameter calibration method for the SWAT model in runoff simulation

Runoff simulation is highly significant for hydrological monitoring, flood peak simulation, water resource management, and basin protection. Runoff simulation by distributed hydrological models, such as the soil and water assessment tool (SWAT) model which is the most widely used, is becoming a hotspot for hydrological forecasting research. However, parameter calibration is inefficient and inaccurate for the SWAT model. An automatic parameter calibration (APC) method of the SWAT model was developed by hybrid of the genetic algorithm (GA) and particle swarm optimization (PSO). Multi‐station and multi‐period runoff simulation and accuracy analysis were conducted in the basin of the Zhangjiang River on the basis of this hybrid algorithm. For example, in the Yaoxiaba Station, the calibration results produced an R² of 0.87 and Nash Sutcliffe efficiency (NSE) index of 0.85, while verification results revealed an R² of 0.83 and NSE of 0.83. Results of this study show that the proposed method can effectively improve the efficiency and simulation accuracy of the model parameters. It can be concluded that the feasibility and applicability of GA‐PSO as an APC method for the SWAT model were confirmed via case studies. The proposed method can provide theoretical guidance for many hydrological research fields, such as hydrological simulation, flood prevention, and forecasting.     

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

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

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

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

Ni-Cr-Fe-Si-B合金涂层及铝青铜基体熔合区组织的研究

采用钨极氩弧焊方法在铝青铜基体上施焊了Ni—Cr-Fe-Si—B合金涂层，并运用金相显微镜、扫描电子显微镜及能谱分析了喷涂层、熔合区及热影响区的组织形貌和成分分布。结果表明，喷焊时，在涂层与基体界面两侧各组元均发生了明显的扩散，Cu、Ni组元间可相互取代，基体融合区组织的基本组成仍为α (α γ2)，但同时也形成了Cu2FeAl7、NiAl3等新相，且融合区组织细小，涂层与基体间为冶金态结合。     

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

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

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.