On a class of Riemann surfaces

It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.     

A parallel extended GCD algorithm

A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O(n/logn) time using at most n¹⁺ processors on CRCW PRAM. Sorenson and Chor and Goldreich both use a modular approach which consider the least significant bits. By contrast, our algorithm only deals with the leading bits of the integers u and v, with uv. This approach is more suitable for extended GCD algorithms since the coefficients of the extended version a and b, such that au+bv=gcd(u,v), are deeply linked with the order of magnitude of the rational v/u and its continuants. Consequently, the computation of such coefficients is much easier.     

BMO from dyadic BMO via expectations on product spaces of homogeneous type

Using the random dyadic lattices developed by Hytönen and Kairema, we build up a bridge between BMO and dyadic BMO, and hence one between VMO and dyadic VMO, via expectations over dyadic lattices on spaces of homogeneous type, including both the one-parameter and product cases. We also obtain a similar relationship between _Ap$A_p$ and dyadic _Ap$A_p$, as well as one between the reverse Hölder class _RHp${\mathit{RH}}_p$ and dyadic _RHp${\mathit{RH}}_p$, via geometric–arithmetic expectations. These results extend the earlier theory along this line, developed by Garnett, Jones, Pipher, Ward, Xiao and Treil, to the more general setting of spaces of homogeneous type in the sense of Coifman and Weiss.     

On the computation of the hull number of a graph

Let G be a graph. If u,v∈V(G), a u-vshortest path of G is a path linking u and v with minimum number of edges. The closed interval I[u,v] consists of all vertices lying in some u-v shortest path of G. For S⊆V(G), the set I[S] is the union of all sets I[u,v] for u,v∈S. We say that S is a convex set if I[S]=S. The convex hull of S, denoted I_h[S], is the smallest convex set containing S. A set S is a hull set of G if I_h[S]=V(G). The cardinality of a minimum hull set of G is the hull number of G, denoted by hn(G). In this work we prove that deciding whether hn(G)≤k is NP-complete.We also present polynomial-time algorithms for computing hn(G) when G is a unit interval graph, a cograph or a split graph.     

Bandwidth packing with priority classes

The bandwidth packing problem is defined as the selection and routing of messages from a given list of messages with prespecified requirements on demand for bandwidth. The messages have to be routed over a network with given topology so that the generated revenue is maximized. Messages to be routed are classified into two priority classes. An integer programming based formulation of this problem is proposed and a Lagrangean relaxation based methodology is described for solving this problem. A general purpose heuristic is then developed for generating feasible solutions of good quality. Several numerical experiments are conducted using a number of problem parameters such as number of messages, ratio of messages for lower and higher priority classes, capacity of links, and demand distribution of messages belonging to different classes and high quality solutions to the priority bandwidth packing problem are generated under the different situations.     

二元高阶Lipschitz函数类和二重Fourier级数

利用二元函数的(r,s)阶差分和二元连续模函数定义了二元周期函数的高阶Lipschitz函数类Λr,s(ω)和λr,s(ω),并且从函数Fourier级数的系数出发,在复数域内给出了函数属于二元周期函数类的充分条件,在实数域内给出了函数属于二元周期函数类的充要条件.     

Sterically Allowed H-type Supramolecular Polymerizations

The functionalization of π-conjugated scaffolds with sterically demanding substituents is a widely used tactic to suppress cofacial (H-type) stacking interactions, which may even inhibit self-assembly. Contrary to expectations, we demonstrate herein that increasing steric effects can result in an enhanced thermodynamic stability of H-type supramolecular polymers. In our approach, we have investigated two boron dipyrromethene (BODIPY) dyes with bulky phenyl ( 2 ) and mesityl ( 3 ) meso-substituents and compared their self-assembly in nonpolar media with that of a parent meso-methyl BODIPY 1 lacking bulky groups. While the enhanced steric demand induces pathway complexity, the superior thermodynamic stability of the H-type pathways can be rationalized in terms of additional enthalpic gain arising from intermolecular C−H⋅⋅⋅F−B interactions of the orthogonally arranged aromatic substituents, which overrule their inherent steric demand. Our findings underline the importance of balancing competing non-covalent interactions in self-assembly.     

合班教学模式下定制化案例在医学化学绪论课中的应用及效果评价

合班授课教学模式下最大的问题在于难以兼顾各专业实施教学,导致难以激发学员的学习兴趣,定制与专业相关的教学案例恰好能够解决上述问题。本文精选骨质疏松症及新生儿黄疸这两个医学案例,重点探讨了如何贴近护理和生物医学工程专业的需求,定制化设计这两个医学案例,并在医学化学绪论课中实施;实施后通过平时的访谈和期末考试医学应用题的得分统计情况发现,这种定制化的案例教学能够从本质上激发学员的学习热情,也能达到合班教学中兼顾各专业的目的。     

Decidability of Some Classes of Modal Logic

We describe a modal sequential calculus some modal rules of which do not contain duplications of the main formula. We also prove its equivalence to the modal calculus S4 and the decidability of some classes of formulas containing only oneplace predicate variables.     

Glivenko Classes of Sequents for Temporal Logic with Time Gaps

Let LB be a sequent calculus of the first-order classical temporal logic TB with time gaps. Let, further, LBJ be the intuitionistic counterpart of LB. In this paper, we consider conditions under which a sequent is derivable in the calculus LBJ if and only if it is derivable in the calculus LB. Such conditions are defined for sequents with one formula in the succedent (purely Glivenko -classes) and for sequents with the empty succedent (Glivenko -classes).