This article proposes an optimized instance-based learning approach for prediction of the compressive strength of high performance concrete based on mix data, such as water to binder ratio, water content, super-plasticizer content, fly ash content, etc. The base algorithm used in this study is the k nearest neighbor algorithm, which is an instance-based machine leaning algorithm. Five different...

This paper examines the performance of seven neural network architectures in classifying and detecting novel events contained within data collected from turbine sensors. Several different multi-layer perceptrons were built and trained using back propagation, conjugate gradient and Quasi-Newton training algorithms. In addition, Linear networks, Radial Basis Function networks, Probabilistic netwo...

We explore various estimators for the parameters of a pair-copula construction (PCC), among those the stepwise semiparametric (SSP) estimator, designed for this dependence structure. We present its asymptotic properties, as well as the estimation algorithm for the two most common types of PCCs. Compared to the considered alternatives, i.e. maximum likelihood, inference functions for margins and...

Abstract On the background of air defense missile which use radar command guidance, this article focuses on maneuvering target trajectory simulation and tracking problem by considering possible modes overload. Taking Serpentine (S maneuvering) as an example, is simulated based overload using stepwise design method, data are measured through sensor models. Since single model cannot motion exactl...

International Journal of Systems Science Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713697751 A fast linear-in-the-parameters classifier construction algorithm using orthogonal forward selection to minimize leave-one-out misclassification rate X. Hong a; S. Chen b; C. J. Harris b a School of Systems Engin...

This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local strategy modifications. Current strategy improvement methods stepwise improve the strategy of one player with respect to some ranking function, using an algorithm with two distinct phases: They first choose a modificatio...

Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the context of the analysis of system models, with applications in the stepwise development of systems and in model reduction. In this paper, we study probabilistic timed simulation and bisimulation relations for probabilistic timed...

In this paper, we describe the creation of rules for generating Chinese zero anaphors through a sequence of experiments in a stepwise enhanced manner. In the experiments , we basically examined the occurrence of zero anaphors in a real text and the ones generated by the algorithms employing the rules, assuming the same semantic and discourse structures as the text. The factors of locality, synt...