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

Consensus building for hesitant fuzzy preference relations with multiplicative consistency

COMPUTERS & INDUSTRIAL ENGINEERING 2019年 128卷 387-400页

作者： Li, Jian Wang, Jian-qiang Hu, Jun-hua Cent S Univ Sch Business Changsha 410083 Hunan Peoples R China Guangxi Univ Sch XingJian Coll Sci & Liberal Arts Nanning 530005 Guangxi Peoples R China

Considering that consensus is an essential part of a group decision-making process, this study focuses on building consensus for hesitant fuzzy preference relations (HFPRs) with multiplicative consistency. To achieve this goal, firstly, a new multiplicative consistency concept for the HFPR is proposed. The main feature of the proposed multiplicative consistency concept is that this concept considers all information provided by decision makers and does not require normalising the HFPR. Secondly, several programming models are constructed to verify the complete multiplicative consistency of the HFPR. If the HFPR fails to demonstrate a complete multiplicative consistency, then a multiplicative consistency index is proposed to measure its consistency degree. Simultaneously, an algorithm is introduced to improve the multiplicative consistency degree. Thirdly, an algorithm is designed to derive priority weight vectors from the HFPR. The proposed algorithm addresses the situation in which the HFPR exhibits not only a complete multiplicative consistency but also an acceptable multiplicative consistency. Fourthly, a consensus measure index based on extraction priority weight vectors is introduced. Concurrently, several programming models are constructed to achieve the expected consensus level. Finally, to illustrate the effectiveness of the proposed method, an example is provided, and comparative studies with several existing methods are presented.

关键词： Group decision-making Consensus Hesitant fuzzy preference relation Multiplicative consistency programming model

来源：评论

学校读者我要写书评

暂无评论

An Approach for Group Decision Making With Interval Fuzzy Preference Relations Based on Additive Consistency and Consensus Analysis

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2017年第8期47卷 2069-2082页

作者： Meng, Fan-Yong An, Qing-Xian Tan, Chun-Qiao Chen, Xiao-Hong Nanjing Audit Univ Sch Int Audit Nanjing 211815 Jiangsu Peoples R China Cent S Univ Sch Business Changsha 410083 Hunan Peoples R China Univ Technol Troyes Ind Syst Optimizat Lab Charles Delaunay Inst UMR CNRS 6281 F-10004 Troyes France Hunan Univ Commerce Sch Accounting Changsha 410205 Hunan Peoples R China

Interval fuzzy preference relations (IFPRs) that can simply denote the lower and upper bounds of decision makers' uncertain judgments are keenly studied by researchers and are widely used in practical decision-making problems. Consistency analysis is vitally important to avoid illogical ranking orders. First, this paper analyzes issues in previous additive consistency concepts for IFPRs. Then, it presents a new additive consistency definition that overcomes issues in previous ones. A linear programming model to judge the additive consistency of IFPRs is constructed, and a method to derive additive consistent IFPRs is proposed. Furthermore, a goal programming model to determine missing values in an incomplete IFPR is built, which have the highest consistent level with respect to known values. Regarding group decision making, a group consensus index is defined to measure the consensus of individual IFPRs, and an approach to improve the consensus level is introduced. Finally, a method for group decision making with IFPRs is developed, which can address incomplete and inconsistent cases. Associated examples are given to show the efficiency and feasibility of the developed theoretical results and comparative analysis is made.

关键词： Additive consistency decision making group consensus interval fuzzy preference relation programming model

来源：评论

学校读者我要写书评

暂无评论

Ranking objects from group decision making with interval-valued hesitant fuzzy preference relations in view of additive consistency and consensus

引用

KNOWLEDGE-BASED SYSTEMS 2018年第Dec.15期162卷 46-61页

作者： Jie Tang Fanyong Meng Cent South Univ Sch Business Changsha 410083 Peoples R China Nanjing Audit Univ Sch Int Audit Nanjing 211815 Jiangsu Peoples R China

This paper focuses on preference relations with interval-valued hesitant fuzzy variables, namely, interval valued hesitant fuzzy preference relations (IVHFPRs). This type of preference relations permits the decision makers to apply several intervals in [0, 1] to denote their uncertain hesitancy preferences, and the numbers of intervals in different interval-valued hesitant fuzzy variables may be different. This endows the decision makers with more flexibility to express their preferences for compared objects. To calculate the priority weight vector from IVHFPRs logically, this paper defines an additive consistency concept for IVHFPRs. Then, 0-1 mixed programming models are constructed to judge the additive consistency of IVHFPRs, and a method for deriving additively consistent IVHFPRs is introduced. Using the additive consistency based probabilistic distribution, two methods for calculating the priority weight vector from additively consistent IVHFPRs are proposed. In virtue of the second method, we further discuss group decision making with IVHFPRs. To do this, a group consensus index is defined, and an approach to increase the consensus level is offered. After that, a group decision-making method with incomplete and inconsistent IVHFPRs is presented. Finally, two practical examples are selected to show the application of the new method, and comparison analysis is also made. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Decision procedure IVHFPR Additive consistency Consensus programming model

来源：评论

学校读者我要写书评

暂无评论

THE SARC ARCHITECTURE

引用

IEEE MICRO 2010年第5期30卷 16-29页

作者： Ramirez, Alex Cabarcas, Felipe Juurlink, Ben Alvarez Mesa, Mauricio Sanchez, Friman Azevedo, Arnaldo Meenderinck, Cor Ciobanu, Catalin Isaza, Sebastian Gaydadjiev, Georgi Barcelona Supercomp Ctr Comp Architecture Grp Barcelona Spain Tech Univ Berlin Fac Elect Engn & Comp Sci D-1000 Berlin Germany Univ Politecn Cataluna Comp Architecture Dept E-08028 Barcelona Spain Delft Univ Technol Comp Engn Lab Fac Elect Engn Math & Comp Sci NL-2600 AA Delft Netherlands Delft Univ Technol Comp Engn Lab Microelectron & Comp Engn Dept NL-2600 AA Delft Netherlands

The sarc architecture is composed of multiple processor types and a set of user-managed Direct Memory Access (DMA) engines that let the runtime scheduler overlap data transfer and computation. The runtime system automatically allocates tasks on the heterogeneous cores and schedules the data transfers through the DMA engines. SARC's programming model supports various highly parallel applications, with matching support from specialized accelerator processors.

关键词： accelerator Decoding heterogeneous architecture multicore Multicore processing Parallel processing programming programming model Runtime System-on-a-chip

来源：评论

学校读者我要写书评

暂无评论

Location and Capacity model of Charging Station for Electric Vehicles Based on Commuting Demand

引用

IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING 2020年第7期15卷 1089-1099页

作者： Luo, Qingyu Tian, Wanli Jia, Hongfei Jilin Univ Sch Transportat Changchun 130022 Peoples R China

For commuters, the workplace is the second most important place to be able to charge electric vehicles after their own residence. In order to satisfy the charging demand near to the workplaces of commuters, a location and capacity model for charging stations is set up with the aim of minimizing the overall cost, composed of the charging station construction cost and the generalized cost of users. The charging demand of commuting electric vehicles is divided into rigid demand and elastic demand, which depends on whether the electric vehicle has enough power to complete the rest of its daily travel requirements. By introducing a user convenience coefficient to quantify the user's charging expectation, the number of electric vehicles to be served and the demand for charging at the stations are obtained. Further, the optimal sites for charging stations and the quantities of different levels of charging facility equipped are determined by the location and capacity model. An example shows that, as the threshold of the convenience coefficient decreases, the demand for electric energy increases gradually, and the construction becomes less economical. Meanwhile, the location of the charging station is insensitive to the change of electric energy demand. The threshold value for the convenience coefficient is put forward for different planning purposes, providing a reference for planning site selection and quantity of chargers under elastic demand. (c) 2020 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

关键词： electric vehicle charging location capacity elastic demand programming model

来源：评论

学校读者我要写书评

暂无评论

SNCL: a supernode OpenCL implementation for hybrid computing arrays

引用

JOURNAL OF SUPERCOMPUTING 2024年第7期80卷 9471-9493页

作者： Tang, Tao Lu, Kai Peng, Lin Cui, Yingbo Fang, Jianbin Huang, Chun Wang, Ruibo Yang, Canqun Guo, Yifei Natl Univ Def Technol Coll Comp Sci & Technol Changsha 410073 Peoples R China

Heterogeneous computing has been developing continuously in the field of high-performance computing because of its high performance and energy efficiency. More and more accelerators have emerged, such as GPU, FPGA, DSP, AI accelerator, and so on. Usually, the accelerator is connected to the host CPU as a peripheral device to form a tightly coupled heterogeneous computing node, and then, a parallel system is constructed by multiple nodes. This organization is computationally efficient, but not flexible. When new accelerators appear, it is difficult to join the system that has been built. At the hardware level, we create an array of accelerators and connect them to the existing system through a high-speed network. At the software level, we dynamically organize computing resources from various arrays to build a virtual heterogeneous computing node. This approach also includes a standard programming environment. Therefore, it is a more flexible, elastic, and scalable heterogeneous computing organization. In this paper, a supernode OpenCL implementation is proposed for hybrid parallel computing systems, in which virtual supernodes can be dynamically constructed between different computing arrays, and a standard OpenCL environment is implemented based on RDMA communication of high-speed interconnection, which can be combined with the system-level MPI programming environment, thereby realizing the large-scale parallel computing of the hybrid array. SNCL is compatible with existing MPI/OpenCL programs without the need for additional modifications. Experiments show that the runtime overhead of the supernode OpenCL environment is very low, and it is suitable for deploying applications with high computing density and large data scale between different arrays to utilize their computing power without affecting scalability.

关键词： OpenCL Supernode High-performance computing programming model

来源：评论

学校读者我要写书评

暂无评论

A Rational approach to model-driven development

引用

IBM SYSTEMS JOURNAL 2006年第3期45卷 463-480页

作者： Brown, A. W. Iyengar, S. Johnston, S. IBM Corp Software Grp Durham NC 27709 USA IBM Corp Software Grp Res Triangle Pk NC 27709 USA

models, modeling, and model transformation form the basis for a set of software development approaches that are known as model-driven development (MDD). models are used in reasoning about a problem domain and the corresponding solution domain for some area of interest. in this paper, we explore model-driven approaches to the realization of solutions for today's enterprise systems. In particular, we describe the key elements of MDD as they have emerged from the support of IBM Rational (R) for model-driven approaches over more than a decade. We discuss the importance of creating model-to-model and model-to-code transformations that guide the development process, and we review the portfolio of IBM Rational tools in the context of their support for modeling and model-driven development.

关键词： .development process use of models MDD programming model IBM Rational Software Group today enterprise model-to-model model-to-code

来源：评论

学校读者我要写书评

暂无评论

A new multiplicative consistency based method for decision making with triangular fuzzy reciprocal preference relations

引用

FUZZY SETS AND SYSTEMS 2017年 315卷 1-25页

作者： Meng, Fanyong Lin, Jian Tan, Chunqiao Zhang, Qiang Nanjing Audit Univ Sch Int Audit Nanjing 211815 Jiangsu Peoples R China Cent S Univ Sch Business 932 South Lushan Rd Changsha 410083 Hunan Peoples R China Fujian Agr & Forestry Univ Coll Comp & Informat Fuzhou 350002 Peoples R China Beijing Inst Technol Sch Management & Econ Beijing 100081 Peoples R China

Triangular fuzzy reciprocal preference relations (TFRPRs) are good choices to denote the decision makers' fuzzy preferences. Consistency analysis is a very important topic to preference relations that can avoid the illogical ranking order. However, all previous multiplicative consistency concepts for TFRPRs cannot well address this type of preference relations. To address this issue, this paper introduces a new multiplicative consistency concept for TFRPRs, which can be seen as a natural extension of Tanino's multiplicative consistency concept for reciprocal preference relations. Based on the new consistency concept, 0-1 mixed' programming models for judging the multiplicative consistency of TFRPRs are constructed, and an approach for deriving multiplicative consistent TFRPRs is provided. Considering the incomplete case, programming models to determine missing values ate constructed. Subsequently, a multiplicative consistency based method for decision making with TFRPRs is presented that can address the inconsistent and incomplete cases. Meanwhile, illustrative examples are provided to show the concrete application of the proposed procedure, and comparison analysis is also made. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Decision analysis TFRPR Quasi TFRPR Consistency analysis programming model

来源：评论

学校读者我要写书评

暂无评论

A high-performance finite-volume algorithm for solving partial differential equations governing compressible viscous flows on structured grids

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 2016年第9期72卷 2098-2118页

作者： Guzik, S. M. Gao, X. Olschanowsky, C. Colorado State Univ Dept Mech Engn Ft Collins CO 80523 USA Colorado State Univ Dept Comp Sci Ft Collins CO 80523 USA

This work focuses on the development of a high-performance fourth-order finite-volume method to solve the nonlinear partial differential equations governing the compressible Navier-Stokes equations on a Cartesian grid with adaptive mesh refinement. The novelty of the present study is to introduce the loop chaining concept to this complex fourth-order fluid dynamics algorithm for significant improvement in code performance on parallel machines. Specific operations involved in the algorithm include the finite-volume formulation of fourth-order spatial discretization stencils and optimal inter-loop parallelization strategies. Numerical fluxes of the Navier-Stokes equations comprise the hyperbolic (inviscid) and elliptic (viscous) components. The hyperbolic flux is evaluated using high-resolution Godunov's method and the elliptic flux is based on fourth-order centered-difference methods everywhere in the computational domain. The use of centered-difference methods everywhere supports the idea of fusing modular codes to achieve high efficiency on modern computers. Temporal discretization is performed using the standard fourth order Runge-Kutta method. The fourth-order accuracy of solution in space and time is verified with a transient Couette flow problem. The algorithm is applied to solve the Sod's shock tube and the transient flat-plate boundary layer flow. The numerical predictions are validated by comparing to the analytical solutions. The performance of the baseline code is compared to that of the fused scheme which fuses modular codes via loop chaining concept and a significant improvement in execution time is observed. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： High-order partial differential equations algorithm High-performance computational fluid dynamics algorithm Fourth-order finite-volume method programming model Loop chaining Parallel adaptive mesh refinement

来源：评论

学校读者我要写书评

暂无评论

HadoopCL2: Motivating the Design of a Distributed, Heterogeneous programming System With Machine-Learning Applications

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2016年第3期27卷 762-775页

作者： Grossman, Max Breternitz, Mauricio Sarkar, Vivek Rice Univ Dept Comp Sci 6100 Main St Houston TX USA AMD Res 7171 Southwest Pkwy Austin TX USA

Machine learning (ML) algorithms have garnered increased interest as they demonstrate improved ability to extract meaningful trends from large, diverse, and noisy data sets. While research is advancing the state-of-the-art in ML algorithms, it is difficult to drastically improve the real-world performance of these algorithms. Porting new and existing algorithms from single-node systems to multi-node clusters, or from architecturally homogeneous systems to heterogeneous systems, is a promising optimization technique. However, performing optimized ports is challenging for domain experts who may lack experience in distributed and heterogeneous software development. This work explores how challenges in ML application development on heterogeneous, distributed systems shaped the development of the HadoopCL2 (HCL2) programming system. ML applications guide this work because they exhibit features that make application development difficult: large & diverse datasets, complex algorithms, and the need for domain-specific knowledge. The goal of this work is a general, MapReduce programming system that outperforms existing programming systems. This work evaluates the performance and portability of HCL2 against five ML applications from the Mahout ML framework on two hardware platforms. HCL2 demonstrates speedups of greater than 20x relative to Mahout for three computationally heavy algorithms and maintains minor performance improvements for two I/O bound algorithms.

关键词： MapReduce heterogeneous distributed programming model GPU auto-scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：