How to quickly compute the number of points on an Elliptic Curve (EC) has been a longstanding challenge. The computational complexity of the algorithm usually employed makes it highly inefficient. Unlike the general...
详细信息
How to quickly compute the number of points on an Elliptic Curve (EC) has been a longstanding challenge. The computational complexity of the algorithm usually employed makes it highly inefficient. Unlike the general EC, a simple method called the Weil theorem can be used to compute the order of an EC characterized by a small prime number, such as the Kobltiz EC characterized by two. The fifteen secure ECs recommended by the National Institute of Standards and Technology (NIST) Digital Signature Standard contain five Koblitz ECs whose maximum base domain reaches 571 bits. Experimental results show that the computation speed decreases for base domains exceeding 600 bits. In this paper, we propose a simple method that combines the Weil theorem with Pascals triangle, which greatly reduces the computational complexity. We have validated the performance of this method for base fields ranging from 2l^100 to 2^1000. Furthermore, this new method can be generalized to any ECs characterized by any small prime number.
Numerous deployments of Wireless Sensor networks (WSNs) have shown that intricate problems are introduced by deploying sensor nodes in an unknown and dynamic environment. Consequently, a vital part of a WSN deployment...
详细信息
ISBN:
(纸本)9781605588513
Numerous deployments of Wireless Sensor networks (WSNs) have shown that intricate problems are introduced by deploying sensor nodes in an unknown and dynamic environment. Consequently, a vital part of a WSN deployment is the supervision of the sensor nodes and detection of abnormalities in their operation. Previous approaches have devised hand-crafted solutions to detect application-specific problems. This work proposes a generic middleware component, named MoMi, to detect such problems in a systematic way. Given a description of normal system behavior MoMi uses a Model-Based Diagnosis (MBD) framework to present the likely causes of system abnormalities to an administrator. This paper demonstrates a proof of concept implementation of MBD on sensor nodes and presents examples of its applicability for typical WSN applications. Copyright 2009 ACM.
Many sensor network systems encounter considerable problems after deployment despite extensive simulation and testing during the development. A fundamental issue is unforeseen problems that rarely occur, which makes t...
详细信息
Among several techniques proposed for indoor positioning using IEEE 802.11 Wireless Fidelity (Wi-Fi) based networks, those that rely on fingerprinting have been demonstrated to outperform those based on lateration, an...
详细信息
Due to their embedding into an unknown environment, wireless sensor networks are susceptible to adverse environmental conditions. A prime example is external interference, typically caused by 802.11, electric devices ...
详细信息
A non-model-based robust adaptive dynamic programming (RADP) approach is developed to solve the global optimal output regulation problem (GOORP) of partially linear systems with nonlinear dynamic uncertainties. By con...
详细信息
In this paper, a new scheduling model is presented to speed up the logistics processing in an automatic cube storage warehouse. Automated guided vehicles (AGV) are used to move all items in the warehouse according to ...
详细信息
QoS-aware routing algorithm is important in wireless multimedia sensor networks. This paper formulates a generalized QoS-aware routing model on the basis of multiple routing metrics and priorities of packets. We first...
详细信息
QoS-aware routing algorithm is important in wireless multimedia sensor networks. This paper formulates a generalized QoS-aware routing model on the basis of multiple routing metrics and priorities of packets. We first introduce a 2D plain-based routing algorithm IPACR which improves the standard ant colony algorithm by optimizing the initial distribution of artificial pheromone in order to accelerate the algorithm convergence rate. Then a clustering-based routing algorithm ICACR is presented which can be well applied in a large scale network. ICACR is a variation of IPACR because it can be suitable for clustering cases to satisfy the larger scale situations. Both the numerical algorithm performance analysis and simulation of IPACR and ICACR are given. The results show that ICACR outperforms IPACR in terms of both network lifetime and QoS-aware routing metrics in large scale wireless multimedia sensor networks. Moreover, the simulation based on the real video traces shows that by extending the multi-path to ICACR for different priorities of video frames better performance can be achieved.
The algorithms used in spectrum sensing have an important impact on the detection performance. Thus, in this paper, by exploiting the mathematical structure and physical properties of the signal's eigenvalues unde...
详细信息
This paper studies data-driven learning-based methods for the finite-horizon optimal control of linear time-varying discretetime systems. First, a novel finite-horizon Policy Iteration (PI) method for linear time-vary...
详细信息
This paper studies data-driven learning-based methods for the finite-horizon optimal control of linear time-varying discretetime systems. First, a novel finite-horizon Policy Iteration (PI) method for linear time-varying discrete-time systems is presented. Its connections with existing in finite-horizon PI methods are discussed. Then, both data-drive n off-policy PI and Value Iteration (VI) algorithms are derived to find approximate optimal controllers when the system dynamics is completely unknown. Under mild conditions, the proposed data-driven off-policy algorithms converge to the optimal solution. Finally, the effectiveness and feasibility of the developed methods are validated by a practical example of spacecraft attitude control.
暂无评论