New salts based on imidazolium, pyrrolidinium, phosphonium, guanidinium, and ammonium cations together with the 5‐cyanotetrazolide anion [C2N5]? are reported. Depending on the nature of cation–anion interactions, characterized by XRD, the ionic liquids (ILs) have a low viscosity and are liquid at room temperature or have higher melting temperatures. Thermogravimetric analysis, cyclic voltammetry, viscosimetry, and impedance spectroscopy display a thermal stability up to 230 °C, an electrochemical window of 4.5 V, a viscosity of 25 mPa s at 20 °C, and an ionic conductivity of 5.4 mS cm?1 at 20 °C for the IL 1‐butyl‐1‐methylpyrrolidinium 5‐cyanotetrazolide [BMPyr][C2N5]. On the basis of these results, the synthesized compounds are promising electrolytes for lithium‐ion batteries. 相似文献
The dinuclear zinc complex reported by us is to date the most active zinc catalyst for the co‐polymerization of cyclohexene oxide (CHO) and carbon dioxide. However, co‐polymerization experiments with propylene oxide (PO) and CO2 revealed surprisingly low conversions. Within this work, we focused on clarification of this behavior through experimental results and quantum chemical studies. The combination of both results indicated the formation of an energetically highly stable intermediate in the presence of propylene oxide and carbon dioxide. A similar species in the case of cyclohexene oxide/CO2 co‐polymerization was not stable enough to deactivate the catalyst due to steric repulsion. 相似文献
We report morphologic changes of metallic surfaces at the onset of ablation, starting from gentle ablation to the emergence of ablation craters. The evolution of both observed melting zones and of ablation craters therein are investigated in dependence of the ablation laser fluence for nanosecond ultraviolet laser pulses. Further, consequences of crater formation for cluster synthesis within the released atomic vapor are pointed out. PACS 52.38.Mf; 79.20.Ds; 65.40.De 相似文献
Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated. 相似文献
The structure and magnetism of thin epitaxial Fe layers grown on Cu(0 0 1) is investigated by grazing scattering of fast H and He atoms. Information on the atomic structure of the film and substrate surfaces is obtained by making use of ion beam triangulation with protons. The magnetic behavior is studied via the polarization of light emitted after capture of spin-polarized electrons into excited atomic terms during scattering of He atoms. For the formation of bcc(1 1 0)-like Fe films at higher coverages, we detect differences in structural and magnetic properties for room and low temperature growth. We suggest that the crystalline structure depends on the film morphology and that Cu impurities affect the magnetic properties. 相似文献
A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.
In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.
In this paper we study a subclass of dynamic process graphs called
-output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is
-complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a
-complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion. 相似文献