Polyline‐sourced Geodesic Voronoi Diagrams on Triangle Meshes

This paper studies the Voronoi diagrams on 2‐manifold meshes based on geodesic metric (a.k.a. geodesic Voronoi diagrams or GVDs), which have polyline generators. We show that our general setting leads to situations more complicated than conventional 2D Euclidean Voronoi diagrams as well as point‐source based GVDs, since a typical bisector contains line segments, hyperbolic segments and parabolic segments. To tackle this challenge, we introduce a new concept, called local Voronoi diagram (LVD), which is a combination of additively weighted Voronoi diagram and line‐segment Voronoi diagram on a mesh triangle. We show that when restricting on a single mesh triangle, the GVD is a subset of the LVD and only two types of mesh triangles can contain GVD edges. Based on these results, we propose an efficient algorithm for constructing the GVD with polyline generators. Our algorithm runs in O(nNlogN) time and takes O(nN) space on an n‐face mesh with m generators, where N = max{m, n}. Computational results on real‐world models demonstrate the efficiency of our algorithm.     

Adaptive multi‐scale analysis for point‐based surface editing

This paper presents a tool that enables the direct editing of surface features in large point‐clouds or meshes. This is made possible by a novel multi‐scale analysis of unstructured point‐clouds that automatically extracts the number of relevant features together with their respective scale all over the surface. Then, combining this ingredient with an adequate multi‐scale decomposition allows us to directly enhance or reduce each feature in an independent manner. Our feature extraction is based on the analysis of the scale‐variations of locally fitted surface primitives combined with unsupervised learning techniques. Our tool may be applied either globally or locally, and millions of points are handled in real‐time. The resulting system enables users to accurately edit complex geometries with minimal interaction.     

IISPH‐FLIP for incompressible fluids

We propose to use Implicit Incompressible Smoothed Particle Hydrodynamics (IISPH) for pressure projection and boundary handling in Fluid‐Implicit‐Particle (FLIP) solvers for the simulation of incompressible fluids. This novel combination addresses two issues of existing SPH and FLIP solvers, namely mass preservation in FLIP and efficiency and memory consumption in SPH. First, the SPH component enables the simulation of incompressible fluids with perfect mass preservation. Second, the FLIP component efficiently enriches the SPH component with detail that is comparable to a standard SPH simulation with the same number of particles, while improving the performance by a factor of 7 and significantly reducing the memory consumption. We demonstrate that the proposed IISPH‐FLIP solver can simulate incompressible fluids with a quantifiable, imperceptible density deviation below 0.1%. We show large‐scale scenarios with up to 160 million particles that have been processed on a single desktop PC using only 15GB of memory. One‐ and two‐way coupled solids are illustrated.     

Automatic generation of tourist brochures

We present a novel framework for the automatic generation of tourist brochures that include routing instructions and additional information presented in the form of so‐called detail lenses. The first contribution of this paper is the automatic creation of layouts for the brochures. Our approach is based on the minimization of an energy function that combines multiple goals: positioning of the lenses as close as possible to the corresponding region shown in an overview map, keeping the number of lenses low, and an efficient numbering of the lenses. The second contribution is a route‐aware simplification of the graph of streets used for traveling between the points of interest (POIs). This is done by reducing the graph consisting of all shortest paths through the minimization of an energy function. The output is a subset of street segments that enable traveling between all the POIs without considerable detours, while at the same time guaranteeing a clutter‐free visualization.     

Pathline glyphs

Visualization of pathlines is common and highly relevant for the analysis of unsteady flow. However, pathlines can intersect, leading to visual clutter and perceptual issues. This makes it intrinsically difficult to provide expressive visualizations of the entire domain by an arrangement of multiple pathlines, in contrast to well‐established streamline placement techniques. We present an approach to reduce these problems. It is inspired by glyph‐based visualization and small multiples: we partition the domain into cells, each corresponding to a downscaled version of the entire domain. Inside these cells, a single downscaled pathline is drawn. On the overview scale, our pathline glyphs lead to emergent visual patterns that provide insight into time‐dependent flow behavior. Zooming‐in allows us to analyze individual pathlines in detail and compare neighboring lines. The overall approach is complemented with a context‐preserving zoom lens and interactive pathline‐based exploration. While we primarily target the visualization of 2D flow, we also address the extension to 3D. Our evaluation includes several examples, comparison to other flow visualization techniques, and a user study with domain experts.     

Hierarchical opacity optimization for sets of 3D line fields

The selection of meaningful lines for 3D line data visualization has been intensively researched in recent years. Most approaches focus on single line fields where one line passes through each domain point. This paper presents a selection approach for sets of line fields which is based on a global optimization of the opacity of candidate lines. For this, existing approaches for single line fields are modified such that significantly larger amounts of line representatives are handled. Furthermore, time coherence is addressed for animations, making this the first approach that solves the line selection problem for 3D time‐dependent flow. We apply our technique to visualize dense sets of pathlines, sets of magnetic field lines, and animated sets of pathlines, streaklines and masslines.     

Advancements in the design and validation of an air pollution integrated assessment model for Spain

This paper describes the design and application of the Atmospheric Evaluation and Research Integrated model for Spain (AERIS). Currently, AERIS can provide concentration profiles of NO₂, O₃, SO₂, NH₃, PM, as a response to emission variations of relevant sectors in Spain. Results are calculated using transfer matrices based on an air quality modelling system (AQMS) composed by the WRF (meteorology), SMOKE (emissions) and CMAQ (atmospheric-chemical processes) models. The AERIS outputs were statistically tested against the conventional AQMS and observations, revealing a good agreement in both cases. At the moment, integrated assessment in AERIS focuses only on the link between emissions and concentrations. The quantification of deposition, impacts (health, ecosystems) and costs will be introduced in the future. In conclusion, the main asset of AERIS is its accuracy in predicting air quality outcomes for different scenarios through a simple yet robust modelling framework, avoiding complex programming and long computing times.     

Trust assessment of security for e-health systems

The expansive connectivity of emerging information systems has set the stage for pervasive access to healthcare services via e-health systems for selecting the best possible healthcare services. Emerging systems are expected to be highly dynamic open environments connecting diverse number of healthcare services and autonomous entities that are autonomous agents or software applications representing patients. Entities in such dynamic environments may have different security needs from e-health systems raising the challenge of trust computations regarding security. In this research, we proposed a trust assessment model of an e-health service from the viewpoint of an entity. The model contains a comprehensive architecture applicable to different types of entities, and a novel set of trust assessment metrics may be used to assess a specific property of a security system (i.e. partial metrics) or all properties (i.e. total metrics). The simulation based evaluation of proposed model in the context of a Hospital Online Appointment Service has shown that the proposed model provides better trust computation results than existing trust models for e-health systems. Furthermore, the entities are also able to assess the trust even with incomplete security information.     

一种并行中英文混合多模式匹配算法

针对中英文混合文本的匹配准确性及大规模数据文本的匹配效率等问题,基于经典的线索化完全哈希特里树算法,提出一种并行化的中英文混合多模式文本匹配算法。采用拆分文本降低多模式匹配算法的串行度,进而在拆分出的小文本上并行地执行文本匹配。通过并行化预处理过程,设计新的存储结构。实验结果表明,该算法在保证结果正确的前提下,执行效率高于经典的串行匹配算法,当数据规模达到226个字符时,可以获得8倍以上的加速比。     

Laminar and turbulent mass transfer simulations in a parallel plate reactor

Laminar and turbulent mass transfer in a parallel plate reactor at high Schmidt number obtained from numerical simulation is compared with literature data. In a first step, the fluid flow is determined numerically in the reactor by solving the Navier–Stokes equations. For turbulent flow, a low Reynolds number k— model is used to calculate the turbulent viscosity. Using the obtained flow field and turbulent viscosity, the current density distribution is calculated for different flow velocities by solving the equations describing the transport of multiple ions due to diffusion, convection and migration. For the laminar case, a very good agreement with literature data is obtained. For turbulent flow, different numerical models for turbulent mass transfer are proposed in the literature. A detailed study of the behaviour close to the wall of these different turbulence models is presented, together with a comparison of the calculated results with literature correlations. This allows identification of the benefits and disadvantages of each of the turbulence models for the numerical calculation of mass transfer at high Schmidt numbers in a parallel plate reactor.