Some Estimates for $θ$-Type Calderόn–Zygmund Operators and Linear Commutators on Certain Weighted Amalgam Spaces

In this paper, we first introduce some new kinds of weighted amalgam spaces. Then we discuss the strong type and weak type estimates for a class of Calderόn–Zygmund type operators $T_θ$ in these new weighted spaces. Furthermore, the strong type estimate and endpoint estimate of linear commutators $[b, T_θ]$ formed by $b$ and $T_θ$ are established. Also we study related problems about two-weight, weak type inequalities for $T_θ$ and $[b, T_θ]$ in the weighted amalgam spaces and give some results.     

Set controllability of Markov jump switching Boolean control networks and its applications

In this article, a novel method is proposed for investigating the set controllability of Markov jump switching Boolean control networks (MJSBCNs). Specifically, the switching signal is described as a discrete-time homogeneous Markov chain. By resorting to the expectation and switching indicator function, an expectation system is constructed. Based on the expectation system, a novel verifiable condition is established for solving the set reachability of MJSBCNs. With the newly obtained results on set reachability, a necessary and sufficient condition is further derived for the set controllability of MJSBCNs. The obtained results are applied to Boolean control networks with Markov jump time delays. Examples are demonstrated to justify the theoretical results.     

A note on the weighted norm inequality for the one-sided maximal operator

Let be the one-sided maximal function. In this note we obtain some necessary and sufficient conditions in order that the weighted weak type inequality holds for . Meanwhile, some necessary or sufficient conditions for the weighted inequality for are given.

     

Countable network weight and multiplication of Borel sets

A space Borel multiplies with a space if each Borel set of is a member of the -algebra in generated by Borel rectangles. We show that a regular space Borel multiplies with every regular space if and only if has a countable network. We give an example of a Hausdorff space with a countable network which fails to Borel multiply with any non-separable metric space. In passing, we obtain a characterization of those spaces which Borel multiply with the space of countable ordinals, and an internal necessary and sufficient condition for to Borel multiply with every metric space.

     

Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.     

The matched queueing network PH/M/c→oPH/PH/1

We consider a matched queueing network PH/M/coPH/PH/1, where the output of the first subsystem PH/M/c is regarded as one of the inputs of the second subsystem and matched with another input of PH-renewal process, and they are served by a single server with PH-service-distribution. The stationary state probabilities, the distribution of the virtual waiting times in the two subsystems, and the distribution of the total virtual waiting time are derived.The work was supported by the Max-Planck-Gesellschaft, Germany, and the Chinese Academy ofSciences.     

Equilibrium conformations of polymer chains Part II. Conformons in networks

With regard to the ideal network it is shown that the concept ofN non-interacting polymer chains can be transformed in a problem of non interacting excitations (called conformons) for rubber elasticity. Modelling the interaction on permanent crosslinks as a scattering problem and taking the finite chain length into account, an interpretation of the second Mooney coefficient can be given. There is some evidence that the junctions move by constrained self diffusion.Dedicated to Prof. Dr. W. Ruland on the occasion of his 60th birthday.     

阴离子嵌段共聚的交联聚苯乙烯的网络链长多分散性与网络结构非均一性

用链长分布不同的活性聚苯乙烯子聚物与二乙烯基苯进行阴离子嵌段共聚,合成了一系列两相模型交联网络。以作者等提出的方法测定了所合成网络的结构非均一因子Z。实验测定的网络结构非均一因子Z与交联前聚苯乙烯活性链的分子量分布宽度指数d之间有平行的相应变化规律,表明所给予的非均一因子Z的物理意义是合理的。同时说明,子聚物链长分布较宽时,在网络的高交联区中除了二乙烯基苯外,还有一些对溶胀无贡献的子聚物以悬挂链的形式存在。     

人工神经元网络辅助丙烷氨氧化催化剂设计

报道了利用人工神经元网络辅助丙烷氨氧化制丙烯腈催化剂设计的研究进展结果．通过筛选得到了可以拟合该反应体系的神经元网络模型，从而使丙烷转化率和丙烯腈选择性可以表示为催化剂组成的函数，利用培训后的神经元网络模型所得到的权值文件，结合作者自编的优化程序，该网络可用于预测最优的催化剂组成．实验得到丙烯腈收率和选择性可分别达到４３．０％和５６．２４％．     

An implicit function theorem: Comment

In Ref. 1, Jittorntrum proposed an implicit function theorem for a continuous mappingF:R ⁿ ×R ^m R ⁿ, withF(x ⁰,y ⁰)=0, that requires neither differentiability ofF nor nonsingularity of _x F(x ⁰,y ⁰). In the proof, the local one-to-one condition forF(·,y):A R ⁿ R ⁿ for ally B is consciously or unconsciously treated as implying thatF(·,y) mapsA one-to-one ontoF(A, y) for ally B, and the proof is not perfect. A proof can be given directly, and the theorem is shown to be the strongest, in the sense that the condition is truly if and only if.