This article proposes an algorithm which allows Alice to simulate the game played between her and Eve. Under condition that set of detectors assumes Eve have is sufficiently rich (e.g. CNNs), she has enabling avoid detection by a single classifier (e.g adversarial embedding, gibbs sampler, dynamic STCs), proposed converges efficient steganographic algorithm. possible using min max strategy cons...

This paper provides an axiomatic characterization of two rules for comparing alternative sets of objects on the basis of the diversity that they offer. The framework considered assumes a finite universe of objects and an a priori given ordinal quadernary relation that compares alternative pairs of objects on the basis of their ordinal dissimilarity. Very few properties of this quadernary relati...

We consider the max-cut problem on a random graph G with n vertices and weights wij being independent bounded random variables with the same xed positive expectation and variance . It is well known that the max-cut number mc(G) always exceeds 2 ∑ i¡j wij . We prove that with probability greater than pn the max-cut number satis es

Safety of technical systems are becoming more and more important nowadays. Fault trees and minimal cut sets are usually used to attack the problems of assessing safety-critical systems. A visualization system named ViSSaAn, consisting of a matrix view, is proposed that supports an efficient safety analysis based on the information from these techniques. Interactions such as zooming and grouping...

Gaussian comparison theorems are useful tools in probability theory; they are essential ingredients in the classical proofs of many results in empirical processes and extreme value theory. More recently, they have been used extensively in the analysis of underdetermined linear inverse problems. A prominent role in the study of those problems is played by Gordon’s Gaussian min-max theorem. It ha...

A short proof of a difficult theorem of P.D. Seymour on grafts with the max-flow min-cut property is given.

Uncertain differential game investigates interactive decision making of players over time and the system dynamics can be described by an uncertain differential equation. This paper goes further to study the two players zero-sum uncertain differential game. In order to guarantee the saddle-point Nash equilibrium, a Max-Min theorem is provided. Furthermore, when the system dynamics is described b...