期刊文献+
共找到43篇文章
< 1 2 3 >
每页显示 20 50 100
A Portfolio Selection Method Based on Pattern Matching with Dual Information of Direction and Distance
1
作者 Xinyi He 《Applied Mathematics》 2024年第5期313-330,共18页
Pattern matching method is one of the classic classifications of existing online portfolio selection strategies. This article aims to study the key aspects of this method—measurement of similarity and selection of si... Pattern matching method is one of the classic classifications of existing online portfolio selection strategies. This article aims to study the key aspects of this method—measurement of similarity and selection of similarity sets, and proposes a Portfolio Selection Method based on Pattern Matching with Dual Information of Direction and Distance (PMDI). By studying different combination methods of indicators such as Euclidean distance, Chebyshev distance, and correlation coefficient, important information such as direction and distance in stock historical price information is extracted, thereby filtering out the similarity set required for pattern matching based investment portfolio selection algorithms. A large number of experiments conducted on two datasets of real stock markets have shown that PMDI outperforms other algorithms in balancing income and risk. Therefore, it is suitable for the financial environment in the real world. 展开更多
关键词 Online Portfolio Selection pattern matching Similarity Measurement
下载PDF
Exact Graph Pattern Matching:Applications,Progress and Prospects
2
作者 孙国豪 余水 +1 位作者 方秀 陆金虎 《Journal of Donghua University(English Edition)》 CAS 2023年第2期216-224,共9页
Graph pattern matching(GPM)can be used to mine the key information in graphs.Exact GPM is one of the most commonly used methods among all the GPM-related methods,which aims to exactly find all subgraphs for a given qu... Graph pattern matching(GPM)can be used to mine the key information in graphs.Exact GPM is one of the most commonly used methods among all the GPM-related methods,which aims to exactly find all subgraphs for a given query graph in a data graph.The exact GPM has been widely used in biological data analyses,social network analyses and other fields.In this paper,the applications of the exact GPM were first introduced,and the research progress of the exact GPM was summarized.Then,the related algorithms were introduced in detail,and the experiments on the state-of-the-art exact GPM algorithms were conducted to compare their performance.Based on the experimental results,the applicable scenarios of the algorithms were pointed out.New research opportunities in this area were proposed. 展开更多
关键词 graph pattern matching(GPM) exact matching subgraph isomorphism graph embedding subgraph matching
下载PDF
New multi-pattern matching algorithm 被引量:2
3
作者 Liu Gongshen Li Jianhua Li Shenghong 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第2期437-442,共6页
The traditional multiple pattern matching algorithm, deterministic finite state automata, is implemented by tree structure. A new algorithm is proposed by substituting sequential binary tree for traditional tree. It i... The traditional multiple pattern matching algorithm, deterministic finite state automata, is implemented by tree structure. A new algorithm is proposed by substituting sequential binary tree for traditional tree. It is proved by experiment that the algorithm has three features, its construction process is quick, its cost of memory is small. At the same time, its searching process is as quick as the traditional algorithm. The algorithm is suitable for the application which requires preprocessing the patterns dynamically. 展开更多
关键词 multiple pattern matching finite state automata sequential binary tree.
下载PDF
Fast Multi-Pattern Matching Algorithm on Compressed Network Traffic 被引量:2
4
作者 Hao Peng Jianxin Li +1 位作者 Bo Li M.Hassan Arif 《China Communications》 SCIE CSCD 2016年第5期141-150,共10页
Pattern matching is a fundamental approach to detect malicious behaviors and information over Internet, which has been gradually used in high-speed network traffic analysis. However, there is a performance bottleneck ... Pattern matching is a fundamental approach to detect malicious behaviors and information over Internet, which has been gradually used in high-speed network traffic analysis. However, there is a performance bottleneck for multi-pattern matching on online compressed network traffic(CNT), this is because malicious and intrusion codes are often embedded into compressed network traffic. In this paper, we propose an online fast and multi-pattern matching algorithm on compressed network traffic(FMMCN). FMMCN employs two types of jumping, i.e. jumping during sliding window and a string jump scanning strategy to skip unnecessary compressed bytes. Moreover, FMMCN has the ability to efficiently process multiple large volume of networks such as HTTP traffic, vehicles traffic, and other Internet-based services. The experimental results show that FMMCN can ignore more than 89.5% of bytes, and its maximum speed reaches 176.470MB/s in a midrange switches device, which is faster than the current fastest algorithm ACCH by almost 73.15 MB/s. 展开更多
关键词 compressed network traffic network security multiple pattern matching skip scanning depth of boundary
下载PDF
A Novel Mathematical Model for Similarity Search in Pattern Matching Algorithms 被引量:1
5
作者 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
POINT PATTERN MATCHING ALGORITHM BASED ON POINT PAIR TOPOLOGICAL CHARACTERISTICS AND SPECTRAL MATCHING 被引量:1
6
作者 Lu Chunyan Zou Huanxin +1 位作者 Zhao Jian Zhou Shilin 《Journal of Electronics(China)》 2012年第3期279-285,共7页
Most of the Point Pattern Matching (PPM) algorithm performs poorly when the noise of the point's position and outliers exist. This paper presents a novel and robust PPM algorithm which combined Point Pair Topologi... Most of the Point Pattern Matching (PPM) algorithm performs poorly when the noise of the point's position and outliers exist. This paper presents a novel and robust PPM algorithm which combined Point Pair Topological Characteristics (PPTC) and Spectral Matching (SM) together to solve the afore mentioned issues. In which PPTC, a new shape descriptor, is firstly proposed. A new comparability measurement based on PPTC is defined as the matching probability. Finally, the correct matching results are achieved by the spectral matching method. The synthetic data experiments show its robustness by comparing with the other state-of-art algorithms and the real world data experiments show its effectiveness. 展开更多
关键词 Point pattern matching (PPM) Point Pair Topological Characteristics (PPTC) Assign graph Spectral matching
下载PDF
Assessing Risk in Chemical Plant with Pattern Matching
7
作者 P.K.Bandyopadhyay S.C.Roy S.N.Sen 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2002年第2期249-253,共5页
This paper discusses potential application of fuzzy set theory,more specifically, pattern matching, in assessing risk in chemicalplants. Risk factors have been evaluated using linguisticrepresentations of the quantity... This paper discusses potential application of fuzzy set theory,more specifically, pattern matching, in assessing risk in chemicalplants. Risk factors have been evaluated using linguisticrepresentations of the quantity of the hazardous substance involved,its frequency of interaction with the environment, severity of itsimpact and the uncertainty involved in its detection in advance. Foreach linguistic value there is a corresponding membership functionranging over a universe of discourse. The risk scenario created by ahazard/hazardous situation having highest degree of featural value istaken as the known pattern. 展开更多
关键词 RISK chemical process fuzzy set pattern matching
下载PDF
A Stream Pattern Matching Method for Traffic Analysis
8
作者 Zhu Hui Li Hui Mo Can 《China Communications》 SCIE CSCD 2010年第6期86-93,共8页
In order to identify any traces of suspicious activities for the networks security, Network Traffic Analysis has been the basis of network security and network management. With the continued emergence of new applicati... In order to identify any traces of suspicious activities for the networks security, Network Traffic Analysis has been the basis of network security and network management. With the continued emergence of new applications and encrypted traffic, the currently available approaches can not perform well for all kinds of network data. In this paper, we propose a novel stream pattern matching technique which is not only easily deployed but also includes the advantages of different methods. The main idea is: first, defining a formal description specification, by which any series of data stream can be unambiguously descrbed by a special stream pattern; then a tree representation is constructed by parsing the stream pattern; at last, a stream pattern engine is constructed with the Non-t-mite automata (S-CG-NFA) and Bit-parallel searching algorithms. Our stream pattern analysis system has been fully prototyped on C programming language and Xilinx Vn-tex2 FPGA. The experimental results show the method could provides a high level of recognition efficiency and accuracy. 展开更多
关键词 traffic analysis stream pattern match non-finite automata bit-parallel
下载PDF
Fast algorithm on string cross pattern matching
9
作者 LiuGongshen LiJianhua LiShenghong 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2005年第1期179-186,共8页
Given a set U which is consisted of strings defined on alphabet Σ, string cross pattern matching is to find all the matches between every two strings in U. It is utilized in text processing like removing the duplicat... Given a set U which is consisted of strings defined on alphabet Σ, string cross pattern matching is to find all the matches between every two strings in U. It is utilized in text processing like removing the duplication of strings. This paper presents a fast string cross pattern matching algorithm based on extracting high frequency strings. Compared with existing algorithms including single-pattern algorithms and multi-pattern matching algorithms, this algorithm is featured by both low time complexity and low space complexity. Because Chinese alphabet is large and the average length of Chinese words is much short, this algorithm is more suitable to process the text written by Chinese, especially when the size of Σ is large and the number of strings is far more than the maximum length of strings of set U. 展开更多
关键词 pattern matching high frequency string string cross pattern matching.
下载PDF
A Single Pattern Matching Algorithm Based on Character Frequency
10
作者 刘功申 Wang Yongcheng +1 位作者 Hu Peihua Li Ning 《High Technology Letters》 EI CAS 2003年第2期47-50,共4页
Based on the study of single pattern matching, MBF algorithm is proposed by imitating the string searching procedure of human. The algorithm preprocesses the pattern by using the idea of Quick Search algorithm and the... Based on the study of single pattern matching, MBF algorithm is proposed by imitating the string searching procedure of human. The algorithm preprocesses the pattern by using the idea of Quick Search algorithm and the already-matched pattern psefix and suffix information. In searching phase, the algorithm makes use of the!character using frequency and the continue-skip idea. The experiment shows that MBF algorithm is more efficient than other algorithms. 展开更多
关键词 character using frequency pattern matching STRING
下载PDF
A Fast Pattern Matching Algorithm Using Changing Consecutive Characters
11
作者 Amjad Hudaib Dima Suleiman Arafat Awajan 《Journal of Software Engineering and Applications》 2016年第8期399-411,共13页
Pattern matching is a very important algorithm used in many applications such as search engine and DNA analysis. They are aiming to find a pattern in a text. This paper proposes a Pattern Matching Algorithm Using Chan... Pattern matching is a very important algorithm used in many applications such as search engine and DNA analysis. They are aiming to find a pattern in a text. This paper proposes a Pattern Matching Algorithm Using Changing Consecutive Characters (PMCCC) to make the searching pro- cess of the algorithm faster. PMCCC enhances the shift process that determines how the pattern moves in case of the occurrence of the mismatch between the pattern and the text. It enhances the Berry Ravindran (BR) shift function by using m consecutive characters where m is the pattern length. The formal basis and the algorithms are presented. The experimental results show that PMCCC made enhancements in searching process by reducing the number of comparisons and the number of attempts. Comparing the results of PMCCC with other related algorithms has shown significant enhancements in average number of comparisons and average number of attempts. 展开更多
关键词 pattern pattern matching Algorithms String matching Berry Ravindran EBR RS-A Fast pattern matching Algorithms
下载PDF
Location estimation of autonomous driving robot and 3D tunnel mapping in underground mines using pattern matched LiDAR sequential images 被引量:4
12
作者 Heonmoo Kim Yosoon Choi 《International Journal of Mining Science and Technology》 SCIE EI CAS CSCD 2021年第5期779-788,共10页
In this study,a machine vision-based pattern matching technique was applied to estimate the location of an autonomous driving robot and perform 3D tunnel mapping in an underground mine environment.The autonomous drivi... In this study,a machine vision-based pattern matching technique was applied to estimate the location of an autonomous driving robot and perform 3D tunnel mapping in an underground mine environment.The autonomous driving robot continuously detects the wall of the tunnel in the horizontal direction using the light detection and ranging(Li DAR)sensor and performs pattern matching by recognizing the shape of the tunnel wall.The proposed method was designed to measure the heading of the robot by fusion with the inertial measurement units sensor according to the pattern matching accuracy;it is combined with the encoder sensor to estimate the location of the robot.In addition,when the robot is driving,the vertical direction of the underground mine is scanned through the vertical Li DAR sensor and stacked to create a 3D map of the underground mine.The performance of the proposed method was superior to that of previous studies;the mean absolute error achieved was 0.08 m for the X-Y axes.A root mean square error of 0.05 m^(2)was achieved by comparing the tunnel section maps that were created by the autonomous driving robot to those of manual surveying. 展开更多
关键词 pattern matching Location estimation Autonomous driving robot 3D tunnel mapping Underground mine
下载PDF
Spectral matching algorithm based on nonsubsampled contourlet transform and scale-invariant feature transform 被引量:4
13
作者 Dong Liang Pu Yan +2 位作者 Ming Zhu Yizheng Fan Kui Wang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2012年第3期453-459,共7页
A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low freq... A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix (or matching result) reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy. 展开更多
关键词 point pattern matching nonsubsampled contourlet transform scale-invariant feature transform spectral algorithm.
下载PDF
Modified Multi-Resolution Telescopic Search Algorithm for Block-Matching Motion Estimation
14
作者 Zhang, W. Zhou, R. Kondo, T. 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2001年第3期90-96,共7页
This paper presents a modified multi-resolution telescopic search algorithm (MRTlcSA) for the block-matching motion estimation. A novel inverse telescopic search is substituted for the conventional telescopic search, ... This paper presents a modified multi-resolution telescopic search algorithm (MRTlcSA) for the block-matching motion estimation. A novel inverse telescopic search is substituted for the conventional telescopic search, that reduces the on-chip memory size and memory bandwidth for VLSI implementation. In addition, strategies of motion track and adaptive search window are applied to reduce the computational complexity of motion estimation. Simulation results show that, compared with the MRTleSA, the proposed algorithm reduces the computational load to only 30% while preserving almost the same image quality. Comparisons on hardware cost and power consumption of the VLSI implementations using the two algorithms are also presented in the paper. 展开更多
关键词 ALGORITHMS BANDWIDTH Computational complexity Computer simulation Image quality Microprocessor chips Optical resolving power Optical telescopes pattern matching VLSI circuits
下载PDF
Parallel Quick Search Algorithm for the Exact String Matching Problem Using OpenMP
15
作者 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
Mobile crowd sensing task optimal allocation: a mobility pattern matching perspective 被引量:8
16
作者 Liang WANG Zhiwen YU +2 位作者 Bin GUO Fei YI Fei XIONG 《Frontiers of Computer Science》 SCIE EI CSCD 2018年第2期231-244,共14页
With the proliferation of sensor-equipped portable mobile devices, Mobile CrowdSensing (MCS) using smart devices provides unprecedented opportunities for collecting enormous surrounding data. In MCS applications, a ... With the proliferation of sensor-equipped portable mobile devices, Mobile CrowdSensing (MCS) using smart devices provides unprecedented opportunities for collecting enormous surrounding data. In MCS applications, a crucial issue is how to recruit appropriate participants from a pool of available users to accomplish released tasks, satisfying both resource efficiency and sensing quality. In order to meet these two optimization goals simultaneously, in this paper, we present a novel MCS task allocation framework by aligning existing task sequence with users' moving regularity as much as possible. Based on the process of mobility repetitive pattern discovery, the original task allocation problem is converted into a pattern matching issue, and the involved optimization goals are transformed into pattern matching length and support degree indicators. To determine a trade-off between these two competitive metrics, we propose greedy- based optimal assignment scheme search approaches, namely MLP, MDP, IU1 and IU2 algorithm, with respect to matching length-preferred, support degree-preferred and integrated utility, respectively. Comprehensive experiments on real- world open data set and synthetic data set clearly validate the effectiveness of our proposed framework on MCS task optimal allocation. 展开更多
关键词 mobile crowd sensing task allocation mobility regularity pattern matching
原文传递
Pattern Matching with Flexible Wildcards 被引量:2
17
作者 吴信东 强继朋 谢飞 《Journal of Computer Science & Technology》 SCIE EI CSCD 2014年第5期740-750,共11页
Pattern matching with wildcards(PMW) has great theoretical and practical significance in bioinformatics,information retrieval, and pattern mining. Due to the uncertainty of wildcards, not only is the number of all m... Pattern matching with wildcards(PMW) has great theoretical and practical significance in bioinformatics,information retrieval, and pattern mining. Due to the uncertainty of wildcards, not only is the number of all matches exponential with respect to the maximal gap flexibility and the pattern length, but the matching positions in PMW are also hard to choose. The objective to count the maximal number of matches one by one is computationally infeasible. Therefore,rather than solving the generic PMW problem, many research efforts have further defined new problems within PMW according to different application backgrounds. To break through the limitations of either fixing the number or allowing an unbounded number of wildcards, pattern matching with flexible wildcards(PMFW) allows the users to control the ranges of wildcards. In this paper, we provide a survey on the state-of-the-art algorithms for PMFW, with detailed analyses and comparisons, and discuss challenges and opportunities in PMFW research and applications. 展开更多
关键词 pattern matching WILDCARDS BIOINFORMATICS pattern mining
原文传递
Revisiting Multiple Pattern Matching Algorithms for Multi-Core Architecture 被引量:2
18
作者 谭光明 刘萍 +1 位作者 卜东波 刘燕兵 《Journal of Computer Science & Technology》 SCIE EI CSCD 2011年第5期866-874,共9页
Due to the huge size of patterns to be searched,multiple pattern searching remains a challenge to several newly-arising applications like network intrusion detection.In this paper,we present an attempt to design effic... Due to the huge size of patterns to be searched,multiple pattern searching remains a challenge to several newly-arising applications like network intrusion detection.In this paper,we present an attempt to design efficient multiple pattern searching algorithms on multi-core architectures.We observe an important feature which indicates that the multiple pattern matching time mainly depends on the number and minimal length of patterns.The multi-core algorithm proposed in this paper leverages this feature to decompose pattern set so that the parallel execution time is minimized.We formulate the problem as an optimal decomposition and scheduling of a pattern set,then propose a heuristic algorithm,which takes advantage of dynamic programming and greedy algorithmic techniques,to solve the optimization problem.Experimental results suggest that our decomposition approach can increase the searching speed by more than 200% on a 4-core AMD Barcelona system. 展开更多
关键词 parallel algorithm MULTI-CORE multiple pattern matching
原文传递
Point pattern Matching Using Irreducible Matrixand Relative Invariant 被引量:1
19
作者 张立华 徐文立 《Tsinghua Science and Technology》 SCIE EI CAS 1999年第4期1602-1605,共4页
Point pattern matchingisanimportantproblem inthefieldsofcomputervision and patternrecognition.In this paper,new algorithms based onirreducible matrix andrelativeinvariantfor matchingtwosets ofpoints withthe same ca... Point pattern matchingisanimportantproblem inthefieldsofcomputervision and patternrecognition.In this paper,new algorithms based onirreducible matrix andrelativeinvariantfor matchingtwosets ofpoints withthe same cardinality are proposed.Theirfundamentalideaistransformingthetwo dimensionalpointsets with n points intothe vectorsin n dimensional space. Considering these vectors as one dimensional point patterns,these new algorithms aim atreducingthe point matching problem to thatofsorting vectorsin n dimensionalspace aslong asthe sensornoise does notalterthe order ofthe elementsinthe vectors.Theoreticalanalysis and simulationresults show thatthe new algorithms are effective . 展开更多
关键词 point pattern matching irreducible matrix affine transformation similarity transformation relative invariant
原文传递
A geometric reasoning based algorithm for point pattern matching 被引量:1
20
作者 徐文立 张立华 《Science in China(Series F)》 2001年第6期445-452,共8页
Point pattern matching (PPM) is an important topic in computer vision and pattern recog-nition . It can be widely used in many areas such as image registration, object recognition, motion de-tection, target tracking, ... Point pattern matching (PPM) is an important topic in computer vision and pattern recog-nition . It can be widely used in many areas such as image registration, object recognition, motion de-tection, target tracking, autonomous navigation, and pose estimation. This paper discusses the in-complete matching problem of two point sets under Euclidean transformation. According to geometric reasoning, some definitions for matching clique, support point pair, support index set, and support in-dex matrix, etc. are given. Based on the properties and theorems of them, a novel reasoning algo-rithm is presented, which searches for the optimal solution from top to bottom and could find out as many consistent corresponding point pairs as possible. Theoretical analysis and experimental results show that the new algorithm is very effective, and could be, under some conditions, applied to the PPM problem under other kind of transformations. 展开更多
关键词 point pattern matching rigid transformation geometric reasoning matching clique index matrix.
原文传递
上一页 1 2 3 下一页 到第
使用帮助 返回顶部