期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Fast identification of mural pigments at Mogao Grottoes using a LIBS-based spectral matching algorithm 被引量:1
1
作者 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
Middle matching mining algorithm 被引量:1
2
作者 郭平 《Journal of Chongqing University》 CAS 2003年第2期63-66,共4页
A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer... A new algorithm for fast discovery of sequential patterns to solve the problems of too many candidate sets made by SPADE is presented, which is referred to as middle matching algorithm. Experiments on a large customer transaction database consisting of customer_id, transaction time, and transaction items demonstrate that the proposed algorithm performs better than SPADE attributed to its philosophy to generate a candidate set by matching two sequences in the middle place so as to reduce the number of the candidate sets. 展开更多
关键词 middle matching algorithm candidate set SPADE minimum support
在线阅读 下载PDF
Resource Allocation and User Association for HTTP Adaptive Streaming in Heterogeneous Cellular Networks with Small Cells 被引量:3
3
作者 Jiang Liu 《China Communications》 SCIE CSCD 2016年第9期1-11,共11页
Video streaming,especially hypertext transfer protocol based(HTTP) adaptive streaming(HAS) of video,has been expected to be a dominant application over mobile networks in the near future,which brings huge challenge fo... Video streaming,especially hypertext transfer protocol based(HTTP) adaptive streaming(HAS) of video,has been expected to be a dominant application over mobile networks in the near future,which brings huge challenge for the mobile networks.Although some works have been done for video streaming delivery in heterogeneous cellular networks,most of them focus on the video streaming scheduling or the caching strategy design.The problem of joint user association and rate allocation to maximize the system utility while satisfying the requirement of the quality of experience of users is largely ignored.In this paper,the problem of joint user association and rate allocation for HTTP adaptive streaming in heterogeneous cellular networks is studied,we model the optimization problem as a mixed integer programming problem.And to reduce the computational complexity,an optimal rate allocation using the Lagrangian dual method under the assumption of knowing user association for BSs is first solved.Then we use the many-to-one matching model to analyze the user association problem,and the joint user association and rate allocation based on the distributed greedy matching algorithm is proposed.Finally,extensive simulation results are illustrated to demonstrate the performance of the proposed scheme. 展开更多
关键词 heterogeneous cellular networks user association rate allocation http adaptive streaming matching algorithm
在线阅读 下载PDF
Some Results on Position Restriction Scheduling Problems
4
作者 CHEN You-jun LIN Yi-xun 《Chinese Quarterly Journal of Mathematics》 CSCD 北大核心 2008年第2期202-206,共5页
In this paper, we first consider the position restriction scheduling problems on a single machine. The problems have been solved in certain special cases, especially for those obtained by restricting the processing ti... In this paper, we first consider the position restriction scheduling problems on a single machine. The problems have been solved in certain special cases, especially for those obtained by restricting the processing time pj = 1. We introduce the bipartite matching algorithm to provide some polynomial-time algorithms to solve them. Then we further consider a problem on unrelated processors. 展开更多
关键词 position restriction scheduling matching algorithm assignment problem
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部