Photoinitiated curing of mono‐ and bifunctional epoxides by combination of active chain end and activated monomer cationic polymerization methods

Photoinitiated cationic polymerization of mono‐ and bifunctional epoxy monomers, namely cyclohexeneoxide (CHO), 4‐epoxycyclohexylmethyl‐3′,4′‐epoxycyclohexanecarboxylate (EEC), respectively by using sulphonium salts in the presence of hydroxylbutyl vinyl ether (HBVE) was studied. The real‐time FTIR spectroscopic, gel content determination, and thermal characterization studies revealed that both hydroxyl and vinyl ether functionalities of HBVE take part in the polymerization. During the polymerization, HBVE has the ability to react via both active chain end (ACE) and activated monomer mechanisms through its hydroxyl and vinyl ether functionalities, respectively. Thus, more efficient curing was observed with the addition of HBVE into EEC‐containing formulations. It was also demonstrated that HBVE is effective in facilitating the photoinduced crosslinking of monofunctional epoxy monomer, CHO in the absence of a conventional crosslinker. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 4914–4920, 2007     

Orders of Indescribable Sets

We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal.     

求解通信网节点间全部路由的逻辑代数化算法

经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.     

Achievable sets, brambles, and sparse treewidth obstructions

One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

环面上具有间断梯度的势函数的模拟退火

本文证明了环面上具有间断梯度的势函数的模拟退火过程：dXt=-VU(Xt)dt √2dWt概率收敛到势函数的全局极小集附近。     

Parametric and Non Homogeneous Semi-Markov Process for HIV Control

In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed. A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct times and follow-up has an impact on the evolution of patients.      

An effect of application of chiral aluminium alkoxides and amides as adducts to zirconium catalyzed carbo- and cycloalumination of olefins

This paper is dedicated to a study of properties of the following novel optically active organoaluminium compounds (OACs): (1S,2S)-l,7,7-trimethyl-2-[(dialkylalumina)oxy]-bicyclo[2.2.1]heptanes and (1S)-N-(dialkylalumina)-6,7-dimethoxy-1-methyl-1,2,3,4- tetrahydroisoquinolines. The synthesis of the chiral OACs was carried out in the reaction of either natural camphor or salsolidine with both AlEt₃ and i-Bu₂AlH. The main goal of the research was to investigate the stereodifferentiating activity of the chiral OACs in the olefin carbo- and cycloalumination reactions, catalyzed by Cp₂ZrCl₂.     

Isotone relations revisited

We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem.     

An approximate proximal-extragradient type method for monotone variational inequalities

Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method.