QRP: An improved secure authentication method using QR codes

This paper presents the design and implementation of QRP, an open source proof-of-concept authentication system that uses a two-factorauthentication by combining a password and a camera-equipped mobile phone, acting as an authentication token. QRP is extremely secure asall the sensitive information stored and transmitted is encrypted, but it isalso an easy to use and cost-efficient solution. QRP is portable and can be used securely in untrusted computers. Finally, QRP is able to successfully authenticate even when the phone is offline.

When should clinicians search for GLUT1 deficiency syndrome in childhood generalized epilepsies?

UNLABELLED: GLUT1 deficiency (GLUT1D) has recently been identified as an important cause of generalized epilepsies in childhood. As it is a treatable condition, it is crucial to determine which patients should be investigated. METHODS: We analyzed SLC2A1 for mutations in a group of 93 unrelated children with generalized epilepsies. Fasting lumbar puncture was performed following the identification of a mutation. We compared our results with a systematic review of 7 publications of series of patients with generalized epilepsies screened for SLC2A1 mutations. RESULTS: We found 2/93 (2.1%) patients with a SLC2A1 mutation. One, carrying a novel de novo deletion had epilepsy with myoclonic-atonic seizures (MAE), mild slowing of head growth, choreiform movements and developmental delay. The other, with a paternally inherited missense mutation, had childhood absence epilepsy with atypical EEG features and paroxysmal exercise-induced dyskinesia (PED) initially misdiagnosed as myoclonic seizures. Out of a total of 1110 screened patients with generalized epilepsies from 7 studies, 2.4% (29/1110) had GLUT1D. This rate was higher (5.6%) among 303 patients with early onset absence epilepsy (EOAE) from 4 studies. About 50% of GLUT1D patients had abnormal movements and 41% a family history of seizures, abnormal movements or both. CONCLUSION: GLUT1D is most likely to be found in MAE and in EOAE. The probability of finding GLUT1D in the classical idiopathic generalized epilepsies is very low. Pointers to GLUT1D include an increase in seizures before meals, cognitive impairment, or PED which can easily be overlooked.

Portafolio selection with skewness: a comparison of methods and a generalized two fund separation result

This contribution compares existing and newly developed techniques for geometrically representing mean-variances-kewness portfolio frontiers based on the rather widely adapted methodology of polynomial goal programming (PGP) on the one hand and the more recent approach based on the shortage function on the other hand. Moreover, we explain the working of these different methodologies in detail and provide graphical illustrations. Inspired by these illustrations, we prove a generalization of the well-known two fund separation theorem from traditionalmean-variance portfolio theory.

Generalized food-deceptive orchid species flower earlier and occur at lower altitudes than rewarding ones

Aims Food-deceptive pollination, in which plants do not offer any food reward to their pollinators, is common within the Orchidaceae. As food-deceptive orchids are poorer competitors for pollinator visitation than rewarding orchids, their occurrence in a given habitat may be more constrained than that of rewarding orchids. In particular, the success of deceptive orchids strongly relies on several biotic factors such as interactions with co-flowering rewarding species and pollinators, which may vary with altitude and over time. Our study compares generalized food-deceptive (i.e. excluding sexually deceptive) and rewarding orchids to test whether (i) deceptive orchids flower earlier compared to their rewarding counterparts and whether (ii) the relative occurrence of deceptive orchids decreases with increasing altitude. Methods To compare the flowering phenology of rewarding and deceptive orchids, we analysed data compiled from the literature at the species level over the occidental Palaearctic area. Since flowering phenology can be constrained by the latitudinal distribution of the species and by their phylogenetic relationships, we accounted for these factors in our analysis. To compare the altitudinal distribution of rewarding and deceptive orchids, we used field observations made over the entire Swiss territory and over two Swiss mountain ranges. Important Findings We found that deceptive orchid species start flowering earlier than rewarding orchids do, which is in accordance with the hypotheses of exploitation of naive pollinators and/or avoidance of competition with rewarding co-occurring species. Also, the relative frequency of deceptive orchids decreases with altitude, suggesting that deception may be less profitable at high compared to low altitude.

Reliable and persistent storage for CoDeS a distributed collaborative system

This research is aimed to find a solution for a distributed storage system adapted for CoDeS. By studying how DSSs work and how they are implemented, we can conclude how we can implement a DSS compatible with CoDeS requirements.

A generalized mechanistic codon model.

Models of codon evolution have attracted particular interest because of their unique capabilities to detect selection forces and their high fit when applied to sequence evolution. We described here a novel approach for modeling codon evolution, which is based on Kronecker product of matrices. The 61 × 61 codon substitution rate matrix is created using Kronecker product of three 4 × 4 nucleotide substitution matrices, the equilibrium frequency of codons, and the selection rate parameter. The entities of the nucleotide substitution matrices and selection rate are considered as parameters of the model, which are optimized by maximum likelihood. Our fully mechanistic model allows the instantaneous substitution matrix between codons to be fully estimated with only 19 parameters instead of 3,721, by using the biological interdependence existing between positions within codons. We illustrate the properties of our models using computer simulations and assessed its relevance by comparing the AICc measures of our model and other models of codon evolution on simulations and a large range of empirical data sets. We show that our model fits most biological data better compared with the current codon models. Furthermore, the parameters in our model can be interpreted in a similar way as the exchangeability rates found in empirical codon models.

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.

On fast-decodable space-time block codes

We focus on full-rate, fast-decodable space–time block codes (STBCs) for 2 x 2 and 4 x 2 multiple-input multiple-output (MIMO) transmission. We first derive conditions and design criteria for reduced-complexity maximum-likelihood (ML) decodable 2 x 2 STBCs, and we apply them to two families of codes that were recently discovered. Next, we derive a novel reduced-complexity 4 x 2 STBC, and show that it outperforms all previously known codes with certain constellations.