Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks

Wireless sensor and actor networks (WSANs) have recently emerged with the idea of combining wireless sensor networks (WSNs) and mobile ad hoc networks (MANETs). In addition to resource constrained sensors, resource rich and mobile actor nodes are employed in WSANs. These actors can collect data from the sensors and perform appropriate actions as a result of processing such data. To perform the actions at all parts of the region in a timely manner, the actors should be deployed in such a way that they might be able to communicate with each other and cover the whole monitored area. This requires that the actors should be placed carefully prior to network operation in order to maximize the coverage and maintain the inter-actor connectivity. In this paper, we propose a distributed actor deployment algorithm that strives to maximize the coverage of actors without violating the connectivity requirement. The approach applies repelling forces between neighboring actors and from the sensors that sit on the boundaries in order to spread them in the region. The spreading of the nodes is done using a tree of actors which can provide more freedom for the movement of the nodes but at the same time maintain the required connectivity among the nodes. We present two techniques for creation of such an actor tree which are based on local pruning of the actor links and spanning tree of the inter-actor network. The performance of our approach is validated both analytically and experimentally.     

Distributed estimation via iterative projections with application to power network monitoring

This work presents a distributed method for control centers to monitor the operating condition of a power network, i.e., to estimate the network state, and to ultimately determine the occurrence of threatening situations. State estimation has been recognized to be a fundamental task for network control centers to operate safely and reliably a power grid. We consider (static) state estimation problems, in which the state vector consists of the voltage magnitude and angle at all network buses. We consider the state to be linearly related to network measurements, which include power flows, current injections, and voltage phasors at some buses. We admit the presence of several cooperating control centers, and we design two distributed methods for them to compute the minimum variance estimate of the state, given the network measurements. The two distributed methods rely on different modes of cooperation among control centers: in the first method an incremental mode of cooperation is used, whereas, in the second method, a diffusive interaction is implemented. Our procedures, which require each control center to know only the measurements and the structure of a subpart of the whole network, are computationally efficient and scalable with respect to the network dimension, provided that the number of control centers also increases with the network cardinality. Additionally, a finite-memory approximation of our diffusive algorithm is proposed, and its accuracy is characterized. Finally, our estimation methods are exploited to develop a distributed algorithm to detect corrupted network measurements.     

Compact yet efficient hardware implementation of artificial neural networks with customized topology

There are several neural network implementations using either software, hardware-based or a hardware/software co-design. This work proposes a hardware architecture to implement an artificial neural network (ANN), whose topology is the multilayer perceptron (MLP). In this paper, we explore the parallelism of neural networks and allow on-the-fly changes of the number of inputs, number of layers and number of neurons per layer of the net. This reconfigurability characteristic permits that any application of ANNs may be implemented using the proposed hardware. In order to reduce the processing time that is spent in arithmetic computation, a real number is represented using a fraction of integers. In this way, the arithmetic is limited to integer operations, performed by fast combinational circuits. A simple state machine is required to control sums and products of fractions. Sigmoid is used as the activation function in the proposed implementation. It is approximated by polynomials, whose underlying computation requires only sums and products. A theorem is introduced and proven so as to cover the arithmetic strategy of the computation of the activation function. Thus, the arithmetic circuitry used to implement the neuron weighted sum is reused for computing the sigmoid. This resource sharing decreased drastically the total area of the system. After modeling and simulation for functionality validation, the proposed architecture synthesized using reconfigurable hardware. The results are promising.     

Vessel segmentation and width estimation in retinal images using multiscale production of matched filter responses

Automated segmentation of blood vessels in retinal images can help ophthalmologists screen larger populations for vessel abnormalities. However, automated vessel extraction is difficult due to the fact that the width of retinal vessels can vary from very large to very small, and that the local contrast of vessels is unstable. Further, the small vessels are overwhelmed by Gaussian-like noises. Therefore the accurate segmentation and width estimation of small vessels are very challenging. In this paper, we propose a simple and efficient multiscale vessel extraction scheme by multiplying the responses of matched filters at three scales. Since the vessel structures will have relatively strong responses to the matched filters at different scales but the background noises will not, scale production could further enhance vessels while suppressing noise. After appropriate selection of scale parameters and appropriate normalization of filter responses, the filter responses are then extracted and fused in the scale production domain. The experimental results demonstrate that the proposed method works well for accurately segmenting vessels with good width estimation.     

Impact of Phase Shifters on Locational Prices

With the introduction of restructuring in the electric power industry, the price of electricity has become the focus of power market activities. Phase shifters in a power system can mitigate or reduce transmission congestion by redirecting line flows, reduce the cost of power dispatch by adjusting locational marginal prices (LMPs), and enhance market competition by reducing the chance of market power occurrences due to limited transmission flows. This paper analyzes the role of phase shifters in restructured power systems by simulating electricity market prices. The paper further provides a comparison among various alternatives such as transmission expansion for mitigating congestion. The simulation results are analyzed for a three-bus and presented for the Institute of Electrical and Electronics Engineers (IEEE) 118-bus power system.     

Overview of a Modal-Based Condition Assessment Procedure

Condition assessment is a term that is used to describe the process of characterizing the physical condition of constructed systems. This paper summarizes a condition assessment (CA) procedure based on a complete system of field-testing, finite element (FE) modeling, and load rating. Experimental techniques, including both modal testing and truckload testing, are used to collect measurements of the constructed systems. The basic mechanism and procedure of the FE modeling and calibration are presented. Different physical parameters of FE models are adjusted during the calibration process using both static and dynamic responses as criteria to achieve convergence between experimental measurements and analytical results using carefully developed objective functions. Finally, a bridge load rating is completed on the basis of the calibrated model. These developments are described and illustrated using a representative bridge as an example.     

A simple receding horizon control for state delayed systems and its stability criterion

In this paper, a simple receding horizon (or model predictive) control for state delayed systems is presented and its solution is given in a closed form by a reduction method. While the control for a time-delay system is usually complex, the proposed controller is simple to construct and therefore can be simply implemented in real applications. To check the closed-loop stability of the proposed controller, a sufficient condition is provided by linear matrix inequalities. In addition, a numerical algorithm is presented for computing the eigenvalues of systems with distributed time delays, which can be used as a necessary and sufficient condition to check closed-loop stability. It is shown by simulation that this simple control can be a stabilizing control for time-delay systems.     

Performance Comparison of Four Fiber-Reinforced Polymer Deck Panels

In an effort to assess the constructability and performance of bridges with fiber-reinforced polymer (FRP) composite decks, the short-term and long-term responses of a 207 m, five-span bridge retrofitted with four different FRP panel systems were monitored. The overall aspects of the panel systems, connection details, and construction techniques are presented prior to presentation of the observed and measured responses. Key design parameters (impact factors, girder distribution factors, and level of composite action) for FRP and reinforced concrete decks are evaluated. This paper demonstrates that FRP replacement decks are a viable alternative to reinforced concrete decks and identifies the differences in performances of various FRP deck systems. Two of the FRP panel systems were found to perform considerably better than the other deck systems. Issues that may reduce the service life of FRP deck systems are presented and discussed.     

Two algorithms for constructing a Delaunay triangulation

This paper provides a unified discussion of the Delaunay triangulation. Its geometric properties are reviewed and several applications are discussed. Two algorithms are presented for constructing the triangulation over a planar set ofN points. The first algorithm uses a divide-and-conquer approach. It runs inO(N logN) time, which is asymptotically optimal. The second algorithm is iterative and requiresO(N ²) time in the worst case. However, its average case performance is comparable to that of the first algorithm.This work was supported in part by the National Science Foundation under grant MCS-76-17321 and the Joint Services Electronics Program under contract DAAB-07-72-0259.