Lateral tires characterization: testing, analytical models and applications for aeronautic purpose

The lateral characteristics of tires in terms of lateral forces as a function of sideslip angle is a focal point in the prediction of ground loads and ground handling aircraft behavior. However, tests to validate such coefficients are not mandatory to obtain Aircraft Type Certification and so they are not available for ATR tires. Anyway, some analytical values are implemented in ATR calculation codes (Flight Qualities in-house numerical code and Loads in-house numerical code). Hence, the goal of my work is to further investigate and validate lateral tires characteristics by means of: exploitation and re-parameterization of existing test on NLG tires, implementation of easy-handle model based on DFDR parameters to compute sideslip angles, application of this model to compute lateral loads on existing flight tests and incident cases, analysis of results. The last part of this work is dedicated to the preliminary study of a methodology to perform a test to retrieve lateral tire loads during ground turning with minimum requirements in terms of aircraft test instrumentation. This represents the basis for future works.

Groupme: city data and multi-preference activity allocation

Classic group recommender systems focus on providing suggestions for a fixed group of people. Our work tries to give an inside look at design- ing a new recommender system that is capable of making suggestions for a sequence of activities, dividing people in subgroups, in order to boost over- all group satisfaction. However, this idea increases problem complexity in more dimensions and creates great challenge to the algorithm’s performance. To understand the e↵ectiveness, due to the enhanced complexity and pre- cise problem solving, we implemented an experimental system from data collected from a variety of web services concerning the city of Paris. The sys- tem recommends activities to a group of users from two di↵erent approaches: Local Search and Constraint Programming. The general results show that the number of subgroups can significantly influence the Constraint Program- ming Approaches’s computational time and e�cacy. Generally, Local Search can find results much quicker than Constraint Programming. Over a lengthy period of time, Local Search performs better than Constraint Programming, with similar final results.