In this paper, we consider the second-kind Chebyshev polynomials (SKCPs) for the numerical solution of the fractional optimal control problems (FOCPs). Firstly, an introduction of the fractional calculus and properties of the shifted SKCPs are given and then operational matrix of fractional integration is introduced. Next, these properties are used together with the Legendre-Gauss quadrature fo...

In this paper technology policy of India which has evolved over the years have been introduced as following: Firstly, it is selective and seeks to protect local technology. Secondly, it seeks to reduce to direct costs and individual costs of technology imports by regulating the royalty rates, other payments, the duration and restrictive clauses. Thirdly, it discourages technology imports throug...

It is firstly proved that the multi-input-single-output (MISO) fuzzy systems based on interval-valued $R$- and $S$-implications can approximate any continuous function defined on a compact set to arbitrary accuracy.  A formula to compute the lower upper bounds on the number  of interval-valued fuzzy sets needed to achieve a pre-specified approximation  accuracy for an arbitrary multivariate con...

The objective of this paper is to develop matrix games with pay-offs of triangular hesitant fuzzy elements (THFEs). To solve such games, a new methodology has been derived based on the notion of weighted average operator and score function of THFEs. Firstly, we formulate two non-linear programming problems with THFEs. Then applying the score function of THFEs, we transform these two problems in...

The present study was carried out to determine the Decapod Crustaceans fauna in association with Sarcotragus muscarum Schmidt, 1864 from the Levantine Sea coasts of Turkey studied between 13 September 2005 and 07 October 2005. As a result of the present study, a total of 711 specimens belonging to 12 decapod species were identified. Among the species determined, Synalpheus gambaroloides (Nardo,...

This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...

In this paper, we firstly propose a novel data min ing problem in a WWW environment. Secondly, we outline the algorithm f o r solving the problem. Our initial implementation of the algorithm suggests the algorithm is very e f i c i en t and scalable in practical. Therefore it can be applied t o a very large database.