Graph similarity join has become imperative for integrating noisy and inconsistent data from multiple data sources. The edit distance is commonly used to measure the similarity between graphs. To accelerate the simila...Graph similarity join has become imperative for integrating noisy and inconsistent data from multiple data sources. The edit distance is commonly used to measure the similarity between graphs. To accelerate the similarity join based on graph edit distance, in the paper, we make use of a preprocessing strategy to remove the mismatching graph pairs with significant differences. Then a novel method of building indexes for each graph is proposed by grouping the nodes which can be reached in k hops for each key node with structure conservation, which is the k-hop-tree based indexing method. Experiments on real and synthetic graph databases also confirm that our method can achieve good join quality in graph similarity join. Besides, the join process can be finished in polynomial time.展开更多
Internet of Things (IoT) as an important and ubiquitous service paradigm is one of the most important issues in IoT applications to provide terminal users with effective and efficient services based on service communi...Internet of Things (IoT) as an important and ubiquitous service paradigm is one of the most important issues in IoT applications to provide terminal users with effective and efficient services based on service community. This paper presents a semantic-based similarity algorithm to build the IoT service community. Firstly, the algorithm reflects that the nodes of IoT contain a wealth of semantic information and makes them to build into the concept tree. Then tap the similarity of the semantic information based on the concept tree. Finally, we achieve the optimization of the service community through greedy algorithm and control the size of the service community by adjusting the threshold. Simulation results show the effectiveness and feasibility of this algorithm.展开更多
Shea nuts play an important role in food security for rural folks within sub-Sahara Africa, serving as the main source of income for many people living in Northern Ghana. Unfortunately, the full economic potential of ...Shea nuts play an important role in food security for rural folks within sub-Sahara Africa, serving as the main source of income for many people living in Northern Ghana. Unfortunately, the full economic potential of the Sheanut tree has not been fully realized due to the difficulty involved in its domestication. This difficulty in vegetatively propagating sheanut trees has greatly hindered its cultivation and the realization of its true economic potential. Two experiments were conducted to investigate the effects of rooting media and varying indole 3-butyric acid (IBA) concentrations on adventitious root formation in cuttings taken from coppiced sheanut trees. Results indicated that 3000 ppm produced significantly (p 0.05) better rooting (57.5%) than 5000 ppm (30%), 7000 ppm (45.0%) and the control (7.5%). Although the levels of soluble sugars (SS) and total free phenols (TFP) in the cutting were significantly (p 0.05) higher at the end of the experiment (after IBA treatment) compared to the start (prior to IBA treatment), the SS and TFP trends observed did not clearly explain the rooting differences found between the IBA levels investigated. Callus formation was significantly (p 0.05) higher (35.0%) in the control (no IBA). Generally, callus formation decreased with increasing IBA concentration. In the rooting media experiment, rooting was significantly (p 0.05) higher in the rice husk medium (35.0%) compared to that in the palm fiber (18.3%), saw dust (14.1%) and top soil (16.7%) media.展开更多
Minimal cut sets （or prime implicants： minimal combinations of basic event conditions leading to system failure） are important information for reliability/safety analysis and design. To obtain minimal cut sets for ...Minimal cut sets （or prime implicants： minimal combinations of basic event conditions leading to system failure） are important information for reliability/safety analysis and design. To obtain minimal cut sets for general non-coherent fault trees, including negative basic events or multi-valued basic events, a special procedure such as the consensus rule must be applied to the results obtained by logical operations for coherent fault trees, which will require more steps and time. This paper proposes a simple method for a non-coherent fault tree, whose top event is represented as an AND combination of monotonic sub-trees. A ＂monotonic＂ sub-tree means that it does not have both positive and negative representations for each basic event. It is proven that minimal cut sets can be obtained by a conventional method for coherent fault trees. An illustrative example of a simple event tree analysis shows the detail and characteristics of the proposed method.展开更多
A new fault tree analysis (FTA) computation method is put forth by using modularization technique in FTA with cut sets matrix, and can reduce NP (Nondeterministic polynomial) difficulty effectively. This software can ...A new fault tree analysis (FTA) computation method is put forth by using modularization technique in FTA with cut sets matrix, and can reduce NP (Nondeterministic polynomial) difficulty effectively. This software can run in IBM PC and DOS 3.0 and up. The method provides theoretical basis and computation tool for application of FTA technique in the common engineering system展开更多
According to similarity theory, we carried out a dimensional analysis of the shearer drum correlation parameters and built similarity criteria. Based on these, similarity models of shearer drums were developed. Simult...According to similarity theory, we carried out a dimensional analysis of the shearer drum correlation parameters and built similarity criteria. Based on these, similarity models of shearer drums were developed. Simultaneously, based on an estab- lished cutting testbed of the coal and rock, cutting tests of different pick arrangements of the drum models were carried out, where the compressive strength of the analogous cutting material was 2.48 MPa and the drum rotary speed 67.5 r/min. The variance, the mean values, maxima and mean maxima of the torque load were analyzed for different type drum models. Moreover, the relation-ships between the type of pick arrangements and the cutting lump coal percentage were studied. The results indicate that the load fluctuation of the sequence drum is larger than that of the punnett square drum in the cutting process and the lump coal percentage and economic benefits of the sequence drum are inferior to the punnett square drum. We conclude that the punnett square drum is superior to the sequence drum.展开更多
For classifying unknown 3-D objects into a set of predetermined object classes, a part-level object classification method based on the improved interpretation tree is presented. The part-level representation is implem...For classifying unknown 3-D objects into a set of predetermined object classes, a part-level object classification method based on the improved interpretation tree is presented. The part-level representation is implemented, which enables a more compact shape description of 3-D objects. The proposed classification method consists of two key processing stages： the improved constrained search on an interpretation tree and the following shape similarity measure computation. By the classification method, both whole match and partial match with shape similarity ranks are achieved; especially, focus match can be accomplished, where different key parts may be labeled and all the matched models containing corresponding key parts may be obtained. A series of experiments show the effectiveness of the presented 3-D object classification method.展开更多
This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two algorithms: the weighted av...This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two algorithms: the weighted average and the cosine simplex algorithm. The first approach identifies binding constraints by using the weighted average of each constraint, whereas the second algorithm is based on the cosine similarity between the vector of the objective function and the constraints. These two approaches are complementary, and when used together, they locate the essential subset of initial constraints required for solving medium and large-scale linear programming problems. After reducing the dimension of the linear programming problem using the subset of the essential constraints, the solution method can be chosen from any suitable method for linear programming. The proposed approach was applied to a set of well-known benchmarks as well as more than 2000 random medium and large-scale linear programming problems. The results are promising, indicating that the new approach contributes to the reduction of both the size of the problems and the total number of iterations required. A tree-based classification model also confirmed the need for combining the two approaches. A detailed numerical example, the general numerical results, and the statistical analysis for the decision tree procedure are presented.展开更多
Graphs have been widely used for complex data representation in many real applications, such as social network, bioinformatics, and computer vision. Therefore, graph similarity join has become imperative for integrati...Graphs have been widely used for complex data representation in many real applications, such as social network, bioinformatics, and computer vision. Therefore, graph similarity join has become imperative for integrating noisy and inconsistent data from multiple data sources. The edit distance is commonly used to measure the similarity between graphs. The graph similarity join problem studied in this paper is based on graph edit distance constraints. To accelerate the similarity join based on graph edit distance, in the paper, we make use of a preprocessing strategy to remove the mismatching graph pairs with significant differences. Then a novel method of building indexes for each graph is proposed by grouping the nodes which can be reached in k hops for each key node with structure conservation, which is the k-hop tree based indexing method. As for each candidate pair, we propose a similarity computation algorithm with boundary filtering, which can be applied with good efficiency and effectiveness. Experiments on real and synthetic graph databases also confirm that our method can achieve good join quality in graph similarity join. Besides, the join process can be finished in polynomial time.展开更多
文摘Graph similarity join has become imperative for integrating noisy and inconsistent data from multiple data sources. The edit distance is commonly used to measure the similarity between graphs. To accelerate the similarity join based on graph edit distance, in the paper, we make use of a preprocessing strategy to remove the mismatching graph pairs with significant differences. Then a novel method of building indexes for each graph is proposed by grouping the nodes which can be reached in k hops for each key node with structure conservation, which is the k-hop-tree based indexing method. Experiments on real and synthetic graph databases also confirm that our method can achieve good join quality in graph similarity join. Besides, the join process can be finished in polynomial time.
基金Supported by the China Postdoctoral Science Foundation(No. 20100480701)the Ministry of Education of Humanities and Social Sciences Youth Fund Project(11YJC880119)
文摘Internet of Things (IoT) as an important and ubiquitous service paradigm is one of the most important issues in IoT applications to provide terminal users with effective and efficient services based on service community. This paper presents a semantic-based similarity algorithm to build the IoT service community. Firstly, the algorithm reflects that the nodes of IoT contain a wealth of semantic information and makes them to build into the concept tree. Then tap the similarity of the semantic information based on the concept tree. Finally, we achieve the optimization of the service community through greedy algorithm and control the size of the service community by adjusting the threshold. Simulation results show the effectiveness and feasibility of this algorithm.
文摘Shea nuts play an important role in food security for rural folks within sub-Sahara Africa, serving as the main source of income for many people living in Northern Ghana. Unfortunately, the full economic potential of the Sheanut tree has not been fully realized due to the difficulty involved in its domestication. This difficulty in vegetatively propagating sheanut trees has greatly hindered its cultivation and the realization of its true economic potential. Two experiments were conducted to investigate the effects of rooting media and varying indole 3-butyric acid (IBA) concentrations on adventitious root formation in cuttings taken from coppiced sheanut trees. Results indicated that 3000 ppm produced significantly (p 0.05) better rooting (57.5%) than 5000 ppm (30%), 7000 ppm (45.0%) and the control (7.5%). Although the levels of soluble sugars (SS) and total free phenols (TFP) in the cutting were significantly (p 0.05) higher at the end of the experiment (after IBA treatment) compared to the start (prior to IBA treatment), the SS and TFP trends observed did not clearly explain the rooting differences found between the IBA levels investigated. Callus formation was significantly (p 0.05) higher (35.0%) in the control (no IBA). Generally, callus formation decreased with increasing IBA concentration. In the rooting media experiment, rooting was significantly (p 0.05) higher in the rice husk medium (35.0%) compared to that in the palm fiber (18.3%), saw dust (14.1%) and top soil (16.7%) media.
文摘Minimal cut sets （or prime implicants： minimal combinations of basic event conditions leading to system failure） are important information for reliability/safety analysis and design. To obtain minimal cut sets for general non-coherent fault trees, including negative basic events or multi-valued basic events, a special procedure such as the consensus rule must be applied to the results obtained by logical operations for coherent fault trees, which will require more steps and time. This paper proposes a simple method for a non-coherent fault tree, whose top event is represented as an AND combination of monotonic sub-trees. A ＂monotonic＂ sub-tree means that it does not have both positive and negative representations for each basic event. It is proven that minimal cut sets can be obtained by a conventional method for coherent fault trees. An illustrative example of a simple event tree analysis shows the detail and characteristics of the proposed method.
文摘A new fault tree analysis (FTA) computation method is put forth by using modularization technique in FTA with cut sets matrix, and can reduce NP (Nondeterministic polynomial) difficulty effectively. This software can run in IBM PC and DOS 3.0 and up. The method provides theoretical basis and computation tool for application of FTA technique in the common engineering system
文摘According to similarity theory, we carried out a dimensional analysis of the shearer drum correlation parameters and built similarity criteria. Based on these, similarity models of shearer drums were developed. Simultaneously, based on an estab- lished cutting testbed of the coal and rock, cutting tests of different pick arrangements of the drum models were carried out, where the compressive strength of the analogous cutting material was 2.48 MPa and the drum rotary speed 67.5 r/min. The variance, the mean values, maxima and mean maxima of the torque load were analyzed for different type drum models. Moreover, the relation-ships between the type of pick arrangements and the cutting lump coal percentage were studied. The results indicate that the load fluctuation of the sequence drum is larger than that of the punnett square drum in the cutting process and the lump coal percentage and economic benefits of the sequence drum are inferior to the punnett square drum. We conclude that the punnett square drum is superior to the sequence drum.
基金The National Basic Research Program of China(973Program)(No2006CB303105)the Research Foundation of Bei-jing Jiaotong University (NoK06J0170)
文摘For classifying unknown 3-D objects into a set of predetermined object classes, a part-level object classification method based on the improved interpretation tree is presented. The part-level representation is implemented, which enables a more compact shape description of 3-D objects. The proposed classification method consists of two key processing stages： the improved constrained search on an interpretation tree and the following shape similarity measure computation. By the classification method, both whole match and partial match with shape similarity ranks are achieved; especially, focus match can be accomplished, where different key parts may be labeled and all the matched models containing corresponding key parts may be obtained. A series of experiments show the effectiveness of the presented 3-D object classification method.
文摘This paper presents a new dimension reduction strategy for medium and large-scale linear programming problems. The proposed method uses a subset of the original constraints and combines two algorithms: the weighted average and the cosine simplex algorithm. The first approach identifies binding constraints by using the weighted average of each constraint, whereas the second algorithm is based on the cosine similarity between the vector of the objective function and the constraints. These two approaches are complementary, and when used together, they locate the essential subset of initial constraints required for solving medium and large-scale linear programming problems. After reducing the dimension of the linear programming problem using the subset of the essential constraints, the solution method can be chosen from any suitable method for linear programming. The proposed approach was applied to a set of well-known benchmarks as well as more than 2000 random medium and large-scale linear programming problems. The results are promising, indicating that the new approach contributes to the reduction of both the size of the problems and the total number of iterations required. A tree-based classification model also confirmed the need for combining the two approaches. A detailed numerical example, the general numerical results, and the statistical analysis for the decision tree procedure are presented.
文摘Graphs have been widely used for complex data representation in many real applications, such as social network, bioinformatics, and computer vision. Therefore, graph similarity join has become imperative for integrating noisy and inconsistent data from multiple data sources. The edit distance is commonly used to measure the similarity between graphs. The graph similarity join problem studied in this paper is based on graph edit distance constraints. To accelerate the similarity join based on graph edit distance, in the paper, we make use of a preprocessing strategy to remove the mismatching graph pairs with significant differences. Then a novel method of building indexes for each graph is proposed by grouping the nodes which can be reached in k hops for each key node with structure conservation, which is the k-hop tree based indexing method. As for each candidate pair, we propose a similarity computation algorithm with boundary filtering, which can be applied with good efficiency and effectiveness. Experiments on real and synthetic graph databases also confirm that our method can achieve good join quality in graph similarity join. Besides, the join process can be finished in polynomial time.
