82 resultados para PL-AOV-Graph


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Coating anatase TiO2 onto three different particle supports, activated carbon (AC), gamma -alumina (Al2O3) and silica gel (SiO2), by chemical vapor deposition (CVD) was studied. The effect of the CVD synthesis conditions on the loading rate of anatase TiO2 was investigated. It was found that introducing water vapor during CVD or adsorbing water before CVD was crucial to obtain anatase TiO2 on the surface of the particle supports. The evaporation temperature of precursor, deposition temperature in the reactor, flow rate of carrier gas, and the length of coating time were also important parameters to obtain more uniform and repeatable TiO2 coating. High inflow precursor concentration, high CVD reactor temperature and long coating time tended to cause block problem. Coating TiO2 onto small particles by CVD involved both chemical vapor deposition and particle deposition. It was believed that the latter was the reason for the block problem. In addition, the mechanism of CVD process in this study included two parts, pyrolysis and hydrolysis, and one of them was dominant in the CVD process under different synthesis route. Among the three types of materials, silica gel, with higher surface hydroxyl groups and macropore surface area, was found to be the most efficient support in terms of both anatase TiO2 coating and photocatalytic reaction. (C) 2001 Elsevier Science B.V. All rights reserved.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cycle. Let n = p(2) for an odd prime p. We construct a family of (p-1)/2 non-isomorphic perfect 1-factorisations of K-n,K-n. Equivalently, we construct pan-Hamiltonian Latin squares of order n. A Latin square is pan-Hamiltoilian if the permutation defined by any row relative to any other row is a single Cycle. (C) 2002 Elsevier Science (USA).

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Objective: To determine 30 day mortality, long term survival, and recurrent cardiac events after coronary artery bypass graft (CABG) in a population. Design: Follow up study of patients prospectively entered on to a cardiothoracic surgical database. Record linkages were used to obtain data on readmissions and deaths. Patients: 8910 patients undergoing isolated first CABG between 1980 and 1993 in Western Australia. Main outcome measures: 30 day and long term survival, readmission for cardiac event (acute myocardial infarction, unstable angina, percutaneous transluminal coronary angioplasty or reoperative CABG). Results: There were 3072 deaths to mid 1999. 30 day and long term survival were significantly better in patients treated in the first five years than during the following decade. The age of the patients, proportion of female patients, and number of grafts increased over time. An urgent procedure (odds ratio 3.3), older age (9% per year) and female sex (odds ratio 1.5) were associated with increased risk for 30 day mortality, while age (7% per year) and a recent myocardial infarction (odds ratio 1.16) influenced long term survival. Internal mammary artery grafts were followed by better short and long term survival, though there was an obvious selection bias in favour of younger male patients. Conclusions: This study shows worsening crude mortality at 30 days after CABG from the mid 1980s, associated with the inclusion of higher risk patients. Older age, an acute myocardial infarction in the year before surgery, and the use of sephenous vein grafts only were associated with poorer long term survival and greater risk of a recurrent cardiac event. Female sex predicted recurrent events but not long term survival.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgraph of K with the property that for any edge e is an element of E(K)\E(G), G boolean OR {e} is not H-free. We present some general results on K-s,K-t-saturated subgraphs of the complete bipartite graph K-m,K-n and study the problem of finding, for all possible values of q, a C-4-saturated subgraph of K., having precisely q edges. (C) 2002 Elsevier Science B.V. All rights reserved.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Background There are few population-based data on long-term management of patients after coronary artery bypass graft (CABG), despite the high risk for future major vascular events among this group. We assessed the prevalence and correlates of pharmacotherapy for prevention of new cardiac events in a large population-based series. Methods A postal survey was conducted of 2500 randomly selected survivors from a state population of patients 6 to 20 years after first CABG. Results Response was 82% (n = 2061). Use of antiplatelet agents (80%) and statins (64%) declined as age increased. Other independent predictors of antiplatelet use included statin use (odds ratio [OR] 1.6, 95% CI 1.26-2.05) and recurrent angina (OR 1.6, CI 1.17-2.06). Current smokers were less likely to use aspirin (OR 0.59, CI 0.4-0.89). Statin use was associated with reported high cholesterol (OR 24.4, CI 8.4-32.4), management by a cardiologist (OR 2.3, CI 1.8-3.0), and the use of calcium channel-blockers. Patients reporting hypertension or heart failure, in addition to high cholesterol, were less likely to use statins. Angiotensin-converting enzyme inhibitors were the most commonly prescribed agents for management of hypertension (59%) and were more frequently used among patients with diabetes and those with symptoms of heart failure. Overall 42% of patients were on angiotensin-converting enzyme inhibitors and 36% on beta-blockers. Conclusions Gaps exist in the use of-recommended medications after CABG. Lower anti-platelet and statin use was associated with older age, freedom from angina, comorbid heart failure or hypertension, and not regularly visiting a cardiologist. Patients who continue to smoke might be less likely to adhere to prescribed medications.

Relevância:

10.00% 10.00%

Publicador:

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A K-4 - e trade consists of two disjoint decompositions of some simple graph H into copies of K-4 - e. The number of vertices of H is referred to as the foundation of the trade, while the number of copies of K-4 - e in each of the decompositions is called the volume of the trade. We determine the values of v and s for which there exists a K-4 - e trade of volume s and foundation v.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the one with minimum constants. Members of the family generate a hash function in two steps. First a special kind of function into an r-graph is computed probabilistically. Then this function is refined deterministically to a minimal perfect hash function. We give strong theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The spectrum problem for the decomposition of K-n into copies of the graph K_{m+2}\K_m is solved for n = 0 or 1 (mod 2m + 1). (C) 1997 John Wiley & Sons, Inc.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Background. A sample of 1089 Australian adults was selected for the longitudinal component of the Quake Impact Study, a 2-year, four-phase investigation of the psychosocial effects of the 1989 Newcastle earthquake. Of these, 845 (78%) completed a survey 6 months post-disaster as well as one or more of the three follow-up surveys. Methods. The phase I survey was used to construct dimensional indices of self-reported exposure to threat the disruption and also to classify subjects by their membership of five 'at risk' groups (the injured; the displaced; owners of damaged small businesses; helpers in threat and non-threat situations). Psychological morbidity was assessed at each phase using the 12-item General Health Questionnaire (GHQ-12) and the Impact of Event Scale (IES). Results. Psychological morbidity declined over time but tended to stabilize at about 12 months post-disaster for general morbidity (GHQ-12) and at about 18 months for trauma-related (IES) morbidity. Initial exposure to threat and/or disruption were significant predictors of psychological morbidity throughout the study and had superior predictive power to membership of the targeted 'at risk' groups. The degree of ongoing disruption and other life events since the earthquake were also significant predictors of morbidity. The injured reported the highest levels of distress, but there was a relative absence of morbidity among the helpers. Conclusions. Future disaster research should carefully assess the threat and disruption experiences of the survivors at the time of the event and monitor ongoing disruptions in the aftermath in order to target interventions more effectively.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Background. This paper examines the contributions of dispositional and non-dispositional factors to post-disaster psychological morbidity. Data reported are from the 845 participants in the longitudinal component of the Quake Impact Study. Methods. The phase 1 survey was used to construct dimensional indices of threat and disruption exposure. Subsequently, a range of dispositional characteristics were measured, including neuroticism, personal hopefulness and defence style. The main morbidity measures were the General Health Questionnaire (GHQ-12) and Impact of Event Scale (IES). Results. Dispositional characteristics were the best predictors of psychological morbidity throughout the 2 years post-disaster, contributing substantially more to the variance in morbidity (12-39%) than did initial exposure (5-12%), but the extent of their contribution was greater for general (GHQ-12) than for post-traumatic (IES) morbidity. Among the non-dispositional factors, avoidance coping contributed equally to general and post-traumatic morbidity (pr = 0.24). Life events since the earthquake (pr = 0.18), poor social relationships (pr = -0.25) and ongoing earthquake-related disruptions (pr = 0.22) also contributed to general morbidity, while only the latter contributed significantly to post-traumatic morbidity (pr = 0.15). Conclusions. Medium-term post-earthquake morbidity appears to be a function of multiple factors whose contributions vary depending on the type of morbidity experienced and include trait vulnerability, the nature and degree of initial exposure, avoidance coping and the nature and severity of subsequent events.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph K-n and B is an edge-disjoint decomposition of K-n into copies of the simple graph G. Following design terminology, we call these copies ''blocks''. Here K-4 - e denotes the complete graph K-4 with one edge removed. It is well-known that a K-4 - e design of order n exists if and only if n = 0 or 1 (mod 5), n greater than or equal to 6. The intersection problem here asks for which k is it possible to find two K-4 - e designs (P,B-1) and (P,B-2) of order n, with \B-1 boolean AND B-2\ = k, that is, with precisely k common blocks. Here we completely solve this intersection problem for K-4 - e designs.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Necessary conditions on n, m and d are given for the existence of an edge-disjoint decomposition of K-n\K-m into copies of the graph of a d-dimensional cube. Sufficiency is shown when d = 3 and, in some cases, when d = 2(t). We settle the problem of embedding 3-cube decompositions of K-m into 3-cube decompositions of K-n; where n greater than or equal to m.

Relevância:

10.00% 10.00%

Publicador:

Relevância:

10.00% 10.00%

Publicador:

Resumo:

For all m greater than or equal to 3 the edges of complete graph on 2m + 1 vertices can he partitioned into m 2m-cycles and an m-cycle.