A continuous approach to inductive inference

In this paper we describe an interior point mathematical programming approach to inductive inference. We list several versions of this problem and study in detail the formulation based on hidden Boolean logic. We consider the problem of identifying a hidden Boolean function:{0, 1} ⁿ {0, 1} using outputs obtained by applying a limited number of random inputs to the hidden function. Given this input—output sample, we give a method to synthesize a Boolean function that describes the sample. We pose the Boolean Function Synthesis Problem as a particular type of Satisfiability Problem. The Satisfiability Problem is translated into an integer programming feasibility problem, that is solved with an interior point algorithm for integer programming. A similar integer programming implementation has been used in a previous study to solve randomly generated instances of the Satisfiability Problem. In this paper we introduce a new variant of this algorithm, where the Riemannian metric used for defining the search region is dynamically modified. Computational results on 8-, 16- and 32-input, 1-output functions are presented. Our implementation successfully identified the majority of hidden functions in the experiment.     

Concentration dependent Raman and IR study on salicylaldehyde in binary mixtures

A vibrational spectroscopic study of binary mixtures of salicylaldehyde (SA) in three different solvents (polar and nonpolar) is presented. The vibrational modes ν(CO), hydroxyl stretching mode (C OH) and aldehydic (C H) stretching vibration were analyzed. Changes in wavenumber position and full width half maximum have been explained for neat as well as binary mixtures with different volume fractions of the reference system, SA, in terms of inter‐ and intramolecular hydrogen bonding. The IR spectra of these mixtures have also been taken and compared with the Raman data. The spectral changes have been well explained using the concentration fluctuation model and solute–solvent interaction. Copyright © 2007 John Wiley & Sons, Ltd.     

Features of some discrete-time cyclic queueing networks

A class of discrete-time closed cyclic networks is analyzed, where queues at each node have ample waiting room and have independent geometric service times with possibly unequal means. If each node has a single server or if there are sufficiently many parallel servers at each node to accommodate all jobs, equilibrium vectors of product form are obtained. For some other cases, equilibrium vectors of product form need not exist. For the single-server model, a normalization constant is computed and used to determine the queue-length distribution at a node.