Search results for "Monotonic function"
showing 10 items of 87 documents
On the cardinality of almost discretely Lindelof spaces
2016
A space is said to be almost discretely Lindelof if every discrete subset can be covered by a Lindelof subspace. Juhasz et al. (Weakly linearly Lindelof monotonically normal spaces are Lindelof, preprint, arXiv:1610.04506 ) asked whether every almost discretely Lindelof first-countable Hausdorff space has cardinality at most continuum. We prove that this is the case under $$2^{<{\mathfrak {c}}}={\mathfrak {c}}$$ (which is a consequence of Martin’s Axiom, for example) and for Urysohn spaces in ZFC, thus improving a result by Juhasz et al. (First-countable and almost discretely Lindelof $$T_3$$ spaces have cardinality at most continuum, preprint, arXiv:1612.06651 ). We conclude with a few rel…
Degree of monotonicity in aggregation process
2010
In this paper we introduce a fuzzy order relation notion in the description of aggregation process. Namely, we use the fuzzy order relation to define the degree of monotonicity, which is equal to 1 for a monotone function with respect to a crisp order relation. In that case, integration of fuzzy order relation allows us to generalize the notion of monotonicity and we try to investigate the benefits of using fuzzy relations instead of a crisp relation. Further we illustrate this definition by examples and study the properties of aggregation functions which have a certain degree of monotonicity.
A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions
2014
Published version of an article from the journal: Applied Intelligence. Also available on Springerlink: http://dx.doi.org/10.1007/s10489-014-0541-1 The most difficult part in the design and analysis of Learning Automata (LA) consists of the formal proofs of their convergence accuracies. The mathematical techniques used for the different families (Fixed Structure, Variable Structure, Discretized etc.) are quite distinct. Among the families of LA, Estimator Algorithms (EAs) are certainly the fastest, and within this family, the set of Pursuit algorithms have been considered to be the pioneering schemes. Informally, if the environment is stationary, their ε-optimality is defined as their abili…
Ordering and Convex Polyominoes
2005
We introduce a partial order on pictures (matrices), denoted by ≼ that extends to two dimensions the subword ordering on words. We investigate properties of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order. In particular we consider the families of polyominoes and convex polyominoes and the family, recently introduced by the authors, of L-convex polyominoes. In the first part of the paper we study the closure properties of such families with respect to the order. In particular we obtain a new characterization of L-convex polyominoes: a discrete set P is a L-convex polyomino if and only if all the elements Q≼P are polyominoes. In the seco…
Specification on the interval
1997
We study the consequences of discontinuities on the specification property for interval maps. After giving a necessary and sufficient condition for a piecewise monotonic, piecewise continuous map to have this property, we show that for a large and natural class of families of such maps (including the β \beta -transformations), the set of parameters for which the specification property holds, though dense, has zero Lebesgue measure. Thus, regarding the specification property, the general case is at the opposite of the continuous case solved by A.M. Blokh (Russian Math. Surveys 38 (1983), 133–134) (for which we give a proof).
Learning with confidence
1996
Herein we investigate learning in the limit where confidence in the current conjecture accrues with time. Confidence levels are given by rational numbers between 0 and 1. The traditional requirement that for learning in the limit is that a device must converge (in the limit) to a correct answer. We further demand that the associated confidence in the answer (monotonically) approach 1 in the limit. In addition to being a more realistic model of learning, our new notion turns out to be a more powerful as well. In addition, we give precise characterizations of the classes of functions that are learnable in our new model(s).
Impulsively-controlled systems and reverse dwell time: A linear programming approach
2015
We present a receding horizon algorithm that converges to the exact solution in polynomial time for a class of optimal impulse control problems with uniformly distributed impulse instants and governed by so-called reverse dwell time conditions. The cost has two separate terms, one depending on time and the second monotonically decreasing on the state norm. The obtained results have both theoretical and practical relevance. From a theoretical perspective we prove certain geometrical properties of the discrete set of feasible solutions. From a practical standpoint, such properties reduce the computational burden and speed up the search for the optimum thus making the algorithm suitable for th…
Stochastic monotonicity in intergenerational mobility tables
2010
SUMMARY The aim of this paper is to test for stochastic monotonicity in intergenerational socio-economic mobility tables. In other words, we question whether having a parent from a high socio-economic status is never worse than having one with a lower status. Using existing inferential procedures for testing unconditional stochastic monotonicity, we first test a set of 149 intergenerational mobility tables in 35 different countries and find that monotonicity cannot be rejected in hardly any table. In addition, we propose new testing procedures for testing conditional stochastic monotonicity and investigate whether monotonicity still holds after conditioning on a number of covariates such as…
Monotonically convergent optimal control theory of quantum systems under a nonlinear interaction with the control field
2008
We consider the optimal control of quantum systems interacting non-linearly with an electromagnetic field. We propose new monotonically convergent algorithms to solve the optimal equations. The monotonic behavior of the algorithm is ensured by a non-standard choice of the cost which is not quadratic in the field. These algorithms can be constructed for pure and mixed-state quantum systems. The efficiency of the method is shown numerically on molecular orientation with a non-linearity of order 3 in the field. Discretizing the amplitude and the phase of the Fourier transform of the optimal field, we show that the optimal solution can be well-approximated by pulses that could be implemented ex…
Analytical prediction of load deflection curves of external steel fibers R/C beam–column joints under monotonic loading
2015
Abstract In this paper a simplified analytical model able to reproduce the flexural behavior of external beam–column joints under monotonic loading is presented, to be used for pushover analysis. The subassemblage (beam, column and joint) is subjected to a constant vertical load acting on the column and to a monotonically increasing lateral force applied at the tip of the beam. The model is specific for hooked steel fiber-reinforced concrete (FRC) and is designed to calculate the flexural response in the form of a load–deflection curve, of beam–column subassemblages. No bond failure and shear deformations are considered in the present paper. The model includes shear-to-moment interaction fo…