Privacy and verifiability are crucial security requirements in e-voting systems combining them is considered to be a challenge given that they seem contradictory. On one hand, privacy means cast votes cannot traced the corresponding voters. other linkability of voters their requirement which has consequence voter able check vote election result. These two contradictory features can addressed by...

This paper aims to discuss and analyze the potentialities of Recurrent Neural Networks (RNN) in control design applications. The main families RNN are considered, namely Nonlinear AutoRegressive eXogenous, (NNARX), Echo State (ESN), Long Short Term Memory (LSTM), Gated Units (GRU). goal is twofold. Firstly, survey recent results concerning training that enjoy Input-to-State Stability (ISS) Incr...

We study implementation in environments where agents have limited ability to imitate others. Agents are randomly and privately endowed with type-dependent sets of messages. So sending a message becomes a partial proof regarding type. For environments where agents can send any combination of available messages, we develop an Extended Revelation Principle and characterize the incentive constraint...

In this paper, we focus on the mathematical foundations of reduced order model (ROM) closures. First, extend verifiability concept from large eddy simulation to ROM setting. Specifically, call a closure verifiable if small error (i.e., difference between true and modeled closure) implies error. Second, prove that data-driven studied here variational multiscale ROM) is verifiable. Finally, inves...