Mediating and inducing quantum correlation between two separated qubits by one-dimensional plasmonic waveguide

We investigate the dynamics of quantum correlation between two separated qubits trapped in one-dimensional plasmonic waveguide. It is found that for a class of initial states, the quantum discord shows a sudden change phenomenon during the dynamical evolution. Furthermore, we demonstrate that the quantum discord can be enhanced if a proper product of the plasmon wave number and two qubits distance is chosen. Finally, we find that the non-zero quantum discord between two qubits can be created for the states without initial quantum discord during the time evolution of the system.     

Image mosaicking for polyhedral scene and in particular singly visible surfaces

Image mosaic construction is about stitching together a number of images about the same scene to construct a single image with a larger field of view. The majority of the previous work was rooted at the use of a single image-to-image mapping termed planar homography for representing the imaged scene. However, the mapping is applicable only to cases where the imaged scene is either a single planar surface, or very distant from the cameras, or imaged under a pure rotation of the camera, and that greatly limits the range of applications of the mosaicking methods. This paper presents a novel mosaicking solution for scenes that are polyhedral (thus consisting of multiple surfaces) and that are pictured possibly in closed range of the camera. The solution has two major advantages. First, it requires only a few correspondences over the entire scene, not correspondences over every surface patch in it to work. Second, it conquers a seemingly impossible task—warping image data of surfaces that are visible in only one of the input images, which we refer to as the singly visible surfaces, to another viewpoint to constitute the mosaic there. We also provide a detail analysis of what determines whether a singly visible surface could be mosaicked or not. Experimental results on real image data are presented to illustrate the performance of the method.     

Mining partial periodic correlations in time series

Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations. Zhen He is a lecturer in the Department of Computer Science at La Trobe University. His main research areas are database systems optimization, time series mining, wireless sensor networks, and XML information retrieval. Prior to joining La Trobe University, he worked as a postdoctoral research associate in the University of Vermont. He holds Bachelors, Honors and Ph.D degrees in Computer Science from the Australian National University. X. Sean Wang received his Ph.D degree in Computer Science from the University of Southern California in 1992. He is currently the Dorothean Chair Professor in Computer Science at the University of Vermont. He has published widely in the general area of databases and information security, and was a recipient of the US National Science Foundation Research Initiation and CAREER awards. His research interests include database systems, information security, data mining, and sensor data processing. Byung Suk Lee is associate professor of Computer Science at the University of Vermont. His main research areas are database systems, data modeling, and information retrieval. He held positions in industry and academia: Gold Star Electric, Bell Communications Research, Datacom Global Communications, University of St. Thomas, and currently University of Vermont. He was also a visiting professor at Dartmouth College and a participating guest at Lawrence Livermore National Laboratory. He served on international conferences as a program committee member, a publicity chair, and a special session organizer, and also on US federal funding proposal review panel. He holds a BS degree from Seoul National University, MS from Korea Advanced Institute of Science and Technology, and Ph.D from Stanford University. Alan C. H. Ling is an assistant professor at Department of Computer Science in University of Vermont. His research interests include combinatorial design theory, coding theory, sequence designs, and applications of design theory.     

Macrophage Membrane-Coated Nanoparticles Sensitize Glioblastoma to Radiation by Suppressing Proneural–Mesenchymal Transformation in Glioma Stem Cells

Radiotherapy is identified as a crucial treatment for patients with glioblastoma, but recurrence is inevitable. The efficacy of radiotherapy is severely hampered partially due to the tumor evolution. Growing evidence suggests that proneural glioma stem cells can acquire mesenchymal features coupled with increased radioresistance. Thus, a better understanding of mechanisms underlying tumor subclonal evolution may develop new strategies. Herein, data highlighting a positive correlation between the accumulation of macrophage in the glioblastoma microenvironment after irradiation and mesenchymal transdifferentiation in glioblastoma are presented. Mechanistically, elevated production of inflammatory cytokines released by macrophages promotes mesenchymal transition in an NF-κB-dependent manner. Hence, rationally designed macrophage membrane-coated porous mesoporous silica nanoparticles (MMNs) in which therapeutic anti-NF-κB peptides are loaded for enhancing radiotherapy of glioblastoma are constructed. The combination of MMNs and fractionated irradiation results in the blockage of tumor evolution and therapy resistance in glioblastoma-bearing mice. Intriguingly, the macrophage invasion across the blood-brain barrier is inhibited competitively by MMNs, suggesting that these nanoparticles can fundamentally halt the evolution of radioresistant clones. Taken together, the biomimetic MMNs represent a promising strategy that prevents mesenchymal transition and improves therapeutic response to irradiation as well as overall survival in patients with glioblastoma.     

A Survey on Long-Tailed Visual Recognition

The heavy reliance on data is one of the major reasons that currently limit the development of deep learning. Data quality directly dominates the effect of deep learning models, and the long-tailed distribution is one of the factors affecting data quality. The long-tailed phenomenon is prevalent due to the prevalence of power law in nature. In this case, the performance of deep learning models is often dominated by the head classes while the learning of the tail classes is severely underdeveloped. In order to learn adequately for all classes, many researchers have studied and preliminarily addressed the long-tailed problem. In this survey, we focus on the problems caused by long-tailed data distribution, sort out the representative long-tailed visual recognition datasets and summarize some mainstream long-tailed studies. Specifically, we summarize these studies into ten categories from the perspective of representation learning, and outline the highlights and limitations of each category. Besides, we have studied four quantitative metrics for evaluating the imbalance, and suggest using the Gini coefficient to evaluate the long-tailedness of a dataset. Based on the Gini coefficient, we quantitatively study 20 widely-used and large-scale visual datasets proposed in the last decade, and find that the long-tailed phenomenon is widespread and has not been fully studied. Finally, we provide several future directions for the development of long-tailed learning to provide more ideas for readers.