期刊文献+
共找到662篇文章
< 1 2 34 >
每页显示 20 50 100
Analysis on Spiral Search Pattern for Moving Target
1
作者 鄂群 马远良 +2 位作者 周舟 王明晨 王连柱 《Defence Technology(防务技术)》 SCIE EI CAS 2008年第1期44-47,共4页
The distribution function of the target moving in constant velocity and linear course and its meeting condition to the searcher are analyzed.Another proof method for spiral search pattern is presented and the mathemat... The distribution function of the target moving in constant velocity and linear course and its meeting condition to the searcher are analyzed.Another proof method for spiral search pattern is presented and the mathematic model of the target possible position is established when performing the linear search.Base on them,the wrong idea about the spiral search pattern can be 展开更多
关键词 操作研究 搜索理论 搜索模式 移动目标 聚集条件
在线阅读 下载PDF
A Filter-Based Pattern Search Method for Unconstrained Optimization 被引量:4
2
作者 Ting Wu Linping Sun 《Numerical Mathematics A Journal of Chinese Universities(English Series)》 SCIE 2006年第3期209-216,共8页
We discuss a filter-based pattern search method for unconstrained optimization in this paper. For the purpose to broaden the search range we use both filter technique and frames, which are fragments of grids, to provi... We discuss a filter-based pattern search method for unconstrained optimization in this paper. For the purpose to broaden the search range we use both filter technique and frames, which are fragments of grids, to provide a new criterion of iterate acceptance. The convergence can be ensured under some conditions. The numerical result shows that this method is practical and efficient. 展开更多
关键词 直接搜索 模型搜索 滤波器 无约束优化
在线阅读 下载PDF
Adaptive backtracking search optimization algorithm with pattern search for numerical optimization 被引量:6
3
作者 Shu Wang Xinyu Da +1 位作者 Mudong Li Tong Han 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2016年第2期395-406,共12页
The backtracking search optimization algorithm(BSA) is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powe... The backtracking search optimization algorithm(BSA) is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts: the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA's important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014(IEEE CEC2014) over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm. 展开更多
关键词 evolutionary algorithm backtracking search optimization algorithm(BSA) Hooke-Jeeves pattern search parameter adaption numerical optimization
在线阅读 下载PDF
An Efficient Pattern Search Method 被引量:1
4
作者 Xiaoli Zhang Qinghua Zhou Yue Wang 《Journal of Applied Mathematics and Physics》 2013年第4期68-72,共5页
Pattern search algorithms is one of most frequently used methods which were designed to solve the derivative-free optimization problems. Such methods get growing need with the development of science, engineering, econ... Pattern search algorithms is one of most frequently used methods which were designed to solve the derivative-free optimization problems. Such methods get growing need with the development of science, engineering, economy and so on. Inspired by the idea of Hooke and Jeeves, we introduced an integer m in the algorithm which controls the number of steps of iteration update. We mean along the descent direction to allow the algorithm to?go ahead m steps at most to explore whether we can get better solution further. The experiment proved the strategy’s efficiency. 展开更多
关键词 UNCONSTRAINED OPTIMIZATION DERIVATIVE-FREE OPTIMIZATION pattern search Methods POSITIVE BASES
暂未订购
A hybrid stochastic fractal search and pattern search technique based cascade PI-PD controller for automatic generation control of multi-source power systems in presence of plug in electric vehicles 被引量:1
5
作者 Sasmita Padhy Sidhartha Panda 《CAAI Transactions on Intelligence Technology》 2017年第1期12-25,共14页
A hybrid Stochastic Fractal Search plus Pattern Search (hSFS-PS) based cascade PI-PD controller is suggested in this paper for Automatic Generation Control (AGC) of thermal, hydro and gas power unit based power sy... A hybrid Stochastic Fractal Search plus Pattern Search (hSFS-PS) based cascade PI-PD controller is suggested in this paper for Automatic Generation Control (AGC) of thermal, hydro and gas power unit based power systems in presence of Plug in Electric Vehicles (PEV). Firstly, a single area multi-source power system consisting of thermal hydro and gas power plants is considered and parameters of Integral (I) controller is optimized by Stochastic FractaI Search (SFS) algorithm. The superiority of SFS algorithm over some recently proposed approaches such as optimal control, differential evolution and teaching learning based optimization techniques is demonstrated by comparing simulation results for the identical power system. To improve the system performance further, Pattern Search (PS) is subsequently employed. The study is further extended for different controllers like PI, PID, and cascaded PI-PD controller and the superiority of cascade PI-PD controller over conventional controllers is demonstrated. Then, cascade PI- PD controller parameters of AGC searched using the proposed hSFS-PS algorithm in presence of plug in electric vehicles. The study is also extended to an interconnected power system. It is seen from the comparative analysis that hSFS-PS tuned PI-PD controller in single and multi-area with multi sources improves the system frequency stability in complicated situations. Lastly, a three area interconnected system with PEVs with dissimilar cascade PI-PD controller in each area is considered and proposed hSFS- PS algorithm is used to tune the controller parameters in presence of nonlinearities like rate constraint of units, dead zone of governor and communication delay. 展开更多
关键词 Automatic generation control Cascade PI-PD controller Stochastic fractal search pattern search Plug in electric vehicles
在线阅读 下载PDF
A Novel Mathematical Model for Similarity Search in Pattern Matching Algorithms 被引量:1
6
作者 P. Vinod-Prasad 《Journal of Computer and Communications》 2020年第9期94-99,共6页
Modern applications require large databases to be searched for regions that are similar to a given pattern. The DNA sequence analysis, speech and text recognition, artificial intelligence, Internet of Things, and many... Modern applications require large databases to be searched for regions that are similar to a given pattern. The DNA sequence analysis, speech and text recognition, artificial intelligence, Internet of Things, and many other applications highly depend on pattern matching or similarity searches. In this paper, we discuss some of the string matching solutions developed in the past. Then, we present a novel mathematical model to search for a given pattern and it’s near approximates in the text. 展开更多
关键词 String Matching pattern Matching Similarity search Substring search
在线阅读 下载PDF
A new damping ratio identification method based on pattern search
7
作者 刘彦 谭久彬 +1 位作者 谭志波 王雷 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2010年第1期141-144,共4页
In order to improve the effectiveness of traditional time domain identification methods in identifying damping ratios, a new damping ratio identification method based on pattern search is proposed by fluctuating the r... In order to improve the effectiveness of traditional time domain identification methods in identifying damping ratios, a new damping ratio identification method based on pattern search is proposed by fluctuating the reliable natural frequency obtained through traditional time domain identification methods by about 10% to build the boundary conditions, using all the initial identification results to establish the free decay response of the system, and using the pattern search method to correct the initial identification results with the residual sum of squares between the free decay response and the actually measured free-decay signal as the objective function. The proposed method deals with the actually measured free-decay signal with curve fitting and avoids enlarging the identified error caused by intermediate conversion, so it can effectively improve the identified accuracy of damping ratios. Simulations for a room-sized vibration isolation foundation show that the relative errors of analyzed three damping ratios are down to 1.05%, 1.51% and 3.7% by the proposed method from 8.42%, 5.85% and 8.5% by STD method when the noise level is 10%. 展开更多
关键词 modal parameter identification damping ratio pattern search
在线阅读 下载PDF
Economic Dispatch with Convex and Non-Convex Fuel Cost Functions Including Line Losses Using Pattern Search
8
作者 A.A. El-Fergany 《Journal of Energy and Power Engineering》 2011年第12期1187-1192,共6页
This article presents an application of generalized pattern search (PS) algorithm to solve economic load dispatch (ELD) problems with convex and non-convex fuel cost objective functions. Main objective of ELI) is... This article presents an application of generalized pattern search (PS) algorithm to solve economic load dispatch (ELD) problems with convex and non-convex fuel cost objective functions. Main objective of ELI) is to determine the most economic generating dispatch required to satisfy the predicted load demands including line losses. Relaxing various equality and inequality constraints are considered. The unit operation minhnum/maximum constraints, effects of valve-point and line losses are considered for the practical applications. Several case studies were tested and verified, which indicate an improvement in total fuel cost savings. The robustness of the proposed PS method have been assessed and investigated through intensive comparisons with reported results in recent researches. The results are very encouraging and suggesting that PS may be very useful tool in solving power system ELD problems. 展开更多
关键词 pattern search (PS) economic load dispatch valve-point effects optimal solution.
在线阅读 下载PDF
Joint Estimation of Elevation and Azimuth Angles with Triple-Parallel ULAs Using Metaheuristic and Direct Search Methods
9
作者 Fawad Zaman Adeel Iqbal +1 位作者 Bakhtiar Ali Abdul Khader Jilani Saudagar 《Computer Modeling in Engineering & Sciences》 2025年第11期2535-2550,共16页
Accurate estimation of the Direction-of-Arrival(DoA)of incident plane waves is essential for modern wireless communication,radar,sonar,and localization systems.Precise DoA information enables adaptive beamforming,spat... Accurate estimation of the Direction-of-Arrival(DoA)of incident plane waves is essential for modern wireless communication,radar,sonar,and localization systems.Precise DoA information enables adaptive beamforming,spatial filtering,and interference mitigation by steering antenna array beams toward desired sources while suppressing unwanted signals.Traditional one-dimensional Uniform Linear Arrays(ULAs)are limited to elevation angle estimation due to geometric constraints,typically within the range[0,π].To capture full spatial characteristics in environments with multipath and angular spread,joint estimation of both elevation and azimuth angles becomes necessary.However,existing 2D and 3D array geometries often entail increased hardware complexity and computational cost.This work proposes a novel and efficient framework for joint elevation and azimuth angle estimation using three spatially separated,parallel ULAs.The array configuration exploits spatial diversity and orthogonal projections to capture complete directional information with minimal structural overhead.A customized objective function based on the mean square error between measured and reconstructed array outputs is formulated to guide the estimation process.To solve the resulting non-convex optimization problem,three strategies are investigated:a global Genetic Algorithm(GA),a local Pattern Search(PS),and a hybrid GA-PS method that combines global exploration with local refinement.The proposed framework supports automatic pairing of elevation and azimuth angles,eliminating the need for manual post-processing.Extensive simulations validate the robustness,convergence,and accuracy of all three methods under varying signal-to-noise ratio conditions.Results confirm that the hybrid GA-PS approach achieves superior estimation performance and reduced computational complexity,making it well-suited for real-time and resource-constrained applications in next-generation sensing and communication systems. 展开更多
关键词 Antenna arrays direction of arrival genetic algorithm pattern search
在线阅读 下载PDF
A novel adjustable multiple cross-hexagonal search algorithm for fast block motion estimation 被引量:2
10
作者 XIE Chun-lai CHEUNG Chun-ho LIU Wei-zhong 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2007年第8期1304-1310,共7页
In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then use... In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS. 展开更多
关键词 Motion estimation Fast search algorithm Adjustable search patterns Threshold strategy Hexagonal search pattern
在线阅读 下载PDF
基于不经意随机访问机的对称可搜索加密技术研究进展
11
作者 樊松林 陈兰香 《福建师范大学学报(自然科学版)》 北大核心 2026年第2期43-53,共11页
对称可搜索加密(symmetric searchable encryption,SSE)技术允许用户将加密数据安全地存储于“诚实但好奇”的云服务器上,同时保留对密文的搜索查询能力。尽管数据被加密,用户与服务器的查询交互仍会泄露访问模式、搜索模式等敏感信息,... 对称可搜索加密(symmetric searchable encryption,SSE)技术允许用户将加密数据安全地存储于“诚实但好奇”的云服务器上,同时保留对密文的搜索查询能力。尽管数据被加密,用户与服务器的查询交互仍会泄露访问模式、搜索模式等敏感信息,严重威胁SSE的安全性。不经意随机访问机(oblivious random access machine,ORAM)可通过混淆内存访问的方式隐藏数据访问行为,已经被多种SSE方案用于隐藏泄露,但其存在计算复杂度与通信开销偏高的问题。从SSE与ORAM的底层实现机制出发,探讨二者融合方案在安全性与查询效率间的权衡策略,同时系统梳理了基于ORAM的SSE技术研究进展,并对该领域的未来研究方向进行展望。 展开更多
关键词 对称可搜索加密 访问模式 搜索模式 不经意随机访问机 隐藏泄漏
在线阅读 下载PDF
系统辨证脉学脉诊技术规范
12
作者 齐向华 滕晶 +4 位作者 闫伟 史俍元 康晨 丁晓 李甲民 《山东中医杂志》 2026年第2期117-121,共5页
系统辨证脉学是遵循系统论的基本原理和基本规律,融合临床经验,形成的具有独到见解、容纳多学科、涵盖多层面的全新脉学体系,其注重手指感觉功能的开发和分化、各种脉象要素感觉“情景记忆系统”的建立以及疾病过程中客观“证据链”的诊... 系统辨证脉学是遵循系统论的基本原理和基本规律,融合临床经验,形成的具有独到见解、容纳多学科、涵盖多层面的全新脉学体系,其注重手指感觉功能的开发和分化、各种脉象要素感觉“情景记忆系统”的建立以及疾病过程中客观“证据链”的诊查,具有系统、科学、规范、实用和易操作等特点。然而操作规范的缺失阻碍了系统辨证脉学脉诊技术的临床推广应用和进一步创新发展。文章结合现有研究成果、系统辨证脉学相关书籍和专家共识等,从切脉、识脉、审脉等方面对系统辨证脉学脉诊技术进行了规范,旨在推动系统辨证脉学脉诊技术的普及推广与创新发展。 展开更多
关键词 系统辨证脉学 脉象要素 切脉 识脉 审脉
暂未订购
Determination of AVR System PID Controller Parameters Using Improved Variants of Reptile Search Algorithm and a Novel Objective Function
13
作者 Baran Hekimoglu 《Energy Engineering》 EI 2023年第7期1515-1540,共26页
Two novel improved variants of reptile search algorithm(RSA),RSA with opposition-based learning(ORSA)and hybrid ORSA with pattern search(ORSAPS),are proposed to determine the proportional,integral,and derivative(PID)c... Two novel improved variants of reptile search algorithm(RSA),RSA with opposition-based learning(ORSA)and hybrid ORSA with pattern search(ORSAPS),are proposed to determine the proportional,integral,and derivative(PID)controller parameters of an automatic voltage regulator(AVR)system using a novel objective function with augmented flexibility.In the proposed algorithms,the opposition-based learning technique improves the global search abilities of the original RSA algorithm,while the hybridization with the pattern search(PS)algorithm improves the local search abilities.Both algorithms are compared with the original RSA algorithm and have shown to be highly effective algorithms for tuning the PID controller parameters of an AVR system by getting superior results.Several analyses such as transient,stability,robustness,disturbance rejection,and trajectory tracking are conducted to test the performance of the proposed algorithms,which have validated the good promise of the proposed methods for controller designs.The performances of the proposed design approaches are also compared with the previously reported PID controller parameter tuning approaches to assess their success.It is shown that both proposed approaches obtain excellent and robust results among all compared ones.That is,with the adjustment of the weight factorα,which is introduced by the proposed objective function,for a system with high bandwitdh(α=1),the proposed ORSAPS-PID system has 2.08%more bandwidth than the proposed ORSA-PID system and 5.1%faster than the fastest algorithm from the literature.On the other hand,for a system where high phase and gain margins are desired(α=10),the proposed ORSA-PID system has 0.53%more phase margin and 2.18%more gain margin than the proposed ORSAPS-PID system and has 0.71%more phase margin and 2.25%more gain margin than the best performing algorithm from the literature. 展开更多
关键词 Reptile search algorithm pattern search multidirectional search metaheuristics automatic voltage regulator optimal PID controller
在线阅读 下载PDF
Database Search Behaviors: Insight from a Survey of Information Retrieval Practices
14
作者 Babita Trivedi Brijender Dahiya +2 位作者 Anjali Maan Rajesh Giri Vinod Prasad 《Intelligent Information Management》 2024年第5期195-218,共24页
This study examines the database search behaviors of individuals, focusing on gender differences and the impact of planning habits on information retrieval. Data were collected from a survey of 198 respondents, catego... This study examines the database search behaviors of individuals, focusing on gender differences and the impact of planning habits on information retrieval. Data were collected from a survey of 198 respondents, categorized by their discipline, schooling background, internet usage, and information retrieval preferences. Key findings indicate that females are more likely to plan their searches in advance and prefer structured methods of information retrieval, such as using library portals and leading university websites. Males, however, tend to use web search engines and self-archiving methods more frequently. This analysis provides valuable insights for educational institutions and libraries to optimize their resources and services based on user behavior patterns. 展开更多
关键词 Information Retrieval Database search User Behavior patterns
在线阅读 下载PDF
一种具有多级安全目标的动态对称可搜索加密方案 被引量:1
15
作者 李功丽 李露 +1 位作者 黄昱晨 陈晓迪 《计算机应用研究》 北大核心 2025年第7期2168-2175,共8页
可搜索加密是将数据文件加密后存储到云端,然后对密文进行检索的一种技术。动态可搜索加密允许对云端的文件进行动态更新,然而现有动态可搜索加密方案都着重解决前向和后向安全问题且大多仅支持单用户搜索,无法同时保护搜索模式和访问... 可搜索加密是将数据文件加密后存储到云端,然后对密文进行检索的一种技术。动态可搜索加密允许对云端的文件进行动态更新,然而现有动态可搜索加密方案都着重解决前向和后向安全问题且大多仅支持单用户搜索,无法同时保护搜索模式和访问模式。针对上述问题,基于不经意键值对存储技术,设计了一种满足前向安全、隐藏搜索模式和访问模式、具有三级安全目标的动态对称可搜索加密方案TS-MDSSE。并在此基础上,进一步在更新算法中利用随机值替换技术,满足了后向安全,实现了具有四级安全目标的FS-MDSSE方案。安全分析与实验表明,所提方案不仅满足多等级安全目标,而且支持多用户查询,完成一次搜索仅需0.022 ms。 展开更多
关键词 动态对称可搜索加密 多用户 搜索模式隐藏 访问模式隐藏 前后向安全 多级安全目标
在线阅读 下载PDF
On the direct searches for non-smooth stochastic optimization problems
16
作者 Huang Tianyun 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2009年第4期889-898,共10页
Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new ... Many difficult engineering problems cannot be solved by the conventional optimization techniques in practice. Direct searches that need no recourse to explicit derivatives are revived and become popular since the new century. In order to get a deep insight into this field, some notes on the direct searches for non-smooth optimization problems are made. The global convergence vs. local convergence and their influences on expected solutions for simulation-based stochastic optimization are pointed out. The sufficient and simple decrease criteria for step acceptance are analyzed, and why simple decrease is enough for globalization in direct searches is identified. The reason to introduce the positive spanning set and its usage in direct searches is explained. Other topics such as the generalization of direct searches to bound, linear and non-linear constraints are also briefly discussed. 展开更多
关键词 non-linear programming non-smooth optimization stochastic simulation direct searches positive spanning set convergence analysis pattern selection.
在线阅读 下载PDF
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
17
作者 Sinan Sameer Mahmood Al-Dabbagh Nawaf Hazim Barnouti +1 位作者 Mustafa Abdul Sahib Naser Zaid G. Ali 《Journal of Computer and Communications》 2016年第13期1-11,共11页
String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that... String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the number of data that is created and kept by modern computational devices influences researchers to obtain even more powerful methods for coping with this problem. In this research, the Quick Search string matching algorithm are adopted to be implemented under the multi-core environment using OpenMP directive which can be employed to reduce the overall execution time of the program. English text, Proteins and DNA data types are utilized to examine the effect of parallelization and implementation of Quick Search string matching algorithm on multi-core based environment. Experimental outcomes reveal that the overall performance of the mentioned string matching algorithm has been improved, and the improvement in the execution time which has been obtained is considerable enough to recommend the multi-core environment as the suitable platform for parallelizing the Quick Search string matching algorithm. 展开更多
关键词 String Matching pattern Matching String searching ALGORITHMS Quick search Algorithm Exact String Matching Algorithm ? Parallelization OPENMP
在线阅读 下载PDF
结合论文施引特征和分布式检索技术的引文耦合度算法设计
18
作者 郭锐锋 常志军 +3 位作者 董美 张建勇 钱力 董智鹏 《小型微型计算机系统》 北大核心 2025年第2期297-304,共8页
大规模科技文献知识库的全量引文耦合关系因计算量巨大的难题,阻碍了引文耦合知识服务在诸多业务场景的应用.本文提出了一种适用于大规模文献知识库的全量引文耦合度计算算法,根据施引特征过滤没有耦合关系的无效组合,避免计算过程中稀... 大规模科技文献知识库的全量引文耦合关系因计算量巨大的难题,阻碍了引文耦合知识服务在诸多业务场景的应用.本文提出了一种适用于大规模文献知识库的全量引文耦合度计算算法,根据施引特征过滤没有耦合关系的无效组合,避免计算过程中稀疏矩阵的产生,并引入多模式匹配技术,优化算法的整体时间复杂度为O(n log z).本算法在生产环境中依赖分布式搜索引擎集群完成工程化实施.在国家科技图书文献中心的3600万篇科技文献数据库上,对该方法与传统引文耦合方法进行了多组实验对比,并生成了6.59亿论文对的耦合度数据,为国家科技图书文献中心的引文耦合知识服务提供了数据支持,验证了该方法的准确性和实用性. 展开更多
关键词 引文耦合度 分布式搜索引擎 稀疏矩阵 施引特征 多模式匹配
在线阅读 下载PDF
数字产品创新的架构搜索空间与创新模式——用友U8软件案例研究
19
作者 顾元勋 王立扬 《北京联合大学学报(人文社会科学版)》 2025年第3期76-88,共13页
数字产品的架构创新会经历数次创新搜索、逐步增加模块,从而突破既有架构范围。即使在有主导设计的情境下,架构创新前进方向与行动仍有差异,即创新模式有多样化可能。已有文献多囿于既存架构范围内对创新模式的利用,却未解决创新模式生... 数字产品的架构创新会经历数次创新搜索、逐步增加模块,从而突破既有架构范围。即使在有主导设计的情境下,架构创新前进方向与行动仍有差异,即创新模式有多样化可能。已有文献多囿于既存架构范围内对创新模式的利用,却未解决创新模式生成问题。由此,架构发展规律和方向设计——创新搜索空间的构建机理仍不清楚。本文对用友U8软件产品的案例探索形成“情境—学习—行动”搜索空间框架。情境以制度压力刻画,组织学习包含方式和策略,行动反映模块间相关性。并由搜索空间界定防御、反应、分析、前瞻四种创新元模式。研究结果揭示了数字产品架构创新的搜索空间构建原理和创新模式生成机制,为架构创新提供机会方向和参考方案集,对数字产品创新战略形成具有启发意义。 展开更多
关键词 数字产品架构 搜索空间 创新元模式 情境压力 相关性
在线阅读 下载PDF
Quantum Algorithm for Mining Frequent Patterns for Association Rule Mining 被引量:1
20
作者 Abdirahman Alasow Marek Perkowski 《Journal of Quantum Information Science》 CAS 2023年第1期1-23,共23页
Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting corre... Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting correlations, frequent patterns, associations, or causal structures between items hidden in a large database. By exploiting quantum computing, we propose an efficient quantum search algorithm design to discover the maximum frequent patterns. We modified Grover’s search algorithm so that a subspace of arbitrary symmetric states is used instead of the whole search space. We presented a novel quantum oracle design that employs a quantum counter to count the maximum frequent items and a quantum comparator to check with a minimum support threshold. The proposed derived algorithm increases the rate of the correct solutions since the search is only in a subspace. Furthermore, our algorithm significantly scales and optimizes the required number of qubits in design, which directly reflected positively on the performance. Our proposed design can accommodate more transactions and items and still have a good performance with a small number of qubits. 展开更多
关键词 Data Mining Association Rule Mining Frequent pattern Apriori Algorithm Quantum Counter Quantum Comparator Grover’s search Algorithm
在线阅读 下载PDF
上一页 1 2 34 下一页 到第
使用帮助 返回顶部