Combinatorial Bidirectional Path‐Tracing for Efficient Hybrid CPU/GPU Rendering

This paper presents a reformulation of bidirectional path‐tracing that adequately divides the algorithm into processes efficiently executed in parallel on both the CPU and the GPU. We thus benefit from high‐level optimization techniques such as double buffering, batch processing, and asyncronous execution, as well as from the exploitation of most of the CPU, GPU, and memory bus capabilities. Our approach, while avoiding pure GPU implementation limitations (such as limited complexity of shaders, light or camera models, and processed scene data sets), is more than ten times faster than standard bidirectional path‐tracing implementations, leading to performance suitable for production‐oriented rendering engines.     

Embedding of a real time image stabilization algorithm on a parameterizable SoPC architecture a chip multi-processor approach

Highly regular multi-processor architectures are suitable for inherently highly parallelizable applications such as most of the image processing domain. Systems embedded in a single programmable chip platform (SoPC) allow hardware designers to tailor every aspect of the architecture in order to match the specific application needs. These platforms are now large enough to embed an increasing number of cores, allowing implementation of a multi-processor architecture with an embedded communication network. In this paper we present the parallelization and the embedding of a real time image stabilization algorithm on a SoPC platform. Our overall hardware implementation method is based upon meeting algorithm processing power requirements and communication needs with refinement of a generic parallel architecture model. Actual implementation is done by the choice and parameterization of readily available reconfigurable hardware modules and customizable commercially available IPs (Intellectual Property). We present both software and hardware implementation with performance results on a Xilinx SoPC target.     

Accurate Shadows by Depth Complexity Sampling

The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real‐time and offline applications decorrelate the generation of shadows from the computation of lighting. In addition to such approximations, they generate shadows using some restrictive assumptions only correct in very specific cases, leading to penumbra over‐estimation or light‐leaking artifacts. In this paper we present an algorithm that produces soft shadows without exhibiting the previous drawbacks. Using a new efficient evaluation of the number of occluders between two points (i.e. the depth complexity) we either modulate direct lighting or numerically solve the rendering equation for direct illumination. Our approach approximates shadows cast by semi‐opaque occluders and naturally handles area lights with spatially varying luminance. Furthermore, depending on the desired performance and quality, the resulting shadows are either very close to, or as accurate as, a ray‐traced reference. As a result, the presented method is well suited to many domains, ranging from quality‐sensitive to performance‐critical applications.     

Crack‐free rendering of dynamically tesselated B‐rep models

We propose a versatile pipeline to render B‐Rep models interactively, precisely and without rendering‐related artifacts such as cracks. Our rendering method is based on dynamic surface evaluation using both tesselation and ray‐casting, and direct GPU surface trimming. An initial rendering of the scene is performed using dynamic tesselation. The algorithm we propose reliably detects then fills up cracks in the rendered image. Crack detection works in image space, using depth information, while crack‐filling is either achieved in image space using a simple classification process, or performed in object space through selective ray‐casting. The crack filling method can be dynamically changed at runtime. Our image space crack filling approach has a limited runtime cost and enables high quality, real‐time navigation. Our higher quality, object space approach results in a rendering of similar quality than full‐scene ray‐casting, but is 2 to 6 times faster, can be used during navigation and provides accurate, reliable rendering. Integration of our work with existing tesselation‐based rendering engines is straightforward.     

Dynamic surfel set refinement for high-quality rendering

Splatting-based rendering techniques are currently the best choice for efficient high-quality rendering of point-based geometries. However, such techniques are not suitable for large magnification, especially when the object is under-sampled. This paper improves the rendering quality of pure splatting techniques using a fast dynamic up-sampling algorithm for point-based geometry. Our algorithm is inspired by interpolatory subdivision surfaces where the geometry is refined iteratively. At each step the refined geometry is that from the previous step enriched by a new set of points. The point insertion procedure uses three operators: a local neighborhood selection operator, a refinement operator (adding new points) and a smoothing operator. Even though our insertion procedure makes the analysis of the limit surface complicated and it does not guarantee its G¹ continuity, it remains very efficient for high-quality real-time point rendering. Indeed, while providing an increased rendering quality, especially for large magnification, our algorithm needs no other preprocessing nor any additional information beyond that used by any splatting technique. This extended version (Real-time point cloud refinement, in: Proceedings of Eurographics Symposium on Point-Based Graphic, 2004, pp. 41.) contains details on creases handling and more comparison to other smoothing operators.     

Patient-Derived Tumor Organoids for Guidance of Personalized Drug Therapies in Recurrent Glioblastoma

An obstacle to effective uniform treatment of glioblastoma, especially at recurrence, is genetic and cellular intertumoral heterogeneity. Hence, personalized strategies are necessary, as are means to stratify potential targeted therapies in a clinically relevant timeframe. Functional profiling of drug candidates against patient-derived glioblastoma organoids (PD-GBO) holds promise as an empirical method to preclinically discover potentially effective treatments of individual tumors. Here, we describe our establishment of a PD-GBO-based functional profiling platform and the results of its application to four patient tumors. We show that our PD-GBO model system preserves key features of individual patient glioblastomas in vivo. As proof of concept, we tested a panel of 41 FDA-approved drugs and were able to identify potential treatment options for three out of four patients; the turnaround from tumor resection to discovery of treatment option was 13, 14, and 15 days, respectively. These results demonstrate that this approach is a complement and, potentially, an alternative to current molecular profiling efforts in the pursuit of effective personalized treatment discovery in a clinically relevant time period. Furthermore, these results warrant the use of PD-GBO platforms for preclinical identification of new drugs against defined morphological glioblastoma features.     

Development of an innovative, two-processor data processing unitfor the magnetospheric imaging instrument onboard the Cassini mission toSaturn. I. Hardware architecture

This paper presents an innovative two-processor computer architecture, developed for the data processing unit (DPU) of the Magnetospheric IMaging Instrument (MIMI), on-board the Cassini spacecraft mission to Saturn. The main advantages of this architecture are its high performance and reliability, and its intelligence. The high performance is justified by the following: 1) optimum combination of two powerful Harris RTX 2010 processors; 2) adoption of two independent main bus structures used for the communication of the processors with the various instrument interfaces and subsystems; 3) adoption of two additional local buses on each processor board used to speed the on-board operations of the processors; 4) high speed interprocessor communication port. The high reliability is justified by the following: 1) simplicity of hardware/software structures; 2) fault tolerance capabilities; 3) capability for on-flight hardware/software reconfiguration by ground command. Moreover, the on-board intelligence is justified by the following: 1) sophisticated fault protection, data handling, and instrument control software; 2) intelligent interfaces [implemented using held programmable gate arrays (FPGAs)]; 3) capability for autonomous on-flight hardware/software reconfiguration in case of an unrecoverable failure in one processor. The advantages of this architecture make it the best choice for the DPU of the complex, sophisticated scientific MIMI instrument, compared to the traditional master-slave (low reliability-single point failure) and common shared bus (low performance, hardware and software complexity) architectures     

In‐process rheological monitoring of extrusion‐based polymer processes

Since rheology is very sensitive to the structure and macromolecular conformation of polymer systems, rheological measurements performed in situ during extrusion are attractive for monitoring the process. After introducing the concepts of in‐process monitoring during extrusion operations, the benefits of rheology for assessing filler dispersion in polymer composites, morphology development in polymer blends or the extent of chemical reaction in reactive extrusion are briefly reviewed. Then, in‐process rheological tools are reviewed. For each device, the information conveyed is detailed. © 2020 Society of Industrial Chemistry     

Phospholipid Content of Pseudomonas aeruginosa PAO1 Is Modulated by the Growth Phase Rather Than the Immobilization State

Biofilms have significance in medical, industrial, and environmental settings, and can cause important damage. As biofilms are tolerant to various stresses, including antibiotics, it is necessary to better understand their formation. For this reason, we characterized the phospholipidome of Pseudomonas aeruginosa, an opportunistic pathogen involved in numerous infections, during the first steps of the biofilm development. By a liquid chromatography-tandem mass spectrometry time-course analysis over a 24-h period, we compared the phospholipid (PL) composition of immobilized (attached) and planktonic (unattached) P. aeruginosa PAO1 cells. Our results showed that the PL content of P. aeruginosa PAO1 was mainly modulated by the incubation time, thus related to bacterial growth but also, more modestly, by the immobilization state. We observed that relative amounts of PL varied over time with two main profiles and that these profiles are correlated to its fatty acid composition, including the degree of unsaturation. A statistical analysis revealed that the PL contents of both attached and unattached PAO1 cells were significantly different mainly after 3 and 6 h of incubation and that the amounts of two PL presented a statistical difference between attached and unattached cells all along the 24-h period: PtdEtn 16:0_18:1 and PtdEtn 18:1_18:1.