基于铱星的浮标远程监测与数据传输系统

针对海洋定点垂直剖面监测系统,设计并实现了一种基于铱星的浮标远程监测与数据传输系统。它主要由带有WINCE5.0操作系统的AT91SAM9G20主控板和铱星通信终端组成。为了降低系统功耗以达到长期无人值守监测要求,采用基于STC12C5A60S2的浮标状态监测板代替主控板监测浮标、锚灯和电池的状态。三者通过串口通信实现数据的传输。     

基于SPCE061A的矿山锅炉水温监测系统设计

根据某矿山锅炉厂的实际运行情况,提出了一种基于SPCE061A的锅炉水温监测系统的设计方案。该系统可实时采集、记录、显示锅炉水温,当温度超过一定限度时发出声光报警;并采用串行通信方式将测量到的水温数据发送到上位机,由上位机监控软件对现场水温进行处理、显示。试运行结果表明,该系统效果良好。     

实时微控制器与20-SIM仿真模型的共同仿真实现

基于单片机实时控制是嵌入式控制系统的主要部分。讨论如何在20-SIM平台上建立用户自己的目标模板。内容包括系统模型的建立、模型的结构和目标模板的调整。重点讨论模型模板结构和在具体装置中对模型模板的调整过程。最后给出一个测试实验。     

基于STM32的智能温控杯控制系统设计

设计以ARM STM32F103作为系统控制核心,使用DS18B20测量温度,以半导体制冷器件作为降温设备,以PTC发热片作为升温设备,用LCD1602液晶进行显示,实现对杯内水温的有效控制。通过反复验证,该温控系统具有操作简单、精度较高、工作可靠和性价比高等特点。     

Output feedback control of linear fractional transformation systems subject to actuator saturation

In this paper, the control problem for a class of linear parameter varying (LPV) plant subject to actuator saturation is investigated. For the saturated LPV plant depending on the scheduling parameters in linear fractional transformation (LFT) fashion, a gain-scheduled output feedback controller in the LFT form is designed to guarantee the stability of the closed-loop LPV system and provide optimised disturbance/error attenuation performance. By using the congruent transformation, the synthesis condition is formulated as a convex optimisation problem in terms of a finite number of LMIs for which efficient optimisation techniques are available. The nonlinear inverted pendulum problem is employed to demonstrate the effectiveness of the proposed approach. Moreover, the comparison between our LPV saturated approach with an existing linear saturated method reveals the advantage of the LPV controller when handling nonlinear plants.     

Some fixed point theorems in 1-M-complete fuzzy metric-like spaces

Very recently, in order to unify the notions of fuzzy metric space and metric-like space, Shukla and Abbas introduced the concept of fuzzy metric-like space and proved some fixed-point results in this setting. In this article, we modify the notion of Cauchy sequence and completeness to generalize their results. Thus, we extend their theorems to a more general framework, which is also appropriate to generalize some recent, well-known results in this line of research. Furthermore, several examples are presented to illustrate the significance of our results.     

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.