Search results

Matching relevant ontology data for integration is vitally important as the amount of ontology data increases along with the evolving Semantic web, in which data are published from different individuals or organizations in a decentralized environment. For any domain that has developed a suitable ontology, its ontology annotated data (or simply ontology data) from different sources often overlaps and needs to be integrated. The purpose of this paper is to develop intelligent web ontology data matching method and framework for data integration.

This paper develops an intelligent matching method to solve the issue of ontology data matching. Based on the matching method, it also proposes a flexible peer‐to‐peer framework to address the issue of ontology data integration in a distributed Semantic web environment.

The proposed matching method is different from existing data matching or merging methods applied to data warehouse in that it employs a machine learning approach and more similarity measurements by exploring ontology features.

The proposed method and framework will be further tested for some more complicated real cases in the future.

The experiments show that this proposed intelligent matching method increases ontology data matching accuracy.

In the evaluation of most interventions in criminal justice settings, evaluators have no control over assignment to treatment and control/comparison conditions, which means that the treated and comparison groups may have differences that lead to biased conclusions regarding treatment effectiveness. Propensity score analysis can be used to balance the differences in the groups, which can be used in a number of ways to reduce biased conclusions regarding effectiveness. A review of propensity scoring studies was conducted for this chapter, where the limited number of evaluations of criminal justice interventions using these methods was identified. Due to the small number of these studies, research was also reviewed if propensity scoring had been employed to evaluate interventions that are similar to those in criminal justice systems. These studies are used as examples to demonstrate how the methods can be used to evaluate criminal justice interventions, the different ways propensity scores can be used to analyse treatment and comparison group differences, and the strengths and limitations of this approach. It is concluded that, while not appropriate for all interventions/settings, propensity score analysis can be useful in criminal justice arenas, at least to investigate the comparability of treatment and comparison groups, with suspected non-comparability being a common weakness of traditional quasi-experimental studies and frequently cited limitation in terms of drawing efficacy conclusions from such evaluations.

The purpose of this paper is to propose a solution for automating the task of matching business process models and search for correspondences with regard to the model semantics, thus improving the efficiency of such works.

A method is proposed based on combining several semantic technologies. The research follows a design-science-oriented approach in that a method together with its supporting artifacts has been engineered. It application allows for reusing legacy models and automatedly determining semantic similarity.

The method has been applied and the first findings suggest the effectiveness of the approach. The results of applying the method show its feasibility and significance. The suggested heuristic computing of semantic correspondences between semantically heterogeneous business process models is flexible and can support domain users.

Even though a solution can be offered that is directly usable, so far the full complexity of the natural language as given in model element labels is not yet completely resolvable. Here further research could contribute to the potential optimizations and refinement of automatic matching and linguistic procedures. However, an open research question could be solved.

The method presented is aimed at adding to the methods in the field of business process management and could extend the possibilities of automating support for business analysis.

The suggested combination of semantic technologies is innovative and addresses the aspect of semantic heterogeneity in a holistic, which is novel to the field.

This paper aims to solve the major assessment problem in matching the satisfaction of psychological gratification and mission accomplishment pertaining to volunteers with the disaster rescue and recovery tasks.

An extended belief rule-based (EBRB) method is applied with the method's input and output parameters classified based on expert knowledge and data from literature. These parameters include volunteer self-satisfaction, experience, peer-recognition, and cooperation. First, the model parameters are set; then, the parameters are optimized through data envelopment analysis (DEA) and differential evolution (DE) algorithm. Finally, a numerical mountain rescue example and comparative analysis between with-DEA and without-DEA are presented to demonstrate the efficiency of the proposed method. The proposed model is suitable for a two-way matching evaluation between rescue tasks and volunteers.

Disasters are unexpected events in which emergency rescue is crucial to human survival. When a disaster occurs, volunteers provide crucial assistance to official rescue teams. This paper finds that decision-makers have a better understanding of two-sided match objects through bilateral feedback over time. With the changing of the matching preference information between rescue tasks and volunteers, the satisfaction of volunteer's psychological gratification and mission accomplishment are also constantly changing. Therefore, considering matching preference information and satisfaction at two-sided match objects simultaneously is necessary to get reasonable target values of matching results for rescue tasks and volunteers.

Based on the authors' novel EBRB method, a matching assessment model is constructed, with two-sided matching of volunteers to rescue tasks. This method will provide matching suggestions in the field of emergency dispatch and contribute to the assessment of emergency plans around the world.

The purpose of this paper is to propose a binocular visual odometry algorithm based on the Random Sample Consensus (RANSAC) in visual navigation systems.

The authors propose a novel binocular visual odometry algorithm based on features from accelerated segment test (FAST) extractor and an improved matching method based on the RANSAC. Firstly, features are detected by utilizing the FAST extractor. Secondly, the detected features are roughly matched by utilizing the distance ration of the nearest neighbor and the second nearest neighbor. Finally, wrong matched feature pairs are removed by using the RANSAC method to reduce the interference of error matchings.

The performance of this new algorithm has been examined by an actual experiment data. The results shown that not only the robustness of feature detection and matching can be enhanced but also the positioning error can be significantly reduced by utilizing this novel binocular visual odometry algorithm. The feasibility and effectiveness of the proposed matching method and the improved binocular visual odometry algorithm were also verified in this paper.

This paper presents an improved binocular visual odometry algorithm which has been tested by real data. This algorithm can be used for outdoor vehicle navigation.

A binocular visual odometer algorithm based on FAST extractor and RANSAC methods is proposed to improve the positioning accuracy and robustness. Experiment results have verified the effectiveness of the present visual odometer algorithm.

This paper mainly focuses on how to induce all members to represent members' true preferences for supply and demand matching of E-commerce platform in order to generate stable matching schemes with more social welfare of Multi-agent Matching Platform (MMP) and individually stable advantages than traditional methods.

An MMP is designed. Meanwhile, a true preference inducing method, Lower-Bid Ranking (LBR), is proposed to reduce the number of false preferences, which is helpful to solve the problem that too much false preferences leads to low efficiency of platform operation and supply and demand matching. Then, a systematic model of LBR-based Stable Matching (SM-LBR) is proposed.

To obtain an ideal transaction partner, the adequate preference ordering and modifying according to market environment is needed for everyone, and the platform should give full play to the platforms' information advantages and process historical transaction and cooperation data. Meanwhile, the appropriate supply and demand matching is beneficial to improve the efficiency and quality of platform operation, and the design of matching guidance mechanism is essential.

The numerical experiments show that, the proposed model (SM-LBR) can induce members to represent the model's true preferences for stable matching and generate effective matchings with more social welfare of MMP and individually stable advantages than traditional methods, which may provide necessary method and model reference for the research of stable matching and E-commerce platform operation.

With the advent of the era of Big Data, the scale of knowledge graph (KG) in various domains is growing rapidly, which holds huge amount of knowledge surely benefiting the question answering (QA) research. However, the KG, which is always constituted of entities and relations, is structurally inconsistent with the natural language query. Thus, the QA system based on KG is still faced with difficulties. The purpose of this paper is to propose a method to answer the domain-specific questions based on KG, providing conveniences for the information query over domain KG.

The authors propose a method FactQA to answer the factual questions about specific domain. A series of logical rules are designed to transform the factual questions into the triples, in order to solve the structural inconsistency between the user’s question and the domain knowledge. Then, the query expansion strategies and filtering strategies are proposed from two levels (i.e. words and triples in the question). For matching the question with domain knowledge, not only the similarity values between the words in the question and the resources in the domain knowledge but also the tag information of these words is considered. And the tag information is obtained by parsing the question using Stanford CoreNLP. In this paper, the KG in metallic materials domain is used to illustrate the FactQA method.

The designed logical rules have time stability for transforming the factual questions into the triples. Additionally, after filtering the synonym expansion results of the words in the question, the expansion quality of the triple representation of the question is improved. The tag information of the words in the question is considered in the process of data matching, which could help to filter out the wrong matches.

Although the FactQA is proposed for domain-specific QA, it can also be applied to any other domain besides metallic materials domain. For a question that cannot be answered, FactQA would generate a new related question to answer, providing as much as possible the user with the information they probably need. The FactQA could facilitate the user’s information query based on the emerging KG.

The purpose of this paper is to study the application of feature‐based image matching algorithm for PCB matching without using special fiducial marks.

Speed‐up robust feature (SURF) is applied to extract the interest points in PCB images. An advanced threshold is set to reject the interest points with low responses to speed up feature computation. In order to improve the performance for rotation, the descriptors are based on multi‐orientations. The many‐to‐many tentative correspondences are determined with a maximum distance. Hough transform is used to reject the mismatches and the affine parameters are computed with a square‐least solution.

Results show that the method proposed in this paper can match the PCB images without using special fiducial marks effectively. The image matching algorithm shows a better performance for image rotation than the standard SURF and it succeeds in matching the image including repetitive patterns which will deteriorate the distinctiveness of feature descriptors.

Additional orientations produce more descriptors so that it takes extra time for feature description and matching.

The paper proposes a SURF‐based image matching algorithm to match the PCB images without special fiducial marks. This can reduce the complexity of PCB production. The image matching algorithm is robust to image rotation and repetitive patterns and can be used in other applications of image matching.

The purpose of this paper is to explore the matching relationship between factor endowment and industrial structure, and its impact on economic growth.

The assortative matching method is developed to quantitatively measure the matching between factor endowment and industrial structure. A series of empirical tests are then carried out to evaluate the impact on the economic development of the matching.

1) The matching between factor endowment and industrial structure has a significantly positive impact on economic growth. (2) Economic growth reaches its maximum when the gap between the two sectors narrows to zero. (3) This effect is particularly significant for countries with higher GDP per capita and GNI per capita. (4) The results remain robust after employing a series of tests.

Aggressive industrial policies are not desirable. The optimal industrial structure is the one that complied with the comparative advantage of the given factor endowment in the economy.

So far, there has been a significant lack of an applicable quantitative indicator for measuring the matching between factor endowment and industrial structure, which is essential for conducting empirical tests and providing evidence for related economic theories.

The motion vector estimation algorithm is very widely used in many image process applications, such as the image stabilization and object tracking algorithms. The conventional searching algorithm, based on the block matching manipulation, is used to estimate the motion vectors in conventional image processing algorithms. During the block matching manipulation, the violent motion will result in greater amount of computation. However, too large amount of calculation will reduce the effectiveness of the motion vector estimation algorithm. This paper aims to present a novel searching method to estimate the motion vectors effectively.

This paper presents a novel searching method to estimate the motion vectors for high-resolution image sequences. The searching strategy of this algorithm includes three steps: the larger area searching, the adaptive directional searching and the small area searching.

The achievement of this paper is to develop a motion vector searching strategy to improve the computation efficiency. Compared with the conventional motion vector searching algorithms, the novel motion vector searching algorithm can reduce the motion matching manipulation effectively by 50 per cent.

This paper presents a novel searching strategy to estimate the motion vectors effectively. From the experimental results, the novel motion vector searching algorithm can reduce the motion matching manipulation effectively, compared with the conventional motion vector searching algorithms.