成组更换策略下的备件库存决策仿真研究

针对成组更换策略下备件需求的特点,建立了无限使用期的成组更换策略与备件库存控制联合优化仿真模型。该模型通过模拟系统在预防维修间隔期T内的维修活动,得到1个预防维修间隔期内的总费用,然后在系统运行M(M足够大)个周期下,以期望单位时间总费用最小为目标,优化预防维修间隔期T和最大库存水平S。最后,基于案例,运用MATLAB对模型进行仿真优化计算,并分析了相关参数对模型优化结果的影响。     

路网数据流的预测聚集查询新方法研究

时空数据流的聚集查询技术已经成为数据库领域的研究热点。到目前为止,还没有一种有效的全时态聚集索引适用于非欧氏空间的路网数据流聚集查询。实现路网数据流的全时态聚集查询,必须解决:(1)路网的非欧氏空间特性问题;(2)路网上移动对象的重复计数、非均匀分布以及预测聚集问题。Sketch RR-tree解决了非欧氏空间特性和重复计数问题;为解决非均匀分布问题,借鉴草图划分思想,提出动态草图索引结构DynSketch:采用AMH智能划分Sketch RR-tree,使每个划分区域内车辆均匀分布,以提高聚集查询质量;同时,基于DynSketch,结合ES预测模型,提出了路网数据流的预测聚集查询算法。     

一种互联网海量情报规则优化方法

现在很多部门都需要通过规则处理海量情报数据,规则的数量一旦达到海量级规模,对规则的处理技术的要求将会变得越来越高,海量规则的优化将是一个十分重要的问题.文中展示了一种海量规则的优化方法.若两个规则网最后的计算结果是一样的,则可以认为这两个规则网是等价的.基于该等价规则模块的变换可以将代价小的规则模块替换掉代价大的规则模块,从而以后可以选择一种代价最小的规则模块.本文提出规则网模块等价替换的5种优化方法,并对其做了相应的证明.通过优化,可以使得海量规则网处于计算代价尽量最小状态,以此减少处理机的计算工作量.分析表明,通过等价规则替换,可以大大提高规则处理效率.     

空间数据库中一种自适应的缓存替换策略

随着近年来空间数据库研究和应用的不断深入,针对空间数据库中数据组织和查询的特征来设计缓存页面替换策略成为一个新的研究问题.Voronoi图是一种重要的空间数据库组织技术,在处理kNN查询时具有非常好的性能.针对Voronoi图组织的空间数据库,首先利用空间局部性提出了一种基于欧氏距离的替换策略,在发生页面失效时选择距离上一次访问页面欧氏距离最远的页面进行替换;进一步,针对不同kNN查询的搜索空间大小差异非常大的特点,在LIRS替换策略基础上提出一种自适应替换策略,通过对HIR页面占缓存比例自动调整来适应不同的查询.综合两者,形成基于欧氏距离的自适应缓存页面替换算法AELIRS.大量实验表明,在缓存大小与搜索空间大范围变动中,AELIRS始终优于其他替换策略.     

基于HSI彩色空间模型的域替换降噪算法

对彩色数字图像进行降噪处理时,为兼顾标量处理法的简便性和矢量处理法的有效性,提出一种对彩色空间域实行替换的方法。采用均值滤波法在RGB域内进行滤波处理,将图像数据从RGB域转换到HSI域,用滤波处理后的H域、S域替换含有噪声的H域、 S域。对由双目内窥镜采集的实际彩色图像进行实验,结果证明该域替换法可以结合标量处理和矢量处理的优点,达到比一般标量处理法及简单矢量处理法更好的降噪效果。     

Optimization of multi-task turning operations under minimal tool waste consideration

Most of the literatures on machining economics problems tend to focus on single cutting operations. However, in reality most parts that need to be machined require more than one operation. In addition, machining technology has been developed to the point that a single computer numerical control (CNC) machine is capable of performing multiple operations, even simultaneously, employing multiple spindles and cutting tools. When several operations are performed on a CNC turning machine, various tools are required for the cutting operations. Determining the life of these cutting tools under different machining conditions is an arduous task for the operators. They usually replace the tools based on their experience or according to the specific cutting tool handbook. Frequent tool replacements may result in wasted tools and tool utilization, while infrequent tool replacements may result in poorly machined parts. In this study we propose a mathematical model in which several different turning operations (turning, drilling, and parting) with proper constraints are performed. The issue of tool replacement is taken into account in the proposed cutting model. In addition, an evolutionary strategy (ES)-based optimization approach is developed to optimize the cutting conditions of the multiple turning-related operations while taking into account the minimizing unit cost criteria under the economical tool replacement strategy.     

A structured P2P network based on the small world phenomenon

In this paper, we propose a new structured P2P overlay network, named SW-Uinta(small-world). In order to reduce the routing latency, we firstly construct the Uinta network in which both physical characteristics of network and data semantic are considered. Furthermore, based on Uinta, a nondeterministic caching strategy is employed to allow for poly-logarithmic search time while having only a constant cache size. Compared with the deterministic caching strategy proposed by previous P2P systems, the nondeterministic caching strategy can reduce communication overhead for maintaining the routing cache table. Cache entries in the cache table of peer nodes can be updated by subsequent queries rather than only by running stabilization periodically. In the following, a novel cache replacement scheme, named the SW cache replacement scheme, is used to improve lookup performance, which has proved to satisfy the small-world principle. So we call this network SW-Uinta(small-world). After that, according to the theoretical analysis, it can be proved that SW-Uinta(small-world) can get O((log ² N)/k) search time with O(k) cache size. Lastly, the performance of SW-Uinta(small-world) is compared with those of other structured P2P networks such as Chord and Uinta. It shows that SW-Uinta(small-world) can achieve improved object lookup performance and reduce maintenance cost.

一种数据块关系指导的缓存替换方法

提出了一种数据块关系指导的缓存替换方法BDP(block correlations directed replacement policy).数据块关系所表示的空间局部性可以用来指导存储系统的缓存替换策略.BDP利用历史访问信息和实时访问信息,预测数据块未来的空间局部性特征,并设计数据块驻留时间的控制策略,减少现有替换算法对空间局部性预测失败带来的失效惩罚.同时给出了BDP的有效缓存模型.模拟结果显示,对大多数实际系统工作负载,BDP的失效率相对LRU算法下降11%～38%,优于现有的考虑空间局部性的替换算法.     

一种基于不放回抽样的图像混沌加密算法

针对现有基于混沌序列的图像加密算法的缺陷,提出一种基于不放回抽样的图像混沌加密算法。该算法采用可变模运算和间接地址映射技术,将混沌序列一对一、高度随机地转换为图像像素地址,实现图像的位置置乱和灰度扰乱加密。对混沌序列的分布无严格要求,使混沌序列的参数和初值可以作为密钥被使用。实验结果表明,与现有同类算法相比,该算法性能优越、运算速度快且易于实现。