A study on multi-dimensional products of graphs and hybrid logics

In this work, we address some issues related to products of graphs and products of modal logics. Our main contribution is the presentation of a necessary and sufficient condition for a countable and connected graph to be a product, using a property called intransitivity. We then proceed to describe this property in a logical language. First, we show that intransitivity is not modally definable and also that no necessary and sufficient condition for a graph to be a product can be modally definable. Then, we exhibit a formula in a hybrid language that describes intransitivity. With this, we get a logical characterization of products of graphs of arbitrary dimensions. We then use this characterization to obtain two other interesting results. First, we determine that it is possible to test in polynomial time, using a model-checking algorithm, whether a finite connected graph is a product. This test has cubic complexity in the size of the graph and quadratic complexity in its number of dimensions. Finally, we use this characterization of countable connected products to provide sound and complete axiomatic systems for a large class of products of modal logics. This class contains the logics defined by product frames obtained from Kripke frames that satisfy connectivity, transitivity and symmetry plus any additional property that can be defined by a pure hybrid formula. Most sound and complete axiomatic systems presented in the literature are for products of a pair of modal logics, while we are able, using hybrid logics, to provide sound and complete axiomatizations for many products of arbitrary dimensions.     

Specifications for decidable hybrid games

We introduce STORMED hybrid games (SHG), a generalization of STORMED hybrid systems, Vladimerou et al. (2008) [33], which have natural specifications that allow rich continuous dynamics and various decidable properties. We solve the control problem for SHG using a reduction to bisimulation on finite game graphs. This generalizes to a greater family of games, which includes o-minimal hybrid games, Bouyer et al. (2006) [6]. We also solve the optimal-cost reachability problem for Weighted SHG and prove decidability of WCTL for Weighted STORMED hybrid systems.     

基于.NET平台的海缆埋设机监控软件的设计和实现

为了实现海缆埋设中数据的存储和管理,设计了海缆埋设机监控软件.软件在.NET Framework2.0平台上开发,采用关系数据库Access进行数据存储,实现了数据的交互、查询,曲线的绘制和打印等功能.与传统管理软件相比,海缆埋设机监控软件采用定时器工具,增加了系统对数据的实时性操作.着重对系统中实时曲线打印和数据多日...     

基于分布式参数电路模型检测电缆故障

设计一种基于分布式参数模型查找电缆故障点系统,以NiosⅡ软核处理器和所需的外设IP核嵌入到FPGA中为硬件架构,移植μC/OS-Ⅱ实时操作系统为软件体系,实现故障的检测,具有广泛的适用性和良好的应用前景。     

基于18F4520的风光互补路灯控制系统的研究

可再生能源的综合利用对社会经济的可持续发展和环境保护有着十分重要的作用,太阳能和风能作为两种应用广泛的可再生资源,在资源条件和技术应用上都具互补性.本文介绍了以PIC18F4520单片机为控制核心的风光互补路灯系统的硬件结构、工作原理与软件设计方法,实现了对风光互补路灯系统的智能化管理和控制,系统运行可靠,成本低,易于实现,便于维护升级.     

混合马尔科夫预测模型及其在反洗钱中的应用研究

反洗钱中的一个重要问题是预测可疑账户未来可能发生的交易。马尔科夫模型在股票、商品价格、市场占有率等经济领域的预测中具有广泛的应用,但单一的马尔科夫模型的预测准确性有待提高。提出一种结合数据挖掘中聚类、关联规则和低序马尔科夫模型的混合马尔科夫模型,并在模型的建立过程中基于置信度进行剪枝以降低时间复杂度,最后将该模型用于预测反洗钱领域中账户之间的交易。实验表明,该模型具有较高的预测准确性,并在预测准确性和时间复杂度两者之间取得了较好的平衡。     

ZJF-1型动力电缆载波设备及其在采煤机上的应用

介绍了ZJF - 1型动力电缆载波设备的组成、工作原理、FSK调制技术及PLD器件的应用等。并针对现场使用情况提出改造方向。     

混合学习模式ANN组合的研究

无监督及监督式两种学习模式网络的组合,能够解决单一模式难以模拟的问题,因而功能更强,适用于更广。本文在探讨这种组合网络特点的基础上,提出组合的一般框图及相应的实际方式,并结合具体问题对其性能作了讨论。     

基于HPN仿真的混杂系统分层调度方案

本文针对混杂系统中分段式生产的调度问题提出了一种分层调度的解决方案。在调度的上层将混杂系统中连续变量进行离散化处理,给出易于求解的静态调度方案：在下层利用HPN（bybrid Petrinet,混杂Petri网）仿真反馆调度信息,补偿上层调度中由于模型的离散化而丢失的动态信息。通过两层之间的通信达到整体调度方案的快速性、实时性和鲁棒性。     

基于成本的数据库查询优化浅析

主要介绍基于成本的数据库查询优化的一些基本概念,针对多表连接的三种方法：嵌套循环链接、归并连接和混合连接进行分析和阐述．并成本估算,列出估算公式,