Ecological distribution of semi-demersal fishes in space and time on the shelf of Antalya Gulf

In this study we provide a baseline data on semidemersal fish assemblages and biology in a heterogeneous and yet less studied portion of the shelf of Antalya Gulf. The distribution of fish abundance in three transects subjected to different fisheries regulations (fishery vs non fishery areas), and including depths of 10, 25, 75, 125, 200 m, was studied between May 2014 and February 2015 in representative months of winter, spring, summer and autumn seasons. A total of 76 fish species belonging to 40 families was collected and semidemersal species distribution was analyzed in comparison with the whole community. Spatial distribution of fish was driven mainly by depth and two main assemblages were observed: shallow waters (10-25; 75 m) and deep waters (125-200 m). Significant differences among transects were found for the whole community but not for the semidemersal species. Analysis showed that this was due to a strong relation of these species with local environmental characteristics rather than to a different fishing pressure over transects. Firstly all species distribute according to the bathymetrical gradient and secondly to the bottom type structure. Semidemersal species were then found more related to zooplankton and suspended matter availability. The main morphological characteristics, sex and size distribution of the target semidemersal species Spicara smaris (Linnaeus, 1758), Saurida undosquamis (Richardson, 1848), Pagellus acarne (Risso, 1827) were also investigated.

Substructuring approache in state space models for dynamic system parameters identification

In the recent decade, the request for structural health monitoring expertise increased exponentially in the United States. The aging issues that most of the transportation structures are experiencing can put in serious jeopardy the economic system of a region as well as of a country. At the same time, the monitoring of structures is a central topic of discussion in Europe, where the preservation of historical buildings has been addressed over the last four centuries. More recently, various concerns arose about security performance of civil structures after tragic events such the 9/11 or the 2011 Japan earthquake: engineers looks for a design able to resist exceptional loadings due to earthquakes, hurricanes and terrorist attacks. After events of such a kind, the assessment of the remaining life of the structure is at least as important as the initial performance design. Consequently, it appears very clear that the introduction of reliable and accessible damage assessment techniques is crucial for the localization of issues and for a correct and immediate rehabilitation. The System Identification is a branch of the more general Control Theory. In Civil Engineering, this field addresses the techniques needed to find mechanical characteristics as the stiffness or the mass starting from the signals captured by sensors. The objective of the Dynamic Structural Identification (DSI) is to define, starting from experimental measurements, the modal fundamental parameters of a generic structure in order to characterize, via a mathematical model, the dynamic behavior. The knowledge of these parameters is helpful in the Model Updating procedure, that permits to define corrected theoretical models through experimental validation. The main aim of this technique is to minimize the differences between the theoretical model results and in situ measurements of dynamic data. Therefore, the new model becomes a very effective control practice when it comes to rehabilitation of structures or damage assessment. The instrumentation of a whole structure is an unfeasible procedure sometimes because of the high cost involved or, sometimes, because it’s not possible to physically reach each point of the structure. Therefore, numerous scholars have been trying to address this problem. In general two are the main involved methods. Since the limited number of sensors, in a first case, it’s possible to gather time histories only for some locations, then to move the instruments to another location and replay the procedure. Otherwise, if the number of sensors is enough and the structure does not present a complicate geometry, it’s usually sufficient to detect only the principal first modes. This two problems are well presented in the works of Balsamo [1] for the application to a simple system and Jun [2] for the analysis of system with a limited number of sensors. Once the system identification has been carried, it is possible to access the actual system characteristics. A frequent practice is to create an updated FEM model and assess whether the structure fulfills or not the requested functions. Once again the objective of this work is to present a general methodology to analyze big structure using a limited number of instrumentation and at the same time, obtaining the most information about an identified structure without recalling methodologies of difficult interpretation. A general framework of the state space identification procedure via OKID/ERA algorithm is developed and implemented in Matlab. Then, some simple examples are proposed to highlight the principal characteristics and advantage of this methodology. A new algebraic manipulation for a prolific use of substructuring results is developed and implemented.

The Space Race di Alex Latimer. Traduzione del romanzo di un autore sudafricano.

In the following thesis I present the book The Space Race from South African author Alex Latimer and my translation of some chapters, from English into Italian. Alex Latimer is an illustrator and author based in Cape Town, known mostly for his picture books for children, although his works also appear in magazines and advertisements. The Space Race is his first novel, but it immediately had a good reception amongst readers and critics. The author, his work and his novel The Space Race will be presented in depth in Chapter 1 of the thesis. Then, an overview on the South African fictional production will follow in Chapter 2, focusing mainly on the contemporary trends and trying to understand if and how The Space Race fits. Before presenting my translation and my reflections on the translating process itself, I will outline in Chapter 3 my general approach to the text and its translation, as well as explain the reasons why I chose those specific parts of the book. The original texts and their translations are presented in Chapter 4, preceded by a short introduction to better understand the position of the chapter in the plot and the elements of interests contained in it. A commentary on the translating process will follow in Chapter 5, about problems or just remarks on aspects of interest; also, further elements of complication in the text are described and my solutions presented. The thesis ends with a conclusion on the work done.

Graph-based User Scheduling for MIMO LEO-based Satellite Communication Systems

The study of the user scheduling problem in a Low Earth Orbit (LEO) Multi-User MIMO system is the objective of this thesis. With the application of cutting-edge digital beamforming algorithms, a LEO satellite with an antenna array and a large number of antenna elements can provide service to many user terminals (UTs) in full frequency reuse (FFR) schemes. Since the number of UTs on-ground are many more than the transmit antennas on the satellite, user scheduling is necessary. Scheduling can be accomplished by grouping users into different clusters: users within the same cluster are multiplexed and served together via Space Division Multiple Access (SDMA), i.e., digital beamforming or Multi-User MIMO techniques; the different clusters of users are then served on different time slots via Time Division Multiple Access (TDMA). The design of an optimal user grouping strategy is known to be an NP-complete problem which can be solved only through exhaustive search. In this thesis, we provide a graph-based user scheduling and feed space beamforming architecture for the downlink with the aim of reducing user inter-beam interference. The main idea is based on clustering users whose pairwise great-circle distance is as large as possible. First, we create a graph where the users represent the vertices, whereas an edge in the graph between 2 users exists if their great-circle distance is above a certain threshold. In the second step, we develop a low complex greedy user clustering technique and we iteratively search for the maximum clique in the graph, i.e., the largest fully connected subgraph in the graph. Finally, by using the 3 aforementioned power normalization techniques, a Minimum Mean Square Error (MMSE) beamforming matrix is deployed on a cluster basis. The suggested scheduling system is compared with a position-based scheduler, which generates a beam lattice on the ground and randomly selects one user per beam to form a cluster.