the fishes of capoeta genus are living in different fauna regions of iranian freshwater fishes. the parasitological studies of these fishes are important on subjects of ecology and life cycles in different fishes. the aim of this study was to study the parasites of capoeta spp. in halil-rud river, kerman province. samples were collected from the freshwater fishes (between oct. 2007 to sep. 2008...

In a parasitic survey of the native and introduced fishes in the Zayandehrud River, 5 Myxobolus spp. were found in the gills, fins and skin of examined fish specimens. They include M. varicorhini from fin and M. samgoricus from skin of Capoeta damascina, M. musajevi from gills of Capoeta capoeta gracilis, Myxobolus cristatus from Capoeta aculeata, and M. saidovi from Alburnus sp. Data on the lo...

In a parasitic survey of the native and introduced fishes in the Zayandehrud River, 5 Myxobolus spp. were found in the gills, fins and skin of examined fish specimens. They include M. varicorhini from fin and M. samgoricus from skin of Capoeta damascina, M. musajevi from gills of Capoeta capoeta gracilis, Myxobolus cristatus from Capoeta aculeata, and M. saidovi from Alburnus sp. Data on the lo...

In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...

The object of the investigation is to study reducible $M$-ideals in Banach spaces. It is shown that if the number of $M$-ideals in a Banach space $X$ is $n(<infty)$, then the number of reducible $M$-ideals does not exceed of $frac{(n-2)(n-3)}{2}$. Moreover, given a compact metric space $X$, we obtain a general form of a reducible $M$-ideal in the space $C(X)$ of continuous functions on $X$. The...

Given a model M and a temporal logic formula φ[?], where ? is a placeholder, the query checking problem, as defined for the case of CTL by Chan in 2000, is to find the strongest propositional formula f such that M |= φ[? ← f ]. The motivation for solving this problem is, among other things, to get insight on the model. We consider various objectives to the LTL query-checking problem, and study ...

Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...