一种高效的网格资源监测算法ACTC的改进算法

资源监控是网格计算的关键组成部分。资源监控算法既要保证网格系统中资源信息高保真度又要考虑资源信息在网络传输中的负担最低。ACTC算法就是为实现以上目的而被提出,但是算法中对资源信息更新量的动态门槛值(d_threshold)计算方式不合理,有可能导致算法演变成低级的单纯依靠时间敏感机制(TSM)来发送资源更新通知,并且算法中遗漏了一些极端情况的考虑。提出了新的d_threshold计算公式和限制条件,进行性能改进和完善,并对改进前后两算法进行实验对比。实验表明,改进后算法提高了资源信息准确性,并使监控系统     

考试综合管理信息系统的关键技术研究

基于.NET技术成功开发了考试综合管理信息系统,针对考试管理工作面临的问题,提出了相应的解决方案,并以此为依据介绍了该系统开发过程中的自动编排算法、安全策略等关键技术。该系统已成功运用,并解决了高校日益复杂的考务管理工作。     

基于关联分析的数据挖掘在体检CRM中的应用

运用关联分析方法对体检中心数据进行挖掘。首先分析了关联规则的原理和方法,然后对待挖掘数据进行集成、变换等预处理,得到能进行挖掘的原始数据.采用挖掘工具WEKA,选用关联规则中的Apriori算法对处理后数据进行分析,得到了与某一病症相关的各个症状之间的关联关系,以及各个症状与健康之间的关联关系。     

图像阈值自动选取算法的C＋＋实现

图像分割是运动目标检测与跟踪技术必须要解决的问题,在很多时候它涉及到图像阈值的选取。文章采用的算法首先计算图像中不同区域的灰度均值,结合最小差值条件,反复修订由计算所得的阈值,从而达到自动选优的目的。在此基础上,文章进一步给出了用C＋＋语言实现算法的关键代码。测试表明此方法选择阈值简便实用,图像的二值化效果良好。     

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算法处理监测温度数据,提取其变化趋势特征信息;采用偏度分析提取监测温度异常值,从而正确诊断定子过热性故障,仿真分析及实验结果表明该方法有效提高了定子温度监测与预警的准确率。     

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

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

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.