Long-time dynamics of von Karman semi-flows with non-linear boundary/interior damping

We study von Karman evolution equations with non-linear dissipation and with partially clamped and partially free boundary conditions. Two distinctive mechanisms of dissipation are considered: (i) internal dissipation generated by non-linear operator, and (ii) boundary dissipation generated by shear forces friction acting on a free part of the boundary. The main emphasis is given to the effects of boundary dissipation. Under suitable hypotheses we prove existence of a compact global attractor and finiteness of its fractal dimension. We also show that any solution is stabilized to an equilibrium and estimate the rate of the convergence which, in turn, depends on the behaviour at the origin of the functions describing the dissipation.     

Stability radii of positive linear Volterra-Stieltjes equations

We study stability radii of linear Volterra-Stieltjes equations under multi-perturbations and affine perturbations. A lower and upper bound for the complex stability radius with respect to multi-perturbations are given. Furthermore, in some special cases concerning the structure matrices, the complex stability radius can precisely be computed via the associated transfer functions. Then, the class of positive linear Volterra-Stieltjes equations is studied in detail. It is shown that for this class, complex, real and positive stability radius under multi-perturbations or multi-affine perturbations coincide and can be computed by simple formulae expressed in terms of the system matrices. As direct consequences of the obtained results, we get some results on robust stability of positive linear integro-differential equations and of positive linear functional differential equations. To the best of our knowledge, most of the results of this paper are new.     

Resolvability properties via independent families

The authors give a consistent affirmative response to a question of Juhász, Soukup and Szentmiklóssy: If GCH fails, there are (many) extraresolvable, not maximally resolvable Tychonoff spaces. They show also in ZFC that for ω<λ?κ, no maximal λ-independent family of λ-partitions of κ is ω-resolvable. In topological language, that theorem translates to this: A dense, ω-resolvable subset of a space of the form (DI(λ)) is λ-resolvable.     

Chromatic polynomial, q-binomial counting and colored Jones function

We define a q-chromatic function and q-dichromate on graphs and compare it with existing graph functions. Then we study in more detail the class of general chordal graphs. This is partly motivated by the graph isomorphism problem. Finally we relate the q-chromatic function to the colored Jones function of knots. This leads to a curious expression of the colored Jones function of a knot diagram K as a chromatic operator applied to a power series whose coefficients are linear combinations of long chord diagrams. Chromatic operators are directly related to weight systems by the work of Chmutov, Duzhin, Lando and Noble, Welsh.     

Sol-gel preparation and optical properties of SiO2-Ta2O5 glass

Tantalum-doped silica glass was fabricated by the sol-gel process in order to obtain a glass with a high refractive index for optical use. A crack-free, clear glass rod was successfully prepared from a low-density gel and used as the core material for fabricating optical fibers. Transmission loss in the fabricated fibers was high, in the range of 10³-10⁴ dB/km, which may be caused by coloration due to the multivalency of tantalum; however, the loss was reduced by nearly one order of magnitude by heat treatment at 800 °C, that is, to 75 dB/km at a wavelength of 0.8 μm.     

Low-lying states of 6He studied via the 6Li(t,3He)6He reaction

We present the recent experimental results on the ⁶He structure studied by the ⁶Li(t, ³He)⁶He reaction at 336 MeV. Above the conspicuous peaks for ground and first excited states for ⁶He, we have observed a broad structures at E _x∼ 5 MeV, and E _x∼ 15 MeV. The angular distribution of this structure exhibits the dominance of a ΔL = 1 transition, indicating the existence of intruder dipole states at low excitation energies in ⁶He. A slight admixture of positive-parity states in this structure has been indicated as well. Received: 1 May 2001 / Accepted: 4 December 2001     

硼砂与氯化铵合成hBN反应机理的研究

 研究了以硼砂、氯化铵为原料在氨气气氛下合成hBN 的反应机理。指出氯化铵在反应中的主要作用是与硼砂反应形成可阻止硼砂颗粒团聚的高熔点膜层；而氨气的主要作用就是提供大量参与反应的NH₃分子，增加了反应几率；新生成的hBN则进一步隔离高度熔融的硼砂团粒，防止玻璃相的生成。     

类氢类氦类锂镁离子双电子复合的旁观电子角动量研究

类氢类氦类锂镁离子经中间双激发态进行的双电子复合过程在研究惯性约束聚变电子温度中占有很重要的地位.用准相对论方法计算了双电子复合经不同Rydberg态跃迁通道的复合速率系数,并给出不同离化度离子的双电子复合速率系数随电子温度的变化规律.显示出离子的相关能对峰值的电子温度有很大影响,当类氢离子跃迁通道的旁观电子角动量为1时双电子复合系数最大,而类锂离子是旁观电子角动量为3时最大. 关键词： 双电子复合 镁离子 角动量     

On the maximum cardinality search lower bound for treewidth

The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.