916 resultados para Conditional Directed Graph


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a new programming methodology for introducing and tuning parallelism in Erlang programs, using source-level code refactoring from sequential source programs to parallel programs written using our skeleton library, Skel. High-level cost models allow us to predict with reasonable accuracy the parallel performance of the refactored program, enabling programmers to make informed decisions about which refactorings to apply. Using our approach, we demonstrate easily obtainable, significant and scalable speedups of up to 21 on a 24-core machine over the sequential code.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

OBJECTIVE: To understand patients' preferences for physician behaviours during end-of-life communication.

METHODS: We used interpretive description methods to analyse data from semistructured, one-on-one interviews with patients admitted to general medical wards at three Canadian tertiary care hospitals. Study recruitment took place from October 2012 to August 2013. We used a purposive, maximum variation sampling approach to recruit hospitalised patients aged ≥55 years with a high risk of mortality within 6-12 months, and with different combinations of the following demographic variables: race (Caucasian vs non-Caucasian), gender and diagnosis (cancer vs non-cancer).

RESULTS: A total of 16 participants were recruited, most of whom (69%) were women and 70% had a non-cancer diagnosis. Two major concepts regarding helpful physician behaviour during end-of-life conversations emerged: (1) 'knowing me', which reflects the importance of acknowledging the influence of family roles and life history on values and priorities expressed during end-of-life communication, and (2) 'conditional candour', which describes a process of information exchange that includes an assessment of patients' readiness, being invited to the conversation, and sensitive delivery of information.

CONCLUSIONS: Our findings suggest that patients prefer a nuanced approach to truth telling when having end-of-life discussions with their physician. This may have important implications for clinical practice and end-of-life communication training initiatives.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Real-world graphs or networks tend to exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Much effort has been directed into creating realistic and tractable models for unlabelled graphs, which has yielded insights into graph structure and evolution. Recently, attention has moved to creating models for labelled graphs: many real-world graphs are labelled with both discrete and numeric attributes. In this paper, we presentAgwan (Attribute Graphs: Weighted and Numeric), a generative model for random graphs with discrete labels and weighted edges. The model is easily generalised to edges labelled with an arbitrary number of numeric attributes. We include algorithms for fitting the parameters of the Agwanmodel to real-world graphs and for generating random graphs from the model. Using real-world directed and undirected graphs as input, we compare our approach to state-of-the-art random labelled graph generators and draw conclusions about the contribution of discrete vertex labels and edge weights to graph structure.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A highly regioselective allylic substitution of β-silyl allylic alcohols has been achieved that provides the branched isomer as a single product. This high level of regiocontrol is achieved through the use of a vinyl silane group that can perform a Hiyama coupling providing 1,3-disubstituted allylic amines. An unusual oxidative fragmentation product was also observed at elevated temperature that appears to proceed by a Fleming–Tamao-type oxidation–elimination pathway.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A rhenium-catalyzed N-selective allylic amination reaction of N-hydroxycarbamates has been developed. This reaction occurs with excellent N/O selectivity and with complete carbon selectivity on the allylic system. The reaction is tolerant of many functional groups and also proceeds with N-hydroxysulfonamides and hydroxamic acids.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A credal network associates a directed acyclic graph with a collection of sets of probability measures; it offers a compact representation for sets of multivariate distributions. In this paper we present a new algorithm for inference in credal networks based on an integer programming reformulation. We are concerned with computation of lower/upper probabilities for a variable in a given credal network. Experiments reported in this paper indicate that this new algorithm has better performance than existing ones for some important classes of networks.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we propose a graph stream clustering algorithm with a unied similarity measure on both structural and attribute properties of vertices, with each attribute being treated as a vertex. Unlike others, our approach does not require an input parameter for the number of clusters, instead, it dynamically creates new sketch-based clusters and periodically merges existing similar clusters. Experiments on two publicly available datasets reveal the advantages of our approach in detecting vertex clusters in the graph stream. We provide a detailed investigation into how parameters affect the algorithm performance. We also provide a quantitative evaluation and comparison with a well-known offline community detection algorithm which shows that our streaming algorithm can achieve comparable or better average cluster purity.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Critical nodes—or “middlemen”—have an essential place in both social and economic networks when considering the flow of information and trade. This paper extends the concept of critical nodes to directed networks and in doing so identify strong and weak middlemen.
Node contestability is introduced as a form of competition in networks; a duality between uncontested intermediaries and middlemen is established. The brokerage power of middlemen is formally expressed and a general algorithm is constructed to measure the brokerage power of each node from the networks adjacency matrix. Augmentations of the brokerage power measure are discussed to encapsulate relevant centrality measures. Furthermore, we extend these notions and provide measures of the competitiveness of a network.
We use these concepts to identify and measure middlemen in two empirical socio-economic networks, the elite marriage network of Renaissance Florence and Krackhardt’s advice net- work.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Despite the advances in prostate cancer diagnosis and treatment, current therapies are not curative in a significant proportion of patients. Gene-directed enzyme prodrug therapy (GDEPT), when combined with radiation therapy, could improve the outcome of treatment for prostate cancer, the second leading cause of cancer death in the western world. GDEPT involves the introduction of a therapeutic transgene, which can be targeted to the tumour cells. A prodrug is administered systemically and is converted to its toxic form only in those cells containing the transgene, resulting in cell kill. This review will discuss the clinical trials which have investigated the potential of GDEPT at various stages of prostate cancer progression. The advantages of using GDEPT in combination with radiotherapy will be examined, as well as some of the recent advances which enhance the potential utility of GDEPT.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The number of elderly patients requiring hospitalisation in Europe is rising. With a greater proportion of elderly people in the population comes a greater demand for health services and, in particular, hospital care. Thus, with a growing number of elderly patients requiring hospitalisation competing with non-elderly patients for a fixed (and in some cases, decreasing) number of hospital beds, this results in much longer waiting times for patients, often with a less satisfactory hospital experience. However, if a better understanding of the recurring nature of elderly patient movements between the community and hospital can be developed, then it may be possible for alternative provisions of care in the community to be put in place and thus prevent readmission to hospital. The research in this paper aims to model the multiple patient transitions between hospital and community by utilising a mixture of conditional Coxian phase-type distributions that incorporates Bayes' theorem. For the purpose of demonstration, the results of a simulation study are presented and the model is applied to hospital readmission data from the Lombardy region of Italy.