We present new θ(n) time algorithms for testing pattern involvement for all length 4 permutations. For most of these permutations the previous best algorithms require O(n log n) time.
In a complete directed weighted graph there are jobs located at nodes of the graph. Job i has an associated processing time or handling time h i , and the job must start within a prespecified time window r i ; d i. A vehicle can move on the arcs of the graph, at unit speed, and that has to execute the jobs within their respective time windows. We consider… (More)
An attempt is made to find out possible correlations amongst hand length, hand breadth (stretched) and sole length and to derive a regression formula to estimate stature from them. The study was based on the measurement of 100 Nigerian adult male medical students of the Jos Medical School, Nigeria, between the ages of 20-30 years. The results show that… (More)