New opportunities for quantitative and time efficient 3D MRI of liquid and solid electrochemical cell components: Sectoral Fast Spin Echo and SPRITE.

The ability to image electrochemical processes in situ using nuclear magnetic resonance imaging (MRI) offers exciting possibilities for understanding and optimizing materials in batteries, fuel cells and supercapacitors. In these applications, however, the quality of the MRI measurement is inherently limited by the presence of conductive elements in the cell or device. To overcome related difficulties, optimal methodologies have to be employed. We show that time-efficient three dimensional (3D) imaging of liquid and solid lithium battery components can be performed by Sectoral Fast Spin Echo and Single Point Imaging with T1 Enhancement (SPRITE), respectively. The former method is based on the generalized phase encoding concept employed in clinical MRI, which we have adapted and optimized for materials science and electrochemistry applications. Hard radio frequency pulses, short echo spacing and centrically ordered sectoral phase encoding ensure accurate and time-efficient full volume imaging. Mapping of density, diffusivity and relaxation time constants in metal-containing liquid electrolytes is demonstrated. 1, 2 and 3D SPRITE approaches show strong potential for rapid high resolution (7)Li MRI of lithium electrode components.

Fast one-class support vector machine for novelty detection

Novelty detection arises as an important learning task in several applications. Kernel-based approach to novelty detection has been widely used due to its theoretical rigor and elegance of geometric interpretation. However, computational complexity is a major obstacle in this approach. In this paper, leveraging on the cutting-plane framework with the well-known One-Class Support Vector Machine, we present a new solution that can scale up seamlessly with data. The first solution is exact and linear when viewed through the cutting-plane; the second employed a sampling strategy that remarkably has a constant computational complexity defined relatively to the probability of approximation accuracy. Several datasets are benchmarked to demonstrate the credibility of our framework.

Multiplexed detection: fast comprehensive sample analysis of tobacco leaf extracts using HPLC with AFT columns

Detector-based comprehensive screening analysis of complex samples of natural origin using High Performance Liquid Chromatography (HPLC) can be a complicated and time-consuming task. There are a number of ways multidetection characterization can be achieved; however, there are limitations associated with each technique. Active Flow Technology (AFT) in Parallel Segmented Flow (PSF) mode allows for multiplexed detection HPLC analysis within a single injection, whereas maintaining chromatographic performance and allowing the use of multiple destructive detectors to achieve a comprehensive yet efficient screening of a complex sample. In this study, a comprehensive characterization analysis of tobacco leaf extract was carried out through multiplexed detection using a PSF column for the detection of biomolecules by UV-Vis detection, DPPH• for reactive-oxygen species (ROS) detection, and mass spectrometry, the latter two detection methods being sample destructive.

Fast and scalable counterfeits estimation for large-scale RFID systems

Many algorithms have been introduced to deterministically authenticate Radio Frequency Identification (RFID) tags, while little work has been done to address scalability issue in batch authentications. Deterministic approaches verify tags one by one, and the communication overhead and time cost grow linearly with increasing size of tags. We design a fast and scalable counterfeits estimation scheme, INformative Counting (INC), which achieves sublinear authentication time and communication cost in batch verifications. The key novelty of INC builds on an FM-Sketch variant authentication synopsis that can capture key counting information using only sublinear space. With the help of this well-designed data structure, INC is able to provide authentication results with accurate estimates of the number of counterfeiting tags and genuine tags, while previous batch authentication methods merely provide 0/1 results indicating the existence of counterfeits. We conduct detailed theoretical analysis and extensive experiments to examine this design and the results show that INC significantly outperforms previous work in terms of effectiveness and efficiency.

On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics

The use of the fast Fourier transform (FFT) accelerates Lanczos tridiagonalisation method for Hankel and Toeplitz matrices by reducing the complexity of matrix-vector multiplication. In multiprecision arithmetics, the FFT has overheads that make it less competitive compared with alternative methods when the accuracy is over 10000 decimal places. We studied two alternative Hankel matrix-vector multiplication methods based on multiprecision number decomposition and recursive Karatsuba-like multiplication, respectively. The first method was uncompetitive because of huge precision losses, while the second turned out to be five to 14 times faster than FFT in the ranges of matrix sizes up to n = 8192 and working precision of b = 32768 bits we were interested in. We successfully applied our approach to eigenvalues calculations to studies of spectra of matrices that arise in research on Riemann zeta function. The recursive matrix-vector multiplication significantly outperformed both the FFT and the traditional multiplication in these studies.

A fast non-smooth nonnegative matrix factorization for learning sparse representation

Nonnegative matrix factorization (NMF) is a hot topic in machine learning and data processing. Recently, a constrained version, non-smooth NMF (NsNMF), shows a great potential in learning meaningful sparse representation of the observed data. However, it suffers from a slow linear convergence rate, discouraging its applications to large-scale data representation. In this paper, a fast NsNMF (FNsNMF) algorithm is proposed to speed up NsNMF. In the proposed method, it first shows that the cost function of the derived sub-problem is convex and the corresponding gradient is Lipschitz continuous. Then, the optimization to this function is replaced by solving a proximal function, which is designed based on the Lipschitz constant and can be solved through utilizing a constructed fast convergent sequence. Due to the usage of the proximal function and its efficient optimization, our method can achieve a nonlinear convergence rate, much faster than NsNMF. Simulations in both computer generated data and the real-world data show the advantages of our algorithm over the compared methods.