A Load-Balancing Shared-Protection-Path Reconfiguration Approach in WDM Wavelength-Routed Networks

Wavelength-routed networks (WRN) are very promising candidates for next-generation Internet and telecommunication backbones. In such a network, optical-layer protection is of paramount importance due to the risk of losing large amounts of data under a failure. To protect the network against this risk, service providers usually provide a pair of risk-independent working and protection paths for each optical connection. However, the investment made for the optical-layer protection increases network cost. To reduce the capital expenditure, service providers need to efficiently utilize their network resources. Among all the existing approaches, shared-path protection has proven to be practical and cost-efficient [1]. In shared-path protection, several protection paths can share a wavelength on a fiber link if their working paths are risk-independent. In real-world networks, provisioning is usually implemented without the knowledge of future network resource utilization status. As the network changes with the addition and deletion of connections, the network utilization will become sub-optimal. Reconfiguration, which is referred to as the method of re-provisioning the existing connections, is an attractive solution to fill in the gap between the current network utilization and its optimal value [2]. In this paper, we propose a new shared-protection-path reconfiguration approach. Unlike some of previous reconfiguration approaches that alter the working paths, our approach only changes protection paths, and hence does not interfere with the ongoing services on the working paths, and is therefore risk-free. Previous studies have verified the benefits arising from the reconfiguration of existing connections [2] [3] [4]. Most of them are aimed at minimizing the total used wavelength-links or ports. However, this objective does not directly relate to cost saving because minimizing the total network resource consumption does not necessarily maximize the capability of accommodating future connections. As a result, service providers may still need to pay for early network upgrades. Alternatively, our proposed shared-protection-path reconfiguration approach is based on a load-balancing objective, which minimizes the network load distribution vector (LDV, see Section 2). This new objective is designed to postpone network upgrades, thus bringing extra cost savings to service providers. In other words, by using the new objective, service providers can establish as many connections as possible before network upgrades, resulting in increased revenue. We develop a heuristic load-balancing (LB) reconfiguration approach based on this new objective and compare its performance with an approach previously introduced in [2] and [4], whose objective is minimizing the total network resource consumption.

Survivable Traffic Grooming with Path Protection at the Connection Level in WDM Mesh Networks

Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength division multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated protection and shared protection schemes are considered. Given the network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures such as fiber cut and duct cut, we consider the general shared risk link group (SRLG) diverse routing constraints. We first resort to the integer linear programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA) and tabu search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu search method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.

Maximizing Resource Sharing in WDM Mesh Networks With Path-Based Protection and Sparse OEO Regeneration

We propose a resource-sharing scheme that supports three kinds of sharing scenarios in a WDM mesh network with path-based protection and sparse OEO regeneration. Several approaches are used to maximize the sharing of wavelength-links and OEO regenerators.

EFFICIENT FAULT LOCATION IN UNDERGROUND DISTRIBUTION SYSTEMS THROUGH OPTIMUM-PATH FOREST

In this article we propose an efficient and accurate method for fault location in underground distribution systems by means of an Optimum-Path Forest (OPF) classifier. We applied the time domains reflectometry method for signal acquisition, which was further analyzed by OPF and several other well-known pattern recognition techniques. The results indicated that OPF and support vector machines outperformed artificial neural networks and a Bayesian classifier, but OPF was much more efficient than all classifiers for training, and the second fastest for classification.

Contributions to underwater glider path planning

[ES] La Planificación de Rutas o Caminos es un disciplina de Robótica que trata la búsqueda de caminos factibles u óptimos. Para la mayoría de vehículos y entornos, no es un problema trivial y por tanto nos encontramos con un gran diversidad de algoritmos para resolverlo, no sólo en Robótica e Inteligencia Artificial, sino también como parte de la literatura de Optimización, con Métodos Numéricos y Algoritmos Bio-inspirados, como Algoritmos Genéticos y el Algoritmo de la Colonia de Hormigas. El caso particular de escenarios de costes variables es considerablemente difícil de abordar porque el entorno en el que se mueve el vehículo cambia con el tiempo. El presente trabajo de tesis estudia este problema y propone varias soluciones prácticas para aplicaciones de Robótica Submarina.

Path planning for image based visual servoing

This thesis deals with Visual Servoing and its strictly connected disciplines like projective geometry, image processing, robotics and non-linear control. More specifically the work addresses the problem to control a robotic manipulator through one of the largely used Visual Servoing techniques: the Image Based Visual Servoing (IBVS). In Image Based Visual Servoing the robot is driven by on-line performing a feedback control loop that is closed directly in the 2D space of the camera sensor. The work considers the case of a monocular system with the only camera mounted on the robot end effector (eye in hand configuration). Through IBVS the system can be positioned with respect to a 3D fixed target by minimizing the differences between its initial view and its goal view, corresponding respectively to the initial and the goal system configurations: the robot Cartesian Motion is thus generated only by means of visual informations. However, the execution of a positioning control task by IBVS is not straightforward because singularity problems may occur and local minima may be reached where the reached image is very close to the target one but the 3D positioning task is far from being fulfilled: this happens in particular for large camera displacements, when the the initial and the goal target views are noticeably different. To overcame singularity and local minima drawbacks, maintaining the good properties of IBVS robustness with respect to modeling and camera calibration errors, an opportune image path planning can be exploited. This work deals with the problem of generating opportune image plane trajectories for tracked points of the servoing control scheme (a trajectory is made of a path plus a time law). The generated image plane paths must be feasible i.e. they must be compliant with rigid body motion of the camera with respect to the object so as to avoid image jacobian singularities and local minima problems. In addition, the image planned trajectories must generate camera velocity screws which are smooth and within the allowed bounds of the robot. We will show that a scaled 3D motion planning algorithm can be devised in order to generate feasible image plane trajectories. Since the paths in the image are off-line generated it is also possible to tune the planning parameters so as to maintain the target inside the camera field of view even if, in some unfortunate cases, the feature target points would leave the camera images due to 3D robot motions. To test the validity of the proposed approach some both experiments and simulations results have been reported taking also into account the influence of noise in the path planning strategy. The experiments have been realized with a 6DOF anthropomorphic manipulator with a fire-wire camera installed on its end effector: the results demonstrate the good performances and the feasibility of the proposed approach.

Multithread parallelization of lepp-bisection algorithms

[EN]Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated in terms of the longest edge propagation path (Lepp) and terminal edge concepts, to refine the target triangles and some related neighbors. We discuss a parallel multithread algorithm, where every thread is in charge of refining a triangle t and its associated Lepp neighbors. The thread manages a changing Lepp(t) (ordered set of increasing triangles) both to find a last longest (terminal) edge and to refine the pair of triangles sharing this edge...

New path integral simulation algorithms and their application to creep in the quantum sine-Gordon chain

A path integral simulation algorithm which includes a higher-order Trotter approximation (HOA)is analyzed and compared to an approach which includes the correct quantum mechanical pair interaction (effective Propagator (EPr)). It is found that the HOA algorithmconverges to the quantum limit with increasing Trotter number P as P^{-4}, while the EPr algorithm converges as P^{-2}.The convergence rate of the HOA algorithm is analyzed for various physical systemssuch as a harmonic chain,a particle in a double-well potential, gaseous argon, gaseous helium and crystalline argon. A new expression for the estimator for the pair correlation function in the HOA algorithm is derived. A new path integral algorithm, the hybrid algorithm, is developed.It combines an exact treatment of the quadratic part of the Hamiltonian and thehigher-order Trotter expansion techniques.For the discrete quantum sine-Gordon chain (DQSGC), it is shown that this algorithm works more efficiently than all other improved path integral algorithms discussed in this work. The new simulation techniques developed in this work allow the analysis of theDQSGC and disordered model systems in the highly quantum mechanical regime using path integral molecular dynamics (PIMD)and adiabatic centroid path integral molecular dynamics (ACPIMD).The ground state phonon dispersion relation is calculated for the DQSGC by the ACPIMD method.It is found that the excitation gap at zero wave vector is reduced by quantum fluctuations. Two different phases exist: One phase with a finite excitation gap at zero wave vector, and a gapless phase where the excitation gap vanishes.The reaction of the DQSGC to an external driving force is analyzed at T=0.In the gapless phase the system creeps if a small force is applied, and in the phase with a gap the system is pinned. At a critical force, the systems undergo a depinning transition in both phases and flow is induced. The analysis of the DQSGC is extended to models with disordered substrate potentials. Three different cases are analyzed: Disordered substrate potentials with roughness exponent H=0, H=1/2,and a model with disordered bond length. For all models, the ground state phonon dispersion relation is calculated.

Enabling a direct path from end-user specifications to executable protocols in a biology laboratory environment

Biomedical analyses are becoming increasingly complex, with respect to both the type of the data to be produced and the procedures to be executed. This trend is expected to continue in the future. The development of information and protocol management systems that can sustain this challenge is therefore becoming an essential enabling factor for all actors in the field. The use of custom-built solutions that require the biology domain expert to acquire or procure software engineering expertise in the development of the laboratory infrastructure is not fully satisfactory because it incurs undesirable mutual knowledge dependencies between the two camps. We propose instead an infrastructure concept that enables the domain experts to express laboratory protocols using proper domain knowledge, free from the incidence and mediation of the software implementation artefacts. In the system that we propose this is made possible by basing the modelling language on an authoritative domain specific ontology and then using modern model-driven architecture technology to transform the user models in software artefacts ready for execution in a multi-agent based execution platform specialized for biomedical laboratories.

On the path of Exploratory Search Users - A Semantic Web tool

L’Exploratory Search, paradigma di ricerca basato sulle attività di scoperta e d’apprendimento, è stato per diverso tempo ignorato dai motori di ricerca tradizionali. Invece, è spesso dalle ricerche esplorative che nascono le idee più innovative. Le recenti tecnologie del Semantic Web forniscono le soluzioni che permettono d’implementare dei motori di ricerca capaci di accompagnare gli utenti impegnati in tale tipo di ricerca. Aemoo, motore di ricerca sul quale s’appoggia questa tesi ne è un esempio efficace. A partire da quest’ultimo e sempre con l’aiuto delle tecnologie del Web of Data, questo lavoro si propone di fornire una metodologia che permette di prendere in considerazione la singolarità del profilo di ciascun utente al fine di guidarlo nella sua ricerca esplorativa in modo personalizzato. Il criterio di personalizzazione che abbiamo scelto è comportamentale, ovvero basato sulle decisioni che l’utente prende ad ogni tappa che ritma il processo di ricerca. Implementando un prototipo, abbiamo potuto testare la validità di quest’approccio permettendo quindi all’utente di non essere più solo nel lungo e tortuoso cammino che porta alla conoscenza.

Physiologie eines erlernten Körpermodells in Drosophila melanogaster

In der vorliegenden Dissertation wird ein Körpergrößengedächtnis untersucht. Es wird dargestellt, wie diese Information über die Reichweite der Fliege beim Lückenklettern unter kotrollierten Umweltbedingungen erworben und prozessiert wird. Zusätzlich wird geklärt, welche biochemischen Signale benötigt werden, um daraus ein lang anhalten-des Gedächtnis zu formen. Adulte Fliegen sind in der Lage, ihre Körperreichweite zu lernen. Naive Fliegen, die in der Dunkelheit gehalten wurden, versuchen erfolglos, zu breite Lücken zu überqueren, während visuell erfahrene Fliegen die Kletterversuche an ihre Körpergröße anpassen. Erfahrene kleine Fliegen scheinen Kenntnis ihres Nachteils zu haben. Sie kehren an Lückenbreiten um, welche ihre größeren Artgenos-sen durchaus noch versuchen. Die Taufliegen lernen die größenabhängige Reichweite über die visuelle Rückmeldung während des Laufens (aus Parallaxenbewegung). Da-bei reichen 15 min in strukturierter, heller Umgebung aus. Es gibt keinen festgelegten Beginn der sensiblen Phase. Nach 2 h ist das Gedächtnis jedoch konsolidiert und kann durch Stress nicht mehr zerstört oder durch sensorische Eingänge verändert werden. Dunkel aufgezogene Fliegen wurden ausgewählten Streifenmustern mit spezifischen Raumfrequenzen ausgesetzt. Nur die Insekten, welche mit einem als „optimal“ klassi-fizierten Muster visuell stimuliert wurden, sind in der Lage, die Körperreichweite einzu-schätzen, indem die durchschnittliche Schrittlänge in Verbindung mit der visuellen Wahrnehmung gebracht wird. Überraschenderweise ist es sogar mittels partieller Kompensation der Parallaxen möglich, naive Fliegen so zu trainieren, dass sie sich wie kleinere Exemplare verhalten. Da die Experimente ein Erlernen der Körperreich-weite vermuten lassen, wurden lernmutante Stämme beim Lückenüberwinden getes-tet. Sowohl die Ergebnisse von rut1- und dnc1-Mutanten, als auch das defizitäre Klet-tern von oc1-Fliegen ließ eine Beteiligung der cAMP-abhängigen Lernkaskade in der Protocerebralbrücke (PB) vermuten. Rettungsexperimente der rut1- und dnc1-Hinter-gründe kartierten das Gedächtnis in unterschiedliche Neuronengruppen der PB, wel-che auch für die visuelle Ausrichtung des Kletterns benötigt werden. Erstaunlicher-weise haben laterale lokale PB-Neurone und PFN-Neurone (Projektion von der PB über den fächerförmigen Körper zu den Noduli) verschiedene Erfordernisse für cAMP-Signale. Zusammenfassend weisen die Ergebnisse darauf hin, dass hohe Mengen an cAMP/PKA-Signalen in den latero-lateralen Elementen der PB benötigt werden, wäh-rend kolumnäre PFN-Neurone geringe oder keine Mengen an cAMP/PKA erfordern. Das Körperreichweitengedächtnis ist vermutlich das am längsten andauernde Ge-dächtnis in Drosophila. Wenn es erst einmal konsolidiert ist hält es länger als drei Wo-chen.rnAußerdem kann die Fruchtliege Drosophila melanogaster trainiert werden, die kom-plexe motorische Aufgabe des Lückenkletterns zu optimieren. Die trainierten Fliegen werden erfolgreicher und schneller beim Überqueren von Lücken, welche größer sind als sie selbst. Dabei existiert eine Kurzeitkomponente (STM), die 40 min nach dem ersten Training anhält. Nach weiteren vier Trainingsdurchläufen im Abstand von 20 min wird ein Langzeitgedächtnis (LTM) zum Folgetag geformt. Analysen mit Mutati-onslinien wiesen eine Beteiligung der cAMP-abhängigen Lernkaskade an dieser Ge-dächtnisform auf. Rettungsexperimente des rut2080-Hintergrunds kartierten sowohl das STM, als auch das LTM in PFN-Neuronen. Das STM kann aber ebenso in den alpha- und beta- Loben der Pilzkörper gerettet werden.rnLetztendlich sind wildtypische Fliegen sogar in der Lage, sich an einen Verlust eines Mittelbeintarsuses und dem einhergehenden Fehlen des Adhäsionsorgans am Tarsusende anzupassen. Das Klettern wird zwar sofort schlechter, erholt sich aber bis zum Folgetag wieder auf ein normales Niveau. Dieser neue Zustand erfordert ein Ge-dächtnis für die physischen Möglichkeiten, die nur durch plastische Veränderungen im Nervensystem des Insekts erreicht werden können.

GSR deposition along the bullet path in contact shots to composite models

In contact shots, all the materials emerging from the muzzle (combustion gases, soot, powder grains, and metals from the primer) will be driven into the depth of the entrance wound and the following sections of the bullet track. The so-called "pocket" ("powder cavity") under the skin containing soot and gunpowder particles is regarded as a significant indicator of a contact entrance wound since one would expect that the quantity of GSR deposited along the bullet's path rapidly declines towards the exit hole. Nevertheless, experience has shown that soot, powder particles, and carboxyhemoglobin may be found not only in the initial part of the wound channel, but also far away from the entrance and even at the exit. In order to investigate the propagation of GSRs under standardized conditions, contact test shots were fired against composite models of pig skin and 25-cm-long gelatin blocks using 9-mm Luger pistol cartridges with two different primers (Sinoxid® and Sintox®). Subsequently, 1-cm-thick layers of the gelatin blocks were examined as to their primer element contents (lead, barium, and antimony as discharge residues of Sinoxid® as well as zinc and titanium from Sintox®) by means of X-ray fluorescence spectroscopy. As expected, the highest element concentrations were found in the initial parts of the bullet tracks, but also the distal sections contained detectable amounts of the respective primer elements. The same was true for amorphous soot and unburned/partly burned powder particles, which could be demonstrated even at the exit site. With the help of a high-speed motion camera it was shown that for a short time the temporary cavitation extends from the entrance to the exit thus facilitating the unlimited spread of discharge residues along the whole bullet path.