This study investigates how the concept of semantic relations is used in Translation Studies (TS) to solve problem non-equivalence. It specifically examines ‘superordrinates’ are translation process overcome lack hyponyms Target Text (TT). The attempts answer following questions: do contribute solving non-equivalence? And strategy ‘translating by using superordinate’ utilized Arabic subtitles? ...

in this paper, we study an equivalence relation on the set of fuzzysubgroups of an arbitrary group g and give four equivalent conditions each ofwhich characterizes this relation. we demonstrate that with this equivalencerelation each equivalence class constitutes a lattice under the ordering of fuzzy setinclusion. moreover, we study the behavior of these equivalence classes under theaction of a...

We present a uniform approach for proving the polynomial time decidability of various simulation and equivalence relations for nite state processes. Our approach applies directly to a number of simulation relations and equivalences considered in the literature including strong bisimulation Par81, Mil80, KS90], simulation equivalence vG90, HT94], ready-simulation equivalence vG90, HT94], complet...

1. Overview This paper talks about that monotone circuit is P-Complete. Decision problem that include P-Complete is mapping that classify input with a similar property. Therefore equivalence relation of input value is important for computation. But monotone circuit cannot compute the equivalence relation of the value because monotone circuit can compute only monotone function. Therefore, I make...

We propose a general method for finding pointwise correspondence between 2-D shapes based on the concept of order structure and using geometric hashing. The problem of finding correspondence and the problem of establishing shape equivalence can be considered as one and the same problem. Given shape equivalence, we can in general find pointwise correspondence and the existence of a unambiguous c...

The primary goal of this thesis is to lay the theoretical foundations for a formal study of aggregate query optimization. This requires gaining a coherent understanding of equivalences and containments between aggregate queries of varied forms. A secondary goal of this thesis is to solve the view usability problem for varied types of aggregate queries. The view usability problem is that of dete...

In this paper, we introduce and study a generalized Yosida approximation operator associated to H(·, ·)-co-accretive operator and discuss some of its properties. Using the concept of graph convergence and resolvent operator, we establish the convergence for generalized Yosida approximation operator. Also, we show an equivalence between graph convergence for H(·, ·)-co-accretive operator and gen...