48 resultados para bounded gaps


Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Kelp forests along temperate and polar coastlines represent some of most diverse and productive habitats on the Earth. Here, we synthesize information from >60 years of research on the structure and functioning of kelp forest habitats in European waters, with particular emphasis on the coasts of UK and Ireland, which represents an important biogeographic transition zone that is subjected to multiple threats and stressors. We collated existing data on kelp distribution and abundance and reanalyzed these data to describe the structure of kelp forests along a spatial gradient spanning more than 10° of latitude. We then examined ecological goods and services provided by kelp forests, including elevated secondary production, nutrient cycling, energy capture and flow, coastal defense, direct applications, and biodiversity repositories, before discussing current and future threats posed to kelp forests and identifying key knowledge gaps. Recent evidence unequivocally demonstrates that the structure of kelp forests in the NE Atlantic is changing in response to climate- and non-climate-related stressors, which will have major implications for the structure and functioning of coastal ecosystems. However, kelp-dominated habitats along much of the NE Atlantic coastline have been chronically understudied over recent decades in comparison with other regions such as Australasia and North America. The paucity of field-based research currently impedes our ability to conserve and manage these important ecosystems. Targeted observational and experimental research conducted over large spatial and temporal scales is urgently needed to address these knowledge gaps.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Graphene is used as the thinnest possible spacer between gold nanoparticles and a gold substrate. This creates a robust, repeatable, and stable subnanometer gap for massive plasmonic field enhancements. White light spectroscopy of single 80 nm gold nanoparticles reveals plasmonic coupling between the particle and its image within the gold substrate. While for a single graphene layer, spectral doublets from coupled dimer modes are observed shifted into the near-infrared, these disappear for increasing numbers of layers. These doublets arise from charger-transfer-sensitive gap plasmons, allowing optical measurement to access out-of-plane conductivity in such layered systems. Gating the graphene can thus directly produce plasmon tuning.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This work presents novel algorithms for learning Bayesian networks of bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed integer linear programming formulations for structure learning and treewidth computation. The approximate method consists in sampling k-trees (maximal graphs of treewidth k), and subsequently selecting, exactly or approximately, the best structure whose moral graph is a subgraph of that k-tree. The approaches are empirically compared to each other and to state-of-the-art methods on a collection of public data sets with up to 100 variables.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The two families of fluorescent PET (photoinduced electron transfer) sensors (1-9) show that the effective proton density near the surface of several micelle membranes changes over 2-3 orders of magnitude as the microlocation of the sensor (with respect to the membrane) is altered via hydrophobic tuning.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Learning Bayesian networks with bounded tree-width has attracted much attention recently, because low tree-width allows exact inference to be performed efficiently. Some existing methods [12, 14] tackle the problem by using k-trees to learn the optimal Bayesian network with tree-width up to k. In this paper, we propose a sampling method to efficiently find representative k-trees by introducing an Informative score function to characterize the quality of a k-tree. The proposed algorithm can efficiently learn a Bayesian network with tree-width at most k. Experiment results indicate that our approach is comparable with exact methods, but is much more computationally efficient.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

AIMS: Rheumatic heart disease (RHD) accounts for over a million premature deaths annually; however, there is little contemporary information on presentation, complications, and treatment.

METHODS AND RESULTS: This prospective registry enrolled 3343 patients (median age 28 years, 66.2% female) presenting with RHD at 25 hospitals in 12 African countries, India, and Yemen between January 2010 and November 2012. The majority (63.9%) had moderate-to-severe multivalvular disease complicated by congestive heart failure (33.4%), pulmonary hypertension (28.8%), atrial fibrillation (AF) (21.8%), stroke (7.1%), infective endocarditis (4%), and major bleeding (2.7%). One-quarter of adults and 5.3% of children had decreased left ventricular (LV) systolic function; 23% of adults and 14.1% of children had dilated LVs. Fifty-five percent (n = 1761) of patients were on secondary antibiotic prophylaxis. Oral anti-coagulants were prescribed in 69.5% (n = 946) of patients with mechanical valves (n = 501), AF (n = 397), and high-risk mitral stenosis in sinus rhythm (n = 48). However, only 28.3% (n = 269) had a therapeutic international normalized ratio. Among 1825 women of childbearing age (12-51 years), only 3.6% (n = 65) were on contraception. The utilization of valvuloplasty and valve surgery was higher in upper-middle compared with lower-income countries.

CONCLUSION: Rheumatic heart disease patients were young, predominantly female, and had high prevalence of major cardiovascular complications. There is suboptimal utilization of secondary antibiotic prophylaxis, oral anti-coagulation, and contraception, and variations in the use of percutaneous and surgical interventions by country income level.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Bounding the tree-width of a Bayesian network can reduce the chance of overfitting, and allows exact inference to be performed efficiently. Several existing algorithms tackle the problem of learning bounded tree-width Bayesian networks by learning from k-trees as super-structures, but they do not scale to large domains and/or large tree-width. We propose a guided search algorithm to find k-trees with maximum Informative scores, which is a measure of quality for the k-tree in yielding good Bayesian networks. The algorithm achieves close to optimal performance compared to exact solutions in small domains, and can discover better networks than existing approximate methods can in large domains. It also provides an optimal elimination order of variables that guarantees small complexity for later runs of exact inference. Comparisons with well-known approaches in terms of learning and inference accuracy illustrate its capabilities.