Search

In this letter, we demonstrate for the first time the creation of Josephson-like superconducting nanojunctions using a thermal scanning probe to directly inscribe weak links into microstrips of YBa2Cu3O7-x (YBCO). Our method effectively reduces the critical current (Ic) over an order of magnitude. The resulting nanobridges exhibit clear evidence of Josephson effects, of SNS-type junctions, as shown by both the DC and AC Josephson effects. This approach provides a novel and flexible method for scaling up quantum mechanical circuits that operate at liquid nitrogen temperatures. Additionally, it offers a promising pathway for modifying properties of the junctions in-situ and post fabrication., Comment: 14 pages, 4 figures

Extending the well-studied concept of graphical regular representations to bipartite graphs, a Haar graphical representation (HGR) of a group $G$ is a bipartite graph whose automorphism group is isomorphic to $G$ and acts semiregularly with the orbits giving the bipartition. The question of which groups admit an HGR was inspired by a closely related question of Est\'elyi and Pisanski in 2016, as well as Babai's work in 1980 on poset representations, and has been recently solved by Morris and Spiga. In this paper, we introduce the $m$-Haar graphical representation ($m$-HGR) as a natural generalization of HGR to $m$-partite graphs for $m\geq2$, and explore the existence of $m$-HGRs for any fixed group. This inquiry represents a more robust version of the existence problem of G$m$SRs as addressed by Du, Feng and Spiga in 2020. Our main result is a complete classification of finite groups $G$ without $m$-HGRs.

To address the zero-shot temporal action localization (ZSTAL) task, existing works develop models that are generalizable to detect and classify actions from unseen categories. They typically develop a category-agnostic action detector and combine it with the Contrastive Language-Image Pre-training (CLIP) model to solve ZSTAL. However, these methods suffer from incomplete action proposals generated for \textit{unseen} categories, since they follow a frame-level prediction paradigm and require hand-crafted post-processing to generate action proposals. To address this problem, in this work, we propose a novel model named Generalizable Action Proposal generator (GAP), which can interface seamlessly with CLIP and generate action proposals in a holistic way. Our GAP is built in a query-based architecture and trained with a proposal-level objective, enabling it to estimate proposal completeness and eliminate the hand-crafted post-processing. Based on this architecture, we propose an Action-aware Discrimination loss to enhance the category-agnostic dynamic information of actions. Besides, we introduce a Static-Dynamic Rectifying module that incorporates the generalizable static information from CLIP to refine the predicted proposals, which improves proposal completeness in a generalizable manner. Our experiments show that our GAP achieves state-of-the-art performance on two challenging ZSTAL benchmarks, i.e., Thumos14 and ActivityNet1.3. Specifically, our model obtains significant performance improvement over previous works on the two benchmarks, i.e., +3.2% and +3.4% average mAP, respectively., Comment: Accepted to ICPR 2024. Code is available at https://github.com/Run542968/GAP

In this paper, we present a metamaterial structure of Dirac and vanadium dioxide and investigate its optical properties using the finite-difference time-domain (FDTD) technique. Using the phase transition feature of vanadium dioxide, the design can realize active tuning of the PIT effect at terahertz frequency, thereby converting from a single PIT to a double PIT. When VO$_2$ is in the insulating state, the structure is symmetric to obtain a single-band PIT effect; When VO$_2$ is in the metallic state, the structure turns asymmetric to realize a dual-band PIT effect. This design provides a reference direction for the design of actively tunable metamaterials. Additionally, it is discovered that the transparent window's resonant frequency and the Dirac material's Fermi level in this structure have a somewhat linear relationship. In addition, the structure achieves superior refractive index sensitivity in the terahertz band, surpassing 1 THz/RIU. Consequently, the concept exhibits encouraging potential for application in refractive index sensors and optical switches.

Video domain generalization aims to learn generalizable video classification models for unseen target domains by training in a source domain. A critical challenge of video domain generalization is to defend against the heavy reliance on domain-specific cues extracted from the source domain when recognizing target videos. To this end, we propose to perceive diverse spatial-temporal cues in videos, aiming to discover potential domain-invariant cues in addition to domain-specific cues. We contribute a novel model named Spatial-Temporal Diversification Network (STDN), which improves the diversity from both space and time dimensions of video data. First, our STDN proposes to discover various types of spatial cues within individual frames by spatial grouping. Then, our STDN proposes to explicitly model spatial-temporal dependencies between video contents at multiple space-time scales by spatial-temporal relation modeling. Extensive experiments on three benchmarks of different types demonstrate the effectiveness and versatility of our approach., Comment: Accepted to NeurIPS 2023. Code is available at https://github.com/KunyuLin/STDN/

In this work, we focus on the task of procedure planning from instructional videos with text supervision, where a model aims to predict an action sequence to transform the initial visual state into the goal visual state. A critical challenge of this task is the large semantic gap between observed visual states and unobserved intermediate actions, which is ignored by previous works. Specifically, this semantic gap refers to that the contents in the observed visual states are semantically different from the elements of some action text labels in a procedure. To bridge this semantic gap, we propose a novel event-guided paradigm, which first infers events from the observed states and then plans out actions based on both the states and predicted events. Our inspiration comes from that planning a procedure from an instructional video is to complete a specific event and a specific event usually involves specific actions. Based on the proposed paradigm, we contribute an Event-guided Prompting-based Procedure Planning (E3P) model, which encodes event information into the sequential modeling process to support procedure planning. To further consider the strong action associations within each event, our E3P adopts a mask-and-predict approach for relation mining, incorporating a probabilistic masking scheme for regularization. Extensive experiments on three datasets demonstrate the effectiveness of our proposed model., Comment: Accepted to ICCV 2023

Given a group $G$, an {\em $m$-Cayley digraph $\G$ over $G$} is a digraph that has a group of automorphisms isomorphic to $G$ acting semiregularly on the vertex set with $m$ orbits. We say that $G$ admits an {\em oriented $m$-semiregular representation} (O$m$SR for short), if there exists a regular $m$-Cayley digraph $\G$ over $G$ such that $\G$ is oriented and its automorphism group is isomorphic to $G$. In particular, O$1$SR is also named as ORR. Verret and Xia gave a classification of finite simple groups admitting an ORR of valency two in [Ars Math. Contemp. 22 (2022), \#P1.07]. Let $m\geq 2$ be an integer. In this paper, we show that all finite groups generated by at most two elements admit an O$m$SR of valency two except four groups of small orders. Consequently, a classification of finite simple groups admitting an O$m$SR of valency two is obtained.

A finite group $G$ admits an {\em oriented regular representation} if there exists a Cayley digraph of $G$ such that it has no digons and its automorphism group is isomorphic to $G$. Let $m$ be a positive integer. In this paper, we extend the notion of oriented regular representations to oriented $m$-semiregular representations using $m$-Cayley digraphs. Given a finite group $G$, an {\em $m$-Cayley digraph} of $G$ is a digraph that has a group of automorphisms isomorphic to $G$ acting semiregularly on the vertex set with $m$ orbits. We say that a finite group $G$ admits an {\em oriented $m$-semiregular representation} if there exists a regular $m$-Cayley digraph of $G$ such that it has no digons and $G$ is isomorphic to its automorphism group. In this paper, we classify finite groups admitting an oriented $m$-semiregular representation for each positive integer $m$., Comment: 15pages, 6 figures

Weakly Supervised Temporal Action Localization (WSTAL) aims to localize and classify action instances in long untrimmed videos with only video-level category labels. Due to the lack of snippet-level supervision for indicating action boundaries, previous methods typically assign pseudo labels for unlabeled snippets. However, since some action instances of different categories are visually similar, it is non-trivial to exactly label the (usually) one action category for a snippet, and incorrect pseudo labels would impair the localization performance. To address this problem, we propose a novel method from a category exclusion perspective, named Progressive Complementary Learning (ProCL), which gradually enhances the snippet-level supervision. Our method is inspired by the fact that video-level labels precisely indicate the categories that all snippets surely do not belong to, which is ignored by previous works. Accordingly, we first exclude these surely non-existent categories by a complementary learning loss. And then, we introduce the background-aware pseudo complementary labeling in order to exclude more categories for snippets of less ambiguity. Furthermore, for the remaining ambiguous snippets, we attempt to reduce the ambiguity by distinguishing foreground actions from the background. Extensive experimental results show that our method achieves new state-of-the-art performance on two popular benchmarks, namely THUMOS14 and ActivityNet1.3.