A delphi study on health in future India

PIP: A delphi study was conducted to identify or envision health scenarios in India by the year 2000. Questionnaires consisting of 48 questions on 5 areas (diagnosis and therapy; family planning; pharmaceuticals and drugs; biochemical and biomedical research; health services) were mailed to 250 experts in India. 36 responded. Results were compiled and mailed back to the respondents for changes and comments. 17 people responded. Results of the delphi study shows that policy decisions with respect to compulsory family planning as well as health education at secondary school level will precede further breakthroughs in birth control technology. Non operation reversible sterilization procedures, immunological birth control, Ayurvedic medicines for contraception and abortion, and selection of baby's sex are all possible by 2000 thereafter. Complete eradication of infectious diseases, malnutrition and associated diseases is considered unlikely before 2000, as are advances in biomedical research. Changes in health services (e.g., significant increases in hospital beds and doctors, cheap bulk drugs), particularly in rural areas, are imminent, leading to prolonging of life expectancy to 70 years. Genetic engineering may provide significant breakthroughs in the prevention of malignancies and cardiac disorders. The India delphi study is patterned after a similar delphi study conducted in the U.S. by Smith, Kline and French (SKF) Laboratories in 1968. The SKF study was able to predict some breakthroughs with basic research which have been realized.

Effect of rabbit antiserum to ovine LH on reproductive organs in male hamsters and guinea-pigs

Administration of rabbit antiserum to ovine luteinizing hormone to immature hamsters and guinea-pigs resulted in a significant decrease in the weights of testes, seminal vesicle and ventral prostate. The author wishes to thank Prof. N.R. Moudgal for his interest and Family Planning Foundation for financial assistance.

Smooth Path Planning for Passages with Heading and Curvature Discontinuities

The problem of continuous curvature path planning for passages is considered. This problem arises when an autonomous vehicle traverses between prescribed boundaries such as corridors, tunnels, channels, etc. Passage boundaries with curvature and heading discontinuities pose challenges for generating smooth paths passing through them. Continuous curvature half-S shaped paths derived from the Four Parameter Logistic Curve family are proposed as a prospective path planning solution. Analytic conditions are derived for generating continuous curvature paths confined within the passage boundaries. Zero end curvature highlights the scalability of the proposed solution and its compatibility with other path planners in terms of larger path planning domains. Various scenarios with curvature and heading discontinuities are considered presenting viability of the proposed solution.

A queuing approach for inventory planning with batch ordering in multi-echelon supply chains

This paper presents stylized models for conducting performance analysis of the manufacturing supply chain network (SCN) in a stochastic setting for batch ordering. We use queueing models to capture the behavior of SCN. The analysis is clubbed with an inventory optimization model, which can be used for designing inventory policies . In the first case, we model one manufacturer with one warehouse, which supplies to various retailers. We determine the optimal inventory level at the warehouse that minimizes total expected cost of carrying inventory, back order cost associated with serving orders in the backlog queue, and ordering cost. In the second model we impose service level constraint in terms of fill rate (probability an order is filled from stock at warehouse), assuming that customers do not balk from the system. We present several numerical examples to illustrate the model and to illustrate its various features. In the third case, we extend the model to a three-echelon inventory model which explicitly considers the logistics process.

Singularity-free path planning for the Stewart platform manipulator

This paper addresses the problem of singularity-free path planning for the six-degree-of-freedom parallel manipulator known as the Stewart platform manipulator. Unlike serial manipulators, the Stewart platform possesses singular configurations within the workspace where the manipulator is uncontrollable. An algorithm has been developed to construct continuous paths within the workspace of the manipulator by avoiding singularities and ill-conditioning. Given two end-poses of the manipulator, the algorithm finds out safe (well-conditioned) via points and plans a continuous path from the initial pose to the final one. When the two end-poses belong to different branches and no singularity-free path is possible, the algorithm indicates the impossibility of a valid path. A numerical example has also been presented as illustration of the path planning strategy.

A Jacobian-Based Algorithm for Planning Attitude Maneuvers Using Forward and Reverse Rotations

Algorithms for planning quasistatic attitude maneuvers based on the Jacobian of the forward kinematic mapping of fully-reversed (FR) sequences of rotations are proposed in this paper. An FR sequence of rotations is a series of finite rotations that consists of initial rotations about the axes of a body-fixed coordinate frame and subsequent rotations that undo these initial rotations. Unlike the Jacobian of conventional systems such as a robot manipulator, the Jacobian of the system manipulated through FR rotations is a null matrix at the identity, which leads to a total breakdown of the traditional Jacobian formulation. Therefore, the Jacobian algorithm is reformulated and implemented so as to synthesize an FR sequence for a desired rotational displacement. The Jacobian-based algorithm presented in this paper identifies particular six-rotation FR sequences that synthesize desired orientations. We developed the single-step and the multiple-step Jacobian methods to accomplish a given task using six-rotation FR sequences. The single-step Jacobian method identifies a specific FR sequence for a given desired orientation and the multiple-step Jacobian algorithm synthesizes physically feasible FR rotations on an optimal path. A comparison with existing algorithms verifies the fast convergence ability of the Jacobian-based algorithm. Unlike closed-form solutions to the inverse kinematics problem, the Jacobian-based algorithm determines the most efficient FR sequence that yields a desired rotational displacement through a simple and inexpensive numerical calculation. The procedure presented here is useful for those motion planning problems wherein the Jacobian is singular or null.

Superstructures exhibited by oxides of the aurivillius family, (Bi2O2)2+ (Anâ 1BnO3n+1)2â

Bi5Ti3FeO15 and Bi7Ti3Fe3O21 which are n=4 and n=6 members of the family of oxides of the general formula (Bi2O2)2+(An−1BnO3n+1)2− show unusual superstructures, possibly due to cation ordering. Bi5Ti3FeO15; Bi7Ti3Fe3O21; oxides.