人工调控微结构压电驻极体的热稳定性和电荷动态特性

利用表面带有周期性结构的硬质模板,通过冷压工艺将周期结构图案复制到多孔聚四氟乙烯(PTFE)薄膜表面,再经过热黏合工艺与致密氟化乙丙烯共聚物(FEP)薄膜复合,制备出了高度有序的微孔结构复合膜,并用电晕充电的方法对复合膜进行极化处理,最终获得氟聚合物复合膜压电驻极体.借助对这类复合膜压电驻极体介电谐振谱的测量,得到了材料的杨氏模量.并利用等温热老化工艺对它们的压电系数d33的热稳定性进行了考察.最后通过短路热刺激放电谱的测量和分析,讨论了该复合膜在热老化处理后的电荷动态 关键词： 有序结构 压电驻极体 压电性 电荷动态特性     

The primitive matrices of sandwich semigroups of generalized circulant Boolean matrices

Let Gn（C） be the sandwich semigroup of generalized circulant Boolean matrices with the sandwich matrix C and Gc（Jr~） the set of all primitive matrices in Gn（C）. In this paper, some necessary and sufficient conditions for A in the semigroup Gn（C） to be primitive are given. We also show that Gc（Jn） is a subsemigroup of Gn（C）.     

A Connes-amenable, dual Banach algebra need not have a normal, virtual diagonal

Let be a locally compact group, and let denote the space of weakly almost periodic functions on . We show that, if is a -group, but not compact, then the dual Banach algebra does not have a normal, virtual diagonal. Consequently, whenever is an amenable, non-compact -group, is an example of a Connes-amenable, dual Banach algebra without a normal, virtual diagonal. On the other hand, there are amenable, non-compact, locally compact groups such that does have a normal, virtual diagonal.

     

The valuations of the near hexagons related to the Witt designs S(5,6,12) and S(5,8,24)

Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??₁ and ??₂, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??₁ or ??₂, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??₁ or ??₂. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, t_i (0 ≤ i ≤ d) satisfy (s, t₂, t₃) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006     

Approximations of solutions to neutral functional differential equations with nonlocal history conditions

This work is concerned with a class of neutral functional differential equations with nonlocal history conditions in a Hilbert space. The approximation of solution to a class of such problems is studied. Moreover, the convergence of Faedo-Galerkin approximation of solution is shown. For illustration, an example is worked out.     

Distance regularity of Kerdock codes

A code is called distance regular, if for every two codewords x, y and integers i, j the number of codewords z such that d(x, z) = i and d(y, z) = j, with d the Hamming distance, does not depend on the choice of x, y and depends only on d(x, y) and i, j. Using some properties of the discrete Fourier transform we give a new combinatorial proof of the distance regularity of an arbitrary Kerdock code. We also calculate the parameters of the distance regularity of a Kerdock code.     

Frequency modules and nonexistence of quasi-periodic solutions of nonlinear evolution equations

This paper gives lower estimates for the frequency modules of almost periodic solutions to equations of the form , where A generates a strongly continuous semigroup in a Banach space , F(t,x) is 2π-periodic in t and continuous in (t,x), and f is almost periodic. We show that the frequency module ℳ(u) of any almost periodic mild solution u of (*) and the frequency module ℳ(f) of f satisfy the estimate e ^{2π iℳ(f)}⊂e ^{2π iℳ(u)}. If F is independent of t, then the estimate can be improved: ℳ(f)⊂ℳ(u). Applications to the nonexistence of quasi-periodic solutions are also given.     

Strongly regular locally <Emphasis Type="Italic">GQ</Emphasis>(4,<Emphasis Type="Italic">t</Emphasis>)-graphs

Amply regular with parameters (v, k, λ, μ) we call an undirected graph with v vertices in which the degrees of all vertices are equal to k, every edge belongs to λ triangles, and the intersection of the neighborhoods of every pair of vertices at distance 2 contains exactly μ vertices. An amply regular diameter 2 graph is called strongly regular. We prove the nonexistence of amply regular locally GQ(4,t)-graphs with (t,μ) = (4, 10) and (8, 30). This reduces the classification problem for strongly regular locally GQ(4,t)-graphs to studying locally GQ(4, 6)-graphs with parameters (726, 125, 28, 20).     

Invariant ordering on the simply connected covering of the Shilov boundary of a symmetric domain

The Shilov boundary of a symmetric domain D = G/K of tube type has the form G/P, where P is a maximal parabolic subgroup of the group G. We prove that the simply connected covering of the Shilov boundary possesses a unique (up to inversion) invariant ordering, which is induced by the continuous invariant ordering on the simply connected covering of G and can readily be described in terms of the corresponding Jordan algebra.     

Rumor spreading on random regular graphs and expanders

Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well‐studied push model. Assume that initially one node in a given network holds some piece of information. In each round, every one of the informed nodes chooses independently a neighbor uniformly at random and transmits the message to it. In this paper we consider random networks where each vertex has degree d ≥ 3, i.e., the underlying graph is drawn uniformly at random from the set of all d ‐regular graphs with n vertices. We show that with probability 1 ‐ o(1) the push model broadcasts the message to all nodes within (1 + o(1))C_d lnn rounds, where Particularly, we can characterize precisely the effect of the node degree to the typical broadcast time of the push model. Moreover, we consider pseudo‐random regular networks, where we assume that the degree of each node is very large. There we show that the broadcast time is (1 + o(1))Clnn with probability 1 ‐ o(1), where \begin{align*}C = \lim_{d\to\infty}C_d = \frac{1}{\ln2} + 1\end{align*}. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013