Probability matching priors for predicting a dependent variable with application to regression models

In a Bayesian setup, we consider the problem of predicting a dependent variable given an independent variable and past observations on the two variables. An asymptotic formula for the relevant posterior predictive density is worked out. Considering posterior quantiles and highest predictive density regions, we then characterize priors that ensure approximate frequentist validity of Bayesian prediction in the above setting. Application to regression models is also discussed.     

Catalysis of Ethanol Decomposition over Rare Earth Oxide Supported Vanadia

Supported vanadia systems synthesized by the excess solvent technique were characterized by different analytical methods. The selective oxidation activity of the system was examined towards the decomposition of ethanol.     

Working group report: High energy and collider physics

This is a summary of the projects undertaken by the working group I on high energy and collider physics.     

Flow and heat transfer due to impulsive motion of a cone in a viscous fluid

Numerical solution has been obtained for the development of the flow over a cone which is impulsively set into motion. Initially the flow is described by the solution of Rayleigh and then it tends to the ultimate steady state solution of Falkner-Skan equation. But due to the leading edge effect the semi-similar equation describing the transient flow changes its character after certain time and the solution depends also on the ultimate steady state solution of the Falkner-Skan equation. A second-order upwind difference scheme has been used for discretisation. The temperature distribution and heat transfer has also been obtained for constant wall temperature as well as for constant heat flux at the wall. With the increase ofm, Falkner-Skan parameter, the magnitude of skin friction and wall heat transfer increases. It has been found that form≥?0.275 flow separation does not occur.     

Effect of different size and orientation of rectangular rotary blades on quality of puddling

The effect of different combinations of size and orientation of rectangular blades of a wet land puddler, on puddling index, force requirement and performance index was investigated under controlled conditions in a soil-bin from the study. It was observed with the blade size of 15-cm width × 8.5-cm depth and a blade angle of 30° with respect to shaft gave better performance than other combinations in terms of minimum puddling index, minimum horizontal force, vertical force, specific energy and maximum performance index. The values are, respectively, 67.95%, 105.12 N, 33.85 N, and 9.71 kJ/m³ and 6.69. The above-mentioned parameters of the blade were found to be very close to the predicted values obtain through MREG computer programme for optimization of size and orientation of puddler blades.     

<Emphasis Type="Italic">Graph_sampler</Emphasis>: a simple tool for fully Bayesian analyses of DAG-models

Bayesian networks (BNs) are widely used graphical models usable to draw statistical inference about directed acyclic graphs. We presented here Graph_sampler a fast free C language software for structural inference on BNs. Graph_sampler uses a fully Bayesian approach in which the marginal likelihood of the data and prior information about the network structure are considered. This new software can handle both the continuous as well as discrete data and based on the data type two different models are formulated. The software also provides a wide variety of structure prior which can depict either the global or local properties of the graph structure. Now based on the type of structure prior selected, we considered a wide range of possible values for the prior making it either informative or uninformative. We proposed a new and much faster jumping kernel strategy in the Metropolis–Hastings algorithm. The source C code distributed is very compact, fast, uses low memory and disk storage. We performed out several analyses based on different simulated data sets and synthetic as well as real networks to discuss the performance of Graph_sampler.     

Method for construction of characteristic polynomials via graph linearization

A new method for construction of characteristic polynomials (CP) of complicated graphs having arbitrary edge and vertex weights has been developed. The method first converts the graph into isospectral linear chains with weighted vertices and edges and then builds up the CP coefficients recursively. Two types of graphs have been used for illustration, viz., (i) graphs that can be linearized by symmetry factorization and (ii) graphs without symmetry which are to be linearized by an algorithm involving walks of unit length. Both types have been illustrated, of which type (i) includes the Schlegel of fullerene fragment C₂₀ and another large graph with many fused rings. © 1997 John Wiley & Sons, Inc. Int J Quant Chem 65 : 199–204, 1997