检索结果-南通市图书馆

Non-fullerene small molecule electron acceptors for high-performance organic solar cells

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Energy Chemistry 2018年第4期27卷 990-1016页

作者： hao lin Qiang Wang Key Laboratory of Applied Surface and Colloid Chemistry National Ministry of Education Shaanxi Key Laboratory for Advanced Energy Devices Shaanxi Engineering Lab for Advanced Energy Technology School of Materials Science and Engineering Shaanxi Normal University

Fullerenes and their derivatives are important types of electron acceptor materials and play a vital role in organic solar cell devices. However, the fullerene acceptor material has some difficulties to overcome the intrinsic shortcomings, such as weak absorption in the visible range, difficulty in modification and high cost, which limit the performance of the device and the large-scale application of this type of acceptors. In recent years, non-fullerene electron acceptor material has attracted the attention of scientists due to the advantages of adjustable energy level, wide absorption, simple synthesis, low processing cost and good solubility. Researchers can use the rich chemical means to design and synthesize organic small molecules and their oligomers with specific aggregation morphology and excellent optoelectronic prop- erties. Great advances in the field of synthesis, device engineering, and device physics of non-fullerene acceptors have been achieved in the last few years. At present, non-fullerene small molecules based photovoltaic devices achieve the highest efficiency more than 13% and the efficiency gap between fullerenetype and non-fullerene-type photovoltaic devices is gradually narrowing. In this review, we explore recent progress of non-fullerene small molecule electron acceptors that have been developed and led to highefficiency photovoltaic devices and put forward the prospect of development in the future.

关键词： Organic solar cells Non-fullerene Electron acceptors Bulk heterojunction

A Theorem on the Structure of the Ring A_(cris)

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2007年第7期23卷 1333-1336页

作者： hao lin LMAM School of Mathematical SciencesPeking University

In this paper, we give a new description for the structure of the p-adic period subring Acris using formal groups.

关键词： Lubin-Tate formal group crystalline period ring

The Minimum Centroid Branch Spanning Tree Problem

在线全文

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2024年第2期12卷 528-539页

作者： hao lin Cheng He School of Science Henan University of TechnologyZhengzhou450001HenanChina

For a spanning tree T of graph G,the centroid of T is a vertex v for which the largest component of T-v has as few vertices as *** number of vertices of this component is called the centroid branch weight of *** minimum centroid branch spanning tree problem is to find a spanning tree T of G such that the centroid branch weight is *** application to design of communication networks,the loads of all branches leading from the switch center should be as balanced as *** this paper,we prove that the problem is strongly NP-hard even for bipartite ***,the problem is shown to be polynomially solvable for split graphs,and exact formulae for special graph familis,say Kn_(1),n_(2),...,n_(k)and P_(m)×P_(n),are presented.

关键词： Spanning tree optimization Centroid branch-NP-hardness Polynomial-time algorithm

On Fixed-Parameter Solvability of the Minimax Path Location Problem

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Communications on Applied Mathematics and Computation 2023年第4期5卷 1644-1654页

作者： hao lin Cheng He School of Science Henan University of TechnologyZhengzhou450001HenanChina

The minimax path location problem is to find a path P in a graph G such that the maximum distance d_(G)(v,P)from every vertex v∈V(G)to the path P is *** is a well-known NP-hard problem in network *** paper studies the fixed-parameter solvability,that is,for a given graph G and an integer k,to decide whether there exists a path P in G such that max v∈V(G)d_(G)(v,P)≤*** the answer is affirmative,then graph G is called *** show that this decision problem is NP-complete even for k=*** the other hand,we characterize the family of 1-path-eccentric graphs,including the traceable,interval,split,permutation graphs and ***,some polynomially solvable special graphs are discussed.

关键词： Discrete location Path location Fixed-parameter solvability Graph characterization Polynomial-time algorithm

Tigecycline sclerotherapy for recurrent pseudotumor in aseptic lymphocyte-dominant vasculitis-associated lesion after metal-onmetal total hip arthroplasty:A case report

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

World Journal of Clinical Cases 2021年第34期9卷 10696-10701页

作者： I-hao lin Chun-hao Tsai Department of Orthopedics China Medical University HospitalChina Medical UniversityTaichung 406040Taiwan School of Medicine China Medical UniversityTaichung 406040Taiwan Department of Sports Medicine China Medical UniversityTaichung 406040Taiwan

BACKGROUND Metal-on-metal(MoM)total hip arthroplasty(THA)has been associated with adverse reactions to metal debris,presenting clinically as *** SUMMARY This case report presents a female aged 73 year-old with MoM THA-related *** arthrotomy and bursectomy surgeries,histologic examinations of surgical specimens revealed a specific lymphocyte-dominant immunologic response,now known as aseptic lymphocyte-dominant vasculitisassociated lesion(ALVAL).Due to soft tissue persisting effusion after arthrotomy and bursectomy,revision surgery was then performed with ceramic-onpolyethylene ***,revision did not resolve the patient’s *** we describe our application of tigecycline sclerotherapy to treat recurrent pseudotumor after revision THA and no recurrence after 24-mo *** Tigecycline sclerotherapy is safe and effective in the management of recurrent pseudotumor after revision non-MoM THA in ALVAL cases.

关键词： Aseptic lymphocyte-dominant vasculitis-associated lesion Metal-on-metal total hip arthroplasty Pseudotumor Tigecycline Case report

Accurate Identification of DNA Replication Origin by Fusing Epigenomics and Chromatin Interaction Information

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Research 2023年第1期2022卷 455-468页

作者： Fu-Ying Dao hao Lv Melissa J.Fullwood hao lin Center for Informational Biology University of Electronic Science and Technology of ChinaChengdu 610054China School of Biological Sciences Nanyang Technological UniversitySingapore 639798Singapore Cancer Science Institute of Singapore National University of Singapore14 Medical DrSingapore 117599Singapore Department of Molecular Life Sciences University of ZurichWinterthurerstrasse 1908057 ZurichSwitzerland institute of Molecular and CelBiology Agency for ScienceTechnology and Research(A*STAR)Singapore 138673Singapore

DNA replication initiation is a complex process involving various genetic and epigenomic *** correct identification of replication origins(ORIs)could provide important clues for the study of a variety of diseases caused by ***,we design a computational approach named iORI-Epi to recognize ORis by incorporating epigenome-based features,sequencebased features,and 3D genome-based *** iORI-Epi displays excellent robustness and generalization ability on both training datasets and independent datasets of K562 cell *** experiments confrm that iORI-Epi is highly scalable in other cell lines(MCF7 and HCT116).We also analyze and clarify the regulatory role of epigenomic marks,DNA motifs,and chromatin interaction in DNA replication initiation of eukaryotic ***,we discuss gene enrichment pathways from the perspective of ORIs in different replication timing states and heuristically dissect the effect of promoters on replication *** computational methodology is worth extending to ORI identification in other eukaryotic species.

关键词： Replication signature Origin

Where to go?Predicting next location in IoT environment

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2021年第1期15卷 113-125页

作者： hao lin Guannan LIU Fengzhi LI Yuan ZUO School of Economics and Management Beihang UniversityBeijing 100191China

Next location prediction has aroused great inter-ests in the era of internet of things(IoT).With the ubiquitous deployment of sensor devices,e.g..GPS and Wi-Fi,loT en-vironment offers new opportunities for proactively analyzing human mobility patterns and predicting user's future visit in low cost,no matter outdoor and *** this paper,we con-sider the problem of next location prediction in loT environ-ment via a session-based *** suggest that user's future intention in each session can be better inferred for more ac-curate prediction if patterns hidden inside both trajectory and signal strength sequences ollected from IoT devices can be jointly modeled,which however existing state-of the-art meth-ods have rarely *** this end,we propose a trajectory and sIgnal sequence(TSIS)model,where the trajectory transi-tion regularities and signal temporal dynamics are jointly embedded in a neural network based ***,we employ gated recurrent unit(GRU)for capturing the temporal dy-namics in the mutivariate signal strength ***,we adapt gated graph neural networks(gated GNNs)on loca-tion transition graphs to explicitly model the transition patterns of ***,both the low-dimensional representa-tions learned from trajectory and signal sequence are jointly optimized to construct a session embedding,which is further employed to predict the next *** experiments on two real-world Wi-Fi based mobility datasets demonstrate that TSIS is effective and robust for next location prediction pompared with other competitive baselines.

关键词： internet of things next location prediction neural networks trajectory signal

Unbounded Serial-Batching Scheduling on Hierarchical Optimization

在线全文

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2021年第4期9卷 909-914页

作者： Cheng He hao lin Li Li School of Science Henan University of TechnologyZhengzhou 450001China

The paper considers a serial-batching scheduling problem on hierarchical optimization with two regular maximum costs,where hierarchical optimization means the primary objective function is minimized,and keeping the minimum value of the primary objective function,the secondary objective function is also *** serial-batching machine environment,the machine processes the jobs in batch,and the jobs in the identical batch are processed by entering into the machine together and leaving the machine *** time taken to process a batch amounts to the total processing time of the jobs in the ***,a fixed switching time s is inserted when a machine begins to process a new *** only study the unbounded model,i.e.,the batch capacity is *** give an algorithm that can solve the hierarchical optimization problem in O(n4)time,where n denotes the number of jobs.

关键词： Hierarchical scheduling Serial-batching Maximum cost

Adversarial image detection based on the maximum channel of saliency maps

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Optoelectronics Letters 2022年第5期18卷 307-312页

作者： FU haoran WANG Chundong lin hao hao Qingbo Key Laboratory of Computer Vision and System Tianjin Key Laboratory of Intelligence Computing and Novel Software TechnologyTianjin University of TechnologyTianjin 300384China

Studies have shown that deep neural networks(DNNs) are vulnerable to adversarial examples(AEs) that induce incorrect behaviors. To defend these AEs, various detection techniques have been developed. However, most of them only appear to be effective against specific AEs and cannot generalize well to different AEs. We propose a new detection method against AEs based on the maximum channel of saliency maps(MCSM). The proposed method can alter the structure of adversarial perturbations and preserve the statistical properties of images at the same time. We conduct a complete evaluation on AEs generated by 6 prominent adversarial attacks on the Image Net large scale visual recognition challenge(ILSVRC) 2012 validation sets. The experimental results show that our method performs well on detecting various AEs.

关键词： networks neural maps