Anaerobic co-digestion of sludge with other organic wastes in small wastewater treatment plants: an economic considerations evaluation.

This paper deals with an economic comparison between costs and incomes in small wastewater treatment plants where the anaerobic co-digestion process of sludge and biowaste with energy recovery is operated. Plants in the size range 1,000-30,000 persons equivalent (pe) were considered in the study: typical costs, comprehensive of capital and operating costs, were in the range euro69-105 per person per year depending on the plant size: the smaller the size the higher the specific cost. The incomes deriving from taxes and fees for wastewater treatment are generally in the range euro36-54 per person per year and can only partially cover costs in small wastewater treatment plants. However, the co-treatment of biowaste and the use of produced energy for extra credits (green certificates) determine a clear improvement in the possible revenues from the plant. These were calculated to be euro23-25 per person per year; as a consequence the costs and incomes can be considered comparable for wastewater treatment plants (WWTPs) with size larger than 10,000 pe. Therefore, anaerobic co-digestion of biowaste and sludge can also be considered a sustainable solution for small wastewater treatment plants in rural areas where several different kinds of biowaste are available to enhance biogas production in anaerobic reactors.     

A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques

In recent years, cubic regularization algorithms for unconstrained optimization have been defined as alternatives to trust-region and line search schemes. These regularization techniques are based on the strategy of computing an (approximate) global minimizer of a cubic overestimator of the objective function. In this work we focus on the adaptive regularization algorithm using cubics (ARC) proposed in Cartis et al. [Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results, Mathematical Programming A 127 (2011), pp. 245–295]. Our purpose is to design a modified version of ARC in order to improve the computational efficiency preserving global convergence properties. The basic idea is to suitably combine a Goldstein-type line search and a nonmonotone accepting criterion with the aim of advantageously exploiting the possible good descent properties of the trial step computed as (approximate) minimizer of the cubic model. Global convergence properties of the proposed nonmonotone ARC algorithm are proved. Numerical experiments are performed and the obtained results clearly show satisfactory performance of the new algorithm when compared to the basic ARC algorithm.     

Speeding up the spatial adiabatic passage of matter waves in optical microtraps by optimal control

We numerically investigate the performance of atomic transport in optical microtraps via the so called spatial adiabatic passage technique. Our analysis is carried out by means of optimal control methods, which enable us to determine suitable transport control pulses. We investigate the ultimate limits of the optimal control in speeding up the transport process in a triple well configuration for both a single atomic wave packet and a Bose-Einstein condensate within a regime of experimental parameters achievable with current optical technology.     

Quantum computing implementations with neutral particles

We review quantum information processing with cold neutral particles, that is, atoms or polar molecules. First, we analyze the best suited degrees of freedom of these particles for storing quantum information, and then we discuss both single- and two-qubit gate implementations. We focus our discussion mainly on collisional quantum gates, which are best suited for atom-chip-like devices, as well as on gate proposals conceived for optical lattices. Additionally, we analyze schemes both for cold atoms confined in optical cavities and hybrid approaches to entanglement generation, and we show how optimal control theory might be a powerful tool to enhance the speed up of the gate operations as well as to achieve high fidelities required for fault tolerant quantum computation.     

iLogDemons: A Demons-Based Registration Algorithm for Tracking Incompressible Elastic Biological Tissues

Tracking soft tissues in medical images using non-linear image registration algorithms requires methods that are fast and provide spatial transformations consistent with the biological characteristics of the tissues. LogDemons algorithm is a fast non-linear registration method that computes diffeomorphic transformations parameterised by stationary velocity fields. Although computationally efficient, its use for tissue tracking has been limited because of its ad-hoc Gaussian regularisation, which hampers the implementation of more biologically motivated regularisations. In this work, we improve the logDemons by integrating elasticity and incompressibility for soft-tissue tracking. To that end, a mathematical justification of demons Gaussian regularisation is proposed. Building on this result, we replace the Gaussian smoothing by an efficient elastic-like regulariser based on isotropic differential quadratic forms of vector fields. The registration energy functional is finally minimised under the divergence-free constraint to get incompressible deformations. As the elastic regulariser and the constraint are linear, the method remains computationally tractable and easy to implement. Tests on synthetic incompressible deformations showed that our approach outperforms the original logDemons in terms of elastic incompressible deformation recovery without reducing the image matching accuracy. As an application, we applied the proposed algorithm to estimate 3D myocardium strain on clinical cine MRI of two adult patients. Results showed that incompressibility constraint improves the cardiac motion recovery when compared to the ground truth provided by 3D tagged MRI.     

A pseudo-random network mobile automaton with linear growth

Based on the mobile automaton model, an algorithm is introduced that grows planar, tri-valent graphs by exhibiting a peculiar, twofold dynamics. In a first phase, graph growth appears to be pseudo-random and O(n) then it settles to a very regular behavior and rate. A pseudo-random mobile automaton is already known; the new automaton provides now a finite, but surprisingly long, pseudo-random, linear growth process. Applications of mobile automata to fundamental physics and quantum gravity have been recently suggested.     

The effects of scheduling, workload type and consolidation scenarios on virtual machine performance and their prediction through optimized artificial neural networks

The aim of this paper is to study and predict the effect of a number of critical parameters on the performance of virtual machines (VMs). These parameters include allocation percentages, real-time scheduling decisions and co-placement of VMs when these are deployed concurrently on the same physical node, as dictated by the server consolidation trend and the recent advances in the Cloud computing systems. Different combinations of VM workload types are investigated in relation to the aforementioned factors in order to find the optimal allocation strategies. What is more, different levels of memory sharing are applied, based on the coupling of VMs to cores on a multi-core architecture. For all the aforementioned cases, the effect on the score of specific benchmarks running inside the VMs is measured. Finally, a black box method based on genetically optimized artificial neural networks is inserted in order to investigate the degradation prediction ability a priori of the execution and is compared to the linear regression method.     

Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces

We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among agents, and optimization techniques in order to find Pareto-efficient agreements. We introduce , a propositional logic extended with concrete domains, which allows one to model relations among issues (both numerical and non-numerical ones) via logical entailment, differently from well-known approaches that describe issues as uncorrelated. Through it is possible to represent buyer’s request, seller’s supply and their respective preferences as formulas endowed with a formal semantics, e.g., “if I spend more than 30000 € for a sedan then I want more than a two-years warranty and a GPS system included”. We mix logic and utility theory in order to express preferences in a qualitative and quantitative way. We illustrate the theoretical framework, the logical language, the one-shot negotiation protocol we adopt, and show we are able to compute Pareto-efficient outcomes, using a mediator to solve an optimization problem. We prove the computational adequacy of our method by studying the complexity of the problem of finding Pareto-efficient solutions in our setting.     

Analysis and implementation of the multiprocessor bandwidth inheritance protocol

The Multiprocessor Bandwidth Inheritance (M-BWI) protocol is an extension of the Bandwidth Inheritance (BWI) protocol for symmetric multiprocessor systems. Similar to Priority Inheritance, M-BWI lets a task that has locked a resource execute in the resource reservations of the blocked tasks, thus reducing their blocking time. The protocol is particularly suitable for open systems where different kinds of tasks dynamically arrive and leave, because it guarantees temporal isolation among independent subsets of tasks without requiring any information on their temporal parameters. Additionally, if the temporal parameters of the interacting tasks are known, it is possible to compute an upper bound to the interference suffered by a task due to other interacting tasks. Thus, it is possible to provide timing guarantees for a subset of interacting hard real-time tasks. Finally, the M-BWI protocol is neutral to the underlying scheduling policy: it can be implemented in global, clustered and semi-partitioned scheduling. After introducing the M-BWI protocol, in this paper we formally prove its isolation properties, and propose an algorithm to compute an upper bound to the interference suffered by a task. Then, we describe our implementation of the protocol for the?LITMUS ^RT real-time testbed, and measure its overhead. Finally, we compare M-BWI against FMLP and OMLP, two other protocols for resource sharing in multiprocessor systems.     

Subspace identification analysis of RFX and T2R reversed-field pinches

Input–output datasets from two magnetic confinement fusion (MCF) experiments of the reversed-field pinch (RFP) type are examined. The RFP datasets, which are samples of the distributed magnetic field dynamics, are naturally divided into many smaller batches due to the pulsed-plasma operation of the experiments. The two RFP experiments considered are (i) EXTRAP T2R (T2R) with 64 inputs and 64 outputs and (ii) RFX-mod (RFX) with 192 inputs and 192 outputs. Both T2R and RFX are magnetohydrodynamically unstable and operates under magnetic feedback with optional dither injection. Using subspace system identification techniques and randomised cross-validation (CV) methods to minimise the generalisation error, state-space orders of the empirical systems are suggested. These system orders are compared to “stabilisation diagrams” commonly used in experimental modal analysis practice. The relation of the CV system order to the decay of the singular values from the subspace method is observed. Both (i) stable vacuum diffusion and (ii) unstable plasma response datasets are analysed. Apparent simulation and prediction errors are quantified for both cases using a deviation-accounted-for index. These results are purely data-driven. A simple approach towards exploitation of the subspace techniques for finite-element model refinement and data confrontation is presented.