نتایج جستجو برای: strictly pseudo

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

2006
János Fodor Imre J. Rudas Barnabás Bede

Recently it has been shown that in Image Processing, the usual sum and product of the reals are not the only operations that can be used. Several other operations provided by fuzzy logic perform well in this application. We continue this line of research and we propose the use of a pair consisting of a uninorm and an absorbing norm determined by a continuous, strictly increasing generator inste...

2015
Rafael Boloix-Tortosa Eva Arias-de-Reyna F. Javier Payan-Somet Juan J. Murillo-Fuentes

In this paper we propose a novel Bayesian kernel based solution for regression in complex fields. We develop the formulation of the Gaussian process for regression (GPR) to deal with complex-valued outputs. Previous solutions for kernels methods usually assume a complexification approach, where the real-valued kernel is replaced by a complexvalued one. However, based on the results in complex-v...

Journal: :Adv. Operations Research 2009
Izhar Ahmad Akhlad Iqbal Shahid Ali

The present paper deals with the properties of geodesic η-preinvex functions and their relationships with η-invex functions and strictly geodesic η-preinvex functions. The geodesic η-pre-pseudo-invex and geodesic η-pre-quasi-invex functions on the geodesic invex set are introduced and some of their properties are discussed.

2011
L.-P. YANG Mohammad Sal Moslehian

We introduce a modified Noor iteration scheme generated by an infinite family of strict pseudo-contractive mappings and prove the strong convergence theorems of the scheme in the framework of q−uniformly smooth and strictly convex Banach space. Results shown here are extensions and refinements of previously known results.

2010
Uthai Kamraksa Rabian Wangkeeree

The purpose of this paper is to introduce a general iterative method for finding solutions of a general system of variational inclusions with Lipschitzian relaxed cocoercive mappings. Strong convergence theorems are established in strictly convex and 2-uniformly smooth Banach spaces. Moreover, we apply our result to the problem of finding a common fixed point of a countable family of strict pse...

2007
Amos Storkey

Attractor neural networks such as the Hop eld network can be trained by a number of algorithms. The simplest of these methods is the Hebb rule which is strictly local (the weight of the synapse depends only on the activation of the two neurons it connects) and incremental (adding a new memory can be done knowing only the old weight matrix and not the actual patterns previously stored). Both of ...

M. A. Payvand S. Jahedi,

The problem ofgeneralized equilibrium problem is very general in the different subjects .Optimization problems, variational inequalities, Nash equilibrium problem and minimax problems are as special cases of generalized equilibrium problem. The purpose of this paper is to investigate the problem of approximating a common element of the set of generalized equilibrium problem, variational inequal...

2006
Jacques Patarin Valérie Nachef Côme Berbain

In this paper, we describe generic attacks on unbalanced Feistel schemes with contracting functions. These schemes are used to construct pseudo-random permutations from kn bits to kn bits by using d pseudo-random functions from (k − 1)n bits to n bits. We describe known plaintext attacks (KPA) and non-adaptive chosen plaintext attacks (CPA-1) against these schemes with less than 2 plaintext/cip...

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

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