FTFabio Lorenzo Traversa

Fabio Lorenzo Traversa

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Fabio Lorenzo Traversa has a total of 75 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Design and optimization of stochastically driven, multi degrees-of-freedom energy harvesters using equivalent circuits and swarm intelligence algorithms

    by Kailing Song, Michele Bonnin, Fabrizio Bonani, Fabio Traversa

    Energy harvesters that extract power from random mechanical vibrations are electromechanical systems designed to convert kinetic energy from ambient vibrations, modeled as white Gaussian noise, into usable electrical energy. Their efficiency is often limited by impedance mismatches between the mechanical and electrical domains, leading to suboptimal energy transfer. Inspired from analogous problems in RF engineering, we reformulate the energy harvester design as a broadband filtering problem, treating mass-spring systems as mechanical filters. We devise an equivalent circuit model for the harvester, and we use frequency domain analysis to derive an integral equation for the harvested power. To optimize performance, we apply a swarm intelligence algorithm – specifically, Flock of Starlings Optimization – resulting in significantly improved efficiency over traditional, single-degree-of-freedom, harvesters.


  • Open Access

    Erratum: “Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines” [Chaos 27, 023107 (2017)]

    by Fabio L. Traversa, Massimiliano Di Ventra

    There should be a minus sign in front of k i in both Eqs. (44) and (46) of Ref. 1. This is only a typo and does not affect the reported results. The correct equ

  • Open Access

    A Thermodynamically Consistent Thermal Equilibrium Gaussian White Noise Model for Nonlinear Resistors

    by Michele Bonnin, Léopold Van Brandt, Jean-Charles Delvenne, Fabio L. Traversa, Fabrizio Bonani

    Traditional extensions of the Nyquist-Johnson formula for thermal fluctuations in nonlinear dissipative elements have often led to thermodynamically inconsistent models and sparked long-standing debates about the proper interpretation of stochastic differential equations. In this work, we show that it is possible to derive, for each of the main stochastic interpretations, a Gaussian white-noise model for nonlinear dissipative elements at thermal equilibrium that fully complies with the fundamental principles of thermodynamics. The resulting models reproduce the Gibbs (Maxwell-Boltzmann) distribution and ensure zero-mean voltages and currents, thereby resolving the Brillouin paradox and maintaining consistency with the second law of thermodynamics. Furthermore, we demonstrate that these models satisfy additional thermodynamic requirements, including positive entropy production during transients and zero net heat exchange between dissipative elements at equilibrium.


  • Open Access

    Particle Swarm Optimization for Broadband Energy Harvesting of Ambient Mechanical Vibrations

    by Michele Bonnin, Kailing Song, Fabio L. Traversa, Fabrizio Bonani

    We consider the model of a networked energy harvester for ambient dispersed vibrations, based on coupled mechanical resonators and a piezoelectric transduction mechanism. The networked harvester is equivalent to a mechanical filter that can be optimized for broadband energy harvesting. Using mechanical-to-electrical analogies, we derive an equivalent circuit model for the energy harvester, and we calculate the transfer function, output voltage, average harvested power and power efficiency in the frequency domain. We discuss the problem of the energy harvester optimization. Because analytical formulas for the objective function and its derivatives are not available, we apply a gradient-free method, based on Particle Swarm Optimization, to find the network parameters that maximize the scavenged energy. We demonstrate that, after proper optimization, the networked energy harvester scavenges more than 100% additional power compared to a simple, single mechanical degree-of-freedom energy harvester. We show that increasing the number of mass-spring pairs beyond three offers negligible returns in terms of increased scavenged power. Additionally, we reveal that the networked harvester functions as a broadband mechanical filter, with a decrease in the power scavenged at the resonance frequency in exchange for a wider bandwidth, thus collecting more energy by exploiting a broader frequency range. Furthermore, we demonstrate that broadband optimization using Particle Swarm Optimization achieves superior performance compared to analytical methods based on broadband impedance matching designed at the resonance frequencies.

  • Thermodynamically Consistent Noise Modeling in Non-Linear Circuits

    by Michele Bonnin, Fabrizio Bonani, Jean-Charles Delvenne, Léopold Van Brandt, Fabio Traversa

    Traditional attempts to extend the Nyquist–Johnson formula for thermal fluctuations to non-linear dissipative elements have led to thermodynamically inconsistent models. In this work, we present a Langevin model for thermal noise in non-linear dissipative elements, that is fully consistent with the main requirements of thermodynamics. The model accurately predicts the Gibbs (Maxwell–Boltzmann) distribution at thermal equilibrium and ensures zero expected voltages and currents, thereby resolving the well-known Brillouin’s paradox and confirming compliance with the second law of thermodynamics.


  • Open Access

    Broadband vibration energy harvesting using nonlinear multi degree-of-freedom mechanical filters

    by Kailing Song, Michele Bonnin, Fabio L. Traversa, Fabrizio Bonani

    We introduce the model of a networked energy harvester for random ambient vibrations, made of mechanically coupled oscillators. The networked harvester is equivalent to a mechanical filter, and it can be modeled as a chain of masses, coupled pairwise by nonlinear elastic springs. Ambient mechanical vibrations are modeled as a low-pass filtered white Gaussian noise, and a piezoelectric transducer is used to convert mechanical kinetic energy into electrical energy. We derive the nonlinear equations of motion for the harvester, together with formulas for the average harvested power and power efficiency. An approximate analytical solution is presented and compared with numerical simulations. Finally, we discuss the optimization of the networked harvester, based on a gradient ascent algorithm combined with Nesterov’s momentum method. We show that, after proper optimization, the mechanically coupled energy harvester scavenges more power than a single mass-spring energy harvester.


  • Open Access

    Geometric Separability of Mesoscale Patterns in Embedding Representation and Visualization of Multidimensional Data and Complex Networks

    by Aldo Acevedo, Yue Wu, Fabio Lorenzo Traversa, Carlo Vittorio Cannistraci

    Complexity science studies physical phenomena that cannot be explained by the mere analysis of the single units of a system but requires to account for their interactions. A feature of complexity in connected systems is the emergence of mesoscale patterns in a geometric space, such as groupings in bird flocks. These patterns are formed by groups of points that tend to separate from each other, creating mesoscale structures. When multidimensional data or complex networks are embedded in a geometric space, some mesoscale patterns can appear respectively as clusters or communities, and their geometric separability is a feature according to which the performance of an algorithm for network embedding can be evaluated. Here, we introduce a framework for the definition and measure of the geometric separability (linear and nonlinear) of mesoscale patterns by solving the travelling salesman problem (TSP), and we offer experimental evidence on embedding and visualization of multidimensional data or complex networks, which are generated artificially or are derived from real complex systems. For the first time in literature the TSP’s solution is used to define a criterion of nonlinear separability of points in a geometric space, hence redefining the separability problem in terms of the travelling salesman problem is an innovation which impacts both computer science and complexity theory.


  • Open Access

    Model order reduction and stochastic averaging for the analysis and design of micro-electro-mechanical systems

    by Michele Bonnin, Kailing Song, Fabio L. Traversa, Fabrizio Bonani

    Electro-mechanical systems are key elements in engineering. They are designed to convert electrical signals and power into mechanical motion and vice-versa. As the number of networked systems grows, the corresponding mathematical models become more and more complex, and novel sophisticated techniques for their analysis and design are required. We present a novel methodology for the analysis and design of electro-mechanical systems subject to random external inputs. The method is based on the joint application of a model order reduction technique, by which the original electro-mechanical variables are projected onto a lower dimensional space, and of a stochastic averaging technique, which allows the determination of the stationary probability distribution of the system mechanical energy. The probability distribution can be exploited to assess the system performance and for system optimization and design. As examples of application, we apply the method to power factor correction for the optimization of a vibration energy harvester, and to analyse a system composed by two coupled electro-mechanical resonators for sensing applications.


  • Open Access

    Scaling up prime factorization with self-organizing gates: A memcomputing approach

    by Tristan Sharp, Rishabh Khare, Erick Pederson, Fabio Lorenzo Traversa

    We report preliminary results on using the MEMCPU\texttrademark{} Platform to compute the prime factorization of large biprimes. The first approach, the direct model, directly returns the factors of a given biprime. The second approach, the congruence model, returns smooth congruences to address the bottleneck of standard sieve methods. The models have size-dependent structure, and the MEMCPU Platform requires structure-dependent tuning for optimal performance. Therefore, for both models, we tuned the platform on sample problems up to a given size according to available resources. Then we generated RSA-like benchmark biprimes to perform rigorous scaling analysis. The MEMCPU timings over the tuned range followed low degree polynomials in the number of bits, markedly different than other tested methods including general number field sieve. MEMCPU's congruence model was the most promising, which was scaled up to 300-bit factorization problems while following a $2^{nd}$ degree polynomial fit. We also discuss the approach to tuning the MEMCPU Platform for problems beyond the reach of today's most advanced methods. Finally, basic analysis of the acceleration expected from an ASIC implementation is provided and suggests the possibility of real time factorization of large biprimes.

  • Open Access

    Assessing the Effectiveness of Non-Turing Computing Paradigms

    by Lorenzo Rocutto, Marco Maronese, Fabio Lorenzo Traversa, Sergio Decherchi, Andrea Cavalli

    In recent years the technological limits inherently present in the classical Turing paradigm of computation have sparked the development of innovative solutions based on quantum devices or analog-digital mixed approaches often based on the time evolution of differential equations. Such promising machinery require accurate analysis to understand if and how they will be able to perform better than classical approaches in solving hard optimization problems. Here we challenge two machines representative of the quantum annealing and differential equations approaches, namely D-Wave and Memcomputing by devising a benchmark of three well known hard optimization problems from the realms of number theory, optimal transport and optimal scheduling. We introduce the Mean First Solution Time, a novel metric for accurately comparing performances, and take as baseline the classical Gurobi solver. We show that performances of both solvers are heavily dependent on the selected set of internal parameters. Results shed lights on the advantages and current limits of each paradigm and give a perspective on possible future developments.