Enhancing MPLS QoS routing algorithms by using the network protection degree paradigm

IP based networks still do not have the required degree of reliability required by new multimedia services, achieving such reliability will be crucial in the success or failure of the new Internet generation. Most of existing schemes for QoS routing do not take into consideration parameters concerning the quality of the protection, such as packet loss or restoration time. In this paper, we define a new paradigm to develop new protection strategies for building reliable MPLS networks, based on what we have called the network protection degree (NPD). This NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability and an a posteriori evaluation, the failure impact degree (FID), to determine the impact on the network in case of failure. Having mathematical formulated these components, we point out the most relevant components. Experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms to offer a certain degree of protection

An ATM distributed simulator for network management research

Due to the high cost of a large ATM network working up to full strength to apply our ideas about network management, i.e., dynamic virtual path (VP) management and fault restoration, we developed a distributed simulation platform for performing our experiments. This platform also had to be capable of other sorts of tests, such as connection admission control (CAC) algorithms, routing algorithms, and accounting and charging methods. The platform was posed as a very simple, event-oriented and scalable simulation. The main goal was the simulation of a working ATM backbone network with a potentially large number of nodes (hundreds). As research into control algorithms and low-level, or rather cell-level methods, was beyond the scope of this study, the simulation took place at a connection level, i.e., there was no real traffic of cells. The simulated network behaved like a real network accepting and rejecting SNMP ones, or experimental tools using the API node

Improving Clustering Algorithms for Image Segmentation using Contour and Region Information

In image segmentation, clustering algorithms are very popular because they are intuitive and, some of them, easy to implement. For instance, the k-means is one of the most used in the literature, and many authors successfully compare their new proposal with the results achieved by the k-means. However, it is well known that clustering image segmentation has many problems. For instance, the number of regions of the image has to be known a priori, as well as different initial seed placement (initial clusters) could produce different segmentation results. Most of these algorithms could be slightly improved by considering the coordinates of the image as features in the clustering process (to take spatial region information into account). In this paper we propose a significant improvement of clustering algorithms for image segmentation. The method is qualitatively and quantitative evaluated over a set of synthetic and real images, and compared with classical clustering approaches. Results demonstrate the validity of this new approach

Thickening of the skin on the forehead: a quiz. Acanthosis nigricans with forehead location.

Publicado en la Sección Quiz de la revista.

Epileptogenic zone, electrode location and clinical outcome in hippocampal electrical stimulation for mesial temporal lobe epilepsy : a correlation study

Objectif : Etudier les résultats cliniques du traitement de patients atteints pai- une épilepsie mésiale du lobe temporal (MTLE) réfractaire, par stimulation cérébrale profonde (DBS) de l'hippocampe, en fonction de l'emplacement de l'électrode. Méthodes : Huit patients atteints de MTLE implantés dans l'hippocampe et stimulés par DBS à haute fréquence ont été inclus dans cette étude. Cinq ont subi des enregistrements invasifs avec des électrodes profondes dans le but d'estimer la localisation du foyer ictal avant de procéder à une DBS chronique. La position des contacts actifs de l'électrode a été mesurée en utilisant une imagerie post-opératoire. Les distances par rapport au foyer ictal ont été calculées, et les structures hippocampiques influencées par la stimulation ont été identifiées au moyen d'un atlas neuro-anatomique. Ces deux paramètres ont été corrélés avec la réduction de la fréquence d'apparition des crises. Résultats : Les distances entre la localisation estimée des contacts actifs de l'électrode et le foyer ictal étaient respectivement 11.0 +/- 4.3 ou 9.1 +/- 2.3 mm pour les patients présentant une réduction de > 50% ou < 50% de la fréquence des crises. Chez les patients (N = 6) montrant une réduction de > 50% de la fréquence des crises, 100% avaient des contacts actifs situés à < 3 mm du subiculum (p < 0,05). Les 2 patients ne répondant pas au traitement étaient stimulés par des contacts situés à > 3mm du subiculum. Conclusion : La diminution de l'activité épileptogène induite par DBS sur l'hippocampe dans les cas de MTLE réfractaires : 1) ne semble pas directement liée à la proximité des contacts actifs de l'électrode au foyer ictal déterminé par les enregistrements invasifs ; 2) pourrait être obtenue par une neuro-modulation du subiculum.

Fault-finding device

El projecte es va fer al KHLim a Diepenbeek. Es tractava de dissenyar un nou dispositiu de localització d'avaries del relè del motor, per tal de de substituir el que ja hi havia, per raons de seguretat

Intelligent PCA contribution analysis for quality estimation in batch processes. Application in a sequencing batch reactor for wastewater treatment

En aquest treball, es proposa un nou mètode per estimar en temps real la qualitat del producte final en processos per lot. Aquest mètode permet reduir el temps necessari per obtenir els resultats de qualitat de les anàlisi de laboratori. S'utiliza un model de anàlisi de componentes principals (PCA) construït amb dades històriques en condicions normals de funcionament per discernir si un lot finalizat és normal o no. Es calcula una signatura de falla pels lots anormals i es passa a través d'un model de classificació per la seva estimació. L'estudi proposa un mètode per utilitzar la informació de les gràfiques de contribució basat en les signatures de falla, on els indicadors representen el comportament de les variables al llarg del procés en les diferentes etapes. Un conjunt de dades compost per la signatura de falla dels lots anormals històrics es construeix per cercar els patrons i entrenar els models de classifcació per estimar els resultas dels lots futurs. La metodologia proposada s'ha aplicat a un reactor seqüencial per lots (SBR). Diversos algoritmes de classificació es proven per demostrar les possibilitats de la metodologia proposada.

Comparison of topography- and aperture-dependent motion compensation algorithms for airborne SAR

This letter presents a comparison between threeFourier-based motion compensation (MoCo) algorithms forairborne synthetic aperture radar (SAR) systems. These algorithmscircumvent the limitations of conventional MoCo, namelythe assumption of a reference height and the beam-center approximation.All these approaches rely on the inherent time–frequencyrelation in SAR systems but exploit it differently, with the consequentdifferences in accuracy and computational burden. Aftera brief overview of the three approaches, the performance ofeach algorithm is analyzed with respect to azimuthal topographyaccommodation, angle accommodation, and maximum frequencyof track deviations with which the algorithm can cope. Also, ananalysis on the computational complexity is presented. Quantitativeresults are shown using real data acquired by the ExperimentalSAR system of the German Aerospace Center (DLR).

Chromosomal divergence and evolutionary inferences in Rhodniini based on the chromosomal location of ribosomal genes

In this study, we used fluorescence in situ hybridisation to determine the chromosomal location of 45S rDNA clusters in 10 species of the tribe Rhodniini (Hemiptera: Reduviidae: Triatominae). The results showed striking inter and intraspecific variability, with the location of the rDNA clusters restricted to sex chromosomes with two patterns: either on one (X chromosome) or both sex chromosomes (X and Y chromosomes). This variation occurs within a genus that has an unchanging diploid chromosome number (2n = 22, including 20 autosomes and 2 sex chromosomes) and a similar chromosome size and genomic DNA content, reflecting a genome dynamic not revealed by these chromosome traits. The rDNA variation in closely related species and the intraspecific polymorphism in Rhodnius ecuadoriensis suggested that the chromosomal position of rDNA clusters might be a useful marker to identify recently diverged species or populations. We discuss the ancestral position of ribosomal genes in the tribe Rhodniini and the possible mechanisms involved in the variation of the rDNA clusters, including the loss of rDNA loci on the Y chromosome, transposition and ectopic pairing. The last two processes involve chromosomal exchanges between both sex chromosomes, in contrast to the widely accepted idea that the achiasmatic sex chromosomes of Heteroptera do not interchange sequences.

Route optimization and customization using real geographical data in Android mobile devices

Nowadays, there are several services and applications that allow users to locate and move to different tourist areas using a mobile device. These systems can be used either by internet or downloading an application in concrete places like a visitors centre. Although such applications are able to facilitate the location and the search for points of interest, in most cases, these services and applications do not meet the needs of each user. This paper aims to provide a solution by studying the main projects, services and applications, their routing algorithms and their treatment of the real geographical data in Android mobile devices, focusing on the data acquisition and treatment to improve the routing searches in off-line environments.

Using free data mining software and clustering algorithms to find predictors from student qualifications

In this project a research both in finding predictors via clustering techniques and in reviewing the Data Mining free software is achieved. The research is based in a case of study, from where additionally to the KDD free software used by the scientific community; a new free tool for pre-processing the data is presented. The predictors are intended for the e-learning domain as the data from where these predictors have to be inferred are student qualifications from different e-learning environments. Through our case of study not only clustering algorithms are tested but also additional goals are proposed.

Mapping complex tissue architecture with diffusion spectrum magnetic resonance imaging.

Methods are presented to map complex fiber architectures in tissues by imaging the 3D spectra of tissue water diffusion with MR. First, theoretical considerations show why and under what conditions diffusion contrast is positive. Using this result, spin displacement spectra that are conventionally phase-encoded can be accurately reconstructed by a Fourier transform of the measured signal's modulus. Second, studies of in vitro and in vivo samples demonstrate correspondence between the orientational maxima of the diffusion spectrum and those of the fiber orientation density at each location. In specimens with complex muscular tissue, such as the tongue, diffusion spectrum images show characteristic local heterogeneities of fiber architectures, including angular dispersion and intersection. Cerebral diffusion spectra acquired in normal human subjects resolve known white matter tracts and tract intersections. Finally, the relation between the presented model-free imaging technique and other available diffusion MRI schemes is discussed.

Clustering algorithms for anti-money laundering using graph theory and social network analysis

HEMOLIA (a project under European community’s 7th framework programme) is a new generation Anti-Money Laundering (AML) intelligent multi-agent alert and investigation system which in addition to the traditional financial data makes extensive use of modern society’s huge telecom data source, thereby opening up a new dimension of capabilities to all Money Laundering fighters (FIUs, LEAs) and Financial Institutes (Banks, Insurance Companies, etc.). This Master-Thesis project is done at AIA, one of the partners for the HEMOLIA project in Barcelona. The objective of this thesis is to find the clusters in a network drawn by using the financial data. An extensive literature survey has been carried out and several standard algorithms related to networks have been studied and implemented. The clustering problem is a NP-hard problem and several algorithms like K-Means and Hierarchical clustering are being implemented for studying several problems relating to sociology, evolution, anthropology etc. However, these algorithms have certain drawbacks which make them very difficult to implement. The thesis suggests (a) a possible improvement to the K-Means algorithm, (b) a novel approach to the clustering problem using the Genetic Algorithms and (c) a new algorithm for finding the cluster of a node using the Genetic Algorithm.

Effect of length and location of heterologous sequences on RecA-mediated strand exchange.

We systematically investigated the effect of heterology on RecA-mediated strand exchange between double-stranded linear and single-stranded circular DNA. Strand exchange took place through heterologies of up to 150-200 base pairs when the insertion was at the proximal (initiating) end of the duplex DNA but was completely blocked by an insert of only 22 base pairs placed at the distal end of the duplex. In the case of medial heterology created by insertion either in the duplex or the single-stranded DNA, the ability of RecA to exchange strands decreased as the heterology was shifted toward the distal end of the duplex. These results suggest that two different strand exchange mechanisms operate in the proximal and distal portions of the duplex substrate.

Multicast algorithms evaluation using an adaptative routing in ATM networks

This paper proposes a multicast implementation based on adaptive routing with anticipated calculation. Three different cost measures for a point-to-multipoint connection: bandwidth cost, connection establishment cost and switching cost can be considered. The application of the method based on pre-evaluated routing tables makes possible the reduction of bandwidth cost and connection establishment cost individually