Search

Recent years have witnessed the fast penetration of Virtual Reality (VR) and Augmented Reality (AR) systems into our daily life, the security and privacy issues of the VR/AR applications have been attracting considerable attention. Most VR/AR systems adopt head-mounted devices (i.e., smart headsets) to interact with users and the devices usually store the users' private data. Hence, authentication schemes are desired for the head-mounted devices. Traditional knowledge-based authentication schemes for general personal devices have been proved vulnerable to shoulder-surfing attacks, especially considering the headsets may block the sight of the users. Although the robustness of the knowledge-based authentication can be improved by designing complicated secret codes in virtual space, this approach induces a compromise of usability. Another choice is to leverage the users' biometrics; however, it either relies on highly advanced equipments which may not always be available in commercial headsets or introduce heavy cognitive load to users. In this paper, we propose a vibration-based authentication scheme, VibHead, for smart headsets. Since the propagation of vibration signals through human heads presents unique patterns for different individuals, VibHead employs a CNN-based model to classify registered legitimate users based the features extracted from the vibration signals. We also design a two-step authentication scheme where the above user classifiers are utilized to distinguish the legitimate user from illegitimate ones. We implement VibHead on a Microsoft HoloLens equipped with a linear motor and an IMU sensor which are commonly used in off-the-shelf personal smart devices. According to the results of our extensive experiments, with short vibration signals (≤1s), VibHead has an outstanding authentication accuracy; both FAR and FRR are around 5%. [ABSTRACT FROM AUTHOR]

For some so-called computationally difficult problems, using the method of Boolean logic is fundamentally inefficient. For example, the vertex coloring problem looks very simple, but the number of possible solutions increases sharply with the increase of graph vertices. This is the difficulty of the problem. This complexity has been widely studied because of its wide applications in the fields of data science, life science, social science, and engineering technology. Consequently, it has inspired the use of alternative and more effective non-Boolean methods for obtaining solutions to similar problems. In this paper, we explore the research on a new generation of computers that use local active memristors coupling. First, we study the dynamics of the memristor coupling network. Then, the simplified system phase model is obtained. This research not only clarifies a physics-based calculation method but also provides a foundation for the construction of customized analog computers to effectively solve NP-hard problems. [ABSTRACT FROM AUTHOR]

The neuromorphic network based on artificial neurons and synapses can solve computational difficulties, and its energy efficiency is incomparable to the traditional von Neumann architecture. As a new type of circuit component, nonvolatile memristors are very similar to biological synapses in structure and function. Only one memristor can simulate the function of a synapse. Therefore, memristors provide a new way to build hardware-based artificial neural networks. To build such an artificial neural network, in addition to the artificial synapses, artificial neurons are also needed to realize the distribution of information and the adjustment of synaptic weights. As the VO2 volatile local active memristor is complementary to nonvolatile memristors, it can be used to simulate the function of neurons. However, determining how to better realize the function of neurons with simple circuits is one of the current key problems to be solved in this field. This paper considers the influence of distribution parameters on circuit performance under the action of high-frequency and high-speed signals. Two Mott VO2 memristor units are connected and coupled with microstrip lines to simulate the Hodgkin–Huxley neuron model. It is found that the proposed memristor neuron based on microstrip lines shows the characteristics of neuron action potential: amplification and threshold. [ABSTRACT FROM AUTHOR]

COVID-19 is caused by severe acute respiratory syndrome-coronavirus-2 (SARS-CoV-2). The severity of COVID-19 is highly variable and related to known (e.g., age, obesity, immune deficiency) and unknown risk factors. The widespread clinical symptoms encompass a large group of asymptomatic COVID-19 patients, raising a crucial question regarding genetic susceptibility, e.g., whether individual differences in immunity play a role in patient symptomatology and how much human leukocyte antigen (HLA) contributes to this. To reveal genetic determinants of susceptibility to COVID-19 severity in the population and further explore potential immune-related factors, we performed a genome-wide association study on 284 confirmed COVID-19 patients (cases) and 95 healthy individuals (controls). We compared cases and controls of European (EUR) ancestry and African American (AFR) ancestry separately. We identified two loci on chromosomes 5q32 and 11p12, which reach the significance threshold of suggestive association (p<1x10-5 threshold adjusted for multiple trait testing) and are associated with the COVID-19 susceptibility in the European ancestry (index rs17448496: odds ratio[OR] = 0.173; 95% confidence interval[CI], 0.08–0.36 for G allele; p = 5.15× 10−5 and index rs768632395: OR = 0.166; 95% CI, 0.07–0.35 for A allele; p = 4.25×10−6, respectively), which were associated with two genes, PPP2R2B at 5q32, and LRRC4C at 11p12, respectively. To explore the linkage between HLA and COVID-19 severity, we applied fine-mapping analysis to dissect the HLA association with mild and severe cases. Using In-silico binding predictions to map the binding of risk/protective HLA to the viral structural proteins, we found the differential presentation of viral peptides in both ancestries. Lastly, extrapolation of the identified HLA from the cohort to the worldwide population revealed notable correlations. The study uncovers possible differences in susceptibility to COVID-19 in different ancestral origins in the genetic background, which may provide new insights into the pathogenesis and clinical treatment of the disease. [ABSTRACT FROM AUTHOR]

Digital communication based on memristors is a new field. The main principle is to construct a modulation and demodulation circuit by using the resistance variation characteristics of the memristor. Based on the establishment of the Knowm memristor simulation model, firstly, the modulation circuit is designed by using the polarity and symmetry of the memristor and combined with the commercial current feedback amplifier AD844. It is proved that the modulated signal based on the memristor is a strong function of phase, and the demodulation circuit is designed accordingly. All simulation circuits are based on the actual commercial physical device model. The analytical expression of the output signal of the modulation and demodulation circuit is deduced theoretically, and the communication performance of the whole system is simulated by LTSpice. At the same time, the influence of the parasitic capacitance of the memristor on the circuit performance is also considered. After the simulation verification, the hardware circuit experiment of the modulation and demodulation circuit is carried out. The waveforms of the modulated signal and the demodulated signal are measured by an oscilloscope. The experimental results are completely consistent with the simulation and theoretical results. [ABSTRACT FROM AUTHOR]

Dynamic vision sensors (event cameras) have recently been introduced to solve a number of different vision tasks such as object recognition, activities recognition, tracking, etc. Compared with the traditional RGB sensors, the event cameras have many unique advantages such as ultra low resources consumption, high temporal resolution and much larger dynamic range. However, these cameras only produce noisy and asynchronous events of intensity changes, i.e., event-streams rather than frames, where conventional computer vision algorithms can't be directly applied. In our opinion the key challenge for improving the performance of event cameras in vision tasks is finding the appropriate representations of the event-streams so that cutting-edge learning approaches can be applied to fully uncover the spatio-temporal information contained in the event-streams. In this paper, we focus on the event-based human gait identification task and investigate the possible representations of the event-streams when deep neural networks are applied as the classifier. We propose new event-based gait recognition approaches basing on two different representations of the event-stream, i.e., graph and image-like representations, and use graph-based convolutional network (GCN) and convolutional neural networks (CNN) respectively to recognize gait from the event-streams. The two approaches are termed as EV-Gait-3DGraph and EV-Gait-IMG. To evaluate the performance of the proposed approaches, we collect two event-based gait datasets, one from real-world experiments and the other by converting the publicly available RGB gait recognition benchmark CASIA-B. Extensive experiments show that EV-Gait-3DGraph achieves significantly higher recognition accuracy than other competing methods when sufficient training samples are available. However, EV-Gait-IMG converges more quickly than graph-based approaches while training and shows good accuracy with only few number of training samples (less than ten). So image-like presentation is preferable when the amount of training data is limited. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) is flourishing and has penetrated deeply into people’s daily life. With the seamless connection to the physical world, IoT provides tremendous opportunities to a wide range of applications. However, potential risks exist when the IoT system collects sensor data and uploads it to the Cloud. The leakage of private data can be severe with curious database administrator or malicious hackers who compromise the Cloud. In this work, we propose Kryptein, a compressive-sensing-based lightweight encryption scheme for Cloud-enabled IoT systems to secure the interaction between the IoT devices and the Cloud. Kryptein supports random compressed encryption, statistical computation over cipher, and accurate raw data decryption. According to our evaluation based on two real datasets, Kryptein provides strong protection to the data. It is 250 times faster than other state-of-the-art systems and incurs 120 times less energy consumption. The performance of Kryptein is also measured on off-the-shelf IoT devices, and the result shows Kryptein can run efficiently on IoT devices. After comparing with other state-of-the-art lightweight ciphers on IoT (Simon and Speck), IoT system with Kryptein is expected to have a much more longevity with about 35 percent extended lifetime. Further, experiments illustrated IoT data variance will not affect Kryptein’s accuracy in a long term usage, and Krpytein is also able to support basic analytics tasks like machine learning (e.g., classification). [ABSTRACT FROM AUTHOR]

The large-scale collection of individuals’ mobility data poses serious privacy concerns. Instead of perturbing data by adding noise to the raw location data to preserve privacy of individuals, we propose an approach that achieves privacy-preservation at the statistics level of aggregating mobility datasets with the probabilistic data structure Count-Min Sketch (CMS) , which has been widely used to provide efficient statistic functions with a tunable error bound. We use CMS to estimate the population density distributions in the mobility datasets, where the error bound determines utility guarantees. We develop P4Mobi, a novel Probabilistic Privacy-Preserving Publishing framework for Mobility datasets that protects individuals’ privacy while complying to a specific utility requirement. We empirically validate the performance of P4Mobi in terms of utility and privacy-preservation by demonstrating its resilience against a recently proposed reconstruction attack model using two real-world datasets. We compare P4Mobi to two state-of-the-art methods and show that with the same level of privacy achieved against our attack model, P4Mobi significantly improves the utility of the published mobility datasets by up to $20\%$. We also provide a theoretical estimate of the utility achieved by P4Mobi. We found a very consistent match between the estimated and empirical utility of P4Mobi as evaluated on two datasets. [ABSTRACT FROM AUTHOR]

Millions of mobile apps have been released to the market. Developers need to maintain these apps so that they can continue to benefit end users, who usually submit issue reports to describe the bugs, the feature requests, and other changes appearing in apps. The labels (e.g. bug, feature request) are important resources to indicate which issue reports should be resolved first or next. According to the investigation, 35.6% of issue reports in top‐17 popular mobile apps are not labelled. Developers have to spend additional time to manually verify each unlabelled issue report so that they can decide to resolve the most important issues. In order to help developers to reduce the workload, in this study, the authors propose a novel approach to automatically tag the unlabelled issue reports. This approach not only computes the similarity between each unlabelled issue report and user reviews related to bugs and features but also calculates the textual similarity scores between each unlabelled issue report and labelled ones. As a result, among all textual similarity measures, this approach using cosine similarity with MCG shows the best performance. Moreover, this approach performs better than the method proposed in the authors' previous study. [ABSTRACT FROM AUTHOR]

Hepatitis delta virus (HDV) is a satellite of hepatitis B virus that increases the severity of acute and chronic liver disease. HDV produces three processed RNAs that accumulate in infected cells: the circular genome, the circular antigenome, which serves as a replication intermediate, and lesser amounts of the mRNA, which encodes the sole viral protein, hepatitis delta antigen (HDAg). The HDV genome and antigenome RNAs form ribonucleoprotein complexes with HDAg. Although HDAg is required for HDV replication, it is not known how the relative amounts of HDAg and HDV RNA affect replication, nor whether HDAg synthesis is regulated by the virus. Using a novel transfection system in which HDV replication is initiated using in vitro-synthesized circular HDV RNAs, HDV replication was found to depend strongly on the relative amounts of HDV RNA and HDAg. HDV controls these relative amounts via differential effects of HDAg on the production of HDV mRNA and antigenome RNA, both of which are synthesized from the genome RNA template. mRNA synthesis is favored at low HDAg levels but becomes saturated at high HDAg concentrations. Antigenome RNA accumulation increases linearly with HDAg and dominates at high HDAg levels. These results provide a conceptual model for how HDV antigenome RNA production and mRNA transcription are controlled from the earliest stage of infection onwards and also demonstrate that, in this control, HDV behaves similarly to other negative strand RNA viruses, even though there is no genetic similarity between them. [ABSTRACT FROM AUTHOR]

To further improve the complexity of the chaotic system and broaden the chaotic parameter range, a novel logarithmic chaotic system was constructed by adding a nonlinear term of logarithm. The dynamic characteristics of the chaotic system were analyzed by chaotic phase diagram, bifurcation diagram, Lyapunov exponent spectrum, Poincaré mapping and dynamical map, etc. The system was digitized by DSP simulation, and the corresponding experimental results are completely consistent with the theoretical analysis. Furthermore, the equivalent hardware circuit was designed and theoretical analysis was verified by its experimental results. [ABSTRACT FROM AUTHOR]

The rise of mobile crowd sensing has brought privacy issues into a sharp view. In this paper, our goal is to achieve the predictable privacy-preserving mobile crowd sensing, which we envision to have the capability to quantify the privacy protections, and simultaneously allowing application users to predict the utility loss at the same time. The Salus algorithm is first proposed to protect the private data against the data reconstruction attacks. To understand privacy protection, we quantify the privacy risks in terms of private data leakage under reconstruction attacks. To predict the utility, we provide accurate utility predictions for various crowd sensing applications using Salus. The risk assessments can be generally applied to different type of sensors on the mobile platform, and the utility prediction can also be used to support various applications that use data aggregators such as average, histogram, and classifiers. Finally, we propose and implement the $P^{3}$ application framework. Both measurement results using online datasets and real-world case studies show that the $P^{3}$ provides accurate risk assessments and utility estimations, which makes it a promising framework to support future privacy-preserving mobilecrowd sensing applications. [ABSTRACT FROM AUTHOR]

This paper proposes a new three-dimensional chaotic system with no equilibrium point but can generate hidden chaotic attractors. Dynamic characteristics of the system are analyzed in detail by theoretical analysis and simulating experiments, including hidden attractors, transient period and coexisting attractors. Different hidden coexisting attractors exist in this system, which shows abundant and complex dynamic characteristics and can be used to generate pseudorandom sequences for encryption fields. Besides, the presented system is realized by the digital signal processing (DSP) technology to construct a chaotic signal generator, whose statistical properties are tested by National Institute of Standards and Technology (NIST) software. The obtained results are better than that of the Lorenz system and imply the presented system can be used in the encrypted fields. [ABSTRACT FROM AUTHOR]

Divisive algorithms are widely used for community detection. A common strategy of divisive algorithms is to remove the external links which connect different communities so that communities get disconnected from each other. Divisive algorithms have been investigated for several decades but some challenges remain unsolved: (1) how to efficiently identify external links, (2) how to efficiently remove external links, and (3) how to end a divisive algorithm with no help of predefined parameters or community definitions. To overcome these challenges, we introduced a concept of the weak link and autonomous division. The implementation of the proposed divisive algorithm adopts a new link-break strategy similar to a tug-of-war contest, where communities act as contestants and weak links act as breakable ropes. Empirical evaluations on artificial and real-world networks show that the proposed algorithm achieves a better accuracy-efficiency trade-off than some of the latest divisive algorithms. [ABSTRACT FROM AUTHOR]

Face recognition is a hot research topic with a variety of application possibilities, including video surveillance and mobile payment. It has been well researched in traditional computer vision community. However, new research issues arise when it comes to resource constrained devices, such as smart glasses, due to the overwhelming computation and energy requirements of the accurate face recognition methods. In this paper, we propose a robust and efficient sensor-assisted face recognition system on smart glasses by exploring the power of multimodal sensors including the camera and Inertial Measurement Unit (IMU) sensors. The system is based on a novel face recognition algorithm, namely Multi-view Sparse Representation Classification (MVSRC), by exploiting the prolific information among multi-view face images. To improve the efficiency of MVSRC on smart glasses, we propose two novel sampling optimization strategies using the less expensive inertial sensors. Our evaluations on public and private datasets show that the proposed method is up to 10 percent more accurate than the state-of-the-art multi-view face recognition methods while its computation cost is the same order as an efficient benchmark method (e.g., Eigenfaces). Finally, extensive real-world experiments show that our proposed system improves recognition accuracy by up to 15 percent while achieving the same level of system overhead compared to the existing face recognition system (OpenCV algorithms) on smart glasses. [ABSTRACT FROM PUBLISHER]

Face recognition is one of the important components of many smart devices apps, e.g., face unlocking, people tagging and games on smart phones, tablets, or smart glasses. Sparse Representation Classification (SRC) is a state-of-the-art face recognition algorithm, which has been shown to outperform many classical face recognition algorithms in OpenCV, e.g., Eigenface algorithm. The success of SRC is due to its use of $\ell _1$ optimization, which makes SRC robust to noise and occlusions. Since $\ell _1$ optimization is computationally intensive, SRC uses random projection matrices to reduce the dimension of the $\ell _1$ problem. However, random projection matrices do not give consistent classification accuracy as they ignored the prior knowledge of the training set. In this paper, we propose to exploit the prior knowlege of the training set to improve the recognition accuracy. It first learns the optimized projection matrix from the training set to produce consistent recognition performance then applies $\ell _1$ -based classification based on the group sparsity structure of SRC to further improve the recognition accuracy. Our evaluations, based on publicly available databases and real experiment, show that face recognition using optimized projection matrix is 8-17 percent more accurate than its random counterpart and Eigenface algorithm, and the recognition accuracy can be further improved by up to 5 percent by exploiting group sparsity structure. Furthermore, the optimized projection matrix does not have to be re-calculated even if new faces are added to the training set. We implement the SRC with optimized projection matrix on Android smartphones and find that the computation of residuals in SRC is a severe bottleneck, taking up 85-90 percent of the computation time. To address this problem, we propose a method to compute the residuals approximately, which is 50 times faster with little sacrificing recognition accuracy. Lastly, we demonstrate the feasibility of our new algorithm by the implementation and evaluation of a new face unlocking app and show its robustness to variation of poses, facial expressions, lighting changes, and occlusions. [ABSTRACT FROM AUTHOR]

Memristor and memcapacitor are new nonlinear devices with memory. We present a novel memcapacitor model that has the capability of capturing the behavior of a memcapacitor. Based on this model we also design a chaotic oscillator circuit that contains a HP memristor and the memcapacitor model for generating good pseudorandom sequences. Its dynamic behaviors, including equilibrium points, stability, and bifurcation characteristics, are analyzed in detail. It is found that the proposed oscillator can exhibit some complex phenomena, such as chaos, hyperchaos, coexisting attractors, abrupt chaos, and some novel bifurcations. Moreover, a scheme for digitally realizing this oscillator is provided by using the digital signal processor (DSP) technology. Then the random characteristics of the chaotic binary sequences generated from the oscillator are tested via the test suit of National Institute of Standards and Technology (NIST). The tested randomness definitely reaches the standards of NIST and is better than that of the well-known Lorenz system. [ABSTRACT FROM AUTHOR]

Real-time target tracking is an important service provided by embedded camera networks. The first step in target tracking is to extract the moving targets from the video frames, which can be realised by using background subtraction. For a background subtraction method to be useful in embedded camera networks, it must be both accurate and computationally efficient because of the resource constraints on embedded platforms. This makes many traditional background subtraction algorithms unsuitable for embedded platforms because they use complex statistical models to handle subtle illumination changes. These models make them accurate but the computational requirement of these complex models is often too high for embedded platforms. In this paper, we propose a new background subtraction method which is both accurate and computationally efficient. We propose a baseline version which uses luminance only and then extend it to use colour information. The key idea is to use random projection matrics to reduce the dimensionality of the data while retaining most of the information. By using multiple datasets, we show that the accuracy of our proposed background subtraction method is comparable to that of the traditional background subtraction methods. Moreover, to show the computational efficiency of our methods is not platform specific, we implement it on various platforms. The real implementation shows that our proposed method is consistently better and is up to six times faster, and consume significantly less resources than the conventional approaches. Finally, we demonstrated the feasibility of the proposed method by the implementation and evaluation of an end-to-end real-time embedded camera network target tracking application. [ABSTRACT FROM PUBLISHER]

In this paper, we consider the problem of using wireless sensor networks (WSNs) to measure the temporal-spatial profile of some physical phenomena. We base our work on two observations. First, most physical phenomena are compressible in some transform domain basis. Second, most WSNs have some form of heterogeneity. Given these two observations, we propose a nonuniform compressive sensing method to improve the performance of WSNs by exploiting both compressibility and heterogeneity. We apply our proposed method to real WSN data sets. We find that our method can provide a more accurate temporal-spatial profile for a given energy budget compared with other sampling methods. [ABSTRACT FROM PUBLISHER]

This paper proposes a modified Chua Corsage Memristor endowed with two symmetrical locally active domains. Under the DC bias voltage in the locally active domains, the memristor with an inductor can construct a second-order circuit to generate periodic oscillation. Based on the theories of the edge of chaos and local activity, the oscillation mechanism of the symmetrical periodic oscillations of the circuit is revealed. The third-order memristor circuit is constructed by adding a passive capacitor in parallel with the memristor in the second-order circuit, where symmetrical periodic oscillations and symmetrical chaos emerge either on or near the edge of chaos domains. The oscillation mechanisms of the memristor-based circuits are analyzed via Domains distribution maps, which include the division of locally passive domains, locally active domains, and the edge of chaos domains. Finally, the symmetrical dynamic characteristics are investigated via theory and simulations, including Lyapunov exponents, bifurcation diagrams, and dynamic maps. [ABSTRACT FROM AUTHOR]

A cellular neural network (CNN) based on a VO2 carbon nanotube memristor is proposed in this paper. The device is modeled by SPICE at first, and then the cell dynamic characteristics based on the device are analyzed. It is pointed out that only when the cell is at the sharp edge of chaos can the cell be successfully awakened after the CNN is formed. In this paper, we give the example of a 5 × 5 CNN, set specific initial conditions and observe the formed pattern. Because the generated patterns are affected by the initial conditions, the cell power supply can be pre-programmed to obtain specific patterns, which can be applied to the future information processing system based on complex space–time patterns, especially in the field of computer vision. [ABSTRACT FROM AUTHOR]

Different from the static (power-off) nonvolatile property of a memristor, the history erase effect of a memristor is a dynamic characteristic, which means that under the excitation of switching or different signals, the memristor can forget its initial value and reach a unique stable state. The stable state is determined only by the excitation signal and has nothing to do with its initial state. The history erase effect is a desired effect in memristor applications such as memory. It can simplify the complexity of the writing circuit and improve the storage speed. If the memristor's response depends on the initial state, a state reset operation is required before each writing operation. Therefore, it is of great theoretical and practical significance to judge whether the memristor has a history erase effect. Based on the study of the history erase effect of real memristors, this paper focuses on the history erase effect of a Hewlett-Packard (HP) TiO2 memristor and the Self-Directed Channel (SDC) memristor of Knowm Company. The DC and AC responses of the HP TiO2 memristor are given, and it is pointed out that there is no AC history erase effect. However, considering the parasitic memcapacitance effect, it is found that it has the effect. Based on the theoretical model of the SDC memristor, its history erase properties with and without considering parasitic effects are studied. It should be noted that this study method can be useful for other materials such as Al2O3 and MoS2. [ABSTRACT FROM AUTHOR]