EXISTENCE OF GENERALIZED WEAKLY SOLUTIONS OF DIFFERENTIAL EQUATIONS IN PRODUCT SPACES

In this paper, by using Lyapunov function and weak noncompactness conditions, we give an existence theorem of generalized weakly solutions of Cauchy problem of differential equations in product spaces.     

BOUNDEDNESS OF VECTOR-VALUED CALDERN-ZYGMUND OPERATORS ON HERZ SPACES WITH NON-DOUBLING MEASURES

In the paper we obtain vector-valued inequalities for Calder6n-Zygmund operator, simply CZO on Herz space and weak Herz space. In particular.we obtain vector-valued inequalities for CZO on Lq(Rd, |x|αdμ) space, with 1< q <∞, -n <α< n(q -1), and on L1,∞(Rd,|x|αdμ) space, with -n <α< 0.     

Synthesis of self‐photosensitizing polyesters containing donor–acceptor norbornadiene moieties and benzophenone groups and their photochemical reactions

The ring‐opening copolymerization of a glycidyl ester derivative having a benzophenone group and the donor–acceptor norbornadiene (D‐A NBD) dicarboxylic acid, 5‐(4‐methoxyphenyl)‐1,4,6,7,7‐pentamethyl‐2,5‐norbornadiene‐2,3‐dicarboxylic acid, monoglycidyl ester derivatives with D‐A NBD dicarboxylic anhydride using tetraphenylphosphonium bromide as a catalyst proceeded smoothly to give novel self‐photosensitizing NBD polymers in good yields. The molecular weight of these polyesters was about 4,000, and lower than that of analogous NBD polymers having no benzophenone group. All the synthesized NBD polymers isomerized smoothly to the corresponding quadricyclane (QC) polymers upon UV irradiation in tetrahydrofuran (THF) solution and in the film state. The rate of the photoisomerization of the D‐A NBD moieties in these polymers was higher than that of the D‐A NBD moieties in the polymer having no photosensitizing group. Furthermore, the rate of the photoisomerization of the D‐A NBD moieties in these polymers was also higher than that of the NBD polymer with low molecular weight photosensitizer in dilute solution. The photo‐irradiated polymers having QC moieties released thermal energies of 146–180 J/g. The D‐A NBD moieties contained in these NBD polymers possessed fair to good fatigue resistance. The degradation of the NBD moieties in these polymers was 15–30% after 50 repeated cycles of interconversion. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 2978–2988, 2007     

单位球上不同Privalov空间之间的复合算子

利用η-Carleson测度给出了单位球上不同Privalov以及不同加权Bergman-Privalov空间之间的复合算子是度量有界或度量紧的充要条件,并给出了一些函数理论方面的刻画．     

Boundary conditions of Sturm-Liouville operators with mixed spectra

We study bounds on averages of spectral functions corresponding to Sturm-Liouville operators on the half line for different boundary conditions. As a consequence constraints are obtained which imply existence of singular spectrum embedded in a.c. spectrum for sets of boundary conditions with positive measure and potentials vanishing in an interval [0,N]. These constraints are related to estimates on the measure of sets where the spectral density is positive.     

Propagator matrices as matrices of power''s series. II. It''s relationship with HF''s stability problem and alternative solutions

Some non-singlet quasi-instabilities (QIs) cases that arise in the calculation of NMR-J parameters are analyzed within response theory. The relationship between ‘very close to zero’ eigenvalues of the principal propagator and the rate of convergency for specific coupling pathways is shown by a power series implemented to calculate the principal propagator matrix. A natural criterion for the analysis of the stability problem emerges from that series. This is more general and accurate compared with previous proposals. Its relationship with π-type molecular orbitals is given. We present an alternative scheme to minimize the effects of non-singlet QIs in such a way that the NMR-J parameters become close to the best theoretical calculations for H₂CX (X=CH₂, NH and O).     

截面体与凸体的包含测度

本文建立了E^n中的凸体与其位似体的包含测度的相等关系，同时给出了凸体Minkowski和的包含测度的估计。最后证明了E^3中的关于原点对称的旋转椭球与其截面体相似的充要条件是K为以原点为心的球。     

Schwinger Formula Revisited

We apply the formal W.K.B. method in the complex plane to the quantum field theory to obtain the Schwinger formula for spin and spinless particles; i.e., we obtain the probability that the vacuum state remains unchanged in presence of a constant electric field. Finally, from Schwinger formula we calculate the probability that n pairs are produced.     

Flow Search Approach and New Bounds for the m-Step Linear Conjugate Gradient Algorithm

A flow search approach is presented in this paper. In the approach, each iterative process involves a subproblem, whose variables are the stepsize parameters. Every feasible solution of the subproblem corresponds to some serial search stages, the stepsize parameters in different search stages may interact mutually, and their optimal values are determined by evaluating the total effect of the interaction. The main idea of the flow search approach is illustrated via the minimization of a convex quadratic function. Based on the flow search approach, some properties of the m-step linear conjugate gradient algorithm are analyzed and new bounds on its convergence rate are also presented. Theoretical and numerical results indicate that the new bounds are better than the well-known ones.     

Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

We consider the parameterized problem, whether for a given set  of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time  . The results are based on problem kernelization and a new “geometric ( -separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.”