This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...

Objective: Iterative Decomposition of water and fat with Echo Asymmetry and Least squares estimation (IDEAL) is a chemical shift based fat-water separation method that can be combined with unspoiled Gradient Recalled-echo Acquired in the Steady-State (GRASS) technique to produce high resolution, fat-suppressed images of the knee with bright synovial fluid (1). IDEAL-GRASS has high diagnostic pe...

A novel ranking method based on multi-time information fusion is proposed for intuitionistic fuzzy sets (IFSs) and applied to the threat assessment problem, a multi-attribute decision making (MADM) one. This method integrates a designed intuitionistic fuzzy entropy (IFE), the closeness degree of technique for order preference by similarity to ideal solution (TOPSIS), the decision maker¡¯s (DM¡¯...

This paper evaluates and ranks the temporal dimensions, known as fourth dimension of urban design, of a number of places in a city by TOPSIS method. TOPSIS method is technique for order preference by similarity to ideal solution. TOPSIS is one of the renowned methods for classical multi-criteria decision-making (MCDM) problems that defines the positive ideal solution and negative ideal solution...

Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...

The work described in this paper aims at the definition of a general framework for the formal specification of agents’ beliefs in a multiagent environment. The basic idea is to model both agents’ beliefs and the view that each agent has of other agents’ beliefs as logical theories. Consider an agent as having beliefs only about the world. At a very abstract level, ai’s beliefs can be modeled by...

most of data in multi-attribute decision making (madm) problems are changeable rather than constant and stable. therefore, sensitivity analysis after problem solving can effectively contribute to making accurate decisions. in this paper, we offer a new method for sensitivity analysis in multi-attribute decision making problems in which if the weights of one attribute changes, then we can deter...

Gu map-1 is a modified version of GGH map. It uses same ideal lattices for constructing the trapdoors, while the novelty is that no encodings of zero are given. In this short paper we show that Gu map-1 cannot be used for the instance of witness encryption (WE) based on the hardness of 3-exact cover problem. That is, if Gu map-1 is used for such instance, we can break it by soving a combined 3-...