In phylogenetics there are various methods available for understanding the evolutionary history of a set of species based on the analysis of its 4-element subsets. Guided by biological data, such techniques usually require the initial computation of a quartet-weight function, i.e., a function that assigns a weight to each bipartition of each 4-element subset into two parts of size two, from whi...

The design and verification of an asynchronous communicating system can be very complex. In this paper we focus on weak termination: in each reachable state, the system has the option to eventually terminate. We present a component framework and construction method that guarantees weak termination. In the framework, communication between components is modeled by portnets, a special class of wor...

In the present paper, we prove a fixed point theorem in Fuzzy metric spaces through weak compatibility. Mathematics Subject Classification: 47H10, 54H25

background and objectives: complement proteins are some of the most important plasma proteins of the innate immune system. impaired immune function is reported in subjects who are iron deficient, and there are documents that these patients are prone to infection. this study was conducted to show whether serum c3 and c4 complement change in adult nonpregnant female with iron deficient anemia or ...

We analyse firms’ incentives to provide two-way compatibility between two network goods with different intrinsic qualities. We study how the relative importance of vertical differentiation with respect to the network effect influences the price competition as well as the compatibility choice. The final degree of compatibility allows firms to manipulate the overall differentiation. Under weak ne...

Abstract We consider Galerkin approximations of eigenvalue problems for holomorphic Fredholm operator functions which the operators do not have structure “coercive+compact”. In this case regularity (in vocabulary discrete approximation schemes ) is unconditionally satisfied and question convergence delicate. report a technique to prove applicable wide range problems. The based on knowledge suit...

We define a weak compatibility condition for the Newest Vertex Bisection algorithm on simplex grids of any dimension and show that using this condition the iterative algorithm terminates successfully. Additionally we provide an O(n) algorithm that renumbers any simplex grid to fulfil this condition. Furthermore we conduct experiments to estimate the distance to the standard compatibility and al...

The theory of graphs are very useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we present a frame work to handle m-polar fuzzy information by combining the theory of m-polar fuzzy sets with graphs. We introduce the notion of weak self complement m-polar fuzzy graphs and establish a necessary condition...

We prove common fixed point theorems for four mappings in compact metric spaces satisfying implicit relations using the concept of occasionally weak compatibility which generalize Theorems of [1], [18] and [19]. 2000 Mathematics Subject Classification: 54H25, 47H10.