Kleitman and Rothschild (Trans. Amer. Math. Soc. 205 (1975), 205-220) gave an asymptotic formula for the number of partial orders with ground-set In]. We give a shorter proof of their result and extend it to count the number of pairs (P, -<), where P is a partial order on [hi and -< is a linear extension of P. This gives us an asymptotic formula for (a) the average number of linear extensions o...

Between May 18 and December 4, 1986, 79 seagoing containers and their contents of 22,051 used tires were inspected for adult mosquitoes as well as eggs and larvae. Of the total inspected, 5,507 tires (25%) contained significant amounts of water. No adults or eggs were found. Fifteen tires contained mosquito larvae that were identified as Ae. albopictus, Ae. togoi, Culex pipiens complex, Tripter...

The availability of a periodic inspection system under mixed maintenance policies is studied in this paper. To accommodate the characteristic multiple failure modes for complex systems, failures can be divided into two modes: hard and soft failure. When occurs, corresponding corrective will performed, taking random time perfect policy; contrast, if found, preventive imperfect policy. dynamic ag...

In this research work we have coated WC (tungsten carbide) tool inserts with diamond like carbon coatings. The deposition was done using the thermal Chemical Vapour Deposition (CVD) method. We used bagasse of sugarcane which is an agriculture waste as a precursor for developing Surface finish, cutting temperature and forces as-developed coatings on were examined analyzed in work. For confirming...

Reachability analysis is a powerful formal method for analysis of concurrent and distributed nite state systems. It suuers from the state space explosion problem, however: the state space of a system can be far too large to be completely generated. This report considers two promising methods, Valmari's stubborn set method and Godefroid's sleep set method, to avoid generating all of the state sp...

The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant. Introduction. The “reduction” algorithm of Gauss plays an important r6le in several areas of computational number theory, principally in matters related to the reduction of integer lattice bases. It is also intimately connected with extensions to complex numbers of the Euclide...