SUMMARY When faced with proportion data that exhibit extra-binomial variation, data analysts often consider the beta-binomial distribution as an alternative model to the more common bino-mial distribution. A typical example occurs in toxicological experiments with laboratory animals, where binary observations on fetuses within a litter are often correlated with each other. In such instances, it...

Based on biological data we examine the ability of Sup port Vector Machines SVMs with gaussian polyno mial and tanh kernels to learn and predict the nonlin ear dynamics of single biological neurons We show that SVMs for regression learn the dynamics of the pyloric dilator neuron of the australian cray sh and we deter mine the optimal SVM parameters with regard to the test error Compared to conv...

We show that if there exists a strongly polynomial time algorithm that nds a basis which is optimal for both the primal and the dual problems given an optimal solution for one of the problems then there exists a strongly polyno mial algorithm for the general linear programming problem On other hand we give a strongly polynomial time algorithm that nds such a basis given any pair of optimal solu...

SUMMARY When faced with proportion data that exhibit extra-binomial variation, data analysts often consider the beta-binomial distribution as an alternative model to the more common bino-mial distribution. A typical example occurs in toxicological experiments with laboratory animals, where binary observations on fetuses within a litter are often correlated with each other. In such instances, it...

Two important properties of IsaLog programs are studied model niteness and func tionality Finiteness refers to the property of a program of having a nite model over every input instance Functionality requires a model to contain no contradictory infor mation about object values These two properties are shown to be undecidable This is a consequence of the ability of IsaLog programs to simulate co...

Kowalski and Sergot s Event Calculus EC is a simple tempo ral formalism that given a set of event occurrences derives the maximal validity intervals MVIs over which properties initi ated or terminated by these events hold It does so in polyno mial time with respect to the number of events Extensions of its query language with Boolean connectives and operators from modal logic have been shown to...

We present the moment cone (MC) relaxation and a hierarchy of sparse LagrangianSDP relaxations of polynomial optimization problems (POPs) using the unified framework established in Part I. The MC relaxation is derived for a POP of minimizing a polynomial subject to a nonconvex cone constraint and polynomial equality constraints. It is an extension of the completely positive programming relaxati...

We describe a new approach to isolate the roots (either real or com-plex) of a square-free polynomial F with real coefficients. It isassumed that each coefficient of F can be approximated to anyspecified error bound and we refer to such coefficients as bitstreamcoefficients. The presented method is exact, complete and deter-ministic. Compared to previous approaches [11, 20] ...

This paper addresses the problem of eecient construction of monomial bases for the coordinate rings of zero-dimensional varieties. Existing approaches rely on Grr ob-ner bases methods { in contrast, we make use of recent developments in sparse elimination techniques which allow us to strongly exploit the structural sparseness of the problem at hand. This is done by establishing certain properti...