نتایج جستجو برای: monotonic

تعداد نتایج: 12198  

1999
Alfredo Restrepo Scott T. Acton

We introduce binary locally monotonic regression as a first step in the study of the application of local monotonicity for image estimation. Given an algorithm that generates a similar locally monotonic image from a given image, we can specify both the scale of the image features retained and the image smoothness. In contrast to the median filter and to morphological filters, a locally monotoni...

1996
Jun-ichi Inoue

We investigate the retrieval phase diagrams of an asynchronous fully-connected attractor network with non-monotonic transfer function by means of a mean-field approximation. We find for the noiseless zero-temperature case that this non-monotonic Hopfield network can store more patterns than a network with monotonic transfer function investigated by Amit et al. Properties of retrieval phase diag...

Given a mapping $f:Xto X$ we naturally associate to it a monotonic map $gg_f:exp Xto exp X$ from the power set of $X$ into itself, thus inducing a generalized topology on $X$. In this paper we investigate some properties of generalized topologies which are defined by such a procedure.

2010
T. R. Mahapatra S. K. Nandy A. S. Gupta

The effect of a uniform transverse magnetic field on two-dimensional stagnation-point flow of an incompressible viscous electrically conducting fluid over a stretching surface is investigated when the surface is stretched in its own plane with a velocity proportional to the distance from the stagnation-point. This magnetohydrodynamic (MHD) flow problem is governed by the parameter b representin...

2015
Daniel Schwartz-Narbonne Philipp Rümmer Martin Schäf Ashish Tiwari Thomas Wies

Traditionally, program analysis is formulated as computation of fixpoints using monotonic iteration of lattice-theoretic functions. Monotonicity is important because it ensures convergence of the analysis towards a fixpoint. Still, the idea of non-monotonic iteration is intriguing because such an analysis can cut short the search, potentially convergingmuch faster than monotonic iteration. In t...

Journal: :Neurocomputing 2017
Hong Zhu Eric C. C. Tsang Xizhao Wang Rana Aamir Raza

Monotonic classification problems mean that both feature values and class labels are ordered and monotonicity relationships exist between some features and the decision label. Extreme Learning Machine (ELM) is a singlehidden layer feedforward neural network with fast training rate and good generalization capability, but due to the existence of training error, ELM cannot be directly used to hand...

Journal: :bulletin of the iranian mathematical society 0
vladimir pavlovic university of nis, faculty of sciences and mathematics aleksandar s. cvetkovi' c department of mathematics and informatics, faculty of mechancial engineering, university of belgrade

given a mapping $f:xto x$ we naturally associate to it a monotonic map $gg_f:exp xto exp x$ from the power set of $x$ into itself, thus inducing a generalized topology on $x$. in this paper we investigate some properties of generalized topologies which are defined by such a procedure.

2001
Martin Plátek Frantisek Mráz

We introduce and study the notion of j-monotonicity of RRand RRW -automata (special types of restarting automata without working symbols). We show that the j-monotonicity can be considered as a degree of non-context-freeness of languages recognized by RRW -automata and RR-automata. 1-monotonic RRW -automata recognize a subset of the class of context-free languages. For j > 1, the j-monotonic RR...

2007
Marta Cardin Silvio Giove

This paper deals with non-monotonic Choquet integral, a generalization of the regular Choquet integral. The discrete non-monotonic Choquet integral is considered under the viewpoint of aggregation. In particular we give an axiomatic characterization of the class of non-monotonic Choquet integrals.We show how the Shapley index, in contrast with the monotonic case, can assume positive values if t...

2012
Janusz A. Brzozowski Baiyu Li

The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of regular languages is the maximal syntactic complexity of languages in that subclass, taken as a function of the state complexity n of these languages. We study the syntactic complexity of three subclasses of star-free languages. We find tight upper bounds for l...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید