检索结果-南通市图书馆

Attar: RRAM-based in-memory attention accelerator with software-hardware co-optimization

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2025年第03期68卷 371-387页

作者： Bing LI Ying QI Ying WANG Yinhe HAN Information Engineering College Capital Normal University Research Center for intelligent computing Systems Institute of Computing TechnologyChinese Academy of Sciences

The attention mechanism has become a pivotal component in artificial intelligence, significantly enhancing the performance of deep learning applications. However, its quadratic computational complexity and intricate computations lead to substantial inefficiencies when processing long sequences. To address these challenges, we introduce Attar, a resistive random access memory(RRAM)-based in-memory accelerator designed to optimize attention mechanisms through software-hardware co-optimization. Attar leverages efficient Top-k pruning and quantization strategies to exploit the sparsity and redundancy of attention matrices, and incorporates an RRAM-based in-memory softmax engine by harnessing the versatility of the RRAM crossbar. Comprehensive evaluations demonstrate that Attar achieves a performance improvement of up to 4.88× and energy saving of 55.38% over previous computing-in-memory(CIM)-based accelerators across various models and datasets while maintaining comparable accuracy. This work underscores the potential of in-memory computing to enhance the efficiency of attention-based models without compromising their effectiveness.

关键词： RRAM computing-in-memory attention pruning quantization

同方期刊数据库

Hybrid Lifting Wavelet-Like Transform for Solution of Electromagnetic Integral Equation

在线全文

学校读者我要写书评

暂无评论

Chinese Physics Letters 2008年第3期25卷 1000-1003页

作者：陈明生吴先良沙威黄志祥 key laboratory of intelligent computing and signal processing Anhui University Hefei 230039

A hybrid lifting wavelet-like transform scheme is successfully applied to the solution of electric field integral equation using Rao-Wilton-Glisson basis functions. To speed up the matrix transform process, the lifting scheme is adopted. Numerical examples of different three-dimensional perfectly electric conducting objects are considered. Compared with the method of moments, the proposed matrix transform scheme can save considerable CPU time and memory.

关键词： supernova explosion proto-neutron star shock wave

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

A Miniaturized Bandwidth Reconfigurable Bandpass Chip Filter with Semi-lumped Topology and GaAs pHEMT Technology

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2021年第1期30卷 192-198页

作者： LI Linqing ZHU Haoran NING Xingyu LI Zunwen WU Xianliang key Lab of intelligent computing and signal processing Ministry of Education Anhui University

A miniaturized reconfigurable bandpass chip filter with semi-lumped topology and Gallium Arsenide pseudomorphic High electron mobility transistor（GaAs pHEMT） technology is proposed. Semi-lumped topology is employed to instead the traditional lumped inductor with microstrip transmission line, which can reduced the size of the tunable filter significantly. Three-order series and shunt resonated bandpass filter is implemented with shorted stubs and metal-insulator-metal capacitors. Two transmission zeros are introduced with the series resonator and the shunted GaAs FET. By tuning the gate bias circuit of the FET, the capacitance of the series resonator is changed and the bandwidth of the filter is adjusted correspondingly. An equivalent circuit model is developed to interpret the mechanism of the proposed filter circuit. A reconfigurable on chip filter sample operated at 10 GHz is fabricated to validate the design. Two fractional bandwidth of 14.3% and 23.5% are tuned with bias voltage of the FET, while insertion loss of 2.4 d B and 2.2 d B are observed with the filter, respectively. The area of the chip filter is 0.86 × 0.96 mm2and is equivalent to an electrical length of 0.08 × 0.09λg2at center frequency. Measurement results agree well with the simulation ones.

关键词： gallium arsenide tunable filter transmission zeros equivalent circuit model resonator filters shunted FET III-V semiconductors miniaturized bandwidth reconfigurable bandpass chip filter MIM devices microstrip transmission line chip filter sample shunt resonated bandpass filter metal-insulator-metal capacitors semilumped topology loss 2.4 dB Gallium Arsenide pseudomorphic High electron mobility transistor technology insertion loss filter circuit integrated circuit design GaAs integrated circuit manufacture frequency 10.0 GHz pHEMT technology microwave filters loss 2.2 dB HEMT integrated circuits series resonator miniaturized reconfigurable bandpass chip filter band-pass filters

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

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(

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

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

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