High-Performance Solution-Processed Nondoped Circularly Polarized OLEDs with Chiral Triptycene Scaffold-Based TADF Emitters Realizing Over 20% External Quantum Efficiency

Recently, circularly polarized organic light-emitting diodes (CP-OLEDs) fabricated with thermally activated delayed fluorescence (TADF) emitters are developed rapidly. However, most devices are fabricated by vacuum deposition technology, and developing efficient solution-processed CP-OLEDs, especially nondoped devices, is still a challenge. Herein, a pair of triptycene-based enantiomers, (S,S)-/(R,R)-TpAc-TRZ, are synthesized. The novel chiral triptycene scaffold of enantiomers avoids their intermolecular π–π stacking, which is conducive to their aggregation-induced emission characteristics and high photoluminescence quantum yield of 85% in the solid state. Moreover, the triptycene-based enantiomers exhibit efficient TADF activities with a small singlet-triplet energy gap (ΔE_ST) of 0.03 eV and delayed fluorescence lifetime of 1.1 µs, as well as intense circularly polarized luminescence with dissymmetry factors (|g_PL|) of about 1.9 × 10⁻³. The solution-processed nondoped CP-OLEDs based on (S,S)-/(R,R)-TpAc-TRZ not only display obvious circularly polarized electroluminescence signals with g_EL values of +1.5 × 10⁻³ and −2.0 × 10⁻³, respectively, but also achieve high efficiencies with external quantum, current, and power efficiency up to 25.5%, 88.6 cd A⁻¹, and 95.9 lm W⁻¹, respectively.     

Large neighborhood search for the bike request scheduling problem

This paper introduces an efficient algorithm for the bike request scheduling problem (BRSP). The BRSP is built around the concept of request, defined as the pickup or dropoff of a number of identical items (bikes) at a specific station, within a certain time window, and with a certain priority. The aim of the BRSP is to sequence requests on (and hence determine the routes of) a set of vehicles, in such a way that the sum of the priorities of the executed requests is maximized, all time windows are respected, and the capacity of the vehicles is not exceeded. The generation of the set of requests is explicitly not a part of the problem definition of the BRSP. The primary application of the BRSP, from which it derives its name, is to determine the routes of a set of repositioning vehicles in a bike sharing system, although other applications exist. The algorithm introduced in this paper is based on a set of related greedy randomized adaptive search procedure followed by variable neighborhood descent (GRASP + VND) operators embedded in a large neighborhood search (LNS) framework. Since this paper presents the first heuristic for the BRSP, a computational comparison to existing approaches is not possible. We therefore compare the solutions found by our LNS heuristic to those found by an exact solver (Gurobi). These experiments confirm that the proposed algorithm scales to realistic dimensions and is able to find near‐optimal solutions in seconds.     

基于变异算子和邻域值自适应的MOEA/D算法

基于分解的多目标进化算法（MOEA/D）在解决多目标问题时，具有简单有效的特点。但多数MOEA/D采用固定的控制参数，导致全局搜索能力差，难以平衡收敛性和多样性。针对以上问题提出一种基于变异算子和邻域值自适应的多目标优化算法。该算法根据种群中个体适应度值的分散或集中程度进行判断，并据此对变异算子进行自适应的调节，从而增强算法的全局搜索能力；根据进化所处的阶段以及个体适应度值的集中程度，自适应地调节邻域值大小，保证每个个体在不同的进化代数都有一个邻域值大小；在子问题邻域中，统计子问题对应个体的被支配数，通过判断被支配数是否超过设定的上限，来决定是否将Pareto支配关系也作为邻域内判断个体好坏的准则之一。将提出的算法与传统的MOEA/D在标准测试问题上进行对比。实验结果表明，提出的算法求得的解集具有更好的收敛性和多样性，在求解性能上具有一定的优势。     

Clustering biomedical and gene expression datasets with kernel density and unique neighborhood set based vein detection

It is a crucial need for a clustering technique to produce high-quality clusters from biomedical and gene expression datasets without requiring any user inputs. Therefore, in this paper we present a clustering technique called KUVClust that produces high-quality clusters when applied on biomedical and gene expression datasets without requiring any user inputs. The KUVClust algorithm uses three concepts namely multivariate kernel density estimation, unique closest neighborhood set and vein-based clustering. Although these concepts are known in the literature, KUVClust combines the concepts in a novel manner to achieve high-quality clustering results. The performance of KUVClust is compared with established clustering techniques on real-world biomedical and gene expression datasets. The comparisons were evaluated in terms of three criteria (purity, entropy, and sum of squared error (SSE)). Experimental results demonstrated the superiority of the proposed technique over the existing techniques for clustering both the low dimensional biomedical and high dimensional gene expressions datasets used in the experiments.     

基于近红外光谱及邻域粗糙集算法的

为了能够无损、准确检测出稻谷在贮藏过程中的宜存状况，利用近红外光谱技术结合数据分析方法建立了稻谷贮藏品质的鉴别模型。采集1 000～1 800 nm范围内285份样品近红外光谱数据，依据实测脂肪酸值将样品宜存状况划分为宜存、轻度不宜存、重度不宜存三类，采用邻域粗糙集（neighborhood rough set，NRS）算法终选出最优的10个特征波长结合随机森林（random forest，RF）算法所建立的稻谷贮藏品质鉴别模型性能最优，其校正集与测试集正确识别率分别为96.31%和9368%，敏感性和特异性参数分布在0.93～0.99。经分析比较，该模型性能同样优于采用连续投影算法（successive projections algorithm，SPA）和主成分分析（principal component analysis，PCA）结合RF算法各自建立的分类模型。结果表明，近红外光谱技术结合NRS和RF算法用于稻谷贮藏品质的鉴定是可行的，适用于储粮品质安全现场快速筛查。     

基于第三方物流的家具配送开放式车辆路径问题

为了降低家具配送成本,提高物流效率,基于第三方物流配送模式,构建了以总行驶距离最短和车辆数最少为最优目标的开放式车辆路径问题(open vehicle routing problem,OVRP)数学模型,并设计了一个改进的两阶段禁忌搜索算法进行求解,第1阶段求解包含所有客户的TSP(traveling salesman problem)路径来作为第2阶段划分OVRP路径的基础.设计了一个随机动态禁忌表,并将"邻域算子编号"和"邻域交换点对"同时作为禁忌对象,避免了过度禁忌的情况.另外,对5个邻域算子进行了测试,表明采用由点交换、分序点插入、点逆序和前点前向插入这4个算子组成的多邻域结构体效果最佳.经算例测试和文献对比,验证了设计算法的有效性,采用第三方物流配送比自营物流配送更节省成本.     

A variable neighborhood search heuristic algorithm for the double vehicle routing problem with multiple stacks

This paper addresses the double vehicle routing problem with multiple stacks (DVRPMS) in which a fleet of vehicles must collect items in a pickup region and then travel to a delivery region where all items are delivered. The load compartment of all vehicles is divided into rows (horizontal stacks) of fixed profundity (horizontal heights), and on each row, the unloading process must respect the last‐in‐first‐out policy. The objective of the DVRPMS is to find optimal routes visiting all pickup and delivery points while ensuring the feasibility of the vehicle loading plans. We propose a new integer linear programming formulation, which was useful to find inconsistencies in the results of exact algorithms proposed in the literature, and a variable neighborhood search based algorithm that was able to find solutions with same or higher quality in shorter computational time for most instances when compared to the methods already present in the literature.     

Constructing General Orthogonal Fractional Factorial Split-Plot Designs

While the orthogonal design of split-plot fractional factorial experiments has received much attention already, there are still major voids in the literature. First, designs with one or more factors acting at more than two levels have not yet been considered. Second, published work on nonregular fractional factorial split-plot designs was either based only on Plackett–Burman designs, or on small nonregular designs with limited numbers of factors. In this article, we present a novel approach to designing general orthogonal fractional factorial split-plot designs. One key feature of our approach is that it can be used to construct two-level designs as well as designs involving one or more factors with more than two levels. Moreover, the approach can be used to create two-level designs that match or outperform alternative designs in the literature, and to create two-level designs that cannot be constructed using existing methodology. Our new approach involves the use of integer linear programming and mixed integer linear programming, and, for large design problems, it combines integer linear programming with variable neighborhood search. We demonstrate the usefulness of our approach by constructing two-level split-plot designs of 16–96 runs, an 81-run three-level split-plot design, and a 48-run mixed-level split-plot design. Supplementary materials for this article are available online.     

居住小区不因市场而失效——小区理论在市场机制下的理解与应用

"居住小区"一词虽然产生于计划经济,但与邻里单位是同一概念,都是工业化和城市现代化的产物,是不依政治经济体制而变化的客观需要。随着我国经济制度的逐步转型和市场化发展,居住区建设模式发生根本改变,小区理论以及技术标准受到诸多质疑。本文试图从小区理论的产生、与邻里单位的关系、国内外实践入手,阐述居住小区理论并未因市场化而失效,进而针对如何在市场条件下运用居住区基本原理提出相应的建议。