On many‐sorted algebraic closure operators

A theorem of Birkhoff‐Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many‐sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many‐sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On a Definitizable Analog of the Trigonometric Moment Problem Generating an Indefinite Toeplitz Form

We prove the existence of an integro-polynomial representation for a sequence of numbers such that there exists a difference operator mapping this sequence to a sequence that generates the solvable trigonometric moment problem. A similar result related to the power moment problem was given in [12].     

Kuratowski Convergence of Holomorphic Functions

The notion of Kuratowski convergence is applied to describe a kind of convergence in the context of holomorphic functions. We associate it to a convenient topology, explore its relation with the compact-open topology, thus providing a new set theoretic point of view of this classic topology, and present it in the framework of set-valued mappings.     

高速色散补偿系统中喇曼放大器性能研究

利用喇曼放大器的非线性偏微分耦合方程组,对带喇曼放大器的色散补偿系统进行了仿真,并与传统的仿真方法进行了比较.结果表明:在色散完全补偿系统中,当传输速率较高时,忽略色散后的传统仿真方法的结果,与采用色散补偿技术后使整个系统色散为零的仿真结果有一定偏差,此时不能忽略色散的作用.还对前补偿系统和后补偿系统进行了研究,利用Q值性能判别法,分别得到了信号光脉冲的最佳占空比和最佳脉冲阶数.     

Stable nonequilibrium probability densities and phase transitions for meanfield models in the thermodynamic limit

A nonlinear Fokker-Planck equation is derived to describe the cooperative behavior of general stochastic systems interacting via mean-field couplings, in the limit of an infinite number of such systems. Disordered systems are also considered. In the weak-noise limit; a general result yields the possibility of having bifurcations from stationary solutions of the nonlinear Fokker-Planck equation into stable time-dependent solutions. The latter are interpreted as non-equilibrium probability distributions (states), and the bifurcations to them as nonequilibrium phase transitions. In the thermodynamic limit, results for three models are given for illustrative purposes. A model of self-synchronization of nonlinear oscillators presents a Hopf bifurcation to a time-periodic probability density, which can be analyzed for any value of the noise. The effects of disorder are illustrated by a simplified version of the Sompolinsky-Zippelius model of spin-glasses. Finally, results for the Fukuyama-Lee-Fisher model of charge-density waves are given. A singular perturbation analysis shows that the depinning transition is a bifurcation problem modified by the disorder noise due to impurities. Far from the bifurcation point, the CDW is either pinned or free, obeying (to leading order) the Grüner-Zawadowki-Chaikin equation. Near the bifurcation, the disorder noise drastically modifies the pattern, giving a quenched average of the CDW current which is constant. Critical exponents are found to depend on the noise, and they are larger than Fisher's values for the two probability distributions considered.     

A constructive characterization of the split closure of a mixed integer linear program

Two independent proofs of the polyhedrality of the split closure of mixed integer linear program have been previously presented. Unfortunately neither of these proofs is constructive. In this paper, we present a constructive version of this proof. We also show that split cuts dominate a family of inequalities introduced by Köppe and Weismantel.     

Diblock copolymers based on allyl methacrylate: Synthesis,characterization, and chemical modification

Different diblock copolymers constituted by one segment of a monomer supporting a reactive functional group, like allyl methacrylate (AMA), were synthesized by atom transfer radical polymerization (ATRP). Bromo‐terminated polymers, like polystyrene (PS), poly(methyl methacrylate) (PMMA), and poly(butyl acrylate) (PBA) were employed as macroinitiators to form the other blocks. Copolymerizations were carried out using copper chloride with N,N,N′,N″,N″‐pentamethyldiethylenetriamine (PMDETA) as the catalyst system in benzonitrile solution at 70 °C. At the early stage, the ATRP copolymerizations yielded well‐defined linear block copolymers. However, with the polymerization progress a change in the macromolecular architecture takes place due to the secondary reactions caused by the allylic groups, passing to a branched and/or star‐shaped structure until finally yielding gel at monomer conversion around 40% or higher. The block copolymers were characterized by means of size exclusion chromatography (SEC), ¹H NMR spectroscopy, and differential scanning calorimetry (DSC). In addition, one of these copolymers, specifically P(BA‐b‐AMA), was satisfactorily modified through osmylation reaction to obtain the subsequent amphiphilic diblock copolymer of P(BA‐b‐DHPMA), where DHPMA is 2,3‐dihydroxypropyl methacrylate; demonstrating the feasibility of side‐chain modification of the functional obtained copolymers. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 3538–3549, 2007     

三种群食物链交错扩散模型的整体

本文应用能量估计方法和Gagliardo-Nirenberg型不等式证明了一类强耦合反应扩散系统整体解的存在性和一致有界性，该系统是带自扩散和交错扩散项的三种群Lotka-Volterra食物链模型．通过构造Lyapunov函数给出了该模型正平衡点全局渐近稳定的充分条件．     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.