Formal verification of collaboration patterns in healthcare

We propose a computer-based framework for the formal verification of collaboration patterns in healthcare teams. In this, the patterns are constructed diagrammatically as compositions of keystones that are viewed as abstract processes. The approach provides mechanisms for ensuring that safety properties are enforced and exceptional events are handled systematically. Additionally, a fully verified, executable model is obtained as an end product, enabling a simulation of its associated collaboration scenarios.     

Sets of Globally Optimal Stream Surfaces for Flow Visualization

Stream surfaces are a well‐studied and widely used tool for the visualization of 3D flow fields. Usually, stream surface seeding is carried out manually in time‐consuming trial and error procedures. Only recently automatic selection methods were proposed. Local methods support the selection of a set of stream surfaces, but, contrary to global selection methods, they evaluate only the quality of the seeding lines but not the quality of the whole stream surfaces. Global methods, on the other hand, only support the selection of a single optimal stream surface until now. However, for certain flow fields a single stream surface is not sufficient to represent all flow features. In our work, we overcome this limitation by introducing a global selection technique for a set of stream surfaces. All selected surfaces optimize global stream surface quality measures and are guaranteed to be mutually distant, such that they can convey different flow features. Our approach is an efficient extension of the most recent global selection method for single stream surfaces. We illustrate its effectiveness on a number of analytical and simulated flow fields and analyze the quality of the results in a user study.     

一种并行信号处理软件的集成开发框架*

论文提出一种面向信号处理应用的并行软件可视化开发框架。首先采用SDF图对信号处理应用进行分析,建立并行信号处理计算软件元模型,使用EBNF范式描述元模型。其次使用Eclispe GMF建模技术构建基于元模型的信号处理并行计算软件可视化建模平台,并实现了图形模型到XM L目标模型的解析转换。最后运用实例验证了该框架的有效性。     

基于改进 GNY 逻辑的 Kerberos *协议安全性分析磁

为了增强通讯网络安全性,研究者致力于通讯协议的形式化分析与验证。 Abdelmajid 在 Kerberos 协议中添加用户物理位置作为新的认证因素得到改进协议,并用改进 BAN 逻辑说明改进协议的安全性。针对添加用户物理位置这一因素进一步完善后的协议 Kerberos *,结合可识别性和管辖性构造一种新的管辖规则,运用改进 GNY 逻辑对协议 Ker-beros *进行安全性分析。分析结果表明,协议 Kerberos *是安全的,运用改进 GNY 逻辑证明过程比改进 BAN 逻辑更详细、更严谨,此方法可运用于其它类似协议形式化分析。     

基于 Spin/Promela 的 Woo-Lam 协议安全性质高效验证磁

形式化方法是分析验证安全协议的重要技术之一。模型检测是用在形式化方法中实现形式化自动验证的重要手段。基于 Promela 语言,将 P ．Maggi 和 R ．Sisto 提出的建模方法扩展到建立包含三个合法主体和一个攻击者的复杂模型,枚举法和打表法同时被运用在求解攻击者模型需要表示的知识项过程中,提高了协议建模效率,保证了建模准确性。以Woo-Lam 协议为例,运用 Spin 工具成功发现一个已知著名攻击。此通用方法适用于类似复杂协议形式化分析与验证。     

带时间和资源约束的实例化过程模型验证方法

软件过程的性能是由软件过程模型和软件过程实例化两方面因素决定,如果对软件过程进行了不恰当的实例化,会导致成本超支、进度延期、甚至项目失败．已有的过程描述法不足以分析实例化过程模型,由于没有考虑实例化阶段的时间资源约束,语法结构正确的过程模型并不能保证过程执行的正确性．提出一种带时间和资源约束的实例化过程模型验证方法,为目前已有的s-TRISO／ML建模语言增加时间和资源约束属性,然后提出了从s-TRISO／ML模型转换成时间自动机的转换方法和实现算法,利用已有的分析工具Uppaal对转换得到的时间自动机的性质进行验证,得到一个合理的实例化模型,从而为真实的开发流程提供指导．     

双序渐进式概念格合并算法

针对传统的概念格合并算法仅为单向的纵向或横向合并,提出一种基于概念内涵、外延升降序的双序渐进式合并算法。按照概念的内涵或外延的升序和降序,从两个方向(由上到下和由下到上)同时进行子概念格的纵向或横向合并。算法分析和示例结果表明,该算法不仅在结构上较好地保留了原有信息,而且在效率上也获得了显著的提高。     

A reactive extension of the OpenMusic visual programming language

Objectives: OpenMusic (OM) is a domain-specific visual programming language designed for computer-aided music composition. This language based on Common Lisp allows composers to develop functional processes generating or transforming musical data, and to execute them locally by demand-driven evaluations. As most historical computer-aided composition environments, OM relies on a transformational declarative paradigm, which is hard to conciliate with reactive data-flow (an evaluation scheme more adequate to the development of interactive systems). We propose to link these two evaluation paradigms in the same and consistent visual programming framework.Methods: We establish a denotational semantics of the visual language, which gives account for its demand-driven evaluation mechanism and the incremental construction of programs. We then extend this semantics to enable reactive computations in the functional graphs.Results: The resulting language merges data-driven executions with the existing demand-driven mechanism. A conservative implementation is proposed.Conclusions: We show that the incremental construction of programs and their data-driven and demand-driven evaluations can be smoothly integrated in the visual programming workflow. This integration allows for the propagation of changes in the programs, and the evaluation of graphically designed functional expressions as a response to external events, a first step in bridging the gap between computer-assisted composition environments and real-time musical systems.     

全局性模态词与基本模态语言的扩充

模态语言是讨论关系结构的一种简洁的语言。基本模态语言是仅有一个模态算子◇的模态语言,用ML（◇）表示此语言,但基本模态语言对框架关系的表达力并不是完全的,加入新的模态算子是增强模态语言表达力的方法之一。在基本模态语言ML（◇）基础上增加全局性模态词“E”得到ML（◇,E）语言,这种更丰富的语言对关系模型和关系框架的表达力明显强于基本模态语言。     

RP/RE技术与比例式设计

RP/RE制造技术与设计美学的有机结合,形成了具有竞争力和规模化的设计业,提高了企业创新设计和产品市场开发的能力.运用RP/RE技术得到实体模型,再以设计美学原则对其进行分析、数据处理、美化形态,促进产品开发、研制和销售.工业产品的形态比例关系,受诸多因素的制约.分析了传统的比例设计方法的缺陷与不足,介绍比例式设计的原理、方法及其具体应用.表明比例式设计具有数理性强,计算方便、简捷,容易掌握的特点.而且能根据功能要求、技术参数和使用对象等因素,迅速找出产品的最佳比例值,有效地解决功能和形式之间的协调关系.