基于阈值的概率图可达查询

图的可达性查询被广泛应用于生物网络、社会网络、本体网络、RDF网络等.由于对数据操作时引入的噪声和错误使这些图数据具有不确定性,而确定图的可达查询不能有效地处理不确定性,因此该文研究用概率语义描述的图可达性查询.具体的,该文使用可能世界概率模型定义不确定图(称为概率图),基于该模型,研究了基于阈值的概率可达查询(T-PR).首先为避免枚举所有可能世界,给出一个基本算法可精确求解T-PR查询.其次为进一步加速基本算法,给出3种改进方法,它们是不确定事件界、同构图的缩减、基于不相交路径和割集的界.通过合理的组合给出3种方法的合并算法.最后基于真实概率图数据的大量实验验证了该文的设计.     

集群计算环境下基于复杂网络的社会学仿真负载划分优化算法

负载划分是决定集群计算环境下基于复杂网络的并行社会学仿真性能的核心因素之一.由于背景负载等因素的影响,集群系统中往往需要根据实际可用计算资源非均匀分配仿真任务,而现有针对无标度特性拓扑结构的并行仿真负载划分算法无法适应集群环境下计算负载非均匀划分的需求.针对这一问题,提出了一个基于集散节点聚合的负载划分算法,将集群计算...     

Recovery of sensor embedded washing machines using a multi-kanban controlled disassembly line

Product recovery involves the recovery of materials and components from returned or end-of-life products. Disassembly, an element of product recovery, is the systematic separation of an assembly into its components, subassemblies or other groupings. Stricter environmental regulations together with dramatic decrease in natural resources and landfills have increased the importance of disassembly as all product recovery options require some level of disassembly. Due to changes made during the lifetime of a product by customers or service personnel, the number and the version of components prior to disassembly is unknown. Customers may also discriminate between and demand different versions of components. The existence of non-functional components further adds to the uncertainty associated with disassembly yield. Sensors implanted into products during their production can address this uncertainty by providing information on the number, condition and version of components prior to disassembly. In this study, we evaluate the impact of sensor embedded products (SEPs) on the various performance measures of a washing machine (WM) disassembly line controlled by a multi-kanban system, which takes into consideration the highly stochastic behavior of the line while managing material and kanban flows. First, separate design of experiments studies based on orthogonal arrays are performed for conventional products and SEPs. In order to observe the response of each experiment, detailed discrete event simulation (DES) models for both types of products are developed considering the precedence relationships among the components of a WM. Then, pair-wise t-tests are conducted to compare the two cases based on different performance measures. According to the results, SEPs provide significant reductions in all costs (viz., backorder, holding, disassembly, disposal, testing and transportation) while increasing revenue and profit.     

网络演算的矩阵解释

网络演算是离散事件动态系统理论在计算机网络中的应用,网络演算通过到达曲线和服务曲线计算网络的性能参数,这两个概念封装了复杂的理论背景,从而易于在实际中应用,但对到达曲线和服务曲线概念的理论研究比较缺乏.文中采用幂等矩阵的角度描述到达曲线和服务曲线,演算的过程成为矩阵运算,通过结合矩阵双子理论和余理论的研究结果,得出了由矩阵表演算的基本定理.研究表明,幂等矩阵理论为网络演算提供了很好的理论解释.文中还提出一种基于变换矩阵的方法求某些网络元素的服务曲线.     

Ordinal Optimization and Quantification of Heuristic Designs

This paper focuses on the performance evaluation of complex man-made systems, such as assembly lines, electric power grid, traffic systems, and various paper processing bureaucracies, etc. For such problems, applying the traditional optimization tool of mathematical programming and gradient descent procedures of continuous variables optimization are often inappropriate or infeasible, as the design variables are usually discrete and the accurate evaluation of the system performance via a simulation model can take too much calculation. General search type and heuristic methods are the only two methods to tackle the problems. However, the “goodness” of heuristic methods is generally difficult to quantify while search methods often involve extensive evaluation of systems at many design choices in a large search space using a simulation model resulting in an infeasible computation burden. The purpose of this paper is to address these difficulties simultaneously by extending the recently developed methodology of Ordinal Optimization (OO). Uniform samples are taken out from the whole search space and evaluated with a crude but computationally easy model when applying OO. And, we argue, after ordering via the crude performance estimates, that the lined-up uniform samples can be seen as an approximate ruler. By comparing the heuristic design with such a ruler, we can quantify the heuristic design, just as we measure the length of an object with a ruler. In a previous paper we showed how to quantify a heuristic design for a special case but we did not have the OO ruler idea at that time. In this paper we propose the OO ruler idea and extend the quantifying method to the general case and the multiple independent results case. Experimental results of applying the ruler are also given to illustrate the utility of this approach.

基于KDB树的RFID事件聚合过滤算法

分析RFID中间件查询数据的特点,提出一种对查询数据聚合转换的方法,减少查询索引的存储空间和数据插入时间。分析和比较已有多维查询索引的各方面性能,将多维索引KDB-tree应用到RFID中间件中。实验结果表明,KDB树索引在存储空间成本、数据插入成本和查询时间成本3个方面的综合性能最佳,在点查询上,KDB-tree只须单路径遍历索引树,数据查询时间少于其他方法。     

网格环境下的分布仿真事件调度研究

针对网格仿真中的事件调度问题,提出一种新的时序管理方法。该方法同时考虑网格仿真成员的按需模型服务调用与成员间的交互,对仿真中具体存在的事件进行分类,建立成员的相关局部事件触发矩阵和时序关系矩阵,并应用Mutli-AWS算法求解每个事件的开始时间。实验结果证明,该方法可以确保成员之间事件的时序关系,有效解决成员按需模型服务调用问题。     

发布／订阅范型中信息可靠投递的研究

以发布／订阅范型在时间维度上解耦导致的不确定性为出发点,采用时序分析方法,研究范型中信息投递的可靠性保障。在定义投递信息可用性的基础上,给出保证信息向订阅者可靠投递系统应满足的基本计算条件,探讨底层通信设施对可靠性的影响。针对发布／订阅范型中信息可靠投递的问题,提出必要的计算条件。分析结果表明,信息的可靠投递与订阅活跃期、订阅延迟、发布传播延迟密切相关。     

应用使能检测单元的抗辐射数字像素图像传感器

介绍了一种经过抗辐射设计加固的 CMOS 数字像素图像传感器,并提出了一种可以抵抗单粒子效应的使能检测单元。这个使能检测单元通过将信号传输给三个移位寄存器并判断寄存器输出是否一致来判断和屏蔽单粒子效应。实验结果表明：芯片的最大信噪比和动态范围分别是54.15 dB 和56.10 dB,使能检测单元可以屏蔽单粒子效应。     

一种RFID复杂事件语义分析方法研究

复杂事件处理技术是射频识别技术（Radio Frequency Identification,RFID）应用中的重要技术。现有的RFID复杂事件处理模型,例如基于petri网的模型、基于树的模型、基于图的模型、基于自动机的模型,并不能十分有效地解决复杂的RFID应用问题,具体地说,RFID复杂事件的语义分析方面缺乏进一步的研究。针对上述问题,提出了一种RFID复杂事件语义分析方法。该方法,借鉴编译原理中的语义分析技术,为事件增添定义了继承属性和综合属性,同时按照事件之间的关系,定义了三种语义模式,最后通过一个语义解析算法,解析出了特定模式组合的语义信息。实验证实,该方法取得了比较理想的效果。