The aim of this paper is to introduce the algorithm proposed in [Fuzzy Sets and System, 2002] and some further modifications. Its applications presented in [ibid; A comparison of five approaches for lithium dose and serum concentration prediction, IFSA-NAFIPS 2001, pp. 104–110] is reviewed as a full collection of its use in pharmacokinetic analysis. First a recently developed fuzzy system model...

The short-range structure of the 2+1 flavour QCD vacuum is studied through visualisations of the topological charge density. Of particular interest is a new Gaussian weighted smearing algorithm which is applied to the rough topological charge density to disclose underlying long range structure. The results provide support for the view of the QCD vacuum as a sandwich of sign-alternating sheets o...

In this paper we describe an algorithm for finding the nilpotency class, and the upper central series of the maximal normal p-subgroup ∆(G) of the automorphism group, Aut(G) of a bounded (or finite) abelian p-group G. This is the first part of two papers devoted to compute the nilpotency class of ∆(G) using formulas, and algorithms that work in almost all groups. Here, we prove that for p ≥ 3 t...

We investigate further improvement of boosting in the case that the target concept belongs to the class of r-of-k threshold Boolean functions, which answers “+1” if at least r of k relevant variables are positive, and answers “−1” otherwise. Given m examples of a r-of-k function and literals as base hypotheses, popular boosting algorithms (e.g., AdaBoost [FS97]) construct a consistent final hyp...

The classical secretary problem has been generalized over the years into several directions. In this paper we confine our interest to those generalizations which have to do with the more general problem of stopping on a last observation of a specific kind. We follow Dendievel [10], [11], (where a bibliography can be found) who studies several types of such problems, mainly initiated by Bruss [3...

This report is a follow-up for [3]. Part II addresses a question left open in Part I: it consists in the analysis of the computation which can be realised at step j +1 of Lidskii’s algorithm when step j is non generic. This question is examined in the context of an appropriate modification of the existing Homotopic Deviation theory [1, 2]. Connections are made with the theory of square matrix p...

The constraints of BF topological gauge theories are used to construct Hamiltonians which are anti-commutators of the BRST and anti-BRST operators. Such Hamiltonians are a signature of Topological Quantum Field Theories (TQFT’s). By construction, both classes of topological field theories share the same phase spaces and constraints. We find that, for 2+1 and 1+1 dimensional space-times foliated...

We investigate further improvement of boosting in the case that the target concept belongs to the class of r-of-k threshold Boolean functions, which answer “+1” if at least r of k relevant variables are positive, and answer “−1” otherwise. Given m examples of a r-of-k function and literals as base hypotheses, popular boosting algorithms (e.g., AdaBoost) construct a consistent final hypothesis b...

The star valency of a graph G is the minimum, over all star decompositions , of the maximum number of elements in incident with a vertex. The maximum average degree of G, denoted by dmax-ave(G), is the maximum average degree of all subgraphs of G. In this paper, we prove that the star valency of G is either dmax-ave(G)=2 or dmax-ave(G)=2 +1, and provide a polynomial time algorithm for determini...

Using statistical textons for texture classification has shown great success recently. The maximal response 8 (Statistical_MR8), image patch (Statistical_Joint) and locally invariant fractal (Statistical_Fractal) are typical statistical texton algorithms and state-of-the-art texture classification methods. However, there are two limitations when using these methods. First, it needs a training s...