Using a quantum computer to simulate fermionic systems requires fermion-to-qubit transformations.Usually,lower Pauli weight of transformations means shallower quantum circuits.Therefore,most existing transformations a...Using a quantum computer to simulate fermionic systems requires fermion-to-qubit transformations.Usually,lower Pauli weight of transformations means shallower quantum circuits.Therefore,most existing transformations aim for lower Pauli weight.However,in some cases,the circuit depth depends not only on the Pauli weight but also on the coefficients of the Hamiltonian terms.In order to characterize the circuit depth of these algorithms,we propose a new metric called weighted Pauli weight,which depends on Pauli weight and coefficients of Hamiltonian terms.To achieve smaller weighted Pauli weight,we introduce a novel transformation,Huffman-code-based ternary tree(HTT)transformation,which is built upon the classical Huffman code and tailored to different Hamiltonians.We tested various molecular Hamiltonians and the results show that the weighted Pauli weight of the HTT transformation is smaller than that of commonly used mappings.At the same time,the HTT transformation also maintains a relatively small Pauli weight.The mapping we designed reduces the circuit depth of certain Hamiltonian simulation algorithms,facilitating faster simulation of fermionic systems.展开更多
The Long Term Evolution (LTE) system imposes high requirements for dispatching delay.Moreover,very large air interface rate of LTE requires good processing capability for the devices processing the baseband signals.Co...The Long Term Evolution (LTE) system imposes high requirements for dispatching delay.Moreover,very large air interface rate of LTE requires good processing capability for the devices processing the baseband signals.Consequently,the single-core processor cannot meet the requirements of LTE system.This paper analyzes how to use multi-core processors to achieve parallel processing of uplink demodulation and decoding in LTE systems and designs an approach to parallel processing.The test results prove that this approach works quite well.展开更多
[Objective] This paper aims to construct an improved fuzzy decision tree which is based on clustering,and researches into its application in the screening of maize germplasm.[Method] A new decision tree algorithm base...[Objective] This paper aims to construct an improved fuzzy decision tree which is based on clustering,and researches into its application in the screening of maize germplasm.[Method] A new decision tree algorithm based upon clustering is adopted in this paper,which is improved against the defect that traditional decision tree algorithm fails to handle samples of no classes.Meanwhile,the improved algorithm is also applied to the screening of maize varieties.Through the indices as leaf area,plant height,dry weight,potassium（K） utilization and others,maize seeds with strong tolerance of hypokalemic are filtered out.[Result] The algorithm in the screening of maize germplasm has great applicability and good performance.[Conclusion] In the future more efforts should be made to compare improved the performance of fuzzy decision tree based upon clustering with the performance of traditional fuzzy one,and it should be applied into more realistic problems.展开更多
Expert knowledge is the key to modeling milling fault detection systems based on the belief rule base.The construction of an initial expert knowledge base seriously affects the accuracy and interpretability of the mil...Expert knowledge is the key to modeling milling fault detection systems based on the belief rule base.The construction of an initial expert knowledge base seriously affects the accuracy and interpretability of the milling fault detection model.However,due to the complexity of the milling system structure and the uncertainty of the milling failure index,it is often impossible to construct model expert knowledge effectively.Therefore,a milling system fault detection method based on fault tree analysis and hierarchical BRB(FTBRB)is proposed.Firstly,the proposed method uses a fault tree and hierarchical BRB modeling.Through fault tree analysis(FTA),the logical correspondence between FTA and BRB is sorted out.This can effectively embed the FTA mechanism into the BRB expert knowledge base.The hierarchical BRB model is used to solve the problem of excessive indexes and avoid combinatorial explosion.Secondly,evidence reasoning(ER)is used to ensure the transparency of the model reasoning process.Thirdly,the projection covariance matrix adaptation evolutionary strategies(P-CMA-ES)is used to optimize the model.Finally,this paper verifies the validity model and the method’s feasibility techniques for milling data sets.展开更多
Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of ...Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.展开更多
The sensor virus is a serious threat,as an attacker can simply send a single packet to compromise the entire sensor network.Epidemics become drastic with link additions among sensors when the small world phenomena occ...The sensor virus is a serious threat,as an attacker can simply send a single packet to compromise the entire sensor network.Epidemics become drastic with link additions among sensors when the small world phenomena occur.Two immunization strategies,uniform immunization and temporary immunization,are conducted on small worlds of tree-based wireless sensor networks to combat the sensor viruses.With the former strategy,the infection extends exponentially,although the immunization effectively reduces the contagion speed.With the latter strategy,recurrent contagion oscillations occur in the small world when the spatial-temporal dynamics of the epidemic are considered.The oscillations come from the small-world structure and the temporary immunization.Mathematical analyses on the small world of the Cayley tree are presented to reveal the epidemic dynamics with the two immunization strategies.展开更多
In order to accommodate the variety of algorithms with different performance in specific application and improve power efficiency,reconfigurable architecture has become an effective methodology in academia and industr...In order to accommodate the variety of algorithms with different performance in specific application and improve power efficiency,reconfigurable architecture has become an effective methodology in academia and industry.However,existing architectures suffer from performance bottleneck due to slow updating of contexts and inadequate flexibility.This paper presents an H-tree based reconfiguration mechanism(HRM)with Huffman-coding-like and mask addressing method in a homogeneous processing element(PE)array,which supports both programmable and data-driven modes.The proposed HRM can transfer reconfiguration instructions/contexts to a particular PE or associated PEs simultaneously in one clock cycle in unicast,multicast and broadcast mode,and shut down the unnecessary PE/PEs according to the current configuration.To verify the correctness and efficiency,we implement it in RTL synthesis and FPGA prototype.Compared to prior works,the experiment results show that the HRM has improved the work frequency by an average of 23.4%,increased the updating speed by 2×,and reduced the area by 36.9%;HRM can also power off the unnecessary PEs which reduced 51%of dynamic power dissipation in certain application configuration.Furthermore,in the data-driven mode,the system frequency can reach 214 MHz,which is 1.68×higher compared with the programmable mode.展开更多
Finding simple, non recursive, base noun phrase is an important step for many natural language processing applications. This paper presents a new corpus based approach using decision tree for that purpose. In contrast...Finding simple, non recursive, base noun phrase is an important step for many natural language processing applications. This paper presents a new corpus based approach using decision tree for that purpose. In contrast to previous methods for Base NP identification, we adopt a decision tree trained from Penn Treebank to identify Base NP. And a self learning mechanism is further integrated into our model. Experimental results show good performances using our method. The method can also be applied to processing of any other language.展开更多
In this paper, a process of the quadtree mesh generation is described, then a mesh control device of the tree based mesh generators is analyzed in detail. Some examples are given to demonstrate that the mesh contro...In this paper, a process of the quadtree mesh generation is described, then a mesh control device of the tree based mesh generators is analyzed in detail. Some examples are given to demonstrate that the mesh control device allows for efficient a priori and a posteriori mesh refinements.展开更多
Instrumented is defined as a key characteristic in the upcoming smart cites, which demands a higher Wireless Sensor Networks (WSNs) performance. Tree-based Hierarchical Routing (THR) is a routing protocol for WSNs sta...Instrumented is defined as a key characteristic in the upcoming smart cites, which demands a higher Wireless Sensor Networks (WSNs) performance. Tree-based Hierarchical Routing (THR) is a routing protocol for WSNs static scenarios. THR hierarchically maps WSN area into a routing tree. However, fixed topology and hierarchical architecture leads to unbalanced energy overhead distribution and inflexible routes selection. To uniformly distribute routing energy overhead, reduce routing hops and extend network life cycle, we designed an enhanced THR routing protocol based on additional connections such as Neighbors, Brothers and Nephews. Based on these connections, three actions were introduced which are Shortcut, Overhead Balancing and Adoption. A simulation for different network loads on OMNet++4.1 is issued, and realized this THR routing in Chipcon SmartRF04?EB embedded boards based on Zigbee in a point-to-point topology. According to the simulation results and experiment data, this proposal obviously improved the latency performance, reduced energy overhead and extended the network’s life cycle.展开更多
This article proposes the high-speed and high-accuracy code clone detection method based on the combination of tree-based and token-based methods. Existence of duplicated program codes, called code clone, is one of th...This article proposes the high-speed and high-accuracy code clone detection method based on the combination of tree-based and token-based methods. Existence of duplicated program codes, called code clone, is one of the main factors that reduces the quality and maintainability of software. If one code fragment contains faults (bugs) and they are copied and modified to other locations, it is necessary to correct all of them. But it is not easy to find all code clones in large and complex software. Much research efforts have been done for code clone detection. There are mainly two methods for code clone detection. One is token-based and the other is tree-based method. Token-based method is fast and requires less resources. However it cannot detect all kinds of code clones. Tree-based method can detect all kinds of code clones, but it is slow and requires much computing resources. In this paper combination of these two methods was proposed to improve the efficiency and accuracy of detecting code clones. Firstly some candidates of code clones will be extracted by token-based method that is fast and lightweight. Then selected candidates will be checked more precisely by using tree-based method that can find all kinds of code clones. The prototype system was developed. This system accepts source code and tokenizes it in the first step. Then token-based method is applied to this token sequence to find candidates of code clones. After extracting several candidates, selected source codes will be converted into abstract syntax tree (AST) for applying tree-based method. Some sample source codes were used to evaluate the proposed method. This evaluation proved the improvement of efficiency and precision of code clones detecting.展开更多
As forest is of great significance for our whole development and the sustainable plan is so focus on it. It is very urgent for us to have the whole distribution,stock volume and other related information about that. S...As forest is of great significance for our whole development and the sustainable plan is so focus on it. It is very urgent for us to have the whole distribution,stock volume and other related information about that. So the forest inventory program is on our schedule. Aiming at dealing with the problem in extraction of dominant tree species,we tested the highly hot method-object-based analysis. Based on the ALOS image data,we combined multi-resolution in e Cognition software and fuzzy classification algorithm. Through analyzing the segmentation results,we basically extract the spruce,the pine,the birch and the oak of the study area. Both the spectral and spatial characteristics were derived from those objects,and with the help of GLCM,we got the differences of each species. We use confusion matrix to do the Classification accuracy assessment compared with the actual ground data and this method showed a comparatively good precision as 87% with the kappa coefficient 0. 837.展开更多
With the increasing interest in e-commerce shopping, customer reviews have become one of the most important elements that determine customer satisfaction regarding products. This demonstrates the importance of working...With the increasing interest in e-commerce shopping, customer reviews have become one of the most important elements that determine customer satisfaction regarding products. This demonstrates the importance of working with Text Mining. This study is based on The Women’s Clothing E-Commerce Reviews database, which consists of reviews written by real customers. The aim of this paper is to conduct a Text Mining approach on a set of customer reviews. Each review was classified as either a positive or negative review by employing a classification method. Four tree-based methods were applied to solve the classification problem, namely Classification Tree, Random Forest, Gradient Boosting and XGBoost. The dataset was categorized into training and test sets. The results indicate that the Random Forest method displays an overfitting, XGBoost displays an overfitting if the number of trees is too high, Classification Tree is good at detecting negative reviews and bad at detecting positive reviews and the Gradient Boosting shows stable values and quality measures above 77% for the test dataset. A consensus between the applied methods is noted for important classification terms.展开更多
This work proposes authentication based on identity as a way to increase the efficiency and security of communications in vehicular ad-hoc networks. When using identity-based cryptography to achieve certificateless au...This work proposes authentication based on identity as a way to increase the efficiency and security of communications in vehicular ad-hoc networks. When using identity-based cryptography to achieve certificateless authentication, membership revocation is not a trivial problem. Thus, in order to improve the performance of revocation in such networks, the use of a dynamic authenticated data structure based on perfect k-ary hash trees combined with a duplex version of the new standard SHA-3 is here presented. Efficient algorithms in the used revocation trees allow reaching a refresh rate of at most simple updates per inserted node. Consequently, the proposal is especially useful for situations with frequent revocations, which are foreseeable when vehicular ad- hoc networks are widely deployed.展开更多
In frequent tree pattern mining, the number of frequent subtrees generated is often too large. To tackle this problem, the concept of condensed frequent subtree base is proposed. The base consists of the maximal frequ...In frequent tree pattern mining, the number of frequent subtrees generated is often too large. To tackle this problem, the concept of condensed frequent subtree base is proposed. The base consists of the maximal frequent subtrees for a series of support thresholds. It is a subset of frequent subtrees, and is used to approximate the support of arbitrary frequent subtrees with guaranteed maximal error bound. In addition, an algorithm is developed to mine such a condensed subtree base in a database of labeled rooted ordered trees. The algorithm adopts the way of fight-most extension to generate systematically all frequent rooted ordered subtrees. Several techniques are proposed to prune the branches that do not correspond to the maximal frequent subtrees. Heuristic techniques are used to arrange the order of computation so that relatively expensive computation is avoided as much as possible. Experimental results show that the size of the base is less than 10% of that of the complete set, and the algorithm outperforms the previous algorithms.展开更多
Due to the interrelationship between the base placement of the manipulator and its operation object,it is significant to analyze the accessibility and workspace of manipulators for the optimization of their base locat...Due to the interrelationship between the base placement of the manipulator and its operation object,it is significant to analyze the accessibility and workspace of manipulators for the optimization of their base location.A new method is presented to optimize the base placement of manipulators through motion planning optimization and location optimization in the feasible area for manipulators.Firstly,research problems and contents are outlined.And then the feasible area for the manipulator base installation is discussed.Next,index depended on the joint movements and used to evaluate the kinematic performance of manipulators is defined.Although the mentioned indices in last section are regarded as the cost function of the latter,rapidly-exploring random tree(RRT) and rapidly-exploring random tree*(RRT*) algorithms are analyzed.And then,the proposed optimization method of manipulator base placement is studied by means of simulation research based on kinematic performance criteria.Finally,the conclusions could be proved effective from the simulation results.展开更多
基金supported by the National Key Research and Development Program of China(Grant No.2024YFB4504101)the National Nat-ural Science Foundation of China(Grant No.22303022)the Anhui Province Innovation Plan for Science and Technology(Grant No.202423r06050002).
文摘Using a quantum computer to simulate fermionic systems requires fermion-to-qubit transformations.Usually,lower Pauli weight of transformations means shallower quantum circuits.Therefore,most existing transformations aim for lower Pauli weight.However,in some cases,the circuit depth depends not only on the Pauli weight but also on the coefficients of the Hamiltonian terms.In order to characterize the circuit depth of these algorithms,we propose a new metric called weighted Pauli weight,which depends on Pauli weight and coefficients of Hamiltonian terms.To achieve smaller weighted Pauli weight,we introduce a novel transformation,Huffman-code-based ternary tree(HTT)transformation,which is built upon the classical Huffman code and tailored to different Hamiltonians.We tested various molecular Hamiltonians and the results show that the weighted Pauli weight of the HTT transformation is smaller than that of commonly used mappings.At the same time,the HTT transformation also maintains a relatively small Pauli weight.The mapping we designed reduces the circuit depth of certain Hamiltonian simulation algorithms,facilitating faster simulation of fermionic systems.
文摘The Long Term Evolution (LTE) system imposes high requirements for dispatching delay.Moreover,very large air interface rate of LTE requires good processing capability for the devices processing the baseband signals.Consequently,the single-core processor cannot meet the requirements of LTE system.This paper analyzes how to use multi-core processors to achieve parallel processing of uplink demodulation and decoding in LTE systems and designs an approach to parallel processing.The test results prove that this approach works quite well.
文摘[Objective] This paper aims to construct an improved fuzzy decision tree which is based on clustering,and researches into its application in the screening of maize germplasm.[Method] A new decision tree algorithm based upon clustering is adopted in this paper,which is improved against the defect that traditional decision tree algorithm fails to handle samples of no classes.Meanwhile,the improved algorithm is also applied to the screening of maize varieties.Through the indices as leaf area,plant height,dry weight,potassium（K） utilization and others,maize seeds with strong tolerance of hypokalemic are filtered out.[Result] The algorithm in the screening of maize germplasm has great applicability and good performance.[Conclusion] In the future more efforts should be made to compare improved the performance of fuzzy decision tree based upon clustering with the performance of traditional fuzzy one,and it should be applied into more realistic problems.
基金This work was supported in part by the Natural Science Foundation of China under Grant 62203461 and Grant 62203365in part by the Postdoctoral Science Foundation of China under Grant No.2020M683736+3 种基金in part by the Teaching reform project of higher education in Heilongjiang Province under Grant Nos.SJGY20210456 and SJGY20210457in part by the Natural Science Foundation of Heilongjiang Province of China under Grant No.LH2021F038in part by the graduate academic innovation project of Harbin Normal University under Grant Nos.HSDSSCX2022-17,HSDSSCX2022-18 andHSDSSCX2022-19in part by the Foreign Expert Project of Heilongjiang Province under Grant No.GZ20220131.
文摘Expert knowledge is the key to modeling milling fault detection systems based on the belief rule base.The construction of an initial expert knowledge base seriously affects the accuracy and interpretability of the milling fault detection model.However,due to the complexity of the milling system structure and the uncertainty of the milling failure index,it is often impossible to construct model expert knowledge effectively.Therefore,a milling system fault detection method based on fault tree analysis and hierarchical BRB(FTBRB)is proposed.Firstly,the proposed method uses a fault tree and hierarchical BRB modeling.Through fault tree analysis(FTA),the logical correspondence between FTA and BRB is sorted out.This can effectively embed the FTA mechanism into the BRB expert knowledge base.The hierarchical BRB model is used to solve the problem of excessive indexes and avoid combinatorial explosion.Secondly,evidence reasoning(ER)is used to ensure the transparency of the model reasoning process.Thirdly,the projection covariance matrix adaptation evolutionary strategies(P-CMA-ES)is used to optimize the model.Finally,this paper verifies the validity model and the method’s feasibility techniques for milling data sets.
文摘Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.
文摘The sensor virus is a serious threat,as an attacker can simply send a single packet to compromise the entire sensor network.Epidemics become drastic with link additions among sensors when the small world phenomena occur.Two immunization strategies,uniform immunization and temporary immunization,are conducted on small worlds of tree-based wireless sensor networks to combat the sensor viruses.With the former strategy,the infection extends exponentially,although the immunization effectively reduces the contagion speed.With the latter strategy,recurrent contagion oscillations occur in the small world when the spatial-temporal dynamics of the epidemic are considered.The oscillations come from the small-world structure and the temporary immunization.Mathematical analyses on the small world of the Cayley tree are presented to reveal the epidemic dynamics with the two immunization strategies.
基金supported by the National Natural Science Foundation of China (Nos. 61834005, 61602377, 61772417, 61802304, 61874087)the Shaanxi International Science and Technology Cooperation Program No. 2018KW-006+1 种基金Shaanxi Provincial Key R&D Plan under Grant No. 2017GY-060Shaanxi Province Co-ordination Innovation Project of Science and Technology under Grant No. 2016KTZDGY02-04-02
文摘In order to accommodate the variety of algorithms with different performance in specific application and improve power efficiency,reconfigurable architecture has become an effective methodology in academia and industry.However,existing architectures suffer from performance bottleneck due to slow updating of contexts and inadequate flexibility.This paper presents an H-tree based reconfiguration mechanism(HRM)with Huffman-coding-like and mask addressing method in a homogeneous processing element(PE)array,which supports both programmable and data-driven modes.The proposed HRM can transfer reconfiguration instructions/contexts to a particular PE or associated PEs simultaneously in one clock cycle in unicast,multicast and broadcast mode,and shut down the unnecessary PE/PEs according to the current configuration.To verify the correctness and efficiency,we implement it in RTL synthesis and FPGA prototype.Compared to prior works,the experiment results show that the HRM has improved the work frequency by an average of 23.4%,increased the updating speed by 2×,and reduced the area by 36.9%;HRM can also power off the unnecessary PEs which reduced 51%of dynamic power dissipation in certain application configuration.Furthermore,in the data-driven mode,the system frequency can reach 214 MHz,which is 1.68×higher compared with the programmable mode.
文摘Finding simple, non recursive, base noun phrase is an important step for many natural language processing applications. This paper presents a new corpus based approach using decision tree for that purpose. In contrast to previous methods for Base NP identification, we adopt a decision tree trained from Penn Treebank to identify Base NP. And a self learning mechanism is further integrated into our model. Experimental results show good performances using our method. The method can also be applied to processing of any other language.
文摘In this paper, a process of the quadtree mesh generation is described, then a mesh control device of the tree based mesh generators is analyzed in detail. Some examples are given to demonstrate that the mesh control device allows for efficient a priori and a posteriori mesh refinements.
文摘Instrumented is defined as a key characteristic in the upcoming smart cites, which demands a higher Wireless Sensor Networks (WSNs) performance. Tree-based Hierarchical Routing (THR) is a routing protocol for WSNs static scenarios. THR hierarchically maps WSN area into a routing tree. However, fixed topology and hierarchical architecture leads to unbalanced energy overhead distribution and inflexible routes selection. To uniformly distribute routing energy overhead, reduce routing hops and extend network life cycle, we designed an enhanced THR routing protocol based on additional connections such as Neighbors, Brothers and Nephews. Based on these connections, three actions were introduced which are Shortcut, Overhead Balancing and Adoption. A simulation for different network loads on OMNet++4.1 is issued, and realized this THR routing in Chipcon SmartRF04?EB embedded boards based on Zigbee in a point-to-point topology. According to the simulation results and experiment data, this proposal obviously improved the latency performance, reduced energy overhead and extended the network’s life cycle.
文摘This article proposes the high-speed and high-accuracy code clone detection method based on the combination of tree-based and token-based methods. Existence of duplicated program codes, called code clone, is one of the main factors that reduces the quality and maintainability of software. If one code fragment contains faults (bugs) and they are copied and modified to other locations, it is necessary to correct all of them. But it is not easy to find all code clones in large and complex software. Much research efforts have been done for code clone detection. There are mainly two methods for code clone detection. One is token-based and the other is tree-based method. Token-based method is fast and requires less resources. However it cannot detect all kinds of code clones. Tree-based method can detect all kinds of code clones, but it is slow and requires much computing resources. In this paper combination of these two methods was proposed to improve the efficiency and accuracy of detecting code clones. Firstly some candidates of code clones will be extracted by token-based method that is fast and lightweight. Then selected candidates will be checked more precisely by using tree-based method that can find all kinds of code clones. The prototype system was developed. This system accepts source code and tokenizes it in the first step. Then token-based method is applied to this token sequence to find candidates of code clones. After extracting several candidates, selected source codes will be converted into abstract syntax tree (AST) for applying tree-based method. Some sample source codes were used to evaluate the proposed method. This evaluation proved the improvement of efficiency and precision of code clones detecting.
文摘As forest is of great significance for our whole development and the sustainable plan is so focus on it. It is very urgent for us to have the whole distribution,stock volume and other related information about that. So the forest inventory program is on our schedule. Aiming at dealing with the problem in extraction of dominant tree species,we tested the highly hot method-object-based analysis. Based on the ALOS image data,we combined multi-resolution in e Cognition software and fuzzy classification algorithm. Through analyzing the segmentation results,we basically extract the spruce,the pine,the birch and the oak of the study area. Both the spectral and spatial characteristics were derived from those objects,and with the help of GLCM,we got the differences of each species. We use confusion matrix to do the Classification accuracy assessment compared with the actual ground data and this method showed a comparatively good precision as 87% with the kappa coefficient 0. 837.
文摘With the increasing interest in e-commerce shopping, customer reviews have become one of the most important elements that determine customer satisfaction regarding products. This demonstrates the importance of working with Text Mining. This study is based on The Women’s Clothing E-Commerce Reviews database, which consists of reviews written by real customers. The aim of this paper is to conduct a Text Mining approach on a set of customer reviews. Each review was classified as either a positive or negative review by employing a classification method. Four tree-based methods were applied to solve the classification problem, namely Classification Tree, Random Forest, Gradient Boosting and XGBoost. The dataset was categorized into training and test sets. The results indicate that the Random Forest method displays an overfitting, XGBoost displays an overfitting if the number of trees is too high, Classification Tree is good at detecting negative reviews and bad at detecting positive reviews and the Gradient Boosting shows stable values and quality measures above 77% for the test dataset. A consensus between the applied methods is noted for important classification terms.
文摘This work proposes authentication based on identity as a way to increase the efficiency and security of communications in vehicular ad-hoc networks. When using identity-based cryptography to achieve certificateless authentication, membership revocation is not a trivial problem. Thus, in order to improve the performance of revocation in such networks, the use of a dynamic authenticated data structure based on perfect k-ary hash trees combined with a duplex version of the new standard SHA-3 is here presented. Efficient algorithms in the used revocation trees allow reaching a refresh rate of at most simple updates per inserted node. Consequently, the proposal is especially useful for situations with frequent revocations, which are foreseeable when vehicular ad- hoc networks are widely deployed.
文摘In frequent tree pattern mining, the number of frequent subtrees generated is often too large. To tackle this problem, the concept of condensed frequent subtree base is proposed. The base consists of the maximal frequent subtrees for a series of support thresholds. It is a subset of frequent subtrees, and is used to approximate the support of arbitrary frequent subtrees with guaranteed maximal error bound. In addition, an algorithm is developed to mine such a condensed subtree base in a database of labeled rooted ordered trees. The algorithm adopts the way of fight-most extension to generate systematically all frequent rooted ordered subtrees. Several techniques are proposed to prune the branches that do not correspond to the maximal frequent subtrees. Heuristic techniques are used to arrange the order of computation so that relatively expensive computation is avoided as much as possible. Experimental results show that the size of the base is less than 10% of that of the complete set, and the algorithm outperforms the previous algorithms.
基金Supported by the National Science and Technology Support Program of China(No.2013BAK03B01)
文摘Due to the interrelationship between the base placement of the manipulator and its operation object,it is significant to analyze the accessibility and workspace of manipulators for the optimization of their base location.A new method is presented to optimize the base placement of manipulators through motion planning optimization and location optimization in the feasible area for manipulators.Firstly,research problems and contents are outlined.And then the feasible area for the manipulator base installation is discussed.Next,index depended on the joint movements and used to evaluate the kinematic performance of manipulators is defined.Although the mentioned indices in last section are regarded as the cost function of the latter,rapidly-exploring random tree(RRT) and rapidly-exploring random tree*(RRT*) algorithms are analyzed.And then,the proposed optimization method of manipulator base placement is studied by means of simulation research based on kinematic performance criteria.Finally,the conclusions could be proved effective from the simulation results.
