Searcharxiv⌕ Search

arXiv subjects

Changjun Jiang

Publications and source records attributed to Changjun Jiang.

50 records · Page 3Linked to original sources

Upcycling Models under Domain and Category Shift

Deep neural networks (DNNs) often perform poorly in the presence of domain shift and category shift. How to upcycle DNNs and adapt them to the target task remains an important open problem. Unsupervised Domain Adaptation (UDA), especially recently proposed Source-free Domain Adaptation (SFDA), has become a promising technology to address this issue. Nevertheless, existing SFDA methods require that the source domain and target domain share the same label space, consequently being only applicable to the vanilla closed-set setting. In this paper, we take one step further and explore the Source-free Universal Domain Adaptation (SF-UniDA). The goal is to identify "known" data samples under both domain and category shift, and reject those "unknown" data samples (not present in source classes), with only the knowledge from standard pre-trained source model. To this end, we introduce an innovative global and local clustering learning technique (GLC). Specifically, we design a novel, adaptive one-vs-all global clustering algorithm to achieve the distinction across different target classes and introduce a local k-NN clustering strategy to alleviate negative transfer. We examine the superiority of our GLC on multiple benchmarks with different category shift scenarios, including partial-set, open-set, and open-partial-set DA. Remarkably, in the most challenging open-partial-set DA scenario, GLC outperforms UMAD by 14.8\% on the VisDA benchmark. The code is available at https://github.com/ispc-lab/GLC.

cs.CV↗

Modality-Agnostic Debiasing for Single Domain Generalization

Deep neural networks (DNNs) usually fail to generalize well to outside of distribution (OOD) data, especially in the extreme case of single domain generalization (single-DG) that transfers DNNs from single domain to multiple unseen domains. Existing single-DG techniques commonly devise various data-augmentation algorithms, and remould the multi-source domain generalization methodology to learn domain-generalized (semantic) features. Nevertheless, these methods are typically modality-specific, thereby being only applicable to one single modality (e.g., image). In contrast, we target a versatile Modality-Agnostic Debiasing (MAD) framework for single-DG, that enables generalization for different modalities. Technically, MAD introduces a novel two-branch classifier: a biased-branch encourages the classifier to identify the domain-specific (superficial) features, and a general-branch captures domain-generalized features based on the knowledge from biased-branch. Our MAD is appealing in view that it is pluggable to most single-DG models. We validate the superiority of our MAD in a variety of single-DG scenarios with different modalities, including recognition on 1D texts, 2D images, 3D point clouds, and semantic segmentation on 2D images. More remarkably, for recognition on 3D point clouds and semantic segmentation on 2D images, MAD improves DSU by 2.82\% and 1.5\% in accuracy and mIOU.

cs.CV↗

Unified Multimodal Model with Unlikelihood Training for Visual Dialog

The task of visual dialog requires a multimodal chatbot to answer sequential questions from humans about image content. Prior work performs the standard likelihood training for answer generation on the positive instances (involving correct answers). However, the likelihood objective often leads to frequent and dull outputs and fails to exploit the useful knowledge from negative instances (involving incorrect answers). In this paper, we propose a Unified Multimodal Model with UnLikelihood Training, named UniMM-UL, to tackle this problem. First, to improve visual dialog understanding and generation by multi-task learning, our model extends ViLBERT from only supporting answer discrimination to holding both answer discrimination and answer generation seamlessly by different attention masks. Specifically, in order to make the original discriminative model compatible with answer generation, we design novel generative attention masks to implement the autoregressive Masked Language Modeling (autoregressive MLM) task. And to attenuate the adverse effects of the likelihood objective, we exploit unlikelihood training on negative instances to make the model less likely to generate incorrect answers. Then, to utilize dense annotations, we adopt different fine-tuning methods for both generating and discriminating answers, rather than just for discriminating answers as in the prior work. Finally, on the VisDial dataset, our model achieves the best generative results (69.23 NDCG score). And our model also yields comparable discriminative results with the state-of-the-art in both single-model and ensemble settings (75.92 and 76.17 NDCG scores).

cs.CL↗

Giant efficiency of long-range orbital torque in Co/Nb bilayers

We report unambiguously experimental evidence of a strong orbital current in Nb films with weak spin-orbit coupling via the spin-torque ferromagnetic resonance (ST-FMR) spectrum for Fe/Nb and Co/Nb bilayers. The sign change of the damping-like torque in Co/Nb demonstrates a large spin-orbit correlation and thus great efficiency of orbital torque in Co/Nb. By studying the efficiency as a function of the thickness of Nb sublayer, we reveal a long orbital diffusion length (~3.1 nm) of Nb. Further planar Hall resistance (PHE) measurements at positive and negative applying current confirm the nonlocal orbital transport in ferromagnetic-metal/Nb heterostructures.

physics.app-ph↗

Nonreciprocal Multi-mode and Indirect Couplings in Cavity Magnonics

We investigate the magnon-photon couplings by employing a small magnet within an irregular resonant cavity, which leads to a desirable nonreciprocity with a big isolation ratio. Moreover, the higher-order couplings between the spin wave modes with the polarized photon modes also exhibit the nonreciprocity. These couplings between polarized photon and spin waves could be regarded as an indirect multi-modes coupling between the ferromagnetic resonance (FMR) mode and spin wave mode magnons mediated by the cavity mode photons. We also derive a coupling matrix to predict the characteristics of this kind of indirect coupling. The existence of the indirect couplings broaden the field range of the nonreciprocity of the system. The achieved nonreciprocal multi-mode magnon-photon couplings in a single system offer a feasible method to improve the signal transmission quality.

physics.app-ph↗

Nonreciprocal Emergence of Hybridized Magnons in magnetic thin Films

We investigate the transfer and control of nonreciprocity through magnons themselves in permalloy thin films deposited on surface oxide silicon substrate. Evidences of nonreciprocal emergence of hybridized dipole exchange magnons (spin waves) at two permalloy surfaces are provided by studying magnon transmission and asymmetry, via Brillouin light scattering measurements. The dipole dominated spin wave and exchange dominated spin wave are found to be localized near the top and bottom surfaces, respectively, and traveling along opposite directions. The nonreciprocity and the localization are intertwined and ca n be tuned by an in plane magnetic field. The effects are well explained by the magnetostatic theory and can be quantitatively reproduced by the micromagnetic simulations. Our findings provide a simple and flexible approach to nonreciprocal all magnon logi c devices with highly compatible with silicon based integrated circuit technology.

cond-mat.mes-hall↗

Modeling and Analysis of Three Properties of Mobile Interactive Systems Based on Variable Petri Nets

Due to the mobility and frequent disconnections, the correctness of mobile interaction systems, such as mobile robot systems and mobile payment systems, are often difficult to analyze. This paper introduces three critical properties of systems, called system connectivity, interaction soundness and data validity, and presents a related modeling and analysis method, based on a kind of Petri nets called VPN. For a given system, a model including component nets and interaction structure nets is constructed by using VPNs. The component net describes the internal process of each component, while the interaction structure net reflects the dynamic interaction between components. Based on this model, three properties are defined and analyzed. The case study of a practical mobile payment system shows the effectiveness of the proposed method.

eess.SY↗

Variable Petri Nets for Mobility

Mobile computing systems, service-based systems and some other systems with mobile interacting components have recently received much attention. However, because of their characteristics such as mobility and disconnection, it is difficult to model and analyze them by using a structure-fixed model. This work proposes a new Petri net model called Variable Petri Net (VPN) for modeling and analyzing these systems. The definition, firing rule, and related analysis technology of VPN are introduced in detail. In a VPN, the possible interaction interfaces are abstracted as a new kind of places called virtual places, and the occurrences of (dis)connections are described by new functions, which makes it appropriate to describe the component collaboration in systems and realize the scalability and pluggability of systems. Moreover, to overcome the shortcoming that markings cannot reflect link capability of a system, VPNs add a constraint function along with a marking to represent a complete system configuration. Several examples are used to demonstrate the newly proposed model and method.

cs.SE↗

Privately Information Sharing with Delusive Paths for Data Forwarding in Vehicular Networks

We discuss how to efficiently forward data in vehicular networks. Existing solutions do not make full use of trajectory planning of nearby vehicles, or social attributes. The development of onboard navigation system provides drivers some traveling route information. The main novelty of our approach is to envision sharing partial traveling information to the encountered vehicles for better service. Our data forwarding algorithm utilizes this lightweight information under the delusive paths privacy preservation together with the social community structure in vehicular networks. We assume that data transmission is carried by vehicles and road side units (RSUs), while cellular network manages and coordinates relevant global information. The approximate destination set is the set of RSUs that are often passed by the destination vehicle. RSU importance is raised by summing encounter ratios of RSUs in the same connected component. We first define a concept of space-time approachability which is derived from shared partial traveling route and encounter information. It describes the capability of a vehicle to advance messages toward destination. Then, we design a novel data forwarding algorithm, called approachability based algorithm, which combines the space-time approachability with the social community attribute in vehicular networks. We evaluate our approachability based algorithm on data sets from San Francisco Cabspotting and Shanghai Taxi Movement. Results show that the partially shared traveling information plays a positive role in data forwarding in vehicular networks. Approachability based data forwarding algorithm achieves a better performance than existing social based algorithms in vehicular networks.

cs.OH↗

Measuring Transport Difficulty of Data Dissemination in Large-Scale Online Social Networks: An Interest-Driven Case

In this paper, we aim to model the formation of data dissemination in online social networks (OSNs), and measure the transport difficulty of generated data traffic. We focus on a usual type of interest-driven social sessions in OSNs, called \emph{Social-InterestCast}, under which a user will autonomously determine whether to view the content from his followees depending on his interest. It is challenging to figure out the formation mechanism of such a Social-InterestCast, since it involves multiple interrelated factors such as users' social relationships, users' interests, and content semantics. We propose a four-layered system model, consisting of physical layer, social layer, content layer, and session layer. By this model we successfully obtain the geographical distribution of Social-InterestCast sessions, serving as the precondition for quantifying data transport difficulty. We define the fundamental limit of \emph{transport load} as a new metric, called \emph{transport complexity}, i.e., the \emph{minimum required} transport load for an OSN over a given carrier network. Specifically, we derive the transport complexity for Social-InterestCast sessions in a large-scale OSN over the carrier network with optimal communication architecture. The results can act as the common lower bounds on transport load for Social-InterestCast over any carrier networks. To the best of our knowledge, this is the first work to measure the transport difficulty for data dissemination in OSNs by modeling session patterns with the interest-driven characteristics.

cs.SI↗

STC: Coarse-Grained Vehicular Data Based Travel Speed Sensing by Leveraging Spatial-Temporal Correlation

As an important information for traffic condition evaluation, trip planning, transportation management, etc., average travel speed for a road means the average speed of vehicles travelling through this road in a given time duration. Traditional ways for collecting travel-speed oriented traffic data always depend on dedicated sensors and supporting infrastructures, and are therefore financial costly. Differently, vehicular crowdsensing as an infrastructure-free way, can be used to collect data including real-time locations and velocities of vehicles for road travel speed estimation, which is a quite low-cost way. However, vehicular crowdsensing data is always coarse-grained. This coarseness can lead to the incompleteness of travel speeds. Aiming to handle this problem as well as estimate travel speed accurately, in this paper, we propose an approach named STC that exploits the spatial-temporal correlation among travel speeds for roads by introducing the time-lagged cross correlation function. The time lagging factor describes the time consumption of traffic feature diffusion along roads. To properly calculate cross correlation, we novelly make the determination of the time lagging factor self-adaptive by recording the locations of vehicles at different roads. Then, utilizing the local stationarity of cross correlation, we further reduce the problem of single-road travel speed vacancy completion to a minimization problem. Finally, we fill all the vacancies of travel speed for roads in a recursive way using the geometric structure of road net. Elaborate experiments based on real taxi trace data show that STC can settle the incompleteness problem of vehicle crowdsensing data based travel speed estimation and ensure the accuracy of estimated travel speed better, in comparison with representative existing methods such as KNN, Kriging and ARIMA.

cs.OH↗

General Capacity for Deterministic Dissemination in Wireless Ad Hoc Networks

In this paper, we study capacity scaling laws of the deterministic dissemination (DD) in random wireless networks under the generalized physical model (GphyM). This is truly not a new topic. Our motivation to readdress this issue is two-fold: Firstly, we aim to propose a more general result to unify the network capacity for general homogeneous random models by investigating the impacts of different parameters of the system on the network capacity. Secondly, we target to close the open gaps between the upper and the lower bounds on the network capacity in the literature. The generality of this work lies in three aspects: (1) We study the homogeneous random network of a general node density $λ\in [1,n]$, rather than either random dense network (RDN, $λ=n$) or random extended network (REN, $λ=1$) as in the literature. (2) We address the general deterministic dissemination sessions, \ie, the general multicast sessions, which unify the capacities for unicast and broadcast sessions by setting the number of destinations for each session as a general value $n_d\in[1,n]$. (3) We allow the number of sessions to change in the range $n_s\in(1,n]$, instead of assuming that $n_s=Θ(n)$ as in the literature. We derive the general upper bounds on the capacity for the arbitrary case of $(λ, n_d, n_s)$ by introducing the Poisson Boolean model of continuum percolation, and prove that they are tight according to the existing general lower bounds constructed in the literature.

cs.IT↗

Rule Optimization for Real-Time Query Service in Software-Defined Internet of Vehicles

Internet of Vehicles (IoV) has recently gained considerable attentions from both industry and research communities since the development of communication technology and smart city. However, a proprietary and closed way of operating hardwares in network equipments slows down the progress of new services deployment and extension in IoV. Moreover, the tightly coupled control and data planes in traditional networks significantly increase the complexity and cost of network management. By proposing a novel architecture, called Software-Defined Internet of Vehicles (SDIV), we adopt the software-defined network (SDN) architecture to address these problems by leveraging its separation of the control plane from the data plane and a uniform way to configure heterogeneous switches. However, the characteristics of IoV introduce the very challenges in rule installation due to the limited size of Flow Tables at OpenFlow-enabled switches which are the main component of SDN. It is necessary to build compact Flow Tables for the scalability of IoV. Accordingly, we develop a rule optimization approach for real-time query service in SDIV. Specifically, we separate wired data plane from wireless data plane and use multicast address in wireless data plane. Furthermore, we introduce a destination-driven model in wired data plane for reducing the number of rules at switches. Experiments show that our rule optimization strategy reduces the number of rules while keeping the performance of data transmission.

cs.NI↗

Improving Data Forwarding in Mobile Social Networks with Infrastructure Support: A Space-Crossing Community Approach

In this paper, we study two tightly coupled issues: space-crossing community detection and its influence on data forwarding in Mobile Social Networks (MSNs) by taking the hybrid underlying networks with infrastructure support into consideration. The hybrid underlying network is composed of large numbers of mobile users and a small portion of Access Points (APs). Because APs can facilitate the communication among long-distance nodes, the concept of physical proximity community can be extended to be one across the geographical space. In this work, we first investigate a space-crossing community detection method for MSNs. Based on the detection results, we design a novel data forwarding algorithm SAAS (Social Attraction and AP Spreading), and show how to exploit the space-crossing communities to improve the data forwarding efficiency. We evaluate our SAAS algorithm on real-life data from MIT Reality Mining and UIM. Results show that space-crossing community plays a positive role in data forwarding in MSNs in terms of deliver ratio and delay. Based on this new type of community, SAAS achieves a better performance than existing social community-based data forwarding algorithms in practice, including Bubble Rap and Nguyen's Routing algorithms.

cs.SI↗