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.

On the computation of reducible invariant tori on a parallel computer

We present an algorithm for the computation of reducible invariant tori of discrete dynamical systems that is suitable for tori of dimensions larger than 1. It is based on a quadratically convergent scheme that approximates, at the same time, the Fourier series of the torus, its Floquet transformation, and its Floquet matrix. The Floquet matrix describes the linearization of the dynamics around the torus and, hence, its linear stability. The algorithm presents a high degree of parallelism, and the computational effort grows linearly with the number of Fourier modes needed to represent the solution. For these reasons it is a very good option to compute quasi-periodic solutions with several basic frequencies. The paper includes some examples (flows) to show the efficiency of the method in a parallel computer. In these flows we compute invariant tori of dimensions up to 5, by taking suitable sections.

Embedding theorems of funcitional classes, III

In this paper we obtain the necessary and sufficient conditions for embedding results of different function classes. The main result is a criterion for embedding theorems for the so-called generalized Weyl-Nikol'skii class and the generalized Lipschitz class. To define the Weyl-Nikol'skii class, we use the concept of a (λ,β)-derivative, which is a generalization of the derivative in the sense of Weyl. As corollaries, we give estimates of norms and moduli of smoothness of transformed Fourier series.

Elastic scattering of fast electrons and positrons by atoms

Elastic scattering of relativistic electrons and positrons by atoms is considered in the framework of the static field approximation. The scattering field is expressed as a sum of Yukawa terms to allow the use of various approximations. Accurate phase shifts have been computed by combining Bühring¿s power-series method with the WKB and Born approximations. This combined procedure allows the evaluation of differential cross sections for kinetic energies up to several tens of MeV. Numerical results are used to analyze the validity of several approximate methods, namely the first- and second-order Born approximations and the screened Mott formula, which are frequently adopted as the basis of multiple scattering theories and Monte Carlo simulations of electron and positron transport.

Improved nonparametric confidence intervals in time series regressions

Condence intervals in econometric time series regressions suffer fromnotorious coverage problems. This is especially true when the dependencein the data is noticeable and sample sizes are small to moderate, as isoften the case in empirical studies. This paper suggests using thestudentized block bootstrap and discusses practical issues, such as thechoice of the block size. A particular data-dependent method is proposedto automate the method. As a side note, it is pointed out that symmetricconfidence intervals are preferred over equal-tailed ones, since theyexhibit improved coverage accuracy. The improvements in small sampleperformance are supported by a simulation study.

An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

Moduli of smoothness and growth properties of Fourier transforms: two-sided estimates

We prove two-sided inequalities between the integral moduli of smoothness of a function on R d[superscript] / T d[superscript] and the weighted tail-type integrals of its Fourier transform/series. Sharpness of obtained results in particular is given by the equivalence results for functions satisfying certain regular conditions. Applications include a quantitative form of the Riemann-Lebesgue lemma as well as several other questions in approximation theory and the theory of function spaces.

A systematic and feasible method for computing nuclear contributions to electrical properties of polyatomic molecules

An analytic method to evaluate nuclear contributions to electrical properties of polyatomic molecules is presented. Such contributions control changes induced by an electric field on equilibrium geometry (nuclear relaxation contribution) and vibrational motion (vibrational contribution) of a molecular system. Expressions to compute the nuclear contributions have been derived from a power series expansion of the potential energy. These contributions to the electrical properties are given in terms of energy derivatives with respect to normal coordinates, electric field intensity or both. Only one calculation of such derivatives at the field-free equilibrium geometry is required. To show the useful efficiency of the analytical evaluation of electrical properties (the so-called AEEP method), results for calculations on water and pyridine at the SCF/TZ2P and the MP2/TZ2P levels of theory are reported. The results obtained are compared with previous theoretical calculations and with experimental values

Improved estimation of the covariance matrix of stock returns with an application to portofolio selection

This paper proposes to estimate the covariance matrix of stock returnsby an optimally weighted average of two existing estimators: the samplecovariance matrix and single-index covariance matrix. This method isgenerally known as shrinkage, and it is standard in decision theory andin empirical Bayesian statistics. Our shrinkage estimator can be seenas a way to account for extra-market covariance without having to specifyan arbitrary multi-factor structure. For NYSE and AMEX stock returns from1972 to 1995, it can be used to select portfolios with significantly lowerout-of-sample variance than a set of existing estimators, includingmulti-factor models.

¿Son excesivamente suaves las series de contabilidad nacional trimestral?

Este trabajo analiza si las series de Contabilidad Nacional Trimestral de España son excesivamente suaves y, por lo tanto, si son realmente informativas de la evolución de la economía española a corto plazo. Mediante la utilización de las técnicas de análisis espectral se observa que las series trimestrales españolas presentan una variabilidad mayor que las de otros países de la OCDE en el intervalo de frecuencias más bajas (asociadas al comportamiento de la serie a largo plazo ) y una variabilidad menor en el intervalo de frecuencias más altas (asociadas al ruido que contiene la serie). El motivo de este comportamiento diferencial de las series trimestrales españolas se encuentra en el método utilizado por el Instituto Nacional de Estadística por estimar la señal ciclo-tendencia de los indicadores utilizados como referencia, concretamente, el conocido como filtro de líneas aéreas modificado (LAM)

Improved multiexponential transient spectroscopy by iterative deconvolution

The analysis of multiexponential decays is challenging because of their complex nature. When analyzing these signals, not only the parameters, but also the orders of the models, have to be estimated. We present an improved spectroscopic technique specially suited for this purpose. The proposed algorithm combines an iterative linear filter with an iterative deconvolution method. A thorough analysis of the noise effect is presented. The performance is tested with synthetic and experimental data.

¿Son excesivamente suaves las series de contabilidad nacional trimestral?

Este trabajo analiza si las series de Contabilidad Nacional Trimestral de España son excesivamente suaves y, por lo tanto, si son realmente informativas de la evolución de la economía española a corto plazo. Mediante la utilización de las técnicas de análisis espectral se observa que las series trimestrales españolas presentan una variabilidad mayor que las de otros países de la OCDE en el intervalo de frecuencias más bajas (asociadas al comportamiento de la serie a largo plazo ) y una variabilidad menor en el intervalo de frecuencias más altas (asociadas al ruido que contiene la serie). El motivo de este comportamiento diferencial de las series trimestrales españolas se encuentra en el método utilizado por el Instituto Nacional de Estadística por estimar la señal ciclo-tendencia de los indicadores utilizados como referencia, concretamente, el conocido como filtro de líneas aéreas modificado (LAM)

Model-Free Reconstruction of Excitatory Neuronal Connectivity from Calcium Imaging Signals

A systematic assessment of global neural network connectivity through direct electrophysiological assays has remained technically infeasible, even in simpler systems like dissociated neuronal cultures. We introduce an improved algorithmic approach based on Transfer Entropy to reconstruct structural connectivity from network activity monitored through calcium imaging. We focus in this study on the inference of excitatory synaptic links. Based on information theory, our method requires no prior assumptions on the statistics of neuronal firing and neuronal connections. The performance of our algorithm is benchmarked on surrogate time series of calcium fluorescence generated by the simulated dynamics of a network with known ground-truth topology. We find that the functional network topology revealed by Transfer Entropy depends qualitatively on the time-dependent dynamic state of the network (bursting or non-bursting). Thus by conditioning with respect to the global mean activity, we improve the performance of our method. This allows us to focus the analysis to specific dynamical regimes of the network in which the inferred functional connectivity is shaped by monosynaptic excitatory connections, rather than by collective synchrony. Our method can discriminate between actual causal influences between neurons and spurious non-causal correlations due to light scattering artifacts, which inherently affect the quality of fluorescence imaging. Compared to other reconstruction strategies such as cross-correlation or Granger Causality methods, our method based on improved Transfer Entropy is remarkably more accurate. In particular, it provides a good estimation of the excitatory network clustering coefficient, allowing for discrimination between weakly and strongly clustered topologies. Finally, we demonstrate the applicability of our method to analyses of real recordings of in vitro disinhibited cortical cultures where we suggest that excitatory connections are characterized by an elevated level of clustering compared to a random graph (although not extreme) and can be markedly non-local.

Lag-one autocorrelation in short series: Estimation and hypothesis testing

In the first part of the study, nine estimators of the first-order autoregressive parameter are reviewed and a new estimator is proposed. The relationships and discrepancies between the estimators are discussed in order to achieve a clear differentiation. In the second part of the study, the precision in the estimation of autocorrelation is studied. The performance of the ten lag-one autocorrelation estimators is compared in terms of Mean Square Error (combining bias and variance) using data series generated by Monte Carlo simulation. The results show that there is not a single optimal estimator for all conditions, suggesting that the estimator ought to be chosen according to sample size and to the information available of the possible direction of the serial dependence. Additionally, the probability of labelling an actually existing autocorrelation as statistically significant is explored using Monte Carlo sampling. The power estimates obtained are quite similar among the tests associated with the different estimators. These estimates evidence the small probability of detecting autocorrelation in series with less than 20 measurement times.

Improved flooding of broadcast messages using extended multipoint relaying

A common operation in wireless ad hoc networks is the flooding of broadcast messages to establish network topologies and routing tables. The flooding of broadcast messages is, however, a resource consuming process. It might require the retransmission of messages by most network nodes. It is, therefore, very important to optimize this operation. In this paper, we first analyze the multipoint relaying (MPR) flooding mechanism used by the Optimized Link State Routing (OLSR) protocol to distribute topology control (TC) messages among all the system nodes. We then propose a new flooding method, based on the fusion of two key concepts: distance-enabled multipoint relaying and connected dominating set (CDS) flooding. We present experimental simulationsthat show that our approach improves the performance of previous existing proposals.