Examining random number generators used in stochastic iteration algorithms

This paper investigates random number generators in stochastic iteration algorithms that require infinite uniform sequences. We take a simple model of the general transport equation and solve it with the application of a linear congruential generator, the Mersenne twister, the mother-of-all generators, and a true random number generator based on quantum effects. With this simple model we show that for reasonably contractive operators the theoretically not infinite-uniform sequences perform also well. Finally, we demonstrate the power of stochastic iteration for the solution of the light transport problem.

A matrix iteration for dynamic network summaries

We propose a new algorithm for summarizing properties of large-scale time-evolving networks. This type of data, recording connections that come and go over time, is being generated in many modern applications, including telecommunications and on-line human social behavior. The algorithm computes a dynamic measure of how well pairs of nodes can communicate by taking account of routes through the network that respect the arrow of time. We take the conventional approach of downweighting for length (messages become corrupted as they are passed along) and add the novel feature of downweighting for age (messages go out of date). This allows us to generalize widely used Katz-style centrality measures that have proved popular in network science to the case of dynamic networks sampled at non-uniform points in time. We illustrate the new approach on synthetic and real data.

Dynamic load balancing in parallel KD-tree k-means

One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting geometrical constraints and an efficient data structure, notably a multidimensional binary search tree (KD-Tree). These techniques allow to reduce the number of distance computations the algorithm performs at each iteration. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient k-Means variants in parallel computing environments. In this work, we provide a parallel formulation of the KD-Tree based k-Means algorithm for distributed memory systems and address its load balancing issue. Three solutions have been developed and tested. Two approaches are based on a static partitioning of the data set and a third solution incorporates a dynamic load balancing policy.

Nutrition of chicks and layers

When formulating least-cost poultry diets, ME concentration should be optimised by an iterative procedure, not entered as a fixed value. This iteration must calculate profit margins by taking into account the way in which feed intake and saleable outputs vary with ME concentration. In the case of broilers, adjustment of critical amino acid contents in direct proportion to ME concentration does not result in birds of equal fatness. To avoid an increase in fat deposition at higher energy levels, it is proposed that amino acid specifications should be adjusted in proportion to changes in the net energy supplied by the feed. A model is available which will both interpret responses to amino acids in laying trials and give economically optimal estimates of amino acid inputs for practical feed formulation. Flocks coming into lay and flocks nearing the end of the pullet year have bimodal distributions of rates of lay, with the result that calculations of requirement based on mean output will underestimate the optimal amino acid input for the flock. Chick diets containing surplus protein can lead to impaired utilisation of the first-limiting amino acid. This difficulty can be avoided by stating amino acid requirements as a proportion of the protein.

Design and formative evaluation of an information kiosk on cattle health for landless cattle owners

This paper describes and analyses the experience of designing, installing and evaluating a farmer-usable touch screen information kiosk on cattle health in a veterinary institution in Pondicherry. The contents of the kiosk were prepared based on identified demands for information on cattle health, arrived at through various stakeholders meetings. Information on these cattle diseases and conditions affecting the livelihoods of the poor was provided through graphics, text and audio back-up, keeping in mind the needs of landless and illiterate poor cattle owners. A methodology for kiosk evaluation based on the feedback obtained from kiosk facilitator, critical group reflection and individual users was formulated. The formative evaluation reveals the potential strength this ICT has in transferring information to the cattle owners in a service delivery centre. Such information is vital in preventing diseases and helps cattle owners to present and treat their animals at an early stage of disease condition. This in turn helps prevent direct and indirect losses to the cattle owners. The study reveals how an information kiosk installed at a government institution as a freely accessible source of information to all farmers irrespective of their class and caste can help in transfer of information among poor cattle owners, provided periodic updating, interactivity and communication variability are taken care of. Being in the veterinary centre, the kiosk helps stimulate dialogue, and facilitates demand of services based on the information provided by the kiosk screens.

Gas phase kinetic and quantum chemical studies of the reactions of silylene with the methylsilanes. Absolute rate constants, temperature dependences, RRKM modelling and potential energy surfaces

Time resolved studies of silylene, SiH2, generated by the 193 nm laser. ash photolysis of phenylsilane, have been carried out to obtain rate coefficients for its bimolecular reactions with methyl-, dimethyl- and trimethyl-silanes in the gas phase. The reactions were studied over the pressure range 3 - 100 Torr with SF6 as bath gas and at five temperatures in the range 300 - 625 K. Only slight pressure dependences were found for SiH2 + MeSiH3 ( 485 and 602 K) and for SiH2 + Me2SiH2 ( 600 K). The high pressure rate constants gave the following Arrhenius parameters: [GRAPHICS] These are consistent with fast, near to collision-controlled, association processes. RRKM modelling calculations are consistent with the observed pressure dependences ( and also the lack of them for SiH2 + Me3SiH). Ab initio calculations at both second order perturbation theory (MP2) and coupled cluster (CCSD(T)) levels, showed the presence of weakly-bound complexes along the reaction pathways. In the case of SiH2 + MeSiH3 two complexes, with different geometries, were obtained consistent with earlier studies of SiH2 + SiH4. These complexes were stabilised by methyl substitution in the substrate silane, but all had exceedingly low barriers to rearrangement to product disilanes. Although methyl groups in the substrate silane enhance the intrinsic SiH2 insertion rates, it is doubtful whether the intermediate complexes have a significant effect on the kinetics. A further calculation on the reaction MeSiH + SiH4 shows that the methyl substitution in the silylene should have a much more significant kinetic effect ( as observed in other studies).

Stereoselective entry to beta-linked C-disaccharides using a carbon-Ferrier reaction

[GRAPHICS] The synthesis of unsaturated beta-linked C-disaccharides by the Lewis acid-mediated reaction of 3-O-acetylated glycals with monosaccharide-derived alkenes is described. Deprotection and selective hydrogenation of an exocyclic carbon-carbon double, in the presence of an endocyclic double bond, for representative targets is also illustrated.

Kinetics of high pressure facilitated starch gelatinisation in Thai glutinous rice

The combined effect of pressure and temperature on the rate of gelatinisation of starch present in Thai glutinous rice was investigated. Pressure was found to initiate gelatinisation when its value exceeded 200 MPa at ambient temperature. On the other hand, complete gelatinisation was observed at 500 and 600 MPa at 70 degrees C, when the rice was soaked in water under these conditions for 120 min. A first-order kinetic model describing the rate of gelatinisation was developed to estimate the values of the rate constants as a function of pressure and temperature in the range: 0.1-600 MPa and 20-70 degrees C. The model, based on the well-known Arrhenius and Eyring equations, assumed the form [GRAPHICS] The constants k(0), E-a, and Delta V were found to take values: 31.19 s(-1), 37.89 kJ mol(-1) and -9.98 cm(3) mol(-1), respectively. It was further noted that the extent of gelatinisation occurring at any time, temperature and pressure, could be exclusively correlated with the grain moisture content. (c) 2006 Elsevier Ltd. All rights reserved.

An automated calibration method for non-see-through head mounted displays

Accurate calibration of a head mounted display (HMD) is essential both for research on the visual system and for realistic interaction with virtual objects. Yet, existing calibration methods are time consuming and depend on human judgements, making them error prone. The methods are also limited to optical see-through HMDs. Building on our existing HMD calibration method [1], we show here how it is possible to calibrate a non-see-through HMD. A camera is placed inside an HMD displaying an image of a regular grid, which is captured by the camera. The HMD is then removed and the camera, which remains fixed in position, is used to capture images of a tracked calibration object in various positions. The locations of image features on the calibration object are then re-expressed in relation to the HMD grid. This allows established camera calibration techniques to be used to recover estimates of the display’s intrinsic parameters (width, height, focal length) and extrinsic parameters (optic centre and orientation of the principal ray). We calibrated a HMD in this manner in both see-through and in non-see-through modes and report the magnitude of the errors between real image features and reprojected features. Our calibration method produces low reprojection errors and involves no error-prone human measurements.

Finding the smallest eigenvalue by the inverse Monte Carlo method with refinement

Finding the smallest eigenvalue of a given square matrix A of order n is computationally very intensive problem. The most popular method for this problem is the Inverse Power Method which uses LU-decomposition and forward and backward solving of the factored system at every iteration step. An alternative to this method is the Resolvent Monte Carlo method which uses representation of the resolvent matrix [I -qA](-m) as a series and then performs Monte Carlo iterations (random walks) on the elements of the matrix. This leads to great savings in computations, but the method has many restrictions and a very slow convergence. In this paper we propose a method that includes fast Monte Carlo procedure for finding the inverse matrix, refinement procedure to improve approximation of the inverse if necessary, and Monte Carlo power iterations to compute the smallest eigenvalue. We provide not only theoretical estimations about accuracy and convergence but also results from numerical tests performed on a number of test matrices.

Fractal quantization

A Fractal Quantizer is proposed that replaces the expensive division operation for the computation of scalar quantization by more modest and available multiplication, addition and shift operations. Although the proposed method is iterative in nature, simulations prove a virtually undetectable distortion to the naked eve for JPEG compressed images using a single iteration. The method requires a change to the usual tables used in JPEG algorithins but of similar size. For practical purposes, performing quantization is reduced to a multiplication plus addition operation easily programmed in either low-end embedded processors and suitable for efficient and very high speed implementation in ASIC or FPGA hardware. FPGA hardware implementation shows up to x15 area-time savingscompared to standars solutions for devices with dedicated multipliers. The method can be also immediately extended to perform adaptive quantization(1).