1,354,967 research outputs found
Last Interglacial sea-level proxies in the western Mediterranean
We describe a database of Last Interglacial (Marine Isotopic Stage 5) sea-level proxies for the western Mediterranean region. The database was compiled reviewing the information reported in 199 published studies and contains 396 sea-level data points (sea-level index points and marine- or terrestrial-limiting points) and 401 associated dated samples. The database follows the standardized WALIS template and is available as Cerrone et al. (2021b, https://doi.org/10.5281/zenodo.5341661)
Last Interglacial sea-level proxies in the western Mediterranean
We describe a database of Last Interglacial (Marine Isotopic Stage 5) sea-level proxies for the western Mediterranean region. The database was compiled reviewing the information reported in 199 published studies and contains 396 sea-level data points (sea-level index points and marine- or terrestrial-limiting points) and 401 associated dated samples. The database follows the standardized WALIS template and is available as Cerrone et al. (2021b, 10.5281/zenodo.5341661)
The Technological Disruption in Banking Sector - New Efforts and Challenges in the Financial Business Models
The disruptive technologies radically transform business models and create new innovative products and services. The chapter, focused on the technological disruption in banks, considers: • the assessment of technology impact, including the spread of artificial intelligence, at the level of business models and the relevance for regulators and supervisors, interested in granting a safe and sound banking system; • the main risks associated with technology considered in banking business models;• future perspectives for new strategies and business models with a transition from linear vertically-integrated models to non-linear adaptive models. The chapter outlines the state of the art in the banking services and the organizational responses, highlighting the needs not yet solved in banks' operations, but projected towards the near future, already present. The Appendix offers a framework of the banks’ approach to technology through the answers given by the sample of European banks to questions about technology in EBA’s RAQ
Relations, models and a memetic approach for three degree-dependent spanning tree problems
Abstract In this paper we take into account three different spanning tree problems with degree-dependent objective functions. The main application of these problems is in the field of optical network design. In particular, we propose the classical Minimum Leaves Spanning Tree problem as a relevant problem in this field and show its relations with the Minimum Branch Vertices and the Minimum Degree Sum Problems. We present a unified memetic algorithm for the three problems and show its effectiveness on a wide range of test instances
Henderson City Attorney v. Christopher Cerrone, 140 Nev. Adv. Op. 68 (Oct. 24, 2024)
The respondent committed domestic violence resulting in him being charged with a misdemeanor, which was later changed to a misdemeanor battery. Cerrone attempted to get the updated charge thrown out. Cerrone claimed that the charge denied him a right to a jury trial. Cerrone appealed to the district court on a mandamus relief. It was then appealed to the appellate court. The appellate court argued that the District Court had erred in their decision and the municipal court had the right to have a bench trial due to the simple battery charge
Appunti intorno ad interpretazione e principi (con particolare riferimento alle fonti del diritto) nel pensiero di Alessandro Giuliani
A Tabu Search Approach for the Circle Packing Problem
This paper concerns the problem to place N non overlapping circles in a circular container with minimum radius. This is a well known and widely studied problem with applications in manufacturing and logistics and, in particular, to problems related to cutting and packing. In this paper we propose an algorithm that by applying a strength along a selected direction on each circle, simulates the shifting of circles on the plane and tries to reduce the radius of the circular container during this movements. The algorithm is based on a multistart technique where the starting solutions are produced by a tabu search heuristic that uses also the current best solution. The algorithm takes part in a public international contest in order to find optimal solutions to a special case in circle packing. The contest saw the participation of 155 teams and our algorithm achieved the tenth positio
Naples 2011: Ten Years from Naples’s PUP Adoption
Osservatorio sulle trasformazioni urbane a Napoli riferite in particolare al sistema della mobilità
- …
