| 1. |
- Ashton, Susan, et al.
(author)
-
Aurora kinase inhibitor nanoparticles target tumors with favorable therapeutic index in vivo
- 2016
-
In: Science Translational Medicine. - : American Association for the Advancement of Science (AAAS). - 1946-6234 .- 1946-6242. ; 8:325
-
Journal article (peer-reviewed)abstract
- Efforts to apply nanotechnology in cancer have focused almost exclusively on the delivery of cytotoxic drugs to improve therapeutic index. There has been little consideration of molecularly targeted agents, in particular kinase inhibitors, which can also present considerable therapeutic index limitations. We describe the development of Accurin polymeric nanoparticles that encapsulate the clinical candidate AZD2811, an Aurora B kinase inhibitor, using an ion pairing approach. Accurins increase biodistribution to tumor sites and provide extended release of encapsulated drug payloads. AZD2811 nanoparticles containing pharmaceutically acceptable organic acids as ion pairing agents displayed continuous drug release for more than 1 week in vitro and a corresponding extended pharmacodynamic reduction of tumor phosphorylated histone H3 levels in vivo for up to 96 hours after a single administration. A specific AZD2811 nanoparticle formulation profile showed accumulation and retention in tumors with minimal impact on bone marrow pathology, and resulted in lower toxicity and increased efficacy in multiple tumor models at half the dose intensity of AZD1152, a water-soluble prodrug of AZD2811. These studies demonstrate that AZD2811 can be formulated in nanoparticles using ion pairing agents to give improved efficacy and tolerability in preclinical models with less frequent dosing. Accurins specifically, and nanotechnology in general, can increase the therapeutic index of molecularly targeted agents, including kinase inhibitors targeting cell cycle and oncogenic signal transduction pathways, which have to date proved toxic in humans.
|
|
| 2. |
- Abelev, Betty, et al.
(author)
-
Underlying Event measurements in pp collisions at root s=0.9 and 7 TeV with the ALICE experiment at the LHC
- 2012
-
In: Journal of High Energy Physics. - 1029-8479. ; :7
-
Journal article (peer-reviewed)abstract
- We present measurements of Underlying Event observables in pp collisions at root s = 0 : 9 and 7 TeV. The analysis is performed as a function of the highest charged-particle transverse momentum p(T),L-T in the event. Different regions are defined with respect to the azimuthal direction of the leading (highest transverse momentum) track: Toward, Transverse and Away. The Toward and Away regions collect the fragmentation products of the hardest partonic interaction. The Transverse region is expected to be most sensitive to the Underlying Event activity. The study is performed with charged particles above three different p(T) thresholds: 0.15, 0.5 and 1.0 GeV/c. In the Transverse region we observe an increase in the multiplicity of a factor 2-3 between the lower and higher collision energies, depending on the track p(T) threshold considered. Data are compared to PYTHIA 6.4, PYTHIA 8.1 and PHOJET. On average, all models considered underestimate the multiplicity and summed p(T) in the Transverse region by about 10-30%.
|
|
| 3. |
- Akenine-Möller, Tomas, et al.
(author)
-
Simple Environment Map Filtering Using Ray Cones and Ray Differentials
- 2019
-
In: Ray Tracing Gems : High-Quality and Real-Time Rendering with DXR and Other APIs - High-Quality and Real-Time Rendering with DXR and Other APIs. - Berkeley, CA : Apress. - 9781484244265 - 9781484244272 ; , s. 347-351
-
Book chapter (peer-reviewed)abstract
- We describe simple methods for how to filter environment maps using ray cones and ray differentials in a ray tracing engine.
|
|
| 4. |
- Akenine-Möller, Tomas, et al.
(author)
-
Texture Level of Detail Strategies for Real-Time Ray Tracing
- 2019
-
In: Ray Tracing Gems : High-Quality and Real-Time Rendering with DXR and Other APIs - High-Quality and Real-Time Rendering with DXR and Other APIs. - Berkeley, CA : Apress. - 9781484244265 - 9781484244272 ; , s. 321-345
-
Book chapter (peer-reviewed)abstract
- Unlike rasterization, where one can rely on pixel quad partial derivatives, an alternative approach must be taken for filtered texturing during ray tracing. We describe two methods for computing texture level of detail for ray tracing. The first approach uses ray differentials, which is a general solution that gives high-quality results. It is rather expensive in terms of computations and ray storage, however. The second method builds on ray cone tracing and uses a single trilinear lookup, a small amount of ray storage, and fewer computations than ray differentials. We explain how ray differentials can be implemented within DirectX Raytracing (DXR) and how to combine them with a G-buffer pass for primary visibility. We present a new method to compute barycentric differentials. In addition, we give previously unpublished details about ray cones and provide a thorough comparison with bilinearly filtered mip level 0, which we consider as a base method.
|
|
| 5. |
- Andersson, Pontus, et al.
(author)
-
FLIP: A Difference Evaluator for Alternating Images
- 2020
-
In: Proceedings of the ACM in Computer Graphics and Interactive Techniques. - : Association for Computing Machinery (ACM). - 2577-6193. ; 3:2, s. 1-23
-
Journal article (peer-reviewed)abstract
- Image quality measures are becoming increasingly important in the field of computer graphics. For example, there is currently a major focus on generating photorealistic images in real time by combining path tracing with denoising, for which such quality assessment is integral. We present FLIP, which is a difference evaluator with a particular focus on the differences between rendered images and corresponding ground truths. Our algorithm produces a map that approximates the difference perceived by humans when alternating between two images. FLIP is a combination of modified existing building blocks, and the net result is surprisingly powerful. We have compared our work against a wide range of existing image difference algorithms and we have visually inspected over a thousand image pairs that were either retrieved from image databases or generated in-house. We also present results of a user study which indicate that our method performs substantially better, on average, than the other algorithms. To facilitate the use of FLIP, we provide source code in C++, MATLAB, NumPy/SciPy, and PyTorch.
|
|
| 6. |
- Andersson, Pontus, et al.
(author)
-
Visualizing and Communicating Errors in Rendered Images
- 2021
-
In: Ray Tracing Gems II : Next Generation Real-Time Rendering with DXR, Vulkan, and OptiX - Next Generation Real-Time Rendering with DXR, Vulkan, and OptiX. - 9781484271858 - 9781484271872 ; , s. 301-320
-
Book chapter (peer-reviewed)abstract
- In rendering research and development, it is important to have a formalizedway of visualizing and communicating how and where errors occur whenrendering with a given algorithm. Such evaluation is often done by comparingthe test image to a ground-truth reference image. We present a tool for doingthis for both low and high dynamic range images. Our tool is based on aperception-motivated error metric, which computes an error map image. Forhigh dynamic range images, it also computes a visualization of the exposuresthat may generate large errors.
|
|
| 7. |
- Andersson, Pontus, et al.
(author)
-
Visualizing Errors in Rendered High Dynamic Range Images
- 2021
-
In: Eurographics - Short Papers. - 9783038681335 ; , s. 25-28
-
Conference paper (peer-reviewed)abstract
- A new error metric targeting rendered high dynamic range images is presented. Our method computes a composite visualization over a number of low dynamic range error maps of exposure compensated and tone mapped image pairs with automatically computed, or manually provided, parameters. We argue that our new error maps predict errors substantially better than metrics previously used in rendering. Source code is released with the hope that our work can be a useful tool for future research.
|
|
| 8. |
- Carlsson, Henrik, 1979-, et al.
(author)
-
Automated Generation of Discrete Event System Simulation Models for Flexible Automation
- 2011
-
In: The 21st International Conference on Flexible Automation and Intelligent Manufacturing. - 9789868729100 ; , s. 825-832, s. 825-832
-
Conference paper (peer-reviewed)abstract
- Flexible automation cells with rapid product changes are an important competitive advantage for industries today. These cells can increase a company’s productivity and thereby increase their profits. A flexible cell shall be able to handle different products with none or minimal changes to the cell itself. A powerful tool, which can be used to analyse and verify such cells, is discrete event system simulation. Problems such as potential bottlenecks, deadlocks, answers to "what-if" questions and the level of resource utilisation can be gathered. The drawback of discrete event system simulation is that the modelling task is both time consuming and difficult to accomplish. Furthermore, state-of-the-art discrete event system simulation tools that are used in the industry today are not suitable for flexible automation. If the production scenario is changed, e.g. introduction of a new product, the simulation and modelling has to be redone and this is both time consuming and tedious. In this paper a new approach will be presented that enables discrete event simulation models to be generated automatically. The models are generated from information retrieved from a PLM/PDM database system, which is shared among other engineering tools such as robot simulation, CAD and process planning. Hence, when the cell and the database are updated a new model can easily be generated. The database is also connected to the real cell so up-to-date data can be retrieved from the real cell. The model generator described in this paper was implemented and tested in a discrete event system simulation tool and showed promising results. With this approach it is possible to handle flexible automation cells more effectively in a process planning stage.
|
|
| 9. |
- Clarberg, Petrik, et al.
(author)
-
AMFS: Adaptive Multi-Frequency Shading for Future Graphics Processors
- 2014
-
In: ACM Transactions on Graphics. - : Association for Computing Machinery (ACM). - 0730-0301 .- 1557-7368. ; 33:4, s. 141-141
-
Journal article (peer-reviewed)abstract
- We propose a powerful hardware architecture for pixel shading, which enables flexible control of shading rates and automatic shading reuse between triangles in tessellated primitives. The main goal is efficient pixel shading for moderately to finely tessellated geometry, which is not handled well by current GPUs. Our method effectively decouples the cost of pixel shading from the geometric complexity. It thereby enables a wider use of tessellation and fine geometry, even at very limited power budgets. The core idea is to shade over small local grids in parametric patch space, and reuse shading for nearby samples. We also support the decomposition of shaders into multiple parts, which are shaded at different frequencies. Shading rates can be locally and adaptively controlled, in order to direct the computations to visually important areas and to provide performance scaling with a graceful degradation of quality. Another important benefit of shading in patch space is that it allows efficient rendering of distribution effects, which further closes the gap between real-time and offline rendering.
|
|
| 10. |
- Ekman, Magnus, 1977, et al.
(author)
-
An In-Depth Look at Computer Performance Growth
- 2004
-
Reports (other academic/artistic)abstract
- It is a common belief that computer performance growth is over 50% annually, or that performance doubles every 18-20 months. By analyzing publicly available results from the SPEC integer (CINT) benchmark suites, we conclude that this was true between 1985 and 1996 the early years of the RISC paradigm.During the last 7.5 years (1996-2004), however, performance growth has slowed down to 41%, with signs of a continuing decline. Meanwhile, clock frequency has improved with about 29% annually. The improvement in clock frequency was enabled both by an annual device speed scaling of 20% as well as by longer pipelines with a lower gate-depth in each stage. This paper takes a fresh look at and tries to remove the confusion about performance scaling that exists in the computer architecture community.
|
|
