Explicit synchronisation of heterogeneous dynamics networks via three-layer communication framework

This paper addresses the explicit synchronisation of heterogeneous dynamics networks via three-layer communication framework. The main contribution is to propose an explicit synchronisation algorithm, in which the synchronisation errors of all the agents are decoupled. By constructing a three-layer node model, the proposed algorithm removes the assumptions that the topology is fixed and the synchronisation process is coupled. By introducing appropriate assumptions, the algorithm leads to a class of explicit synchronisation protocols based on the states of agents in different layers. It is proved in the sense of Lyapunov that, if the dwell time is larger than a threshold, the explicit synchronisation can be achieved for closed-loop heterogeneous dynamics networks under switching topologies. The results are further extended to the cases in which the switching topologies are only frequently but not always connected. Simulation results are presented with four single-link manipulators to verify the theoretical analysis.     

1553B通信协议的可依赖性讨论

1553B是飞机电传系统的通信协议,由于硬件上抗干扰仅考虑了系统内部自生的干扰,实际环境要严重得多;因为只按奇偶位作校验,所以错字漏检的概率比较大;由于回传状态字内容不全面,在漏检错字时会发生假冒错;由于指令字出错不易纠正,最好情况下靠2次重传,丢帧可能性大.漏检错帧和丢帧多会使多重冗余的表决机制失效,也会使网络管理类指令失效,成为潜伏的故障.通过定量分析,确定了一些情况下的失效率,例如假定取CAN,Profesafe同样的误码率ber=0.01时,除去最大值/最小值再取均值时的4冗余系统因错字漏检引起的每小时失效可达2×10-1次.     

使用Qt/C++编程操作Microsoft Office软件的应用

Microsoft office系列软件在日常工作中应用广泛。我单位在工程项目中大量使用Office软件进行数据处理及交换,对这些原始数据采取适当的方法分析挖掘,可以极大地缩短设计与试验周期、降低成本。由于项目产生的临时数据常以不同格式存放在各种办公软件中,且数量巨大,所以需要一个可以控制Office系列办公软件的程序来完成原始信息的收集及输出。给出了通过使用基于C++的Qt框架并结合COM、ODBC技术获取、处理数据,并输出至数据库或XML文档的实现方法。     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

Necessary optimality conditions for fuzzy variational problems

The main aims of this study are to derive the fuzzy Euler-Lagrange conditions for both fuzzy unconstrained and constrained variational problems based on the concepts of differentiability and integrability of a fuzzy mapping that may be parameterized by the left and right-hand functions of its α-level sets.     

Towards inverse modeling of turbidity currents: The inverse lock-exchange problem

A new approach is introduced for turbidite modeling, leveraging the potential of computational fluid dynamics methods to simulate the flow processes that led to turbidite formation. The practical use of numerical flow simulation for the purpose of turbidite modeling so far is hindered by the need to specify parameters and initial flow conditions that are a priori unknown. The present study proposes a method to determine optimal simulation parameters via an automated optimization process. An iterative procedure matches deposit predictions from successive flow simulations against available localized reference data, as in practice may be obtained from well logs, and aims at convergence towards the best-fit scenario. The final result is a prediction of the entire deposit thickness and local grain size distribution. The optimization strategy is based on a derivative-free, surrogate-based technique. Direct numerical simulations are performed to compute the flow dynamics. A proof of concept is successfully conducted for the simple test case of a two-dimensional lock-exchange turbidity current. The optimization approach is demonstrated to accurately retrieve the initial conditions used in a reference calculation.     

Strong stability of the mono-tubular heat exchanger equation with output feedback

We investigate asymptotic behavior of the C₀-semigroup T(t) associated with the mono-tubular heat exchanger equation with output feedback by a perturbation method. It is shown that T(t) is bounded if a constraint is satisfied by the parameters and the spatial distribution function. Further, applying the Arendt-Batty-Lyubich-Vu theorem, a criterion is established to judge strong stability of T(t).     

应用于Template框架的SVG Tiny创作工具的设计与实现

通过对Template框架的研究,对在该框架中引入SVG Tiny技术进行了研究,并为该框架设计和实现了SVG Tiny创作工具。     

基于西门子S7—300PLC和PRODAVE数据库的气力输送实验系统

本文介绍基于西门子S7—300PLC和PRODAVE数据链接库的气力输送实验系统。概述了气力输送实验系统工艺及功能要求,着重描述了该气力输送实验控制系统的硬件配置与软件设计。     

电炉法CS_2废气的治理

简介了电炉法CS2 废气吸附的原理及工艺流程 ,开辟了H2 S利用的新途径 ,具有较好的环境效益和经济效益