4 resultados para Cuisine evaluation criteria

em WestminsterResearch - UK


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Background: NF2 patients develop multiple nervous system tumors including bilateral vestibular schwannomas (VS). The tumors and their surgical treatment are associated with deafness, neurological disability, and mortality. Medical treatment with bevacizumab has been reported to reduce VS growth and to improve hearing. In addition to evaluating these effects, this study also aimed to determine other important consequences of treatment including patient-reported quality of life and the impact of treatment on surgical VS rates. Methods: Patients treated with bevacizumab underwent serial prospective MRI, audiology, clinical, CTCAE-4.0 adverse events, and NFTI-QOL quality-of-life assessments. Tumor volumetrics were classified according to the REiNs criteria and annual VS surgical rates reviewed. Results: Sixty-one patients (59% male), median age 25 years (range, 10–57), were reviewed. Median follow-up was 23 months (range, 3–53). Partial volumetric tumor response (all tumors) was seen in 39% and 51% had stabilization of previously growing tumors. Age and pretreatment growth rate were predictors of response. Hearing was maintained or improved in 86% of assessable patients. Mean NFTI-QOL scores improved from 12.0 to 10.7 (P < .05). Hypertension was observed in 30% and proteinuria in 16%. Twelve treatment breaks occurred due to adverse events. The rates of VS surgery decreased after the introduction of bevacizumab. Conclusion: Treatment with bevacizumab in this large, UK-wide cohort decreased VS growth rates and improved hearing and quality of life. The potential risk of surgical iatrogenic damage was also reduced due to an associated reduction in VS surgical rates. Ongoing follow-up of this cohort will determine the long-term benefits and risks of bevacizumab treatment.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Evaluation for Participation and Sustainability in Planning’ is the title of a new book edited by Johan Woltjer and his colleagues Angela Hull, Ernest Alexander, and Abdul Khakee. The book addresses the evaluation of planning interventions from several perspectives (social, economic, environmental). Specifically, the attention is focused on: - how evaluation is used in planning practice, including the choice of indicators or the criteria to evaluate participation; - the introduction of new kinds of information, such as measuring the cumulative effects or bringing criteria on capability and well-being into play; - alternative ways of collecting and presenting information, through using GIS or focusing on strategic environmental awareness and ‘hotspots’; and - understanding how strategic planning objectives are implemented in local practice.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The convex hull describes the extent or shape of a set of data and is used ubiquitously in computational geometry. Common algorithms to construct the convex hull on a finite set of n points (x,y) range from O(nlogn) time to O(n) time. However, it is often the case that a heuristic procedure is applied to reduce the original set of n points to a set of s < n points which contains the hull and so accelerates the final hull finding procedure. We present an algorithm to precondition data before building a 2D convex hull with integer coordinates, with three distinct advantages. First, for all practical purposes, it is linear; second, no explicit sorting of data is required and third, the reduced set of s points is constructed such that it forms an ordered set that can be directly pipelined into an O(n) time convex hull algorithm. Under these criteria a fast (or O(n)) pre-conditioner in principle creates a fast convex hull (approximately O(n)) for an arbitrary set of points. The paper empirically evaluates and quantifies the acceleration generated by the method against the most common convex hull algorithms. An extra acceleration of at least four times when compared to previous existing preconditioning methods is found from experiments on a dataset.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

The convex hull describes the extent or shape of a set of data and is used ubiquitously in computational geometry. Common algorithms to construct the convex hull on a finite set of n points (x,y) range from O(nlogn) time to O(n) time. However, it is often the case that a heuristic procedure is applied to reduce the original set of n points to a set of s < n points which contains the hull and so accelerates the final hull finding procedure. We present an algorithm to precondition data before building a 2D convex hull with integer coordinates, with three distinct advantages. First, for all practical purposes, it is linear; second, no explicit sorting of data is required and third, the reduced set of s points is constructed such that it forms an ordered set that can be directly pipelined into an O(n) time convex hull algorithm. Under these criteria a fast (or O(n)) pre-conditioner in principle creates a fast convex hull (approximately O(n)) for an arbitrary set of points. The paper empirically evaluates and quantifies the acceleration generated by the method against the most common convex hull algorithms. An extra acceleration of at least four times when compared to previous existing preconditioning methods is found from experiments on a dataset.