Results 161 to 170 of about 6,291 (196)

Monotonic circuits with complete acknowledgement

Ninth International Symposium on Asynchronous Circuits and Systems, 2003. Proceedings., 2003
The paper studies a class of asynchronous circuits in which every signal transition on the inputs of every gate is acknowledged during the circuit operation. This property is called complete acknowledgement (CA) and it is considered here for circuits that consist of gates described by monotonic Boolean functions only.
Nikolai Starodoubtsev, Sergei Bystrov, Alexandre Yakovlev   +2 more
openaire   +1 more source

Monotone Completions of the Fermion Algebra

The Quarterly Journal of Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saitô, Kazuyuki, Wright, J. D. Maitland
openaire   +2 more sources

APPROXIMATION OF AND BY COMPLETELY MONOTONE FUNCTIONS

The ANZIAM Journal, 2019
We investigate convergence in the cone of completely monotone functions. Particular attention is paid to the approximation of and by exponentials and stretched exponentials. The need for such an analysis is a consequence of the fact that although stretched exponentials can be approximated by sums of exponentials, exponentials cannot in general be ...
R. J. LOY, R. S. ANDERSSEN
openaire   +1 more source

A Property of completely monotonic functions

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1987
AbstractA non-negative function f(t), t > 0, is said to be completely monotonic if its derivatives satisfy (-1)n fn (t) ≥ 0 for all t and n = 1, 2, …, For such a function, either f(t + δ) / f(t) is strictly increasing in t for each δ > 0, or f(t) = ce-dt for some constants c and d, and for all t. An application of this result is given.
openaire   +2 more sources

Completely monotonic functions

Integral Transforms and Special Functions, 2001
In this expository article we survey some properties of completely monotonic functions and give various examples, including some famous special functions. Such function are useful, for example, in probability theory. It is known, [1, p.450], for example, that a function w is the Laplace transform of an infinitely divisible probability distribution on ...
K.S. Miller, S.G. Samko
openaire   +1 more source

A Note on Completely and Absolutely Monotone Functions

Canadian Mathematical Bulletin, 1982
AbstractThe solutions of a certain class of first order linear differential equations are shown to be either completely or absolutely monotone depending on the nature of its coefficients. This is a simple theorem which is used to deduce a number of new and interesting results dealing with the complete and absolute monotonicity of functions.
Mahajan, Arvind, Ross, Dieter K.
openaire   +2 more sources

Fusing Complete Monotonic Decision Trees

IEEE Transactions on Knowledge and Data Engineering, 2017
Monotonic classification is a kind of classification task in which a monotonicity constraint exist between features and class, i.e., if sample $x_i$ has a higher value in each feature than sample $x_j$ , it should be assigned to a class with a higher level than the level of $x_j$ 's class.
Hang Xu, Wenjian Wang, Yuhua Qian
openaire   +1 more source

On the complete monotonicity of symbol error rates

2012 IEEE International Symposium on Information Theory Proceedings, 2012
In this paper, it is shown that the symbol error rate of an arbitrary multi-dimensional constellation impaired by independent and identically distributed additive white Gaussian noise under maximum likelihood detection is completely monotonic in the average SNR, if the rank of the constellation matrix is either one or two.
Adithya Rajan, Cihan Tepedelenlioglu
openaire   +1 more source

ON TENSOR PRODUCTS OF MONOTONE COMPLETE ALGEBRAS

The Quarterly Journal of Mathematics, 1984
Over thirty years ago, Kaplansky initiated the study of \(AW^*\)-algebras and, in particular, extended the Murray-von Neumann classification to those more general algebras. He gave a complete analysis of Type I \(AW^*\)-algebras and showed that an \({\mathcal N}\)-homogeneous Type I \(AW^*\)-algebra may be regarded as an \({\mathcal N}\times {\mathcal ...
Saitô, Kazuyuki, Wright, J. D. Maitland
openaire   +1 more source

Completely monotone functions on lie semigroups

Ukrainian Mathematical Journal, 2000
A totally monotone function on a semigroup \(S\) was defined by \textit{A. Devinatz} and \textit{A. E. Nussbaum} [Duke Math. J. 28, 221-237 (1961; Zbl 0118.11201)] as a function satisfying certain difference inequalities. The author shows that the latter are equivalent to some differential inequalities if \(S\) is a Lie semigroup.
openaire   +2 more sources