基于模态Petri网的行为有效区间寻找最优路径的方法

为满足客户需求,在行为约束下的业务流程中寻找行为执行的最优路径具有一定的实际意义。已有的研究是建立在静态分析基础上,通过优化算法或是行为分析来寻找最优执行路径,忽略了行为约束条件对执行行为有效性的影响,所得结果具有一定的局限性。文中在已有方法的基础上,利用Petri网行为轮廓序关系描述约束条件并确定行为有效区间,提出了基于模态Petri网分支有效区间的业务流程最优路径选择方法。该方法以行为有效区间替代已有的固定值方法,以便更好地描述业务流程的行为约束以及约束下的有效行为。通过一个具体的业务流程分析实例分析了该方法的有效性。     

Progressive events in supervisory control and compositional verification

This paper investigates some limitations of the nonblocking property when used for supervisor synthesis in discrete event systems. It is shown that there are cases where synthesis with the nonblocking property gives undesired results. To address such cases, the paper introduces progressive events as a means to specify more precisely how a synthesised supervisor should complete its tasks. The nonblocking property is modified to take progressive events into account, and appropriate methods for verification and synthesis are proposed. Experiments show that progressive events can be used in the analysis of industrial-scale systems, and can expose issues that remain undetected by standard nonblocking verification.     

Drawing layered graphs with port constraints

Complex software systems are often modeled using data flow diagrams, in which nodes are connected to each other through dedicated connection points called ports. The influence a layout algorithm has on the placement of ports is determined by port constraints defined on the corresponding node.In this paper we present approaches for integrating port constraints into the layer-based approach to graph drawing pioneered by Sugiyama et al. We show how our layout algorithm, called KLay Layered, progresses from relaxed to more restricted port constraint levels as it executes, and how established algorithms for crossing minimization and edge routing can be extended to support port constraints. Compared to the previous layout algorithms supporting ports, our algorithm produces fewer edge crossings and bends and yields pleasing results.We also explain and evaluate how layout algorithms can be kept simple by using the concept of intermediate processors to structure them in a modular way. A case study integrating our layout algorithm into UC Berkeley's Ptolemy tool illustrates how KLay Layered can be integrated into Java-based applications.     

Temporal aggregation and spurious instantaneous causality in multiple time series models

Large aggregation interval asymptotics are used to investigate the relation between Granger causality in disaggregated vector autoregressions (VARs) and associated contemporaneous correlation among innovations of the aggregated system. One of our main contributions is that we outline various conditions under which the informational content of error covariance matrices yields insight into the causal structure of the VAR. Monte Carlo results suggest that our asymptotic findings are applicable even when the aggregation interval is small, as long as the time series are not characterized by high levels of persistence.     

主动授权规则实施支持空间特性的RBAC*

为满足安全策略或者角色定义的变化,系统或模型应该提供一种灵活的机制实施支持空间特性的RBAC。引入了OITE（on-if-then-else）主动授权规则实施支持空间特性的RBAC,定义了支持空间特性的RBAC中各基本元素与OITE之间的映射关系。使用OITE作为实施机制,可以在不同粒度上实施带有空间特性角色约束,并且可以将支持空间特性的RBAC应用在多个领域中。最后简要讨论了授权规则如何从支持空间特性的RBAC安全策略中自动产生。     

输入受限线性系统鲁棒抗饱和控制

针对抗饱和控制的鲁棒性问题,将研究扩展到对输入饱和非线性、时变参数和动态不确定性具有结构摄动的鲁棒性框架内,给出了一种线性时不变系统鲁棒抗饱和控制算法.鉴于积分二次型约束具有刻画结构不确定性的能力,选择在积分二次型约束框架下解决问题.以定标的线性矩阵不等式形式给出了系统分析和控制综合条件.飞行控制仿真结果说明此算法不仅可以成功克服饱和非线性,且对时变参数和动态不确定性具有良好的鲁棒性.     

基于ATSQL2时间点与时间段时态操作扩充

以时态数据操作语言ATSQL2为基础,对其时间点与时间段查询运算操作存在的不足进行扩充。增加时间运算操作函数,完成不同时态逻辑时间段运算,不同时间粒度之间的转换和时间比较逻辑判断操作。结果表明,扩充后的时间运算操作,丰富了原有ATSQL2的查询操作语义,简化了复杂时态数据操作语句的书写,使时态查询操作更加高效、简便。     

用Pro/E对过约束运动平台动态仿真分析研究

针对过约束多体运动机构的动态受力分析难点,以一个具体的多曲轴运动平台为例,提出一种基于Pro/E中Mechanism仿真模块进行动态仿真的解决方法。在Pro/E中进行了3维建模;针对分析的重点,对系统模型进行了适当简化;并结合虚拟样机技术在Pro/E中的具体运用,对简化模型进行动态仿真;并运用仿真结果分析了各类因素对该机构运动及受力的影响,提出了优化设计方案。     

保持空间准确度与时间一致性的深度估计算法

为提高深度图的准确度,提出了一种基于图割的深度估计算法. 利用平均亮度 梯度联合匹配测度函数代替单像素亮度匹配,并考虑邻近像素深度相关性改变图割网络结构,提高深度估计的空间准确度;采用前一时刻同位置像素的深度约束当前时刻像素的深度值,使估计的深度图在时间上保持一致. 提出的算法考虑了深度图的空间、时间特征,可以提高深度图的准确度. 实验结果表明,与传统的基于图割的深度估计算法相比,新算法估计的深度图更加准确.     

子矩阵约束下的反对称阵特征值反问题

矩阵的特征值反问题在结构设计、振动系统参数识别和自动控制等领域具有广泛应用。给出了子矩阵约束下反对称矩阵反问题解的一般表达式,并且给出了解的最佳逼近解。