This paper describes a Markov-chain-based approach to modelling multi-modal transportation networks. An advantage of the model is the ability to accommodate complex dynamics and handle huge amounts of data. The transition matrix of the Markov chain is built and the model is validated using the data extracted from a traffic simulator. A realistic test-case using multi-modal data from the city of London is given to further support the ability of the proposed methodology to handle big quantities of data. Then, we use the Markov chain as a control tool to improve the overall efficiency of a transportation network, and some practical examples are described to illustrate the potentials of the approach

Motivation The analysis of bacterial isolates to detect plasmids is important due to their role in the propagation of antimicrobial resistance. In short-read sequence assemblies, both plasmids and bacterial chromosomes are typically split into several contigs of various lengths, making identification of plasmids a challenging problem. In plasmid contig binning, the goal is to distinguish short-read assembly contigs based on their origin into plasmid and chromosomal contigs and subsequently sort plasmid contigs into bins, each bin corresponding to a single plasmid. Previous works on this problem consist of de novo approaches and reference-based approaches. De novo methods rely on contig features such as length, circularity, read coverage, or GC content. Reference-based approaches compare contigs to databases of known plasmids or plasmid markers from finished bacterial genomes. Results Recent developments suggest that leveraging information contained in the assembly graph improves the accuracy of plasmid binning. We present PlasBin-flow, a hybrid method that defines contig bins as subgraphs of the assembly graph. PlasBin-flow identifies such plasmid subgraphs through a mixed integer linear programming model that relies on the concept of network flow to account for sequencing coverage, while also accounting for the presence of plasmid genes and the GC content that often distinguishes plasmids from chromosomes. We demonstrate the performance of PlasBin-flow on a real dataset of bacterial samples. Availability and implementation https://github.com/cchauve/PlasBin-flow.

Bike-sharing systems are recently becoming ubiquitous in most cities, as an environmentally friendly alternative to other means of transportation. An optimal management of the bike-sharing service would in principle benefit from the availability of a mathematical model underlying the system. Accordingly, in this paper we propose a Markov-chain based approach to model the bike-sharing system, which we believe has a potential to develop alternative methods to implement classic control actions in a bike-sharing system (e.g., in terms of implementing alternative relocation strategies or planning advertising campaigns). The proposed methodology is validated on real data from the bike-sharing system in Boston, USA, and a first application of the proposed model is preliminarily illustrated in the paper

In this study a framework for the real-time trading of budgeted emission rights between a fleet of participating vehicles is presented. The trading problem is formulated as a utility maximisation or as a utility fairness problem, which can be solved in real time either in a centralised or in a distributed manner. In both cases, the authors illustrate the basic issues that arise when such a framework is realised in practice, and they show the efficacy of the approaches by providing several simulation examples and a realistic case study

No abstract