958 resultados para Eguchi-hanson Metric
Resumo:
Across Europe, elevated phosphorus (P) concentrations in lowland rivers have made them particularly susceptible to eutrophication. This is compounded in southern and central UK by increasing pressures on water resources, which may be further enhanced by the potential effects of climate change. The EU Water Framework Directive requires an integrated approach to water resources management at the catchment scale and highlights the need for modelling tools that can distinguish relative contributions from multiple nutrient sources and are consistent with the information content of the available data. Two such models are introduced and evaluated within a stochastic framework using daily flow and total phosphorus concentrations recorded in a clay catchment typical of many areas of the lowland UK. Both models disaggregate empirical annual load estimates, derived from land use data, as a function of surface/near surface runoff, generated using a simple conceptual rainfall-runoff model. Estimates of the daily load from agricultural land, together with those from baseflow and point sources, feed into an in-stream routing algorithm. The first model assumes constant concentrations in runoff via surface/near surface pathways and incorporates an additional P store in the river-bed sediments, depleted above a critical discharge, to explicitly simulate resuspension. The second model, which is simpler, simulates P concentrations as a function of surface/near surface runoff, thus emphasising the influence of non-point source loads during flow peaks and mixing of baseflow and point sources during low flows. The temporal consistency of parameter estimates and thus the suitability of each approach is assessed dynamically following a new approach based on Monte-Carlo analysis. (c) 2004 Elsevier B.V. All rights reserved.
Resumo:
Empirical Mode Decomposition (EMD) is a data driven technique for extraction of oscillatory components from data. Although it has been introduced over 15 years ago, its mathematical foundations are still missing which also implies lack of objective metrics for decomposed set evaluation. Most common technique for assessing results of EMD is their visual inspection, which is very subjective. This article provides objective measures for assessing EMD results based on the original definition of oscillatory components.
Resumo:
Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
This paper presents a new technique and two algorithms to bulk-load data into multi-way dynamic metric access methods, based on the covering radius of representative elements employed to organize data in hierarchical data structures. The proposed algorithms are sample-based, and they always build a valid and height-balanced tree. We compare the proposed algorithm with existing ones, showing the behavior to bulk-load data into the Slim-tree metric access method. After having identified the worst case of our first algorithm, we describe adequate counteractions in an elegant way creating the second algorithm. Experiments performed to evaluate their performance show that our bulk-loading methods build trees faster than the sequential insertion method regarding construction time, and that it also significantly improves search performance. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme rays are metric inequalities. We also show how to strengthen Benders inequalities associated to non-extreme rays to obtain metric inequalities. We show that cutset inequalities are Benders inequalities, but not necessarily metric inequalities. We give a necessary and sufficient condition for a cutset inequality to be a metric inequality. Computational experiments show the effectiveness of strengthening Benders and cutset inequalities to obtain metric inequalities.
Resumo:
In this paper, we prove that if a Banach space X contains some uniformly convex subspace in certain geometric position, then the C(K, X) spaces of all X-valued continuous functions defined on the compact metric spaces K have exactly the same isomorphism classes that the C(K) spaces. This provides a vector-valued extension of classical results of Bessaga and Pelczynski (1960) [2] and Milutin (1966) [13] on the isomorphic classification of the separable C(K) spaces. As a consequence, we show that if 1 < p < q < infinity then for every infinite countable compact metric spaces K(1), K(2), K(3) and K(4) are equivalent: (a) C(K(1), l(p)) circle plus C(K(2), l(q)) is isomorphic to C(K(3), l(p)) circle plus (K(4), l(q)). (b) C(K(1)) is isomorphic to C(K(3)) and C(K(2)) is isomorphic to C(K(4)). (C) 2011 Elsevier Inc. All rights reserved.
Resumo:
We prove the semi-Riemannian bumpy metric theorem using equivariant variational genericity. The theorem states that, on a given compact manifold M, the set of semi-Riemannian metrics that admit only nondegenerate closed geodesics is generic relatively to the C(k)-topology, k=2, ..., infinity, in the set of metrics of a given index on M. A higher-order genericity Riemannian result of Klingenberg and Takens is extended to semi-Riemannian geometry.
Resumo:
In this paper, we show that the Wijsman hyperspace of a metric hereditarily Baire space is Baire. This solves a recent question posed by Zsilinszky. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
Book by Washington Post reporter reveals the secret circumstances surrounding the death of rising CIA star Elizabeth Hanson ’02.
Resumo:
Stroke is a neurological disorder caused by restriction of blood flow to the brain, which generates directly a deficit of functionality that affects the quality of life of patients. The aim of this study was to establish a short version of the Social Rhythm Scale (SRM), to assess the social rhythm of stroke patients. The sample consisted of 84 patients, of both sexes, with injury time exceeding 6 months. For seven days, patients recorded the time held 17 activities of SRM. Data analysis was performed using a principal components factor analysis with varimax rotation of the full version of SRM in order to determine which activities could compose brief versions of SRM. We then carried out a comparison of hits, the ALI (Level Activity Index) and SRM, between versions, by Kruskal-Walls and the Mann-Whitney test. The Spearman correlation test was used to evaluate the correlation between the score of the full version of SRM with short versions. It was found that the activities of SRM were distributed in three versions: the first and second with 6 activities and third with 3 activities. Regarding hits, it was found that they ranged from 4.9 to 5.8 on the first version; 2.3 to 3.8 in version 2 and 2.8 to 6.2 in version 3, the first the only version that did not show low values. The analysis of ALI, in version 1, the median was 29, in version 2 was 14 and in version 3 was 18. Significant difference in the values of ALI between versions 1 and 2, between 2 and 3 and between versions 1 and 3. The highest median was found in the first version, formed by activities: out of bed, first contact, drink coffee, watch TV in the evening and go to bed. The lowest median was observed in the second version and this was not what had fewer activities, but which had social activities. The medians of the SRM version 1 was 6, version 2 was 4 and version 3 was 6. Significant difference in the values of SRM between versions 1 and 2 and between 2 and 3, but no significant difference between versions 1 and 3. Through analysis, we found a significant correlation only between the full version and the version 1 (R2 = 0.61) (p <0.05), no correlation was found with version 2 (R2 = 0.007) nor with version 3 (R2 = 0.002), this was finally a factor to consider version 1 as the short brazilian version of the Social Rhythm Metric for stroke patients
Resumo:
The measurability of the non-minimal coupling is discussed by considering the correction to the Newtonian static potential in the semiclassical approach. The coefficient of the gravitational Darwin term (GDT) gets redefined by the non-minimal torsion scalar couplings. Based on a similar analysis of the GDT in the effective field theory approach to non-minimal scalar, we conclude that for reasonable values of the couplings the correction is very small.