Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (17)
  • Open Access

    ARTICLE

    An Improved Method Based on TODIM and TOPSIS for Multi-Attribute Decision-Making with Multi-Valued Neutrosophic Sets

    Dongsheng Xu, Lijuan Peng*

    CMES-Computer Modeling in Engineering & Sciences, Vol.129, No.2, pp. 907-926, 2021, DOI:10.32604/cmes.2021.016720

    Abstract Due to the complexity of decision-making problems and the subjectivity of decision-makers in practical application, it is necessary to adopt different forms of information expression according to the actual situation of specific decision-making problems and choose the best method to solve them. Multi-valued neutrosophic set, as an extension of neutrosophic set, can more effectively and accurately describe incomplete, uncertain or inconsistent information. TODIM and TOPSIS methods are two commonly used multi-attribute decision-making methods, each of which has its advantages and disadvantages. This paper proposes a new method based on TODIM and TOPSIS to solve multi-attribute decision-making problems under multi-valued neutrosophic… More >

  • Open Access

    ARTICLE

    Multi-Attribute Selection Procedures Based on Regret and Rejoice for the Decision-Maker

    Hanan Abdullah Mengash*, Manel Farouk Ayadi

    CMC-Computers, Materials & Continua, Vol.70, No.2, pp. 2777-2795, 2022, DOI:10.32604/cmc.2022.015434

    Abstract Feelings influence human beings’ decision-making; therefore, incorporation of feeling factors in decision-making is very important. Regret and rejoice are very important emotional feelings that can have a great impact on decision-making if they are considered together. While regret has received most of the attention in related research, rejoice has been less considered even though it can greatly influence people’s preferences in decision-making. Furthermore, systematically incorporating regret and rejoice in the multi-criteria decision-making (MCDM) modeling frameworks for decision-making has received little research attention. In this paper, we introduce a new multi-attribute selection procedure that incorporates both regret and rejoice to select… More >

  • Open Access

    ARTICLE

    Optimal Sprint Length Determination for Agile-Based Software Development

    Adarsh Anand1, Jasmine Kaur1, Ompal Singh1, Omar H. Alhazmi2,*

    CMC-Computers, Materials & Continua, Vol.68, No.3, pp. 3693-3712, 2021, DOI:10.32604/cmc.2021.017461

    Abstract A carefully planned software development process helps in maintaining the quality of the software. In today’s scenario the primitive software development models have been replaced by the Agile based models like SCRUM, KANBAN, LEAN, etc. Although, every framework has its own boon, the reason for widespread acceptance of the agile-based approach is its evolutionary nature that permits change in the path of software development. The development process occurs in iterative and incremental cycles called sprints. In SCRUM, which is one of the most widely used agile-based software development modeling framework; the sprint length is fixed throughout the process wherein; it… More >

  • Open Access

    ARTICLE

    Dynamic Multi-Attribute Decision-Making Method with Double Reference Points and Its Application

    Haoran Huang1, Qinyong Lin2, Weitong Chen3, Kai Fang4, Huazhou Chen5, Ken Cai2,*

    CMC-Computers, Materials & Continua, Vol.68, No.1, pp. 1303-1320, 2021, DOI:10.32604/cmc.2021.016163

    Abstract To better reflect the psychological behavior characteristics of loss aversion, this paper builds a double reference point decision making method for dynamic multi-attribute decision-making (DMADM) problem, taking bottom-line and target as reference pints. First, the gain/loss function is given, and the state is divided according to the relationship between the gain/loss value and the reference point. Second, the attitude function is constructed based on the results of state division to establish the utility function. Third, the comprehensive utility value is calculated as the basis for alternatives classification and ranking. Finally, the new method is used to evaluate the development level… More >

  • Open Access

    ARTICLE

    The Optimization Reachability Query of Large Scale Multi-Attribute Constraints Directed Graph

    Kehong Zhang, Keqiu Li

    Computer Systems Science and Engineering, Vol.33, No.2, pp. 71-85, 2018, DOI:10.32604/csse.2018.33.071

    Abstract Today, many applications such as social network and biological network develop rapidly,the graph data will be expanded constantly on a large scale. Some classic methods can not effectively solve this scale of the graph data. In the reachability query, many technologies such as N-Hop, tree, interval labels, uncertain graph processing are emerging, they also solve a lot of questions about reachability query of graph. But, these methods have not put forward the effective solution for the new issues of the multiattribute constraints reachability on directed graph. In this paper, TCRQDG algorithm effectively solves this new problem. Firstly it optimizes the… More >

  • Open Access

    ARTICLE

    A Novel Privacy‐Preserving Multi‐Attribute Reverse Auction Scheme with Bidder Anonymity Using Multi‐Server Homomorphic Computation

    Wenbo Shi1, Jiaqi Wang2, Jinxiu Zhu3, YuPeng Wang4, Dongmin Choi5

    Intelligent Automation & Soft Computing, Vol.25, No.1, pp. 171-181, 2019, DOI:10.31209/2018.100000053

    Abstract With the further development of Internet, the decision-making ability of the smart service is getting stronger and stronger, and the electronic auction is paid attention to as one of the ways of decision system. In this paper, a secure multi-attribute reverse auction protocol without the trusted third party is proposed. It uses the Paillier public key cryptosystem with homomorphism and combines with oblivious transfer and anonymization techniques. A single auction server easily collides with a bidder, in order to solve this problem, a single auction server is replaced with multiple auction servers. The proposed scheme uses multiple auction servers to… More >

  • Open Access

    ARTICLE

    Frequent Itemset Mining of User’s Multi-Attribute under Local Differential Privacy

    Haijiang Liu1, Lianwei Cui2, Xuebin Ma1, *, Celimuge Wu3

    CMC-Computers, Materials & Continua, Vol.65, No.1, pp. 369-385, 2020, DOI:10.32604/cmc.2020.010987

    Abstract Frequent itemset mining is an essential problem in data mining and plays a key role in many data mining applications. However, users’ personal privacy will be leaked in the mining process. In recent years, application of local differential privacy protection models to mine frequent itemsets is a relatively reliable and secure protection method. Local differential privacy means that users first perturb the original data and then send these data to the aggregator, preventing the aggregator from revealing the user’s private information. We propose a novel framework that implements frequent itemset mining under local differential privacy and is applicable to user’s… More >

Displaying 11-20 on page 2 of 17. Per Page