Headway irregularity not only increases average passenger waiting time but also causes additional energy consumption and more delay time. A real-time headway control model is proposed to maintain headway regularity in railway networks by adjusting the travel time on each segment for each train. The adjustment of travel time is based on a consensus algorithm. In the proposed consensus algorithm, the control law is obtained by solving the Riccati equation. The minimum running time on a segment is also considered. The computation time of the proposed method is analyzed and the analysis results show that it can satisfy the requirement on real-time operation. The proposed model is tested and the consensus trend of headways can be observed through simulation. The simulation results also demonstrate that the average passenger waiting time decreases from 52 to 50 seconds/passenger. Additionally, the delay time is reduced by 6.5% at least and energy consumption can be reduced by 0.1% at most after using the proposed method.

This paper studies the problem of light splitter placement (LSP) and wavelength converter placement (WCP) in all-optical WDM networks to enable optimal provisioning of static and dynamic traffic through efficient photonic multicast connections. To solve the LSP-WCP problem under static traffic provisioning, an Integer Linear Programming model is formulated to achieve the optimal solution in the sense that the total number of wavelength channels required by the multicast requests is minimized. To solve the LSP-WCP problem under dynamic traffic provisioning, a complementary-combined LSP-WCP heuristic is proposed to minimize the multicast traffic blocking probability, and is proved through extensive simulations.

Contamination of water resources with pathogenic microorganisms excreted in human feces is a worldwide public health concern. Surveillance of fecal contamination is commonly performed by routine monitoring for a single type or a few types of microorganism(s). To design a feasible routine for periodic monitoring and to control risks of exposure to pathogens, reliable statistical algorithms for inferring correlations between concentrations of microorganisms in water need to be established. Moreover, because pathogens are often present in low concentrations, some contaminations are likely to be under a detection limit. This yields a pairwise left-censored dataset and complicates computation of correlation coefficients. Errors of correlation estimation can be smaller if undetected values are imputed better. To obtain better imputations, we utilize side information and develop a new technique, the asymmetric Tobit model which is an extension of the Tobit model so that domain knowledge can be exploited effectively when fitting the model to a censored dataset. The empirical results demonstrate that imputation with domain knowledge is effective for this task.

This paper investigates a preprocessing technique for a multiuser MIMO downlink system. An efficient joint precoder design with adaptive power allocation is proposed by adopting the channel-diagonalization technique and the minimum mean square error (MMSE) criterion. By exploiting an MMSE-based decoder, we propose an iterative algorithm to design the precoder with further derived closed-form solutions for implementing adaptive power allocation. Simulation results verify the effectiveness of our proposed approach. Compared with conventional benchmark schemes, they show that our proposal matches the performance but with reduced computational complexity.

Software defined networking (SDN) and OpenFlow, which enables the abstraction of vendor/technology-specific attributes, improve the control and management flexibility of optical transport networks. In this paper, we present an interoperability demonstration of SDN/OpenFlow-based optical path control for multi-domain/multi-technology optical transport networks. We also summarize the abstraction approaches proposed for multi-technology network integration at SDN controllers.

This paper focuses on system level simulation of heterogeneous networks (HetNet). Aiming at the imbalance offloading of macro cell and pico cell under the macro-pico coexistence case, we propose an adaptive cell-specific association strategy for HetNet to ensure that users can be served equitably by both macro cell and pico cell. The traditional cell range expansion (CRE) scheme with bias-based cell association has fixed bias values for all pico cells. Our proposal, on the other hand, sets different thresholds of attached users for all MeNB (macro enhanced node B) and PeNBs (pico enhanced node B), and all cell-specific biases are obtained by the proposed adaptive association strategy according to different cell-specific predefined thresholds. With this strategy, the load imbalance between MeNB and different PeNBs is well alleviated, and hence the entire network performance is elevated. Moreover, due to the newly deployed low-power nodes in HetNets, the achieved spectral efficiency of users, especially for cell edge users, is also affected by the downlink inter-cell interference. The idea we put forward is to combine the frequency and power coordination, and so suppress the inter-cell interference. Finally in this paper, we present some numerical results to verify the effectiveness of our proposed approach.

Let $mathbb{F}_q$ be a finite field of q elements, $R=mathbb{F}_q+umathbb{F}_q$ (u2=0) and D2n= be a dihedral group of order n. Left ideals of the group ring R[D2n] are called left dihedral codes over R of length 2n, and abbreviated as left D2n-codes over R. Let n be a positive factor of qe+1 for some positive integer e. In this paper, any left D2n-code over R is uniquely decomposed into a direct sum of concatenated codes with inner codes Ai and outer codes Ci, where Ai is a cyclic code over R of length n and Ci is a linear code of length 2 over a Galois extension ring of R. More precisely, a generator matrix for each outer code Ci is given. Moreover, a formula to count the number of these codes is obtained, the dual code for each left D2n-code is determined and all self-dual left D2n-codes over R are presented, respectively.

Let Fq be a finite field of cardinality q, R=Fq[u]/=Fq+uFq+u2Fq+u3Fq (u4=0) which is a finite chain ring, and n be a positive integer satisfying gcd(q,n)=1. For any $delta,alphain mathbb{F}_{q}^{ imes}$, an explicit representation for all distinct (δ+αu2)-constacyclic codes over R of length n is given, and the dual code for each of these codes is determined. For the case of q=2m and δ=1, all self-dual (1+αu2)-constacyclic codes over R of odd length n are provided.