检索结果-内蒙古大学图书馆

Group decision making based on acceptable consistency analysis of interval linguistic hesitant fuzzy preference relations

引用

INFORMATION SCIENCES 2020年 530卷 66-84页

作者： Meng, Fanyong Chen, Shyi-Ming Zhang, Shaolin Beijing Wuzi Univ Sch Informat Beijing 101149 Peoples R China Natl Taiwan Univ Sci & Technol Dept Comp Sci & Informat Engn Taipei Taiwan Cent South Univ Sch Business Changsha 410083 Peoples R China

To represent decision makers' qualitative uncertainty and hesitation judgments, interval linguistic hesitant fuzzy variables (ILHFVs) are efficient tools, which can be regarded as an expansion of interval linguistic variables (ILVs). Taking the merits of ILHFVs and preference relations, this paper focuses on group decision making (GDM) with interval linguistic hesitant fuzzy preference relations (ILHFPRs). By considering the consistency of ILHFPRs, a new definition of acceptable consistency is presented. Using the acceptable consistency index, some models are built to measure whether a given ILHFPR is acceptable consistent. If the consistency is unacceptable, some models are constructed to derive acceptable consistent ILHFPRs by considering the total adjustment and the number of adjusting ILVs. In order to cope with incomplete ILHFPRs, some models for obtaining the values of unknown ILVs are proposed. For GDM with ILHFPRs, an index for measuring the consensus degree of ILHFPRs is proposed. When ILHFPRs do not meet the requirement of the consensus, some models for enhancing the consensus degree are proposed. According to the analysis of acceptable additive consistency and consensus of ILHFPRs, a new method for GDM with ILHFPRs is proposed. In order to show the merits of the proposed GDM method, an application example is used. (C) 2020 Elsevier Inc. All rights reserved.

关键词： Group decision making Acceptable consistency ILHFPR programming model

来源：评论

学校读者我要写书评

暂无评论

Global optimisation model and algorithm for unit restarting sequence considering black-start zone partitioning

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2019年第13期13卷 2652-2663页

作者： Gu, Xueping Zhou, Guangqi Li, Shaoyan Liu, Tong North China Elect Power Univ Sch Elect & Elect Engn Baoding 071003 Hebei Peoples R China

Unit restarting after a blackout is the basis of the overall restoration process for a power system. A reasonable restarting sequence of units may speed up the restoration process and reduce economic loss. In view of the situation that there are usually several black-start sources in a large-scale power system, a global optimisation method for unit restarting considering black-start zone partitioning is proposed in this study. On the basis of the multiple time-step modelling framework, the optimisation problem is formulated as a mixed integer linear programming model, with the objective functions to maximise the total-weighted MWh output and minimise the links between the subsystems under various operational constraints. The hierarchical method based on generalised Benders decomposition is applied to decompose the optimisation problem into one master problem and two sub-problems: (i) determination of the unit restarting sequence considering only the grouping of units and (ii) rationality check of unit grouping and check of operational constraints based on power flow calculation. The master problem and sub-problems are alternately and iteratively solved until the optimal solution is obtained. The results of New England 10-unit 39-bus system and a practical power system in southwest China verify the validity of the proposed method.

关键词： load flow integer programming power system restoration power grids optimisation power system security linear programming black-start zone partitioning unit restarting restoration process reasonable restarting sequence black-start sources large-scale power system global optimisation method multiple time-step modelling framework optimisation problem programming model total-weighted MWh output operational constraints master problem unit grouping check power flow calculation New England 10-unit 39-bus system practical power system

来源：评论

学校读者我要写书评

暂无评论

Exploiting the priority weights from interval linguistic fuzzy preference relations

引用

SOFT COMPUTING 2019年第2期23卷 583-597页

作者： Meng, Fanyong Tang, Jie Xu, Zeshui Nanjing Audit Univ Sch Int Audit Nanjing 211815 Jiangsu Peoples R China Sichuan Univ Sch Business Chengdu 610064 Sichuan Peoples R China Cent S Univ Sch Business Changsha 410083 Hunan Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp & Software Nanjing 210044 Jiangsu Peoples R China

Interval linguistic fuzzy preference relations (ILFPRs) are powerful tools to denote the decision makers' uncertain qualitative preferences. To avoid the inconsistent ranking results, consistency analysis is very critical. This paper introduces a new additive consistency concept for ILFPRs, which satisfies all properties of the additive consistency concept for fuzzy preference relations. Then, a model to judging the additive consistency of ILFPRs is constructed. When ILFPRs are inconsistent, an approach to deriving additive consistent ILFPRs is presented. Considering the incomplete case, goal programming models to determining the missing values are established. Subsequently, a distance measure-based group consensus index is given to measuring the consensus of individual ILFPRs. Furthermore, a new method for group decision making with ILFPRs is developed, which is based on the additive consistency and consensus analysis. Finally, two numerical examples are offered to show the application of the developed procedure, and a comparison analysis is performed.

关键词： Group decision making Interval linguistic fuzzy preference relation Additive consistency Consensus programming model

来源：评论

学校读者我要写书评

暂无评论

The AXIOM platform for next-generation cyber physical systems

引用

MICROPROCESSORS AND MICROSYSTEMS 2017年 52卷 540-555页

作者： Theodoropoulos, Dimitris Mazumdar, Somnath Ayguade, Eduard Bettin, Nicola Bueno, Javier Ermini, Sara Filgueras, Antonio Jimenez-Gonzalez, Daniel Alvarez Martinez, Carlos Martorell, Xavier Montefoschi, Francesco Oro, David Pnevmatikatos, Dionisis Rizzo, Antonio Gai, Paolo Garzarella, Stefano Morelli, Bruno Pomella, Alberto Giorgi, Roberto Fdn Res & Technol Hellas FORTH Inst Comp Sci Iraklion Greece Univ Siena Dipartimento Ingn Informaz & Sci Matemat Siena Italy BSC Barcelona Spain VIMAR SpA Marostica Marostica Italy Univ Siena Dipartimento Sci Sociali Polit & Cognit Siena Italy Univ Politecn Cataluna Comp Architecture Dept Barcelona Spain Herta Secur Barcelona Barcelona Spain Tech Univ Crete Sch ECE Khania Greece Evidence Srl San Giuliano Terme Italy

Cyber-Physical Systems (CPSs) are widely used in many applications that require interactions between humans and their physical environment. These systems usually integrate a set of hardware-software components for optimal application execution in terms of performance and energy consumption. The AXIOM project (Agile, eXtensible, fast I/O Module), presented in this paper, proposes a hardware-software platform for CPS coupled with an easy parallel programming model and sufficient connectivity so that the performance can scale-up by adding multiple boards. AXIOM supports a task-based programming model based on OmpSs and leverages a high-speed, inexpensive communication interface called AXIOM-Link. The board also tightly couples the CPU with reconfigurable resources to accelerate portions of the applications. As case studies, AXIOM uses smart video surveillance, and smart home living applications. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Cyber-physical systems Distributed shared memory programming model Performance evaluation Reconfigurable Smart video surveillance Smart home living

来源：评论

学校读者我要写书评

暂无评论

Pair programming productivity: Novice-novice vs. expert-expert

引用

INTERNATIONAL JOURNAL OF HUMAN-COMPUTER STUDIES 2006年第9期64卷 915-925页

作者： Lui, Kim Man Chan, Keith C. C. Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China

Agile Software Development methodologies have grown in popularity both among academic researchers and industrial practitioners. Among the various methodologies or practices proposed, pair programming, which is concerned with two programmers collaborating on design, coding and testing, has become a controversial focus of interest. Even though some success stories have been reported with the use of pair-programming in real software development environment, many people remain rather skeptical of the claims on pair-programming productivity. Previous studies in pair programming have only addressed the basic understanding of the productivity of pairs and they have not addressed the variation in productivity between pairs of varying skills and experience, such as between novice-novice and expert-expert. Statistical productivity measurements reported by different researchers also seem to lead to contradictory conclusions. Until now, the literature has not addressed how those results and experiments were related to each other. In this paper, we propose a controlled experiment called repeat-programming which can facilitate the understanding of relationships between human experience and programming productivity. Repeat-programming can be performed when controversial issues in non-traditional programming methodologies and development productivity need to be investigated into. To illustrate how the proposed empirical experiment can put arguable, divisive problems into perspective, we have examined the productivity in pair programming as a case study. With repeat-programming, we are able to (i) better understand why results of previous pair programming control experiments reached different conclusions as to the productivity of pair programming and (ii) most importantly, present a case in which novice-novice pairs against novice solos are much more productive than expert-expert pairs against expert solos. (c) 2006 Elsevier Ltd. All rights reserved.

关键词： programming model pair programming programmer productivity

来源：评论

学校读者我要写书评

暂无评论

Decision making with intuitionistic linguistic preference relations

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2019年第5期26卷 2004-2031页

作者： Meng, Fanyong Tang, Jie An, Qingxian Chen, Xiaohong Cent S Univ Sch Business Changsha 410083 Hunan Peoples R China Collaborat Innovat Ctr Forecast Nanjing 210044 Jiangsu Peoples R China Nanjing Univ Informat Sci & Technol Nanjing 210044 Jiangsu Peoples R China Hunan Univ Commerce Sch Accounting Changsha 410205 Hunan Peoples R China

To address the preferred and nonpreferred degrees of linguistic variables, this paper introduces intuitionistic linguistic preference relations (ILPRs) that apply intuitionistic linguistic variables (ILVs) to denote the decision makers' preferences. To judge the consistency of ILPRs, a consistent concept is introduced, and a consistency index is defined. When ILPRs are unacceptably inconsistent, a method to improve the consistency is introduced. Then, an approach to rank ILVs is introduced. In some situations where ILPRs might be incomplete, the consistency-based linear programming model is constructed to evaluate the missing values. Considering group decision making, a group consensus index is defined, and its several desirable properties are discussed. Meanwhile, an acceptability-based consistency and consensus approach is developed, and the associated example is offered to show the efficiency of the proposed procedure.

关键词： intuitionistic linguistic preference relation consistency index group consensus index aggregation operator programming model

来源：评论

学校读者我要写书评

暂无评论

IOTSim: A simulator for analysing IoT applications

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2017年 72卷 93-107页

作者： Zeng, Xuezhi Garg, Saurabh Kumar Strazdins, Peter Jayaraman, Prem Prakash Georgakopoulos, Dimitrios Ranjan, Rajiv Australian Natl Univ Res Sch Comp Sci Canberra ACT 2914 Australia Univ Tasmania Hobart Tas 7001 Australia RMIT Melbourne Vic Australia Newcastle Univ Newcastle Upon Tyne Tyne & Wear England

A disruptive technology that is influencing not only computing paradigm but every other business is the rise of big data. Internet of Things (loT) applications are considered to be a major source of big data. Such loT applications are in general supported through clouds where data is stored and processed by big data processing systems. In order to improve the efficiency of cloud infrastructure so that they can efficiently support loT big data applications, it is important to understand how these applications and the corresponding big data processing systems will perform in cloud computing environments. However, given the scalability and complex requirements of big data processing system5, an empirical evaluation on actual cloud infrastructure can hinder the development of timely and cost effective loT solutions. Therefore, a simulator supporting MT applications in cloud environment is highly demanded, but such work is still in its infancy. To fill this gap, we have designed and implemented IOTSim which supports and enables simulation of loT big data processing using MapReduce model in cloud computing environment. A real case study validates the efficacy of the simulator. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Internet of things (Iot) Big data Mapreduce Cloud computing programming model modelling and simulation

来源：评论

学校读者我要写书评

暂无评论

Consistency and consensus improvement models driven by a personalized normalization method with probabilistic linguistic preference relations

引用

INFORMATION FUSION 2021年 69卷 156-176页

作者： Tian, Zhang-peng Nie, Ru-xin Wang, Jian-qiang China Univ Min & Technol Sch Econ & Management Xuzhou 221116 Peoples R China Cent South Univ Sch Business Changsha 410083 Peoples R China

Probabilistic linguistic preference relation (PLPR) provides an effective and flexible tool with which preference degrees of decision-makers can be captured when they vacillatingly express linguistic preference values among several linguistic terms. Individual consistency and group consensus are two important research topics of PLPRs in group decision making (GDM). Considering the problems associated with these two topics, this study proposes a novel GDM framework with consistency-driven and consensus-driven optimization models based on a personalized normalization method for managing complete and incomplete PLPRs. First, existing limitations of the traditional normalization method for probabilistic linguistic term sets (PLTSs) managing ignorance information are specifically discussed. Given the potential valuable information hidden in PLTSs, a personalized normalization method is newly proposed through a two-stage decision-making process with a comprehensive fusion mechanism. Then, based on the proposed normalization method for PLTSs, consistency-driven optimization models that aim to minimize the overall adjustment amount of a PLPR are constructed to improve consistency. Moreover, the developed models are extended to improve consistency and estimate the missing values of an incomplete PLPR. Subsequently, a consensus-driven optimization model that aims to maximize group consensus by adjusting experts? weights is constructed to support the consensus-reaching process. Finally, an illustrative example, followed by some comparative analyses is presented to demonstrate the application and advantages of the proposed approach.

关键词： Group decision making Probabilistic linguistic term set programming model Incomplete probabilistic linguistic preference relation

来源：评论

学校读者我要写书评

暂无评论

An Executable Specification of Map-Join-Reduce Using Haskell

引用

IEEE ACCESS 2019年 7卷 10892-10904页

作者： Ren, Junqi Liu, Lei Liu, Feng Zhou, Wenbo Lu, Shuai Jilin Univ Coll Comp Sci & Technol Changchun 130012 Jilin Peoples R China Jilin Univ Minist Educ Key Lab Symbol Computat & Knowledge Engn Changchun 130012 Jilin Peoples R China

The Map-Join-Reduce programming model effectively supports the join operation among different heterogeneous data sets by adding the Join module and processes the multiway joining directly. In this paper, we propose a rigorous description of the Map-Join-Reduce that performs as an executable specification. First, this paper briefly introduces the differences between the Map-Join-Reduce and the MapReduce. Then, we use Haskell to specify each module of the Map-Join-Reduce programming model and analyze the structure and function of each module. Finally, we test the specification by analyzing an example of the mall sales records. The executable specification contributes to helping the developers to unscramble the relationship between the MapReduce and the Map-Join-Reduce, which may serve as a basis for further development of the theory of related programming model design. Furthermore, the most important function of an executable specification is guaranteeing the target informal or semi-formal model with interesting properties. This paper is a forward step to prepare for verifying related properties and, even, providing verified prototypes.

关键词： Cloud computing executable specification programming model

来源：评论

学校读者我要写书评

暂无评论

Two-Sided Stable Matching Decision-Making Method Considering Matching Intention under a Hesitant Fuzzy Environment

引用

Computer modeling in Engineering & Sciences 2023年第5期135卷 1603-1623页

作者： Qi Yue Zhibin Deng School of Management Shanghai University of Engineering ScienceShanghai201620China School of Information Management Jiangxi University of Finance and EconomicsNanchang330013China

In this paper,a stable two-sided matching(TSM)method considering the matching intention of agents under a hesitant fuzzy environment is *** method uses a hesitant fuzzy element(HFE)as its ***,the HFE preference matrix is transformed into the normalized HFE preference *** this basis,the distance and the projection of the normalized HFEs on positive and negative ideal solutions are ***,the normalized HFEs are transformed into agent *** the stable matching constraints,a multiobjective programming model with the objective of maximizing the satisfactions of two-sided agents is *** on the agent satisfaction matrix,the matching intention matrix of two-sided agents is *** to the agent satisfaction matrix and matching intention matrix,the comprehensive satisfaction matrix is set ***,the multiobjective programming model based on satisfactions is transformed into a multiobjective programming model based on comprehensive *** the G-S algorithm,the multiobjective programming model based on comprehensive satisfactions is solved,and then the best TSM scheme is ***,a terminal distribution example is used to verify the feasibility and effectiveness of the proposed method.

关键词： Two-sided matching stable matching hesitant fuzzy element matching intention programming model

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：