97 research outputs found

    Numana (AN). Nuovi dati dalla necropoli picena Quagliotti-Davanzali

    No full text
    L'articolo presenta i primi risultati del progetto sulla necropoli picena Quagliotti-Davanzali di Numana. Lo studio si concentra sul processo di occupazione dell'area funeraria e sulle modalità di sepoltura, che variano nel tempo. La ritualità funeraria è analizzata considerando la composizione e l'associazione dei corredi. Questo approccio ha permesso di acquisire nuovi interessanti dati per la comprensione del ruolo che dovette occupare Numana nel Mar Adriatico.The article displays the first results of the project concerning the Quagliotti-Davanzali necropolis, related to the Picenian centre of Numana. The study focuses on the process of occupation of the funeral area and the burial modalities, that vary over time. The funeral rituality is analysed considering the composition and the association of the grave goods. This approach allowed to acquire new interesting data for the understanding of the role of Numana in the Adriatic area

    An Innovative Mission Management System for Fixed-Wing UAVs

    No full text
    This paper presents two innovative units linked together to build the main frame of a UAV Mis- sion Management System. The first unit is a Path Planner for small UAVs able to generate optimal paths in a tridimensional environment, generat- ing flyable and safe paths with the lowest com- putational effort. The second unit is the Flight Management System based on Nonlinear Model Predictive Control, that tracks the reference path and exploits a spherical camera model to avoid unpredicted obstacles along the path. The control system solves on-line (i.e. at each sampling time) a finite horizon (state horizon) open loop optimal control problem with a Genetic Algorithm. This algorithm finds the command sequence that min- imizes the tracking error with respect to the ref- erence path, driving the aircraft far from sensed obstacles and towards the desired trajectory

    Power-aware optimization of baseband-function placement in cloud radio access networks

    No full text
    Because of the advent of highly diverse and heterogeneous services, 5G networks required the design of a new paradigm in terms of Radio Access Networks. The Centralized- RAN appeared as a suitable solution, enabling the reduction of costs by centralizing the baseband functions. Nevertheless, it requires very high bandwidth, making it unfeasible. Functional splits were proposed to divide the protocol stack and place the baseband functions in Central Units (CU) or Distributed Units (DU). It is an efficient way of enabling different types of services while reducing costs for operators. However, each split option introduces very stringent constraints in terms of latency, throughput and processing. The problem that arises is how to optimally place the CU functions in the network nodes. This paper proposes an optimization framework to minimize link and node power, subject to the split requirements. We also present models to compute bandwidth, computational effort and latency for splits 2 (PDCP-RLC) and 6 (MAC-PHY). The solution proposed was compared to the fully centralized and distributed scenarios over a realistic topology of a metro network with 24-hour traffic. Results show that the proposed CU-placement optimization reduces the power consumption in respect to both scenarios in split 2. In addition, even if the consumption is very similar to the centralized scenario in split 6, the ILP solution meets the latency requirements. Finally, when comparing the split options, the overall power consumption in split 2 is 5% lower than split 6

    Method and system for network topology updating using topology perturbation

    No full text
    An iterative method for configuring a communication network includes the steps of identifying a given network configuration having a given network topology based on arcs having associated administrative routing weights and including a number of given shortest paths, generating at least one neighbouring configuration by producing in the network topology a perturbation leaving administrative routing weights unaffected and wherein the majority of the shortest paths in the neighbouring configuration have shortest paths from the number left unaffected by the perturbation and combinations of shortest paths from said number, evaluating the neighbouring configuration against the given configuration based on a given cost function, whereby the evaluation involves only the portion of the network topology affected by the perturbation, and substituting the neighbouring configuration for the given configuration if the neighbouring configuration is found to represent an improvement over the given configuration based on the cost function
    corecore