Synthesis and characterization of polythiophene block copolymer and fullerene derivative capable of “three‐point” complementary hydrogen bonding interactions and their application in bulk‐heterojunction solar cells

We report the synthesis and characterization of a polythiophene block copolymer (P4) selectively functionalized with diaminopyrimidine moieties and a thymine tethered fullerene derivative (F1). Self‐assembly between P4 and F1 through “three‐point” complementary hydrogen bonding is studied by ¹H NMR spectroscopy and differential scanning calorimetry. A large Stern‐Volmer constant (K_SV) of 1.2 × 10⁵ M^?1 is observed from fluorescence quenching experiments, revealing strong complexation between these two components. Solar cells employing P4 and F1 at different weight ratios as active layers are fabricated and tested; corresponding thin film morphologies are studied in detail by optical imaging and atomic force microscopy. Correlations between polymer complex structures, film morphologies, and device performance are discussed. Thermal stability of benchmark poly(3‐hexylthiophene) bulk heterojunction solar cells is found to be improved by the addition of a few weight percent of P4/F1 complexes as compatibilizers. © 2013 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2013 , 51, 3339–3350     

Numerical semigroups with many gaps of the same parity

Let g _e (S) (respectively, g _o (S)) be the number of even (respectively, odd) gaps of a numerical semigroup S. In this work we study and characterize the numerical semigroups S that verify 2|g _e (S)−g _o (S)|+1∈S. As a consequence we will see that every numerical semigroup can be represented by means of a numerical semigroup with maximal embedding dimension with all its minimal generators odd. The first author is supported by the project MTM2007-62346 and FEDER funds. The authors want to thank P.A. García-Sánchez and the referee for their comments and suggestions.     

Randomized k-server algorithms for growth-rate bounded graphs

The k-server problem is a fundamental online problem where k mobile servers should be scheduled to answer a sequence of requests for points in a metric space as to minimize the total movement cost. While the deterministic competitive ratio is at least k, randomized k-server algorithms have the potential of reaching o(k)-competitive ratios. Prior to this work only few specific cases of this problem were solved. For arbitrary metric spaces, this goal may be approached by using probabilistic metric approximation techniques. This paper gives the first results in this direction, obtaining o(k)-competitive ratio for a natural class of metric spaces, including d-dimensional grids, and wide range of k.     

Non-linear ground state representations and sharp Hardy inequalities

We determine the sharp constant in the Hardy inequality for fractional Sobolev spaces. To do so, we develop a non-linear and non-local version of the ground state representation, which even yields a remainder term. From the sharp Hardy inequality we deduce the sharp constant in a Sobolev embedding which is optimal in the Lorentz scale. In the appendix, we characterize the cases of equality in the rearrangement inequality in fractional Sobolev spaces.     

The use of phase codes in ultrasound imaging: SNR gain and bandwidth requirements

Most of the literature on coded excitation describes the signal-to-noise ratio gain of a coded waveform in terms of the time-bandwidth product. We have shown that in the context of ultrasound imaging, the expression for the SNR gain provided by matched filtering a coded waveform, can be reduced to the total number of chips in the transmit signal. Hence, the SNR gain is independent of both the bandwidth and the duration of a single-chip. This concept is described in detail, clarifying this seeming contradiction. The impact of bandwidth and pulse duration on the SNR, SNR gain and axial resolution is described. Bandwidth requirements and the impact of regulatory peak-power limitations are also addressed.     

Straight line embeddings of cubic planar graphs with integer edge lengths

We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:270‐274, 2008     

A definable nonstandard enlargement

This article establishes the existence of a definable (over ZFC), countably saturated nonstandard enlargement of the superstructure over the reals. This nonstandard universe is obtained as the union of an inductive chain of bounded ultrapowers (i.e. bounded with respect to the superstructure hierarchy). The underlying ultrafilter is the one constructed by Kanovei and Shelah [10]. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Carleman estimates and unique continuation property for the anisotropic differential-operator equations

The unique continuation theorems for the anisotropic partial differential-operator equations with variable coeffcients in Banach-valued Lp-spaces are studied.To obtain the uniform maximal regularity and the Carleman type estimates for parameter depended differential-operator equations,the suffcient conditions are founded.By using these facts,the unique continuation properties are established.In the application part,the unique continuation properties and Carleman estimates for finite or infinite systems of quasielliptic partial differential equations are studied.     

A Smoothing-Type Algorithm for Solving Linear Complementarity Problems with Strong Convergence Properties

In this paper, we construct an augmented system of the standard monotone linear complementarity problem (LCP), and establish the relations between the augmented system and the LCP. We present a smoothing-type algorithm for solving the augmented system. The algorithm is shown to be globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, if the LCP has a solution, then the algorithm either generates a maximal complementary solution of the LCP or detects correctly solvability of the LCP, and in the latter case, an existing smoothing-type algorithm can be directly applied to solve the LCP without any additional assumption and it generates a maximal complementary solution of the LCP; and that if the LCP is infeasible, then the algorithm detect correctly infeasibility of the LCP. To the best of our knowledge, such properties have not appeared in the existing literature for smoothing-type algorithms. This work was partially supported by the National Natural Science Foundation of China (Grant No. 10571134), the Natural Science Foundation of Tianjin (Grant No. 07JCYBJC05200), and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.     

一种用于DRM的指纹嵌入和解密集成的实现方法研究

多播环境下,指纹嵌入应用技术是目前信息安全研究的焦点.在信源传输端嵌入指纹影响了系统的可扩展性;而在接收端嵌入指纹,系统增加了对用户的要求.综合考虑,本文针对DRM提出了一种新的指纹嵌入和解密集成的一体化技术实现方法.该方法嵌入的指纹是不对称密钥结构的相关函数,能满足通信时系统对实时性和鲁棒性的要求.