A HYBRID MODEL OF COLLECTIVE MOTION OF DISCRETE PARTICLES UNDER ALIGNMENT AND CONTINUUM CHEMOTAXIS

In this paper we propose and study a hybrid discrete-continuous mathematical model of collective motion under alignment and chemotaxis effect. Starting from paper [23], in which the Cucker-Smale model [22] was coupled with other cell mechanisms, to describe the cell migration and self-organization in the zebrafish lateral line primordium, we introduce a simplified model in which the coupling between an alignment and chemotaxis mechanism acts on a system of interacting particles.

Long-time behaviour of the approximate solution to quasi-convolution Volterra equations

The integral representation of some biological phenomena consists in Volterra equations whose kernels involve a convolution term plus a non convolution one. Some significative applications arise in linearised models of cell migration and collective motion, as described in Di Costanzo et al. (Discrete Contin. Dyn. Syst. Ser. B 25 (2020) 443-472), Etchegaray et al. (Integral Methods in Science and Engineering (2015)), Grec et al. (J. Theor. Biol. 452 (2018) 35-46) where the asymptotic behaviour of the analytical solution has been extensively investigated.

Trust-Based Enforcement of Security Policies

Two conflicting high-level goals govern the enforcement of security policies, abridged in the phrase ``high security at a low cost''. While these drivers seem irreconcilable, formal modelling languages and automated verification techniques can facilitate the task of finding the right balance. We propose a modelling language and a framework in which security checks can be relaxed or strengthened to save resources or increase protection, on the basis of trust relationships among communicating parties.

A Branch and Price Algorithm to solve the Quickest Multicommodity k-Splittable Flow Problem

In the literature on Network Optimization, k-splittable flows were introduced to enhance modeling accuracy in cases where an upper bound on the number of supporting paths for each commodity needs to be imposed, thus extending the suitability of network flow tools for an increased number of practical applications. Such modeling feature has recently been extended to dynamic flows with the introduction of the novel strongly NP-hard Quickest Multicommodity k-splittable Flow Problem (QMCkFP).

Designing a web Spatial Decision Support System based on Analytic Network Process to locate a freight lorry parking

The relevant role of freight lorry parking facilities as a tool to reduce nuisances and impact of economic activities in densely populated urban areas is widely recognised in the literature. Nevertheless, the literature currently lacks specific contributions addressing the use of a complex Multiple Criteria Decision Analysis (MCDA) approach for coping with an optimal location of freight lorry parking facilities in the urban context.

Spiders like Onions: on the Network of Tor Hidden Services

Tor hidden services allow offering and accessing various Internet resources while guaranteeing a high degree of provider and user anonymity. So far, most research work on the Tor network aimed at discovering protocol vulnerabilities to de-anonymize users and services. Other work aimed at estimating the number of available hidden services and classifying them. Something that still remains largely unknown is the structure of the graph defined by the network of Tor services.