4 resultados para fuzzy set

em Universidad de Alicante


Relevância:

70.00% 70.00%

Publicador:

Resumo:

In this paper, we present a generalization of a new systemic approach to abstract fuzzy systems. Using a fuzzy relations structure will retain the information provided by degrees of membership. In addition, to better suit the situation to be modelled, it is advisable to use T-norm or T-conorm distinct from the minimum and maximum, respectively. This gain in generality is due to the completeness of the work on a higher level of abstraction. You cannot always reproduce the results obtained previously, and also sometimes different definitions with different views are obtained. In any case this approach proves to be much more effective when modelling reality.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

This study presents an empirical analysis of the determinants of firm and self-employed survival in the Spanish translation sector. In the midst of a global downturn firm and self-employed survival is a key factor for the progress of the economies and for a better and more stable future. The study presents, first of all, a review of the literature on translation, interpreting, career opportunities, and entrepreneurship, and firm survival. The following empirical analysis explores the combination of variables of human capital, contingency and economic investment that potentially drive translation and interpreting firms or self-employed entrepreneurs to survive. The study performs a comparative qualitative analysis with a fs/QCA methodology identifying nine combination of causes that lead to the outcome. The results contribute towards a better understanding of entrepreneur translators’ lifespan as they provide an empirical outlook on the different causal paths that predict the survival of those translation and interpreting firms or self-employed entrepreneurs. The last part concludes with the most relevant findings of this research study. With little literature on the topic of firm survival in the translation and interpreting sector the paper aims to fill this gap and make a valuable contribution to the current literature on translation-firm creation and firm and self-employed survival.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Hardware/Software partitioning (HSP) is a key task for embedded system co-design. The main goal of this task is to decide which components of an application are to be executed in a general purpose processor (software) and which ones, on a specific hardware, taking into account a set of restrictions expressed by metrics. In last years, several approaches have been proposed for solving the HSP problem, directed by metaheuristic algorithms. However, due to diversity of models and metrics used, the choice of the best suited algorithm is an open problem yet. This article presents the results of applying a fuzzy approach to the HSP problem. This approach is more flexible than many others due to the fact that it is possible to accept quite good solutions or to reject other ones which do not seem good. In this work we compare six metaheuristic algorithms: Random Search, Tabu Search, Simulated Annealing, Hill Climbing, Genetic Algorithm and Evolutionary Strategy. The presented model is aimed to simultaneously minimize the hardware area and the execution time. The obtained results show that Restart Hill Climbing is the best performing algorithm in most cases.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

In t-norm based systems many-valued logic, valuations of propositions form a non-countable set: interval [0,1]. In addition, we are given a set E of truth values p, subject to certain conditions, the valuation v is v=V(p), V reciprocal application of E on [0,1]. The general propositional algebra of t-norm based many-valued logic is then constructed from seven axioms. It contains classical logic (not many-valued) as a special case. It is first applied to the case where E=[0,1] and V is the identity. The result is a t-norm based many-valued logic in which contradiction can have a nonzero degree of truth but cannot be true; for this reason, this logic is called quasi-paraconsistent.