Studies on follicular atresia: role of tropic hormone and steroids in regulating cathepsin-D activity of preantral follicles of the immature rat

The ovary of the immature female rat is comprised of primary and medium-sized preantral follicles. Upon stimulation with FSH or PMSG, the cathepsin-D activity, a representative lysosomal enzyme of granulosa cells, is reduced by 50% (P < 0.01). 17β-Estradiol at the doses tried was unable to mimic this effect. Blockade of steroidogenesis with cyanoketone also had no effect on the cathepsin-D activity of isolated granulosa cells. Dihydrotestosterone (DHT), however, at a dose of 1 mg/rat was able to inhibit PMSG's tropic action. It brought about an increase in cathepsin-D activity and reduction in steroidogenic activity of isolated granulosa cells. The atretogenic activity of DHT could be relieved by supplementation with exogenous FSH. DHT was observed to significantly reduce (P < 0.01) endogenous FSH and LH levels within 12–18 h of its injection suggesting that its atretic effect was due to its action at the pituitary rather than the gonad. In addition to the above the ability of 15 IU of PMSG to reduce cathepsin-D activity of granulosa cells was also significantly reduced (P < 0.01) if endogenous FSH was neutralized by a specific FSH antiserum. The present study suggests that as far as small and medium-sized primary and preantral follicles are concerned, FSH lack is the essential signal for onset of atresia.

Minimization of Incompletely Specified Sequential Machines

A simple yet efficient method for the minimization of incompletely specified sequential machines (ISSMs) is proposed. Precise theorems are developed, as a consequence of which several compatibles can be deleted from consideration at the very first stage in the search for a minimal closed cover. Thus, the computational work is significantly reduced. Initial cardinality of the minimal closed cover is further reduced by a consideration of the maximal compatibles (MC's) only; as a result the method converges to the solution faster than the existing procedures. "Rank" of a compatible is defined. It is shown that ordering the compatibles, in accordance with their rank, reduces the number of comparisons to be made in the search for exclusion of compatibles. The new method is simple, systematic, and programmable. It does not involve any heuristics or intuitive procedures. For small- and medium-sized machines, it canle used for hand computation as well. For one of the illustrative examples used in this paper, 30 out of 40 compatibles can be ignored in accordance with the proposed rules and the remaining 10 compatibles only need be considered for obtaining a minimal solution.