We have presented trapezoidal intuitionistic fuzzy number. Arithmetic operations of trapezoidal intuitionistic fuzzy number is presented based on (α, β)-cuts. We have presented intuitionistic fuzzy fault tree analysis using trapezoidal intuitionistic fuzzy number. In application of intuitionistic fuzzy fault tree analysis, we have computed failure of fire protection system taking failure of eac...

In this study a new approach to rank exponential fuzzy numbers using  -cuts is established. The metric distance of the interval numbers is extended to exponential fuzzy numbers. By using the ranking of exponential fuzzy numbers and using  -cuts the critical path of a project network is solved and illustrated by numerical examples. Keywords: Exponential Fuzzy Numbers,  -cuts, Metric Dista...

We study a model for the gel degradation by an enzyme, where the gel is schematized as a cubic lattice, and the enzyme as a random walker, that cuts the bonds over which it passes. The model undergoes a (reverse) percolation transition, which for low density of enzymes falls in a universality class different from random percolation. In particular we have measured a gel fraction critical exponen...

We prove confluence of two cut-elimination procedures for the implicational fragment of a standard intuitionistic sequent calculus. One of the cut-elimination procedures uses global proof transformations while the other consists of local ones. Both of them include permutation of cuts to simulate β-reduction in an isomorphic image of the λ-calculus. We establish the confluence properties through...

By exploiting the full process pp̄ → tb̄H, in place of the standard Monte Carlo procedure of factorising production and decay, pp̄ → tt̄ followed by t̄ → b̄H, we show how to improve the discovery reach of the Tevatron (Run 2) in charged Higgs boson searches, in the large tan β region. This is achieved in conjunction with dedicated cuts on a ‘transverse mass’ distribution sensitive to the Higgs boson ...

The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequalities as well as cutting planes of Gomory’s type. The practice of looking for and using cuts that match prescribed templates in conjunction with Gomory cuts was continued in computer codes of Miliotis, Land, and Fleischmann. Gr...