Historically, theories of motor control have been based on either central or peripheral mechanisms. This article examines a current, expfieit, central theory accounting for the observed flexibility in motor performance: the generafized motor program with a multiplicative rate parameter. Reanalysis of data from a variety of motor skills reported in the literature and a detailed study of skilled ...

Let q be a power of 2. We show by representation theory that there exists a q × q unitary matrix of multiplicative order q + 1 whose powers generate q + 1 complex pairwise mutually unbiased bases in C. When q is a power of an odd prime, there is a q × q unitary matrix of multiplicative order q+1 whose first (q+1)/2 powers generate (q+1)/2 complex pairwise mutually unbiased bases. We also show h...

In cooperative game theory, it is typically assumed that the value of each coalition is known. We depart from this, assuming that v(S) is only a noisy estimate of the true value V (S), which is not yet known. In this context, we investigate which solution concepts maximize the probability of ex-post stability (after the true values are revealed). We show how various conditions on the noise char...

Central to the theory of free probability is the notion of summing multiplicative functionals on the lattice of non-crossing partitions. In this paper, a graph-theoretic perspective of partitions is investigated in which independent sets in graphs correspond to non-crossing partitions. By associating particular graphs with elements of “zeon” algebras (commutative subalgebras of fermion algebras...

The work examines the problem of model predictive control for uncertain linear dynamic systems with intervally assigned parameters and multiplicative noise inputs. We use the model predictive control techniques based on linear matrix inequalities to get an optimal robust control strategy that provides the system with stability in the mean-square sense. The results are illustrated by an numerica...

Purpose – The purpose of this paper is to consider the influence of individual risk preferences on the effectiveness of incentive pay schemes, by examining the link between individual effort and risk aversion in situations where outcome uncertainty multiplies with effort. Such “multiplicative noise” situations are common, occurring whenever payment is awarded per success rather than per attempt...

We give some basic results of the theory of proof nets for multiplicative linear logic and multiplicative exponential linear logic with mix. The relation between proof nets and the lambda-calculus is precisely described. 1 Multiplicative Proof Nets 1.1 Multiplicative Linear Logic We assume given a denumerable set of atoms X, Y , . . . The formulas of multiplicative linear logic (MLL) are define...

semilinear stochastic evolution equations with multiplicative l'evy noise are considered‎. ‎the drift term is assumed to be monotone nonlinear and with linear growth‎. ‎unlike other similar works‎, ‎we do not impose coercivity conditions on coefficients‎. ‎we establish the continuous dependence of the mild solution with respect to initial conditions and also on coefficients. ‎as corollarie...

This paper is included in a series aiming to contribute to the algebraic theory of distributed computation. The key problem in understanding Multi-Agent Systems is to find a theory which integrates the reactive part and the control part of such systems. To this end we use the calculus of flownomials. It is a polynomial-like calculus for representing flowgraphs and their behaviours. An ‘additive...

In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set of axiom links but a tree in which the axiom links are subtrees. These trees will be identified according to an equivalence relation based on a simple form ...