نتایج جستجو برای: neighborhood function

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

Journal: :international journal of preventive medicine 0
ali alami reza majdzadeh saharnaz nedjat abbas rahimi foroushani hossein malekafzali

background: the purpose of this study is to determine association between personal, family, neighborhood, and social network characteristics and perceived intimacy in the neighborhood by the women. methods: in this cross‑sectional study, we applied a two‑stage sampling method to choose a representative sample of 150 married women and housewives, aged 15 to 49 years, who had education between si...

2011
Félix Calderón Carlos A. Júnez-Ferreira

Image denoising by minimizing a similarity of neighborhoodbased cost function is presented. This cost function consists of two parts, one related to data fidelity and the other is a structure preserving smoothing term. The latter is controlled by a weight coefficient that measures the neighborhood similarity between two pixels and attaching an additional term penalizes it. Unlike most work in n...

Journal: :Discrete & Computational Geometry 2006
Herbert E. Scarf Kevin M. Woods

Given a1, a2, . . . , an ∈ Z , we examine the set, G, of all nonnegative integer combinations of these ai. In particular, we examine the generating function f(z) = ∑ b∈G z . We prove that one can write this generating function as a rational function using the neighborhood complex (sometimes called the complex of maximal lattice-free bodies or the Scarf complex) on a particular lattice in Z. In ...

Journal: :JCP 2012
Wenxue Zhang

Based on the inertia weight and acceleration coefficients of trigonometric function and variable neighborhood search, a modified particle swarm optimization is discussed. The modified PSO with the parameters of the trigonometric function has powerful global exploration at the beginning and ending of the evolution, and strongly local exploitation in the interim of run. Through analyzing the beha...

2004
HERBERT E. SCARF KEVIN M. WOODS Kevin M. Woods

Given a1, a2, . . . , an ∈ Zd , we examine the set, G, of all non-negative integer combinations of these ai . In particular, we examine the generating function f (z) = ∑ b∈G z b. We prove that one can write this generating function as a rational function using the neighborhood complex (sometimes called the complex of maximal lattice-free bodies or the Scarf complex) on a particular lattice in Z...

2006
Patrick Bayer Stephen L. Ross

Researchers have long recognized that the non-random sorting of individuals into groups generates correlation between individual and group attributes that is likely to bias naı̈ve estimates of both individual and group effects. This paper proposes a nonparametric strategy for identifying these effects in a model that allows for both individual and group unobservables, applying this strategy to t...

2009
Pierre Hansen Nenad Mladenovic

Main methods, algorithms and applications of the Variable Neighborhood Search metaheuristic are surveyed, in view of a chapter of the Encyclopedia of Optimization.

In this paper, we interpret a fuzzy differential equation by using the strongly generalized differentiability concept. Utilizing the Generalized characterization Theorem. Then a novel hybrid method based on learning algorithm of fuzzy neural network for the solution of differential equation with fuzzy initial value is presented. Here neural network is considered as a part of large eld called ne...

2005
JONATHAN KORMAN

The character of an irreducible admissible representation of a p-adic reductive group is known to be a constant function in some neighborhood of any regular semisimple element γ in the group. Under certain mild restrictions on γ, we give an explicit description of a neighborhood of γ on which the character is constant.

2002
Ravindra K. Ahuja James B. Orlin

Many discrete optimization problems of practical interest cannot be solved to optimality in the available time. A practical approach to these problems is to use heuristic algorithms, which do not guarantee the optimality of the solution but which, for many problems, can find nearly optimal solutions within a reasonable amount of computational time. The literature on heuristic algorithms often d...

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

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