We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We present a bottom-up algorithm that, given an untyped process P , computes a minimal set of constraints on security levels such that all actions during runs of P are performed without violating the ...

In this paper, a modified fuzzy system modelling algorithm that incorporates Type 2 fuzzy sets, which is based on intervalvalued membership degrees rather than singleton membership degrees, is proposed. The proposed algorithm is evaluated in terms of predictive performance and determination of the significance degrees and compared with other algorithms in the literature, namely Stepwise Multipl...

We present several strong convergence results for the modified, Halpern-type, proximal point algorithm xn+1 = αnu + (1 − αn)Jβn xn + en (n = 0, 1, . . .; u, x0 ∈ H given, and Jβn = (I + βn A)−1, for a maximal monotone operator A) in a real Hilbert space, under new sets of conditions on αn ∈ (0, 1) and βn ∈ (0,∞). These conditions are weaker than those known to us and our results extend and impr...

We propose a type-2 based clustering algorithm to capture data points and attributes relationship embedded in fuzzy subspaces. It is a modification of Gustafson Kessel clustering algorithm through deployment of type-2 fuzzy sets for high dimensional data. The experimental results have shown that type-2 projected GK algorithm perform considerably better than the comparative techniques. General T...

We present a simple type-checker for a language with dependent types and let expressions, with a simple proof of correctness.

In this paper two recursive algorithms, based on MOESP type subspace identification, are presented in two versions. The main idea was to show that we can represent subspace identification methods as sequences of least squares problems and implement them through sequences of modified Householder algorithms. Therefore, it is possible to develop iterative algorithms with most of the advantages of ...

Motivated by a numerical example which shows that a feasible version of Mehrotra’s original predictor-corrector algorithm might be inefficient in practice, Salahi et al., proposed a so-called safeguard based variant of the algorithm that enjoys polynomial iteration complexity while its practical efficiency is preserved. In this paper we analyze the same Mehrotra’s algorithm from a different per...

The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...