1.1k citations
- Institute for Research in Fundamental SciencesIR578 papers
- Centre National de la Recherche ScientifiqueFR221 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di NapoliIT204 papers
- California Institute of TechnologyUS193 papers
- The Ohio State UniversityUS193 papers
- University of WarsawPL190 papers
- Isfahan University of TechnologyIR188 papers
- TU WienAT172 papers
- Universität HamburgDE172 papers
- University of California, Santa BarbaraUS164 papers
- University of Notre DameUS162 papers
- Texas A&M UniversityUS161 papers
120 papers · 1 filter
Correction to black hole radiation due to pair annihilation
Moslem Shafiee
We consider the emission of charged scalar particles from a Schwarzschild black hole. It is shown that these particles can interact with each other through pair annihilation, and a…
A Modeling Framework for Reliability of Erasure Codes in SSD Arrays
Mostafa Kishani, Saba Ahmadian, Hossein Asadi
To help reliability of SSD arrays, Redundant Array of Independent Disks (RAID) are commonly employed. However, the conventional reliability models of HDD RAID cannot be applied to…
Dependability Analysis of Data Storage Systems in Presence of Soft Errors
Mostafa Kishani, Mehdi Tahoori, Hossein Asadi
In recent years, high availability and reliability of Data Storage Systems (DSS) have been significantly threatened by soft errors occurring in storage controllers. Due to their sp…
On the prescribed-time attractivity and frozen-time eigenvalues of linear time-varying systems
Amir Shakouri
A system is called prescribed-time attractive if its solution converges at an arbitrary user-defined finite time. In this note, necessary and sufficient conditions are developed fo…
A Framework for Prescribed-Time Control Design via Time-Scale Transformation
Amir Shakouri, Nima Assadian
This letter presents a unified framework for the design of prescribed-time controllers under time-varying input and state constraints for normal-form unknown nonlinear systems with…
A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery
Arash Vaezi, Mohammad Ghodsi
Given a simple polygon , in the Art Gallery problem the goal is to find the minimum number of guards needed to cover the entire , where a guard is a point and can s…