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

A FAST search algorithm ON MODIFIED S-TREES

PATTERN RECOGNITION LETTERS 1995年第11期16卷 1159-1164页

作者： CHUNG, KL WU, CJ Department of Information Management National Taiwan Institute of Technology No. 43 Section 4. Keelung Road Taipei. Taiwan 10672 ROC

We first propose a modified S-tree. Let the memory required in the modified S-tree be O(m), then our derived fast search algorithm can be performed in O(t) time, t less than or equal to m. Our algorithm is quite competitive with the algorithm of Jonge, Scheuermann, and Schijf (1994). The application to pictorial database is also addressed.

关键词： SPATIAL DATA STRUCTURE S-TREE MODIFIED S-TREE IMAGE PROCESSING search algorithm PICTORIAL DATABASE

来源：评论

学校读者我要写书评

暂无评论

Oppositional Crow search algorithm with mutation operator for global optimization and application in designing FOPID controller

引用

EVOLVING SYSTEMS 2021年第2期12卷 463-488页

作者： Majhi, Santosh Kumar Sahoo, Madhusmita Pradhan, Rosy Veer Surendra Sai Univ Technol Dept Comp Sci & Engn Burla 768018 Odisha India Veer Surendra Sai Univ Technol Dept Elect Engn Burla 768018 Odisha India

The Swarm based algorithms deliver better performance when it can maintain perfect balance of the exploration and exploitation process and converges faster by successfully avoiding local optima entrapment. At recent time, Crow search algorithm (CSA) is developed as a nature inspired swarm based algorithm. It can solve continuous, non-linear and complex day to day life optimization problems. Like many other optimization algorithms, CSA suffers with the problem of local stagnation. This paper introduces an improved version of the CSA, which improves the performance of the existing CSA algorithm by using oppositional learning and mutation operator. The proposed algorithm is termed as OBL-CSA-MO. The OBL-CSA-MO enhances the exploration and exploitation capability in the search space and successfully avoids local optima entrapment. The OBL-CSA-MO is evaluated by considering the IEEE CEC 2017 standard benchmark functions set. The efficiency and robustness of the proposed OBL-CSA-MO is measured using performance metrics, convergence analysis and statistical significance. A demonstration is given as an application of the proposed algorithm for designing fractional order PID controller as the real life problem. For this purpose, the first order and higher order plants are considered in the FOPID designing using the proposed OBL-CSA-MO. The experimental results demonstrate that the developed OBL-CSA-MO can be used for solving optimization problems effectively.

关键词： Crow search algorithm Opposition based learning Mutation operator Optimization FOPID controller

来源：评论

学校读者我要写书评

暂无评论

A cache-based search algorithm in unstructured P2P networks

引用

JOURNAL OF INTELLIGENT MANUFACTURING 2012年第6期23卷 2101-2107页

作者： Liu, Yuhua Wu, Shishun Xiong, Naixue Park, Jong Hyuk Zhang, Maoyuan Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Huazhong Normal Univ Dept Comp Sci Wuhan 430079 Peoples R China Fuzhou Univ Dept Comp Sci Fuzhou 350002 Peoples R China Seoul Natl Univ Sci & Technol Dept Comp Sci & Engn Seoul South Korea

Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay.

关键词： P2P network Flooding Index cache Content cache search algorithm Memory

来源：评论

学校读者我要写书评

暂无评论

On the inter-instrument and the inter-laboratory transferability of a tandem mass spectral reference library: 2. Optimization and characterization of the search algorithm

引用

JOURNAL OF MASS SPECTROMETRY 2009年第4期44卷 494-502页

作者： Oberacher, Herbert Pavlic, Marion Libiseller, Kathrin Schubert, Birthe Sulyok, Michael Schuhmacher, Rainer Csaszar, Edina Koefeler, Harald C. Innsbruck Med Univ Inst Legal Med A-6020 Innsbruck Austria Univ Nat Resources & Appl Life Sci Dept IFA Tulln Ctr Analyt Chem Vienna Austria Univ Vienna Dept Biochem Max F Perutz Labs Univ DeptVienna Bioctr Vienna Austria Med Univ Graz Med Res Ctr Core Facil Mass Spectrometry Graz Austria

A sophisticated matching algorithm developed for highly efficient identity search within tandem mass spectral libraries is presented. For the optimization of the search procedure a collection of 410 tandem mass spectra corresponding to 22 compounds was used. The spectra were acquired in three different laboratories on four different instruments. The following types of tandem mass spectrometric instruments were used: quadrupole-quadrupole-time-of-flight (QqTOF), quadrupole-quadrupole-linear ion trap (QqLIT), quadrupole-quadrupole-quadrupole (QqQ), and linear ion trap-Fourier transform ion cyclotron resonance mass spectrometer (LIT-FTICR). The obtained spectra were matched to an established MS/MS-spectral library that contained 3759 MS/MS-spectra corresponding to 402 different reference compounds. All 22 test compounds were part of the library. A dynamic intensity cut-off, the search for neutral losses, and optimization of the formula used to calculate the match probability were shown to significantly enhance the performance of the presented library search approach. With the aid of these features the average number of correct assignments was increased to 98%. For statistical evaluation of the match reliability the set of fragment ion spectra was extended with 300 spectra corresponding to 100 compounds not included in the reference library. Performance was checked with the aid of receiver operating characteristic (ROC) curves. Using the magnitude of the match probability as well as the precursor ion mass as benchmarks to rate the obtained top hit, overall correct classification of a compound being included or not included in the mass spectrometric library, was obtained in more than 95% of cases clearly indicating a high predictive accuracy of the established matching procedure. Copyright (C) 2009 John Wiley & Sons, Ltd.

关键词： tandem mass spectrometry library search algorithm

来源：评论

学校读者我要写书评

暂无评论

A gm/ID Methodology Based Data-Driven search algorithm for the Design of Multistage Multipath Feed-Forward-Compensated Amplifiers Targeting High Speed Continuous-Time ΣΔ-Modulators

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2020年第12期39卷 4311-4324页

作者： Gebreyohannes, Fikre Tsigabu Porte, Jacky Louerat, Marie-Minerve Aboushady, Hassan Sorbonne Univ CNRS LIP6 F-75005 Paris France Univ Paris Saclay CEA IRFU Gif Sur Yvette France

This article presents a methodology for sizing transistors of a multistage, multipath capacitor-less feed-forward compensated operational amplifiers employed in advanced CMOS process implementation of continuous-time bandpass Sigma Delta-modulators. This article describes the methodology: on system level, dealing with the placement of poles and zeros;and on the circuit level, discussing issues related to biasing, frequency response and other important performance metrics of the basic diff-pair. algorithms are provided to simplify mathematical aspects of the work. The validity and the limitations of the proposed methodology are further discussed from the single-pole system used to model the individual amplification stages of the multistage amplifier. The worthiness of the proposed methodology in sizing the transistors of complex amplifier structures, such as the capacitor-less multistage, multipath feed-forward-compensated amplifiers is demonstrated using two design examples. A third-order amplifier with a dc gain of 52.6 dB and that reaches a unity-gain frequency of above 14 GHz while consuming only 5.6 mA from a 1-V supply;and a fourth-order amplifier with dc gain of 73.5 dB that achieves a 25.7-dB gain at 1 GHz while consuming 4.8 mW are designed in 28-nm CMOS FDSOI.

关键词： Continuous time feed-forward compensation gm/D-i methodology MATLAB script multipath multistage operational amplifier search algorithm sigma delta modulator

来源：评论

学校读者我要写书评

暂无评论

Quantum walk search algorithm for multi-objective searching with iteration auto-controlling on hypercube

引用

Chinese Physics B 2022年第4期31卷 157-162页

作者： Yao-Yao Jiang Peng-Cheng Chu Wen-Bin Zhang Hong-Yang Ma School of Science Qingdao University of TechnologyQingdao 266033China School of Information and Control Engineering Qingdao University of TechnologyQingdao 266033China

Shenvi et *** proposed a quantum algorithm based on quantum walking called Shenvi-Kempe-Whaley(SKW)algorithm,but this search algorithm can only search one target state and use a specific search target state ***,when there are more than two target nodes in the search space,the algorithm has certain *** though a multiobjective SKW search algorithm was proposed later,when the number of target nodes is more than two,the SKW search algorithm cannot be mapped to the same quotient *** addition,the calculation of the optimal target state depends on the number of target states *** previous studies,quantum computing and testing algorithms were used to solve this *** these solutions require more Oracle calls and cannot get a high accuracy ***,to solve the above problems,we improve the multi-target quantum walk search algorithm,and construct a controllable quantum walk search algorithm under the condition of unknown number of target *** dividing the Hilbert space into multiple subspaces,the accuracy of the search algorithm is improved from p_(c)=(1/2)-O(1/n)to p_(c)=1-O(1/n).And by adding detection gate phase,the algorithm can stop when the amplitude of the target state becomes the maximum for the first time,and the algorithm can always maintain the optimal number of iterations,so as to reduce the number of unnecessary iterations in the algorithm process and make the number of iterations reach t_(f)=(π/2)(?).

关键词： multi-objective quantum walk search algorithm accurate probability

来源：评论

学校读者我要写书评

暂无评论

A Collaborative Beetle Antennae search algorithm Using Memory Based Adaptive Learning

引用

APPLIED ARTIFICIAL INTELLIGENCE 2021年第6期35卷 440-475页

作者： Ghosh, Tamal Martinsen, Kristian Norwegian Univ Sci & Technol Dept Mfg & Civil Engn Teknologivegen 22 N-2815 Gjovik Norway

Recently developed Beetle Antennae search algorithm (BAS) mimics the odor sensing mechanism of the longhorn beetles. The beetles have many species and many of these are advantageous to the nature as well as the mankind. Excepting the odor sensing activity, the beetles are naturally strong insects, and some of them have storage memory for adaptive learning and showcase social behavior. These natural mechanisms make them intelligent enough to perform the routine tasks for existence. This article proposes a novel Storage (Memory) Adaptive Collaborative BAS (SACBAS) algorithm, which incorporates the memory stored adaptive learning. This helps exploit the Group Extreme Value (GEV) instead of the Individual Extreme Values in swarm for faster convergence. Further, the SACBAS uses the reference points based on non-dominated sorting to diversify the state space. To test the data-driven performance of SACBAS, the Support Vector Machine (SVM) algorithm with linear kernel is used in this study. First, the SACBAS algorithm is tested on the multi-objective ZDT and DTLZ test-suites and compared with two recent techniques, the reference points based Non-dominated Sorting Genetic algorithm (NSGA III) and Multi-Objective Evolutionary algorithm based on Decomposition (MOEA/D). Second, the data-driven SACBAS is tested with real-world cases based on offline data. The proposed SACBAS is shown to handle the offline data efficiently and obtains promising results. The Friedman Test is carried out to differentiate the SACBAS from other two techniques and the Post Hoc Test confirms that the SACBAS obtains better HyperVolume indicator scores and outperforms the NSGA III and MOEA/D.

关键词： Adaptive learning Support-vector machine search algorithm Beetle Genetic algorithm Evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

New search algorithm for solving the maintenance scheduling problem for a family of machines

引用

OPTIMIZATION METHODS & SOFTWARE 2006年第3期21卷 461-477页

作者： Huang, JY Nan Kai Coll 568 Dept Ind Engn & Management Tsao Tuen Nan tou County Taiwan

In many real-world applications, the cost associate with maintenance could be very significant since the maintenance work is subcontract or repairmen have to make a special trip from some central place to carry out the work. The focus of this study is to optimally coordinate the maintenance schedule of machines to save the maintenance cost incurred, which is named as the maintenance scheduling problem for a family of machines (MSPFM). Before presenting our solution approach, we first review Goyal and Kusy's [Goyal, S.K. and Kusy, M.I., 1985, Determining economic maintenance frequency for a family of machines. Journal of the Operational Research Society , 36(12), 1125-1128.] model and their heuristic for solving the MSPFM. In this study, we conduct full analysis on the mathematical model for the MSPFM. By utilizing our theoretical results, we propose a new search algorithm that solves the optimal solution for the MSPFM very efficiently. Using 36,000 instances randomly generated, we show that our new search algorithm obtains better solutions than Goyal and Kusy's heuristic.

关键词： family of machines maintenance scheduling search algorithm

来源：评论

学校读者我要写书评

暂无评论

Large dynamic range Shack-Hartmann wavefront measurement based on image segmentation and a neighbouring-region search algorithm

引用

OPTICS COMMUNICATIONS 2019年 450卷 190-201页

作者： Gao, Zeyu Li, Xinyang Ye, Hongwei Chinese Acad Sci Key Lab Adapt Opt Chengdu 610209 Sichuan Peoples R China Chinese Acad Sci Inst Opt & Elect Chengdu 610209 Sichuan Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China

The Shack-Hartmann wavefront sensor (SHWFS) has been used to measure wavefronts. However, the dynamic range and measurement accuracy limits the application of the SHWFS. A new centroid estimation algorithm based on image segmentation and related techniques to expand the dynamic range based on search strategy is presented in this paper. In this study, each spot is segmented from a spot array image and the centroid of each spot is calculated only in regions of segmented spots. To compute the slope between the spot centroid and the sub-aperture centre, the calculated centroids are assigned to their corresponding sub-apertures using a search method. The proposed method overcomes the limitations that the centroid must be calculated in its corresponding detection area and reduces the measurement errors caused by noise, expanding the dynamic range significantly without any change to the SHWFS setup as well as improving the measurement accuracy under strong noise. Moreover, the proposed method provides a unit linear coefficient response of centroid estimation. The dynamic range for the proposed method is evaluated by numerical simulations and experiments. Applications include measurement accuracy and linearity.

关键词： Shack-Hartmann wavefront sensor Dynamic range Wavefront measurement Centroiding methods Image segmentation search algorithm

来源：评论

学校读者我要写书评

暂无评论

A new iterative computer search algorithm for good quasi-twisted codes

引用

DESIGNS CODES AND CRYPTOGRAPHY 2015年第2期76卷 307-323页

作者： Chen, Eric Zhi Kristianstad Univ Dept Comp Sci S-29188 Kristianstad Sweden

As a generalization to cyclic and consta-cyclic codes, quasi-twisted (QT) codes contain many good linear codes. During the last twenty years, a lot of record-breaking codes have been found by computer search for good QT codes. But due to the time complexity, very few QT codes have been reported recently. In this paper, a new iterative, heuristic computer search algorithm is presented, and a lot of new QT codes have been obtained. With these results, a total of 45 entries in the code tables for the best-known codes have been improved. Also, as an example to show the effectiveness of the algorithm, 8 better binary quasi-cyclic codes with dimension 12 and than previously best-known results are constructed.

关键词： Best-known codes Coding theory search algorithm Linear codes Quasi-twisted codes Simplex code

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：