Condensation phenomena in nonlinear drift equations

We study nonnegative, measure-valued solutions to nonlinear drift type equations modelling concentration phenomena related to Bose-Einstein particles. In one spatial dimension, we prove existence and uniqueness for measure solutions. Moreover, we prove that all solutions blow up in finite time leading to a concentration of mass only at the origin, and the concentrated mass absorbs increasingly the mass converging to the total mass as time goes to infinity. Our analysis makes a substantial use of independent variable scalings and pseudo-inverse functions techniques

A genetic algorithm for the design of a fuzzy controller for active queue management

Active queue management (AQM) policies are those policies of router queue management that allow for the detection of network congestion, the notification of such occurrences to the hosts on the network borders, and the adoption of a suitable control policy. This paper proposes the adoption of a fuzzy proportional integral (FPI) controller as an active queue manager for Internet routers. The analytical design of the proposed FPI controller is carried out in analogy with a proportional integral (PI) controller, which recently has been proposed for AQM. A genetic algorithm is proposed for tuning of the FPI controller parameters with respect to optimal disturbance rejection. In the paper the FPI controller design metodology is described and the results of the comparison with random early detection (RED), tail drop, and PI controller are presented

A management architecture for active networks

In this paper we present an architecture for network and applications management, which is based on the Active Networks paradigm and shows the advantages of network programmability. The stimulus to develop this architecture arises from an actual need to manage a cluster of active nodes, where it is often required to redeploy network assets and modify nodes connectivity. In our architecture, a remote front-end of the managing entity allows the operator to design new network topologies, to check the status of the nodes and to configure them. Moreover, the proposed framework allows to explore an active network, to monitor the active applications, to query each node and to install programmable traps. In order to take advantage of the Active Networks technology, we introduce active SNMP-like MIBs and agents, which are dynamic and programmable. The programmable management agents make tracing distributed applications a feasible task. We propose a general framework that can inter-operate with any active execution environment. In this framework, both the manager and the monitor front-ends communicate with an active node (the Active Network Access Point) through the XML language. A gateway service performs the translation of the queries from XML to an active packet language and injects the code in the network. We demonstrate the implementation of an active network gateway for PLAN (Packet Language for Active Networks) in a forty active nodes testbed. Finally, we discuss an application of the active management architecture to detect the causes of network failures by tracing network events in time

Meeting in a Polygon by Anonymous Oblivious Robots

The Meeting problem for $k\geq 2$ searchers in a polygon $P$ (possibly with holes) consists in making the searchers move within $P$, according to a distributed algorithm, in such a way that at least two of them eventually come to see each other, regardless of their initial positions. The polygon is initially unknown to the searchers, and its edges obstruct both movement and vision. Depending on the shape of $P$, we minimize the number of searchers $k$ for which the Meeting problem is solvable. Specifically, if $P$ has a rotational symmetry of order $\sigma$ (where $\sigma=1$ corresponds to no rotational symmetry), we prove that $k=\sigma+1$ searchers are sufficient, and the bound is tight. Furthermore, we give an improved algorithm that optimally solves the Meeting problem with $k=2$ searchers in all polygons whose barycenter is not in a hole (which includes the polygons with no holes). Our algorithms can be implemented in a variety of standard models of mobile robots operating in Look-Compute-Move cycles. For instance, if the searchers have memory but are anonymous, asynchronous, and have no agreement on a coordinate system or a notion of clockwise direction, then our algorithms work even if the initial memory contents of the searchers are arbitrary and possibly misleading. Moreover, oblivious searchers can execute our algorithms as well, encoding information by carefully positioning themselves within the polygon. This code is computable with basic arithmetic operations, and each searcher can geometrically construct its own destination point at each cycle using only a compass. We stress that such memoryless searchers may be located anywhere in the polygon when the execution begins, and hence the information they initially encode is arbitrary. Our algorithms use a self-stabilizing map construction subroutine which is of independent interest.Comment: 37 pages, 9 figure

L’analisi delle simbolizzazioni affettive delle Aree Naturali Protette per un turismo responsabile. Il caso studio delle Riserva Naturale Orientata dello Zingaro.

ABSTRACT This paper presents a research on responsible tourism in protected areas, through the case study of Zingaro Nature Reserve (Sicily). The main objectives of this study were to examine the so-called collusive processes elaborated by different stakeholder of natural protected area and to propose strategies and guidelines for intervention in the perspective of sustainable development and responsible use of the local tourist activities, based on the results. The methodology applied was Emotional Analysis of the Text (EAT) that allowed to investigate the emotional representations and the expectations of stakeholders, through the study of co-occurrances of the so-called dense words, using the statistical software for textual analysis T-LAB

Robust Unconditionally Secure Quantum Key Distribution with Two Nonorthogonal and Uninformative States

We introduce a novel form of decoy-state technique to make the single-photon Bennett 1992 protocol robust against losses and noise of a communication channel. Two uninformative states are prepared by the transmitter in order to prevent the unambiguous state discrimination attack and improve the phase-error rate estimation. The presented method does not require strong reference pulses, additional electronics or extra detectors for its implementation.Comment: 7 pages, 2 figure

Vitiligo, NB-UVB and tacrolimus: our experience in Naples.

Aim: The aim of the present study was to evaluate the efficacy and safety of narrowband UVB (NB-UVB) compared with tacrolimus ointment 0.1% in patients with bilateral vitiligo. Methods: In this comparative study, four groups of patients were randomized. Each group was composed by 12 patients with bilateral vitiligo; in each group, every patient was irradiated with NB-UVB (length: 311 nm) twice a week for 9 months and applied tacrolimus ointment 0.1% twice a day on the other area in the same period. Before starting therapy and after 3, 6 and 9 months of therapy, a clinical and photographic evaluation of percentage of repigmentation was performed and Dermatology Life Quality Index Questionnaire was fulfilled. Results: A repigmentation at least partial occurred in 71% of patients after 36 weeks of treatment with tacrolimus ointment 0.1%; in the whole sample, 14 patients (29%) showed no repigmentation at all, with 2 of them discontinuing the therapy because of side effects (erythema and folliculitis-like manifestations). A homogeneous repigmentation at least partial occurred in 69% of patients after 36 weeks of treatment with NB-UVB; in the whole sample 15 patients (31%) showed no repigmentation at all, with 1 of them discontinuing the therapy because of side effects. Conclusion: The present study confirmed that the efficacy of NB-UVB phototherapy in vitiligo is comparable to tacrolimus ointment 0.1% therapy. On the basis of our study, we may suggest tacrolimus ointment 0.1% as an alternative to NB-UVB therapy for treating vitiligo

Photonic circuits for generating modal, spectral, and polarization entanglement

We consider the design of photonic circuits that make use of Ti:LiNbO$_{3}$ diffused channel waveguides for generating photons with various combinations of modal, spectral, and polarization entanglement. Down-converted photon pairs are generated via spontaneous optical parametric down-conversion (SPDC) in a two-mode waveguide. We study a class of photonic circuits comprising: 1) a nonlinear periodically poled two-mode waveguide structure, 2) a set of single-mode and two-mode waveguide-based couplers arranged in such a way that they suitably separate the three photons comprising the SPDC process, and, for some applications, 3) a holographic Bragg grating that acts as a dichroic reflector. The first circuit produces frequency-degenerate down-converted photons, each with even spatial parity, in two separate single-mode waveguides. Changing the parameters of the elements allows this same circuit to produce two nondegenerate down-converted photons that are entangled in frequency or simultaneously entangled in frequency and polarization. The second photonic circuit is designed to produce modal entanglement by distinguishing the photons on the basis of their frequencies. A modified version of this circuit can be used to generate photons that are doubly entangled in mode number and polarization. The third photonic circuit is designed to manage dispersion by converting modal, spectral, and polarization entanglement into path entanglement

Feynman graphs and the large dimensional limit of multipartite entanglement

We are interested in the properties of multipartite entanglement of a system composed by $n$ $d$-level parties (qudits). Focussing our attention on pure states we want to tackle the problem of the maximization of the entanglement for such systems. In particular we effort the problem trying to minimize the purity of the system. It has been shown that not for all systems this function can reach its lower bound, however it can be proved that for all values of $n$ a $d$ can always be found such that the lower bound can be reached. In this paper we examine the high-temperature expansion of the distribution function of the bipartite purity over all balanced bipartition considering its optimization problem as a problem of statistical mechanics. In particular we prove that the series characterizing the expansion converges and we analyze the behavior of each term of the series as $d\to \infty$.Comment: 29 pages, 11 figure