期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到4,160篇文章
< 1 2 … 208 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Real-Time Multi-Modal Image Matching Based on Lightweight Learning Model 认领 引用
1
作者 Jixuan Li Chenzhong Gao +2 位作者 Desheng Weng Yute Li Wei Li 《Journal of Beijing Institute of Technology》 EI CAS 2026年第3期253-262,共10页
This paper proposes an efficient algorithm for real-time multi-modal image matching based on a lightweight feature fusion network,targeting the challenges of multi-modal image matching in multi-source data analysis.Th... This paper proposes an efficient algorithm for real-time multi-modal image matching based on a lightweight feature fusion network,targeting the challenges of multi-modal image matching in multi-source data analysis.The algorithm addresses significant multi-modal feature differences and real-time processing limitations by incorporating key technologies including reparameterization in convolutional neural networks,multi-scale image pyramids,and feature fusion modules.The matching process employs a coarse-to-fine strategy,ensuring robust performance in complex environments.Experimental results using multi-modal datasets demonstrate that the proposed algorithm achieves superior accuracy and speed,with a success rate of 98.3%and an average matching time of 30.51 ms per 500×500 image pair.These results highlight the practical value and strong generalization capability of the algorithm in real-time applications. 展开更多
关键词 image matching multi-modal images deep learning neural network lightweight
暂未订购 下载PDF
Multi-Modal Scene Matching Location Algorithm Based on M2Det 认领 引用 被引量：2
2
作者 Jiwei Fan Xiaogang Yang +2 位作者 Ruitao Lu Qingge Li Siyu Wang 《Computers, Materials & Continua》 SCIE EI 2023年第10期1031-1052,共22页
In recent years,many visual positioning algorithms have been proposed based on computer vision and they have achieved good results.However,these algorithms have a single function,cannot perceive the environment,and ha... In recent years,many visual positioning algorithms have been proposed based on computer vision and they have achieved good results.However,these algorithms have a single function,cannot perceive the environment,and have poor versatility,and there is a certain mismatch phenomenon,which affects the positioning accuracy.Therefore,this paper proposes a location algorithm that combines a target recognition algorithm with a depth feature matching algorithm to solve the problem of unmanned aerial vehicle(UAV)environment perception and multi-modal image-matching fusion location.This algorithm was based on the single-shot object detector based on multi-level feature pyramid network(M2Det)algorithm and replaced the original visual geometry group(VGG)feature extraction network with the ResNet-101 network to improve the feature extraction capability of the network model.By introducing a depth feature matching algorithm,the algorithm shares neural network weights and realizes the design of UAV target recognition and a multi-modal image-matching fusion positioning algorithm.When the reference image and the real-time image were mismatched,the dynamic adaptive proportional constraint and the random sample consensus consistency algorithm(DAPC-RANSAC)were used to optimize the matching results to improve the correct matching efficiency of the target.Using the multi-modal registration data set,the proposed algorithm was compared and analyzed to verify its superiority and feasibility.The results show that the algorithm proposed in this paper can effectively deal with the matching between multi-modal images(visible image–infrared image,infrared image–satellite image,visible image–satellite image),and the contrast,scale,brightness,ambiguity deformation,and other changes had good stability and robustness.Finally,the effectiveness and practicability of the algorithm proposed in this paper were verified in an aerial test scene of an S1000 sixrotor UAV. 展开更多
关键词 Visual positioning multi-modal scene matching unmanned aerial vehicle
暂未订购 下载PDF
Algorithmic Empathy:Reconstructing Mainstream Media Communication Logic Through AI-Driven Technology for Precision Emotional Matching and Enhanced Communication Efficiency 认领 引用
3
作者 XIAO Shufang 《Journalism and Mass Communication》 2025年第3期189-195,共7页
This study investigates how artificial intelligence(AI)algorithms enable mainstream media to achieve precise emotional matching and improve communication efficiency through reconstructed communication logic.As digital... This study investigates how artificial intelligence(AI)algorithms enable mainstream media to achieve precise emotional matching and improve communication efficiency through reconstructed communication logic.As digital intelligence technology rapidly evolves,mainstream media organizations are increasingly leveraging AI-driven empathy algorithms to enhance audience engagement and optimize content delivery.This research employs a mixed-methods approach,combining quantitative analysis of algorithmic performance metrics with qualitative examination of media communication patterns.Through systematic review of 150 academic papers and analysis of data from 12 major media platforms,this study reveals that algorithmic empathy systems can improve emotional resonance by 34.7%and increase audience engagement by 28.3%compared to traditional communication methods.The findings demonstrate that AI algorithms reconstruct media communication logic through three primary pathways:emotional pattern recognition,personalized content curation,and real-time sentiment adaptation.However,the study also identifies significant challenges including algorithmic bias,emotional authenticity concerns,and ethical implications of automated empathy.The research contributes to understanding how mainstream media can leverage AI technology to build high-quality empathetic communication while maintaining journalistic integrity and social responsibility. 展开更多
关键词 algorithmic empathy artificial intelligence mainstream media communication logic emotional matching digital intelligence technology media convergence sentiment analysis
暂未订购 下载PDF
Performance of invariants of gravity gradient tensor in matching navigation: A case study in South China Sea 认领 引用 被引量：1
4
作者 Xiaoyun Wan Ming Li +1 位作者 Panpan Chen Faisal Hussain 《Geodesy and Geodynamics》 EI CSCD 2025年第3期341-349,共9页
Choosing appropriate background field data is crucial for gravity field matching navigation.Current research mainly uses gravity anomaly data or gravity gradient data as background fields.However,using gravity gradien... Choosing appropriate background field data is crucial for gravity field matching navigation.Current research mainly uses gravity anomaly data or gravity gradient data as background fields.However,using gravity gradient invariants in existing research is seldom a concern.The gravity gradient tensor has three invariants,named as I1,I2and I3.I1 is a Laplace operator outside the Earth and a Poison operator inside the Earth.The focus of this study is to discuss the performance of the other two invariants of gravity gradients in matching navigation based on the Iterative Closest Contour Point(ICCP)algorithm and compare the matching results with that of the gravity gradient Tzz.The results show that they have almost the same performance when there is no noise,and the background data noises have a large impact on the matching results.There are differences in the anti-interference ability of observation noises for the different components.Under the same random noises in the observations,I2performs a little better than the other two components in terms of position error standard deviation.According to the investigations,since attitude errors can not be avoided and influence the positioning based on Tzz,we recommend adopting invariants of gravity gradients,especially I2,for matching navigation in actual cases. 展开更多
关键词 Invariants of gravityg radient tensor Matching accuracy The iterative closest contour point algorithm Gravity gradient noises
暂未订购 下载PDF
Adaptive impedance matching using quantum genetic algorithm 认领 引用 被引量：7
5
作者 谭阳红 陈赛华 +1 位作者 张根苗 熊智挺 《Journal of Central South University》 SCIE EI CAS 2013年第4期977-981,共5页
An adaptive technique adopting quantum genetic algorithm （QGA） for antenna impedance tuning is presented. Three examples are given with different types of antenna impedance. The frequency range of the dual standards... An adaptive technique adopting quantum genetic algorithm （QGA） for antenna impedance tuning is presented. Three examples are given with different types of antenna impedance. The frequency range of the dual standards is from 1.7 to 2.2 GHz. Simulation results show that the proposed tuning technique can achieve good accuracy of impedance matching and load power. The reflection coefficient and VSWR obtained are also very close to their ideal values. Comparison of the proposed QGA tuning method with conventional genetic algorithm based tuning method is Moreover, the proposed method can be useful for software wireless bands. also given, which shows that the QGA tuning algorithm is much faster. defined radio systems using a single antenna for multiple mobile and 展开更多
关键词 impedance matching conventional genetic algorithm quantum genetic algorithm
暂未订购 下载PDF
A reliable algorithm for image matching based on SIFT 认领 引用 被引量：9
6
作者 霍炬 杨宁 +1 位作者 曹茂永 杨明 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2012年第4期90-95,共6页
A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algo... A novel algorithm is presented to make the results of image matching more reliable and accurate based on SIFT (Scale Invariant Feature Transform). SIFT algorithm has been identified as the most resistant matching algorithm to common image deformations; however, if there are similar regions in images, SIFT algorithm still generates some analogical descriptors and provides many mismatches. This paper examines the local image descriptor used by SIFT and presents a new algorithm by integrating SIFT with two-dimensional moment invariants and disparity gradient to improve the matching results. In the new algorithm, decision tree is used, and the whole matching process is divided into three levels with different primitives. Matching points are considered as correct ones only when they satisfy all the three similarity measurements. Experiment results demonstrate that the new approach is more reliable and accurate. 展开更多
关键词 image matching SIFT algorithm two-dimensional moment invariants disparity gradient
暂未订购 下载PDF
Spectral matching algorithm based on nonsubsampled contourlet transform and scale-invariant feature transform 认领 引用 被引量：4
7
作者 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
Packet Matching Algorithm Based on Improving Differential Evolution 认领 引用 被引量：3
8
作者 WANG Zelin WU Zhijian ZHANG Buzhong 《Wuhan University Journal of Natural Sciences》 CAS 2012年第5期447-453,共7页
The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditiona... The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditional algorithms. The purpose of this paper is to develop a novel algorithm of packet matching based on improving differential evolutionary algorithm, which also combines with classic packets matching algorithms to improve the performance of algorithm. For the sake of objectivity, the statistics method was used to compute the fitting value. Experiments showed that this new algorithm effectively improved the performance in the speed and storage space, as compared with the traditional one. For the first time, evolutionary algorithm is used to solve the network data packet forwarding, and packets can be forwarded at the linear speed. In addition, this new algorithm is universal, so it can be adapted for many equipment. 展开更多
关键词 packet matching differential evolutionary algorithm coefficient of variation
暂未订购 下载PDF
Memetic algorithm for multi-mode resource-constrained project scheduling problems 认领 引用 被引量：2
9
作者 Shixin Liu Di Chen Yifan Wang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2014年第4期609-617,共9页
A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The f... A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30. 展开更多
关键词 project scheduling resource-constrained multi-mode,memetic algorithm （MA） local search procedure.
暂未订购 下载PDF
A Line-Surface Integrated Algorithm for Underwater Terrain Matching 认领 引用 被引量：8
10
作者 Lihua ZHANG Xianpeng LIU +1 位作者 Shuaidong JIA Yan SHI 《Journal of Geodesy and Geoinformation Science》 2019年第4期10-20,共11页
The current underwater terrain surface matching algorithm,which uses Hu moment as the similarity index,cannot gain accurate location due to the algorithm’s disadvantage in detecting slight differences.To solve this p... The current underwater terrain surface matching algorithm,which uses Hu moment as the similarity index,cannot gain accurate location due to the algorithm’s disadvantage in detecting slight differences.To solve this problem,a line-surface integrated terrain matching algorithm is presented.First,the similarity evaluation method of the traditional Terrain Contour Matching(TERCOM)algorithm is improved,and the strategy used to select the matching regions is developed.Then,a surface matching algorithm based on the geometric similarity is established to determine the optimum match between the reference maps and the actual measured terrains.Finally,a means of“line matching algorithm”and“surface matching algorithm”integration is proposed based on a fixed threshold.The experimental results show that the proposed algorithm can obtain a more accurate location and has greater robustness than that of the surface underwater matching algorithm based on Hu moment. 展开更多
关键词 terrain matching integrated matching surface matching algorithm multi-beam bathymetric system
暂未订购 下载PDF
A Multi-stage Heuristic Algorithm for Matching Problem in the Modified Miniload Automated Storage and Retrieval System of E-commerce 认领 引用 被引量：2
11
作者 WANG Wenrui WU Yaohua WU Yingying 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2016年第3期641-648,共8页
E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking d... E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storageetrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center. 展开更多
关键词 e-commerce modified miniload automated storageetrieval system matching problem multi-stage heuristic algorithm
暂未订购 下载PDF
Fast M-fold matching pursuit algorithm for image approximation 认领 引用 被引量：1
12
作者 Gan Tao He Yanmin Zhu Weile 《Journal of Systems Engineering and Electronics》 SCIE EI 2009年第4期883-888,共6页
A simple and effective greedy algorithm for image approximation is proposed.Based on the matching pursuit approach,it is characterized by a reduced computational complexity benefiting from two major modifications.Firs... A simple and effective greedy algorithm for image approximation is proposed.Based on the matching pursuit approach,it is characterized by a reduced computational complexity benefiting from two major modifications.First,it iteratively finds an approximation by selecting M atoms instead of one at a time.Second,the inner product computations are confined within only a fraction of dictionary atoms at each iteration.The modifications are implemented very efficiently due to the spatial incoherence of the dictionary.Experimental results show that compared with full search matching pursuit,the proposed algorithm achieves a speed-up gain of 14.4-36.7 times while maintaining the approximation quality. 展开更多
关键词 greedy algorithm image approximation matching pursuit
暂未订购 下载PDF
GPS probe map matching algorithm based on spatial data model 认领 引用 被引量：1
13
作者 王卫 过秀成 侯佳 《Journal of Southeast University(English Edition)》 EI CAS 2010年第3期461-465,共5页
To improve the performance of the traditional map matching algorithms in freeway traffic state monitoring systems using the low logging frequency GPS （global positioning system） probe data, a map matching algorithm ... To improve the performance of the traditional map matching algorithms in freeway traffic state monitoring systems using the low logging frequency GPS （global positioning system） probe data, a map matching algorithm based on the Oracle spatial data model is proposed. The algorithm uses the Oracle road network data model to analyze the spatial relationships between massive GPS positioning points and freeway networks, builds an N-shortest path algorithm to find reasonable candidate routes between GPS positioning points efficiently, and uses the fuzzy logic inference system to determine the final matched traveling route. According to the implementation with field data from Los Angeles, the computation speed of the algorithm is about 135 GPS positioning points per second and the accuracy is 98.9%. The results demonstrate the effectiveness and accuracy of the proposed algorithm for mapping massive GPS positioning data onto freeway networks with complex geometric characteristics. 展开更多
关键词 GPS probe map matching A-star algorithm fuzzy logic Oracle spatial data model
暂未订购 下载PDF
Grouping pilot allocation scheme based on matching algorithm in massive MIMO system 认领 引用
14
作者 Xu Lei Wang Zhaorui +3 位作者 Yao Yijing Zhao Xinying Fang Hongyu Li Xiaohui 《High Technology Letters》 EI CAS 2020年第4期360-366,共7页
Pilot allocation is one of the effective means to reduce pilot pollution in massive multiple-input multiple-output(MIMO)systems.The goal of this paper is to improve the uplink achievable sum rates of strong users,and ... Pilot allocation is one of the effective means to reduce pilot pollution in massive multiple-input multiple-output(MIMO)systems.The goal of this paper is to improve the uplink achievable sum rates of strong users,and ensure the quality of service(QoS)requirements of weak users at the same time,so that the sum rates of system can be improved.Combining with the technical advantage of pilot grouping,a low complexity pilot allocation scheme based on matching algorithm is proposed,which divides the users in the target cell into weak user group and strong user group,and adopts the minimum-maximum matching method to allocate pilots in weak user group.Through the introduction of Hungarian algorithm,a pilot allocation method is designed to ensure the fairness of the strong users.The simulation results show that,compared with the smart pilot allocation scheme,the pilot allocation scheme based on Hungarian algorithm,the pilot allocation scheme based on user grouping and the random pilot allocation scheme,the system performance of the proposed scheme has been effectively improved. 展开更多
关键词 the sum rates of system pilot allocation user grouping matching algorithm low complexity
暂未订购 下载PDF
An efficient embedding tree matching algorithm based on metaphoric dependency syntax tree 认领 引用
15
作者 冯少荣 肖文俊 《Journal of Central South University》 SCIE EI CAS 2009年第2期275-279,共5页
To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based... To find out all dependency relationships in which metaphors probably exist between syntax constituents in a given sentence,a dependency tree matching algorithm oriented to Chinese metaphor processing is proposed based on a research of unordered tree inclusion matching.In this algorithm,the pattern library is composed of formalization dependency syntax trees that are derived from large-scale metaphor sentences.These kinds of metaphor sentences are saved in the pattern library in advance.The main process of this algorithm is up-down searching and bottom-up backtracking revising.The algorithm discovers potential metaphoric structures in Chinese sentences from metaphoric dependency pattern library.Finally,the feasibility and efficiency of the new matching algorithm are further testified by the results of a series of experiments on dependency pattern library.Hence,accurate dependency relationships can be achieved through this algorithm. 展开更多
关键词 pattern recognition tree matching algorithm dependency tree rule matching metaphor information processing
暂未订购 下载PDF
Hierarchical algorithm for large-scale irregular packing problems 认领 引用
16
作者 Xiao LIU 《ENGINEERING Information Technology & Electronic Engineering》 SCIE EI CSCD 2026年第3期69-80,共12页
To address the challenge of large-scale packing problems,this paper proposes a novel hierarchical algorithm based on the geometrical classification of parts.The algorithm begins by classifying parts into three levels ... To address the challenge of large-scale packing problems,this paper proposes a novel hierarchical algorithm based on the geometrical classification of parts.The algorithm begins by classifying parts into three levels based on their area and fullness and then applies distinct packing strategies to each category.An innovative“shape matching”method is introduced,which,together with the“box stacking”(for rectangular parts)and“gravity packing,”forms a comprehensive hierarchical packing system.Level-1 comprises large rectangular parts,which are arranged using the box stacking algorithm.By aligning the corner points of the parts’bounding boxes,this method avoids the hooking issue commonly encountered in gravity packing.Level-2 includes both large,irregular parts and medium-sized parts.They are first processed using the shape matching algorithm,where rotation and translation are applied to achieve contour complementarity.The quality of the match is evaluated using the shape matching coefficient(SMC).If the SMC fails to reach the preset quality threshold,the system switches to box stacking(for large,irregular parts)or gravity packing(for medium-sized parts).Level-3 comprises the remaining smaller parts and those that failed to pack in the previous two levels.For these parts,shape matching is attempted first,and the system resorts to gravity packing in case of failure.The experimental and comparative results demonstrate that the proposed hierarchical algorithm achieves higher material utilization than the traditional gravity packing algorithm.This improvement is facilitated by the box stacking and shape matching strategies,which promote a more orderly and compact arrangement of parts. 展开更多
关键词 Large-scale packing Hierarchical algorithm Box stacking Shape matching Gravity packing Principle of minimum potential energy
暂未订购 下载PDF
A Four-color Matching Method Combining Neural Networks with Genetic Algorithm 认领 引用
17
作者 苏小红 Wang +2 位作者 Yadong ZHANG Tianwen 《High Technology Letters》 EI CAS 2003年第4期39-43,共5页
A brief review of color matching technology and its application of printing RGB images by CMY or CMYK ink jet printers is presented, followed by an explanation to the conventional approaches that are commonly used in ... A brief review of color matching technology and its application of printing RGB images by CMY or CMYK ink jet printers is presented, followed by an explanation to the conventional approaches that are commonly used in color matching. Then, a four color matching method combining neural network with genetic algorithm is proposed. The initial weights and thresholds of the BP neural network for RGB to CMY color conversion are optimized by the new genetic algorithm based on evolutionarily stable strategy. The fourth component K is generated by using GCR (Gray Component Replacement) concept. Simulation experiments show that it is well behaved in both accuracy and generalization performance. 展开更多
关键词 color matching color reproduction back propagation (BP) neural networks genetic algorithm
暂未订购 下载PDF
The Factors Analysis and Algorithm Implementation of Single-pattern Matching 认领 引用
18
作者 刘功申 朱圣军 《Journal of Shanghai Jiaotong university(Science)》 EI 2009年第3期331-337,共7页
By studying the algorithms of single pattern matching, five factors that have effect on time complexity of the algorithm are analyzed. The five factors are： sorting the characters of pattern string in an increasing o... By studying the algorithms of single pattern matching, five factors that have effect on time complexity of the algorithm are analyzed. The five factors are： sorting the characters of pattern string in an increasing order of using frequency, utilizing already-matched pattern suffix information, utilizing already-matched pattern prefix information, utilizing the position factor which is absorbed from quick search algorithm, and utilizing the continue-skip idea which is originally proposed by this paper. Combining all the five factors, a new single pattern matching algorithm is implemented. It＇s proven by the experiment that the efficiency of new algorithm is the best of all algorithms. 展开更多
关键词 single pattern matching string search algorithm analysis
暂未订购 下载PDF
AN IMPROVED HYBRID SEMANTIC MATCHING ALGORITHM WITH LEXICAL SIMILARITY 认领 引用
19
作者 Peng Rongqun Mi Zhengkun Wang Lingjiao 《Journal of Electronics(China)》 2010年第6期838-847,共10页
In this paper, we proposed an improved hybrid semantic matching algorithm combining Input/Output (I/O) semantic matching with text lexical similarity to overcome the disadvantage that the existing semantic matching al... In this paper, we proposed an improved hybrid semantic matching algorithm combining Input/Output (I/O) semantic matching with text lexical similarity to overcome the disadvantage that the existing semantic matching algorithms were unable to distinguish those services with the same I/O by only performing I/O based service signature matching in semantic web service discovery techniques. The improved algorithm consists of two steps, the first is logic based I/O concept ontology matching, through which the candidate service set is obtained and the second is the service name matching with lexical similarity against the candidate service set, through which the final precise matching result is concluded. Using Ontology Web Language for Services (OWL-S) test collection, we tested our hybrid algorithm and compared it with OWL-S Matchmaker-X (OWLS-MX), the experimental results have shown that the proposed algorithm could pick out the most suitable advertised service corresponding to user's request from very similar ones and provide better matching precision and efficiency than OWLS-MX. 展开更多
关键词 Hybrid matching algorithm Semantic matching Lexical similarity WordNet Ontology Web Language for Services (OWL-S)
暂未订购 下载PDF
Fast identification of mural pigments at Mogao Grottoes using a LIBS-based spectral matching algorithm 认领 引用 被引量：2
20
作者 Yiming ZHANG Duixiong SUN +4 位作者 Yaopeng YIN Zongren YU Bomin SU Chenzhong DONG Maogen SU 《Plasma Science and Technology》 SCIE EI CAS CSCD 2022年第8期23-31,共9页
To quickly identify the mineral pigments in the Dunhuang murals,a spectral matching algorithm(SMA)based on four methods was combined with laser-induced breakdown spectroscopy(LIBS)for the first time.The optimal range ... To quickly identify the mineral pigments in the Dunhuang murals,a spectral matching algorithm(SMA)based on four methods was combined with laser-induced breakdown spectroscopy(LIBS)for the first time.The optimal range of LIBS spectrum for mineral pigments was determined using the similarity value between two different types of samples of the same pigment.A mineral pigment LIBS database was established by comparing the spectral similarities of tablets and simulated samples,and this database was successfully used to identify unknown pigments on tablet,simulated,and real mural debris samples.The results show that the SMA method coupled with the LIBS technique has great potential for identifying mineral pigments. 展开更多
关键词 mural pigments laser-induced breakdown spectroscopy fast identification and classification spectral matching algorithm spectral database
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 208 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈