In this paper, a novel problem of observer-based adaptive fuzzy fractional control for fractional order dynamic systems with commensurate orders is investigated; the control scheme is constructed by using the backstepping and adaptive technique. Dynamic surface control method is used to avoid the problem of “explosion of complexity” which is caused by backstepping design process. Fuzzy logic sy...

There is a growing consensus among urban analysts that inner-city neighborhoods suffer from a lack of social capital. Because these areas do not have a strong social infrastructure in place to support successful revitalization efforts, urban policy recommendations now call for developing social capital in the worst-off parts of our cities. However, this consensus has been reached without any em...

Intelligent fault diagnosis benefits from efficient feature selection. Neighborhood rough sets are effective in feature selection. However, determining the neighborhood value accurately remains a challenge. The wrapper feature selection algorithm is designed by combining the kernel method and neighborhood rough sets to self-adaptively select sensitive features. The combination effectively solve...

Recently, Van Den Boomgaard and Van De Weijer have presented an algorithm for texture analysis using robust tensor-based estimation of orientation. Structure tensors are a useful tool for reliably estimating oriented structures within a neighborhood and in the presence of noise. In this paper, we extend their work by using the Geman-McClure robust error function and, developing a novel iterativ...

When joined to a stipulated neighborhood digraph, an objective function deÞned on the solution space of a real combinatorial optimization problem forms a landscape. Grover shows that landscapes satisfying a certain difference equation have properties favorable to local search. Studying only symmetric and regular neighborhood digraphs, Stadler deÞnes elementary landscapes as those which can be r...

For a graph G, a function f : V (G) ! f?1; 0; +1g is called a minus-domination function of G if the closed neighborhood of each vertex of G contains strictly more

In this researcha particle swarm optimization (PSO) algorithm is proposedfor no-wait flowshopsequence dependent setuptime scheduling problem with weighted earliness-tardiness penalties as the criterion ( | , | ∑ " ).The smallestposition value (SPV) rule is applied to convert the continuous value of position vector of particles in PSO to job permutations.A timing algorithm is generated to find t...

Neighborhood specification is a dominant consideration in assuring the success of a direct search approach to a difficult combinatorial optimization problem. Previous research has shown the efficacy of imposing an elementary landscape upon the search topology. Barnes et al. [J.W. Barnes, S. Dokov, B. Dimova, A. Solomon, A theory of elementary landscapes, Applied Mathematics Letters 16 (2003)] g...

in this paper, the concept of {sl local base with  stratifiedstructure} in $i$-topological vector spaces is introduced. weprove that every $i$-topological vector space has a balanced localbase with stratified structure. furthermore, a newcharacterization of $i$-topological vector spaces by means of thelocal base with stratified structure is given.