Nicola Santoro

Learn More
The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems – delay-tolerant networks, opportunistic-mobility networks, social networks – obtaining closely related insights. Indeed, the concepts discovered in these investigations can be viewed as parts of the same conceptual universe; and the(More)
AIMS AND BACKGROUND The optimal salvage therapy for recurrent ovarian carcinoma has not been clearly established. Response to second-line chemotherapy is low, with a short median survival (8.8-15 months). We investigated the effect of an aggressive approach consisting of surgery followed by intraperitoneal drug delivery and local hyperthermia. PATIENTS(More)
The study of what can be computed by a team of autonomous mobile robots, originally started in robotics and AI, has become increasingly popular in theoretical computer science (especially in distributed computing), where it is now an integral part of the investigations on computability by mobile entities. The robots are identical computational entities(More)
Consider a set of n > 2 identical mobile computational entities in the plane, called robots, operating in Look-Compute-Move cycles, without any means of direct communication. The Gathering Problem is the primitive task of all entities gathering in finite time at a point not fixed in advance, without any external control. The problem has been extensively(More)
We report a 13-year-old girl with leukaemia and Wernicke's encephalopathy induced by total parenteral nutrition. MRI showed unusual bilateral lesions of the caudate nuclei and cerebral cortex, as well as typical lesions surrounding the third ventricle and aqueduct. After intravenous thiamine, the patient improved, and the abnormalities on MRI disappeared.
In this paper we study the problem of gathering in the same location of the plane a collection of identical oblivious mobile robots. Previous investigations have focused mostly on the unlimited visibility setting, where each robot can always see all the other ones, regardless of their distance. In the more difficult and realistic setting where the robots(More)
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively over the past decade. In contrast, in this paper we aim at an understanding of the fundamental algorithmic limitations on what a set of autonomous mobile robots can or cannot(More)
Most instruments formalisms, concepts, and metrics for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ranging from the fine-grain dynamics of interactions (which recently led researchers to consider temporal versions of distance, connectivity, and related indicators), to the evolution of(More)
We consider sensor self-deployment problem, constructing FOCUSED coverage (F-coverage) around a Point of Interest (POI), with novel evaluation metric, coverage radius. We propose to deploy sensors in polygon layers over a locally computable equilateral triangle tessellation (TT) for optimal F-coverage formation, and introduce two types of deployment(More)