نتایج جستجو برای: lower and upper membership functions

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

Journal: :Artificial Intelligence 2021

Reasoning with probabilistic information has recently attracted considerable attention in argumentation, and formalisms of Probabilistic Abstract Argumentation (PAA), Bipolar (PBA) Structured (PSA) have been proposed. These foundational advances complemented investigations on the complexity some approaches to PAA PBA, but not PSA. We study an existing form PSA, namely Assumption-Based (PABA), a...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه امام رضا علیه السلام - دانشکده ادبیات و زبانهای خارجی 1392

cognitive studies of translation process have recently been awarded a great deal of attention. there exists a psychological angle to almost all translation activities. the present study, thus, deals with analysing the relationships between iranian prospective translators tolerance for ambiguity (ta) and their willingness to translate (wtt). the research was conducted as a mixed methods study, d...

In this paper, a new approach is proposed in order to select an optimal membership function for inputs of wind speed prediction system. Then using a fuzzy method and the stochastic characteristics of wind speed in the previous year, the wind speed modeling is performed and the wind speed for the future year will be predicted. In this proposed method, the average and the standard deviation of in...

2015
Surapati Pramanik

This paper presents fuzzy goal programming approach for solving multilevel programming problems with fuzzy parameters. The proposed approach is based on ? -cut and fuzzy goal programming. In the proposed approach, the tolerance membership functions for the fuzzily described objective functions are defined by determining individual best solution of the objective function of every decision maker....

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2013
Elena Grigorescu Karl Wimmer Ning Xie

We study lower bounds for testing membership in families of linear/affine-invariant Boolean functions over the hypercube. A family of functions P ⊆ {{0, 1} → {0, 1}} is linear/affine invariant if for any f ∈ P , it is the case that f ◦L ∈ P for any linear/affine transformation L of the domain. Motivated by the recent resurgence of attention to the permutation isomorphism problem, we first focus...

In this paper, we propose the spectral collocation method based on radial basis functions to solve the fractional Bagley-Torvik equation under uncertainty, in the fuzzy Caputo's H-differentiability sense with order ($1< nu < 2$). We define the fuzzy Caputo's H-differentiability sense with order $nu$ ($1< nu < 2$), and employ the collocation RBF method for upper and lower approximate solutions. ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه یزد - دانشکده زبانهای خارجی 1391

the speech act of disagreement has been one of the speech acts that has received the least attention in the field of pragmatics. this study investigates the ways power relations, social distance, formality of the context, gender, and language proficiency (for efl learners) influence disagreement and politeness strategies. the participants of the study were 200 male and female native persian s...

Journal: :I. J. Humanoid Robotics 2010
Pramod Kumar P. Prahlad Vadakkepat Ai Poh Loh

A novel algorithm based on fuzzy-rough sets is proposed for the recognition of hand postures and face. Features of the image are extracted using the computational model of the ventral stream of visual cortex. The recognition algorithm translates each quantitative value of the feature into fuzzy sets of linguistic terms using membership functions. The membership functions are formed by the fuzzy...

Saeed Reza Ostadzadeh

In this paper, inference model is proposed so as to analyze nonlinearly loaded dipole antenna. In modeling process, linear and nonlinear behavior of the problem is saved as simple and unchanged membership functions and the effect of incident wave on the induced voltage at different harmonies are then extracted easily. Consequently the model achieved is more efficient than previous studies using...

Journal: :Inf. Process. Lett. 2007
Alexander A. Sherstov

We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m 6 poly(n). Let L̂Td denote the class of functions computable by a depth-d polynomial-size circuit of majority gates. We give a simple proof that POWm 6∈ L̂T2 for any m > 2. Specifically, we prove a 2Ω(n/ logn) lower bound on the size of any depth-2 majority circ...

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

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