In this paper we extend the classical min-max model predictive control framework to a class of uncertain discrete event systems that can be modeled using the operations maximization, minimization, addition and scalar multiplication, and that we call max-min-plus-scaling (MMPS) systems. Provided that the stage cost is an MMPS expression and considering only linear input constraints then the open...

Important problems across multiple disciplines involve computations on the semiring (×,max) (or its equivalents, the negated version (×,min)), the log-transformed version (+,max), or the negated log-transformed version (+,min)): max-convolution, all-pairs shortest paths in a weighted graph, and finding the largest k values in xi + yj for two lists x and y. However, fast algorithms such as those...

Max-plus algebra is the algebraic structure in which classical addition and multiplication are replaced by a⊕b = max{a, b} and a⊗b = a+b, respectively. Each system of linear equation in max-plus algebra we can write in the matrix form A⊗ x = b, where A and b are matrix and vector of suitable size. If we replace the matrix elements with matrix interval A = [A,A] and vector elements by vector int...

Solving over-constrained problems with Max-SAT solvers typically consists of finding an assignment that satisfies all the hard constraints and the maximum number of soft constraints. Despite the relevance of clause learning in SAT for solving structured instances, this technology has not yet been extended to Max-SAT. In this paper, we have incorporated a module that learns hard clauses in a bra...

Background and Aim: The aim of this study was to evaluate the structural integrity of multiple-choice questions according to the Millman checklist, and to assess thedistinguishing power of these questions between weak and strong students in theoretical courses of Periodontics in an academic year (2014-15) in Dental Branch of Tehran Islamic Azad University. Materials and Methods: A total of...

Let G be a finite group of complex n× n unitary matrices generated by reflections acting on C. Let R be the ring of invariant polynomials, and χ be a multiplicative character of G. Let Ω be the R-module of χ-invariant differential forms. We define a multiplication in Ω and show that under this multiplication Ω has an exterior algebra structure. We also show how to extend the results to vector f...

beta subunits (Ca(v)beta) increase macroscopic currents of voltage-dependent Ca2+ channels (VDCC) by increasing surface expression and modulating their gating, causing a leftward shift in conductance-voltage (G-V) curve and increasing the maximal open probability, P(o,max). In L-type Ca(v)1.2 channels, the Ca(v)beta-induced increase in macroscopic current crucially depends on the initial segmen...

In this paper we define the module extension dual Banach algebras and we use this Banach algebras to finding the relationship between weak−continuous homomorphisms of dual Banach algebras and Connes-amenability. So we study the weak∗−continuous derivations on module extension dual Banach algebras.

This talk will describe recent progresses in the development of quantum algorithms for matrix multiplication. I will start with the case of Boolean matrices, and discuss the time complexity and query complexity of Boolean matrix multiplication in the quantum setting. I will then focus on other kinds of matrix products, in particular matrix products over algebraic structures known as semirings (...