检索结果-内蒙古大学图书馆

SSRN 2025年

作者： Ren, Xingang Duan, Junwei Yang, Lixia Xu, Tao Yu, Yuanjie Chen, Zhiliang Lv, Ruirui Ye, Feihong Wang, Gang Ahmed, Rida Jiang, Hao Yang, Lixia Huang, Zhixiang Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei230601 China Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei230601 China CSI Cells Co. Ltd. Suzhou215129 China Anhui University of Chinese Medicine China Hong Kong Polytechnic University Hong Kong

Tunnel Oxide Passivation Contacts (TOPCon) solar cells have achieved high efficiency and become mainstream product in the global photovoltaic (PV) market. However, their long-term reliability, especially under high-temperature and high-humidity conditions, lacks sufficient field validation, and there is a lack of lifetime prediction models for TOPCon modules. To address this, we developed a robust accelerated aging model by integrating an improved Peck model with a sigmoidal degradation function, incorporating internal humidity and temperature as critical factors. The model employs a particle swarm optimization (PSO) algorithm to calibrate activation energy and humidity sensitivity parameters, enabling precise degradation trajectory simulation. Validated through a "fitting + testing" framework, the model achieves high accuracy (RMSE = 0.7%) in predicting power degradation under Damp Heat (DH), Highly Accelerated Stress Test (HAST), and modified Pressure Cooker Test (mPCT) conditions. Accelerated aging tests reveal that DH-induced degradation primarily reduces fill factor (FF) due to finger corrosion, with minimal impact on Voc and Isc. Experimental validation using a non-commercial corrosion-sensitive BOM combination shows that polyolefin elastomer (POE)-encapsulated modules exhibit superior corrosion resistance, projecting a service lifetime 23 years longer than EVA/EVA encapsulation in high-humidity regions like Hainan. This work bridges the gap in TOPCon module lifetime prediction under extreme environments, offering actionable insights for optimizing encapsulation materials and enhancing reliability. The model provides a scalable framework for evaluating module performance under site-specific climatic conditions, accelerating the development of durable PV technologies. © 2025, The Authors. All rights reserved.

关键词： Corrosion resistance

来源：评论

学校读者我要写书评

暂无评论

Total Field and Scattered Field Technique for Fourth-Order Symplectic Finite Difference Time Domain Method

引用

Chinese Physics Letters 2006年第1期23卷 103-105页

作者：沙威黄志祥吴先良陈明生 Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039

Using symplectic integrator propagator, a three-dimensional fourth-order symplectic finite difference time domain （SFDTD） method is studied, which is of the fourth order in both the time and space domains. The method is nondissipative and can save more memory compared with the traditional FDTD method. The total field and scattered field （TF-SF） technique is derived for the SFDTD method to provide the incident wave source conditions. The bistatic radar cross section （RCS） of a dielectric sphere is computed by using the SFDTD method for the first time. Numerical results suggest that the SFDTD algorithm acquires better stability and accuracy compared with the traditional FDTD method.

关键词： INTEGRATOR SIMULATION STABILITY SCHEME

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-aware Superpoint Graph Transformer for Weakly Supervised 3D Semantic Segmentation

引用

IEEE Transactions on Fuzzy Systems 2025年

作者： Fan, Yan Wang, Yu Zhu, Pengfei Hui, Le Xie, Jin Hu, Qinghua Tianjin University College of Intelligence and Computing Tianjin300350 China Ministry of Education of the People's Republic of China Engineering Research Center of City Intelligence and Digital Governance China Haihe Laboratory of Itai Tianjin China Northwestern Polytechnical University School of Electronics and Information Shaanxi Key Laboratory of Information Acquisition and Processing China Nanjing University of Science and Technology Pca Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

Weakly supervised 3D semantic segmentation has successfully mitigated the labor-intensive and time-consuming task of annotating 3D point clouds. However, reliably utilizing the minimal point-wise annotations for unlabeled data in complex and large-scale scenes is still challenging, such as only 20 points labeled in 2 million points. To tackle this challenge, we propose a new Uncertainty-aware Superpoint Graph Transformer (UaSGT) framework that utilizes minimal annotations for unlabeled data learning through reliable long-range supervision propagation from labeled superpoints to unlabeled superpoints. First, we propose a superpoint graph transformer to achieve long-range supervision propagation along the attention-based fuzzy subsets defined on superpoints. The attention-based fuzzy subset measures the membership of unlabeled superpoints to clusters centered on labeled superpoints. Second, we employ an uncertainty-aware membership rectification technique on the fuzzy subset to ensure reliable propagation among superpoints within the same category. This technique integrates an uncertainty prediction module to mask the influence of unreliable membership and a spatial prior refinement module to reduce uncertainty in intra-class membership degrees. Finally, experimental results on two large-scale benchmarks S3DIS and ScanNet-V2 demonstrate the superiority of our approach compared to the state-of-the-art with at least 90% annotation reduction, and our method also achieves comparable performance to fully supervised methods with less than 0.1% labeled points. Our code is available at https://***/fanyan0411/UaSGT. © 2025 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

The structural analysis of protein sequences based on the quasi-amino acids code

引用

Chinese Physics B 2009年第1期18卷 363-369页

作者：朱平唐旭清徐振源 School of Science Jiangnan University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University

Proteomics is the study of proteins and their interactions in a cell. With the successful completion of the Human Cenome Project, it comes the postgenome era when the proteomics technology is emerging. This paper studies protein molecule from the algebraic point of view. The algebraic system （∑, ＋, ＊） is introduced, where ∑ is the set of 64 codons. According to the characteristics of （∑, ＋, ＊）, a novel quasi-amino acids code classification method is introduced and the corresponding algebraic operation table over the set ZU of the 16 kinds of quasi-amino acids is established. The internal relation is revealed about quasi-amino acids. The results show that there exist some very close correlations between the properties of the quasi-amino acids and the codon. All these correlation relationships may play an important part in establishing the logic relationship between codons and the quasi-amino acids during the course of life origination. According to Ma F et al （2003 J. Anhui Agricultural University 30 439）, the corresponding relation and the excellent properties about amino acids code are very difficult to observe. The present paper shows that （ZU, ＋,×） is a field. Furthermore, the operational results display that the eodon tga has different property from other stop codons. In fact, in the mitochondrion from human and ox genomic codon, tga is just tryptophane, is not the stop codon like in other genetic code, it is the case of the Chen W C et al （2002 Acta Biophysiea Siniea 18（1） 87）. The present theory avoids some inexplicable events of the 20 kinds of amino acids code, in other words it solves the problem of ＇the 64 codon assignments of mRNA to amino acids is probably completely wrong＇ proposed by Yang （2006 Progress in Modern Biomedicine 6 3）.

关键词： algebraic operation quasi-amino acids code protein sequences structural analysis

来源：评论

学校读者我要写书评

暂无评论

MR-IDPSO: A Novel Algorithm for Large-Scale Dynamic Service Composition

引用

Tsinghua Science and Technology 2015年第6期20卷 602-612页

作者： Yanping Zhang Zihui Jing Yiwen Zhang School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal ProcessingMinistry of EducationAnhui University

In the era of big data, data intensive applications have posed new challenges to the field of service composition. How to select the optimal composited service from thousands of functionally equivalent services but different Quality of Service(Qo S) attributes has become a hot research in service computing. As a consequence,in this paper, we propose a novel algorithm MR-IDPSO(Map Reduce based on Improved Discrete Particle Swarm Optimization), which makes use of the improved discrete Particle Swarm Optimization(PSO) with the Map Reduce to solve large-scale dynamic service composition. Experiments show that our algorithm outperforms the parallel genetic algorithm in terms of solution quality and is efficient for large-scale dynamic service composition. In addition,the experimental results also demonstrate that the performance of MR-IDPSO becomes more better with increasing number of candidate services.

关键词： Map Reduce service composition Quality of Service(

来源：评论

学校读者我要写书评

暂无评论

An Optimization Algorithm for Service Composition Based on an Improved FOA

引用

Tsinghua Science and Technology 2015年第1期20卷 90-99页

作者： Yiwen Zhang Guangming Cui Yan Wang Xing Guo Shu Zhao the School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University

Large-scale service composition has become an important research topic in Service-Oriented computing（SOC）. Quality of Service（Qo S） has been mostly applied to represent nonfunctional properties of web services and to differentiate those with the same functionality. Many studies for measuring service composition in terms of Qo S have been completed. Among current popular optimization methods for service composition, the exhaustion method has some disadvantages such as requiring a large number of calculations and poor scalability. Similarly,the traditional evolutionary computation method has defects such as exhibiting slow convergence speed and falling easily into the local optimum. In order to solve these problems, an improved optimization algorithm, WS FOA（Web Service composition based on Fruit Fly Optimization Algorithm） for service composition, was proposed, on the basis of the modeling of service composition and the FOA. Simulated experiments demonstrated that the algorithm is effective, feasible, stable, and possesses good global searching ability.

关键词： service composition Fruit Fly Optimization Algorithm（FOA） Quality of Service（QoS） index

来源：评论

学校读者我要写书评

暂无评论

Shape Recognition and Retrieval Based on Edit Distance and Dynamic Programming

引用

Tsinghua Science and Technology 2009年第6期14卷 739-745页

作者：潘鸿飞梁栋唐俊王年李薇 Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University

An important aim in pattern recognition is to cluster the given shapes. This paper presents a shape recognition and retrieval algorithm. The algorithm first extracts the skeletal features using the medial axis transform. Then, the features are transformed into a string of symbols with the similarity among those symbols computed based on the edit distance. Finally, the shapes are identified using dynamic programming. Two public datasets are analyzed to demonstrate that the present approach is better than previous approaches.

关键词： skeletal features medial axis transform edit distance dynamic programming

来源：评论

学校读者我要写书评

暂无评论

On the error coefficients of asymptotic frame error rate optimal binary linear codes

引用

IEEE Transactions on Information Theory 2025年

作者： Li, Shitao Luo, Gaojun Shi, Minjia Ling, San Anhui University Key Laboratory of Intelligent Computing Signal Processing Ministry of Education School of Mathematical Sciences Anhui Hefei230601 China Nanjing University of Aeronautics and Astronautics School of Mathematics Jiangsu Province Nanjing211106 China Nanyang Technological University School of Physical and Mathematical Sciences 637371 Singapore

A binary linear code is called asymptotic frame error rate (AFER)-optimal if it achieves the maximum possible value of the minimum distance while having the smallest value of the corresponding error coefficient. Over the additive white Gaussian noise channel and under maximum-likelihood decoding, AFER-optimal codes attain the best possible asymptotic frame error rate at high signal-to-noise ratio. In this paper, we present several bounds on the smallest error coefficients of binary linear codes and give several constructions of AFER-optimal binary linear codes. Many examples confirm that our bounds are sharp on numerous occasions. In addition, we give two families of AFER-optimal codes that respectively attain the proposed bounds with equality. © 1963-2012 IEEE.

关键词： Asymptotic analysis

来源：评论

学校读者我要写书评

暂无评论

Counting extreme U1 matrices and characterizing quadratic doubly stochastic operators

引用

Frontiers of Mathematics in China 2016年第3期11卷 647-659页

作者： Quanbing ZHANG Shangjun YANG Key Laboratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui University Hefei 230039 China

The U1 matrix and extreme U1 matrix were successfully used to study quadratic doubly stochastic operators by R. Ganikhodzhaev and F. Shahidi [Linear Algebra Appl., 2010, 432： 24-35], where a necessary condition for a U1 matrix to be extreme was given. S. Yang and C. Xu [Linear Algebra Appl., 2013, 438： 3905-3912] gave a necessary and sufficient condition for a symmetric nonnegative matrix to be an extreme U1 matrix and investigated the structure of extreme U1 matrices. In this paper, we count the number of the permutation equivalence classes of the n × n extreme U1 matrices and characterize the structure of the quadratic stochastic operators and the quadratic doubly stochastic operators.

关键词： Extreme U1 matrix quadratic doubly stochastic operator,majorized permutation similar irreducible matrix

来源：评论

学校读者我要写书评

暂无评论

Point Pattern Matching Based on Spectra of Directed Graphs

引用

电子学报(英文版) 2011年第4期20卷 662-666页

作者： LIANG Dong ZHU Ming FAN Yizheng YAN Pu Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

We present a novel algorithm for point pattern matching by means of spectra of directed graphs. Given a feature point-set, we construct a weighted directed graph and skew-symmetric matrix associated with the graph. By using spectral decomposition of the matrix, we give a spectral representation of the feature points with half of the eigenvectors. We theoretically analyze that our method can well deal with the matching problem under affine transformation. The expreiments applied to synthetic data and real-world images show the effectiveness of our method.

关键词：点模式匹配图的谱反对称矩阵特征向量匹配问题仿射变换显示方法谱分解

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：