In this paper, we consider the max-cut problem as studied by Goemans and Williamson [8]. Since the problem is NP-hard in general, following Goemans and Williamson, we apply the approximation method based on the semidefinite programming (SDP) relaxation. In fact, the estimated worst-case performance ratio is dependent on the data of the problem with α being a uniform lower bound. In light of thi...

<span lang="EN-US">This study obtained expert consensus on the constructs of personal leadership competencies for Malaysia Matriculation College middle leaders using approach Fuzzy Delphi Method (FDM). A list instruments containing proposed construct and all elements was given to 30 experts from various fields backgrounds. This study's finding indicates that most agree with competencies. ...

In this work we developed the α-cut worthy(Level) Graphs of Homomorphic, Box dot, Star Product Strong Neutrosophic Graphs. To explore some propositions, theorems and Examples.

We present new tools for fuzzy arithmetic with fuzzy numbers, based on the parametric representation of fuzzy numbers and new fuzzy operations, the generalized difference and the generalized division of fuzzy numbers. The new operations are described in terms of the parametric LR and LU representations of fuzzy numbers and the corresponding algorithms are described. An application to the soluti...

The main features of the fuzzy sets and their corresponding membership functions were presented in terms fuzzification process further by de-fuzzification operation. convexity α -(alfa) cuts is used decomposition sets. alfa defined precisely pair lowest upper greatest lower bounds. convex combination intervals sub-regions function considered as points defuzzified values methods to crisp formula...

ABSTRACT We calculate the α-enhancement ratio [α/Fe] for Mapping Nearby Galaxies at APO (MaNGA) Stellar Library (MaStar) while also fitting fundamental atmospheric parameters effective temperature, surface gravity, and metallicity – Teff, log g, [Fe/H]. This approach builds upon a previous catalogue of stellar parameters, whereby only are fit with solar-scaled models. Here, we use same Markov C...

where B = d 4 I− A 2 and Ei is a matrix whose i th diagonal entry is 1 and the others are 0. From now on let’s assume G is d-regular (i.e. each vertex has degree exactly d). Then the adjacency matrix A has at most d non-zero entries, each equal to 1/2, in every row, so ‖A‖ ≤ d/2 and 0 B d 2 I. Note that if α is the optimal value for the SDP we have |E| 2 = nd 4 ≤ α ≤ |E| = nd 2 . The first ineq...

We study the problem of computing approximate minimum edge cuts by distributed algorithms. We present two randomized approximation algorithms that both run in a standard synchronous message passing model where in each round, O(log n) bits can be transmitted over every edge (a.k.a. the CONGEST model). The first algorithm is based on a simple and new approach for analyzing random edge sampling, w...

In this paper we propose a novel technique that addresses image renaissance through a ”multi-level” graph-based matching process. To this end, numerous image patches that do present similarities with the local content around the missing part are considered. The selection of these patches is done through a particle filter method to address the task of hypotheses evaluation. These patches are pos...