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

TMO: time and memory optimized algorithm applicable for more accurate alignment of trinucleotide repeat disorders associated genes

引用

BIOTECHNOLOGY & BIOTECHNOLOGICAL EQUIPMENT 2016年第2期30卷 388-403页

作者： Stojanov, Done Bogdanova, Ana Madevska Orzechowski, Tomasz Marcin Univ Goce Delcev Dept Comp Technol & Intelligent Syst Fac Comp Sci Stip Macedonia Univ Sts Cyril & Methodius Dept Intelligent Syst Fac Comp Sci & Engn Skopje Macedonia AGH Univ Sci & Technol Fac Comp Sci Elect & Telecommun Dept Telecommun PL-30059 Krakow Poland

In this study, time and memory optimized (TMO) algorithm is presented. Compared with Smith - Waterman's algorithm, TMO is applicable for a more accurate detection of continuous insertion/deletions (indels) in genes' fragments, associated with disorders caused by over-repetition of a certain codon. The improvement comes from the tendency to pinpoint indels in the least preserved nucleotide pairs. All nucleotide pairs that occur less frequently are classified as less preserved and they are considered as mutated codons whose mid-nucleotides were deleted. Other benefit of the proposed algorithm is its general tendency to maximize the number of matching nucleotides included per alignment, regardless of any specific alignment metrics. Since the structure of the solution, when applying Smith - Waterman, depends on the adjustment of the alignment parameters and, therefore, an incomplete (shortened) solution may be derived, our algorithm does not reject any of the consistent matching nucleotides that can be included in the final solution. In terms of computational aspects, our algorithm runs faster than Smith - Waterman for very similar DNA and requires less memory than the most memory efficient dynamic programming algorithms. The speed up comes from the reduced number of nucleotide comparisons that have to be performed, without having to imperil the completeness of the solution. Due to the fact that four integers (16 Bytes) are required for tracking matching fragment, regardless its length, our algorithm requires less memory than Huang's algorithm.

关键词： Huntington's disease genes computational improved algorithm

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm for TSP Problem Solving with Hopfield Neural Networks

An Improved Algorithm for TSP Problem Solving with Hopfield ...

引用

International Conference on Smart Materials and Intelligent Systems

作者： An Jinliang Gao Jia Lei Jinhui Gao Guohong Henan Inst Sci & Technol Coll Informat Technol Xinxiang 453003 Peoples R China Henan Inst Sci & Technol Coll Human Literauture Xinxiang 453003 Peoples R China

ISBN: (纸本)9780878492237

Hopfield and Tank have shown that neural networks can be used to solve certain computationally hard problems, in particular they studied the Traveling Salesman Problem (TSP). In this paper,on the base of the analysis of tradiontial methord, introduced an improved algorithm for TSP Problem Solving with Hopfield Neural Networks. We found the accuracy of the results depend on the initial parameters to a large extent, discussed how to set initial parameters properly;analysed the internal relationship between the terms in energy function, and improved the energy function. Used a fixed starting point to eliminate the equivalent solution problem,and the number of neurons is reduced from the N2 to (N-1)2. The improved algorithm reduced the unnecessary equivalent solution in calculate process, enhanced the computational efficiency. Experiment results showed that the algorithm improved the speed and the convergence.

关键词： Hopfield TSP algorithm improved

来源：评论

学校读者我要写书评

暂无评论

The Objective Function Value Optimization of Cloud Computing Resources Security Allocation of Artificial Firefly algorithm

引用

Open Journal of Optimization 2015年第2期4卷 40-46页

作者： Xiaoxi Hu School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China

Based on the current cloud computing resources security distribution model’s problem that the optimization effect is not high and the convergence is not good, this paper puts forward a cloud computing resources security distribution model based on improved artificial firefly algorithm. First of all, according to characteristics of the artificial fireflies swarm algorithm and the complex method, it incorporates the ideas of complex method into the artificial firefly algorithm, uses the complex method to guide the search of artificial fireflies in population, and then introduces local search operator in the firefly mobile mechanism, in order to improve the searching efficiency and convergence precision of algorithm. Simulation results show that, the cloud computing resources security distribution model based on improved artificial firefly algorithm proposed in this paper has good convergence effect and optimum efficiency.

关键词： Cloud Computing Resources Security Distribution improved Artificial Firefly algorithm Complex Method Local Search Operator

来源：评论

学校读者我要写书评

暂无评论

A Novel Empirical Equation for Relative Permeability in Low Permeability Reservoirs

引用

Chinese Journal of Chemical Engineering 2014年第Z1期22卷 1274-1278页

作者：葛玉磊李树荣曲珂馨 College of Information and Control Engineering China University of Petroleum Emory college of arts and sciences Emory University 201 Dowman DrAtlanta GA 30322 America

In this paper, a novel empirical equation is proposed to calculate the relative permeability of low permeability reservoir. An improved item is introduced on the basis of Rose empirical formula and Al-Fattah empirical formula, with one simple model to describe oil/water relative permeability. The position displacement idea of bare bones particle swarm optimization is applied to change the mutation operator to improve the RNA genetic algorithm. The parameters of the new empirical equation are optimized with the hybrid RNA genetic algorithm(HRGA) based on the experimental data. The data is obtained from a typical low permeability reservoir well 54 core 27-1 in Gu Dong by unsteady method. We carry out matlab programming simulation with HRGA. The comparison and error analysis show that the empirical equation proposed is more accurate than the Rose empirical formula and the exponential model. The generalization of the empirical equation is also verified.

关键词： Empirical equation Relative permeability Hybrid RNA genetic algorithm improved item Low permeability reservoirs Bare bones particle swarm

来源：评论

学校读者我要写书评

暂无评论

A Control Strategy for Smoothing Active Power Fluctuation of Wind Farm with Flywheel Energy Storage System Based on improved Wind Power Prediction algorithm

引用

Energy and Power Engineering 2013年第4期5卷 387-392页

作者： J. C. Wang X. R. Wang School of Electrical Engineering Southwest Jiaotong University Chengdu China

The fluctuation of active power output of wind farm has many negative impacts on large-scale wind power integration into power grid. In this paper, flywheel energy storage system (FESS) was connected to AC side of the doubly-fed induction generator (DFIG) wind farm to realize smooth control of wind power output. Based on improved wind power prediction algorithm and wind speed-power curve modeling, a new smooth control strategy with the FESS was proposed. The requirement of power system dispatch for wind power prediction and flywheel rotor speed limit were taken into consideration during the process. While smoothing the wind power fluctuation, FESS can track short-term planned output of wind farm. It was demonstrated by quantitative analysis of simulation results that the proposed control strategy can smooth the active power fluctuation of wind farm effectively and thereby improve power quality of the power grid.

关键词： Wind Power Generation FESS Wind Power Prediction improved Time-series algorithm Active Power Smooth Control

来源：评论

学校读者我要写书评

暂无评论

An improved LR-aided K-best algorithm for MIMO detection

An improved LR-aided K-best algorithm for MIMO detection

引用

International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Qi Zhou Xiaoli Ma School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA

ISBN: (纸本)9781467358309

Recently, lattice reduction (LR) technique has caught great attention for multi-input multi-output (MIMO) receiver because of its low complexity and high performance. However, when the number of antennas is large, LR-aided linear detectors and successive interference cancellation (SIC) detectors still exhibit considerable performance gap to the optimal maximum likelihood detector (MLD). To enhance the performance of the LR-aided detectors, the LR-aided K-best algorithm was developed at the cost of the extra complexity on the order O(N 2 t K + N t K 2 ), where N t is the number of transmit antennas and K is the number of candidates. In this paper, we develop an LR-aided K-best algorithm with lower complexity by exploiting a priority queue. With the aid of the priority queue, our analysis shows that the complexity of the LR-aided K-best algorithm can be further reduced to O(N 2 t K + N t Klog 2 (K)). The low complexity of the proposed LR-aided K-best algorithm allows us to perform the algorithm for large MIMO systems (e.g., 50×50 MIMO systems) with large candidate sizes. Simulations show that as the number of antennas increases, the error performance approaches that of AWGN channel.

关键词： An improved algorithm multiple input multiple output systems algorithms transmitting antennas ANTENNA error performance AWGN channels detector Complexity Queue

来源：评论

学校读者我要写书评

暂无评论

改进的Pearson-Compatibility群决策算法在多属性协同过滤推荐中的应用研究

引用

情报学报 2011年第2期30卷 121-130页

作者：李岱峰于长锐覃正董添犀上海财经大学信息管理与工程学院上海200433

目前个性化推荐领域的相关研究,很少考虑用户在资源属性上的兴趣差异,而资源属性往往是决定用户偏好的重要因素之一.针对这一问题,构建了基于资源多属性的用户评价模型和兴趣模型,并提出了一种改进的Pearson-Compatibility多属性群决策... 详细信息

目前个性化推荐领域的相关研究,很少考虑用户在资源属性上的兴趣差异,而资源属性往往是决定用户偏好的重要因素之一.针对这一问题,构建了基于资源多属性的用户评价模型和兴趣模型,并提出了一种改进的Pearson-Compatibility多属性群决策算法,在k-临近相似用户的推荐问题中引入该算法,结合协同过滤推荐的特点,对相似用户偏好差异性、残缺值、算法可能出现的提前收敛等问题进行了充分考虑,进而实现多属性的协同过滤.最后通过实验对算法的有效性进行验证,实验结果表明:算法在目标用户属性偏好的预测上,具有较高的准确度,对偏差值、残缺值具有较强的抗干扰能力,具有较强的实用价值.

关键词：改进决策算法多属性协同过滤推荐应用研究 Collaborative Filtering Based Decision algorithm improved 资源属性用户偏好问题抗干扰能力个性化推荐重要因素兴趣模型兴趣差异相似相关研究实用价值

来源：评论

学校读者我要写书评

暂无评论

WSN中基于改进自适应遗传算法的移动代理路由算法

引用

计算机与数字工程 2010年第12期38卷 4-7,32页

作者：方旺盛黎飞龙江西理工大学信息工程学院赣州341000

文章针对无线传感器网络能量消耗和延时问题,结合移动代理路由策略,提出了一种改进型自适应遗传算法,利用此算法求出移动代理在网络中的最佳迁移节点序列,以达到优化网络效果。通过仿真实验结果表明,与标准遗传算法相比,此算法具有更小... 详细信息

文章针对无线传感器网络能量消耗和延时问题,结合移动代理路由策略,提出了一种改进型自适应遗传算法,利用此算法求出移动代理在网络中的最佳迁移节点序列,以达到优化网络效果。通过仿真实验结果表明,与标准遗传算法相比,此算法具有更小的网络能量消耗和延时。

关键词： WSN 改进自适应遗传算法移动代理代理路由算法 Adaptive Genetic algorithm improved Based Routing algorithm Agent 无线传感器网络能量消耗标准遗传算法延时网络效果实验结果路由策略节点序列改进型优化问题

来源：评论

学校读者我要写书评

暂无评论

改进的Apriori算法在中医医案分析中的应用

引用

山东师范大学学报（自然科学版） 2009年第4期24卷 -页

作者：袁锋陈守强山东省工会管理干部学院信息工程系 250100济南山东中医药大学第二附属医院 250001济南

为了解决Apriori 算法的不足,提出了改进的Apriori算法:进行剪枝侯选项目集时,采用生成频繁项目集和删除具有非频繁子集候选同时进行的方法来减少多余子项目集的生成.改进的Apriori 算法大大提高了频繁项目集即关联规则生成的效率,运行... 详细信息

为了解决Apriori 算法的不足,提出了改进的Apriori算法:进行剪枝侯选项目集时,采用生成频繁项目集和删除具有非频繁子集候选同时进行的方法来减少多余子项目集的生成.改进的Apriori 算法大大提高了频繁项目集即关联规则生成的效率,运行时间不及原算法的十分之一,同时节省了大量的存储空间.最后利用改进的Apriori 算法对中医医案数据进行关联规则挖掘,获得了良好的效果.

关键词：改进 Apriori算法中医医案分析 TRADITIONAL CHINESE MEDICINE MEDICAL RECORDS ANALYZING APRIORI algorithm improved 频繁项目集规则生成关联规则挖掘子项目集运行时间存储空间子集效率数据剪枝方法

来源：评论

学校读者我要写书评

暂无评论

Optimal Deployment with Self-Healing Movement Algo-rithm for Particular Region in Wireless Sensor Network

引用

Wireless Sensor Network 2009年第3期1卷 212-221页

作者： Fan ZHU Hongli LIU Shugang LIU Jie ZHAN 不详

Optimizing deployment of sensors with self-healing ability is an efficient way to solve the problems of cov-erage, connectivity and the dead nodes in WSNs. This work discusses the particular relationship between the monitoring range and the communication range, and proposes an optimal deployment with self-healing movement algorithm for closed or semi-closed area with irregular shape, which can not only satisfy both coverage and connectivity by using as few nodes as possible, but also compensate the failure of nodes by mobility in WSNs. We compute the maximum efficient range of several neighbor sensors based on the dif-ferent relationships between monitoring range and communication range with consideration of the complex boundary or obstacles in the region, and combine it with the Euclidean Minimum Spanning Tree (EMST) algorithm to ensure the coverage and communication of Region of Interest (ROI). Besides, we calculate the location of dead nodes by Geometry algorithm, and move the higher priority nodes to replace them by an-other improved Virtual Force algorithm (IVFA). Eventually, simulation results based-on MATLAB are presented, which do show that this optimal deployment with self-healing movement algorithm can ensure the coverage and communication of an entire region by requiring the least number of nodes and effectively compensate the loss of the networks.

关键词： Optimal Deployment Self-Healing Movement Particular Region Euclidean Minimum Spanning Tree (EMST) improved Virtual Force algorithm (IVFA)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：