Searcharxiv⌕ Search

arXiv subjects

Zheng Zhou

Publications and source records attributed to Zheng Zhou.

At least 109 records · Page 6Linked to original sources

An inertial shrinking projection algorithm for split common fixed point problems

In this paper, the purpose is to introduce and study a new modified shrinking projection algorithm with inertial effects, which solves split common fixed point problems in Banach spaces. The corresponding strong convergence theorems are obtained without the assumption of semi-compactness on mappings. Finally, some numerical examples are presented to illustrate the results in this paper.

math.OC↗

Strong convergence of modified inertial Mann algorithms for nonexpansive mappings

In this paper, we introduce two new modified inertial Mann Halpern and viscosity algorithms for solving fixed point problems. We establish strong convergence theorems under some suitable conditions. Finally, our algorithms are applied to split feasibility problem, convex feasibility problem and location theory. The algorithms and results presented in this paper can summarize and improve corresponding results previously known in this area.

math.OC↗

Universal critical behavior in the ferromagnetic superconductor Eu(Fe$_{0.75}$Ru$_{0.25}$)$_{2}$As$_{2}$

The study of universal critical behavior is a crucial issue in a continuous phase transition, which groups various critical phenomena into universality classes for revealing microscopic electronic behaviors. The understanding of the nature of magnetism in Eu-based ferromagnetic superconductors is largely impeded by the infeasibility of performing inelastic neutron scattering measurements to deduce the microscopic magnetic behaviors and the effects on the superconductivity, due to the significant neutron absorption effect of natural $^{152}$Eu and unavailability of large single crystals. However, by systematically combining the neutron diffraction experiment, the first-principles calculations, and the quantum Monte Carlo simulations, we have obtained a perfectly consistent universal critical exponent value of $β=0.385(13)$ experimentally and theoretically for Eu(Fe$_{0.75}$Ru$_{0.25}$)$_{2}$As$_{2}$, from which the magnetism in the Eu-based ferromagnetic superconductors is identified as the universal class of a three-dimensional anisotropic quantum Heisenberg model with long-range magnetic exchange coupling. This study not only clarifies the nature of microscopic magnetic behaviors in the Eu-based ferromagnetic superconductors, but also opens a new avenue of systemic methodology for studying the universal critical behaviors associated with magnetic phase transitions in the area of magnetism and the spin fluctuations effects on the unconventional superconductivity.

cond-mat.str-el↗

Visualizing the melting processes in ultrashort intense laser triggered gold mesh with high energy electron radiography

High energy electron radiography (HEER) is a promising tool for high energy density physics diagnostics, apart from other tools like X/γ ray shadowgraphy and high energy proton radiography. Impressive progresses have been made in development and application of HEER in past few years, and proved its potentials for high-resolution imaging of static opaque objects. By taking advantages of short pulse duration and tunable time structure of high energy electron probes, time-resolved imaging measurement of high energy density gold irradiated by ultrashort intense lasers has been performed. Phenomena of different time periods from picosecond to microsecond have been observed, thus proving feasibilities of this technique for imaging of static and dynamic objects.

physics.app-ph↗

Finite Section Method for singular integrals with operator-valued PQC-coefficients and a flip

We establish necessary and sufficient conditions for the stability of the finite section method for operators belonging to a certain $C^*$-algebra of operators acting on the Hilbert space $l^2_H(\mathbb{Z})$ of $H$-valued sequences where $H$ is a given Hilbert space. Identifying $l^2_H(\mathbb{Z})$ with the $L^2_H$-space over the unit circle, the $C^*$-algebra in question is the one which contains all singular integral operators with flip and piecewise quasicontinous $\mathcal{L}(H)$-valued generating functions on the unit circle. The result is a generalization of an older result where the same problem, but without the flip operator was considered. The stability criterion is obtained via $C^*$-algebra methods and says that a sequence of finite sections is stable if and only if certain operators associated with that sequence (via $^*$-homomorphisms) are invertible.

math.FA↗

Data Exfiltration via Multipurpose RFID Cards and Countermeasures

Radio-frequency identification(RFID) technology is widely applied in daily human life. The RFID cards are seen everywhere, from entrance guard to consumption. The information security of RFID cards, such as data confidentiality, tag anonymity, mutual authentication etc, has been fully studied. In the paper, using the RFID cards in MIFARE Classic and DESFire families, a bidirectional covert channel via multipurpose RFID cards between service providers is built to leak sensitive data between two simulation systems. Furthermore, by calculations and experiments, the daily channel capacity to leak data of the channel is obtained. Although the storage capacity of a single RFID card is very small, a large user base can still bring about a considerable amount to leak data. Then, the reasons for the existence of such channels are discussed. To eliminate this type of covert channels, a new authentication protocol between RFID cards and card readers are proposed. Our experimental results show a significant security improvement in prevention of such covert communications while keeping user convenience.

cs.CR↗

Beating the fundamental rate-distance limit in a proof-of-principle quantum key distribution system

With the help of quantum key distribution (QKD), two distant peers are able to share information-theoretically secure key bits. Increasing key rate is ultimately significant for the applications of QKD in lossy channel. However, it has proved that there is a fundamental rate-distance limit, named linear bound, which limits the performance of all existing repeaterless protocols and realizations. Surprisingly, a recently proposed protocol, called twin-field (TF) QKD can beat linear bound with no need of quantum repeaters. Here, we present the first implementation of TF-QKD protocol and demonstrate its advantage of beating linear bound at the channel distance of 300 km. In our experiment, a modified TF-QKD protocol which does not assume phase post-selection is considered, and thus higher key rate than the original one is expected. After well controlling the phase evolution of the twin fields travelling hundreds of kilometers of optical fibres, the implemented system achieves high-visibility single-photon interference, and allows stable and high-rate measurement-device-independent QKD. Our experimental demonstration and results confirm the feasibility of the TF-QKD protocol and its prominent superiority in long distance key distribution services.

quant-ph↗

Earthquake Detection in 1-D Time Series Data with Feature Selection and Dictionary Learning

Earthquakes can be detected by matching spatial patterns or phase properties from 1-D seismic waves. Current earthquake detection methods, such as waveform correlation and template matching, have difficulty detecting anomalous earthquakes that are not similar to other earthquakes. In recent years, machine-learning techniques for earthquake detection have been emerging as a new active research direction. In this paper, we develop a novel earthquake detection method based on dictionary learning. Our detection method first generates rich features via signal processing and statistical methods and further employs feature selection techniques to choose features that carry the most significant information. Based on these selected features, we build a dictionary for classifying earthquake events from non-earthquake events. To evaluate the performance of our dictionary-based detection methods, we test our method on a labquake dataset from Penn State University, which contains 3,357,566 time series data points with a 400 MHz sampling rate. 1,000 earthquake events are manually labeled in total, and the length of these earthquake events varies from 74 to 7151 data points. Through comparison to other detection methods, we show that our feature selection and dictionary learning incorporated earthquake detection method achieves an 80.1% prediction accuracy and outperforms the baseline methods in earthquake detection, including Template Matching (TM) and Support Vector Machine (SVM).

physics.geo-ph↗

A Data-Driven CO2 Leakage Detection Using Seismic Data and Spatial-Temporal Densely Connected Convolutional Neural Networks

In carbon capture and sequestration, developing effective monitoring methods is needed to detect and respond to CO2 leakage. CO2 leakage detection methods rely on geophysical observations and monitoring sensor network. However, traditional methods usually require the development of site-specific physical models and expert interpretation, and the effectiveness of these methods can be limited to different application locations, operational scenarios, and conditions. In this paper, we developed a novel data-driven leakage detection method based on densely connected convolutional neural networks. Our method differs from conventional leakage monitoring methods by directly learning a mapping relationship between seismic data and the CO2 leakage mass. To account for the spatial and temporal characteristics of seismic data, our novel networks architecture combines 1D and 2D convolutional neural networks. To overcome the computational expense of solving optimization problems, we apply a densely-connecting strategy in our network architecture that reduces the number of network parameters. Based on the features generated by our convolutional neural networks, we further incorporate a long short-term memory network to utilize time-sequential information, which further improves the detection accuracy. Finally, we employ our detection method to synthetic seismic datasets generated based on flow simulations of a hypothetical CO2 storage scenario with injection into a partially compartmentalized sandstone storage reservoir. To evaluate method performance, we conducted multiple experiments including a random leakage test, a sequential test, and a robustness test. Numerical results show that our CO2 leakage detection method successfully detects the leakage and accurately predicts the leakage mass, suggesting that it has the potential for application in monitoring of real CO2 storage sites.

physics.geo-ph↗

How to Become Instagram Famous: Post Popularity Prediction with Dual-Attention

With a growing number of social apps, people have become increasingly willing to share their everyday photos and events on social media platforms, such as Facebook, Instagram, and WeChat. In social media data mining, post popularity prediction has received much attention from both data scientists and psychologists. Existing research focuses more on exploring the post popularity on a population of users and including comprehensive factors such as temporal information, user connections, number of comments, and so on. However, these frameworks are not suitable for guiding a specific user to make a popular post because the attributes of this user are fixed. Therefore, previous frameworks can only answer the question "whether a post is popular" rather than "how to become famous by popular posts". In this paper, we aim at predicting the popularity of a post for a specific user and mining the patterns behind the popularity. To this end, we first collect data from Instagram. We then design a method to figure out the user environment, representing the content that a specific user is very likely to post. Based on the relevant data, we devise a novel dual-attention model to incorporate image, caption, and user environment. The dual-attention model basically consists of two parts, explicit attention for image-caption pairs and implicit attention for user environment. A hierarchical structure is devised to concatenate the explicit attention part and implicit attention part. We conduct a series of experiments to validate the effectiveness of our model and investigate the factors that can influence the popularity. The classification results show that our model outperforms the baselines, and a statistical analysis identifies what kind of pictures or captions can help the user achieve a relatively high "likes" number.

cs.SI↗

Asymptotics of determinants for finite sections of operators with almost periodic diagonals

Let $A = (a_{j,k})_{j,k=-\infty}^\infty$ be a bounded linear operator on $l^2(\mathbb{Z})$ whose diagonals $D_n(A) = (a_{j,j-n})_{j=-\infty}^\infty\in l^\infty(\mathbb{Z})$ are almost periodic sequences. For certain classes of such operators and under certain conditions, we are going to determine the asymptotics of the determinants $\det A_{n_1,n_2}$ of the finite sections of the operator $A$ as their size $n_2 - n_1$ tends to infinity. Examples of such operators include block Toeplitz operators and the almost Mathieu operator.

math.FA↗

Orthogonal Deep Features Decomposition for Age-Invariant Face Recognition

As facial appearance is subject to significant intra-class variations caused by the aging process over time, age-invariant face recognition (AIFR) remains a major challenge in face recognition community. To reduce the intra-class discrepancy caused by the aging, in this paper we propose a novel approach (namely, Orthogonal Embedding CNNs, or OE-CNNs) to learn the age-invariant deep face features. Specifically, we decompose deep face features into two orthogonal components to represent age-related and identity-related features. As a result, identity-related features that are robust to aging are then used for AIFR. Besides, for complementing the existing cross-age datasets and advancing the research in this field, we construct a brand-new large-scale Cross-Age Face dataset (CAF). Extensive experiments conducted on the three public domain face aging datasets (MORPH Album 2, CACD-VS and FG-NET) have shown the effectiveness of the proposed approach and the value of the constructed CAF dataset on AIFR. Benchmarking our algorithm on one of the most popular general face recognition (GFR) dataset LFW additionally demonstrates the comparable generalization performance on GFR.

cs.CV↗

Spatial-Temporal Densely Connected Convolutional Networks: An Application to CO2 Leakage Detection

In carbon capture and sequestration, building an effective monitoring method is a crucial step to detect and respond to CO2 leakage. CO2 leakage detection methods rely on geophysical observations and monitoring sensor network. However, traditional methods usually require physical models to be interpreted by experts, and the accuracy of these methods will be restricted by different application conditions. In this paper, we develop a novel data-driven detection method based on densely connected convolutional networks. Our detection method learns a mapping relation between seismic data and the CO2 leakage mass. To account for the spatial and temporal characteristics of seismic data, we design a novel network architecture by combining 1-D and 2-D convolutional neural networks together. To overcome the expensive computational cost, we further apply a densely-connecting policy to our network architecture to reduce the network parameters. We employ our detection method to synthetic seismic datasets using Kimberlina model. The numerical results show that our leakage detection method accurately detects the leakage mass. Therefore, our novel CO2 leakage detection method has great potential for monitoring CO2 storage.

physics.geo-ph↗

Boiling, steaming or rinsing? (physics of the Chinese cuisine)

Some physical aspects of Chinese cuisine are discussed. We start from the cultural and historical particularities of the Chinese cuisine and technologies of food production. What is the difference between raw and boiled meat? What is the difference in the physical processes of heat transfer during steaming of dumplings and their cooking in boiling water? Why is it possible to cook meat stripes in a "hot pot" in ten seconds, while baking a turkey requires several hours? This article is devoted to discussion of these questions.

physics.pop-ph↗

Practical gigahertz quantum key distribution robust against channel disturbance

Quantum key distribution (QKD) provides an attractive solution for secure communication. However, channel disturbance severely limits its application when a QKD system is transfered from the laboratory to the field. Here, a high-speed Faraday-Sagnac-Michelson QKD system is proposed that can automatically compensate for the channel polarization disturbance, which largely avoids the intermittency limitations of environment mutation. Over a 50-km fiber channel with 30-Hz polarization scrambling, the practicality of this phase-coding QKD system was characterized with an interference fringe visibility of 99:35% over 24 hours, and a stable secure key rate of 306k bits/s over 7 days without active polarization alignment.

quant-ph↗

CosFace: Large Margin Cosine Loss for Deep Face Recognition

Face recognition has made extraordinary progress owing to the advancement of deep convolutional neural networks (CNNs). The central task of face recognition, including face verification and identification, involves face feature discrimination. However, the traditional softmax loss of deep CNNs usually lacks the power of discrimination. To address this problem, recently several loss functions such as center loss, large margin softmax loss, and angular softmax loss have been proposed. All these improved losses share the same idea: maximizing inter-class variance and minimizing intra-class variance. In this paper, we propose a novel loss function, namely large margin cosine loss (LMCL), to realize this idea from a different perspective. More specifically, we reformulate the softmax loss as a cosine loss by $L_2$ normalizing both features and weight vectors to remove radial variations, based on which a cosine margin term is introduced to further maximize the decision margin in the angular space. As a result, minimum intra-class variance and maximum inter-class variance are achieved by virtue of normalization and cosine decision margin maximization. We refer to our model trained with LMCL as CosFace. Extensive experimental evaluations are conducted on the most popular public-domain face recognition datasets such as MegaFace Challenge, Youtube Faces (YTF) and Labeled Face in the Wild (LFW). We achieve the state-of-the-art performance on these benchmarks, which confirms the effectiveness of our proposed approach.

cs.CV↗

Boundary-based Image Forgery Detection by Fast Shallow CNN

Image forgery detection is the task of detecting and localizing forged parts in tampered images. Previous works mostly focus on high resolution images using traces of resampling features, demosaicing features or sharpness of edges. However, a good detection method should also be applicable to low resolution images because compressed or resized images are common these days. To this end, we propose a Shallow Convolutional Neural Network(SCNN), capable of distinguishing the boundaries of forged regions from original edges in low resolution images. SCNN is designed to utilize the information of chroma and saturation. Based on SCNN, two approaches that are named Sliding Windows Detection (SWD) and Fast SCNN, respectively, are developed to detect and localize image forgery region. In this paper, we substantiate that Fast SCNN can detect drastic change of chroma and saturation. In image forgery detection experiments Our model is evaluated on the CASIA 2.0 dataset. The results show that Fast SCNN performs well on low resolution images and achieves significant improvements over the state-of-the-art.

cs.CV↗