The shortest path problem has been one of the most fundamental practical problems in network analysis.One of the good algorithms is Bellman-Ford,which has been applied in network,for the last some years.Due to complex...The shortest path problem has been one of the most fundamental practical problems in network analysis.One of the good algorithms is Bellman-Ford,which has been applied in network,for the last some years.Due to complexity in the decision-making process,the decision makers face complications to express their view and judgment with an exact number for single valued membership degrees under neutrosophic environment.Though the interval number is a special situation of the neutrosophic,it did not solve the shortest path problems in an absolute manner.Hence,in this work,the authors have introduced the score function and accuracy function of trapezoidal interval valued neutrosophic numbers with their illustrative properties.These properties provide important theoretical base of the trapezoidal interval valued neutrosophic number.Also,they proposed an intelligent algorithm called trapezoidal interval valued neutrosophic version of Bellman’s algorithm to solve neutrosophic shortest path problem in network analysis.Further,comparative analysis has been made with the existing algorithm.展开更多
Since the publication of the indexation documents and queries are represented by keywords from their content. The use of words to represent the document content and query generates several problems, the ambiguity of w...Since the publication of the indexation documents and queries are represented by keywords from their content. The use of words to represent the document content and query generates several problems, the ambiguity of words and their disparity. The semantic indexing is as a solution that answers these problems. The goal context where the ambiguity is present, the semantic indexing is meant is to index by the meaning of words rather than words. In a to improve the performance of IRS （Information Retrieval System）. In this sense we will soon overcome the problems of traditional indexing approaches. What we propose is a new approach that will allow semantically indexing algorithms courses written in French language, based on a new application ontology. The aim of our approach is to adjust a semantic annotation tool with the reference ontology. The semantic annotation tool we generate an index that will be used in e-Learning as needed （question answering performance on the field. systems, information retrieval systems ） while improving展开更多
文摘The shortest path problem has been one of the most fundamental practical problems in network analysis.One of the good algorithms is Bellman-Ford,which has been applied in network,for the last some years.Due to complexity in the decision-making process,the decision makers face complications to express their view and judgment with an exact number for single valued membership degrees under neutrosophic environment.Though the interval number is a special situation of the neutrosophic,it did not solve the shortest path problems in an absolute manner.Hence,in this work,the authors have introduced the score function and accuracy function of trapezoidal interval valued neutrosophic numbers with their illustrative properties.These properties provide important theoretical base of the trapezoidal interval valued neutrosophic number.Also,they proposed an intelligent algorithm called trapezoidal interval valued neutrosophic version of Bellman’s algorithm to solve neutrosophic shortest path problem in network analysis.Further,comparative analysis has been made with the existing algorithm.
文摘Since the publication of the indexation documents and queries are represented by keywords from their content. The use of words to represent the document content and query generates several problems, the ambiguity of words and their disparity. The semantic indexing is as a solution that answers these problems. The goal context where the ambiguity is present, the semantic indexing is meant is to index by the meaning of words rather than words. In a to improve the performance of IRS （Information Retrieval System）. In this sense we will soon overcome the problems of traditional indexing approaches. What we propose is a new approach that will allow semantically indexing algorithms courses written in French language, based on a new application ontology. The aim of our approach is to adjust a semantic annotation tool with the reference ontology. The semantic annotation tool we generate an index that will be used in e-Learning as needed （question answering performance on the field. systems, information retrieval systems ） while improving
