نتایج جستجو برای: α cut

تعداد نتایج: 237797  

2004
ISABELLE CATTO

Abstract. We investigate the self-energy of one electron coupled to a quantized radiation field by extending the ideas developed in [H]. We fix an arbitrary cut-off parameter Λ and recover the α-term of the selfenergy, where α is the coupling parameter representing the fine structure constant. Thereby we develop a method which allows to expand the selfenergy up to any power of α. This implies t...

2008
L. N. Granda

We propose an holographic quintessence and tachyon models of dark energy. The correspondence between the quintessence and tachyon energy densities with the holographic density, allows the reconstruction of the potentials and the dynamics for the quintessence and tachyon fields, in flat FRW background. The proposed infrared cut-off for the holographic energy density works for two cases of the co...

2016
A. Venkatesh Senthil Kumar

The theoretical study of the effect of Corticosterone release scores was determined. Formulae of fuzzy two parameter Weibull distribution, fuzzy Survival and fuzzy hazard rate function and its α-cut sets were presented. Using fuzzy survival and hazard rate model based on two parameter Weibull distributions, we showed that in the test termination, if the fuzzy Survival value increases then the f...

Journal: :Allergologia et immunopathologia 2015
A P Castro A C Pastorino A K F Gushken C M Kokron U D Filho C M A Jacob

BACKGROUND Cow's milk allergy diagnosis many times requires double-blind placebo-controlled food challenge (DBPCFC), which presents high accuracy but involves risks, specifically in infants and anaphylactic patients. The identification of the cut-off values for specific IgE to milk or its components would contribute to cow's milk allergy (CMA) diagnosis. The aim of this study was to compare dis...

2012
Juan Carlos Figueroa García

This paper shows a proposal for Type-reduction of an Interval Type-2 fuzzy set composed from α-cuts done over its primary membership functions. The definition of available Type-reduction methods for Interval Type-2 fuzzy sets are based on an homogeneous subdivision of the universe of discourse, so we propose an approximation algorithm for Type-reduction of an Interval type-2 fuzzy set through i...

2001
MONIQUE LAURENT

We study how the lift-and-project method introduced by Lovász and Schrijver [SIAM J. Optim., 1 (1991), pp. 166–190] applies to the cut polytope. We show that the cut polytope of a graph can be found in k iterations if there exist k edges whose contraction produces a graph with no K5-minor. Therefore, for a graph G with n ≥ 4 nodes with stability number α(G), n − 4 iterations suffice instead of ...

2014
Jiuzhen Liang Dejiang Wang

This paper deals with the implementation of Steiner point of fuzzy set. Some definitions and properties of Steiner point are investigated and extended to fuzzy set. This paper focuses on establishing efficient methods to compute Steiner point of fuzzy set. Two strategies of computing Steiner point of fuzzy set are proposed. One is called linear combination of Steiner points computed by a series...

2012
Masoud Moshref Minlan Yu Abhishek B. Sharma Ramesh Govindan

Rnd-4K Rnd-16K Agg-4K Agg-16K o VCRIB is efficient in placing rules using provided resources Larger network capacity Smaller partitions Smaller partitions more flexibility in placement less traffic overhead Aggregatable source IP addresses for VMs on each hypervisor (Agg setting) less traffic overhead o Handling overlapping rules with partitions BSP Tree: • Recursively cut the space and create ...

2013
Kaveh Khalili-Damghani Madjid Tavana

Data envelopment analysis (DEA) is a linear programming method for assessing the efficiency and productivity of organizational units called decisionmaking units (DMUs). We propose a new network DEA (NDEA) model for measuring the performance of agility in supply chains. The uncertainty of the input and output data is modeled with linguistic terms parameterized with fuzzy sets. The proposed fuzzy...

1996
Viggo Kann Sanjeev Khanna Jens Lagergren Alessandro Panconesi

We study the Max k-Cut problem and its dual, the Abstract-1 Min k-Partition problem. In the Min k-Partition problem, given a graph G = (V, E) and positive edge weights, we want to find an edge set of minimum weight whose removal makes G k-colorable. For the Max k-Cut problem we show that, if P 6= NP, no polynomial time approximation algorithm can achieve a relative error better than 1/(34k). It...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید