Efficient organic solar cells enabled by simple non-fused electron donors with low synthetic complexity

Abstract Fused‐ring electron donors boost the efficiency of organic solar cells (OSCs), but they suffer from high cost and low yield for their large synthetic complexity (SC > 30%). Herein, the authors develop a series of simple non‐fused‐ring electron donors, PF1 and PF2, which alternately consist of furan‐3‐carboxylate and 2,2′‐bithiophene. Note that PF1 and PF2 present very small SC of 9.7% for their inexpensive raw materials, facile synthesis, and high synthetic yield. Compared to their all‐thiophene‐backbone counterpart PT‐E, two new polymers feature larger conjugated plane, resulting in higher hole mobility for them, especially a value up to ≈10 −4 cm 2 V −1 ·s for PF2 with longer alkyl side chain. Meanwhile, PF1 and PF2 exhibit larger dielectric constant and deeper electronic energy level versus PT‐E. Benefiting from the better physicochemical properties, the efficiencies of PF1‐ and PF2‐based devices are improved by ≈16.7% and ≈71.3% relative to that PT‐E‐based devices, respectively. Furthermore, the optimized PF2‐based devices with introducing PC 71 BM as the third component deliver a higher efficiency of 12.40%. The work not only indicates that furan‐3‐carboxylate is a simple yet efficient building block for constructing non‐fused‐ring polymers but also provides a promising electron donor PF2 for the low‐cost production of OSCs.A simple structure non‐fused‐ring electron donor PF2 alternately consisting of furan‐3‐carboxylate and 2,2′‐bithiophene presents very small synthetic complexity of 9.7% as well as low material cost of ≈19.0 $ g −1 . More importantly, PF2 delivers a high efficiency of 12.4% coupled with strong operational stability. imag

Anonymous traffic classification based on three-dimensional Markov image and deep learning

Illegal elements use the characteristics of an anonymous network hidden service mechanism to build a dark network and conduct various illegal activities, which brings a serious challenge to network security. The existing anonymous traffic classification methods suffer from cumbersome feature selection and difficult feature information extraction, resulting in low accuracy of classification. To solve this problem, a classification method based on three-dimensional Markov images and output self-attention convolutional neural network is proposed. This method first divides and cleans anonymous traffic data packets according to sessions, then converts the cleaned traffic data into three-dimensional Markov images according to the transition probability matrix of bytes, and finally inputs the images to the output self-attention convolution neural network to train the model and perform classification. The experimental results show that the classification accuracy and F1-score of the proposed method for Tor, I2P, Freenet, and ZeroNet can exceed 98.5%, and the average classification accuracy and F1-score for 8 kinds of user behaviors of each type of anonymous traffic can reach 93.7%. The proposed method significantly improves the classification effect of anonymous traffic compared with the existing methods

Combined deletion of Xrcc4 and Trp53 in mouse germinal center B cells leads to novel B cell lymphomas with clonal heterogeneity

Abstract Background Activated B lymphocytes harbor programmed DNA double-strand breaks (DSBs) initiated by activation-induced deaminase (AID) and repaired by non-homologous end-joining (NHEJ). While it has been proposed that these DSBs during secondary antibody gene diversification are the primary source of chromosomal translocations in germinal center (GC)-derived B cell lymphomas, this point has not been directly addressed due to the lack of proper mouse models. Methods In the current study, we establish a unique mouse model by specifically deleting a NHEJ gene, Xrcc4, and a cell cycle checkpoint gene, Trp53, in GC B cells, which results in the spontaneous development of B cell lymphomas that possess features of GC B cells. Results We show that these NHEJ deficient lymphomas harbor translocations frequently targeting immunoglobulin (Ig) loci. Furthermore, we found that Ig translocations were associated with distinct mechanisms, probably caused by AID- or RAG-induced DSBs. Intriguingly, the AID-associated Ig loci translocations target either c-myc or Pvt-1 locus whereas the partners of RAG-associated Ig translocations scattered randomly in the genome. Lastly, these NHEJ deficient lymphomas harbor complicated genomes including segmental translocations and exhibit a high level of ongoing DNA damage and clonal heterogeneity. Conclusions We propose that combined NHEJ and p53 defects may serve as an underlying mechanism for a high level of genomic complexity and clonal heterogeneity in cancers

Host-specific differences in top-expanded TCR clonotypes correlate with divergent outcomes of anti-PD-L1 treatment in responders versus non-responders

Immune checkpoint inhibitors (ICIs) have revolutionized cancer treatment; however, the responses to ICI treatment are highly variable in different individuals and the underlying mechanisms remain poorly understood. Here, we employed a mouse squamous cell carcinoma (SCC) model where tumor-bearing recipients diverged into responders (R) versus non-responders (NR) upon anti-PD-L1 treatment. We performed in-depth TCRβ sequencing with immunoSEQ platform to delineate the differences in CD8 tumor-infiltrating lymphocytes (TILs). We found that R and NR CD8 TILs both exhibited evidence of clonal expansion, suggesting activation regardless of response status. We detected no differences in clonal expansion or clonal diversity indexes between R vs. NR. However, the top expanded (>1%) TCRβ clonotypes appeared to be mutually exclusive between R and NR CD8 TILs, showing a preferential expansion of distinct TCRβ clonotypes in response to the same SCC tumor in R vs. NR. Notably, the mutual exclusivity of TCR clonotypes in R vs. NR was only observed when top TCRβ clonotypes were counted, because such top-expanded clonotypes are present in the opposite outcome group at a much lower frequency. Many TCRβ sequences were detected in only one recipient at a high frequency, implicating highly individualized anti-tumor immune responses. We conclude that differences in the clonal frequency of top TCR clonotypes between R and NR CD8 TILs may be one of the factors underlying differential anti-PD-L1 responses. This notion may offer a novel explanation for variable ICI responses in different individuals, which may substantially impact the development of new strategies for personalized cancer immunotherapy

The Performance Analysis for Embedded Systems using Statistics Methods

Performance comparison for the computer system under different hardware platform & system structure is of vital importance in the study of the performance evaluation. The Performance Analysis for Embedded Systems by using statistics methods based on the randomized complete block designs was proposed. Using the randomized block design, the differences between conditions can be separated from the difference in the processing, and be separated from the experimental bias. A case study of automatic gate machines used in the automatic fare collection system of Shanghai Metro is presented. The obtained assessment results show that our approach is helpful and effective. DOI: http://dx.doi.org/10.11591/telkomnika.v11i7.2864

Cognitive Covert Traffic Synthesis Method Based on Generative Adversarial Network

In the intelligent era of human-computer symbiosis, the use of machine learning method for covert communication confrontation has become a hot topic of network security. The existing covert communication technology focuses on the statistical abnormality of traffic behavior and does not consider the sensory abnormality of security censors, so it faces the core problem of lack of cognitive ability. In order to further improve the concealment of communication, a game method of “cognitive deception” is proposed, which is aimed at eliminating the anomaly of traffic in both behavioral and cognitive dimensions. Accordingly, a Wasserstein Generative Adversarial Network of Covert Channel (WCCGAN) model is established. The model uses the constraint sampling of cognitive priors to construct the constraint mechanism of “functional equivalence” and “cognitive equivalence” and is trained by a dynamic strategy updating learning algorithm. Among them, the generative module adopts joint expression learning which integrates network protocol knowledge to improve the expressiveness and discriminability of traffic cognitive features. The equivalent module guides the discriminant module to learn the pragmatic relevance features through the activity loss function of traffic and the application loss function of protocol for end-to-end training. The experimental results show that WCCGAN can directly synthesize traffic with comprehensive concealment ability, and its behavior concealment and cognitive deception are as high as 86.2% and 96.7%, respectively. Moreover, the model has good convergence and generalization ability and does not depend on specific assumptions and specific covert algorithms, which realizes a new paradigm of cognitive game in covert communication

Product structure optimization for classified gravity separation in steam coal preparation plant

Each separation system of multi-process steam coal preparation plant was analyzed and an optimization model of product structure was established. By translating distribution curve, product structure formulas under different separation density were obtained. Productivity and ash of primary product were predicted under the condition of different coal washing rate of raw coal, then economic benefits of raw coal per ton was calculated. Separating density and washing rate were obtained at the maximum economic benefits by using differential evolution algorithm, so as to get the optimum product structure. The application show that result calculated by the product structure optimization model for classified gravity separation in steam coal preparation plant based on differential evolution algorithm can meet with the actual one