Quasi-perfect state transfer in a bosonic dissipative network

In this paper we propose a scheme for quasi-perfect state transfer in a network of dissipative harmonic oscillators. We consider ideal sender and receiver oscillators connected by a chain of nonideal transmitter oscillators coupled by nearest-neighbour resonances. From the algebraic properties of the dynamical quantities describing the evolution of the network state, we derive a criterion, fixing the coupling strengths between all the oscillators, apart from their natural frequencies, enabling perfect state transfer in the particular case of ideal transmitter oscillators. Our criterion provides an easily manipulated formula enabling perfect state transfer in the special case where the network nonidealities are disregarded. We also extend such a criterion to dissipative networks where the fidelity of the transferred state decreases due to the loss mechanisms. To circumvent almost completely the adverse effect of decoherence, we propose a protocol to achieve quasi-perfect state transfer in nonideal networks. By adjusting the common frequency of the sender and the receiver oscillators to be out of resonance with that of the transmitters, we demonstrate that the sender`s state tunnels to the receiver oscillator by virtually exciting the nonideal transmitter chain. This virtual process makes negligible the decay rate associated with the transmitter line at the expense of delaying the time interval for the state transfer process. Apart from our analytical results, numerical computations are presented to illustrate our protocol.

Firm relocation and firm profits : Evidence from the Swedish wholesale trade sector

This study analyses the effects of firm relocation on firm profits, using longitudinal data on Swedish limtied liability firms and employing a difference-in-differnce propensity score method in the empirical analysis. Using propensity score matching, the pre-relocalization differneces between relocating and non-relocating firms are balanced. In addition to that, a difference-in-difference estimator is employed in order to control for all time-invariant unobserved heterogeneity among firms. For matching, nearest neighbour matching, using the one-, two- and three nearest neighbours is employed. The balanacing results indicate that matching achieves a good balance, and that similar relocating and non-relocating firms are being compared. The estimated average treatment on the treatment effects indicate thats relocations has a significant effect on the profits of the relocating firms. In other words, firms taht relocate increase their profits significantly, in comparison to what the profits would be had the firms not relocated. This effect is estimated to vary between 3 to 11 percentage points, depending on the lenght of the analysed period after relocation. 

Predictive models for chronic renal disease using decision trees, naïve bayes and case-based methods

Data mining can be used in healthcare industry to “mine” clinical data to discover hidden information for intelligent and affective decision making. Discovery of hidden patterns and relationships often goes intact, yet advanced data mining techniques can be helpful as remedy to this scenario. This thesis mainly deals with Intelligent Prediction of Chronic Renal Disease (IPCRD). Data covers blood, urine test, and external symptoms applied to predict chronic renal disease. Data from the database is initially transformed to Weka (3.6) and Chi-Square method is used for features section. After normalizing data, three classifiers were applied and efficiency of output is evaluated. Mainly, three classifiers are analyzed: Decision Tree, Naïve Bayes, K-Nearest Neighbour algorithm. Results show that each technique has its unique strength in realizing the objectives of the defined mining goals. Efficiency of Decision Tree and KNN was almost same but Naïve Bayes proved a comparative edge over others. Further sensitivity and specificity tests are used as statistical measures to examine the performance of a binary classification. Sensitivity (also called recall rate in some fields) measures the proportion of actual positives which are correctly identified while Specificity measures the proportion of negatives which are correctly identified. CRISP-DM methodology is applied to build the mining models. It consists of six major phases: business understanding, data understanding, data preparation, modeling, evaluation, and deployment.

Phenology, sex ratio, and spatial distribution among dioecious species of Trichilia (Meliaceae)

The flowering, sex ratio, and spatial distribution of four dioecious species of Trichilia (Meliaceae) were studied in a semi-deciduous forest in southeastern Brazil. All reproductive trees (T. clausseni, T. pallida and T. catigua) with dbh greater than or equal to5 cm within a 1-ha plot were collected, sexed, mapped and, for individuals of each species, the distances to the nearest neighbour of the same and opposite sex were measured. For the shrub species T elegans (dbh <5 cm), all reproductive individuals were sampled randomly in 10 samples of 10 x 10 m. The reproductive phenology was observed at weekly to monthly intervals from May 1988 to January 1990. The species are strictly dioecious, did not present any sex-mixed trees or sex switching during the study, and sex ratio did not differ significantly from 1:1. The size distributions and the relative size variation were not significantly different. between sexes. There was no significant segregation or clumping between individuals of either sex and no fruit production without pollination. Onset of flowering and flowering peak were synchronous between male and female plants for all species studied. Flower synchrony was related to outcrossing and pollinator attraction rather than climatic factors.

Nest location, clutch size and nest success in the Scarlet Ibis Eudocimus ruber

Breeding success and nest-site characteristics were studied during the 1996-1997 breeding season in a colony of Scarlet Ibises Eudocimus ruber in south-eastern Brazil to test the hypothesis that nest-site characteristics and clutch size affect nest success. Two nesting pulses produced young, the earlier being more successful. Predation accounted for most failures during the first pulse, wind destruction during the second. A third pulse with few nests produced no young. Adult Ibises abandoned nests when they lost sight of other incubating birds. Logistic regression analysis indicated that nest success during the first pulse was positively related to clutch size, number of nests in the nest tree and in the nearest tree, and negatively to the distance to the nearest neighbour. During the second pulse there were significant negative associations between success, nest height and distance to the fourth nearest nest, and a positive association between success and nest cover. The results agree with the 'selfish herd' hypothesis, indicating that nest aggregation may increase breeding success, but the nest-site characteristics affecting success can differ over the course of one breeding season.

Simulation of free surface flows in a distributed memory environment

A parallel technique, for a distributed memory machine, based on domain decomposition for solving the Navier-Stokes equations in cartesian and cylindrical coordinates in two dimensions with free surfaces is described. It is based on the code by Tome and McKee (J. Comp. Phys. 110 (1994) 171-186) and Tome (Ph.D. Thesis, University of Strathclyde, Glasgow, 1993) which in turn is based on the SMAC method by Amsden and Harlow (Report LA-4370, Los Alamos Scientific Laboratory, 1971), which solves the Navier-Stokes equations in three steps: the momentum and Poisson equations and particle movement, These equations are discretized by explicit and 5-point finite differences. The parallelization is performed by splitting the computation domain into vertical panels and assigning each of these panels to a processor. All the computation can then be performed using nearest neighbour communication. Test runs comparing the performance of the parallel with the serial code, and a discussion of the load balancing question are presented. PVM is used for communication between processes. (C) 1999 Elsevier B.V. B.V. All rights reserved.

Kernel Methods for Tree Structured Data

Machine learning comprises a series of techniques for automatic extraction of meaningful information from large collections of noisy data. In many real world applications, data is naturally represented in structured form. Since traditional methods in machine learning deal with vectorial information, they require an a priori form of preprocessing. Among all the learning techniques for dealing with structured data, kernel methods are recognized to have a strong theoretical background and to be effective approaches. They do not require an explicit vectorial representation of the data in terms of features, but rely on a measure of similarity between any pair of objects of a domain, the kernel function. Designing fast and good kernel functions is a challenging problem. In the case of tree structured data two issues become relevant: kernel for trees should not be sparse and should be fast to compute. The sparsity problem arises when, given a dataset and a kernel function, most structures of the dataset are completely dissimilar to one another. In those cases the classifier has too few information for making correct predictions on unseen data. In fact, it tends to produce a discriminating function behaving as the nearest neighbour rule. Sparsity is likely to arise for some standard tree kernel functions, such as the subtree and subset tree kernel, when they are applied to datasets with node labels belonging to a large domain. A second drawback of using tree kernels is the time complexity required both in learning and classification phases. Such a complexity can sometimes prevents the kernel application in scenarios involving large amount of data. This thesis proposes three contributions for resolving the above issues of kernel for trees. A first contribution aims at creating kernel functions which adapt to the statistical properties of the dataset, thus reducing its sparsity with respect to traditional tree kernel functions. Specifically, we propose to encode the input trees by an algorithm able to project the data onto a lower dimensional space with the property that similar structures are mapped similarly. By building kernel functions on the lower dimensional representation, we are able to perform inexact matchings between different inputs in the original space. A second contribution is the proposal of a novel kernel function based on the convolution kernel framework. Convolution kernel measures the similarity of two objects in terms of the similarities of their subparts. Most convolution kernels are based on counting the number of shared substructures, partially discarding information about their position in the original structure. The kernel function we propose is, instead, especially focused on this aspect. A third contribution is devoted at reducing the computational burden related to the calculation of a kernel function between a tree and a forest of trees, which is a typical operation in the classification phase and, for some algorithms, also in the learning phase. We propose a general methodology applicable to convolution kernels. Moreover, we show an instantiation of our technique when kernels such as the subtree and subset tree kernels are employed. In those cases, Direct Acyclic Graphs can be used to compactly represent shared substructures in different trees, thus reducing the computational burden and storage requirements.

Efficient subsequence alignment of time series

Zeitreihen sind allgegenwärtig. Die Erfassung und Verarbeitung kontinuierlich gemessener Daten ist in allen Bereichen der Naturwissenschaften, Medizin und Finanzwelt vertreten. Das enorme Anwachsen aufgezeichneter Datenmengen, sei es durch automatisierte Monitoring-Systeme oder integrierte Sensoren, bedarf außerordentlich schneller Algorithmen in Theorie und Praxis. Infolgedessen beschäftigt sich diese Arbeit mit der effizienten Berechnung von Teilsequenzalignments. Komplexe Algorithmen wie z.B. Anomaliedetektion, Motivfabfrage oder die unüberwachte Extraktion von prototypischen Bausteinen in Zeitreihen machen exzessiven Gebrauch von diesen Alignments. Darin begründet sich der Bedarf nach schnellen Implementierungen. Diese Arbeit untergliedert sich in drei Ansätze, die sich dieser Herausforderung widmen. Das umfasst vier Alignierungsalgorithmen und ihre Parallelisierung auf CUDA-fähiger Hardware, einen Algorithmus zur Segmentierung von Datenströmen und eine einheitliche Behandlung von Liegruppen-wertigen Zeitreihen.rnrnDer erste Beitrag ist eine vollständige CUDA-Portierung der UCR-Suite, die weltführende Implementierung von Teilsequenzalignierung. Das umfasst ein neues Berechnungsschema zur Ermittlung lokaler Alignierungsgüten unter Verwendung z-normierten euklidischen Abstands, welches auf jeder parallelen Hardware mit Unterstützung für schnelle Fouriertransformation einsetzbar ist. Des Weiteren geben wir eine SIMT-verträgliche Umsetzung der Lower-Bound-Kaskade der UCR-Suite zur effizienten Berechnung lokaler Alignierungsgüten unter Dynamic Time Warping an. Beide CUDA-Implementierungen ermöglichen eine um ein bis zwei Größenordnungen schnellere Berechnung als etablierte Methoden.rnrnAls zweites untersuchen wir zwei Linearzeit-Approximierungen für das elastische Alignment von Teilsequenzen. Auf der einen Seite behandeln wir ein SIMT-verträgliches Relaxierungschema für Greedy DTW und seine effiziente CUDA-Parallelisierung. Auf der anderen Seite führen wir ein neues lokales Abstandsmaß ein, den Gliding Elastic Match (GEM), welches mit der gleichen asymptotischen Zeitkomplexität wie Greedy DTW berechnet werden kann, jedoch eine vollständige Relaxierung der Penalty-Matrix bietet. Weitere Verbesserungen umfassen Invarianz gegen Trends auf der Messachse und uniforme Skalierung auf der Zeitachse. Des Weiteren wird eine Erweiterung von GEM zur Multi-Shape-Segmentierung diskutiert und auf Bewegungsdaten evaluiert. Beide CUDA-Parallelisierung verzeichnen Laufzeitverbesserungen um bis zu zwei Größenordnungen.rnrnDie Behandlung von Zeitreihen beschränkt sich in der Literatur in der Regel auf reellwertige Messdaten. Der dritte Beitrag umfasst eine einheitliche Methode zur Behandlung von Liegruppen-wertigen Zeitreihen. Darauf aufbauend werden Distanzmaße auf der Rotationsgruppe SO(3) und auf der euklidischen Gruppe SE(3) behandelt. Des Weiteren werden speichereffiziente Darstellungen und gruppenkompatible Erweiterungen elastischer Maße diskutiert.

Scarring Effects of Early Unemployment among Young Workers with Vocational Credentials in Switzerland

Background Using a unique, longitudinal survey that follows school-to-work transitions of pupils who participated in PISA 2000, this paper investigates adverse consequences, so-called scarring effects, of early unemployment among young adults who acquired vocational credentials in Switzerland. Methods As social, individual and contextual factors influence both early unemployment and later employment outcomes, taking into account endogeneity is of utmost importance when investigating scarring effects. In this regard we make use of nearest-neighbour propensity score matching and set up statistical control groups. Results Our results suggest that young adults who hold vocational credentials are more likely to be neither in employment nor in education, and to earn less and be more dissatisfied with their career progress later in work life than they would be, had they not experienced early unemployment. Conclusions We conclude that unemployment scarring also affects young adults with vocational credentials in a liberal labour market setting that otherwise allows for smooth school-to-work transitions. This finding runs counter to expectations that standardised vocational degrees, a liberal and flexible labour market structure, and predominantly short unemployment spells protect young skilled workers from scarring in case they happen to experience early career instability.

Movilidad social de ingresos

Este trabajo procura aportar una dimensión adicional al análisis de la evolución del bienestar de una sociedad basado en la dinámica de ingresos, mediante la metodología "The Nearest Neighbour Matching". El objetivo no es sólo considerar el ranking o dispersión de ingresos en un momento determinado, sino también abordar su evolución. Particularmente, consiste en determinar cómo los individuos se "mueven" en el Gran Mendoza durante los años 2003 y 2013.

Aprubt climate change events in the Northeastern Atlantic Ocean

The western Iberian margin has been one of the key locations to study abrupt glacial climate change and associated interhemispheric linkages. The regional variability in the response to those events is being studied by combining a multitude of published and new records. Looking at the trend from Marine Isotope Stage (MIS) 10 to 2, the planktic foraminifer data, conform with the alkenone record of Martrat et al. [2007], shows that abrupt climate change events, especially the Heinrich events, became more frequent and their impacts in general stronger during the last glacial cycle. However, there were two older periods with strong impacts on the Atlantic meridional overturning circulation (AMOC): the Heinrich-type event associated with Termination (T) IV and the one occurring during MIS 8 (269 to 265 ka). During the Heinrich stadials of the last glacial cycle, the polar front reached the northern Iberian margin (ca. 41°N), while the arctic front was located in the vicinity of 39°N. During all the glacial periods studied, there existed a boundary at the latter latitude, either the arctic front during extreme cold events or the subarctic front during less strong coolings or warmer glacials. Along with these fronts sea surface temperatures (SST) increased southward by about 1°C per one degree of latitude leading to steep temperature gradients in the eastern North Atlantic and pointing to a close vicinity between subpolar and subtropical waters. The southern Iberian margin was always bathed by subtropical water masses - surface and/ or subsurface ones -, but there were periods when these waters also penetrated northward to 40.6°N. Glacial hydrographic conditions were similar during MIS 2 and 4, but much different during MIS 6. MIS 6 was a warmer glacial with the polar front being located further to the north allowing the subtropical surface and subsurface waters to reach at minimum as far north as 40.6°N and resulting in relative stable conditions on the southern margin. In the vertical structure, the Greenland-type climate oscillations during the last glacial cycle were recorded down to 2465 m during the Heinrich stadials, i.e. slightly deeper than in the western basin. This deeper boundary is related to the admixing of Mediterranean Outflow Water, which also explains the better ventilation of the intermediate-depth water column on the Iberian margin. This compilation revealed that latitudinal, longitudinal and vertical gradients existed in the waters along the Iberian margin, i.e. in a relative restricted area, but sufficient paleo-data exists now to validate regional climate models for abrupt climate change events in the northeastern North Atlantic Ocean.

Juvenile–adult tree associations in a continental Mediterranean ecosystem: no evidence for sustained and general facilitation at increased aridity

Question: How do tree species identity, microhabitat and water availability affect inter- and intra-specific interactions between juvenile and adult woody plants? Location: Continental Mediterranean forests in Alto Tajo Natural Park, Guadalajara, Spain. Methods: A total of 2066 juveniles and adults of four co-occurring tree species were mapped in 17 plots. The frequency of juveniles at different microhabitats and water availability levels was analysed using log-linear models. We used nearest-neighbour contingency table analysis of spatial segregation and J-functions to describe the spatial patterns. Results: We found a complex spatial pattern that varied according to species identity and microhabitat. Recruitment was more frequent in gaps for Quercus ilex, while the other three species recruited preferentially under shrubs or trees depending on the water availability level. Juveniles were not spatially associated to conspecific adults, experiencing segregation from them inmany cases. Spatial associations, both positive and negative, were more common at higher water availability levels. Conclusions: Our results do not agree with expectations from the stressgradient hypothesis, suggesting that positive interactions do not increase in importance with increasing aridity in the study ecosystem. Regeneration patterns are species-specific and depend on microhabitat characteristics and dispersal strategies. In general, juveniles do not look for conspecific adult protection. This work contributes to the understanding of species co-existence, proving the importance of considering a multispecies approach at several plots to overcome limitations of simple pair-wise comparisons in a limited number of sites.

A comparative study on unconstrained hand biometrics

Biometrics applied to mobile devices are of great interest for security applications. Daily scenarios can benefit of a combination of both the most secure systems and most simple and extended devices. This document presents a hand biometric system oriented to mobile devices, proposing a non-intrusive, contact-less acquisition process where final users should take a picture of their hand in free-space with a mobile device without removals of rings, bracelets or watches. The main contribution of this paper is threefold: firstly, a feature extraction method is proposed, providing invariant hand measurements to previous changes; second contribution consists of providing a template creation based on hand geometric distances, requiring information from only one individual, without considering data from the rest of individuals within the database; finally, a proposal for template matching is proposed, minimizing the intra-class similarity and maximizing the inter-class likeliness. The proposed method is evaluated using three publicly available contact-less, platform-free databases. In addition, the results obtained with these databases will be compared to the results provided by two competitive pattern recognition techniques, namely Support Vector Machines (SVM) and k-Nearest Neighbour, often employed within the literature. Therefore, this approach provides an appropriate solution to adapt hand biometrics to mobile devices, with an accurate results and a non-intrusive acquisition procedure which increases the overall acceptance from the final user.

Unconstrained and Contactless Hand Geometry Biometrics

This paper presents a hand biometric system for contact-less, platform-free scenarios, proposing innovative methods in feature extraction, template creation and template matching. The evaluation of the proposed method considers both the use of three contact-less publicly available hand databases, and the comparison of the performance to two competitive pattern recognition techniques existing in literature: namely Support Vector Machines (SVM) and k-Nearest Neighbour (k-NN). Results highlight the fact that the proposed method outcomes existing approaches in literature in terms of computational cost, accuracy in human identification, number of extracted features and number of samples for template creation. The proposed method is a suitable solution for human identification in contact-less scenarios based on hand biometrics, providing a feasible solution to devices with limited hardware requirements like mobile devices