基于UML的嵌入式绗缝测试系统研究

为提高电脑绗缝机伺服运动控制系统的特性与可靠性,设计并实现了一种基于UML的嵌入式绗缝测试系统。以绗缝系统的需求规格、各种规范、标准和协议为基础,以UML的分析设计规约文档作为设计的重要依据,通过对UML文档的词法语法分析,利用类图、活动图、用例图分别完成单元测试、类簇测试和系统测试,通过分析测试结果完善绗缝系统的设计。     

一种基于随机化均匀设计点集的遗传算法用于求解MVCP

基于理想浓度模型的机理分析,利用随机化均匀设计的理论和方法,对遗传算法中的交叉操作进行重新设计,并在分析图最小顶点覆盖问题特点的基础上,结合扫描-修正和局部改进策略,给出一个解决图最小顶点覆盖问题的遗传算法,称之为基于随机化均匀设计点集的遗传算法。通过将该算法与简单遗传算法和佳点集遗传算法进行求解图最小顶点覆盖问题的仿真模拟比较,可看出该算法提高求解的质量、速度和精度。     

基于物联网的校园身份识别系统的设计与实现

校园中的部门较为繁杂且人员较多，尤其是大学校园，由于自由度较高，在管理方面需要耗费巨大的人力和物力。想要确保开放式管理的效果，实现校园内部的安全管理，需要推行智慧校园管理模式，其中基于物联网（Internet of Things,IoT）的校园身份识别系统是最为重要的实现环节。文章分析了系统的设计需求和设计原则，阐述了整个系统的设计要点，包括网络拓扑图、软件体系结构、系统构架，以期能够为同行业工作人员提供一些帮助。     

基于面向对象技术实现酒店管理信息系统

采用面向对象的分析和设计方法，运用UML用例图、时序图、类图和Rational Rose设计工具进行酒店管理信息系统的分析设计，并用PowerBuilder7．0加以实现。     

基于思维方式的软件开发

给出一个用于软件开发的实验性原型ＷＹＨ系统，该系统通过将面向对象的分析与设计同思维方式相结合来分析需求和设计３软件。并采用分层次的功能结构图，面向对象、操作图、类层次图和规范说明语言ＯＯＬＯ作为开发人员与用户的媒介。     

基于多维度分析的配电网图模校核系统设计

文章从配电网图模校核系统的功能性出发，设计系统总体架构，并优化硬件拓扑结构，对开关的种类和功能进行设计与划分。分离图形文件和模型文件，并进行分别校验，根据配电网结构从拓扑连通率、图模关系完整率、ID/名称的属性唯一率、图模匹配概率等多维度进行计算，作为配电网图模校核的多维度分析指标，最后基于系统结构设计校核流程。设计算例仿真实验，结果表明系统校核过程的迭代收敛性更好，校核结果在检修模拟中的成本更低，供电可靠性更高。     

基于PWM/PFM的压电变压器驱动电路的设计与仿真

利用PWM／PFM控制IC组成驱动电路来驱动压电变压器，给出了驱动电路的原理图，对电路工作原理做了详细的分析，并用仿真软件HSPICE对电路进行仿真，仿真结果证明该电路能满足驱动压电变压器的要求。     

基于任务图的一种并行程序设计方法（I）：任务图的设计

本提出一种基于任务图的并行程序设计方法。首先分析欲解的问题，产生数据流程图，并以此设计出表示并行算法的任务图，然后根据任务图选择合适的系统拓扑结构，最后完成后行程序的设计。该方法思路清晰，富有条理，产生的并行程序质量较高。     

穿鞋足迹序列的足迹能量图组表达与识别

目的 现有的足迹研究主要针对赤足和穿袜足迹，取得了较高的识别精度，但需要进行脱鞋配合；而单枚穿鞋足迹由于受到鞋底花纹的影响，识别精度低，主要用于检索。由于穿鞋足迹序列不仅包含人足的结构特征还包含人行走的运动特征，将其用于人身识别会比基于单枚穿鞋足迹的识别精度高。基于此，本文对基于穿鞋足迹序列的身份识别方法进行了研究，提出了穿鞋足迹序列的足迹能量图组表达与识别算法。方法 构建反映人足结构和走路行为特性的足迹能量图组来表达足迹序列，从而进行身份识别。足迹能量图组由步态能量图、步幅能量图和步宽能量图构成。步态能量图反映的是足底各个部位与承痕体相互作用形成的效果以及脚的解剖结构特征；步幅能量图和步宽能量图反映的是行走过程中双脚的空间搭配关系以及运动特征，体现人的行为信息。足迹序列之间的匹配得分由各能量图之间的相似度加权计算，其中加权系数采用铰链损失函数训练而得，各能量图之间的相似度采用归一化互相关函数计算而得。将匹配得分最高的足迹序列对应的标签作为最终的识别结果。结果 根据采集方式、鞋的新旧程度和鞋底花纹种类构建了3个数据集，分别为采用光学成像仪采集的穿日常鞋的穿鞋足迹序列数据集MUSSRO-SR、采用光学成像仪采集的穿同花纹新鞋的穿鞋足迹序列数据集MUSSRO-SS和采用墨拓扫描方式采集的穿新鞋的穿鞋足迹序列数据集MUSSRS-SS。分别在上述3个数据集上进行了识别模式和验证模式实验，识别率分别达到100%、97.65%和83%，等错误率分别为0.36%、1.17%和6.99%。结论 在3种类型不同的数据集上的实验结果表明，本文提出的足迹能量图组能够实现对穿鞋足迹序列的有效表达，并实际验证了基于穿鞋足迹序列的身份识别的可行性。     

基于任务图的一种并行程序设计方法（Ⅰ）──任务图的设计

本文提出一种基于任务图的并行程序设计方法．首先分析欲解的问题，产生数据流程图，并以此设计出表示并行算法的任务图，然后根据任务图选择合适的系统拓扑结构，最后完成并行程序的设计．该方法思路清晰，富有条理，产生的并行程序质量较高．     

Approximation of Generalized Voronoi Diagrams by Ordinary Voronoi Diagrams

A numerically robust algorithm for the ordinary Voronoi diagrams is applied to the approximation of various types of generalized Voronoi diagrams. The generalized Voronoi diagrams treated here include Voronoi diagrams for figures, additively weighted Voronoi diagrams, Voronoi diagrams in a river, Voronoi diagrams in a Riemannian plane, and Voronoi diagrams with respect to collision-avoiding shortest paths. The construction of these generalized Voronoi diagrams is reduced to the construction of the ordinary Voronoi diagrams. The methods proposed here can save much time which is otherwise necessary for writing a computer program for each type of generalized Voronoi diagram.     

PaL diagrams: A linear diagram-based visual language

Linear diagrams have recently been shown to be more effective than Euler diagrams when used for set-based reasoning. However, unlike the growing corpus of knowledge about formal aspects of Euler and Venn diagrams, there has been no formalisation of linear diagrams. To fill this knowledge gap, we present and formalise Point and Line (PaL) diagrams, an extension of simple linear diagrams containing points, thus providing a formal foundation for an effective visual language. We prove that PaL diagrams are exactly as expressive as monadic first-order logic with equality, gaining, as a corollary, an equivalence with the Euler diagram extension called spider diagrams. The method of proof provides translations between PaL diagrams and sentences of monadic first-order logic.     

由序列图合成状态图

序列图和状态图对于描述和理解面向对象软件系统有着极其重要的作用。符合UML标准的序列图和状态图存在信息重叠，根据序列图提供的信息可以合成状态图。给出了在Rational Rose中由序列图合成状态图工具的实现。     

移动点Voronoi图拓扑维护策略的研究

移动环境下基于Voronoi图的最近邻查询必须要解决随时间不断改变的移动点Voronoi图的拓扑结构的维护问题。通过一组离散的,有限的事件序列对其对偶图Delaunay图拓扑改变过程的模拟来实现对移动点Voronoi图拓扑结构的维护。把带有事件驱动机制的移动数据结构（Kinetic Data Structure,KDS）模型作为移动点的运动模型,给出了KDS模型对其对偶图Delaunay图拓扑结构改变维护的具体策略,并对移动环境下动态插入或删除移动点时Voronoi图的拓扑维护问题进行了研究。最后给出了移动环境下基于Voronoi图的近邻查询的数据库实现模型。     

Spider Diagrams: A Diagrammatic Reasoning System

Spider diagrams combine and extend Venn diagrams and Euler circles to express constraints on sets and their relationships with other sets. These diagrams can be used in conjunction with object-oriented modelling notations such as the Unified Modelling Language. This paper summarises the main syntax and semantics of spider diagrams. It also introduces inference rules for reasoning with spider diagrams and a rule for combining spider diagrams. This system is shown to be sound but not complete. Disjunctive diagrams are considered as one way of enriching the system to allow combination of diagrams so that no semantic information is lost. The relationship of this system of spider diagrams to other similar systems, which are known to be sound and complete, is explored briefly.     

UML2.0的新特性以及在选课系统中的应用

本文介绍了UML2.0规约的修订过程和一些新特性,并且以高校的选课系统为例子,描述了UML2.0中的活动图,用况图,类图,顺序图以及通讯图相对于UML1.0的改进。最后还对UML的未来发展做了客观的分析。     

Robust Computation of 3D Apollonius Diagrams

Apollonius diagrams, also known as additively weighted Voronoi diagrams, are an extension of Voronoi diagrams, where the weighted distance is defined by the Euclidean distance minus the weight. The bisectors of Apollonius diagrams have a hyperbolic form, which is fundamentally different from traditional Voronoi diagrams and power diagrams. Though robust solvers are available for computing 2D Apollonius diagrams, there is no practical approach for the 3D counterpart. In this paper, we systematically analyze the structural features of 3D Apollonius diagrams, and then develop a fast algorithm for robustly computing Apollonius diagrams in 3D. Our algorithm consists of vertex location, edge tracing and face extraction, among which the key step is to adaptively subdivide the initial large box into a set of sufficiently small boxes such that each box contains at most one Apollonius vertex. Finally, we use centroidal Voronoi tessellation (CVT) to discretize the curved bisectors with well-tessellated triangle meshes. We validate the effectiveness and robustness of our algorithm through extensive evaluation and experiments. We also demonstrate an application on computing centroidal Apollonius diagram.     

On the complexities of consistency checking for restricted UML class diagrams

Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This study focuses on the tractable consistency checking of UML class diagrams. We accurately identify inconsistencies in these diagrams by translating them into first-order predicate logic that is generalized by counting quantifiers and classify their expressivities by eliminating certain components. We introduce optimized algorithms that compute the respective consistencies of class diagrams of different expressive powers in P, NP, PSPACE, or EXPTIME with respect to the size of the class diagrams. In particular, owing to the restrictions imposed on attribute value types, the complexities of consistency checking of class diagrams decrease from EXPTIME to P and PSPACE in two cases: (i) when the class diagrams contain disjointness constraints and overwriting/multiple inheritances and (ii) when the class diagrams contain both these components along with completeness constraints. Additionally, we confirm the existence of a restriction of class diagrams that prevents any logical inconsistency.     

Are use case and class diagrams complementary in requirements analysis? An experimental study on use case and class diagrams in UML

Despite the status of united modeling language (UML) as the de facto standard for object oriented modeling, it has received controversial reviews. The most controversial diagram in UML is the use case diagram. Some practitioners claim that use case diagrams are not valuable in requirements analysis and some have even argued that use case diagrams should not be part of UML. This research examined the values of use case diagram in interpreting requirements when use case diagrams are used in conjunction with class diagrams. In other words, the study investigated the possible synergetic values and relationships between the use case and class diagrams in the context of requirements analysis. This study used theories from cognitive psychology as its theoretical and conceptual foundation. The data collection utilized the verbal protocol technique in which subjects were asked to think aloud as they interpreted the use case and class diagrams. The results show that the use case diagrams were more completely interpreted than the class diagrams. The presence or absence of one diagram when interpreting another diagram had no effect on the outcome of the interpretation. From the results, we argue that the use case diagrams and class diagrams depict different aspects of the problem domain, they have very little overlap in the information captured, and both are necessary in requirements analysis.