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

A Comparative Study of Improved Harmony Search Algorithm in Four Bar Mechanisms

IEEE ACCESS 2020年 8卷 148757-148778页

作者： Flores-Pulido, Leticia Portilla-Flores, Edgar Alfredo Santiago-Valentin, Eric Vega-Alvarado, Eduardo Yanez, Maria Barbara Calva Nino-Suarez, Paola Andrea Univ Autonoma Tlaxcala Fac Ciencias Basicas Ingn & Tecnol Apizaco 90300 Mexico Inst Politecn Nacl Ctr Innovac & Desarrollo Tecnol Computo Mexico City 07738 DF Mexico

There are problems that are difficult to solve through mathematical programming or by classical methods. These problems are called hard problems due to their high complexity or high dimension. On the other hand, mataheuristics intends to seek a better solution to a problem. The Improvement Harmony Search algorithm is proposed under modification of the bandwidth parameter increasing the quality of the exploitation of the solutions. That is why within the state of the art, are mentioned several versions of harmonic search. The state of the art is supports the fact that the algorithm belongs to the category of those who make modifications to its parameters. This research demonstrates the ability of ImHS to solve a problem of high complexity focused on solving four-bar mechanism designs, whose solutions imply high dimension and which are also classified as hard problems. The two problems that are solved in this investigation, are problems very attacked within the state of the art by various metaheuristics. A comparison is then made against previous solutions with traditional metaheuristics and other versions of harmony search algorithm. Finally, the effectiveness of performance is demonstrated, where proposed algorithm it exceeded five metaheuristic algorithms and five harmony search versions. An optimum is provided in an easy and useful way, the parametric statistics are improved and the number of feasible solutions is exceeded in NP-hard problems as in the case of problems with four-bar mechanisms.

关键词： Harmonic analysis Search problems Bandwidth Optimization Heuristic algorithms Benchmark testing Convergence algorithms performance four-bar mechanism improved harmony search optimization problems mechatronic

来源：评论

学校读者我要写书评

暂无评论

Efficient k-Nearest Neighbor Searching in Nonordered Discrete Data Spaces

引用

ACM TRANSACTIONS ON INFORMATION SYSTEMS 2010年第2期28卷 7:1-7:33页

作者： Kolbe, Dashiell Zhu, Qiang Pramanik, Sakti Michigan State Univ E Lansing MI 48824 USA Univ Michigan Dearborn Dearborn MI USA

Numerous techniques have been proposed in the past for supporting efficient k-nearest neighbor (k-NN) queries in continuous data spaces. Limited work has been reported in the literature for k-NN queries in a nonordered discrete data space (NDDS). Performing k-NN queries in an NDDS raises new challenges. The Hamming distance is usually used to measure the distance between two vectors (objects) in an NDDS. Due to the coarse granularity of the Hamming distance, a k-NN query in an NDDS may lead to a high degree of nondeterminism for the query result. We propose a new distance measure, called Granularity-Enhanced Hamming (GEH) distance, which effectively reduces the number of candidate solutions for a query. We have also implemented k-NN queries using multidimensional database indexing in NDDSs. Further, we use the properties of our multidimensional NDDS index to derive the probability of encountering valid neighbors within specific regions of the index. This probability is used to develop a new search ordering heuristic. Our experiments on synthetic and genomic data sets demonstrate that our index-based k-NN algorithm is efficient in finding k-NNs in both uniform and nonuniform data sets in NDDSs and that our heuristics are effective in improving the performance of such queries.

关键词： algorithms performance Similarity search spatial indexing database nonordered discrete data space distance measurement nearest neighbor

来源：评论

学校读者我要写书评

暂无评论

Mining multiple-level association rules in large databases

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1999年第5期11卷 798-805页

作者： Han, JW Fu, WJ Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Simon Fraser Univ Intelligent Database Syst Res Lab Burnaby BC V5A 1S6 Canada Univ Missouri Dept Comp Sci Rolla MO 65409 USA

A top-down progressive deepening method is developed for efficient mining of multiple-level association rules from large transaction databases based on the Apriori principle. A group of variant algorithms is proposed based on the ways of sharing intermediate results, with the relative performance tested and analyzed. The enforcement of different interestingness measurements to find more interesting rules, and the relaxation of rule conditions for finding "level-crossing" association rules, are also investigated in the paper. Our study shows that efficient algorithms can be developed from large databases for the discovery of interesting and strong multiple-level association rules.

关键词： data mining knowledge discovery in databases association rules multiple-level association rules algorithms performance

来源：评论

学校读者我要写书评

暂无评论

Multicarrier CDMA for future generation mobile communication

引用

ELECTRONICS & COMMUNICATION ENGINEERING JOURNAL 2002年第2期14卷 52-60页

作者： McCormick, AC Al-Susa, EA Univ Edinburgh Dept Elect & Elect Engn Signals & Syst Grp Edinburgh EH9 3JL Midlothian Scotland

Future generations of wireless communication systems will be designed with the aim of making the best possible use of the limited radio spectrum in order to further increase throughput as well as user-capacity. In this paper, the application of multicarrier CDMA (code division multiple access) within mobile communication systems is discussed. An overview of the main types of multicarrier spread-spectrum systems is given. The multicarrier CDMA system is described in detail, including its relationship with OFDM (orthogonal frequency division multiplexing), its general performance in comparison with direct sequence CDMA and some specific implementation problems. The paper also presents some results comparing the performance of a selection of algorithms that can be used to isolate the individual signal of each user. Potential capacity increases achievable with adaptive loading in time and frequency slots is briefly demonstrated. By allocating users multiple codes, very high data rates can be achieved, and the paper gives a comparison of multicode, multicarrier CDMA with OFDM-based wireless LAN systems.

关键词： user-capacity adaptive loading orthogonal frequency division multiplexing throughput OFDM direct sequence CDMA Modulation and coding methods Multiple access communication multicarrier spread-spectrum systems Mobile radio systems time slots multiuser channels high data rates frequency slots channel capacity codes Computer communications OFDM modulation multicode CDMA wireless LAN algorithms performance wireless LAN systems radio spectrum wireless communication systems spread spectrum communication multicarrier CDMA code division multiple access land mobile radio mobile communication

来源：评论

学校读者我要写书评

暂无评论

Monocular ORB-SLAM Application in Underwater Scenarios

Monocular ORB-SLAM Application in Underwater Scenarios

引用

OCEANS - MTS/IEEE Kobe Techno-Oceans Conference (OTO)

作者： Hidalgo, Franco Kahlefendt, Chris Braunl, Thomas Univ Western Australia Sch Elect & Comp Engn Nedlands WA Australia

ISBN: (纸本)9781538616543

This paper presents an experimental evaluation of monocular ORB-SLAM applied to underwater scenarios. It is investigated as an alternative SLAM method with minimal instumentation compared to other approaches that integrate different sensors such as inertial and acoustic sensors. ORB-SLAM creates a 3D map based on image frames and estimates the position of the robot by using a feature-based front-end and a graph-based back-end. The performance of ORB-SLAM is evaluated through experiments in different settings with varying lighting, visibility and water dynamics. Results show good performance given the right conditions and demonstrate that ORB-SLAM can work well in the underwater environment. Based on our findings the paper outlines possible enhancements which should further improve on the algorithms performance.

关键词： Underwater Scenarios monocular ORB-SLAM algorithms performance Underwater Wet underwater environment Inertial acoustic transducers Robot

来源：评论

学校读者我要写书评

暂无评论

performance of commercial and open source remote sensing/image processing software for land cover/use purposes

Performance of commercial and open source remote sensing/ima...

引用

Conference on Earth Resources and Environmental Remote Sensing/GIS Applications III

作者： Teodoro, Ana C. Ferreira, Dario Sillero, Neftali Univ Porto CICGE FCUP Fac Sci Geospace Sci Res Ctr Rua Campo Alegre S-N P-4169007 Oporto Portugal Univ Porto Dep Geosci Environm & Land Planning Fac Sci P-4169007 Oporto Portugal

ISBN: (纸本)9780819492784

We aim to compare the potentialities of four remote sensing/image processing software: PCI Geomatica V8.2, ENVI 4.7, SPRING 5.1.8, and ORFEO toolbox integrated in Monteverdi 1.11. We listed and assessed the performance of several classification algorithms. PCI Geomatica and ENVI are commercial/proprietary software and SPRING and ORFEO are open source software. We listed the main classification algorithms available in these four software, and divided them by the different types/approaches of classification (e. g., pixel-based, object-oriented, and data mining algorithms). We classified using these algorithms two images covering the same area (Porto-Vila Nova de Gaia, Northern Portugal): one Landsat TM image from October 2011 and one IKONOS image from September 2005. We compared time of performance and classification results using the confusion matrix (overall accuracy) and Kappa statistics. The algorithms tested presented different classification results according to the software used. In Landsat image, differences are greater than IKONOS image. This work could be very important for other researchers as it provides a qualitative and quantitative analysis of different image processing algorithms available in commercial and open source software.

关键词： Classification algorithms open source software commercial/proprietary software algorithms performance Landsat IKONOS land cover/use

来源：评论

学校读者我要写书评

暂无评论

The Traffic Condition Likelihood Extraction Using Incomplete Observation in Distributed Traffic Loop Detectors

The Traffic Condition Likelihood Extraction Using Incomplete...

引用

14th International IEEE Conference on Intelligent Transportation Systems (ITSC)

作者： Ramezani, Amin Moshiri, Behzad

Here, for extracting a Gaussian Mixture Model of traffic flow in a certain freeway, some distributed EM estimation, including the consensus and particle filter, has been presented, these approaches converge at a linea... 详细信息

ISBN: (纸本)9781457721977

关键词： Conferences DEM communication requirements Detectors Gaussian components Gaussian mixture model Gaussian processes Intelligent transportation systems USA Councils algorithms performance automated highways distributed EM estimation distributed MLE distribu

来源：评论

学校读者我要写书评

暂无评论

Comparison of evolutionary algorithms implemented in different programming languages

ELEKTROTEHNISKI VESTNIK

引用

ELEKTROTEHNISKI VESTNIK 2022年第1-2期89卷 46-52页

作者： Ravber, Miha Moravec, Matej Mernik, Marjan Univ Maribor Fak Elektrotehn Racunalnistvo Informat Koroska Cesta 46 Maribor 2000 Slovenia

The performance of the evolutionary algorithms is assessed by comparing them with the existing algorithms. Comparison of the evolutionary algorithms in the literature plays a key role as it illustrates which algorithms are better. It is a common practice to simply take the results from the papers of the algorithms you are comparing your proposed algorithm to. However, it is not guaranteed that the experiments are performed in accordance with the guidelines for a fair comparison. Since a correct execution of an experiment is crucial to be able to state with a certainty the superiority of evolutionary algorithms, it is recommended that the experiment is repeated. This, however, can be a challenge if the source code of the algorithm is not available or it needs to be implemented in another programming language. Such approach can lead to misleading results due to the unintentional mistakes made in implementing the algorithm. Another factor that is often overlooked are the differences between the programming languages in which the algorithm is implemented. The problem is highlighted by analyzing and comparing the performance of the GWO algorithm implemented in six programming languages.

关键词： evolutionary algorithms grey wolf optimizer comparison of algorithms algorithms performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：