Advances in Learning Bayesian Networks of Bounded Treewidth

This work presents novel algorithms for learning Bayesian networks of bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed integer linear programming formulations for structure learning and treewidth computation. The approximate method consists in sampling k-trees (maximal graphs of treewidth k), and subsequently selecting, exactly or approximately, the best structure whose moral graph is a subgraph of that k-tree. The approaches are empirically compared to each other and to state-of-the-art methods on a collection of public data sets with up to 100 variables.

A multiconfigurational time-dependent Hartree-Fock method for excited electronic states. I. General formalism and application to open-shell states

The solution of the time-dependent Schrodinger equation for systems of interacting electrons is generally a prohibitive task, for which approximate methods are necessary. Popular approaches, such as the time-dependent Hartree-Fock (TDHF) approximation and time-dependent density functional theory (TDDFT), are essentially single-configurational schemes. TDHF is by construction incapable of fully accounting for the excited character of the electronic states involved in many physical processes of interest; TDDFT, although exact in principle, is limited by the currently available exchange-correlation functionals. On the other hand, multiconfigurational methods, such as the multiconfigurational time-dependent Hartree-Fock (MCTDHF) approach, provide an accurate description of the excited states and can be systematically improved. However, the computational cost becomes prohibitive as the number of degrees of freedom increases, and thus, at present, the MCTDHF method is only practical for few-electron systems. In this work, we propose an alternative approach which effectively establishes a compromise between efficiency and accuracy, by retaining the smallest possible number of configurations that catches the essential features of the electronic wavefunction. Based on a time-dependent variational principle, we derive the MCTDHF working equation for a multiconfigurational expansion with fixed coefficients and specialise to the case of general open-shell states, which are relevant for many physical processes of interest. (C) 2011 American Institute of Physics. [doi: 10.1063/1.3600397]

Parameter studies of fibre laser micro-welding of AISI 316L using Taguchi method

This paper discusses the application of the Taguchi experimental design approach in optimizing the key process parameters for micro-welding of thin AISI 316L foil using the 100W CW fibre laser. A L16 Taguchi experiment was conducted to systematically understand how the power, scanning velocity, focus position, gas flow rate and type of shielding gas affect the bead dimensions. The welds produced in the L16 Taguchi experiment was mainly of austenite cellular-dendrite structure with an average grain size of 5µm. An exact penetration weld with the largest penetration to fusion width ratio was obtained. Among those process parameters, the interaction between power and scanning velocity presented the strongest effect to the penetration to fusion width ratio and the power was found to be the predominantly important factor that drives the interaction with other factors to appreciably affect the bead dimensions.

Exact and heuristic methods for solving Boolean games

Boolean games are a framework for reasoning about the rational behavior of agents whose goals are formalized using propositional formulas. Compared to normal form games, a well-studied and related game framework, Boolean games allow for an intuitive and more compact representation of the agents’ goals. So far, Boolean games have been mainly studied in the literature from the Knowledge Representation perspective, and less attention has been paid on the algorithmic issues underlying the computation of solution concepts. Although some suggestions for solving specific classes of Boolean games have been made in the literature, there is currently no work available on the practical performance. In this paper, we propose the first technique to solve general Boolean games that does not require an exponential translation to normal-form games. Our method is based on disjunctive answer set programming and computes solutions (equilibria) of arbitrary Boolean games. It can be applied to a wide variety of solution concepts, and can naturally deal with extensions of Boolean games such as constraints and costs. We present detailed experimental results in which we compare the proposed method against a number of existing methods for solving specific classes of Boolean games, as well as adaptations of methods that were initially designed for normal-form games. We found that the heuristic methods that do not require all payoff matrix entries performed well for smaller Boolean games, while our ASP based technique is faster when the problem instances have a higher number of agents or action variables.