This paper describes a new model for presenting local information based on the network proximity. We present a novelty mobile mashup which combines Wi-Fi proximity measurements with QR-codes. Our mobile mashup automatically adds context information the content presented by QR-codes. It simplifies the deployment schemes and allows to use unified presentation for all data points, for example. Thi...

In the year 2000 the dominant method for solving matrix eigen-value problems is still the QR algorithm. This paper discusses the family of GR algorithms, with emphasis on the QR algorithm. Included are historical remarks, an outline of what GR algorithms are and why they work, and descriptions of the latest, highly parallelizable, versions of the QR algorithm. Now that we know how to paralleliz...

The QR algorithm is still one of the most important methods for computing eigenvalues and eigenvectors of matrices. Most discussions of the QR algorithm begin with a very basic version and move by steps toward the versions of the algorithm that are actually used. This paper outlines a pedagogical path that leads directly to the implicit multishift QR algorithms that are used in practice, bypass...

Nowadays, mobile devices and applications offer new possibilities to learn anytime and anywhere. These technologies caused a disruption in traditional learning, opening up a new range of opportunities for learning at the workplace. Quick Response (QR) codes are one example of technology popularized with the adoption of mobile devices. When attached to an object or location, QR codes add a digit...

This paper introduces the concept of QR codes, an automatic method to hide information using QR codes and to embed QR codes into colour images with bounded probability of detection error.The embedding methods are designed to be compatible with standard decoding applications and can be applied to any colour or gray scale image with full area coverage. The embedding method consists of two compone...

Library software implementing a parallel small-bulge multishift QR algorithm with aggressive early deflation (AED) targeting distributed memory high-performance computing systems is presented. Starting from recent developments of the parallel multishift QR algorithm [Granat et al., SIAM J. Sci. Comput. 32(4), 2010], we describe a number of algorithmic and implementation improvements. These incl...

The DNA-mediated self-assembly of CdSe/CdS quantum rods (QRs) onto DNA origami is described. Two QR types with unique optical emission and high polarization were synthesized, and then functionalized with oligonucleotides (ssDNA) using a novel protection-deprotection approach, which harnessed ssDNA's tailorable rigidity and denaturation temperature to increase DNA coverage by reducing non-specif...

Principal Component Analysis (PCA) plus Linear Discriminant Analysis (LDA) (PCA+LDA) and LDA/QR are both two-stage methods that deal with the small sample size (SSS) problem in traditional LDA. When applied to face recognition under varying lighting conditions and different facial expressions, neither method may work robustly due to limited number of training samples for each class in the train...

A method for systematic synthesis of quasi-resonant (QR) topologies by addition of resonant elements to a parent PWM converter network is proposed. It is found that there are six QR classes with two resonant elements, including two novel classes. More complex QR converters can be generated by a recursive application of the synthesis method. Topological definitions of all known and novel QR clas...