Since many real-world engineering systems are too complex to be defined in precise terms, imprecision is often involved in any engineering design process. Fuzzy linear programming problems have an essential role in fuzzy modeling, which can formulate uncertainty in actual environment. One of the most practicable subjects in recent studies is based on LR fuzzy number, which was defined and used ...

Introduction: Efficient gait control using Functional Electrical Stimulation (FES) is an open research problem. In this research, a new intermittent controller has been designed to control the human shank movement dynamics during gait. Methods: In this approach, first, the three-dimensional phase space was constructed using the human shank movement data recorded from the healthy subjects. Then...

We present a vector space version of Katona’s t-intersection theorem [11]. Let V be the n-dimensional vector space over GF(q), and let F be a family of subspaces of V . Suppose that dim(F ∩F ′) ≥ t holds for all F,F ′ ∈ F . Then we show that |F | ≤ ∑k=d [n k ] for n+t = 2d, and |F | ≤ ∑k=d+1 [n k ] + [n−1 d ] for n+t = 2d+1. We also consider the case when the condition dim(F ∩F ′) ≥ t is replac...

‎The aim of this paper is to establish the equivalence between the concepts‎ ‎of an $S$-metric space and a cone $S$-metric space using some topological‎ ‎approaches‎. ‎We introduce a new notion of a $TVS$-cone $S$-metric space using‎ ‎some facts about topological vector spaces‎. ‎We see that the known results on‎ ‎cone $S$-metric spaces (or $N$-cone metric spaces) can be directly obtained‎ from...

Equidistant codes over vector spaces are considered. For k-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codeswhichmight produce the largest non-sunflower codes. A novel construction, based on the Plücker embedding, for 1-intersecting codes of k-dimensional subspaces over Fq , n ≥ k+1 2  , where the cod...

Within this paper we study the Minkowski sum of prisms (" Cephoids ") in a finite dimensional vector space. For a vector a ∈ R n with positive components we write ¯ a = (1 ¯ a 1 1 ¯ an) and denote by = ¯ a = {x ∈ R n || ¯ a, x 1 , x 0} the associated prism. We provide a representation of a finite sum of prisms in terms of inequalities.

This paper is based on a recent work by Kojima which extended sums of squares relaxations of polynomial optimization problems to polynomial semidefinite programs. Let E and E+ be a finite dimensional real vector space and a symmetric cone embedded in E ; examples of E and E+ include a pair of the N -dimensional Euclidean space and its nonnegative orthant, a pair of the N -dimensional Euclidean ...

Fuzzy multiset is applicable as a model of information retrieval because it has the mathematical structure which expresses the number and the degree of attribution of an element simultaneously. Therefore fuzzy multisets can be used also as a suitable model for document clustering. This paper aims at developing clustering algorithms based on a fuzzy multiset model for document clustering. The st...