In this paper, the problem of adaptive tracking control is addressed for a class of nonlinear systems with parametric uncertainty, unknown actuator nonlinearity and disturbance. Two type of actuator nonlinearities, that is, backlash-like hysteresis and symmetric deadzone, are considered simultaneously. Without constructing the inverse function of actuator nonlinearity, unified control framework...

We solve a long-term contracting problem with symmetric uncertainty about the agent’s quality, and a hidden action of the agent. As information about quality accumulates, incentives become easier to provide because the agent has less room to manipulate the principal’s beliefs. This result is opposite to that in the literature on "career concerns" in which incentives via short-term contracts bec...

We take a critical look at security models that are often used to give “provable security” guarantees. We pay particular attention to digital signatures, symmetric-key encryption, and leakage resilience. We find that there has been a surprising amount of uncertainty about what the “right” definitions might be. Even when definitions have an appealing logical elegance and nicely reflect certain n...

A general sampling problem can be described by an Ellsberg urn, which is a mathematical model that assumes balls are randomly drawn from urn with uncertain numbers of colored balls. This means the essentially intricate simultaneous randomness and epistemic uncertainty, this core discussed in paper. Since practical usually processed environment, solution for equivalent necessary. Suppose contain...

BACKGROUND Uncertainty and predictability have remained at the center of the study of human attention. Yet, studies have only examined whether response times (RT) or fixations were longer or shorter under levels of stimulus uncertainty. To date, no study has examined patterns of stimuli and responses through a unifying framework of uncertainty. METHODOLOGY/PRINCIPAL FINDINGS We asked 29 colle...

a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

we give a survey of recent applications of group rings to combinatorics and tocryptography, including their use in the di erential cryptanalysis of block ciphers.

a kernel $j$ of a digraph $d$ is an independent set of vertices of $d$ such that for every vertex $w,in,v(d),setminus,j$ there exists an arc from $w$ to a vertex in $j.$in this paper, among other results, a characterization of $2$-regular circulant digraph having a kernel is obtained. this characterization is a partial solution to the following problem: characterize circulant digraphs which hav...

Let $Rin textbf{C}^{mtimes m}$ and $Sin textbf{C}^{ntimes n}$ be nontrivial involution matrices; i.e., $R=R^{-1}neq pm~I$ and $S=S^{-1}neq pm~I$. An $mtimes n$ complex matrix $A$ is said to be an $(R, S)$-symmetric ($(R, S)$-skew symmetric) matrix if $RAS =A$ ($ RAS =-A$). The $(R, S)$-symmetric and $(R, S)$-skew symmetric matrices have a number of special properties and widely used in eng...

We classify self-adjoint first-order differential operators on weighted Bergman spaces the unit disc and answer questions related to uncertainty principles for such operators. Our main tools are discrete series representations of $$\textrm{SU}(1,1)$$ . This approach has promise generalize other bounded symmetric domains.