K(o)the-Bochner空间的凸性

本文利用K(o)the函数空间的性质以及K(o)the函数空间与K(o)the-Bochner空间的关系,讨论了K(o)the-Bochner空间E(X)的凸性,主要结果如下:(a)给出E(X)的端点的充分条件,得到了E(X)严格凸的判据,相应地推广了Lp(μ,X)以及LΦ(X)的结果;(b)讨论了E(X)的弱局部一致凸和局部完全k-凸;(c)刻画了E(X)的强凸,给出了E(X)强凸的充要条件.     

There are infinitely many limit points of the fractional parts of powers

Suppose that α > 1 is an algebraic number and ξ > 0 is a real number. We prove that the sequence of fractional partsξα ⁿ , n = 1, 2, 3, …, has infinitely many limit points except when α is a PV-number and ξ ∈ ℚ(α). For ξ = 1 and α being a rational non-integer number, this result was proved by Vijayaraghavan.     

The Isoelectric Point and the Points of Zero Charge of Fe-Al-Mg Hydrotalcite-like Compounds

The relation of the isoelectric point (IEP) and the point of zero net charge (PZNC) of the hydrotalcite-like compounds was discussed. It was found that the IEP does not equal to the PZNC and the IEP is higher than the PZNC. The structural positive charges existing in the HTlc,which cause the difference between the IEP and the PZNC. The effects of the structural positive charges of the HTlc on its IEP and PZNC are the same as the specific adsorption of metal cations.     

The spin-S Blume-Capel RG flow diagram

Using the finite-size scaling renormalization group, we obtain the two-dimensional flow diagram of the Blume-Capel model forS=1 andS=3/2. In the first case our results are similar to those of mean-field theory, which predicts the existence of first- and second-order transitions with a tricritical point. In the second case, however, our results are different. While we obtain in theS=1 case a phase diagram presenting a multicritical point, the mean-field approach predicts only a second-order transition and a critical endpoint.     

Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法

主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集．在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点．同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果．     

“Slow” active control of combustion instabilities by modification of liquid fuel spray properties

This paper describes an experimental investigation of the feasibility of using “slow” active control approaches, which “instantaneously” change liquid fuel spray properties, to suppress combustion instabilities. The objective of this control approach was to break up the feedback between the combustion process heat release and combustor pressure oscillations that drive the instability by changing the characteristics of the combustion process (e.g., the characteristic combustion time). To demonstrate the feasibility of such control, this study used a proprietary fuel injector (Nanomiser^TM), which can vary its fuel spray properties, to investigate the dependence of acoustics–combustion process coupling, i.e., the driving of combustion instabilities, upon the fuel spray properties. This study showed that by changing the spray characteristics it is possible to significantly damp combustion instabilities. Furthermore, using combustion zone chemiluminescence distributions, which were obtained by Abel’s deconvolution synchronized with measured acoustic data, it has been shown that the instabilities were mostly driven midway between the combustor centerline and wall, a short distance downstream from the flame holder, where the mean axial flow velocity is approximately zero in the vortex near the flame holder. The results of this study strongly suggest that a “slow” active control system that employs controllable fuel injectors could be effectively used to prevent the onset of detrimental combustion instabilities.     

Identifying Linking-Pin Organizations in Inter-Organizational Networks

Within the large literature on inter-organizational networks, there has been some discussion of linking-pin organizations and the role they play in integrating these networks. Based on this verbal specification of linking-pin organizations, we construct operational criteria and empirical methods for identifying these structurally important organizations in potentially large and complex inter-organizational networks. These methods are based on ideas drawn from blockmodeling, structural holes, centrality and centralization of networks, and identifying cut-points in networks. These methods are applied to a constructed example and then to real empirical inter-organizational networks. Implications and contrasts with other methods are discussed, together with some open problems.     

Sub-bundles of the complexified tangent bundle

We study embeddings of complex vector bundles, especially line bundles, in the complexification of the tangent bundle of a manifold. The aim is to understand implications of properties of interest in partial differential equations.

     

Proximality and Chebyshev sets

This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex.     

Asymptotic Distribution of Nodes for Near-Optimal Polynomial Interpolation on Certain Curves in R 2

Let E\subset \Bbb R ^s be compact and let d _n ^E denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ _n ={ \bf x _k,n } _k=1 ^dnE , n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R ² . It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore, for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes. November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001.