Results 1  10
of
664
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1184 (31 self)
 Add to MetaCart
, and computation is represented purely as the communication of names across links. After an illustrated description of how the ncalculus generalises conventional process algebras in treating mobility, several examples exploiting mobility are given in some detail. The important examples are the encoding into the n
Generalised Strongly Prime Ideals in Near Rings
"... Copyright c © 2014 Om Prakash and Kalpana. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. In 1984, Groenewald and Potgieter, genera ..."
Abstract
 Add to MetaCart
, generalised results for fprime ideal in near rings. In this paper, we introduce the notion of strongly fprime ideal in near rings and generalise some of basic results of strongly prime ideal of near ring for the same. We show every strongly fprime ideal is strongly prime but the converse is not true.
Postponement, Conservation and Preservation of Strong Normalisation for Generalised Reduction
"... Postponement of K contractions and the conservation theorem do not hold for ordinary but have been established by de Groote for a mixture of with another reduction relation. In this paper, de Groote's results are generalised for a single reduction relation e which generalises . We show morev ..."
Abstract
 Add to MetaCart
morever, that e has the Preservation of Strong Normalisation property. Keywords: Generalised reduction, Postponement of Kcontractions, Generalised Conservation, Preservation of Strong Normalisation. 1 The calculus with generalized reduction In the term (( x : y :N)P )Q, the abstraction starting
The Barendregt Cube with Definitions and Generalised Reduction
, 1997
"... In this paper, we propose to extend the Barendregt Cube by generalising reduction and by adding definition mechanisms. We show that this extension satisfies all the original properties of the Cube including Church Rosser, Subject Reduction and Strong Normalisation. Keywords: Generalised Reduction, ..."
Abstract

Cited by 42 (20 self)
 Add to MetaCart
In this paper, we propose to extend the Barendregt Cube by generalising reduction and by adding definition mechanisms. We show that this extension satisfies all the original properties of the Cube including Church Rosser, Subject Reduction and Strong Normalisation. Keywords: Generalised Reduction
A datadependent generalisation error bound for the AUC
 IN PROCEEDINGS OF THE ICML 2005 WORKSHOP ON ROC ANALYSIS IN MACHINE LEARNING
, 2005
"... The optimisation of the Area Under the ROC Curve (AUC) has recently been proposed for learning ranking functions. However, the estimation of the AUC of a function on the true distribution of the examples based on its empirical value is still an open problem. In this paper, we present a datade ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
dependent generalisation error bound for the AUC. This bound presents the advantage to be tight, but it also allows to draw practical conclusions on learning algorithms which optimise the AUC. In particular, we show that in the case of AUC, kernel function classes have strong generalisation guarantees provided
On generalised tdesigns and their parameters
, 2009
"... Recently, P.J. Cameron introduced a new class of block designs which generalises the class of tdesigns, and also includes orthogonal arrays, resolved 2designs, and other classes of combinatorial designs. The main idea is that the set of points of the design is structured by an ordered partition of ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
these generalised tdesigns. In this paper, we investigate the parameters of generalised tdesigns, providing some strong necessary conditions for the existence of certain types of such designs. We show that the tdesign constants λi (the number of blocks containing an isubset of the points, where i ≤ t) and λ j i
On a Generalised Modularisation Theorem
, 2000
"... The relation between a metalogical property of entailment (interpolation) and a structural property of categories of theory presentations (stability of faithful morphisms under pushouts) is studied in an abstract "general logic" framework. In particular, a known result for first order l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to be equivalent to the existence of interpolants on specific loci of the underlying formalism. The latter neither assumes nor requires that the underlying logic possesses interpolation globally. 1 Introduction In this paper we revise, generalise and reestablish, in a notation independent framework, a strong
Turbulence for the generalised Burgers equation
"... Abstract. In this survey, we review the results on turbulence for the generalised Burgers equation on the circle: ut + f ′(u)ux = νuxx + η, x ∈ S1 = R/Z, obtained by A.Biryuk and the author in [7,9,11,12]. Here, f is smooth and strongly convex, whereas the constant 0 < ν 1 corresponds to a visco ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. In this survey, we review the results on turbulence for the generalised Burgers equation on the circle: ut + f ′(u)ux = νuxx + η, x ∈ S1 = R/Z, obtained by A.Biryuk and the author in [7,9,11,12]. Here, f is smooth and strongly convex, whereas the constant 0 < ν 1 corresponds to a
Generalised CalogeroMoser models and
, 1999
"... CalogeroMoser models can be generalised for all of the finite reflection groups. These include models based on noncrystallographic root systems, that is the root systems of the finite reflection groups, H3, H4, and the dihedral group I2(m), besides the wellknown ones based on crystallographic roo ..."
Abstract
 Add to MetaCart
CalogeroMoser models can be generalised for all of the finite reflection groups. These include models based on noncrystallographic root systems, that is the root systems of the finite reflection groups, H3, H4, and the dihedral group I2(m), besides the wellknown ones based on crystallographic
Generalisation of the Critical Angle Refractometry
"... Abstract The principle of the Critical Angle Refractometry is extended to characterize simultaneously the size distribution and the relative refractive index (i.e. composition) of a cloud of particles with relative refractive index below unity (i.e. bubbles). For the description of the nearcritical ..."
Abstract
 Add to MetaCart
index, mean and standard deviation of the size distribution, have a strong influence on the global angular position, the angular spreading and the amplitude contrast of the nearcriticalscattering pattern respectively. This behaviour allows developing a simple method to inverse the scattering pattern
Results 1  10
of
664