Spatio-temporal mapping of variation potentials in leaves of Helianthus annuus L. seedlings in situ using multi-electrode array.

Damaging thermal stimuli trigger long-lasting variation potentials (VPs) in higher plants. Owing to limitations in conventional plant electrophysiological recording techniques, recorded signals are composed of signals originating from all of the cells that are connected to an electrode. This limitation does not enable detailed spatio-temporal distributions of transmission and electrical activities in plants to be visualised. Multi-electrode array (MEA) enables the recording and imaging of dynamic spatio-temporal electrical activities in higher plants. Here, we used an 8 × 8 MEA with a polar distance of 450 μm to measure electrical activities from numerous cells simultaneously. The mapping of the data that were recorded from the MEA revealed the transfer mode of the thermally induced VPs in the leaves of Helianthus annuus L. seedlings in situ. These results suggest that MEA can enable recordings with high spatio-temporal resolution that facilitate the determination of the bioelectrical response mode of higher plants under stress

Optimization in Telecommunication Networks

Network design and network synthesis have been the classical optimization problems intelecommunication for a long time. In the recent past, there have been many technologicaldevelopments such as digitization of information, optical networks, internet, and wirelessnetworks. These developments have led to a series of new optimization problems. Thismanuscript gives an overview of the developments in solving both classical and moderntelecom optimization problems.We start with a short historical overview of the technological developments. Then,the classical (still actual) network design and synthesis problems are described with anemphasis on the latest developments on modelling and solving them. Classical results suchas Menger’s disjoint paths theorem, and Ford-Fulkerson’s max-flow-min-cut theorem, butalso Gomory-Hu trees and the Okamura-Seymour cut-condition, will be related to themodels described. Finally, we describe recent optimization problems such as routing andwavelength assignment, and grooming in optical networks.operations research and management science;

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Self-stabilizing cluster routing in Manet using link-cluster architecture

We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a single special node, called a clusterhead that contains the routing information about inter and intra-cluster communication. A cluster is comprised of all nodes that choose the corresponding clusterhead as their leader. The algorithm consists of two main tasks. First, the set of special nodes (clusterheads) is elected such that it models the link-cluster architecture: any node belongs to a single cluster, it is within two hops of the clusterhead, it knows the direct neighbor on the shortest path towards the clusterhead, and there exist no two adjacent clusterheads. Second, the routing tables are maintained by the clusterheads to store information about nodes both within and outside the cluster. There are two advantages of maintaining routing tables only in the clusterheads. First, as no two neighboring nodes are clusterheads (as per the link-cluster architecture), there is no need to check the consistency of the routing tables. Second, since all other nodes have significantly less work (they only forward messages), they use much less power than the clusterheads. Therefore, if a clusterhead runs out of power, a neighboring node (that is not a clusterhead) can accept the role of a clusterhead. (Abstract shortened by UMI.)

The role of angularity in route choice: an analysis of motorcycle courier GPS traces

The paths of 2425 individual motorcycle trips made in London were analyzed in order to uncover the route choice decisions made by drivers. The paths were derived from global positioning system (GPS) data collected by a courier company for each of their drivers, using algorithms developed for the purpose of this paper. Motorcycle couriers were chosen due to the fact that they both know streets very well and that they do not rely on the GPS to guide their navigation. Each trace was mapped to the underlying road network, and two competing hypotheses for route choice decisions were compared: (a) that riders attempt to minimize the Manhattan distance between locations and (b) that they attempt to minimize the angular distance. In each case, the distance actually traveled was compared to the minimum possible either block or angular distance through the road network. It is usually believed that drivers who know streets well will navigate trips that reduce Manhattan distance; however, here it is shown that angularity appears to play an important role in route choice. 63% of trips made took the minimum possible angular distance between origin and destination, while 51% of trips followed the minimum possible block distance. This implies that impact of turns on cognitive distance plays an important role in decision making, even when a driver has good knowledge of the spatial network

A Coevolutionary Particle Swarm Algorithm for Bi-Level Variational Inequalities: Applications to Competition in Highway Transportation Networks

A climate of increasing deregulation in traditional highway transportation, where the private sector has an expanded role in the provision of traditional transportation services, provides a background for practical policy issues to be investigated. One of the key issues of interest, and the focus of this chapter, would be the equilibrium decision variables offered by participants in this market. By assuming that the private sector participants play a Nash game, the above problem can be described as a Bi-Level Variational Inequality (BLVI). Our problem differs from the classical Cournot-Nash game because each and every player’s actions is constrained by another variational inequality describing the equilibrium route choice of users on the network. In this chapter, we discuss this BLVI and suggest a heuristic coevolutionary particle swarm algorithm for its resolution. Our proposed algorithm is subsequently tested on example problems drawn from the literature. The numerical experiments suggest that the proposed algorithm is a viable solution method for this problem