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

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

来源：评论

学校读者我要写书评

暂无评论

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(

来源：评论

学校读者我要写书评

暂无评论

Distributed space-time-frequency cooperative transmission scheme for bidirectional multi-relay communication networks

引用

Journal of Communications 2016年第10期11卷 896-902页

作者： Xu, Lei Ni, Ying Zhao, Kai Zhang, Hong-Wei Li, Xiao-Hui Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230601 China

Spectral efficiency and transmission reliability are among the main design considerations of modern wireless communication systems. In order to solve the problems of high decoding complexity, low spectrum utilization in bidirectional multi-relay cooperative communication system, combining the advantages of Random Cyclic Delay Diversity (RCDD) technology and Adaptive Forwarding Factor (AFF), a distributed space-time-frequency cooperative transmission scheme is proposed in this paper, which has the advantages of low decoding complexity and high spectrum utilization. Compared with the scheme only using Cyclic Delay Diversity (CDD) technology, this scheme can further excavate the diversity gain of the system and improve the performance of Bit Error Ratio (BER) and channel capacity. © 2016 Journal of Communications.

关键词： Cooperative communication

来源：评论

学校读者我要写书评

暂无评论

A simple distributed cooperative transmission scheme for two-way wireless relay networks

引用

Journal of Computational Information Systems 2013年第8期9卷 3027-3033页

作者： Zhang, Hongwei Jia, Yingju Gao, Zhiyuan Li, Xiaohui Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 China

To simplify the design process of coding matrices for data forwarding in two-way wireless relay networks with multiple relay nodes, a distributed cooperative transmission scheme based on cyclic delay diversity (CDD) and conventional space-time codes is proposed in this paper. All relay nodes are divided into several groups firstly. In each group, the relay nodes adopt CDD ways to amplify-and-forward (AF) their received signals and thereby obtain the potential diversity gains. The forwarded signals among different groups are encoded into the form of one full-rate space-time code, which can solve the problem on limited error correction ability in conventional relay schemes only using CDD ways and then further reduce the bit error rate (BER) of the distributed wireless system. Consequently, the design process for two-way relay transmissions is simplified and this method can be extended to other complicated cases. Simulation results verify that the proposed scheme is able to achieve high diversity gains and good bit error performance.

关键词： Space time codes

来源：评论

学校读者我要写书评

暂无评论

Vector Field-Guided Circumnavigation for an Unmanned Surface Vehicle With Boundary and Obstacle Constraints

引用

IEEE Transactions on Emerging Topics in computing 2025年

作者： Wu, Nailong Wang, Jigang Wang, Yueying He, Shuping Donghua University College of Information Science and Technology Shanghai201620 China Donghua University Engineering Research Center of Digitized Textile & Apparel Technology Ministry of Education Shanghai201620 China Shanghai University School of Mechatronic Engineering and Automation Shanghai200444 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Electrical Engineering and Automation Hefei230601 China

This article aims to tackle the challenge of rapid target circumnavigation by unmanned surface vehicles (USVs) under boundary and obstacle constraints through leveraging an emerging computing architecture specifically tailored for unmanned systems. Owing to the underactuation of USV dynamic systems and the presence of various time-varying surface disturbances, attaining rapid and accurate position control along with maneuverability poses a significant challenge to USVs. Therefore, when an USV maneuvers around a target in a confined search area with obstacles, it is essential for the guidance law to consider collision risks and environmental disturbances. This paper proposes a modified Lyapunov vector field with heading deviation compensation to circle the target in complex search regions. The vector field is designed to increase the radial velocity of the USV and accelerate convergence towards the target circle during the pursuit phase. By combining the proposed Lyapunov vector field with a boundary vector field, the USV can swiftly avoid boundaries and dynamic obstacles and then continue circling the target. The proposed computing architecture extends the application scope of the target circumnavigation to practical water surface environments, which is validated by extensive simulations and rigorous experiments. © 2025 IEEE.

关键词： Unmanned surface vehicles

来源：评论

学校读者我要写书评

暂无评论

Multiple-Instance Learning with Instance Selection via Constructive Covering Algorithm

引用

Tsinghua Science and Technology 2014年第3期19卷 285-292页

作者： Yanping Zhang Heng Zhang Huazhen Wei Jie Tang Shu Zhao the Department of Computer Science and Technology and Key Lab of Intelligent Computing and Signal Processing Anhui University the Department of Computer Science and Technology and Key Lab of Intelligent Computing and Signal Processing Anhui University1Hefei 230601 China the Department of Computer Science and Technology Tsinghua University

Multiple-Instance Learning （MIL） is used to predict the unlabeled bags＇ label by learning the labeled positive training bags and negative training *** bag is made up of several unlabeled instances.A bag is labeled positive if at least one of its instances is positive,otherwise *** multiple-instance learning methods with instance selection ignore the representative degree of the selected *** example,if an instance has many similar instances with the same label around it,the instance should be more representative than *** on this idea,in this paper,a multiple-instance learning with instance selection via constructive covering algorithm （MilCa） is *** MilCa,we firstly use maximal Hausdorff to select some initial positive instances from positive bags,then use a Constructive Covering Algorithm （CCA） to restructure the structure of the original instances of negative *** an inverse testing process is employed to exclude the false positive instances from positive bags and to select the high representative degree instances ordered by the number of covered instances from training ***,a similarity measure function is used to convert the training bag into a single sample and CCA is again used to classification for the converted *** results on synthetic data and standard benchmark datasets demonstrate that MilCa can decrease the number of the selected instances and it is competitive with the state-of-the-art MIL algorithms.

关键词： multiple-instance learning instance selection constructive covering algorithm maximal Hausdorff

来源：评论

学校读者我要写书评

暂无评论

Chebyshev Approximation for Fast Frequency- Sweep Analysis of Electromagnetic Scattering Problem

引用

电子学报(英文版) 2006年第4期15卷 736-738页

作者： CHEN Mingsheng WU Xianliang HUANG Zhixiang SHA Wei Key Laboratory of Intelligent Computing and Signal Processing Anhui University Hefei 230039 China

To complete the scattering analysis of an arbitrary shaped perfectly electric conductor over a wide frequency band, the Chebyshev polynomial of first kind is applied. The Chebyshev nodes within a given frequency range are found, and then the surface electric currents at these nodes are computed by the method of moments. The surface current is expanded in a polynomial function via the Chebyshev approximation. Using this function, the electric current distribution can be obtained at any frequency within the given frequency range. The numerical results are compared with the results obtained by the method of moments, and the complexity of computation is reduced obviously.

关键词： Chebyshev逼近快速频率扫描电磁散射电导体

来源：评论

学校读者我要写书评

暂无评论

Multiuser-based gray-level watermarking sharing system

引用

Journal of Multimedia 2009年第6期4卷 341-348页

作者： Luo, Bin Wu, Youqing Tang, Jin Lv, Wanli Gu, Wei Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei Anhui China

A novel watermarking sharing system having the ability of sharing gray-level secret images with multi-user is proposed. Multiple-based number system is used to split the secret into n meaningless shares, each share is embedded into respective cover image with controlled distortion and to be assigned to each user afterwards. The architecture of the proposed watermarking system is an open issue, which means the system is easy to be implemented according to the purposes and concerns of the users. The main feature of the proposed system is sharing a secret of gray-level image among multi-users;another application of such system is ownership verification. To reveal the secret, the necessary amount of shares has to be presented. That is, the secret can be recovered even if some shares were lost. Simulation results show that the recovered secret has robustness against a wide range of imaging processing operations. © 2009 ACADEMY PUBLISHER.

关键词： Numbering systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：