The fault accommodation problem for time-delay system is studied in this paper. The progressive accommodation strategy based on the Newton-Raphson scheme is proposed to solve this problem. This accommodation scheme ca...The fault accommodation problem for time-delay system is studied in this paper. The progressive accommodation strategy based on the Newton-Raphson scheme is proposed to solve this problem. This accommodation scheme can significantly reduces the loss of performance and risk associated with system instability which results from the time-delay needed by fault accommodation algorithms to provide a solution. Simulation results are given to illustrate the efficiency of the provided method.展开更多
Energy saving is the nature of the optimal balance between the optimization of performance and energy consumption.Due to the node＇ s mobility of large-scale wireless sensor networks and the depletion of electrical en...Energy saving is the nature of the optimal balance between the optimization of performance and energy consumption.Due to the node＇ s mobility of large-scale wireless sensor networks and the depletion of electrical energy causing the failure of communication path and network segmentation mong nodes,and because energy consumption of nodes is mainly its communication, to design the routing with energy saving, low latency, extensibility and improving the fault-tolerance is particularly important.Based on the large-scale wireless sensor networks,mainly through introducing the methods of nonlinear modeling,this paper analyzes the fine-grained mapping between the system of energy consumption and software, builds and optimizes the software model of energy consumption and energy consumption-balance model of service quality, and commits to form an effective energy saving to lay a foundation for construction of low energy consumption of wireless sensor network. Research achievement has significant theoretical and application value in public safety, disaster prevention, ecological and environmental protection, urban management, smart home, intelligent transportation, medical and health care, industrial monitoring, green agriculture and other fields.展开更多
In this paper, we present two explicit invalid-curve attacks on the genus 2 hyperelliptic curve over a finite field. First, we propose two explicit attack models by injecting a one-bit fault in a given divisor. Then, ...In this paper, we present two explicit invalid-curve attacks on the genus 2 hyperelliptic curve over a finite field. First, we propose two explicit attack models by injecting a one-bit fault in a given divisor. Then, we discuss the construction of an invalid curve based on the faulted divisor. Our attacks are based on the fact that the Hyperelliptic Curve Scalar Multiplication (HECSM) algorithm does not utilize the curve parameters and We consider three hyperelliptic curves as the attack targets. For curve with security level 186 (in bits), our attack method can get the weakest invalid curve with security level 42 (in bits); there are 93 invalid curves with security level less than 50. We also estimate the theoretical probability of getting a weak hyperelliptic curve whose cardinality is a smooth integer. Finally, we show that the complexity of the fault attack is subexponential if the attacker can freely inject a fault in the input divisor. Cryptosystems based on the genus 2 hyperelliptic curves cannot work against our attack algorithm in practice.展开更多
This study investigated a water supply recovery problem involving municipal water service piping. The problem consisted in recovering full service after network failure, in order to rapidly satisfy all urgent citywide...This study investigated a water supply recovery problem involving municipal water service piping. The problem consisted in recovering full service after network failure, in order to rapidly satisfy all urgent citywide demands. The optimal recovery solution was achieved through the application of so-called network design problems （NDPs）, which are a form of combinatorial optimization problem. However, a conventional NDP is not suitable for addressing urgent situations because （1） it does not utilize the non-failure arcs in the network, and （2） it is solely concerned with stable costs such as flow costs. Therefore, to adapt the technique to such urgent situations, the conventional NDP is here modified to deal with the specified water supply problem. In addition, a numerical illustration using the Sendai water network is presented.展开更多
基金National Natural Science Foundation of China (No.60574081)
文摘The fault accommodation problem for time-delay system is studied in this paper. The progressive accommodation strategy based on the Newton-Raphson scheme is proposed to solve this problem. This accommodation scheme can significantly reduces the loss of performance and risk associated with system instability which results from the time-delay needed by fault accommodation algorithms to provide a solution. Simulation results are given to illustrate the efficiency of the provided method.
文摘Energy saving is the nature of the optimal balance between the optimization of performance and energy consumption.Due to the node＇ s mobility of large-scale wireless sensor networks and the depletion of electrical energy causing the failure of communication path and network segmentation mong nodes,and because energy consumption of nodes is mainly its communication, to design the routing with energy saving, low latency, extensibility and improving the fault-tolerance is particularly important.Based on the large-scale wireless sensor networks,mainly through introducing the methods of nonlinear modeling,this paper analyzes the fine-grained mapping between the system of energy consumption and software, builds and optimizes the software model of energy consumption and energy consumption-balance model of service quality, and commits to form an effective energy saving to lay a foundation for construction of low energy consumption of wireless sensor network. Research achievement has significant theoretical and application value in public safety, disaster prevention, ecological and environmental protection, urban management, smart home, intelligent transportation, medical and health care, industrial monitoring, green agriculture and other fields.
基金supported by the National Basic Research Program （973 Program）under Grant No.2013CB834205 the National Natural Science Foundation of China under Grant No.61272035 the Independent Innovation Foundation of Shandong University under Grant No.2012JC020
文摘In this paper, we present two explicit invalid-curve attacks on the genus 2 hyperelliptic curve over a finite field. First, we propose two explicit attack models by injecting a one-bit fault in a given divisor. Then, we discuss the construction of an invalid curve based on the faulted divisor. Our attacks are based on the fact that the Hyperelliptic Curve Scalar Multiplication (HECSM) algorithm does not utilize the curve parameters and We consider three hyperelliptic curves as the attack targets. For curve with security level 186 (in bits), our attack method can get the weakest invalid curve with security level 42 (in bits); there are 93 invalid curves with security level less than 50. We also estimate the theoretical probability of getting a weak hyperelliptic curve whose cardinality is a smooth integer. Finally, we show that the complexity of the fault attack is subexponential if the attacker can freely inject a fault in the input divisor. Cryptosystems based on the genus 2 hyperelliptic curves cannot work against our attack algorithm in practice.
文摘This study investigated a water supply recovery problem involving municipal water service piping. The problem consisted in recovering full service after network failure, in order to rapidly satisfy all urgent citywide demands. The optimal recovery solution was achieved through the application of so-called network design problems （NDPs）, which are a form of combinatorial optimization problem. However, a conventional NDP is not suitable for addressing urgent situations because （1） it does not utilize the non-failure arcs in the network, and （2） it is solely concerned with stable costs such as flow costs. Therefore, to adapt the technique to such urgent situations, the conventional NDP is here modified to deal with the specified water supply problem. In addition, a numerical illustration using the Sendai water network is presented.
