Resource
2019 EN
Moein Sarvaghad-Moghaddam · Ali A. Orouji · Zeinab Ramezani
+2 more
Power dissipation is known as the most notable limiting factor in allnano-electronic design techniques including Quantum-dot Cellular Automata(QCA). The familiar reversible computing approach is used as a reasonablyreliable solution, mitigating power dissipation. This study presents, acomprehensive multi-objective method for designing R-Fs in emerging QCAtechnology. The results are investigated in both logical and layout levels, indetail. The results verify that the approach offered in this study hasadvantage over the most efficient approaches available in the literature byfar. This comparison can be made on various parameters ranging from area,complexity (cell amount), delay (clocking zones), and to even logical levelsincluding levels, Control inputs, the number of majority and NOT gates.
Resource
2019 EN
Moein Sarvaghad-Moghaddam · Zeinab Ramezani · IS Amiri
In this work, a novel protocol is proposed for bidirectional controlledquantum teleportation (BCQT) in which a quantum channel is used with theeight-qubit entangled state. Using the protocol, two users can teleport anarbitrary entangled state and a pure two-qubit state (QBS) to each othersimultaneously under the permission of a third party in the role of controller.This protocol is based on the controlled-not operation, appropriatesingle-qubit (SIQ) UOs and SIQ measurements in the Z and X-basis. Reduction ofthe predictability of the controller's qubit (QB) by the eavesdropper and also,an increasing degree of freedom of controller for controlling one of the usersor both are other features of this protocol. Then, the proposed protocol isinvestigated in two typical noisy channels include the amplitude-damping noise(ADN) and the phase-damping noise (PDN). And finally, analysis of the protocolshows that it only depends on the amplitude of the initial state and thedecoherence noisy rate (DR).
Resource
2019 EN
Zeinab Galal · Tobias Kaiser · Patrick Speissegger
We construct a Hardy field that contains Ilyashenko's class of germs atinfinity of almost regular functions as well as all log-exp-analytic germs. Inaddition, each germ in this Hardy field is uniquely characterized by anasymptotic expansion that is an LE-series as defined by van den Dries et al. Asthese series generally have support of order type larger than that of the setof natural numbers, the notion of asymptotic expansion itself needs to begeneralized.
Resource
2019 EN
Zeinab Bakhtiari · Hans van Ditmarsch · Abdallah Saffidine
We propose a framework for strategic voting when a voter may lack knowledgeabout the preferences of other voters, or about other voters' knowledge abouther own preference. In this setting we define notions of manipulation,equilibrium, and dominance, under uncertainty. We provide scenarios wherein theprofiles of true preferences are the same but the equilibrium profiles aredifferent, because the voters have different knowledge about other voters. Wealso model actions that change such uncertainty about preferences, such as avoter revealing her preference. We show that some forms of manipulation andequilibrium are preserved under such uncertainty updates and others not. Wethen formalize epistemic voting terminology in a logic. Our aim is to providethe epistemic background for the analysis and design of voting rules thatincorporate uncertainty.
Resource
2019 EN
Zeinab Karaki
We consider the Fokker-Planck equation with a strong external magnetic field.Global-in-time solutions are built near the Maxwellian, the global equilibriumstate for the system. Moreover, we prove the convergence to equilibrium atexponential rate. The results are first obtained on spaces with an exponentialweight. Then they are extended to larger functional spaces, like the Lebesguespace and the Sobolev space with polynomial weight, by the method offactorization and enlargement of the functional space developed in [Gualdani,Mischler, Mouhot, 2017].
Resource
2019 EN
Zeinab Karaki
We consider the Vlasov-Fokker-Planck operator with a strong external magneticfield. We show a maximal type estimate on this operator using a nilpotentapproach on vector field polynomial operators and including the notion ofrepresentation on a Lie algebra. This estimate makes it possible to give abetter characterization of the domain of the closure of the consideredoperator.
Resource
2019 EN
Afsaneh Bahri · Behrooz Khosravi · Zeinab Akhlaghi
Let $G$ be a finite group and $\psi(G)=\sum_{g\in{G}}{o(g)}$. There are someresults about the relation between $\psi(G)$ and the structure of $G$. Forinstance, it is proved that if $G$ is a group of order $n$ and$\psi(G)>\dfrac{211}{1617}\psi(C_n)$, then $G$ is solvable. Herzog {\it{etal.}} in [Herzog {\it{et al.}}, Two new criteria for solvability of finitegroups, J. Algebra, 2018] put forward the following conjecture: \noindent{\bf Conjecture.} {\it {If $G$ is a non-solvable group of order $n$,then $${\psi(G)}\,{\leq}\,{{\dfrac{211}{1617}}{\psi(C_n)}}$$ with equality ifand only if $G=A_5$. In particular, this inequality holds for all non-abeliansimple groups.} } In this paper, we prove a modified version of Herzog's Conjecture.
Resource
2019 EN
Burak Gerislioglu · Zeinab Ramezani · S. Amir Ghoreishi
+1 more
Plasmonic metamaterials can be used to enhance mid-infrared sensors anddetectors for immunosensing applications. The major challenge is to integratethese technologies in low-cost, compact, and promising platforms. In thisstudy, as an emerging approach, we utilized toroidal resonant plasmonicmetasurfaces to develop an ultrasensitive label-free analytical platform forthe detection of specific antibiotics in the mid-IR regime. Taking advantage ofunique sensitivity of robustly squeezed electromagnetic fields in toroidalmeta-atoms, we validated that our proposed technique based on toroidalmetastructures can provide sensing of biological targets with the weight of~0.6 KDa at attomolar concentrations. We believe that this understandingextends the capabilities of plasmonic metamaterials analyze the presence ofspecific biological targets with high precision.
Resource
2019 EN
DILS, UPD Zeinab Nehai · DILS François Bobot
A bug or error is a common problem that any software or computer program mayencounter. It can occur from badly writing the program, a typing error or badmemory management. However, errors can become a significant issue if the unsafeprogram is used for critical systems. Therefore, formal methods for these kindsof systems are greatly required. In this paper, we use a formal language thatperforms deductive verification on an Ethereum Blockchain application based onsmart contracts, which are self-executing digital contracts. Blockchain systemsmanipulate cryptocurrency and transaction information. Therefore , if a bugoccurs in the blockchain, serious consequences such as a loss of money canhappen. Thus, the aim of this paper is to propose a language dedicated todeductive verification, called Why3, as a new language for writing formal andverified smart contracts, thereby avoiding attacks exploiting such contractexecution vulnerabilities. We first write a Why3 smart contracts program; nextwe formulate specifications to be proved as absence of RunTime Error propertiesand functional properties, then we verify the behavior of the program using theWhy3 system. Finally we compile the Why3 contracts to the Ethereum VirtualMachine (EVM). Moreover, we give a set of generic mathematical statements thatallows verifying functional properties suited to any type of smart contractsholding cryptocurrency, showing that Why3 can be a suitable language to writesmart contracts. To illustrate our approach, we describe its application to arealistic industrial use case.
Resource
2019 EN
Zeinab Mahmoudi · Dimitri Boiroux · Tobias K. S. Ritschel
+1 more
In this paper we numerically assess the performance of Java linear algebralibraries for the implementation of nonlinear filters in an Android smart phone(Samsung A5 2017). We implemented a linear Kalman filter (KF), an extendedKalman filter (EKF), and an unscented Kalman filter (UKF). These filters areused for state and parameter estimation, as well as fault detection and mealdetection in an artificial pancreas. We present the state estimationtechnologies used for glucose estimation based on a continuous glucose monitor(CGM). We compared three linear algebra libraries: The Efficient Java MatrixLibrary (EJML), JAMA and Apache Common Math. Overall, EJML provides the bestperformance for linear algebra operations. We demonstrate the implementationand performance of filtering (KF, EKF and UKF) using real CGM data.