There is a growing body of research focusing on automatic detection of ischemia and myocardial infarction (MI) using computer algorithms. In clinical settings, ischemia and MI are diagnosed using electrocardiogram (ECG) recordings as well as medical context including patient symptoms, medical history, and risk factors-information that is often stored in the electronic health records. The ECG signal is inspected to identify changes in the morphology such as ST-segment deviation and T-wave changes. Some of the proposed methods compute similar features automatically while others use nonconventional features such as wavelet coefficients. This review provides an overview of the methods that have been proposed in this area, focusing on their historical evolution, the publicly available datasets that they have used to evaluate their performance, and the details of their algorithms for ECG and EHR analysis. The validation strategies that have been used to evaluate the performance of the proposed methods are also presented. Finally, the paper provides recommendations for future research to address the shortcomings of the currently existing methods and practical considerations to make the proposed technical solutions applicable in clinical practice.

In August 2015 the cryptographic world was shaken by a sudden and surprising announcement by the US National Security Agency (NSA) concerning plans to transition to post-quantum algorithms. Since this announcement post-quantum cryptography has become a topic of primary interest for several standardization bodies. The transition from the currently deployed public-key algorithms to post-quantum algorithms has been found to be challenging in many aspects. In particular the problem of evaluating the quantum-bit security of such post-quantum cryptosystems remains vastly open. Of course this question is of primarily concern in the process of standardizing the post-quantum cryptosystems. In this paper we consider the quantum security of the problem of solving a system of m Boolean multivariate quadratic equations in n variables (MQ2); a central problem in postquantum cryptography. When n = m, under a natural algebraic assumption, we present a Las-Vegas quantum algorithm solving MQ2 that requires the evaluation of, on average, O(2 0.462n ) quantum gates. To our knowledge this is the fastest algorithm for solving MQ2.

In this paper we discuss the Hidden Subgroup Problem (HSP) in relation to post-quantum cryptography. We review the relationship between HSP and other computational problems discuss an optimal solution method, and review the known results about the quantum complexity of HSP. We also overview some platforms for group-based cryptosystems. Notably, efficient algorithms for solving HSP in the proposed infinite group platforms are not yet known.

No abstract