Blockwise-adaptive chosen-plaintext and chosen-ciphertext attack are new models for cryptanalytic adversaries, first discovered by Joux, et al [JMV02], and describe a vulnerability in SSH discovered by Bellare, et al [BKN02]. Unlike traditional chosen-plaintext (CPA) or chosenciphertext (CCA) adversaries, the blockwise adversary can submit individual blocks for encryption or decryption rather t...

In this paper, the dynamics of discrete triopoly game with heterogeneous players has been studied. In this game, three players with different expectations were used to iterate the dynamic game. The three players were considered to be: boundedly rational, adaptive and naive. The investigation of the fixed points and their stability, bifurcation diagrams, strange attractors and chaotic behavior w...

We study the robust and adaptive maximum network flow problem in an uncertain environment where parameters (e.g., capacities) are known deterministic, but structure edges) is vulnerable to adversarial attacks or failures. propose a sustainable model effectively proactively counter plausible attacking behaviors of adversary operating under budget constraint. Specifically, we introduce novel scen...

Cluster behavior is prevalent in nature. Many individuals change their to adapt a dynamically changing environment by following simple rules of and interacting with information from neighboring individuals. In this study, the traditional public goods game model improved combining advantages theory interactive learning. A strategy adaptive evolution method based on proposed. The emergence cooper...

Successfully promoting engagement within learning environments is a subject of increasing attention within the AI in Education community. Evidence is mounting that game-based learning environments hold great potential to engage students, but disengaged behavior is still observed. Devising adaptive strategies to re-engage students in the learning task is a key open research question. Toward that...

a {em roman dominating function} on a graph $g = (v ,e)$ is a function $f : vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. the {em weight} of a roman dominating function is the value $w(f)=sum_{vin v}f(v)$. the roman domination number of a graph $g$, denoted by $gamma_r(g)$, equals the...