In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...

In cluster analysis context is of major interest to induce an order that allow us to compare the groups generated by cluster analysis itself. Using the sample similarities obtained in this analysis like possibilities in fuzzy sets context provide us to induce a transitivity property in cluster analysis, producing a similarities matrix that meets to the transitivity conditions and that resembles...

It is important to see what kinds of properties of graphs can be transfer to the product of them. Here we will prove that the colour automorphism vertex transitivity can be transfer, and bring a special proof for vertex transitivity property of Cayley graphs of semigroups as well.

Fuzzy implicators are the basic ingredients of many applications. So it becomes essential to study the various features of an implicator before implementing it in any practical application. This paper discusses the properties of transitivity of a fuzzy relation on a given universe and measure of fuzzy transitivity defined in terms of the Reichenbach fuzzy implicator which is an s-implicator.

PURPOSE Deformable image registration (DIR) is necessary for accurate dose accumulation between multiple radiotherapy image sets. DIR algorithms can suffer from inverse and transitivity inconsistencies. When using deformation vector fields (DVFs) that exhibit inverse-inconsistency and are nontransitive, dose accumulation on a given image set via different image pathways will lead to different a...

We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak transitivity. We prove that the criterion is sound and complete. We argue that assuming composition and weak transitivity is not too restrictive.

Section 2. Then we present ProtoNet. ProtoNet is centered around the concept of homology transitivity. ProtoNet clusters protein sequences into a hierarchy based on sequence similarity and homology transitivity. Thus the hierarchy parallels the evolutionary history of these protein sequences. We then illustrate—using Histone proteins—the application of ProtoNet to detect remote protein relatives.

In this paper we propose a reconfiguration model based on switched flat system. The interest to have flat subsystems is to assure the property of transitivity. Transitivity is one the key points of a resilient system keeping the dependability. To reconfigure the system in the case of unexpected phenomena we use default logic.