无线体域网高能效竞争接入机制研究

低能耗是无线体域网WBAN通信最重要的指标.构建了IEEE 802.15.6无线体域网CSMA/CA竞争接入的功耗模型,分析了用户优先级、MAC帧负荷尺寸和数据到达量对信道接入能耗的影响,提出了一种通过数据汇聚传输提高能量效率的增强型信道接入方法.仿真结果表明,在低业务量及混合业务场景下,所提方法能够显著减少信道接入的能量消耗.     

Synchronization for linear singularly perturbed complex networks with coupling delays

This paper is concerned with the synchronization problem about linear singularly perturbed complex network system with coupling delay. The sufficient delay-dependent conditions for the synchronization of the network are established by introducing an equivalent network system with the Lyapunov stability theory. These conditions, which are formulated in terms of linear matrix inequalities, can be solved efficiently by the LMI toolbox of MATLAB. A simulation example is provided to show the validity of the proposed the synchronization conditions of the whole network.     

Toward Self‐Motivated,Cognitive, Continually Planning Agents

We present a flexible initial framework for defining self‐motivated, self‐aware agents in simulated worlds, planning continuously so as to maximize long‐term rewards. While such agents employ reasoned exploration of feasible sequences of actions and corresponding states, they also behave opportunistically and recover from failure, thanks to their continual plan updates and quest for rewards. Our framework allows for both specific and general (quantified) knowledge and for epistemic predicates such as knowing‐that and knowing‐whether. Because realistic agents have only partial knowledge of their world, the reasoning of the proposed agents uses a weakened closed‐world assumption; this has consequences for epistemic reasoning, in particular introspection. The planning operators allow for quantitative, gradual change and side effects such as the passage of time, changes in distances and rewards, and language production, using a uniform procedural attachment method. Question answering (involving introspection) and experimental runs are shown for our particular agent ME in a simple world, demonstrating the value of continual deliberate, reward‐driven planning. Though the primary merit of agents definable in our framework is that they combine all of the aforementioned features, they can also be configured as single or multiple goal‐seeking agents and as such perform comparably with some recent experimental agents.     

On Weakly Smooth Uninorms on Finite Chain

In this paper, we characterize all weakly smooth uninorms (i.e., uninorms with smooth underlying operators) defined on a finite chain. It is proved that any such uninorm is determined by three unary functions and vice versa. As a by‐product, we obtain the characterizations of smooth t‐norms, smooth t‐conorms through additive generators and show that on a finite chain, there exists no counterpart of the class of uninorms continuous in ]0, 1[².