Boron(iii) β-diketonate-based small molecules for functional non-fullerene polymer solar cells and organic resistive memory devices

A class of acceptor–donor–acceptor chromophoric small-molecule non-fullerene acceptors, 1–4, with difluoroboron(iii) β-diketonate (BF₂bdk) as the electron-accepting moiety has been developed. Through the variation of the central donor unit and the modification on the peripheral substituents of the terminal BF₂bdk acceptor unit, their photophysical and electrochemical properties have been systematically studied. Taking advantage of their low-lying lowest unoccupied molecular orbital energy levels (from −3.65 to −3.72 eV) and relatively high electron mobility (7.49 × 10⁻⁴ cm² V⁻¹ s⁻¹), these BF₂bdk-based compounds have been employed as non-fullerene acceptors in organic solar cells with maximum power conversion efficiencies of up to 4.31%. Moreover, bistable resistive memory characteristics with charge-trapping mechanisms have been demonstrated in these BF₂bdk-based compounds. This work not only demonstrates for the first time the use of a boron(iii) β-diketonate unit in constructing non-fullerene acceptors, but also provides more insights into designing organic materials with multi-functional properties.

Boron(iii) β-diketonates have been demonstrated to serve as multi-functional materials in NFA-based OPVs and organic resistive memories.     

从废水到新能源:光催化燃料电池的优化与应用

随着经济的飞速发展,社会对能源的需求日益扩大,对工业废水的无害化处理也提出了更高的要求。光催化燃料电池 (photocatalytic fuel cell, PFC) 在燃料电池中引入半导体光催化材料作为电极,实现了有机污染物高效降解和同步对外产电的双重功能,在废水无害化与资源化利用方面具有潜在的应用价值。半导体光催化电极是PFC系统高效运行的核心组件,增强其可见光响应和光生载流子分离是提高PFC性能的关键策略。反应器结构设计和运行参数优化也有利于改善PFC性能。本文从PFC基本原理和应用入手,综述了PFC在环境污染物资源化处理中的研究进展,并详细阐述了提高PFC的污染控制性能和产电效率的优化手段,为进一步设计高效稳定的PFC系统并实现其在水污染控制和清洁能源生产中的应用提供理论指导。     

Aspects of Generic Entanglement

We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the ``concentration of measure' phenomenon, meaning that on a large-probability set these parameters are close to their expectation. For the entropy of entanglement, this has the counterintuitive consequence that there exist large subspaces in which all pure states are close to maximally entangled. This, in turn, implies the existence of mixed states with entanglement of formation near that of a maximally entangled state, but with negligible quantum mutual information and, therefore, negligible distillable entanglement, secret key, and common randomness. It also implies a very strong locking effect for the entanglement of formation: its value can jump from maximal to near zero by tracing over a number of qubits negligible compared to the size of the total system. Furthermore, such properties are generic. Similar phenomena are observed for random multiparty states, leading us to speculate on the possibility that the theory of entanglement is much simplified when restricted to asymptotically generic states. Further consequences of our results include a complete derandomization of the protocol for universal superdense coding of quantum states.     

Invariant ideals of twisted crossed products

We will prove a result concerning the inclusion of non-trivial invariant ideals inside non-trivial ideals of a twisted crossed product. We will also give results concerning the primeness and simplicity of crossed products of twisted actions of locally compact groups on -algebras. Received: 25 January 2002; in final form: 22 May 2002/Published online: 2 December 2002 This work is partially supported by Hong Kong RGC Direct Grant.     

Minimizing Maximum Weighted Error for Imprecise Computation Tasks

We consider the problem of preemptively scheduling a set of imprecise computation tasks on m ≥ 1 identical processors, with each task T_i having two weights, w_i and w′_i. Two performance metrics are considered: (1) the maximum w′-weighted error; (2) the total w-weighted error subject to the constraint that the maximum w′-weighted error is minimized. For the problem of minimizing the maximum w′-weighted error, we give an algorithm which runs in O(n³ log²n) time for multiprocessors and O(n²) time for a single processor. For the problem of minimizing the total w-weighted error subject to the constraint that the maximum w′-weighted error is minimized, we give an algorithm which also has the same time complexity.     

Incomplete data problems in X-ray computerized tomography

Summary In the present paper we study truncated projections for the fanbeam geometry in computerized tomography. First we derive consistency conditions for the divergent beam transform. Then we study a singular value decomposition for the case where only the interior rays in the fan are provided, as for example in region-of-interest tomography. We show that the high angular frequency components of the searched-for densities are well determined and we present reconstructions from real data where the missing information is approximated based on the singular value decomposition.The work of the authors was supported by the Deutsche Forschungsgemeinschaft under grant Lo 310/2-4