A Fast Multi-Pattern Matching Algorithm for Mining Big Network Data

The rapid development of mobile network brings opportunities for researchers to analyze user behaviors based on largescale network traffic data. It is important for Internet Service Providers(ISP) to optimize resource allocation and provide customized services to users. The first step of analyzing user behaviors is to extract information of user actions from HTTP traffic data by multi-pattern URL matching. However, the efficiency is a huge problem when performing this work on massive network traffic data. To solve this problem, we propose a novel and accurate algorithm named Multi-Pattern Parallel Matching(MPPM) that takes advantage of HashMap in data searching for extracting user behaviors from big network data more effectively. Extensive experiments based on real-world traffic data prove the ability of MPPM algorithm to deal with massive HTTP traffic with better performance on accuracy, concurrency and efficiency. We expect the proposed algorithm and it parallelized implementation would be a solid base to build a high-performance analysis engine of user behavior based on massive HTTP traffic data processing.

Robust key point descriptor for multi-spectral image matching

Histogram of collinear gradient-enhanced coding （HCGEC）, a robust key point descriptor for multi-spectral image matching, is proposed. The HCGEC mainly encodes rough structures within an image and suppresses detailed textural information, which is desirable in multi-spectral image matching. Experiments on two multi-spectral data sets demonstrate that the proposed descriptor can yield significantly better results than some state-of- the-art descriptors.

A Multi-stage Heuristic Algorithm for Matching Problem in the Modified Miniload Automated Storage and Retrieval System of E-commerce

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 storage/retrieval 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.

PARAMETRIC MATCHING SELECTION OF MULTI-MEDIUM COUPLING SHOCK ABSORBER

To achieve the dual demand of resisting violent impact and attenuating vibration in vibration-impact-safety of protection for precision equipment such as MEMS packaging system, a theo- retical mathematical model of multi-medium coupling shock absorber is presented. The coupling of quadratic damping, linear damping, Coulomb damping and nonlinear spring are considered in the model. The approximate theoretical calculating formulae are deduced by introducing transformation-tactics. The contrasts between the analytical results and numerical integration results are developed. The resisting impact characteristics of the model are also analyzed in progress. In the meantime, the optimum model of the parameters matching selection for design of the shock absorber is built. The example design is illustrated to confirm the validity of the modeling method and the theoretical solution.

Template Matching using Statistical Model and Parametric Template for Multi-Template

This paper represents a template matching using statistical model and parametric template for multi-template. This algorithm consists of two phases: training and matching phases. In the training phase, the statistical model created by principal component analysis method (PCA) can be used to synthesize multi-template. The advantage of PCA is to reduce the variances of multi-template. In the matching phase, the normalized cross correlation (NCC) is employed to find the candidates in inspection images. The relationship between image block and multi-template is built to use parametric template method. Results show that the proposed method is more efficient than the conventional template matching and parametric template. Furthermore, the proposed method is more robust than conventional template method.

MULTI-PEAK MATCH INTENSITY RATIO METHOD OF QUANTI-TATIVE X-RAY DIFFRACTION PHASE ANALYSIS

A new method for quantitative phase analysis is proposed by using X-ray diffraction multi-peak match intensity ratio. This method can obtain the multi-peak match intensity ratio among each phase in the mixture sample by using all diffraction peak data in the mixture sample X-ray diffraction spectrum and combining the relative intensity distribution data of each phase standard peak in JCPDS card to carry on the least square method regression analysis. It is benefit to improve the precision of quantitative phase analysis that the given single line ratio which is usually adopted is taken the place of the multi-peak match intensity ratio and is used in X-ray diffraction quantitative phase analysis of the mixture sample. By analyzing four-group mixture sample, adopting multi-peak match intensity ratio and X-ray diffraction quantitative phase analysis principle of combining the adiabatic and matrix flushing method, it is tested that the experimental results are identical with theory.

A Multi-match Approach to the Author Uncertainty Problem

Purpose: The ability to identify the scholarship of individual authors is essential for performance evaluation. A number of factors hinder this endeavor. Common and similarly spelled surnames make it difficult to isolate the scholarship of individual authors indexed on large databases. Variations in name spelling of individual scholars further complicates matters. Common family names in scientific powerhouses like China make it problematic to distinguish between authors possessing ubiquitous and/or anglicized surnames(as well as the same or similar first names). The assignment of unique author identifiers provides a major step toward resolving these difficulties. We maintain, however, that in and of themselves, author identifiers are not sufficient to fully address the author uncertainty problem. In this study we build on the author identifier approach by considering commonalities in fielded data between authors containing the same surname and first initial of their first name. We illustrate our approach using three case studies.Design/methodology/approach: The approach we advance in this study is based on commonalities among fielded data in search results. We cast a broad initial net—i.e., a Web of Science(WOS) search for a given author's last name, followed by a comma, followed by the first initial of his or her first name(e.g., a search for ‘John Doe' would assume the form: ‘Doe, J'). Results for this search typically contain all of the scholarship legitimately belonging to this author in the given database(i.e., all of his or her true positives), along with a large amount of noise, or scholarship not belonging to this author(i.e., a large number of false positives). From this corpus we proceed to iteratively weed out false positives and retain true positives. Author identifiers provide a good starting point—e.g., if ‘Doe, J' and ‘Doe, John' share the same author identifier, this would be sufficient for us to conclude these are one and the same individual. We find email addresses similarly adequate—e.g., if two author names which share the same surname and same first initial have an email address in common, we conclude these authors are the same person. Author identifier and email address data is not always available, however. When this occurs, other fields are used to address the author uncertainty problem.Commonalities among author data other than unique identifiers and email addresses is less conclusive for name consolidation purposes. For example, if ‘Doe, John' and ‘Doe, J' have an affiliation in common, do we conclude that these names belong the same person? They may or may not; affiliations have employed two or more faculty members sharing the same last and first initial. Similarly, it's conceivable that two individuals with the same last name and first initial publish in the same journal, publish with the same co-authors, and/or cite the same references. Should we then ignore commonalities among these fields and conclude they're too imprecise for name consolidation purposes? It is our position that such commonalities are indeed valuable for addressing the author uncertainty problem, but more so when used in combination.Our approach makes use of automation as well as manual inspection, relying initially on author identifiers, then commonalities among fielded data other than author identifiers, and finally manual verification. To achieve name consolidation independent of author identifier matches, we have developed a procedure that is used with bibliometric software called VantagePoint(see www.thevantagepoint.com). While the application of our technique does not exclusively depend on VantagePoint, it is the software we find most efficient in this study. The script we developed to implement this procedure is designed to implement our name disambiguation procedure in a way that significantly reduces manual effort on the user's part. Those who seek to replicate our procedure independent of VantagePoint can do so by manually following the method we outline, but we note that the manual application of our procedure takes a significant amount of time and effort, especially when working with larger datasets.Our script begins by prompting the user for a surname and a first initial(for any author of interest). It then prompts the user to select a WOS field on which to consolidate author names. After this the user is prompted to point to the name of the authors field, and finally asked to identify a specific author name(referred to by the script as the primary author) within this field whom the user knows to be a true positive(a suggested approach is to point to an author name associated with one of the records that has the author's ORCID iD or email address attached to it).The script proceeds to identify and combine all author names sharing the primary author's surname and first initial of his or her first name who share commonalities in the WOS field on which the user was prompted to consolidate author names. This typically results in significant reduction in the initial dataset size. After the procedure completes the user is usually left with a much smaller(and more manageable) dataset to manually inspect(and/or apply additional name disambiguation techniques to).Research limitations: Match field coverage can be an issue. When field coverage is paltry dataset reduction is not as significant, which results in more manual inspection on the user's part. Our procedure doesn't lend itself to scholars who have had a legal family name change(after marriage, for example). Moreover, the technique we advance is(sometimes, but not always) likely to have a difficult time dealing with scholars who have changed careers or fields dramatically, as well as scholars whose work is highly interdisciplinary.Practical implications: The procedure we advance has the ability to save a significant amount of time and effort for individuals engaged in name disambiguation research, especially when the name under consideration is a more common family name. It is more effective when match field coverage is high and a number of match fields exist.Originality/value: Once again, the procedure we advance has the ability to save a significant amount of time and effort for individuals engaged in name disambiguation research. It combines preexisting with more recent approaches, harnessing the benefits of both.Findings: Our study applies the name disambiguation procedure we advance to three case studies. Ideal match fields are not the same for each of our case studies. We find that match field effectiveness is in large part a function of field coverage. Comparing original dataset size, the timeframe analyzed for each case study is not the same, nor are the subject areas in which they publish. Our procedure is more effective when applied to our third case study, both in terms of list reduction and 100% retention of true positives. We attribute this to excellent match field coverage, and especially in more specific match fields, as well as having a more modest/manageable number of publications.While machine learning is considered authoritative by many, we do not see it as practical or replicable. The procedure advanced herein is both practical, replicable and relatively user friendly. It might be categorized into a space between ORCID and machine learning. Machine learning approaches typically look for commonalities among citation data, which is not always available, structured or easy to work with. The procedure we advance is intended to be applied across numerous fields in a dataset of interest(e.g. emails, coauthors, affiliations, etc.), resulting in multiple rounds of reduction. Results indicate that effective match fields include author identifiers, emails, source titles, co-authors and ISSNs. While the script we present is not likely to result in a dataset consisting solely of true positives(at least for more common surnames), it does significantly reduce manual effort on the user's part. Dataset reduction(after our procedure is applied) is in large part a function of(a) field availability and(b) field coverage.

Comparison of perfectly matched layer and multi-transmitting formula artificial boundary condition based on hybrid finite element formulation

The theory of perfectly matched layer （PML） artificial boundary condition （ABC）, which is characterized by absorption any wave motions with arbitrary frequency and arbitrarily incident angle, is introduced. The construction process of PML boundary based on elastodynamic partial differential equation （PDE） system is developed. Combining with velocity-stress hybrid finite element formulation, the applicability of PML boundary is investigated and the numerical reflection of PML boundary is estimated. The reflectivity of PML and multi-transmitting formula （MTF） boundary is then compared based on body wave and surface wave simulations. The results show that although PML boundary yields some reflection, its absorption performance is superior to MTF boundary in the numerical simulations of near-fault wave propagation, especially in comer and large angle grazing incidence situations. The PML boundary does not arise any unstable phenomenon and the stability of PML boundary is better than MTF boundary in hybrid finite element method. For a specified problem and analysis tolerance, the computational efficiency of PML boundary is only a little lower than MTF boundary.

基于联合GLMB滤波器的可分辨群目标跟踪

针对联合广义标签多伯努利(joint generalized labeled multi-Bernoulli, J-GLMB)滤波算法中群目标之间距离较近、容易关联错误的问题,结合超图匹配(hypergraph matching, HGM)提出一种基于HGM-J-GLMB滤波器的可分辨群目标跟踪算法。首先,采用J-GLMB滤波器估计群内各目标的状态、数目及轨迹信息,并利用HGM结果提升量测与预测状态之间的关联性能。其次,通过图理论计算邻接矩阵,获取群结构信息和子群数目。随后,利用群结构信息估计协作噪声,进而校正目标的预测状态。最后,通过平滑算法改善滤波效果,并设置轨迹长度阈值,使其在平滑状态达到消除短轨迹的目的。仿真实验表明,所提算法在线性系统下能有效提升群目标跟踪性能。

融合领域要素知识的多粒度法律文本匹配方法

法律文本匹配的目标是快速提炼对比要素信息并发现关联案件,保障法律适用的统一性同案同判.现有方法未能充分利用特定类型案件的先验知识,其核心要素提取准确率低,仅进行词向量的权重计算,忽略字义、句义、句法的向量信息,影响匹配效果.提出一种融合领域要素知识的多粒度法律文本匹配方法,通过建立特定案件类型领域知识库准确提取法律要素,引入字、词、句3个粒度的注意力机制计算不同文本向量的权重提升匹配模型效果.实验结果表明,该方法在公开数据集上可达到最好效果.

基于多链存储优化的水产品交易匹配模型研究

区块链技术应用到水产品线上交易架构中可以使交易双方隐私信息得到基本保障,然而,目前区块链水产品线上交易模型和系统存在海量数据存储负载大、维护成本高、数据查询效率低等问题。为进一步缓解以上问题,在梳理和分析水产品交易流程基础上,根据水产品交易业务技术需求,提出了基于多链存储优化的水产品交易匹配模型。该模型在智能合约中通过贪心算法实现了效率较高的多属性水产品线上交易匹配过程,通过区块链多通道技术构建了水产品交易多链架构,实现了用户交易信息分布式存储,提高了交易信息查询效率,同时,采用区块链与本地数据库双模式存储技术,缓解了区块链网络中各个节点海量数据存储的负载。基于Hyperledger Fabric平台实现了基于多链存储优化的水产品交易原型系统。该原型系统测试结果表明,临界值900s平均最多可以完成1296笔交易,说明系统在处理千条交易数据量时可以正常运行,满足水产品线上交易平台日常实际交易业务需求,同时在链上存储1600条合同信息时查询1条用户合同信息平均时间为4.018s,多链存储结构提高了链上数据查询速度。

Trie+结构函数式建模、机械化验证及其应用

Trie结构是一种使用搜索关键字来组织信息的搜索树,可用于高效地存储和搜索字符串集合.Nipkow等人给出了实现Trie的Isabelle建模与验证,然而其Trie在存储和操作时存在大量的冗余,导致空间利用率不高,且仅考虑英文单模式下查找.为此,基于索引即键值的思想提出了Trie+结构,相较于传统的索引与键值分开存储的结构能减少50%的存储空间,大大提高了空间利用率.并且,对Trie+结构的查找、插入、删除等操作给出了函数式建模及其严格的机械化验证,保证操作的正确性和可靠性.进一步,提出一种匹配算法的通用验证规约,旨在解决一系列的匹配算法正确性验证问题.最后,基于Trie+结构与匹配算法通用验证规约,建模和验证了函数式中英文混合多模式匹配算法,发现并解决了现有研究中的基于完全哈希Trie的多模式匹配算法的模式串前缀终止的Bug.该Trie+结构以及验证规约在提高Trie结构空间利用率和验证匹配算法中,有一定的理论和应用价值.

基于四叉树先验辅助的多视图立体方法

基于PatchMatch的多视图立体(MVS)方法依据输入多幅图像估计场景的深度,目前已应用于大规模场景三维重建。然而,由于特征匹配不稳定、仅依赖光度一致性不可靠等原因,现有方法在弱纹理区域的深度估计准确性和完整性较低。针对上述问题,提出一种基于四叉树先验辅助的MVS方法。首先,利用图像像素值获得局部纹理;其次,基于自适应棋盘网格采样的块匹配多视图立体视觉方法(ACMH)获得粗略的深度图,结合弱纹理区域中的结构信息,采用四叉树分割生成先验平面假设;再次,融合上述信息,设计一种新的多视图匹配代价函数,引导弱纹理区域得到最优深度假设,进而提高立体匹配的准确性;最后,在ETH3D、Tanks and Temples和中国科学院古建筑数据集上与多种现有的传统MVS方法进行对比实验。结果表明所提方法性能更优,特别是在ETH3D测试数据集中,当误差阈值为2 cm时,相较于当前先进的多尺度平面先验辅助方法(ACMMP),它的F1分数和完整性分别提高了1.29和2.38个百分点。

复杂场景下多模态点云数据配准技术

针对复杂环境下多模态点云数据获取难,以及对点云数据配准、三维模型构建精度的要求越来越高的情况。本文以南通大剧院实景三维建模为例,当初始点云和校准点云两组多模态融合点云位置差较大时,采用ICP算法进行点云配准易导致局部最优问题,利用所提出的基于控制点辅助约束的最近点迭代(CPA-ICP)算法通过对点云数据进行配准,并与其他3种点云配准算法的试验进行对比,可知该方法的配准精度和配准效率较高,对复杂场景下的多模态点云数据融合有较好的参考意义。

外卖智能派单的订单-骑手多目标匹配模型及其适应性算法研究

随着外卖业的快速发展,外卖智能派单成为外卖服务的重要形式。然而,目前相关研究侧重于研究外卖配送路径问题,不利于解决外卖智能派单的多目标动态决策中存在的问题。本文从外卖订单-骑手匹配的角度,分析了外卖平台智能派单的五个基本目标和四个基本约束,构建了多目标的订单-骑手匹配优化模型,进而给出了基于适应性策略的实时优化算法。最后,本文设计了外卖智能派单的仿真实验,对比了骑手-订单数量均衡、骑手供过于求、骑手供不应求等三种情况下的优化情况,验证了基于适应性策略的实时优化算法的优化效果。本研究对外卖平台发展智能派单模式具有较好的理论与实践价值。

一种密集多尺度特征引导代价聚合的改进立体匹配网络

针对目前立体匹配算法在重复纹理、无纹理、边缘等不适定性区域仍存在匹配不准确的问题,提出了一种基于PSMNet的密集多尺度特征引导代价聚合的立体匹配算法—DGNet(Dense multi-scale features Guided aggregation Network)。首先,基于密集连接空洞空间金字塔池化结构设计了密集多尺度特征提取模块,该模块利用不同膨胀率的空洞卷积提取不同尺度的区域级特征,并通过密集连接方式有效整合不同尺度的图像特征,使网络捕获丰富的上下文关系;其次,在每个视差等级下将左右特征图串联形成初始代价体,再提出密集多尺度特征引导代价聚合结构,在聚合代价体的同时自适应融合代价体和密集多尺度特征,从而使后续的解码层在多尺度上下文信息的引导下解码出更加精确和高分辨率的几何信息;最后,将全局优化后的高分辨率代价体送入视差回归模块以获得视差图。实验结果表明:所提算法在KITTI 2015和KITTI 2012数据集上的误匹配率分别降至1.76%和1.24%,SceneFlow数据集上的端点误差降至0.56 px,与GWCNet、CPOP-Net等先进算法相比,所提算法在不适定区域有明显改善。

基于特征匹配度与异类子模型融合的安全性评估方法

机器学习模型的好坏影响预测精度、输入与输出结果的拟合情况。在复杂系统中,使用单一模型评估系统安全性问题时容易受数据量、数据格式、模型结构以及环境干扰等因素影响,使得这个模型在解决某个问题的能力上比较出色,而在解决其他问题时,结果却不尽如人意。针对上述问题,提出一种基于特征匹配度和异类子模型融合的安全性评估方法。首先,按照采样数据的输出值划分不同规模的数据集并构建子模型;其次,通过计算每个新数据对于这些子模型的匹配度,进而得到每个子模型的权重;最后,根据权重大小融合所有子模型的子输出得到最终的多模型融合结果。所提方法对山东省济宁市霄云煤矿采掘数据集进行研究,实验结果表明,该方法与多样本单模型、少样本单模型和传统多模型方法相比,在以330/70的比例来构建子模型的情况下均方根误差(RMSE)分别降低了15.13%、51.67%和12.46%,该方法充分集成各子模型所能提供的有效信息,减少和分散单一模型的预测误差,以提高模型的预测精度和泛化能力。

基于倾斜摄影的多回输电线路实景三维模型构建系统设计

为了使改进多回输电线路三维模型更加符合实际情况,该文将倾斜摄影技术引入多回输电线路实景三维模型构建系统中,提升数据获取的精准性。硬件方面,微处理器作为指令核心处理结构,负责读取并解析指令;设计多回输电线路数据采集模块和EP3SE110F1152C4数据存储器,并利用数据存储器对系统运行过程中的多项数据进行存储;软件方面,借助倾斜摄影技术,获取多回输电线路数据,并计算其对应的比例尺和航高,再对获取的数据进行优化,消除数据中的误差,并对其进行配准处理和特征匹配以及纹理映射和归一化处理,由此完成对多回输电线路实景三维模型的构建。经过实验验证,和以往的多回输电线路实景三维模型构建系统相比,设计的基于倾斜摄影的多回输电线路实景三维模型构建系统在实际应用中模型构建完整度为95.6%,构建效果更好。