Context-awareness for mobile sensing: a survey and future directions

The evolution of smartphones together with increasing computational power have empowered developers to create innovative context-aware applications for recognizing user related social and cognitive activities in any situation and at any location. The existence and awareness of the context provides the capability of being conscious of physical environments or situations around mobile device users. This allows network services to respond proactively and intelligently based on such awareness. The key idea behind context-aware applications is to encourage users to collect, analyze and share local sensory knowledge in the purpose for a large scale community use by creating a smart network. The desired network is capable of making autonomous logical decisions to actuate environmental objects, and also assist individuals. However, many open challenges remain, which are mostly arisen due to the middleware services provided in mobile devices have limited resources in terms of power, memory and bandwidth. Thus, it becomes critically important to study how the drawbacks can be elaborated and resolved, and at the same time better understand the opportunities for the research community to contribute to the context-awareness. To this end, this paper surveys the literature over the period of 1991-2014 from the emerging concepts to applications of context-awareness in mobile platforms by providing up-to-date research and future research directions. Moreover, it points out the challenges faced in this regard and enlighten them by proposing possible solutions

Grain-boundary grooving and agglomeration of alloy thin films with a slow-diffusing species

We present a general phase-field model for grain-boundary grooving and agglomeration of polycrystalline alloy thin films. In particular, we study the effects of slow-diffusing species on grooving rate. As the groove grows, the slow species becomes concentrated near the groove tip so that further grooving is limited by the rate at which it diffuses away from the tip. At early times the dominant diffusion path is along the boundary, while at late times it is parallel to the substrate. This change in path strongly affects the time-dependence of grain boundary grooving and increases the time to agglomeration. The present model provides a tool for agglomeration-resistant thin film alloy design. keywords: phase-field, thermal grooving, diffusion, kinetics, metal silicidesComment: 4 pages, 6 figure

Supersymmetric Runge-Lenz-Pauli vector for Dirac vortex in topological insulators and graphene

The Dirac mass-vortex at the surface of a topological insulator or in graphene is considered. Within the linear approximation for the vortex amplitude's radial dependence, the spectrum is a series of degenerate bound states, which can be classified by a set of accidental SU(2) and supersymmetry generators (I. F. Herbut and C.-K. Lu, Phys. Rev. B 83 125412 (2011)). Here we discuss further the properties and manifestations of the supersymmetry of the vortex Hamiltonian, and point out some interesting analogies to the Runge-Lenz-Pauli vector in the non-relativistic hydrogen atom. Symmetry breaking effects due to a finite chemical potential, and the Zeeman field are also analyzed. We find that a residual accidental degeneracy remains only in the special case of equal magnitudes of both terms, whereas otherwise it becomes removed entirely.Comment: revised version with added reference and a new paragraph on interpretation of two-velocity Weyl fermions realized in 2D optical lattice; to appear in J Phys

Computing A Glimpse of Randomness

A Chaitin Omega number is the halting probability of a universal Chaitin (self-delimiting Turing) machine. Every Omega number is both computably enumerable (the limit of a computable, increasing, converging sequence of rationals) and random (its binary expansion is an algorithmic random sequence). In particular, every Omega number is strongly non-computable. The aim of this paper is to describe a procedure, which combines Java programming and mathematical proofs, for computing the exact values of the first 64 bits of a Chaitin Omega: 0000001000000100000110001000011010001111110010111011101000010000. Full description of programs and proofs will be given elsewhere.Comment: 16 pages; Experimental Mathematics (accepted

A balanced homodyne detector for high-rate Gaussian-modulated coherent-state quantum key distribution

We discuss excess noise contributions of a practical balanced homodyne detector in Gaussian-modulated coherent-state (GMCS) quantum key distribution (QKD). We point out the key generated from the original realistic model of GMCS QKD may not be secure. In our refined realistic model, we take into account excess noise due to the finite bandwidth of the homodyne detector and the fluctuation of the local oscillator. A high speed balanced homodyne detector suitable for GMCS QKD in the telecommunication wavelength region is built and experimentally tested. The 3dB bandwidth of the balanced homodyne detector is found to be 104MHz and its electronic noise level is 13dB below the shot noise at a local oscillator level of 8.5*10^8 photon per pulse. The secure key rate of a GMCS QKD experiment with this homodyne detector is expected to reach Mbits/s over a few kilometers.Comment: 22 pages, 11 figure

The reinforcing influence of recommendations on global diversification

Recommender systems are promising ways to filter the overabundant information in modern society. Their algorithms help individuals to explore decent items, but it is unclear how they allocate popularity among items. In this paper, we simulate successive recommendations and measure their influence on the dispersion of item popularity by Gini coefficient. Our result indicates that local diffusion and collaborative filtering reinforce the popularity of hot items, widening the popularity dispersion. On the other hand, the heat conduction algorithm increases the popularity of the niche items and generates smaller dispersion of item popularity. Simulations are compared to mean-field predictions. Our results suggest that recommender systems have reinforcing influence on global diversification.Comment: 6 pages, 6 figure

Clamping and interlocking effects on IBS block house system in comparison with conventional house system

Industrialised Building System (IBS) is a unique construction technique that has been implemented in many construction fields all around the world. However, its implementation in Malaysia is still slow and not effective. Through the research on IBS, some elements are found to be important and need to be improved in order to produce better quality components. One of the important elements is the design and innovation of IBS components by applying new interlocking configuration between blocks and by using a clamping bolted connection to the system. The main objective of this research is to determine the structural behavior of IBS block works sub-system under push over cyclic loading in comparison with conventional sub-system and to verify that the IBS interlocking geometry sub-system perform better than other sub-systems via laboratory tests. In this research, a block work assembly to form building sub-frame that integrated by two beams, two columns and infill system were built and tested to failure. Two types of IBS block work sub-systems with original geometry and interlocking geometry with scaled of 1:5 were tested with Push Over Cyclic Load Test. In comparison, a control model of Conventional Sub-System was also tested and analysed using the same methods. The results showed that the IBS geometry model with interlocking configuration performed better in terms of stiffness, ductility and flexibility of the models. The IBS original geometry model is ductile but lack structural stiffness while the conventional model is stiff but not ductile

On the geometric distance between quantum states with positive partial transposition and private states

We prove an analytic positive lower bound for the geometric distance between entangled positive partial transpose (PPT) states of a broad class and any private state that delivers one secure key bit. Our proof holds for any Hilbert space of finite dimension. Although our result is proven for a specific class of PPT states, we show that our bound nonetheless holds for all known entangled PPT states with non-zero distillable key rates whether or not they are in our special class.Comment: 16 page