On preconditioning for a parallel solution of the Richards equation

In this paper, we present a class of preconditioning methods for a parallel solution of the three-dimensional Richards equation. The preconditioning methods Jacobi scaling, block-Jacobi, incomplete lower–upper, incomplete Cholesky and algebraic multigrid were applied in combination with a parallel conjugate gradient solver and tested for robustness and convergence using two model scenarios. The first scenario was an infiltration into initially dry, sandy soil discretised in 500,000 nodes. The second scenario comprised spatially distributed soil properties using 275,706 numerical nodes and atmospheric boundary conditions. Computational results showed a high efficiency of the nonlinear parallel solution procedure for both scenarios using up to 64 processors. Using 32 processors for the first scenario reduced the wall clock time to slightly more than 1% of the single processor run. For scenario 2 the use of 64 processors reduces the wall clock time to slightly more than 20% of the 8 processors wall clock time. The difference in the efficiency of the various preconditioning methods is moderate but not negligible. The use of the multigrid preconditioning algorithm is recommended, since on average it performed best for both scenarios.     

The Effects of Embedded Dipoles in Aromatic Self‐Assembled Monolayers

Using a representative model system, here electronic and structural properties of aromatic self‐assembled monolayers (SAMs) are described that contain an embedded, dipolar group. As polar unit, pyrimidine is used, with its orientation in the molecular backbone and, consequently, the direction of the embedded dipole moment being varied. The electronic and structural properties of these embedded‐dipole SAMs are thoroughly analyzed using a number of complementary characterization techniques combined with quantum‐mechanical modeling. It is shown that such mid‐chain‐substituted monolayers are highly interesting from both fundamental and application viewpoints, as the dipolar groups are found to induce a potential discontinuity inside the monolayer, electrostatically shifting the core‐level energies in the regions above and below the dipoles relative to one another. These SAMs also allow for tuning the substrate work function in a controlled manner independent of the docking chemistry and, most importantly, without modifying the SAM‐ambient interface.     

Filler Wetting in Miscible ESBR/SSBR Blends and Its Effect on Mechanical Properties

The selective wetting behavior of silica in emulsion styrene butadiene rubber (ESBR)/solution styrene butadiene rubber (SSBR) blends is characterized by the wetting concept, which is further developed for filled blends based on miscible rubbers. It is found that not only the chemical rubber–filler affinity but also the topology of the filler surface significantly influences the selective filler wetting in rubber blends. The nanopore structure of the silica surface has been recognized as the main reason for the difference in the wetting behavior of the branched ESBR molecules and linear SSBR molecules. However, the effect of nanopore structure becomes more significant in the presence of silane. It is discussed that the adsorption of silane on silica surface constricts the nanopore to some extent that hinders effectively the space filling of the nanopores by the branched ESBR molecules but not by the linear SSBR molecules. As a result, in silanized ESBR/SSBR blends the dominant wetting of silica surface by the tightly bonded layer of SSBR molecules causes a low‐energy dissipation in the rubber–filler interphase. That imparts the low rolling resistance to the blends similar to that of a silica‐filled SSBR compound, while the ESBR‐rich matrix warrants the good tensile behavior, i.e., good abrasion and wear resistance of the blends.

     

A symbolic algorithm for lazy synthesis of eager strategies

Acta Informatica - We present an algorithm for solving two-player safety games that combines a mixed forward/backward search strategy with a symbolic representation of the state space. By combining...     

Polymer coating behavior of Rayleigh-SAW resonators with gold electrode structure for gas sensor applications

Results from systematic polymer coating experiments on surface acoustic wave (SAW) resonators and coupled resonator filters (CRF) on ST-cut quartz with a corrosion-proof electrode structure entirely made of gold (Au) are presented and compared with data from similar SAW devices using aluminium (Al) electrodes. The recently developed Au devices are intended to replace their earlier Al counterparts in sensor systems operating in highly reactive chemical gas environments. Solid parylene C and soft poly[chlorotrifluoroethylene-co-vinylidene fluoride] (PCFV) polymer films are deposited under identical conditions onto the surface of Al and Au devices. The electrical performance of the Parylene C coated devices is monitored online during film deposition. The PCVF coated devices are evaluated after film deposition. The experimental data show that the Au devices can stand up to 40% thicker solid films for the same amount of loss increase than the Al devices and retain better resonance and phase characteristics. The frequency sensitivities of Au and Al devices to parylene C deposition are nearly identical. After coating with soft PCFV sensing film, the Au devices provide up to two times higher gas sensitivity when probed with cooling agent, octane, or tetrachloroethylene.     

面向对象、泛型程序设计与类型约束检查

该文对面向对象和泛型程序设计(generic programming)的核心思想和方法进行了较为深入的分析．阐明了各自的目标、技术特征及其优缺点所在．介绍了泛型程序设计针对对象技术的不足所引进的重大革新，即通过类型需求抽象来设计通用、高效的数据结构和算法；着重论述了作者在进一步增强泛型程序设计实际运用方面所提出的改进工作．以C 语言的一个泛型编程扩充语言C**为实施例，详细说明了如何通过一种叫做“命名类型约束”的新的机制来比较完整地实现静态类型需求的直接语言支持和编译检查，为当前泛型程序设计模型的首例编程语言实例．     

Parameterized synthesis of self-stabilizing protocols in symmetric networks

Self-stabilization in distributed systems is a technique to guarantee convergence to a set of legitimate states without external intervention when a transient fault or bad initialization occurs. Recently, there has been a surge of efforts in designing techniques for automated synthesis of self-stabilizing algorithms that are correct by construction. Most of these techniques, however, are not parameterized, meaning that they can only synthesize a solution for a fixed and predetermined number of processes. In this paper, we report a breakthrough in parameterized synthesis of self-stabilizing algorithms in symmetric networks, including ring, line, mesh, and torus. First, we develop cutoffs that guarantee (1) closure in legitimate states, and (2) deadlock-freedom outside the legitimate states. We also develop a sufficient condition for convergence in self-stabilizing systems. Since some of our cutoffs grow with the size of the local state space of processes, scalability of the synthesis procedure is still a problem. We address this problem by introducing a novel SMT-based technique for counterexample-guided synthesis of self-stabilizing algorithms in symmetric networks. We have fully implemented our technique and successfully synthesized solutions to maximal matching, three coloring, and maximal independent set problems for ring and line topologies.     

Electrically connected resonant optical antennas

Electrically connected resonant optical antennas hold promise for the realization of highly efficient nanoscale electro-plasmonic devices that rely on a combination of electric fields and local near-field intensity enhancement. Here we demonstrate the feasibility of such a concept by attaching leads to the arms of a two-wire antenna at positions of minimal near-field intensity with negligible influence on the antenna resonance. White-light scattering experiments in accordance with simulations show that the optical tunability of connected antennas is fully retained. Analysis of the electric properties demonstrates that in the antenna gaps direct current (DC) electric fields of 10(8) V/m can consistently be achieved and maintained over extended periods of time without noticeable damage.     

Enhancing digital documents by including 3D-models

Due to their simplicity, triangle meshes are used to represent geometric objects in many applications. Since the number of triangles often goes beyond the capabilities of computer graphics hardware and the transmission time of such data is often inappropriately high, a large variety of mesh simplification algorithms has been proposed in the last years. In this paper we identify major requirements for the practical usability of general purpose mesh reduction algorithms to enable the integration of triangle meshes into digital documents. The driving idea is to understand mesh reduction algorithms as a software extension to make more complex meshes accessible with limited hardware resources (regarding both transmission and display). We show how these requirements can be efficiently satisfied and discuss implementation aspects in detail. We present a mesh decimation scheme that fulfills these design goals and which has already been evaluated by several users from different application areas. We apply this algorithm to typical mesh data sets to demonstrate its performance.