The robust stabilization problem of chaos suppression for permanent magnet synchronous motors (PMSM) drive system is investigated in presence of parametric uncertainties. Based on control Lyapunov function (CLF) approach, a new state feedback controller is designed to realize the state of the system globally asymptotically stable. The stability of the proposed control scheme is verified via Lya...

We extend the Ståhl-Rubinstein alternating-o¤er bargaining procedure to allow players, prior to each bargaining round, to simultaneously and visibly commit to some share of the pie. If commitment costs are small but increasing in the committed share, then the unique outcome consistent with common belief in future rationality (Perea, 2010), or more restrictively subgame perfect Nash equilibrium,...

We introduce a new hybrid iterative algorithm for finding a common element of the set of fixed points of hemirelatively nonexpansive mappings and the set of solutions of an equilibrium problem and for finding a common element of the set of zero points of maximal monotone operators and the set of solutions of an equilibrium problem in a Banach space. Using this theorem, we obtain three new resul...

The Fiat-Shamir (FS) transform uses a hash function to generate, without any further overhead, non-interactive zero-knowledge (NIZK) argument systems from constant-round publiccoin honest-verifier zero-knowledge (public-coin HVZK) proof systems. In the proof of zero knowledge, the hash function is modeled as a programmable random oracle (PRO). In TCC 2015, Lindell embarked on the challenging ta...

Non-malleable codes are a natural relaxation of error correcting/detecting codes that have useful applications in the context of tamper resilient cryptography. Informally, a code is non-malleable if an adversary trying to tamper with an encoding of a given message can only leave it unchanged or modify it to the encoding of a completely unrelated value. This paper introduces an extension of the ...

We consider a scenario in which a sender wishes to broadcast a common message to a large number of receivers in a slowly fading wireless environment. We exploit cooperation between the receivers but impose an average sum power constraint across the network. As the number of receivers K → ∞, there is a critical rate C for the common message such that the outage probability of every receiver appr...

let $r$ be a commutative ring with identity and $m$ an $r$-module. in this paper, we associate a graph to $m$, say ${gamma}({}_{r}m)$, such that when $m=r$, ${gamma}({}_{r}m)$ coincide with the zero-divisor graph of $r$. many well-known results by d.f. anderson and p.s. livingston have been generalized for ${gamma}({}_{r}m)$. we show that ${gamma}({}_{r}m)$ is connected with ${diam}({gamma}({}_...