35,854 research outputs found
Optimal measurements to access classical correlations of two-qubit states
We analyze the optimal measurements accessing classical correlations in
arbitrary two-qubit states. Two-qubit states can be transformed into the
canonical forms via local unitary operations. For the canonical forms, we
investigate the probability distribution of the optimal measurements. The
probability distribution of the optimal measurement is found to be centralized
in the vicinity of a specific von Neumann measurement, which we call the
maximal-correlation-direction measurement (MCDM). We prove that for the states
with zero-discord and maximally mixed marginals, the MCDM is the very optimal
measurement. Furthermore, we give an upper bound of quantum discord based on
the MCDM, and investigate its performance for approximating the quantum
discord.Comment: 8 pages, 3 figures, version accepted by Phys. Rev.
Multi crteria decision making and its applications : a literature review
This paper presents current techniques used in Multi Criteria Decision Making (MCDM) and their applications. Two basic approaches for MCDM, namely Artificial Intelligence MCDM (AIMCDM) and Classical MCDM (CMCDM) are discussed and investigated. Recent articles from international journals related to MCDM are collected and analyzed to find which approach is more common than the other in MCDM. Also, which area these techniques are applied to. Those articles are appearing in journals for the year 2008 only. This paper provides evidence that currently, both AIMCDM and CMCDM are equally common in MCDM
A comparative study of multiple-criteria decision-making methods under stochastic inputs
This paper presents an application and extension of multiple-criteria decision-making (MCDM) methods to account for stochastic input variables. More in particular, a comparative study is carried out among well-known and widely-applied methods in MCDM, when applied to the reference problem of the selection of wind turbine support structures for a given deployment location. Along with data from industrial experts, six deterministic MCDM methods are studied, so as to determine the best alternative among the available options, assessed against selected criteria with a view toward assigning confidence levels to each option. Following an overview of the literature around MCDM problems, the best practice implementation of each method is presented aiming to assist stakeholders and decision-makers to support decisions in real-world applications, where many and often conflicting criteria are present within uncertain environments. The outcomes of this research highlight that more sophisticated methods, such as technique for the order of preference by similarity to the ideal solution (TOPSIS) and Preference Ranking Organization method for enrichment evaluation (PROMETHEE), better predict the optimum design alternative
Minimum Manhattan Distance Approach to Multiple Criteria Decision Making in Multiobjective Optimization Problems
A minimum Manhattan distance (MMD) approach to multiple criteria decision
making in multiobjective optimization problems (MOPs) is proposed. The approach
selects the final solution corresponding with a vector that has the MMD from a
normalized ideal vector. This procedure is equivalent to the knee selection
described by a divide and conquer approach that involves iterations of pairwise
comparisons. Being able to systematically assign weighting coefficients to
multiple criteria, the MMD approach is equivalent to a weighted-sum (WS)
approach. Because of the equivalence, the MMD approach possesses rich geometric
interpretations that are considered essential in the field of evolutionary
computation. The MMD approach is elegant because all evaluations can be
performed by efficient matrix calculations without iterations of comparisons.
While the WS approach may encounter an indeterminate situation in which a few
solutions yield almost the same WS, the MMD approach is able to determine the
final solution discriminately. Since existing multiobjective evolutionary
algorithms aim for a posteriori decision making, i.e., determining the final
solution after a set of Pareto optimal solutions is available, the proposed MMD
approach can be combined with them to form a powerful solution method of
solving MOPs. Furthermore, the approach enables scalable definitions of the
knee and knee solutions.Comment: 14 pages, 9 figure
A New Low Complexity Uniform Filter Bank Based on the Improved Coefficient Decimation Method
In this paper, we propose a new uniform filter bank (FB) based on the improved coefficient decimation method (ICDM). In the proposed FB’s design, the ICDM is used to obtain different multi-band frequency responses using a single lowpass prototype filter. The desired subbands are individually obtained from these multi-band frequency responses by using low order frequency response masking filters and their corresponding ICDM output frequency responses. We show that the proposed FB is a very low complexity alternative to the other FBs in literature, especially the widely used discrete Fourier transform based FB (DFTFB) and the CDM based FB (CDFB). The proposed FB can have a higher number of subbands with twice the center frequency resolution when compared with the CDFB and DFTFB. Design example and implementation results show that our FB achieves 86.59% and 58.84% reductions in resource utilizations and 76.95% and 47.09% reductions in power consumptions when compared with the DFTFB and CDFB respectively
- …
