Priority-based target coverage in directional sensor networks using a genetic algorithm

Sensor networks have been applied in a wide variety of situations. Recently directional sensor networks consisting of directional sensors have gained attention. As for the traditional target coverage problem, the limited sensing angle of directional sensors makes it even more challenging. Moreover, individual targets may also be associated with differentiated priorities. Considering the distance between the directional sensors and targets influences sensing quality, this paper proposes the priority-based target coverage problem and strives to choose a minimum subset of directional sensors that can monitor all targets, satisfying their prescribed priorities. Due to the NP-Complete complexity, the minimum subset of directional sensors is approximated by using a genetic algorithm. Simulation results reveal the effects of multiple factors on the size of the resulting subset.     

Characterization of electrospun ZnO–SnO2 nanofibers for ethanol sensor

ZnO–SnO₂ nanofibers have been developed through in situ electrospinning technique and calcination. Poly(vinyl pyrrolidone) (PVP) is selected as fiber template. The composition of products can be controlled concisely by adjusting the compositions in their precursors. Under the optimized experimental conditions, the prepared product shows the desirable sensing characteristics towards ethanol gas at 300 °C, such as high response, excellent linearity in the range of 1–300 ppm, quick response time (5 s) and recovery time (6 s), good reproducibility, stability and selectivity.     

DCS电源供电系统的可靠性定量分析

根据DCS电源系统的现状,对目前几种不同的电源设计方案进行可靠性定量分析.通过建立不同DCS电源系统可靠性框图并估算相关的可靠性指标,比较了不同方案下的平均无故障工作时间 (MTBF),给出了系统可靠性的分析结果和改进措施,定量分析了改进后的方案.结果表明电源系统的MTBF有了明显的改善.     

基于模式驱动和模糊查询的模式发现方法

在蛋白质序列的比对研究中,拥有相似模式的蛋白质常常具有相似的功能.通过已知的蛋白质序列模式可以很方便地对新蛋白质序列的功能结构进行研究和确认.蛋白质序列的发现已成为一个很有意义的题目.对基于模式驱动Pratt算法进行改进以提高其效率,在原来基础上引入模糊查询方法,能够更为快捷地从互不相关的蛋白质序列集合中找出最具代表性的蛋白质模式.     

A Hybrid Heat Rate Forecasting Model Using Optimized LSSVM Based on Improved GSA

Heat rate value is considered as one of the most important thermal economic indicators, which determines the economic, efficient and safe operation of steam turbine unit. At the same time, an accurate heat rate forecasting is core task in the optimal operation of steam turbine unit. Recently, least squares support vector machine (LSSVM) is being proved an effective machine learning technique for solving nonlinear regression problem with a small sample set. However, it has also been proved that the prediction precision of LSSVM is highly dependent on its parameters, which are hardly choosing for the LSSVM. In the paper, an improved gravitational search algorithm (AC-GSA) is presented to further enhance optimal performance of GSA, and it is employed to serve as an approach for pre-selecting LSSVM parameters. Then, a novel soft computing method, based on LSSVM and AC-GSA, is therefore proposed to forecast heat rate of a 600 MW supercritical steam turbine unit. It combines the merits of the high accuracy of LSSVM and the fast convergence of GSA in order to build heat rate prediction model and obtain a well-generalized model. Results indicate that the developed AC-GSA–LSSVM model demonstrates better regression precision and generalization capability.     

Mean square detectability of LTI systems over finite-state digital block-fading channels

This paper studies the mean square quadratic (MSQ) detectability for multi-output networked systems over finite-state digital block-fading channels. The packet-loss rate of each digital fading channel depends on the channel power gain, as well as packet length and power level used for transmission. A finite-state random process is introduced to model time-varying fading channels, which characterizes various configurations of physical communication environment and/or different channel fading amplitudes. Necessary and sufficient conditions for MSQ detectability over finite-state Markov digital block-fading channels are given in the form of algebraic Riccati equations or linear matrix inequalities (LMIs). The estimation gain is given as a function of estimated/observed channel state. In addition, explicit conditions on network for MSQ detectability over finite-state independent identically distributed (i.i.d.) digital block-fading channels are presented in terms of the unstable poles of the multi-output plant. Finally, an application to Gilbert-Elliott channels (GECs) is provided to demonstrate the derived results.     

On event design in event-triggered feedback systems

This paper studies event design in event-triggered feedback systems. A novel event-triggering scheme is presented to ensure exponential stability of the resulting sampled-data system. The scheme postpones the triggering of events over previously proposed methods and therefore enlarges the intersampling period. The resulting intersampling periods and deadlines are bounded strictly away from zero when the continuous time system is input-to-state stable with respect to measurement errors.     

New receipt-free voting scheme using double-trapdoor commitment

It is considered to be the most suitable solution for large scale elections to design an electronic voting scheme using blind signatures and anonymous channels. Based on this framework, Okamoto first proposed a receipt-free voting scheme [30] for large scale elections. However, in the following paper, Okamoto [31] proved that the scheme [30] was not receipt-free and presented two improved schemes. One scheme requires the help of the parameter registration committee and the other needs a stronger physical assumption of the voting booth. In this paper, we utilize the double-trapdoor commitment to propose a new receipt-free voting scheme based on blind signatures for large scale elections. Neither the parameter registration committee nor the voting booth is required in our scheme. We also present a more efficient zero-knowledge proof for secret permutation. Therefore, our scheme is much more efficient than Okamoto’s schemes [30] and [31] with the weaker physical assumptions. Moreover, we prove that our scheme can achieve the desired security properties.