Reducing the environmental impact of surgery on a global scale: systematic review and co-prioritization with healthcare workers in 132 countries

Abstract Background Healthcare cannot achieve net-zero carbon without addressing operating theatres. The aim of this study was to prioritize feasible interventions to reduce the environmental impact of operating theatres. Methods This study adopted a four-phase Delphi consensus co-prioritization methodology. In phase 1, a systematic review of published interventions and global consultation of perioperative healthcare professionals were used to longlist interventions. In phase 2, iterative thematic analysis consolidated comparable interventions into a shortlist. In phase 3, the shortlist was co-prioritized based on patient and clinician views on acceptability, feasibility, and safety. In phase 4, ranked lists of interventions were presented by their relevance to high-income countries and low–middle-income countries. Results In phase 1, 43 interventions were identified, which had low uptake in practice according to 3042 professionals globally. In phase 2, a shortlist of 15 intervention domains was generated. In phase 3, interventions were deemed acceptable for more than 90 per cent of patients except for reducing general anaesthesia (84 per cent) and re-sterilization of ‘single-use’ consumables (86 per cent). In phase 4, the top three shortlisted interventions for high-income countries were: introducing recycling; reducing use of anaesthetic gases; and appropriate clinical waste processing. In phase 4, the top three shortlisted interventions for low–middle-income countries were: introducing reusable surgical devices; reducing use of consumables; and reducing the use of general anaesthesia. Conclusion This is a step toward environmentally sustainable operating environments with actionable interventions applicable to both high– and low–middle–income countries

Discrete ray-tracing high resolution 3D grids

This article suggests a new approach to discrete Ray-Tracing in which a two step three-dimensional DDA and an octree are used. A verpy important problem regarding this kind of Ray Tracing, also known as Raster Ray Tracing, is the amount of memory required to store the 3D raster grid which will contain the discretized scene to be visualized. Since the resolution of this grid is huge because the voxel is assumed to be approximately the size of a pixel on the screen, it is limited by the maximum amount of memory of todays´ machines. Although using case in most scenes, an important memory saving is achieved. This memory saving helps using discrete Ray Tracing in normal workstations. It is shown that the special octree presented here doesn´t slow down Ray Tracing significantly and even competes with normal discrete Ray-Tracing. It is also shown that in critical cases this octree will not occupy much more space than a normal 3D grid. Another important problem is the bottleneck caused by the three-dimensional DDA in such huge resolution ones. The process can be divided in two steps where optimal times of three-dimensional DDA are achieved. This is shown through the comparative tests with the single step process

LIVE (plate-forme d'animation, contrôle et mélange de mouvements)

TOULOUSE3-BU Sciences (315552104) / SudocSudocFranceF

Système de génération automatique de bases de données pour la simulation de situations de conduite fondée sur l'interaction de ses différents acteurs

TOULOUSE3-BU Sciences (315552104) / SudocSudocFranceF

Simulation et visualisation de phénomènes naturels pour la synthèse d'images

TOULOUSE3-BU Sciences (315552104) / SudocSudocFranceF

Contrôle de qualité des systèmes de calcul de distribution de dose en radiothérapie

TOULOUSE3-BU Sciences (315552104) / SudocSudocFranceF

Dynamic and Hierarchical Constraints Solver with Continuous Variables

: Research in the area of layout, graphics, computer-aided design (CAD), and visualization includes novel techniques of artificial intelligence discipline, to express problems in terms of numeric constraint satisfaction problem over continuous domains. However, in those applications, a constraints solver must support both functional and nonfunctional constraints, and must find a solution even in critical situations such as overconstraint problem. Furthermore, it must incrementally update the solutions spaces as new constraints are added, existing constraints are removed, and constraints strength are changed. In this paper, in order to surmount those difficulties, we present a new constraints solver called ORANOS. ORANOS is an incremental constraints solver, independent from domain, by using interval propagation technique to efficiently maintain both equality and inequality constraints organized in a constraints hierarchy. KEYWORDS : Dynamic Constraint, Constraints Hierarchy, Interval ..

Interactive Constraint System for Solid Modeling Objects

The interaction of mechanisms applications presents a challenging domain for research in constraint-based systems. In these applications several requirements must be solved. Time consuming and complex tasks must take advantage of every computational opportunity to improve performance. Moreover, the constraints solver must give a rapid solution even in critical situations such as under-constraints, over-constraints and cyclic constraints problems. In this paper, we present a geometric constraint system named LinkEdit that provides an interactive tool to construct objects from rigid primitives and constrain them by several constraints types. In LinkEdit system, internal and external constraints are integrated as a new paradigm for constraint definition and the constraint solver is designed to handle the previous requirements, by combining local propagation and propagation of degrees of freedom techniques