Search

Virtual reality (VR), while enhancing user experiences, introduces significant privacy risks. This paper reveals a novel vulnerability in VR systems that allows attackers to capture VR privacy through obstacles utilizing millimeter-wave (mmWave) signals without physical intrusion and virtual connection with the VR devices. We propose mmSpyVR, a novel attack on VR user's privacy via mmWave radar. The mmSpyVR framework encompasses two main parts: (i) A transfer learning-based feature extraction model to achieve VR feature extraction from mmWave signal. (ii) An attention-based VR privacy spying module to spy VR privacy information from the extracted feature. The mmSpyVR demonstrates the capability to extract critical VR privacy from the mmWave signals that have penetrated through obstacles. We evaluate mmSpyVR through IRB-approved user studies. Across 22 participants engaged in four experimental scenes utilizing VR devices from three different manufacturers, our system achieves an application recognition accuracy of 98.5\% and keystroke recognition accuracy of 92.6\%. This newly discovered vulnerability has implications across various domains, such as cybersecurity, privacy protection, and VR technology development. We also engage with VR manufacturer Meta to discuss and explore potential mitigation strategies. Data and code are publicly available for scrutiny and research at https://github.com/luoyumei1-a/mmSpyVR/

In this paper, we define double almost-Riordan arrays and find that the set of all double almost-Riordan arrays forms a group, called the double almost-Riordan group. We also obtain the sequence characteristics of double almost-Riordan arrays and give the production matrices for double almost-Riordan arrays. We define the compression of double almost-Riordan arrays and present their sequence characterization. Finally we give a characteristic for the total positivity of double Riordan arrays, by using which we discuss the total positivity for several double almost-Riordan arrays., Comment: 39 pages, 1 figure

In this paper the total positivity of quasi-Riordan arrays is investigated with use of the sequence characterization of quasi-Riordan arrays. Due to the correlation between quasi-Riordan arrays and Riordan arrays, this study is an in-depth discussion of the total positivity of Riordan arrays.

In this paper we study the total positivity of almost-Riordan arrays $(d(t)|\, g(t), f(t))$ and establish its necessary conditions and sufficient conditions, particularly, for some well used formal power series $d(t)$. We present a semidirect product of an almost-array and use it to transfer a total positivity problem for an almost-Riordan array to the total positivity problem for a quasi-Riordan array. We find the sequence characterization of total positivity of the almost-Riordan arrays. The production matrix $J$ of an almost-Riordan array $(d|\, g,f)$ is presented so that $J$ is totally positive implies the total positivity of both the almost-Riordan array $(d|\, g,f)$ and the Riordan array $(g,f)$. We also present a counterexample to illustrate that this sufficient condition is not necessary. If the production matrix $J$ is tridiagonal, then the expressions of its principal minors are given. By using expressions, we find a sufficient and necessary condition of the total positivity of almost-Riordan arrays with tridiagonal production matrices. A numerous examples are given to demonstrate our results.

Skeleton-based action representation learning aims to interpret and understand human behaviors by encoding the skeleton sequences, which can be categorized into two primary training paradigms: supervised learning and self-supervised learning. However, the former one-hot classification requires labor-intensive predefined action categories annotations, while the latter involves skeleton transformations (e.g., cropping) in the pretext tasks that may impair the skeleton structure. To address these challenges, we introduce a novel skeleton-based training framework (C$^2$VL) based on Cross-modal Contrastive learning that uses the progressive distillation to learn task-agnostic human skeleton action representation from the Vision-Language knowledge prompts. Specifically, we establish the vision-language action concept space through vision-language knowledge prompts generated by pre-trained large multimodal models (LMMs), which enrich the fine-grained details that the skeleton action space lacks. Moreover, we propose the intra-modal self-similarity and inter-modal cross-consistency softened targets in the cross-modal representation learning process to progressively control and guide the degree of pulling vision-language knowledge prompts and corresponding skeletons closer. These soft instance discrimination and self-knowledge distillation strategies contribute to the learning of better skeleton-based action representations from the noisy skeleton-vision-language pairs. During the inference phase, our method requires only the skeleton data as the input for action recognition and no longer for vision-language prompts. Extensive experiments on NTU RGB+D 60, NTU RGB+D 120, and PKU-MMD datasets demonstrate that our method outperforms the previous methods and achieves state-of-the-art results. Code is available at: https://github.com/cseeyangchen/C2VL., Comment: Accepted by IEEE Transactions on Multimedia

We prove that a Coxeter group containing an element of finite order, which is generated by two non-commuting involutions, can not be embedded into the Riordan group., Comment: 13 pages

In the social media, users frequently express personal emotions, a subset of which may indicate potential suicidal tendencies. The implicit and varied forms of expression in internet language complicate accurate and rapid identification of suicidal intent on social media, thus creating challenges for timely intervention efforts. The development of deep learning models for suicide risk detection is a promising solution, but there is a notable lack of relevant datasets, especially in the Chinese context. To address this gap, this study presents a Chinese social media dataset designed for fine-grained suicide risk classification, focusing on indicators such as expressions of suicide intent, methods of suicide, and urgency of timing. Seven pre-trained models were evaluated in two tasks: high and low suicide risk, and fine-grained suicide risk classification on a level of 0 to 10. In our experiments, deep learning models show good performance in distinguishing between high and low suicide risk, with the best model achieving an F1 score of 88.39%. However, the results for fine-grained suicide risk classification were still unsatisfactory, with an weighted F1 score of 50.89%. To address the issues of data imbalance and limited dataset size, we investigated both traditional and advanced, large language model based data augmentation techniques, demonstrating that data augmentation can enhance model performance by up to 4.65% points in F1-score. Notably, the Chinese MentalBERT model, which was pre-trained on psychological domain data, shows superior performance in both tasks. This study provides valuable insights for automatic identification of suicidal individuals, facilitating timely psychological intervention on social media platforms. The source code and data are publicly available.

Skeleton-based zero-shot action recognition aims to recognize unknown human actions based on the learned priors of the known skeleton-based actions and a semantic descriptor space shared by both known and unknown categories. However, previous works focus on establishing the bridges between the known skeleton representation space and semantic descriptions space at the coarse-grained level for recognizing unknown action categories, ignoring the fine-grained alignment of these two spaces, resulting in suboptimal performance in distinguishing high-similarity action categories. To address these challenges, we propose a novel method via Side information and dual-prompts learning for skeleton-based zero-shot action recognition (STAR) at the fine-grained level. Specifically, 1) we decompose the skeleton into several parts based on its topology structure and introduce the side information concerning multi-part descriptions of human body movements for alignment between the skeleton and the semantic space at the fine-grained level; 2) we design the visual-attribute and semantic-part prompts to improve the intra-class compactness within the skeleton space and inter-class separability within the semantic space, respectively, to distinguish the high-similarity actions. Extensive experiments show that our method achieves state-of-the-art performance in ZSL and GZSL settings on NTU RGB+D, NTU RGB+D 120, and PKU-MMD datasets., Comment: 11 pages, 5 figures

Flux jumps observed in high-$J_c$ Nb$_3$Sn conductors are urgent problems to construct high field superconducting magnets. The low-field instabilities usually reduce the current-carrying capability and thus cause the premature quench of Nb$_3$Sn coils at low magnetic field. In this paper, we explore suppressing the flux jumps by ferromagnetic (FM) layer. Firstly, we experimentally and theoretically investigate the flux jumps of Nb$_3$Sn/FM hybrid wires exposed to a magnetic field loop with constant sweeping rate. Comparing with bare Nb$_3$Sn and Nb$_3$Sn/Cu wires, we reveal two underlying mechanisms that the suppression of flux jumps is mainly attributed to the thermal effect of FM layer for the case of lower sweeping rate, whereas both thermal and electromagnetic effects play a crucial role for the case of higher sweeping rate. Furthermore, we explore the flux jumps of Nb$_3$Sn/FM hybrid wires exposed to AC magnetic fields with amplitude $B_{a0}$ and frequency $\rm\omega$. We build up the phase diagrams of flux jumps in the plane $\rm\omega$-$B_{a0}$ for bare Nb$_{3}$Sn wire, Nb$_{3}$Sn/Cu wire and Nb$_{3}$Sn/FM wire, respectively. We stress that the region of flux jumps of Nb$_{3}$Sn/FM wire is much smaller than the other two wires, which indicates that the Nb$_{3}$Sn/FM wire has significant advantage over merely increasing the heat capacity. The findings shed light on suppression of the flux jumps by utilizing FM materials, which is useful for developing new type of high-$J_c$ Nb$_{3}$Sn conductors.

We define the $m$th-order Eulerian numbers with a combinatorial interpretation. The recurrence relation of the $m$th-order Eulerian numbers, the row generating function and the row sums of the $m$th-order Eulerian triangle are presented. We also define the $m$th-order Eulerian fraction and its alternative form. Some properties of the $m$th-order Eulerian fractions are represented by using differentiation and integration. An inversion relationship between second-order Eulerian numbers and Stirling numbers of the second kind is given. Finally, we give the exact expression of the values of the $m$th-order Eulerian numbers.

Quantum effects in photosynthetic energy transport in nature, especially for the typical Fenna-Matthews-Olson (FMO) complexes, are extensively studied in quantum biology. Such energy transport processes can be investigated as open quantum systems that blend the quantum coherence and environmental noises, and have been experimentally simulated on a few quantum devices. However, the existing experiments always lack a solid quantum simulation for the FMO energy transport due to their constraints to map a variety of issues in actual FMO complexes that have rich biological meanings. Here we successfully map the full coupling profile of the seven-site FMO structure by comprehensive characterization and precise control of the evanescent coupling of the three-dimensional waveguide array. By applying a stochastic dynamical modulation on each waveguide, we introduce the base site energy and the dephasing term in colored noises to faithfully simulate the power spectral density of the FMO complexes. We show our photonic model well interprets the issues including the reorganization energy, vibrational assistance, exciton transfer and energy localization. We further experimentally demonstrate the existence of an optimal transport efficiency at certain dephasing strength, providing a window to closely investigate environment-assisted quantum transport.

In this paper, we present the adaptive physics-informed neural networks (PINNs) for resolving three dimensional (3D) dynamic thermo-mechanical coupling problems in large-size-ratio functionally graded materials (FGMs). The physical laws described by coupled governing equations and the constraints imposed by the initial and boundary conditions are leveraged to form the loss function of PINNs by means of the automatic differentiation algorithm, and an adaptive loss balancing scheme is introduced to improve the performance of PINNs. The adaptive PINNs are meshfree and trained on batches of randomly sampled collocation points, which is the key feature and superiority of the approach, since mesh-based methods will encounter difficulties in solving problems with large size ratios. The developed methodology is tested for several 3D thermo-mechanical coupling problems in large-size-ratio FGMs, and the numerical results demonstrate that the adaptive PINNs are effective and reliable for dealing with coupled problems in coating structures with large size ratios up to 109, as well as complex large-size-ratio geometries such as the electrostatic comb, the airplane and the submarine.

We study the divisibility of the sums of the odd power of consecutive integers, $S(m,k)=1^{mk}+2^{mk}+\cdots+k^{mk}$ and $1^k+2^k+\cdots+n^k$ for odd integers $m$ and $k$, by using the Girard-Waring identity. Faulhaber's approach for the divisibilities is discussed. Some expressions of power sums in terms of Stirling numbers of the second kind are represented.

The number of international benchmarking competitions is steadily increasing in various fields of machine learning (ML) research and practice. So far, however, little is known about the common practice as well as bottlenecks faced by the community in tackling the research questions posed. To shed light on the status quo of algorithm development in the specific field of biomedical imaging analysis, we designed an international survey that was issued to all participants of challenges conducted in conjunction with the IEEE ISBI 2021 and MICCAI 2021 conferences (80 competitions in total). The survey covered participants' expertise and working environments, their chosen strategies, as well as algorithm characteristics. A median of 72% challenge participants took part in the survey. According to our results, knowledge exchange was the primary incentive (70%) for participation, while the reception of prize money played only a minor role (16%). While a median of 80 working hours was spent on method development, a large portion of participants stated that they did not have enough time for method development (32%). 25% perceived the infrastructure to be a bottleneck. Overall, 94% of all solutions were deep learning-based. Of these, 84% were based on standard architectures. 43% of the respondents reported that the data samples (e.g., images) were too large to be processed at once. This was most commonly addressed by patch-based training (69%), downsampling (37%), and solving 3D analysis tasks as a series of 2D tasks. K-fold cross-validation on the training set was performed by only 37% of the participants and only 50% of the participants performed ensembling based on multiple identical models (61%) or heterogeneous models (39%). 48% of the respondents applied postprocessing steps.

A vertical recursive relation approach to Riordan arrays is induced, while the horizontal recursive relation is represented by $A$- and $Z$-sequences. This vertical recursive approach gives a way to represent the entries of a Riordan array $(g,f)$ in terms of a recursive linear combinations of the coefficients of $g$. A matrix representation of the vertical recursive relation is also given. The set of all those matrices forms a group, called the quasi-Riordan group. The extensions of the horizontal recursive relation and the vertical recursive relation in terms of $c$- and $C$- Riordan arrays are defined with illustrations by using the rook triangle and the Laguerre triangle. Those extensions represent a way to study nonlinear recursive relations of the entries of some triangular matrices from linear recursive relations of the entries of Riordan arrays. In addition, the matrix representation of the vertical recursive relation of Riordan arrays provides transforms between lower order and high order finite Riordan arrays, where the $m$th order Riordan array is defined by $(g,f)_m=(d_{n,k})_{m\geq n,k\geq 0}$. Furthermore, the vertical relation approach to Riordan arrays provides a unified approach to construct identities., Comment: 27 pages

In this study, we introduce an online public quantum computation platform, named as ScQ, based on a 1D array of a 10-qubit superconducting processor. Single-qubit rotation gates can be performed on each qubit. Controlled-NOT gates between nearest-neighbor sites on the 1D array of 10 qubits are available. We show the online preparation and verification of Greenberger-Horne-Zeilinger states of up to 10 qubits through this platform for all possible blocks of qubits in the chain. The graphical user interface and quantum assembly language methods are presented to achieve the above tasks, which rely on a parameter scanning feature implemented on ScQ. The performance of this quantum computation platform, such as fidelities of logic gates and details of the superconducting device, are presented.