The purpose of this paper is to introduce Shi’s (quasi-)uniformity structure in the context of fuzzy soft sets. We define the notion of a fuzzy soft (quasi-)uniformity in the sense of Shi. We give the relations between a fuzzy soft (quasi-)uniformity and a fuzzy soft cotopology. Also, we investigate the relations between fuzzy soft remote neighborhood structures which are generated by a given f...

A new method to clustering analysis, which is based on integration of graph theoretical method and fuzzy objective fimction algorithm, is developed. The connectivity mritriv derived from fuzzy limited neighborhood graph and the measurement for similarity and dissimilarity a re utilized to build a new fuzzy objective function that iinifles global data distribution and local spatial information. ...

Sequential quadratic programming (SQP) methods are a popular class of methods for nonlinearly constrained optimization. They are particularly effective for solving a sequence of related problems, such as those arising in mixed-integer nonlinear programming and the optimization of functions subject to differential equation constraints. Recently, there has been considerable interest in the formul...

conclusions the findings point to a relationship between neighborhood characteristics and obesity only in the azeri turks. however, educational level was more important than neighborhood quality in predicting the risk of obesity results three common neighborhood environments were identified: 1) modern-affluent, 2) central-high access and 3) marginal. these three factors explained 73.2% of the t...

following the idea of $l$-fuzzy neighborhood system as introduced byfu-gui shi, and its generalization to $(l,m)$-fuzzy neighborhood system, the relationship between  $(l,m)$-fuzzy topology and $(l,m)$-fuzzy neighborhood system will be further studied. as an application of the obtained results, we will describe the initial structures of $(l,m)$-fuzzy neighborhood subspaces and $(l,m)$-fuzzy top...

We develop a theory of quasi-Newton and least-change update methods for solving systems of nonlinear equations F (x) = 0. In this theory, no diierentiability conditions are necessary. Instead, we assume that F can be approximated, in a weak sense, by an aane function in a neighborhood of a solution. Using this assumption, we prove local and ideal convergence. Our theory can be applied to B-diie...

The colored neighborhood metric for sparse graphs was introduced by Bollobás and Riordan [8]. The corresponding convergence notion refines a convergence notion introduced by Benjamini and Schramm [6]. We prove that even in this refined sense, the limit of a convergent graph sequence (with uniformly bounded degree) can be represented by a graphing. We study various topics related to this converg...

Let Ω be a smooth bounded pseudoconvex domain in Cn. We give several characterizations for the closure of Ω to have a Stein neighborhood basis in the sense that Ω has a defining function ρ such that {z ∈ Cn : ρ(z) < ε} is pseudoconvex for sufficiently small ε > 0. We also show that this condition is invariant under proper holomorphic maps that extend smoothly to the boundary.