This paper proposes a statistical method for no-reference image quality assessment using steerable pyramid decomposition without any prior knowledge about the distortions of the original image. Because the means of (l...
详细信息
In this paper, we propose a distributed cooperative voltage equalization strategy in order to balance the voltages of the series-connected super-capacitors, which is the power supply of energy storage light rail vehic...
详细信息
ISBN:
(纸本)9781479917730
In this paper, we propose a distributed cooperative voltage equalization strategy in order to balance the voltages of the series-connected super-capacitors, which is the power supply of energy storage light rail vehicles. Taking each super-capacitor cell as an agent in multi-agent systems, the voltage equalization problem can be formulated as a cooperative tracking problem. The sparse communication network among the super-capacitors in the cyber layer can be modeled by a digraph. As the voltage changes within a limited range, a general saturation function is put forward to guarantee the boundedness of the control input. Based on the nearest neighborhood rule, a bounded voltage equalization controller with tunable control gains is designed accordingly. The proposed voltage equalization methodology is distributed and not using a central controller. Each super-capacitor cell only need its voltage information and its neighbors, the desired control objective can be accomplished by local interaction in a cooperative way. Under the assumption that the digraph has a spanning tree, the asymptotically stability of the overall close-loop system is rigorously proved with the aid of a novel Lyapunov function integrating Lasalle invariant principle. The voltage equalization has been achieved by the proposed cooperative control approach, which is verified by the simulations. under different initial conditions, cooperative objectives and different network sizes.
Spiking neural P systems with weights(WSN P systems,for short)are a new variant of spiking neural P systems,where the rules of a neuron are enabled when the potential of that neuron equals a given *** is known that WS...
详细信息
Spiking neural P systems with weights(WSN P systems,for short)are a new variant of spiking neural P systems,where the rules of a neuron are enabled when the potential of that neuron equals a given *** is known that WSN P systems are universal by simulating register ***,in these universal systems,no bound is considered on the number of neurons and *** this work,a restricted variant of WSN P systems is considered,called simple WSN P systems,where each neuron has only one *** complexity parameter,the number of neurons,to construct a universal simple WSN P system is *** is proved that there is a universal simple WSN P system with 48 neurons for computing functions;as generator of sets of numbers,there is an almost simple(that is,each neuron has only one rule except that one neuron has two rules)and universal WSN P system with 45 neurons.
Characteristic of the problem of lost ore production is given. The results of usage of metal-cable, wood-cable and cable-stayed load-bearing and transecting canopies in ore mine practice are given. Parameters of const...
详细信息
This paper investigates the problem of global exponential lag synchronization of a class of switched neural networks with time-varying delays via neural activation function and applications in image encryption. The co...
详细信息
This paper investigates the problem of global exponential lag synchronization of a class of switched neural networks with time-varying delays via neural activation function and applications in image encryption. The controller is dependent on the output of the system in the case of packed circuits, since it is hard to measure the inner state of the circuits. Thus, it is critical to design the controller based on the neuron activation function. Comparing the results, in this paper, with the existing ones shows that we improve and generalize the results derived in the previous literature. Several examples are also given to illustrate the effectiveness and potential applications in image encryption.
In this paper we consider optimal parameter estimation with a constrained packet transmission rate. Due to the limited battery power and the traffic congestion over a large sensor network, each sensor is required to d...
详细信息
ISBN:
(纸本)9781479978878
In this paper we consider optimal parameter estimation with a constrained packet transmission rate. Due to the limited battery power and the traffic congestion over a large sensor network, each sensor is required to discard some packets and save transmission times. We propose a packet-driven sensor scheduling policy such that the sensor transmits only the important measurements to the estimator. Unlike the existing deterministic scheduler in [1], our stochastic packet scheduling is novelly designed to maintain the computational simplicity of the resulting maximum-likelihood estimator (MLE). This results in a nice feature that the MLE is still able to be recursively computed in a closed form, and the Cramer-Rao lower bound (CRLB) can be explicitly evaluated. Moreover, an optimization problem is formulated and solved to obtain the optimal parameters of the scheduling policy under which the estimation performance is comparable to the standard MLE (with full measurements) even with a moderate transmission rate. Numerical simulations are included to show the effectiveness.
Nowadays Cloud Computing has gained in importance at a remarkable pace. The key characteristic of this technology is the possibility to provide new resources to the services in an elastic way according to current dema...
详细信息
In two-tiered Wireless Sensor Networks (WSNs) relay node placement considering resource constraints and high overhead of the relay nodes plays a key role in extending the network lifetime. Therefore, approaches that s...
详细信息
ISBN:
(纸本)9781479984077
In two-tiered Wireless Sensor Networks (WSNs) relay node placement considering resource constraints and high overhead of the relay nodes plays a key role in extending the network lifetime. Therefore, approaches that support fewer relay nodes are desired to cover the WSNs. In this paper, we formulate the relay node placement problem as a Geometric Disc Covering (GDC) problem, and propose a novel local search approximation algorithm (LSAA) to solve the GDC problem. In the proposed LSAA, the sensor nodes are allocated into independent groups and then a Set Cover (SC) for each group is performed. The set of the SC for each group constitutes a SC of the GDC problem. LSAA is extensively investigated and analyzed by rigorous proof and the simulation results presented in this paper clearly demonstrate that the proposed LSAA outperform the approaches reported in literature in the reduction in deployed relay nodes.
We consider the event-triggered state estimation of a finite-state hidden Markov model with a general stochastic event-triggering condition. Utilizing the change of probability measure approach and the event-triggered...
详细信息
ISBN:
(纸本)9781479978878
We consider the event-triggered state estimation of a finite-state hidden Markov model with a general stochastic event-triggering condition. Utilizing the change of probability measure approach and the event-triggered measurement information available to the estimator, analytical expressions for the conditional probability distributions of the states are obtained, based on which the minimum mean square error event-based state estimates are further calculated. We show that the results also cover the case of packet dropout, under a special parameterization of the event-triggering conditions. With the results on state estimation, a closed-form expression of the average sensor-to-estimator communication rate is also presented. The effectiveness of the proposed results is illustrated by a numerical example and comparative simulations.
暂无评论