In this paper, we consider completely generalized nonlinear quasi-variational-like inclusions in Banach spaces and propose an Ishikawa type iterative algorithm for computing their approximate solutions by applying the new notion of Jη-proximal mapping given in [R. Ahmad, A.H. Siddiqi, Z. Khan, Proximal point algorithm for generalized multi-valued nonlinear quasi-variational-like inclusions in B...

This paper aims to present the well-known spectral mapping theorem for multi-variable functions.

In this paper we introduce XTCTL, a dense-time extension of the multi-valued Computation Tree Logic (XCTL) in [1]. Alternatively, XTCTL is a multi-valued extension of TCTL [2] over quasiboolean algebras. A multi-valued quotient is defined which enables to reduce dense-time XTCTL model checking to the untimed case.

The goal of this project is to develop a MV optimization package and use MV logic optimization to produce efficient code that simulates the MV network. The package is implemented as a MV layer on top of SIS. The process includes taking in a blif mv file, parsing it into a MVSIS network, applying optimization techniques on the network, performing technology mapping on the resulting network, and ...

We survey some of the methods used for manipulating, representing, and optimizing multi-valued logic with the view of both building a better understanding of the more specialized binary-valued logic, as well as motivating research towards a true multi-valued multi-level optimization package.

This paper proposes a novel approach for pedestrian reidentification. Previous re-identification methods use one of 3 approaches: invariant features; designing metrics that aim to bring instances of shared identities close to one another and instances of different identities far from one another; or learning a transformation from the appearance in one domain to the other. Our implicit approach ...

With every real valued function, of a real argument, can be associated a matrix function mapping a linear space of symmetric matrices into itself. In this paper we study directional differentiability properties of such matrix functions associated with directionally differentiable real valued functions. In particular, we show that matrix valued functions inherit semismooth properties of the corr...

The main result of the paper contains an exact formula for the rate of regularity of a set-valued mapping with a convex graph. As a consequence we find an exact expression for the rate of regularity of a set-valued mapping associated with so called constraint system. It turns out that the rate is equal to the upper bound of Robinson-type estimates over all norms in the graph space of the homoge...

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...