Two stroke cycle, novel combustion concepts and electrification for a new generation of internal combustion engines

The pursuit of decarbonization and increased efficiency in internal combustion engines (ICE) is crucial for reducing pollution in the mobility sector. While electrification is a long-term goal, ICE still has a role to play if coupled with innovative technologies. This research project explores various solutions to enhance ICE efficiency and reduce emissions, including Low Temperature Combustion (LTC), Dual fuel combustion with diesel and natural gas, and hydrogen integration. LTC methods like Dual fuel and Reactivity Controlled Compression Ignition (RCCI) show promise in lowering emissions such as NOx, soot, and CO2. Dual fuel Diesel-Natural Gas with hydrogen addition demonstrates improved efficiency, especially at low loads. RCCI Diesel-Gasoline engines offer increased Brake Thermal Efficiency (BTE) compared to standard diesel engines while reducing specific NOx emissions. The study compares 2-Stroke and 4-Stroke engine layouts, optimizing scavenging systems for both aircraft and vehicle applications. CFD analysis enhances specific power output while addressing injection challenges to prevent exhaust short circuits. Additionally, piston bowl shape optimization in Diesel engines running on Dual fuel (Diesel-Biogas) aims to reduce NOx emissions and enhance thermal efficiency. Unconventional 2-Stroke architectures, such as reverse loop scavenged with valves for high-performance cars, opposed piston engines for electricity generation, and small loop scavenged engines for scooters, are also explored. These innovations, alongside ultra-lean hydrogen combustion, offer diverse pathways toward achieving climate neutrality in the transport sector.

Design and testing of innovative, artificial intelligence-based techniques to model and control the combustion process and to reduce the Co2 emissions in modern, high-performance, gasoline direct injection engines

This work deals with the development of calibration procedures and control systems to improve the performance and efficiency of modern spark ignition turbocharged engines. The algorithms developed are used to optimize and manage the spark advance and the air-to-fuel ratio to control the knock and the exhaust gas temperature at the turbine inlet. The described work falls within the activity that the research group started in the previous years with the industrial partner Ferrari S.p.a. . The first chapter deals with the development of a control-oriented engine simulator based on a neural network approach, with which the main combustion indexes can be simulated. The second chapter deals with the development of a procedure to calibrate offline the spark advance and the air-to-fuel ratio to run the engine under knock-limited conditions and with the maximum admissible exhaust gas temperature at the turbine inlet. This procedure is then converted into a model-based control system and validated with a Software in the Loop approach using the engine simulator developed in the first chapter. Finally, it is implemented in a rapid control prototyping hardware to manage the combustion in steady-state and transient operating conditions at the test bench. The third chapter deals with the study of an innovative and cheap sensor for the in-cylinder pressure measurement, which is a piezoelectric washer that can be installed between the spark plug and the engine head. The signal generated by this kind of sensor is studied, developing a specific algorithm to adjust the value of the knock index in real-time. Finally, with the engine simulator developed in the first chapter, it is demonstrated that the innovative sensor can be coupled with the control system described in the second chapter and that the performance obtained could be the same reachable with the standard in-cylinder pressure sensors.

Design and implementation of bioinformatics tools for large scale genome annotation

The continuous increase of genome sequencing projects produced a huge amount of data in the last 10 years: currently more than 600 prokaryotic and 80 eukaryotic genomes are fully sequenced and publically available. However the sole sequencing process of a genome is able to determine just raw nucleotide sequences. This is only the first step of the genome annotation process that will deal with the issue of assigning biological information to each sequence. The annotation process is done at each different level of the biological information processing mechanism, from DNA to protein, and cannot be accomplished only by in vitro analysis procedures resulting extremely expensive and time consuming when applied at a this large scale level. Thus, in silico methods need to be used to accomplish the task. The aim of this work was the implementation of predictive computational methods to allow a fast, reliable, and automated annotation of genomes and proteins starting from aminoacidic sequences. The first part of the work was focused on the implementation of a new machine learning based method for the prediction of the subcellular localization of soluble eukaryotic proteins. The method is called BaCelLo, and was developed in 2006. The main peculiarity of the method is to be independent from biases present in the training dataset, which causes the over‐prediction of the most represented examples in all the other available predictors developed so far. This important result was achieved by a modification, made by myself, to the standard Support Vector Machine (SVM) algorithm with the creation of the so called Balanced SVM. BaCelLo is able to predict the most important subcellular localizations in eukaryotic cells and three, kingdom‐specific, predictors were implemented. In two extensive comparisons, carried out in 2006 and 2008, BaCelLo reported to outperform all the currently available state‐of‐the‐art methods for this prediction task. BaCelLo was subsequently used to completely annotate 5 eukaryotic genomes, by integrating it in a pipeline of predictors developed at the Bologna Biocomputing group by Dr. Pier Luigi Martelli and Dr. Piero Fariselli. An online database, called eSLDB, was developed by integrating, for each aminoacidic sequence extracted from the genome, the predicted subcellular localization merged with experimental and similarity‐based annotations. In the second part of the work a new, machine learning based, method was implemented for the prediction of GPI‐anchored proteins. Basically the method is able to efficiently predict from the raw aminoacidic sequence both the presence of the GPI‐anchor (by means of an SVM), and the position in the sequence of the post‐translational modification event, the so called ω‐site (by means of an Hidden Markov Model (HMM)). The method is called GPIPE and reported to greatly enhance the prediction performances of GPI‐anchored proteins over all the previously developed methods. GPIPE was able to predict up to 88% of the experimentally annotated GPI‐anchored proteins by maintaining a rate of false positive prediction as low as 0.1%. GPIPE was used to completely annotate 81 eukaryotic genomes, and more than 15000 putative GPI‐anchored proteins were predicted, 561 of which are found in H. sapiens. In average 1% of a proteome is predicted as GPI‐anchored. A statistical analysis was performed onto the composition of the regions surrounding the ω‐site that allowed the definition of specific aminoacidic abundances in the different considered regions. Furthermore the hypothesis that compositional biases are present among the four major eukaryotic kingdoms, proposed in literature, was tested and rejected. All the developed predictors and databases are freely available at: BaCelLo http://gpcr.biocomp.unibo.it/bacello eSLDB http://gpcr.biocomp.unibo.it/esldb GPIPE http://gpcr.biocomp.unibo.it/gpipe

Algorithms for network design and routing problems

In this thesis we study three combinatorial optimization problems belonging to the classes of Network Design and Vehicle Routing problems that are strongly linked in the context of the design and management of transportation networks: the Non-Bifurcated Capacitated Network Design Problem (NBP), the Period Vehicle Routing Problem (PVRP) and the Pickup and Delivery Problem with Time Windows (PDPTW). These problems are NP-hard and contain as special cases some well known difficult problems such as the Traveling Salesman Problem and the Steiner Tree Problem. Moreover, they model the core structure of many practical problems arising in logistics and telecommunications. The NBP is the problem of designing the optimum network to satisfy a given set of traffic demands. Given a set of nodes, a set of potential links and a set of point-to-point demands called commodities, the objective is to select the links to install and dimension their capacities so that all the demands can be routed between their respective endpoints, and the sum of link fixed costs and commodity routing costs is minimized. The problem is called non- bifurcated because the solution network must allow each demand to follow a single path, i.e., the flow of each demand cannot be splitted. Although this is the case in many real applications, the NBP has received significantly less attention in the literature than other capacitated network design problems that allow bifurcation. We describe an exact algorithm for the NBP that is based on solving by an integer programming solver a formulation of the problem strengthened by simple valid inequalities and four new heuristic algorithms. One of these heuristics is an adaptive memory metaheuristic, based on partial enumeration, that could be applied to a wider class of structured combinatorial optimization problems. In the PVRP a fleet of vehicles of identical capacity must be used to service a set of customers over a planning period of several days. Each customer specifies a service frequency, a set of allowable day-combinations and a quantity of product that the customer must receive every time he is visited. For example, a customer may require to be visited twice during a 5-day period imposing that these visits take place on Monday-Thursday or Monday-Friday or Tuesday-Friday. The problem consists in simultaneously assigning a day- combination to each customer and in designing the vehicle routes for each day so that each customer is visited the required number of times, the number of routes on each day does not exceed the number of vehicles available, and the total cost of the routes over the period is minimized. We also consider a tactical variant of this problem, called Tactical Planning Vehicle Routing Problem, where customers require to be visited on a specific day of the period but a penalty cost, called service cost, can be paid to postpone the visit to a later day than that required. At our knowledge all the algorithms proposed in the literature for the PVRP are heuristics. In this thesis we present for the first time an exact algorithm for the PVRP that is based on different relaxations of a set partitioning-like formulation. The effectiveness of the proposed algorithm is tested on a set of instances from the literature and on a new set of instances. Finally, the PDPTW is to service a set of transportation requests using a fleet of identical vehicles of limited capacity located at a central depot. Each request specifies a pickup location and a delivery location and requires that a given quantity of load is transported from the pickup location to the delivery location. Moreover, each location can be visited only within an associated time window. Each vehicle can perform at most one route and the problem is to satisfy all the requests using the available vehicles so that each request is serviced by a single vehicle, the load on each vehicle does not exceed the capacity, and all locations are visited according to their time window. We formulate the PDPTW as a set partitioning-like problem with additional cuts and we propose an exact algorithm based on different relaxations of the mathematical formulation and a branch-and-cut-and-price algorithm. The new algorithm is tested on two classes of problems from the literature and compared with a recent branch-and-cut-and-price algorithm from the literature.

Design and fabrication of biocompatible scaffolds for the regeneration of tissues

Regenerative medicine and tissue engineering attempt to repair or improve the biological functions of tissues that have been damaged or have ceased to perform their role through three main components: a biocompatible scaffold, cellular component and bioactive molecules. Nanotechnology provide a toolbox of innovative scaffold fabrication procedures in regenerative medicine. In fact, nanotechnology, using manufacturing techniques such as conventional and unconventional lithography, allows fabricating supports with different geometries and sizes as well as displaying physical chemical properties tunable over different length scales. Soft lithography techniques allow to functionalize the support by specific molecules that promote adhesion and control the growth of cells. Understanding cell response to scaffold, and viceversa, is a key issue; here we show our investigation of the essential features required for improving the cell-surface interaction over different scale lengths. The main goal of this thesis has been to devise a nanotechnology-based strategy for the fabrication of scaffolds for tissue regeneration. We made four types of scaffolds, which are able to accurately control cell adhesion and proliferation. For each scaffold, we chose properly designed materials, fabrication and characterization techniques.

Design and Synthesis of Novel Kinase Inhibitors for the Treatment of Chronic Respiratory Diseases

In 2017, Chronic Respiratory Diseases accounted for almost four million deaths worldwide. Unfortunately, current treatments are not definitive for such diseases. This unmet medical need forces the scientific community to increase efforts in the identification of new therapeutic solutions. PI3K delta plays a key role in mechanisms that promote airway chronic inflammation underlying Asthma and COPD. The first part of this project was dedicated to the identification of novel PI3K delta inhibitors. A first SAR expansion of a Hit, previously identified by a HTS campaign, was carried out. A library of 43 analogues was synthesised taking advantage of an efficient synthetic approach. This allowed the identification of an improved Hit of nanomolar enzymatic potency and moderate selectivity for PI3K delta over other PI3K isoforms. However, this compound exhibited low potency in cell-based assays. Low cellular potency was related to sub optimal phys-chem and ADME properties. The analysis of the X-ray crystal structure of this compound in human PI3K delta guided a second tailored SAR expansion that led to improved cellular potency and solubility. The second part of the thesis was focused on the rational design and synthesis of new macrocyclic Rho-associated protein kinases (ROCKs) inhibitors. Inhibition of these kinases has been associated with vasodilating effects. Therefore, ROCKs could represent attractive targets for the treatment of pulmonary arterial hypertension (PAH). Known ROCK inhibitors suffer from low selectivity across the kinome. The design of macrocyclic inhibitors was considered a promising strategy to obtain improved selectivity. Known inhibitors from literature were evaluated for opportunities of macrocyclization using a knowledge-based approach supported by Computer Aided Drug Design (CADD). The identification of a macrocyclic ROCK inhibitor with enzymatic activity in the low micro molar range against ROCK II represented a promising result that validated this innovative approach in the design of new ROCKs inhibitors.

Nanostructured piezoelectric materials for the design and development of self-sensing composite materials and energy harvesting devices

The work activities reported in this PhD thesis regard the functionalization of composite materials and the realization of energy harvesting devices by using nanostructured piezoelectric materials, which can be integrated in the composite without affecting its mechanical properties. The self-sensing composite materials were fabricated by interleaving between the plies of the laminate the piezoelectric elements. The problem of negatively impacting on the mechanical properties of the hosting structure was addressed by shaping the piezoelectric materials in appropriate ways. In the case of polymeric piezoelectric materials, the electrospinning technique allowed to produce highly-porous nanofibrous membranes which can be immerged in the hosting matrix without inducing delamination risk. The flexibility of the polymers was exploited also for the production of flexible tactile sensors. The sensing performances of the specimens were evaluated also in terms of lifetime with fatigue tests. In the case of ceramic piezo-materials, the production and the interleaving of nanometric piezoelectric powder limitedly affected the impact resistance of the laminate, which showed enhanced sensing properties. In addition to this, a model was proposed to predict the piezoelectric response of the self-sensing composite materials as function of the amount of the piezo-phase within the laminate and to adapt its sensing functionalities also for quasi-static loads. Indeed, one final application of the work was to integrate the piezoelectric nanofibers in the sole of a prosthetic foot in order to detect the walking cycle, which has a period in the order of 1 second. In the end, the energy harvesting capabilities of the piezoelectric materials were investigated, with the aim to design wearable devices able to collect energy from the environment and from the body movements. The research activities focused both on the power transfer capability to an external load and the charging of an energy storage unit, like, e.g., a supercapacitor.