Decomposable models and Bayesian net­ works can be defined as sequences of oligo­ dimensional probability measures connected with opemtors of composition. The prelim­ inary results suggest that the probabilistic models allowing for effective computational procedures are represented by sequences pos­ sessing a special property; we shall call them perfect sequences. The present paper lays down th...

We analyze general model selection procedures using penalized empirical loss minimization under computational constraints. While classical model selection approaches do not consider computational aspects of performing model selection, we argue that any practical model selection procedure must not only trade off estimation and approximation error, but also the computational effort required to co...

Four design tool procedures are examined to create improved neural network architectures for forecasting runoff from a small catchment. Different algorithms are used to remove nodes and connections so as to produce an optimised forecasting model, thereby reducing computational expense without loss in performance. The results also highlight issues in selecting analytical methods to compare outpu...

This article reviews various procedures used in the analysis of circadian rhythms at the populational, organismal, cellular and molecular levels. The procedures range from visual inspection of time plots and actograms to several mathematical methods of time series analysis. Computational steps are described in some detail, and additional bibliographic resources and computer programs are listed.

Abstract. We develop a discretization and computational procedures for the approximation of the action of Fourier integral operators whose canonical relations are graphs. Such operators appear in many physical contexts and computational problems, for instance in the formulation of imaging and inverse scattering of seismic reflection data. Our discretization and algorithms are based on a multi-s...

ABSTRACT Blade failure is a common problem of a steam turbine and it’s failure in-service results in safety risks, repair cost and non operational revenue losses. Thus, the reliability of these blades is very important for the successful operation of a steam turbine. Dynamic analysis of a steam turbine blade in computational environment is carried out in the present work. In order to gain physi...

Statement of Scope and Purpose. This is a comprehensive study of preprocessing in DEA. The purpose is to provide tools that will reduce the computational burden of DEA studies especially in large scale applications. Abstract. We collect, organize, analyze, implement, test, and compare a comprehensive list of ideas for pre-processors for entity classification in DEA. We limit our focus to proced...

Recent improvements in flexible docking technology may lead to a bigger role for computational methods in lead discovery. Although fast and accurate computational prediction of binding affinities for an arbitrary molecule is still beyond the limits of current methods, the docking and screening procedures can select small sets of likely lead candidates from large libraries of either commercially...

In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz. preferred models and stable models, are not given up. The proposed algorithms exploit the structural information of defeasible knowledge bases to facilitate efficient computational models.