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     

高斯光束在任意分布的径向梯度折射率介质中传输的计算方法

根据弱波导近似,本文建立了处理高斯光束在任意分布的径向梯度折射率介质中传输的计算方法,并具体计算和讨论了高斯光束腰斑在沿径向呈抛物型分布的介质中随传输距离的变化情况,其数值结果与解析近似符合。     

30GHz RF脉冲压缩器设计

 为得到脉宽150ns，功率超过100MW的30GHz微波脉冲，采用MSLED-II原理设计了30GHz RF-脉冲压缩器。H-Hybrid，TE₁₀0^口-TE₁₀^o模式转换器等器件都采用了新型设计，所有微波器件的设计充分考虑了高功率下的适用性，没有容易引起打火的调谐杆、容性膜片等部件。在微波器件的设计中用HFSS软件进行了详尽的模拟。加工并测试了H-Hybrid，且用在CERN的RF脉冲展宽器上。     

单模光纤波导模的傍轴传输特性

将LP01模表示成用拉盖尔-高斯模线性叠加的形式,利用柯林斯公式推导出单模光纤波导模通过傍轴ABCD光学系统的解析传输公式。用所得的解析公式对LP01模在自由空间的传输和聚焦特性作了研究,并和高斯基模进行了比较。数值计算结果表明,用高斯基模描述LP01模会产生一定误差。LP01模经过透镜聚焦后存在焦移,且焦移随着菲涅尔数传输特性的减小而增大。选择合适的菲涅尔数聚焦后,LP01模会出现长焦深,这是与聚焦的高斯模所不同的。     

On the convergence of cross decomposition

Cross decomposition is a recent method for mixed integer programming problems, exploiting simultaneously both the primal and the dual structure of the problem, thus combining the advantages of Dantzig—Wolfe decomposition and Benders decomposition. Finite convergence of the algorithm equipped with some simple convergence tests has been proved. Stronger convergence tests have been proposed, but not shown to yield finite convergence.In this paper cross decomposition is generalized and applied to linear programming problems, mixed integer programming problems and nonlinear programming problems (with and without linear parts). Using the stronger convergence tests finite exact convergence is shown in the first cases. Unbounded cases are discussed and also included in the convergence tests. The behaviour of the algorithm when parts of the constraint matrix are zero is also discussed. The cross decomposition procedure is generalized (by using generalized Benders decomposition) in order to enable the solution of nonlinear programming problems.     

A central limit theorem for generalized multilinear forms

Let X₁, …, X_n be independent random variables and define for each finite subset I {1, …, n} the σ-algebra = σ{X_i : i ε I}. In this paper -measurable random variables W_I are considered, subject to the centering condition E(W_I ) = 0 a.s. unless I J. A central limit theorem is proven for d-homogeneous sums W(n) = Σ_{I = d}W_I, with var W(n) = 1, where the summation extends over all (_n^d) subsets I {1, …, n} of size I = d, under the condition that the normed fourth moment of W(n) tends to 3. Under some extra conditions the condition is also necessary.     

A queueing system with linear repeated attempts,bernoulli schedule and feedback

We analyse a single-server retrial queueing system with infinite buffer, Poisson arrivals, general distribution of service time and linear retrial policy. If an arriving customer finds the server occupied, he joins with probabilityp a retrial group (called orbit) and with complementary probabilityq a priority queue in order to be served. After the customer is served completely, he will decide either to return to the priority queue for another service with probability ϑ or to leave the system forever with probability =1−ϑ, where 0≤ϑ<1. We study the ergodicity of the embedded Markov chain, its stationary distribution function and the joint generating function of the number of customers in both groups in the steady-state regime. Moreover, we obtain the generating function of system size distribution, which generalizes the well-knownPollaczek-Khinchin formula. Also we obtain a stochastic decomposition law for our queueing system and as an application we study the asymptotic behaviour under high rate of retrials. The results agree with known special cases. Finally, we give numerical examples to illustrate the effect of the parameters on several performance characteristics.     

Stationary Distributions of GI/M/c Queue with PH Type Vacations

We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies.     

Analysis of Queueing Systems with Synchronous Single Vacation for Some Servers

We study a multi-server M/M/c type queue with a single vacation policy for some idle servers. In this queueing system, if at a service completion instant, any d (d c) servers become idle, these d servers will take one and only one vacation together. During the vacation of d servers, the other c–d servers do not take vacation even if they are idle. Using a quasi-birth-and-death process and the matrix analytic method, we obtain the stationary distribution of the system. Conditional stochastic decomposition properties have been established for the waiting time and the queue length given that all servers are busy.     

A Heuristic for Moment-Matching Scenario Generation

In stochastic programming models we always face the problem of how to represent the random variables. This is particularly difficult with multidimensional distributions. We present an algorithm that produces a discrete joint distribution consistent with specified values of the first four marginal moments and correlations. The joint distribution is constructed by decomposing the multivariate problem into univariate ones, and using an iterative procedure that combines simulation, Cholesky decomposition and various transformations to achieve the correct correlations without changing the marginal moments.With the algorithm, we can generate 1000 one-period scenarios for 12 random variables in 16 seconds, and for 20 random variables in 48 seconds, on a Pentium III machine.