TMS320VC5410的McBSP串行接口技术与程序设计

介绍TMS320VC5410的多功能串行接口（McBSP）,并结合McBSP与高精度、高速率串行数模转换器MAX541之间的串行通信,从硬件和软件两个方面具体讨论McBSP的设计方法。     

TMS320C54XX系列DSP的McBSP串行接口技术及应用

介绍了TMS320C54XX系列DSP的多通道串行接口(McBSP),并结合McBSP与具有IrDA模式的UART芯片MAX3111的接口设计,从硬件和软件两个方面具体讨论McBSP的设计方法.     

TMS320VC5410的McBSP串行接口技术与程序设计

介绍TMS320VC5410的多功能串行接口(McBSP),并结合McBSP与高精度、高速率串行数模转换器MAX541之间的串行通信,从硬件和软件两个方面具体讨论McBSP的设计方法.     

基于TMS320F2812多通道缓冲串口高速实时数据采集接口设计

本文介绍了TMS320F2812的多通道缓冲串口(McBSP)的工作过程及其控制寄存器的配置方法．说明了如何利用McBSP fifo完成数据采集,并以ADS8361为例介绍了多通道缓冲串口(McBSP)和串行A／D的硬件接口和数据采集程序的设计．     

基于TMS320VC5402McBSP串口的DMA方式数据传输的实现

在介绍TMS320VC5402McBSP的多信道缓冲串口（McBSP）的基础上,分析了其控制寄存器的配置和工作过程,并给出了在直接存储器访问（DMA）方式下利用McBSP串口进行通信的方法及程序代码。     

基于FPGA的雷达信号处理器测试台McBSP接口设计

基于FPGA的雷达信号处理器测试台的McBSP接口,主要应用于测试台和处理器间的串行通信.对McBSP接口的功能进行说明,介绍了系统的原理和缓冲模块的设计,详细分析FPGA内部逻辑规划、分配以及模块间的通信过程.实验证明,应用FPGA实现的McBSP接口完全满足工程需求,适合雷达信号处理器测试台和处理器间通信.     

基于McBSP的高速串行数据采集系统设计

介绍了AD公司的串行模数转换芯片AD974及TI公司的TMS320C6711芯片多通道缓冲串口(McBSP)的工作原理。采用McBSP的SPI(SeriesProtocolInterface)工作模式,可将McBSP与AD974直接相连,从而无须任何转换而实现高速串行数据传输,并给出了AD974芯片与McBSP的接口电路及软件设计。     

MAX186与DSP的SPI接口及设计

介绍了MAXIM公司的串行模数转换芯片MAX186及TI公司TMS320C6711 DSP的多通道缓冲串口(McBSP)的工作原理.采用McBSP的SPI(Series Protocol Interface)工作模式,将McBSP与MAX186直接相连,从而基于DSP多功能缓冲串口的数据采集及信号处理系统.给出了MIX186与TMS320C6711 McBSP的接口电路及软件编程实现.     

MAX186与DSP的SPI接口及设计

介绍了MAXIM公司的串行模数转换芯片MAX186及TI公司TMS320C6711DSP的多通道缓冲串口(McBSP)的工作原理。采用McBSP的SPI(SeriesProtocolInterface)工作模式,将McBSP与MAX186直接相连,从而基于DSP多功能缓冲串口的数据采集及信号处理系统。给出了MIX186与TMS320C6711McBSP的接口电路及软件编程实现。     

TMS320C5402与MAX1270的SPI接口设计与实现

根据 MAXIM 公司的12位串行模数转换芯片 MAX1270及 TI 公司 TMS320C5402 DSP 的多通道缓冲串口(McBSP)的工作原理,设计了高速传输通道,采用 McBSP 的 SPI(Series Protocol Interface)工作模式,将 McBSP 与 MAX1270直接相连,不需要占用并行数据总线,避免了总线冲突。给出了MAX1270与 TMS320C5402的 McBSP 的接口电路及软件编程实现。     

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.     

由序列图合成状态图

序列图和状态图对于描述和理解面向对象软件系统有着极其重要的作用。符合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.     

基于UML的人力资源管理系统的分析设计

以人力资源管理系统（HR）为对象,利用Rational Rose建模工具,通过用例图、活动图、顺序图以及类图等分析设计模型进行分析设计,介绍了UML在实际项目开发中的应用。     

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.     

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.     

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.     

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.