Search

Copyright of Engineering Science Research & Application is the property of Omniscient Pte. Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Water Conservancy & Electric Power Technology & Application is the property of Omniscient Pte. Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Mechanical & Electronic Control Engineering is the property of Omniscient Pte. Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Engineering Management & Technology Discussion is the property of Omniscient Pte. Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Architectural Design & Research is the property of Omniscient Pte. Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Urban Architecture & Development is the property of Omniscient Pte. Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Urban Architecture & Development is the property of Omniscient Pte. Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In a voting system， each voter makes a preferential list about candidates， thus a large amount of ordered lists are obtained. To get a comprehensive voting result from these lists， an effective lists merging algorithm is required， which can analyze these lists data and output a comprehensive list. A merging algorithm based on credibility is proposed. Through analyzing the data of lists， numerous ranking messages are extracted， then the credibility of them is formulated and measured， with which the final comprehensive list is computed such that those ranking messages with high credibility could play a more influential role in the final ranking result. Experimental results fully indicate that the algorithm proposed can dig out the credibility about ranking information more effectively， thus attaining the merging results more accurately. [ABSTRACT FROM AUTHOR]